Mercurial > vim
annotate src/misc2.c @ 3602:a1de7928a7ab v7.3.561
updated for version 7.3.561
Problem: Using refresh: always in a complete function breaks the "."
command. (Val Markovic)
Solution: Add match leader to the redo buffer. (Yasuhiro Matsumoto)
| author | Bram Moolenaar <bram@vim.org> |
|---|---|
| date | Wed, 20 Jun 2012 14:26:35 +0200 |
| parents | cb2ae92ce106 |
| children | 286ba0251c0a |
| rev | line source |
|---|---|
| 7 | 1 /* vi:set ts=8 sts=4 sw=4: |
| 2 * | |
| 3 * VIM - Vi IMproved by Bram Moolenaar | |
| 4 * | |
| 5 * Do ":help uganda" in Vim to read copying and usage conditions. | |
| 6 * Do ":help credits" in Vim to see a list of people who contributed. | |
| 7 * See README.txt for an overview of the Vim source code. | |
| 8 */ | |
| 9 | |
| 10 /* | |
| 11 * misc2.c: Various functions. | |
| 12 */ | |
| 13 #include "vim.h" | |
| 14 | |
| 359 | 15 static char_u *username = NULL; /* cached result of mch_get_user_name() */ |
| 16 | |
| 17 static char_u *ff_expand_buffer = NULL; /* used for expanding filenames */ | |
| 18 | |
| 7 | 19 #if defined(FEAT_VIRTUALEDIT) || defined(PROTO) |
| 20 static int coladvance2 __ARGS((pos_T *pos, int addspaces, int finetune, colnr_T wcol)); | |
| 21 | |
| 22 /* | |
| 23 * Return TRUE if in the current mode we need to use virtual. | |
| 24 */ | |
| 25 int | |
| 26 virtual_active() | |
| 27 { | |
| 28 /* While an operator is being executed we return "virtual_op", because | |
| 29 * VIsual_active has already been reset, thus we can't check for "block" | |
| 30 * being used. */ | |
| 31 if (virtual_op != MAYBE) | |
| 32 return virtual_op; | |
| 33 return (ve_flags == VE_ALL | |
| 34 # ifdef FEAT_VISUAL | |
| 35 || ((ve_flags & VE_BLOCK) && VIsual_active && VIsual_mode == Ctrl_V) | |
| 36 # endif | |
| 37 || ((ve_flags & VE_INSERT) && (State & INSERT))); | |
| 38 } | |
| 39 | |
| 40 /* | |
| 41 * Get the screen position of the cursor. | |
| 42 */ | |
| 43 int | |
| 44 getviscol() | |
| 45 { | |
| 46 colnr_T x; | |
| 47 | |
| 48 getvvcol(curwin, &curwin->w_cursor, &x, NULL, NULL); | |
| 49 return (int)x; | |
| 50 } | |
| 51 | |
| 52 /* | |
| 53 * Get the screen position of character col with a coladd in the cursor line. | |
| 54 */ | |
| 55 int | |
| 56 getviscol2(col, coladd) | |
| 57 colnr_T col; | |
| 58 colnr_T coladd; | |
| 59 { | |
| 60 colnr_T x; | |
| 61 pos_T pos; | |
| 62 | |
| 63 pos.lnum = curwin->w_cursor.lnum; | |
| 64 pos.col = col; | |
| 65 pos.coladd = coladd; | |
| 66 getvvcol(curwin, &pos, &x, NULL, NULL); | |
| 67 return (int)x; | |
| 68 } | |
| 69 | |
| 70 /* | |
| 1209 | 71 * Go to column "wcol", and add/insert white space as necessary to get the |
| 7 | 72 * cursor in that column. |
| 73 * The caller must have saved the cursor line for undo! | |
| 74 */ | |
| 75 int | |
| 76 coladvance_force(wcol) | |
| 77 colnr_T wcol; | |
| 78 { | |
| 79 int rc = coladvance2(&curwin->w_cursor, TRUE, FALSE, wcol); | |
| 80 | |
| 81 if (wcol == MAXCOL) | |
| 82 curwin->w_valid &= ~VALID_VIRTCOL; | |
| 83 else | |
| 84 { | |
| 85 /* Virtcol is valid */ | |
| 86 curwin->w_valid |= VALID_VIRTCOL; | |
| 87 curwin->w_virtcol = wcol; | |
| 88 } | |
| 89 return rc; | |
| 90 } | |
| 91 #endif | |
| 92 | |
| 93 /* | |
| 94 * Try to advance the Cursor to the specified screen column. | |
| 95 * If virtual editing: fine tune the cursor position. | |
| 96 * Note that all virtual positions off the end of a line should share | |
| 97 * a curwin->w_cursor.col value (n.b. this is equal to STRLEN(line)), | |
| 98 * beginning at coladd 0. | |
| 99 * | |
| 100 * return OK if desired column is reached, FAIL if not | |
| 101 */ | |
| 102 int | |
| 103 coladvance(wcol) | |
| 104 colnr_T wcol; | |
| 105 { | |
| 106 int rc = getvpos(&curwin->w_cursor, wcol); | |
| 107 | |
| 108 if (wcol == MAXCOL || rc == FAIL) | |
| 109 curwin->w_valid &= ~VALID_VIRTCOL; | |
| 44 | 110 else if (*ml_get_cursor() != TAB) |
| 7 | 111 { |
| 44 | 112 /* Virtcol is valid when not on a TAB */ |
| 7 | 113 curwin->w_valid |= VALID_VIRTCOL; |
| 114 curwin->w_virtcol = wcol; | |
| 115 } | |
| 116 return rc; | |
| 117 } | |
| 118 | |
| 119 /* | |
| 120 * Return in "pos" the position of the cursor advanced to screen column "wcol". | |
| 121 * return OK if desired column is reached, FAIL if not | |
| 122 */ | |
| 123 int | |
| 124 getvpos(pos, wcol) | |
| 125 pos_T *pos; | |
| 126 colnr_T wcol; | |
| 127 { | |
| 128 #ifdef FEAT_VIRTUALEDIT | |
| 129 return coladvance2(pos, FALSE, virtual_active(), wcol); | |
| 130 } | |
| 131 | |
| 132 static int | |
| 133 coladvance2(pos, addspaces, finetune, wcol) | |
| 134 pos_T *pos; | |
| 135 int addspaces; /* change the text to achieve our goal? */ | |
| 1209 | 136 int finetune; /* change char offset for the exact column */ |
| 7 | 137 colnr_T wcol; /* column to move to */ |
| 138 { | |
| 139 #endif | |
| 140 int idx; | |
| 141 char_u *ptr; | |
| 142 char_u *line; | |
| 143 colnr_T col = 0; | |
| 144 int csize = 0; | |
| 145 int one_more; | |
| 146 #ifdef FEAT_LINEBREAK | |
| 147 int head = 0; | |
| 148 #endif | |
| 149 | |
| 772 | 150 one_more = (State & INSERT) |
| 151 || restart_edit != NUL | |
| 7 | 152 #ifdef FEAT_VISUAL |
| 772 | 153 || (VIsual_active && *p_sel != 'o') |
| 154 #endif | |
| 155 #ifdef FEAT_VIRTUALEDIT | |
| 782 | 156 || ((ve_flags & VE_ONEMORE) && wcol < MAXCOL) |
| 772 | 157 #endif |
| 158 ; | |
| 1982 | 159 line = ml_get_buf(curbuf, pos->lnum, FALSE); |
| 7 | 160 |
| 161 if (wcol >= MAXCOL) | |
| 162 { | |
| 163 idx = (int)STRLEN(line) - 1 + one_more; | |
| 164 col = wcol; | |
| 165 | |
| 166 #ifdef FEAT_VIRTUALEDIT | |
| 167 if ((addspaces || finetune) && !VIsual_active) | |
| 168 { | |
| 169 curwin->w_curswant = linetabsize(line) + one_more; | |
| 170 if (curwin->w_curswant > 0) | |
| 171 --curwin->w_curswant; | |
| 172 } | |
| 173 #endif | |
| 174 } | |
| 175 else | |
| 176 { | |
| 177 #ifdef FEAT_VIRTUALEDIT | |
| 178 int width = W_WIDTH(curwin) - win_col_off(curwin); | |
| 179 | |
| 620 | 180 if (finetune |
| 7 | 181 && curwin->w_p_wrap |
| 182 # ifdef FEAT_VERTSPLIT | |
| 183 && curwin->w_width != 0 | |
| 184 # endif | |
| 185 && wcol >= (colnr_T)width) | |
| 186 { | |
| 187 csize = linetabsize(line); | |
| 188 if (csize > 0) | |
| 189 csize--; | |
| 190 | |
| 620 | 191 if (wcol / width > (colnr_T)csize / width |
| 192 && ((State & INSERT) == 0 || (int)wcol > csize + 1)) | |
| 7 | 193 { |
| 194 /* In case of line wrapping don't move the cursor beyond the | |
| 620 | 195 * right screen edge. In Insert mode allow going just beyond |
| 196 * the last character (like what happens when typing and | |
| 197 * reaching the right window edge). */ | |
| 7 | 198 wcol = (csize / width + 1) * width - 1; |
| 199 } | |
| 200 } | |
| 201 #endif | |
| 202 | |
| 203 ptr = line; | |
| 204 while (col <= wcol && *ptr != NUL) | |
| 205 { | |
| 206 /* Count a tab for what it's worth (if list mode not on) */ | |
| 207 #ifdef FEAT_LINEBREAK | |
| 208 csize = win_lbr_chartabsize(curwin, ptr, col, &head); | |
| 39 | 209 mb_ptr_adv(ptr); |
| 7 | 210 #else |
| 211 csize = lbr_chartabsize_adv(&ptr, col); | |
| 212 #endif | |
| 213 col += csize; | |
| 214 } | |
| 215 idx = (int)(ptr - line); | |
| 216 /* | |
| 217 * Handle all the special cases. The virtual_active() check | |
| 218 * is needed to ensure that a virtual position off the end of | |
| 219 * a line has the correct indexing. The one_more comparison | |
| 220 * replaces an explicit add of one_more later on. | |
| 221 */ | |
| 222 if (col > wcol || (!virtual_active() && one_more == 0)) | |
| 223 { | |
| 224 idx -= 1; | |
| 225 # ifdef FEAT_LINEBREAK | |
| 226 /* Don't count the chars from 'showbreak'. */ | |
| 227 csize -= head; | |
| 228 # endif | |
| 229 col -= csize; | |
| 230 } | |
| 231 | |
| 232 #ifdef FEAT_VIRTUALEDIT | |
| 233 if (virtual_active() | |
| 234 && addspaces | |
| 235 && ((col != wcol && col != wcol + 1) || csize > 1)) | |
| 236 { | |
| 237 /* 'virtualedit' is set: The difference between wcol and col is | |
| 238 * filled with spaces. */ | |
| 239 | |
| 240 if (line[idx] == NUL) | |
| 241 { | |
| 242 /* Append spaces */ | |
| 243 int correct = wcol - col; | |
| 244 char_u *newline = alloc(idx + correct + 1); | |
| 245 int t; | |
| 246 | |
| 247 if (newline == NULL) | |
| 248 return FAIL; | |
| 249 | |
| 250 for (t = 0; t < idx; ++t) | |
| 251 newline[t] = line[t]; | |
| 252 | |
| 253 for (t = 0; t < correct; ++t) | |
| 254 newline[t + idx] = ' '; | |
| 255 | |
| 256 newline[idx + correct] = NUL; | |
| 257 | |
| 258 ml_replace(pos->lnum, newline, FALSE); | |
| 259 changed_bytes(pos->lnum, (colnr_T)idx); | |
| 260 idx += correct; | |
| 261 col = wcol; | |
| 262 } | |
| 263 else | |
| 264 { | |
| 265 /* Break a tab */ | |
| 266 int linelen = (int)STRLEN(line); | |
| 267 int correct = wcol - col - csize + 1; /* negative!! */ | |
| 840 | 268 char_u *newline; |
| 7 | 269 int t, s = 0; |
| 270 int v; | |
| 271 | |
| 840 | 272 if (-correct > csize) |
| 273 return FAIL; | |
| 274 | |
| 275 newline = alloc(linelen + csize); | |
| 276 if (newline == NULL) | |
| 7 | 277 return FAIL; |
| 278 | |
| 279 for (t = 0; t < linelen; t++) | |
| 280 { | |
| 281 if (t != idx) | |
| 282 newline[s++] = line[t]; | |
| 283 else | |
| 284 for (v = 0; v < csize; v++) | |
| 285 newline[s++] = ' '; | |
| 286 } | |
| 287 | |
| 288 newline[linelen + csize - 1] = NUL; | |
| 289 | |
| 290 ml_replace(pos->lnum, newline, FALSE); | |
| 291 changed_bytes(pos->lnum, idx); | |
| 292 idx += (csize - 1 + correct); | |
| 293 col += correct; | |
| 294 } | |
| 295 } | |
| 296 #endif | |
| 297 } | |
| 298 | |
| 299 if (idx < 0) | |
| 300 pos->col = 0; | |
| 301 else | |
| 302 pos->col = idx; | |
| 303 | |
| 304 #ifdef FEAT_VIRTUALEDIT | |
| 305 pos->coladd = 0; | |
| 306 | |
| 307 if (finetune) | |
| 308 { | |
| 309 if (wcol == MAXCOL) | |
| 310 { | |
| 311 /* The width of the last character is used to set coladd. */ | |
| 312 if (!one_more) | |
| 313 { | |
| 314 colnr_T scol, ecol; | |
| 315 | |
| 316 getvcol(curwin, pos, &scol, NULL, &ecol); | |
| 317 pos->coladd = ecol - scol; | |
| 318 } | |
| 319 } | |
| 320 else | |
| 321 { | |
| 322 int b = (int)wcol - (int)col; | |
| 323 | |
| 324 /* The difference between wcol and col is used to set coladd. */ | |
| 325 if (b > 0 && b < (MAXCOL - 2 * W_WIDTH(curwin))) | |
| 326 pos->coladd = b; | |
| 327 | |
| 328 col += b; | |
| 329 } | |
| 330 } | |
| 331 #endif | |
| 332 | |
| 333 #ifdef FEAT_MBYTE | |
| 1982 | 334 /* prevent from moving onto a trail byte */ |
| 7 | 335 if (has_mbyte) |
| 2933 | 336 mb_adjustpos(curbuf, pos); |
| 7 | 337 #endif |
| 338 | |
| 339 if (col < wcol) | |
| 340 return FAIL; | |
| 341 return OK; | |
| 342 } | |
| 343 | |
| 344 /* | |
| 1621 | 345 * Increment the cursor position. See inc() for return values. |
| 7 | 346 */ |
| 347 int | |
| 348 inc_cursor() | |
| 349 { | |
| 350 return inc(&curwin->w_cursor); | |
| 351 } | |
| 352 | |
| 1621 | 353 /* |
| 354 * Increment the line pointer "lp" crossing line boundaries as necessary. | |
| 355 * Return 1 when going to the next line. | |
| 356 * Return 2 when moving forward onto a NUL at the end of the line). | |
| 357 * Return -1 when at the end of file. | |
| 358 * Return 0 otherwise. | |
| 359 */ | |
| 7 | 360 int |
| 361 inc(lp) | |
| 362 pos_T *lp; | |
| 363 { | |
| 364 char_u *p = ml_get_pos(lp); | |
| 365 | |
| 366 if (*p != NUL) /* still within line, move to next char (may be NUL) */ | |
| 367 { | |
| 368 #ifdef FEAT_MBYTE | |
| 369 if (has_mbyte) | |
| 370 { | |
| 474 | 371 int l = (*mb_ptr2len)(p); |
| 7 | 372 |
| 373 lp->col += l; | |
| 374 return ((p[l] != NUL) ? 0 : 2); | |
| 375 } | |
| 376 #endif | |
| 377 lp->col++; | |
| 378 #ifdef FEAT_VIRTUALEDIT | |
| 379 lp->coladd = 0; | |
| 380 #endif | |
| 381 return ((p[1] != NUL) ? 0 : 2); | |
| 382 } | |
| 383 if (lp->lnum != curbuf->b_ml.ml_line_count) /* there is a next line */ | |
| 384 { | |
| 385 lp->col = 0; | |
| 386 lp->lnum++; | |
| 387 #ifdef FEAT_VIRTUALEDIT | |
| 388 lp->coladd = 0; | |
| 389 #endif | |
| 390 return 1; | |
| 391 } | |
| 392 return -1; | |
| 393 } | |
| 394 | |
| 395 /* | |
| 396 * incl(lp): same as inc(), but skip the NUL at the end of non-empty lines | |
| 397 */ | |
| 398 int | |
| 399 incl(lp) | |
| 400 pos_T *lp; | |
| 401 { | |
| 402 int r; | |
| 403 | |
| 404 if ((r = inc(lp)) >= 1 && lp->col) | |
| 405 r = inc(lp); | |
| 406 return r; | |
| 407 } | |
| 408 | |
| 409 /* | |
| 410 * dec(p) | |
| 411 * | |
| 412 * Decrement the line pointer 'p' crossing line boundaries as necessary. | |
| 413 * Return 1 when crossing a line, -1 when at start of file, 0 otherwise. | |
| 414 */ | |
| 415 int | |
| 416 dec_cursor() | |
| 417 { | |
| 418 return dec(&curwin->w_cursor); | |
| 419 } | |
| 420 | |
| 421 int | |
| 422 dec(lp) | |
| 423 pos_T *lp; | |
| 424 { | |
| 425 char_u *p; | |
| 426 | |
| 427 #ifdef FEAT_VIRTUALEDIT | |
| 428 lp->coladd = 0; | |
| 429 #endif | |
| 430 if (lp->col > 0) /* still within line */ | |
| 431 { | |
| 432 lp->col--; | |
| 433 #ifdef FEAT_MBYTE | |
| 434 if (has_mbyte) | |
| 435 { | |
| 436 p = ml_get(lp->lnum); | |
| 437 lp->col -= (*mb_head_off)(p, p + lp->col); | |
| 438 } | |
| 439 #endif | |
| 440 return 0; | |
| 441 } | |
| 442 if (lp->lnum > 1) /* there is a prior line */ | |
| 443 { | |
| 444 lp->lnum--; | |
| 445 p = ml_get(lp->lnum); | |
| 446 lp->col = (colnr_T)STRLEN(p); | |
| 447 #ifdef FEAT_MBYTE | |
| 448 if (has_mbyte) | |
| 449 lp->col -= (*mb_head_off)(p, p + lp->col); | |
| 450 #endif | |
| 451 return 1; | |
| 452 } | |
| 453 return -1; /* at start of file */ | |
| 454 } | |
| 455 | |
| 456 /* | |
| 457 * decl(lp): same as dec(), but skip the NUL at the end of non-empty lines | |
| 458 */ | |
| 459 int | |
| 460 decl(lp) | |
| 461 pos_T *lp; | |
| 462 { | |
| 463 int r; | |
| 464 | |
| 465 if ((r = dec(lp)) == 1 && lp->col) | |
| 466 r = dec(lp); | |
| 467 return r; | |
| 468 } | |
| 469 | |
| 470 /* | |
|
2178
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
471 * Get the line number relative to the current cursor position, i.e. the |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
472 * difference between line number and cursor position. Only look for lines that |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
473 * can be visible, folded lines don't count. |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
474 */ |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
475 linenr_T |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
476 get_cursor_rel_lnum(wp, lnum) |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
477 win_T *wp; |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
478 linenr_T lnum; /* line number to get the result for */ |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
479 { |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
480 linenr_T cursor = wp->w_cursor.lnum; |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
481 linenr_T retval = 0; |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
482 |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
483 #ifdef FEAT_FOLDING |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
484 if (hasAnyFolding(wp)) |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
485 { |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
486 if (lnum > cursor) |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
487 { |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
488 while (lnum > cursor) |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
489 { |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
490 (void)hasFolding(lnum, &lnum, NULL); |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
491 /* if lnum and cursor are in the same fold, |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
492 * now lnum <= cursor */ |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
493 if (lnum > cursor) |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
494 retval++; |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
495 lnum--; |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
496 } |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
497 } |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
498 else if (lnum < cursor) |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
499 { |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
500 while (lnum < cursor) |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
501 { |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
502 (void)hasFolding(lnum, NULL, &lnum); |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
503 /* if lnum and cursor are in the same fold, |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
504 * now lnum >= cursor */ |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
505 if (lnum < cursor) |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
506 retval--; |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
507 lnum++; |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
508 } |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
509 } |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
510 /* else if (lnum == cursor) |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
511 * retval = 0; |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
512 */ |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
513 } |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
514 else |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
515 #endif |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
516 retval = lnum - cursor; |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
517 |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
518 return retval; |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
519 } |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
520 |
|
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
521 /* |
| 7 | 522 * Make sure curwin->w_cursor.lnum is valid. |
| 523 */ | |
| 524 void | |
| 525 check_cursor_lnum() | |
| 526 { | |
| 527 if (curwin->w_cursor.lnum > curbuf->b_ml.ml_line_count) | |
| 528 { | |
| 529 #ifdef FEAT_FOLDING | |
| 530 /* If there is a closed fold at the end of the file, put the cursor in | |
| 531 * its first line. Otherwise in the last line. */ | |
| 532 if (!hasFolding(curbuf->b_ml.ml_line_count, | |
| 533 &curwin->w_cursor.lnum, NULL)) | |
| 534 #endif | |
| 535 curwin->w_cursor.lnum = curbuf->b_ml.ml_line_count; | |
| 536 } | |
| 537 if (curwin->w_cursor.lnum <= 0) | |
| 538 curwin->w_cursor.lnum = 1; | |
| 539 } | |
| 540 | |
| 541 /* | |
| 542 * Make sure curwin->w_cursor.col is valid. | |
| 543 */ | |
| 544 void | |
| 545 check_cursor_col() | |
| 546 { | |
| 2933 | 547 check_cursor_col_win(curwin); |
| 548 } | |
| 549 | |
| 550 /* | |
| 551 * Make sure win->w_cursor.col is valid. | |
| 552 */ | |
| 553 void | |
| 554 check_cursor_col_win(win) | |
| 555 win_T *win; | |
| 556 { | |
| 7 | 557 colnr_T len; |
| 558 #ifdef FEAT_VIRTUALEDIT | |
| 2933 | 559 colnr_T oldcol = win->w_cursor.col; |
| 560 colnr_T oldcoladd = win->w_cursor.col + win->w_cursor.coladd; | |
| 561 #endif | |
| 562 | |
| 563 len = (colnr_T)STRLEN(ml_get_buf(win->w_buffer, win->w_cursor.lnum, FALSE)); | |
| 7 | 564 if (len == 0) |
| 2933 | 565 win->w_cursor.col = 0; |
| 566 else if (win->w_cursor.col >= len) | |
| 7 | 567 { |
| 1488 | 568 /* Allow cursor past end-of-line when: |
| 569 * - in Insert mode or restarting Insert mode | |
| 570 * - in Visual mode and 'selection' isn't "old" | |
| 571 * - 'virtualedit' is set */ | |
| 620 | 572 if ((State & INSERT) || restart_edit |
| 7 | 573 #ifdef FEAT_VISUAL |
| 574 || (VIsual_active && *p_sel != 'o') | |
| 575 #endif | |
| 1488 | 576 #ifdef FEAT_VIRTUALEDIT |
| 577 || (ve_flags & VE_ONEMORE) | |
| 578 #endif | |
| 7 | 579 || virtual_active()) |
| 2933 | 580 win->w_cursor.col = len; |
| 7 | 581 else |
| 1099 | 582 { |
| 2933 | 583 win->w_cursor.col = len - 1; |
| 1099 | 584 #ifdef FEAT_MBYTE |
| 2933 | 585 /* Move the cursor to the head byte. */ |
| 1099 | 586 if (has_mbyte) |
| 2933 | 587 mb_adjustpos(win->w_buffer, &win->w_cursor); |
| 1099 | 588 #endif |
| 589 } | |
| 7 | 590 } |
| 2933 | 591 else if (win->w_cursor.col < 0) |
| 592 win->w_cursor.col = 0; | |
| 7 | 593 |
| 594 #ifdef FEAT_VIRTUALEDIT | |
| 595 /* If virtual editing is on, we can leave the cursor on the old position, | |
| 596 * only we must set it to virtual. But don't do it when at the end of the | |
| 597 * line. */ | |
| 598 if (oldcol == MAXCOL) | |
| 2933 | 599 win->w_cursor.coladd = 0; |
| 7 | 600 else if (ve_flags == VE_ALL) |
| 1841 | 601 { |
| 2933 | 602 if (oldcoladd > win->w_cursor.col) |
| 603 win->w_cursor.coladd = oldcoladd - win->w_cursor.col; | |
| 1841 | 604 else |
| 605 /* avoid weird number when there is a miscalculation or overflow */ | |
| 2933 | 606 win->w_cursor.coladd = 0; |
| 1841 | 607 } |
| 7 | 608 #endif |
| 609 } | |
| 610 | |
| 611 /* | |
| 612 * make sure curwin->w_cursor in on a valid character | |
| 613 */ | |
| 614 void | |
| 615 check_cursor() | |
| 616 { | |
| 617 check_cursor_lnum(); | |
| 618 check_cursor_col(); | |
| 619 } | |
| 620 | |
| 621 #if defined(FEAT_TEXTOBJ) || defined(PROTO) | |
| 622 /* | |
| 623 * Make sure curwin->w_cursor is not on the NUL at the end of the line. | |
| 624 * Allow it when in Visual mode and 'selection' is not "old". | |
| 625 */ | |
| 626 void | |
| 627 adjust_cursor_col() | |
| 628 { | |
| 629 if (curwin->w_cursor.col > 0 | |
| 630 # ifdef FEAT_VISUAL | |
| 631 && (!VIsual_active || *p_sel == 'o') | |
| 632 # endif | |
| 633 && gchar_cursor() == NUL) | |
| 634 --curwin->w_cursor.col; | |
| 635 } | |
| 636 #endif | |
| 637 | |
| 638 /* | |
| 639 * When curwin->w_leftcol has changed, adjust the cursor position. | |
| 640 * Return TRUE if the cursor was moved. | |
| 641 */ | |
| 642 int | |
| 643 leftcol_changed() | |
| 644 { | |
| 645 long lastcol; | |
| 646 colnr_T s, e; | |
| 647 int retval = FALSE; | |
| 648 | |
| 649 changed_cline_bef_curs(); | |
| 650 lastcol = curwin->w_leftcol + W_WIDTH(curwin) - curwin_col_off() - 1; | |
| 651 validate_virtcol(); | |
| 652 | |
| 653 /* | |
| 654 * If the cursor is right or left of the screen, move it to last or first | |
| 655 * character. | |
| 656 */ | |
| 657 if (curwin->w_virtcol > (colnr_T)(lastcol - p_siso)) | |
| 658 { | |
| 659 retval = TRUE; | |
| 660 coladvance((colnr_T)(lastcol - p_siso)); | |
| 661 } | |
| 662 else if (curwin->w_virtcol < curwin->w_leftcol + p_siso) | |
| 663 { | |
| 664 retval = TRUE; | |
| 665 (void)coladvance((colnr_T)(curwin->w_leftcol + p_siso)); | |
| 666 } | |
| 667 | |
| 668 /* | |
| 669 * If the start of the character under the cursor is not on the screen, | |
| 670 * advance the cursor one more char. If this fails (last char of the | |
| 671 * line) adjust the scrolling. | |
| 672 */ | |
| 673 getvvcol(curwin, &curwin->w_cursor, &s, NULL, &e); | |
| 674 if (e > (colnr_T)lastcol) | |
| 675 { | |
| 676 retval = TRUE; | |
| 677 coladvance(s - 1); | |
| 678 } | |
| 679 else if (s < curwin->w_leftcol) | |
| 680 { | |
| 681 retval = TRUE; | |
| 682 if (coladvance(e + 1) == FAIL) /* there isn't another character */ | |
| 683 { | |
| 684 curwin->w_leftcol = s; /* adjust w_leftcol instead */ | |
| 685 changed_cline_bef_curs(); | |
| 686 } | |
| 687 } | |
| 688 | |
| 689 if (retval) | |
| 690 curwin->w_set_curswant = TRUE; | |
| 691 redraw_later(NOT_VALID); | |
| 692 return retval; | |
| 693 } | |
| 694 | |
| 695 /********************************************************************** | |
| 696 * Various routines dealing with allocation and deallocation of memory. | |
| 697 */ | |
| 698 | |
| 699 #if defined(MEM_PROFILE) || defined(PROTO) | |
| 700 | |
| 701 # define MEM_SIZES 8200 | |
| 702 static long_u mem_allocs[MEM_SIZES]; | |
| 703 static long_u mem_frees[MEM_SIZES]; | |
| 704 static long_u mem_allocated; | |
| 705 static long_u mem_freed; | |
| 706 static long_u mem_peak; | |
| 707 static long_u num_alloc; | |
| 708 static long_u num_freed; | |
| 709 | |
| 710 static void mem_pre_alloc_s __ARGS((size_t *sizep)); | |
| 711 static void mem_pre_alloc_l __ARGS((long_u *sizep)); | |
| 712 static void mem_post_alloc __ARGS((void **pp, size_t size)); | |
| 713 static void mem_pre_free __ARGS((void **pp)); | |
| 714 | |
| 715 static void | |
| 716 mem_pre_alloc_s(sizep) | |
| 717 size_t *sizep; | |
| 718 { | |
| 719 *sizep += sizeof(size_t); | |
| 720 } | |
| 721 | |
| 722 static void | |
| 723 mem_pre_alloc_l(sizep) | |
| 724 long_u *sizep; | |
| 725 { | |
| 726 *sizep += sizeof(size_t); | |
| 727 } | |
| 728 | |
| 729 static void | |
| 730 mem_post_alloc(pp, size) | |
| 731 void **pp; | |
| 732 size_t size; | |
| 733 { | |
| 734 if (*pp == NULL) | |
| 735 return; | |
| 736 size -= sizeof(size_t); | |
| 737 *(long_u *)*pp = size; | |
| 738 if (size <= MEM_SIZES-1) | |
| 739 mem_allocs[size-1]++; | |
| 740 else | |
| 741 mem_allocs[MEM_SIZES-1]++; | |
| 742 mem_allocated += size; | |
| 743 if (mem_allocated - mem_freed > mem_peak) | |
| 744 mem_peak = mem_allocated - mem_freed; | |
| 745 num_alloc++; | |
| 746 *pp = (void *)((char *)*pp + sizeof(size_t)); | |
| 747 } | |
| 748 | |
| 749 static void | |
| 750 mem_pre_free(pp) | |
| 751 void **pp; | |
| 752 { | |
| 753 long_u size; | |
| 754 | |
| 755 *pp = (void *)((char *)*pp - sizeof(size_t)); | |
| 756 size = *(size_t *)*pp; | |
| 757 if (size <= MEM_SIZES-1) | |
| 758 mem_frees[size-1]++; | |
| 759 else | |
| 760 mem_frees[MEM_SIZES-1]++; | |
| 761 mem_freed += size; | |
| 762 num_freed++; | |
| 763 } | |
| 764 | |
| 765 /* | |
| 766 * called on exit via atexit() | |
| 767 */ | |
| 768 void | |
| 769 vim_mem_profile_dump() | |
| 770 { | |
| 771 int i, j; | |
| 772 | |
| 773 printf("\r\n"); | |
| 774 j = 0; | |
| 775 for (i = 0; i < MEM_SIZES - 1; i++) | |
| 776 { | |
| 777 if (mem_allocs[i] || mem_frees[i]) | |
| 778 { | |
| 779 if (mem_frees[i] > mem_allocs[i]) | |
| 780 printf("\r\n%s", _("ERROR: ")); | |
| 781 printf("[%4d / %4lu-%-4lu] ", i + 1, mem_allocs[i], mem_frees[i]); | |
| 782 j++; | |
| 783 if (j > 3) | |
| 784 { | |
| 785 j = 0; | |
| 786 printf("\r\n"); | |
| 787 } | |
| 788 } | |
| 789 } | |
| 790 | |
| 791 i = MEM_SIZES - 1; | |
| 792 if (mem_allocs[i]) | |
| 793 { | |
| 794 printf("\r\n"); | |
| 795 if (mem_frees[i] > mem_allocs[i]) | |
|
2545
298d8d6e69be
Avoid warnings from the clang compiler. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2522
diff
changeset
|
796 puts(_("ERROR: ")); |
| 7 | 797 printf("[>%d / %4lu-%-4lu]", i, mem_allocs[i], mem_frees[i]); |
| 798 } | |
| 799 | |
| 800 printf(_("\n[bytes] total alloc-freed %lu-%lu, in use %lu, peak use %lu\n"), | |
| 801 mem_allocated, mem_freed, mem_allocated - mem_freed, mem_peak); | |
| 802 printf(_("[calls] total re/malloc()'s %lu, total free()'s %lu\n\n"), | |
| 803 num_alloc, num_freed); | |
| 804 } | |
| 805 | |
| 806 #endif /* MEM_PROFILE */ | |
| 807 | |
| 808 /* | |
| 809 * Some memory is reserved for error messages and for being able to | |
| 810 * call mf_release_all(), which needs some memory for mf_trans_add(). | |
| 811 */ | |
| 812 #if defined(MSDOS) && !defined(DJGPP) | |
| 813 # define SMALL_MEM | |
| 814 # define KEEP_ROOM 8192L | |
| 815 #else | |
| 816 # define KEEP_ROOM (2 * 8192L) | |
| 817 #endif | |
| 818 | |
| 819 /* | |
| 1576 | 820 * Note: if unsigned is 16 bits we can only allocate up to 64K with alloc(). |
| 7 | 821 * Use lalloc for larger blocks. |
| 822 */ | |
| 823 char_u * | |
| 824 alloc(size) | |
| 825 unsigned size; | |
| 826 { | |
| 827 return (lalloc((long_u)size, TRUE)); | |
| 828 } | |
| 829 | |
| 830 /* | |
| 831 * Allocate memory and set all bytes to zero. | |
| 832 */ | |
| 833 char_u * | |
| 834 alloc_clear(size) | |
| 835 unsigned size; | |
| 836 { | |
| 837 char_u *p; | |
| 838 | |
|
2545
298d8d6e69be
Avoid warnings from the clang compiler. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2522
diff
changeset
|
839 p = lalloc((long_u)size, TRUE); |
| 7 | 840 if (p != NULL) |
| 841 (void)vim_memset(p, 0, (size_t)size); | |
| 842 return p; | |
| 843 } | |
| 844 | |
| 845 /* | |
| 846 * alloc() with check for maximum line length | |
| 847 */ | |
| 848 char_u * | |
| 849 alloc_check(size) | |
| 850 unsigned size; | |
| 851 { | |
| 852 #if !defined(UNIX) && !defined(__EMX__) | |
| 853 if (sizeof(int) == 2 && size > 0x7fff) | |
| 854 { | |
| 855 /* Don't hide this message */ | |
| 856 emsg_silent = 0; | |
| 857 EMSG(_("E340: Line is becoming too long")); | |
| 858 return NULL; | |
| 859 } | |
| 860 #endif | |
| 861 return (lalloc((long_u)size, TRUE)); | |
| 862 } | |
| 863 | |
| 864 /* | |
| 865 * Allocate memory like lalloc() and set all bytes to zero. | |
| 866 */ | |
| 867 char_u * | |
| 868 lalloc_clear(size, message) | |
| 869 long_u size; | |
| 870 int message; | |
| 871 { | |
| 872 char_u *p; | |
| 873 | |
| 874 p = (lalloc(size, message)); | |
| 875 if (p != NULL) | |
| 876 (void)vim_memset(p, 0, (size_t)size); | |
| 877 return p; | |
| 878 } | |
| 879 | |
| 880 /* | |
| 881 * Low level memory allocation function. | |
| 882 * This is used often, KEEP IT FAST! | |
| 883 */ | |
| 884 char_u * | |
| 885 lalloc(size, message) | |
| 886 long_u size; | |
| 887 int message; | |
| 888 { | |
| 889 char_u *p; /* pointer to new storage space */ | |
| 890 static int releasing = FALSE; /* don't do mf_release_all() recursive */ | |
| 891 int try_again; | |
| 892 #if defined(HAVE_AVAIL_MEM) && !defined(SMALL_MEM) | |
| 893 static long_u allocated = 0; /* allocated since last avail check */ | |
| 894 #endif | |
| 895 | |
| 896 /* Safety check for allocating zero bytes */ | |
| 897 if (size == 0) | |
| 898 { | |
| 899 /* Don't hide this message */ | |
| 900 emsg_silent = 0; | |
| 901 EMSGN(_("E341: Internal error: lalloc(%ld, )"), size); | |
| 902 return NULL; | |
| 903 } | |
| 904 | |
| 905 #ifdef MEM_PROFILE | |
| 906 mem_pre_alloc_l(&size); | |
| 907 #endif | |
| 908 | |
| 909 #if defined(MSDOS) && !defined(DJGPP) | |
| 910 if (size >= 0xfff0) /* in MSDOS we can't deal with >64K blocks */ | |
| 911 p = NULL; | |
| 912 else | |
| 913 #endif | |
| 914 | |
| 915 /* | |
| 916 * Loop when out of memory: Try to release some memfile blocks and | |
| 917 * if some blocks are released call malloc again. | |
| 918 */ | |
| 919 for (;;) | |
| 920 { | |
| 921 /* | |
| 922 * Handle three kind of systems: | |
| 923 * 1. No check for available memory: Just return. | |
| 924 * 2. Slow check for available memory: call mch_avail_mem() after | |
| 925 * allocating KEEP_ROOM amount of memory. | |
| 926 * 3. Strict check for available memory: call mch_avail_mem() | |
| 927 */ | |
| 928 if ((p = (char_u *)malloc((size_t)size)) != NULL) | |
| 929 { | |
| 930 #ifndef HAVE_AVAIL_MEM | |
| 931 /* 1. No check for available memory: Just return. */ | |
| 932 goto theend; | |
| 933 #else | |
| 934 # ifndef SMALL_MEM | |
| 935 /* 2. Slow check for available memory: call mch_avail_mem() after | |
| 936 * allocating (KEEP_ROOM / 2) amount of memory. */ | |
| 937 allocated += size; | |
| 938 if (allocated < KEEP_ROOM / 2) | |
| 939 goto theend; | |
| 940 allocated = 0; | |
| 941 # endif | |
| 942 /* 3. check for available memory: call mch_avail_mem() */ | |
| 943 if (mch_avail_mem(TRUE) < KEEP_ROOM && !releasing) | |
| 944 { | |
| 1737 | 945 free((char *)p); /* System is low... no go! */ |
| 7 | 946 p = NULL; |
| 947 } | |
| 948 else | |
| 949 goto theend; | |
| 950 #endif | |
| 951 } | |
| 952 /* | |
| 953 * Remember that mf_release_all() is being called to avoid an endless | |
| 954 * loop, because mf_release_all() may call alloc() recursively. | |
| 955 */ | |
| 956 if (releasing) | |
| 957 break; | |
| 958 releasing = TRUE; | |
| 448 | 959 |
| 960 clear_sb_text(); /* free any scrollback text */ | |
| 961 try_again = mf_release_all(); /* release as many blocks as possible */ | |
| 370 | 962 #ifdef FEAT_EVAL |
| 448 | 963 try_again |= garbage_collect(); /* cleanup recursive lists/dicts */ |
| 964 #endif | |
| 965 | |
| 7 | 966 releasing = FALSE; |
| 967 if (!try_again) | |
| 968 break; | |
| 969 } | |
| 970 | |
| 971 if (message && p == NULL) | |
| 972 do_outofmem_msg(size); | |
| 973 | |
| 974 theend: | |
| 975 #ifdef MEM_PROFILE | |
| 976 mem_post_alloc((void **)&p, (size_t)size); | |
| 977 #endif | |
| 978 return p; | |
| 979 } | |
| 980 | |
| 981 #if defined(MEM_PROFILE) || defined(PROTO) | |
| 982 /* | |
| 983 * realloc() with memory profiling. | |
| 984 */ | |
| 985 void * | |
| 986 mem_realloc(ptr, size) | |
| 987 void *ptr; | |
| 988 size_t size; | |
| 989 { | |
| 990 void *p; | |
| 991 | |
| 992 mem_pre_free(&ptr); | |
| 993 mem_pre_alloc_s(&size); | |
| 994 | |
| 995 p = realloc(ptr, size); | |
| 996 | |
| 997 mem_post_alloc(&p, size); | |
| 998 | |
| 999 return p; | |
| 1000 } | |
| 1001 #endif | |
| 1002 | |
| 1003 /* | |
| 1004 * Avoid repeating the error message many times (they take 1 second each). | |
| 1005 * Did_outofmem_msg is reset when a character is read. | |
| 1006 */ | |
| 1007 void | |
| 1008 do_outofmem_msg(size) | |
| 1009 long_u size; | |
| 1010 { | |
| 1011 if (!did_outofmem_msg) | |
| 1012 { | |
| 1013 /* Don't hide this message */ | |
| 1014 emsg_silent = 0; | |
| 3156 | 1015 |
| 1016 /* Must come first to avoid coming back here when printing the error | |
| 1017 * message fails, e.g. when setting v:errmsg. */ | |
| 1018 did_outofmem_msg = TRUE; | |
| 1019 | |
| 7 | 1020 EMSGN(_("E342: Out of memory! (allocating %lu bytes)"), size); |
| 1021 } | |
| 1022 } | |
| 1023 | |
| 356 | 1024 #if defined(EXITFREE) || defined(PROTO) |
| 359 | 1025 |
| 1026 # if defined(FEAT_SEARCHPATH) | |
| 1027 static void free_findfile __ARGS((void)); | |
| 1028 # endif | |
| 1029 | |
| 356 | 1030 /* |
| 1031 * Free everything that we allocated. | |
| 1032 * Can be used to detect memory leaks, e.g., with ccmalloc. | |
| 359 | 1033 * NOTE: This is tricky! Things are freed that functions depend on. Don't be |
| 1034 * surprised if Vim crashes... | |
| 1035 * Some things can't be freed, esp. things local to a library function. | |
| 356 | 1036 */ |
| 1037 void | |
| 1038 free_all_mem() | |
| 1039 { | |
| 1040 buf_T *buf, *nextbuf; | |
| 359 | 1041 static int entered = FALSE; |
| 1042 | |
| 1043 /* When we cause a crash here it is caught and Vim tries to exit cleanly. | |
| 1044 * Don't try freeing everything again. */ | |
| 1045 if (entered) | |
| 1046 return; | |
| 1047 entered = TRUE; | |
| 356 | 1048 |
| 1446 | 1049 # ifdef FEAT_AUTOCMD |
| 1410 | 1050 block_autocmds(); /* don't want to trigger autocommands here */ |
| 1446 | 1051 # endif |
| 1052 | |
| 1053 # ifdef FEAT_WINDOWS | |
|
2363
acbb3a9ccc07
Avoid error when exiting in diff mode with EXITFREE defined.
Bram Moolenaar <bram@vim.org>
parents:
2360
diff
changeset
|
1054 /* Close all tabs and windows. Reset 'equalalways' to avoid redraws. */ |
|
acbb3a9ccc07
Avoid error when exiting in diff mode with EXITFREE defined.
Bram Moolenaar <bram@vim.org>
parents:
2360
diff
changeset
|
1055 p_ea = FALSE; |
| 766 | 1056 if (first_tabpage->tp_next != NULL) |
| 1057 do_cmdline_cmd((char_u *)"tabonly!"); | |
| 1058 if (firstwin != lastwin) | |
| 1059 do_cmdline_cmd((char_u *)"only!"); | |
| 1446 | 1060 # endif |
| 673 | 1061 |
| 741 | 1062 # if defined(FEAT_SPELL) |
| 356 | 1063 /* Free all spell info. */ |
| 1064 spell_free_all(); | |
| 1065 # endif | |
| 1066 | |
| 359 | 1067 # if defined(FEAT_USR_CMDS) |
| 356 | 1068 /* Clear user commands (before deleting buffers). */ |
| 1069 ex_comclear(NULL); | |
| 359 | 1070 # endif |
| 356 | 1071 |
| 1072 # ifdef FEAT_MENU | |
| 1073 /* Clear menus. */ | |
| 1074 do_cmdline_cmd((char_u *)"aunmenu *"); | |
| 1993 | 1075 # ifdef FEAT_MULTI_LANG |
| 1076 do_cmdline_cmd((char_u *)"menutranslate clear"); | |
| 1077 # endif | |
| 356 | 1078 # endif |
| 1079 | |
| 359 | 1080 /* Clear mappings, abbreviations, breakpoints. */ |
| 1993 | 1081 do_cmdline_cmd((char_u *)"lmapclear"); |
| 1082 do_cmdline_cmd((char_u *)"xmapclear"); | |
| 356 | 1083 do_cmdline_cmd((char_u *)"mapclear"); |
| 1084 do_cmdline_cmd((char_u *)"mapclear!"); | |
| 1085 do_cmdline_cmd((char_u *)"abclear"); | |
| 359 | 1086 # if defined(FEAT_EVAL) |
| 1087 do_cmdline_cmd((char_u *)"breakdel *"); | |
| 1088 # endif | |
| 362 | 1089 # if defined(FEAT_PROFILE) |
| 1090 do_cmdline_cmd((char_u *)"profdel *"); | |
| 1091 # endif | |
| 1828 | 1092 # if defined(FEAT_KEYMAP) |
| 1093 do_cmdline_cmd((char_u *)"set keymap="); | |
| 1094 #endif | |
| 359 | 1095 |
| 1096 # ifdef FEAT_TITLE | |
| 1097 free_titles(); | |
| 1098 # endif | |
| 1099 # if defined(FEAT_SEARCHPATH) | |
| 1100 free_findfile(); | |
| 1101 # endif | |
| 356 | 1102 |
| 1103 /* Obviously named calls. */ | |
| 1104 # if defined(FEAT_AUTOCMD) | |
| 1105 free_all_autocmds(); | |
| 1106 # endif | |
| 1107 clear_termcodes(); | |
| 359 | 1108 free_all_options(); |
| 1109 free_all_marks(); | |
| 1110 alist_clear(&global_alist); | |
| 1111 free_homedir(); | |
| 1112 free_search_patterns(); | |
| 1113 free_old_sub(); | |
| 1114 free_last_insert(); | |
| 1115 free_prev_shellcmd(); | |
| 1116 free_regexp_stuff(); | |
| 1117 free_tag_stuff(); | |
| 1118 free_cd_dir(); | |
| 1828 | 1119 # ifdef FEAT_SIGNS |
| 1120 free_signs(); | |
| 1121 # endif | |
| 1446 | 1122 # ifdef FEAT_EVAL |
| 359 | 1123 set_expr_line(NULL); |
| 1446 | 1124 # endif |
| 1125 # ifdef FEAT_DIFF | |
| 673 | 1126 diff_clear(curtab); |
| 1446 | 1127 # endif |
| 626 | 1128 clear_sb_text(); /* free any scrollback text */ |
| 359 | 1129 |
| 1130 /* Free some global vars. */ | |
| 1131 vim_free(username); | |
| 1422 | 1132 # ifdef FEAT_CLIPBOARD |
| 359 | 1133 vim_free(clip_exclude_prog); |
| 1422 | 1134 # endif |
| 359 | 1135 vim_free(last_cmdline); |
| 1446 | 1136 # ifdef FEAT_CMDHIST |
| 359 | 1137 vim_free(new_last_cmdline); |
| 1446 | 1138 # endif |
| 680 | 1139 set_keep_msg(NULL, 0); |
| 359 | 1140 vim_free(ff_expand_buffer); |
| 356 | 1141 |
| 1142 /* Clear cmdline history. */ | |
| 1143 p_hi = 0; | |
| 1446 | 1144 # ifdef FEAT_CMDHIST |
| 356 | 1145 init_history(); |
| 1446 | 1146 # endif |
| 356 | 1147 |
| 359 | 1148 #ifdef FEAT_QUICKFIX |
| 1446 | 1149 { |
| 1863 | 1150 win_T *win; |
| 1151 tabpage_T *tab; | |
| 1446 | 1152 |
| 1153 qf_free_all(NULL); | |
| 1154 /* Free all location lists */ | |
| 1863 | 1155 FOR_ALL_TAB_WINDOWS(tab, win) |
| 1446 | 1156 qf_free_all(win); |
| 1157 } | |
| 359 | 1158 #endif |
| 1159 | |
| 1160 /* Close all script inputs. */ | |
| 1161 close_all_scripts(); | |
| 1162 | |
| 1163 #if defined(FEAT_WINDOWS) | |
| 1164 /* Destroy all windows. Must come before freeing buffers. */ | |
| 1165 win_free_all(); | |
| 1166 #endif | |
| 1167 | |
| 1576 | 1168 /* Free all buffers. Reset 'autochdir' to avoid accessing things that |
| 1169 * were freed already. */ | |
| 1170 #ifdef FEAT_AUTOCHDIR | |
| 1171 p_acd = FALSE; | |
| 1172 #endif | |
| 356 | 1173 for (buf = firstbuf; buf != NULL; ) |
| 1174 { | |
| 1175 nextbuf = buf->b_next; | |
| 3365 | 1176 close_buffer(NULL, buf, DOBUF_WIPE, FALSE); |
| 356 | 1177 if (buf_valid(buf)) |
| 1178 buf = nextbuf; /* didn't work, try next one */ | |
| 1179 else | |
| 1180 buf = firstbuf; | |
| 1181 } | |
| 1182 | |
| 359 | 1183 #ifdef FEAT_ARABIC |
| 1184 free_cmdline_buf(); | |
| 356 | 1185 #endif |
| 1186 | |
| 1187 /* Clear registers. */ | |
| 1188 clear_registers(); | |
| 1189 ResetRedobuff(); | |
| 1190 ResetRedobuff(); | |
| 1191 | |
| 1071 | 1192 #if defined(FEAT_CLIENTSERVER) && defined(FEAT_X11) |
| 359 | 1193 vim_free(serverDelayedStartName); |
| 1194 #endif | |
| 1195 | |
| 356 | 1196 /* highlight info */ |
| 1197 free_highlight(); | |
| 1198 | |
| 362 | 1199 reset_last_sourcing(); |
| 1200 | |
| 766 | 1201 #ifdef FEAT_WINDOWS |
| 853 | 1202 free_tabpage(first_tabpage); |
| 1203 first_tabpage = NULL; | |
| 766 | 1204 #endif |
| 1205 | |
| 356 | 1206 # ifdef UNIX |
| 1207 /* Machine-specific free. */ | |
| 1208 mch_free_mem(); | |
| 1209 # endif | |
| 1210 | |
| 1211 /* message history */ | |
| 1212 for (;;) | |
| 1213 if (delete_first_msg() == FAIL) | |
| 1214 break; | |
| 1215 | |
| 1216 # ifdef FEAT_EVAL | |
| 1217 eval_clear(); | |
| 1218 # endif | |
| 1219 | |
| 359 | 1220 free_termoptions(); |
| 1221 | |
| 356 | 1222 /* screenlines (can't display anything now!) */ |
| 1223 free_screenlines(); | |
| 1224 | |
| 1225 #if defined(USE_XSMP) | |
| 1226 xsmp_close(); | |
| 1227 #endif | |
| 359 | 1228 #ifdef FEAT_GUI_GTK |
| 1229 gui_mch_free_all(); | |
| 1230 #endif | |
| 1231 clear_hl_tables(); | |
| 356 | 1232 |
| 1233 vim_free(IObuff); | |
| 1234 vim_free(NameBuff); | |
| 1235 } | |
| 1236 #endif | |
| 1237 | |
| 7 | 1238 /* |
| 2656 | 1239 * Copy "string" into newly allocated memory. |
| 7 | 1240 */ |
| 1241 char_u * | |
| 1242 vim_strsave(string) | |
| 1243 char_u *string; | |
| 1244 { | |
| 1245 char_u *p; | |
| 1246 unsigned len; | |
| 1247 | |
| 1248 len = (unsigned)STRLEN(string) + 1; | |
| 1249 p = alloc(len); | |
| 1250 if (p != NULL) | |
| 1251 mch_memmove(p, string, (size_t)len); | |
| 1252 return p; | |
| 1253 } | |
| 1254 | |
| 2656 | 1255 /* |
| 1256 * Copy up to "len" bytes of "string" into newly allocated memory and | |
| 1257 * terminate with a NUL. | |
| 1258 * The allocated memory always has size "len + 1", also when "string" is | |
| 1259 * shorter. | |
| 1260 */ | |
| 7 | 1261 char_u * |
| 1262 vim_strnsave(string, len) | |
| 1263 char_u *string; | |
| 1264 int len; | |
| 1265 { | |
| 1266 char_u *p; | |
| 1267 | |
| 1268 p = alloc((unsigned)(len + 1)); | |
| 1269 if (p != NULL) | |
| 1270 { | |
| 1271 STRNCPY(p, string, len); | |
| 1272 p[len] = NUL; | |
| 1273 } | |
| 1274 return p; | |
| 1275 } | |
| 1276 | |
| 1277 /* | |
| 1278 * Same as vim_strsave(), but any characters found in esc_chars are preceded | |
| 1279 * by a backslash. | |
| 1280 */ | |
| 1281 char_u * | |
| 1282 vim_strsave_escaped(string, esc_chars) | |
| 1283 char_u *string; | |
| 1284 char_u *esc_chars; | |
| 1285 { | |
| 16 | 1286 return vim_strsave_escaped_ext(string, esc_chars, '\\', FALSE); |
| 7 | 1287 } |
| 1288 | |
| 1289 /* | |
| 1290 * Same as vim_strsave_escaped(), but when "bsl" is TRUE also escape | |
| 1291 * characters where rem_backslash() would remove the backslash. | |
| 16 | 1292 * Escape the characters with "cc". |
| 7 | 1293 */ |
| 1294 char_u * | |
| 16 | 1295 vim_strsave_escaped_ext(string, esc_chars, cc, bsl) |
| 7 | 1296 char_u *string; |
| 1297 char_u *esc_chars; | |
| 16 | 1298 int cc; |
| 7 | 1299 int bsl; |
| 1300 { | |
| 1301 char_u *p; | |
| 1302 char_u *p2; | |
| 1303 char_u *escaped_string; | |
| 1304 unsigned length; | |
| 1305 #ifdef FEAT_MBYTE | |
| 1306 int l; | |
| 1307 #endif | |
| 1308 | |
| 1309 /* | |
| 1310 * First count the number of backslashes required. | |
| 1311 * Then allocate the memory and insert them. | |
| 1312 */ | |
| 1313 length = 1; /* count the trailing NUL */ | |
| 1314 for (p = string; *p; p++) | |
| 1315 { | |
| 1316 #ifdef FEAT_MBYTE | |
| 474 | 1317 if (has_mbyte && (l = (*mb_ptr2len)(p)) > 1) |
| 7 | 1318 { |
| 1319 length += l; /* count a multibyte char */ | |
| 1320 p += l - 1; | |
| 1321 continue; | |
| 1322 } | |
| 1323 #endif | |
| 1324 if (vim_strchr(esc_chars, *p) != NULL || (bsl && rem_backslash(p))) | |
| 1325 ++length; /* count a backslash */ | |
| 1326 ++length; /* count an ordinary char */ | |
| 1327 } | |
| 1328 escaped_string = alloc(length); | |
| 1329 if (escaped_string != NULL) | |
| 1330 { | |
| 1331 p2 = escaped_string; | |
| 1332 for (p = string; *p; p++) | |
| 1333 { | |
| 1334 #ifdef FEAT_MBYTE | |
| 474 | 1335 if (has_mbyte && (l = (*mb_ptr2len)(p)) > 1) |
| 7 | 1336 { |
| 1337 mch_memmove(p2, p, (size_t)l); | |
| 1338 p2 += l; | |
| 1339 p += l - 1; /* skip multibyte char */ | |
| 1340 continue; | |
| 1341 } | |
| 1342 #endif | |
| 1343 if (vim_strchr(esc_chars, *p) != NULL || (bsl && rem_backslash(p))) | |
| 16 | 1344 *p2++ = cc; |
| 7 | 1345 *p2++ = *p; |
| 1346 } | |
| 1347 *p2 = NUL; | |
| 1348 } | |
| 1349 return escaped_string; | |
| 1350 } | |
| 1351 | |
| 1685 | 1352 /* |
| 1353 * Return TRUE when 'shell' has "csh" in the tail. | |
| 1354 */ | |
| 1355 int | |
| 1356 csh_like_shell() | |
| 1357 { | |
| 1358 return (strstr((char *)gettail(p_sh), "csh") != NULL); | |
| 1359 } | |
| 1712 | 1360 |
| 985 | 1361 /* |
| 1362 * Escape "string" for use as a shell argument with system(). | |
| 1993 | 1363 * This uses single quotes, except when we know we need to use double quotes |
| 985 | 1364 * (MS-DOS and MS-Windows without 'shellslash' set). |
| 1673 | 1365 * Escape a newline, depending on the 'shell' option. |
| 1366 * When "do_special" is TRUE also replace "!", "%", "#" and things starting | |
| 1367 * with "<" like "<cfile>". | |
| 985 | 1368 * Returns the result in allocated memory, NULL if we have run out. |
| 1369 */ | |
| 1370 char_u * | |
| 1661 | 1371 vim_strsave_shellescape(string, do_special) |
| 985 | 1372 char_u *string; |
| 1661 | 1373 int do_special; |
| 985 | 1374 { |
| 1375 unsigned length; | |
| 1376 char_u *p; | |
| 1377 char_u *d; | |
| 1378 char_u *escaped_string; | |
| 1661 | 1379 int l; |
| 1673 | 1380 int csh_like; |
| 1381 | |
| 1382 /* Only csh and similar shells expand '!' within single quotes. For sh and | |
| 1383 * the like we must not put a backslash before it, it will be taken | |
| 1384 * literally. If do_special is set the '!' will be escaped twice. | |
| 1385 * Csh also needs to have "\n" escaped twice when do_special is set. */ | |
| 1685 | 1386 csh_like = csh_like_shell(); |
| 985 | 1387 |
| 1388 /* First count the number of extra bytes required. */ | |
| 1072 | 1389 length = (unsigned)STRLEN(string) + 3; /* two quotes and a trailing NUL */ |
| 985 | 1390 for (p = string; *p != NUL; mb_ptr_adv(p)) |
| 1391 { | |
| 1392 # if defined(WIN32) || defined(WIN16) || defined(DOS) | |
| 1393 if (!p_ssl) | |
| 1394 { | |
| 1395 if (*p == '"') | |
| 1396 ++length; /* " -> "" */ | |
| 1397 } | |
| 1398 else | |
| 1399 # endif | |
| 1400 if (*p == '\'') | |
| 1401 length += 3; /* ' => '\'' */ | |
| 1673 | 1402 if (*p == '\n' || (*p == '!' && (csh_like || do_special))) |
| 1403 { | |
| 1404 ++length; /* insert backslash */ | |
| 1405 if (csh_like && do_special) | |
| 1406 ++length; /* insert backslash */ | |
| 1407 } | |
| 1661 | 1408 if (do_special && find_cmdline_var(p, &l) >= 0) |
| 1409 { | |
| 1410 ++length; /* insert backslash */ | |
| 1411 p += l - 1; | |
| 1412 } | |
| 985 | 1413 } |
| 1414 | |
| 1415 /* Allocate memory for the result and fill it. */ | |
| 1416 escaped_string = alloc(length); | |
| 1417 if (escaped_string != NULL) | |
| 1418 { | |
| 1419 d = escaped_string; | |
| 1420 | |
| 1421 /* add opening quote */ | |
| 1422 # if defined(WIN32) || defined(WIN16) || defined(DOS) | |
| 1423 if (!p_ssl) | |
| 1424 *d++ = '"'; | |
| 1425 else | |
| 1426 # endif | |
| 1427 *d++ = '\''; | |
| 1428 | |
| 1429 for (p = string; *p != NUL; ) | |
| 1430 { | |
| 1431 # if defined(WIN32) || defined(WIN16) || defined(DOS) | |
| 1432 if (!p_ssl) | |
| 1433 { | |
| 1434 if (*p == '"') | |
| 1435 { | |
| 1436 *d++ = '"'; | |
| 1437 *d++ = '"'; | |
| 1438 ++p; | |
| 1439 continue; | |
| 1440 } | |
| 1441 } | |
| 1442 else | |
| 1443 # endif | |
| 1444 if (*p == '\'') | |
| 1445 { | |
| 1661 | 1446 *d++ = '\''; |
| 1447 *d++ = '\\'; | |
| 1448 *d++ = '\''; | |
| 1449 *d++ = '\''; | |
| 985 | 1450 ++p; |
| 1451 continue; | |
| 1452 } | |
| 1673 | 1453 if (*p == '\n' || (*p == '!' && (csh_like || do_special))) |
| 1454 { | |
| 1455 *d++ = '\\'; | |
| 1456 if (csh_like && do_special) | |
| 1457 *d++ = '\\'; | |
| 1458 *d++ = *p++; | |
| 1459 continue; | |
| 1460 } | |
| 1661 | 1461 if (do_special && find_cmdline_var(p, &l) >= 0) |
| 1462 { | |
| 1463 *d++ = '\\'; /* insert backslash */ | |
| 1464 while (--l >= 0) /* copy the var */ | |
| 1465 *d++ = *p++; | |
| 2009 | 1466 continue; |
| 1661 | 1467 } |
| 985 | 1468 |
| 1469 MB_COPY_CHAR(p, d); | |
| 1470 } | |
| 1471 | |
| 1472 /* add terminating quote and finish with a NUL */ | |
| 1473 # if defined(WIN32) || defined(WIN16) || defined(DOS) | |
| 1474 if (!p_ssl) | |
| 1475 *d++ = '"'; | |
| 1476 else | |
| 1477 # endif | |
| 1478 *d++ = '\''; | |
| 1479 *d = NUL; | |
| 1480 } | |
| 1481 | |
| 1482 return escaped_string; | |
| 1483 } | |
| 1484 | |
| 7 | 1485 /* |
| 1486 * Like vim_strsave(), but make all characters uppercase. | |
| 1487 * This uses ASCII lower-to-upper case translation, language independent. | |
| 1488 */ | |
| 1489 char_u * | |
| 1490 vim_strsave_up(string) | |
| 1491 char_u *string; | |
| 1492 { | |
| 1493 char_u *p1; | |
| 1494 | |
| 1495 p1 = vim_strsave(string); | |
| 1496 vim_strup(p1); | |
| 1497 return p1; | |
| 1498 } | |
| 1499 | |
| 1500 /* | |
| 1501 * Like vim_strnsave(), but make all characters uppercase. | |
| 1502 * This uses ASCII lower-to-upper case translation, language independent. | |
| 1503 */ | |
| 1504 char_u * | |
| 1505 vim_strnsave_up(string, len) | |
| 1506 char_u *string; | |
| 1507 int len; | |
| 1508 { | |
| 1509 char_u *p1; | |
| 1510 | |
| 1511 p1 = vim_strnsave(string, len); | |
| 1512 vim_strup(p1); | |
| 1513 return p1; | |
| 1514 } | |
| 1515 | |
| 1516 /* | |
| 1517 * ASCII lower-to-upper case translation, language independent. | |
| 1518 */ | |
| 1519 void | |
| 1520 vim_strup(p) | |
| 1521 char_u *p; | |
| 1522 { | |
| 1523 char_u *p2; | |
| 1524 int c; | |
| 1525 | |
| 1526 if (p != NULL) | |
| 1527 { | |
| 1528 p2 = p; | |
| 1529 while ((c = *p2) != NUL) | |
| 1530 #ifdef EBCDIC | |
| 1531 *p2++ = isalpha(c) ? toupper(c) : c; | |
| 1532 #else | |
| 1533 *p2++ = (c < 'a' || c > 'z') ? c : (c - 0x20); | |
| 1534 #endif | |
| 1535 } | |
| 1536 } | |
| 1537 | |
| 741 | 1538 #if defined(FEAT_EVAL) || defined(FEAT_SPELL) || defined(PROTO) |
| 323 | 1539 /* |
| 1540 * Make string "s" all upper-case and return it in allocated memory. | |
| 1541 * Handles multi-byte characters as well as possible. | |
| 1542 * Returns NULL when out of memory. | |
| 1543 */ | |
| 1544 char_u * | |
| 1545 strup_save(orig) | |
| 1546 char_u *orig; | |
| 1547 { | |
| 1548 char_u *p; | |
| 1549 char_u *res; | |
| 1550 | |
| 1551 res = p = vim_strsave(orig); | |
| 1552 | |
| 1553 if (res != NULL) | |
| 1554 while (*p != NUL) | |
| 1555 { | |
| 1556 # ifdef FEAT_MBYTE | |
| 1557 int l; | |
| 1558 | |
| 1559 if (enc_utf8) | |
| 1560 { | |
| 1561 int c, uc; | |
| 3263 | 1562 int newl; |
| 323 | 1563 char_u *s; |
| 1564 | |
| 1565 c = utf_ptr2char(p); | |
| 1566 uc = utf_toupper(c); | |
| 1567 | |
| 1568 /* Reallocate string when byte count changes. This is rare, | |
| 1569 * thus it's OK to do another malloc()/free(). */ | |
| 474 | 1570 l = utf_ptr2len(p); |
| 3263 | 1571 newl = utf_char2len(uc); |
| 1572 if (newl != l) | |
| 323 | 1573 { |
| 3263 | 1574 s = alloc((unsigned)STRLEN(res) + 1 + newl - l); |
| 323 | 1575 if (s == NULL) |
| 1576 break; | |
| 1577 mch_memmove(s, res, p - res); | |
| 3263 | 1578 STRCPY(s + (p - res) + newl, p + l); |
| 323 | 1579 p = s + (p - res); |
| 1580 vim_free(res); | |
| 1581 res = s; | |
| 1582 } | |
| 1583 | |
| 1584 utf_char2bytes(uc, p); | |
| 3263 | 1585 p += newl; |
| 323 | 1586 } |
| 474 | 1587 else if (has_mbyte && (l = (*mb_ptr2len)(p)) > 1) |
| 323 | 1588 p += l; /* skip multi-byte character */ |
| 1589 else | |
| 1590 # endif | |
| 1591 { | |
| 1592 *p = TOUPPER_LOC(*p); /* note that toupper() can be a macro */ | |
| 1593 p++; | |
| 1594 } | |
| 1595 } | |
| 1596 | |
| 1597 return res; | |
| 1598 } | |
| 1599 #endif | |
| 1600 | |
| 7 | 1601 /* |
| 1602 * copy a space a number of times | |
| 1603 */ | |
| 1604 void | |
| 1605 copy_spaces(ptr, count) | |
| 1606 char_u *ptr; | |
| 1607 size_t count; | |
| 1608 { | |
| 1609 size_t i = count; | |
| 1610 char_u *p = ptr; | |
| 1611 | |
| 1612 while (i--) | |
| 1613 *p++ = ' '; | |
| 1614 } | |
| 1615 | |
| 1616 #if defined(FEAT_VISUALEXTRA) || defined(PROTO) | |
| 1617 /* | |
| 1618 * Copy a character a number of times. | |
| 1993 | 1619 * Does not work for multi-byte characters! |
| 7 | 1620 */ |
| 1621 void | |
| 1622 copy_chars(ptr, count, c) | |
| 1623 char_u *ptr; | |
| 1624 size_t count; | |
| 1625 int c; | |
| 1626 { | |
| 1627 size_t i = count; | |
| 1628 char_u *p = ptr; | |
| 1629 | |
| 1630 while (i--) | |
| 1631 *p++ = c; | |
| 1632 } | |
| 1633 #endif | |
| 1634 | |
| 1635 /* | |
| 1636 * delete spaces at the end of a string | |
| 1637 */ | |
| 1638 void | |
| 1639 del_trailing_spaces(ptr) | |
| 1640 char_u *ptr; | |
| 1641 { | |
| 1642 char_u *q; | |
| 1643 | |
| 1644 q = ptr + STRLEN(ptr); | |
| 1645 while (--q > ptr && vim_iswhite(q[0]) && q[-1] != '\\' && q[-1] != Ctrl_V) | |
| 1646 *q = NUL; | |
| 1647 } | |
| 1648 | |
| 1649 /* | |
| 323 | 1650 * Like strncpy(), but always terminate the result with one NUL. |
| 378 | 1651 * "to" must be "len + 1" long! |
| 7 | 1652 */ |
| 1653 void | |
| 1654 vim_strncpy(to, from, len) | |
| 323 | 1655 char_u *to; |
| 1656 char_u *from; | |
| 418 | 1657 size_t len; |
| 7 | 1658 { |
| 323 | 1659 STRNCPY(to, from, len); |
| 1660 to[len] = NUL; | |
| 7 | 1661 } |
| 1662 | |
| 1663 /* | |
| 2768 | 1664 * Like strcat(), but make sure the result fits in "tosize" bytes and is |
| 1665 * always NUL terminated. | |
| 1666 */ | |
| 1667 void | |
| 1668 vim_strcat(to, from, tosize) | |
| 1669 char_u *to; | |
| 1670 char_u *from; | |
| 1671 size_t tosize; | |
| 1672 { | |
| 1673 size_t tolen = STRLEN(to); | |
| 1674 size_t fromlen = STRLEN(from); | |
| 1675 | |
| 1676 if (tolen + fromlen + 1 > tosize) | |
| 1677 { | |
| 1678 mch_memmove(to + tolen, from, tosize - tolen - 1); | |
| 1679 to[tosize - 1] = NUL; | |
| 1680 } | |
| 1681 else | |
| 1682 STRCPY(to + tolen, from); | |
| 1683 } | |
| 1684 | |
| 1685 /* | |
| 7 | 1686 * Isolate one part of a string option where parts are separated with |
| 1687 * "sep_chars". | |
| 459 | 1688 * The part is copied into "buf[maxlen]". |
| 7 | 1689 * "*option" is advanced to the next part. |
| 1690 * The length is returned. | |
| 1691 */ | |
| 1692 int | |
| 1693 copy_option_part(option, buf, maxlen, sep_chars) | |
| 1694 char_u **option; | |
| 1695 char_u *buf; | |
| 1696 int maxlen; | |
| 1697 char *sep_chars; | |
| 1698 { | |
| 1699 int len = 0; | |
| 1700 char_u *p = *option; | |
| 1701 | |
| 1702 /* skip '.' at start of option part, for 'suffixes' */ | |
| 1703 if (*p == '.') | |
| 1704 buf[len++] = *p++; | |
| 1705 while (*p != NUL && vim_strchr((char_u *)sep_chars, *p) == NULL) | |
| 1706 { | |
| 1707 /* | |
| 1708 * Skip backslash before a separator character and space. | |
| 1709 */ | |
| 1710 if (p[0] == '\\' && vim_strchr((char_u *)sep_chars, p[1]) != NULL) | |
| 1711 ++p; | |
| 1712 if (len < maxlen - 1) | |
| 1713 buf[len++] = *p; | |
| 1714 ++p; | |
| 1715 } | |
| 1716 buf[len] = NUL; | |
| 1717 | |
| 1718 if (*p != NUL && *p != ',') /* skip non-standard separator */ | |
| 1719 ++p; | |
| 1720 p = skip_to_option_part(p); /* p points to next file name */ | |
| 1721 | |
| 1722 *option = p; | |
| 1723 return len; | |
| 1724 } | |
| 1725 | |
| 1726 /* | |
| 625 | 1727 * Replacement for free() that ignores NULL pointers. |
| 1728 * Also skip free() when exiting for sure, this helps when we caught a deadly | |
| 1729 * signal that was caused by a crash in free(). | |
| 7 | 1730 */ |
| 1731 void | |
| 1732 vim_free(x) | |
| 1733 void *x; | |
| 1734 { | |
| 625 | 1735 if (x != NULL && !really_exiting) |
| 7 | 1736 { |
| 1737 #ifdef MEM_PROFILE | |
| 1738 mem_pre_free(&x); | |
| 1739 #endif | |
| 1740 free(x); | |
| 1741 } | |
| 1742 } | |
| 1743 | |
| 1744 #ifndef HAVE_MEMSET | |
| 1745 void * | |
| 1746 vim_memset(ptr, c, size) | |
| 1747 void *ptr; | |
| 1748 int c; | |
| 1749 size_t size; | |
| 1750 { | |
| 1751 char *p = ptr; | |
| 1752 | |
| 1753 while (size-- > 0) | |
| 1754 *p++ = c; | |
| 1755 return ptr; | |
| 1756 } | |
| 1757 #endif | |
| 1758 | |
| 1759 #ifdef VIM_MEMCMP | |
| 1760 /* | |
| 1761 * Return zero when "b1" and "b2" are the same for "len" bytes. | |
| 1762 * Return non-zero otherwise. | |
| 1763 */ | |
| 1764 int | |
| 1765 vim_memcmp(b1, b2, len) | |
| 1766 void *b1; | |
| 1767 void *b2; | |
| 1768 size_t len; | |
| 1769 { | |
| 1770 char_u *p1 = (char_u *)b1, *p2 = (char_u *)b2; | |
| 1771 | |
| 1772 for ( ; len > 0; --len) | |
| 1773 { | |
| 1774 if (*p1 != *p2) | |
| 1775 return 1; | |
| 1776 ++p1; | |
| 1777 ++p2; | |
| 1778 } | |
| 1779 return 0; | |
| 1780 } | |
| 1781 #endif | |
| 1782 | |
| 1783 #ifdef VIM_MEMMOVE | |
| 1784 /* | |
| 1785 * Version of memmove() that handles overlapping source and destination. | |
| 1786 * For systems that don't have a function that is guaranteed to do that (SYSV). | |
| 1787 */ | |
| 1788 void | |
| 1789 mch_memmove(dst_arg, src_arg, len) | |
| 1790 void *src_arg, *dst_arg; | |
| 1791 size_t len; | |
| 1792 { | |
| 1793 /* | |
| 1794 * A void doesn't have a size, we use char pointers. | |
| 1795 */ | |
| 1796 char *dst = dst_arg, *src = src_arg; | |
| 1797 | |
| 1798 /* overlap, copy backwards */ | |
| 1799 if (dst > src && dst < src + len) | |
| 1800 { | |
| 1801 src += len; | |
| 1802 dst += len; | |
| 1803 while (len-- > 0) | |
| 1804 *--dst = *--src; | |
| 1805 } | |
| 1806 else /* copy forwards */ | |
| 1807 while (len-- > 0) | |
| 1808 *dst++ = *src++; | |
| 1809 } | |
| 1810 #endif | |
| 1811 | |
| 1812 #if (!defined(HAVE_STRCASECMP) && !defined(HAVE_STRICMP)) || defined(PROTO) | |
| 1813 /* | |
| 1814 * Compare two strings, ignoring case, using current locale. | |
| 1815 * Doesn't work for multi-byte characters. | |
| 1816 * return 0 for match, < 0 for smaller, > 0 for bigger | |
| 1817 */ | |
| 1818 int | |
| 1819 vim_stricmp(s1, s2) | |
| 1820 char *s1; | |
| 1821 char *s2; | |
| 1822 { | |
| 1823 int i; | |
| 1824 | |
| 1825 for (;;) | |
| 1826 { | |
| 1827 i = (int)TOLOWER_LOC(*s1) - (int)TOLOWER_LOC(*s2); | |
| 1828 if (i != 0) | |
| 1829 return i; /* this character different */ | |
| 1830 if (*s1 == NUL) | |
| 1831 break; /* strings match until NUL */ | |
| 1832 ++s1; | |
| 1833 ++s2; | |
| 1834 } | |
| 1835 return 0; /* strings match */ | |
| 1836 } | |
| 1837 #endif | |
| 1838 | |
| 1839 #if (!defined(HAVE_STRNCASECMP) && !defined(HAVE_STRNICMP)) || defined(PROTO) | |
| 1840 /* | |
| 1841 * Compare two strings, for length "len", ignoring case, using current locale. | |
| 1842 * Doesn't work for multi-byte characters. | |
| 1843 * return 0 for match, < 0 for smaller, > 0 for bigger | |
| 1844 */ | |
| 1845 int | |
| 1846 vim_strnicmp(s1, s2, len) | |
| 1847 char *s1; | |
| 1848 char *s2; | |
| 1849 size_t len; | |
| 1850 { | |
| 1851 int i; | |
| 1852 | |
| 1853 while (len > 0) | |
| 1854 { | |
| 1855 i = (int)TOLOWER_LOC(*s1) - (int)TOLOWER_LOC(*s2); | |
| 1856 if (i != 0) | |
| 1857 return i; /* this character different */ | |
| 1858 if (*s1 == NUL) | |
| 1859 break; /* strings match until NUL */ | |
| 1860 ++s1; | |
| 1861 ++s2; | |
| 1862 --len; | |
| 1863 } | |
| 1864 return 0; /* strings match */ | |
| 1865 } | |
| 1866 #endif | |
| 1867 | |
| 1868 /* | |
| 1869 * Version of strchr() and strrchr() that handle unsigned char strings | |
| 170 | 1870 * with characters from 128 to 255 correctly. It also doesn't return a |
| 1871 * pointer to the NUL at the end of the string. | |
| 7 | 1872 */ |
| 1873 char_u * | |
| 1874 vim_strchr(string, c) | |
| 1875 char_u *string; | |
| 1876 int c; | |
| 1877 { | |
| 1878 char_u *p; | |
| 1879 int b; | |
| 1880 | |
| 1881 p = string; | |
| 1882 #ifdef FEAT_MBYTE | |
| 1883 if (enc_utf8 && c >= 0x80) | |
| 1884 { | |
| 1885 while (*p != NUL) | |
| 1886 { | |
| 1887 if (utf_ptr2char(p) == c) | |
| 1888 return p; | |
| 474 | 1889 p += (*mb_ptr2len)(p); |
| 7 | 1890 } |
| 1891 return NULL; | |
| 1892 } | |
| 1893 if (enc_dbcs != 0 && c > 255) | |
| 1894 { | |
| 1895 int n2 = c & 0xff; | |
| 1896 | |
| 1897 c = ((unsigned)c >> 8) & 0xff; | |
| 1898 while ((b = *p) != NUL) | |
| 1899 { | |
| 1900 if (b == c && p[1] == n2) | |
| 1901 return p; | |
| 474 | 1902 p += (*mb_ptr2len)(p); |
| 7 | 1903 } |
| 1904 return NULL; | |
| 1905 } | |
| 1906 if (has_mbyte) | |
| 1907 { | |
| 1908 while ((b = *p) != NUL) | |
| 1909 { | |
| 1910 if (b == c) | |
| 1911 return p; | |
| 474 | 1912 p += (*mb_ptr2len)(p); |
| 7 | 1913 } |
| 1914 return NULL; | |
| 1915 } | |
| 1916 #endif | |
| 1917 while ((b = *p) != NUL) | |
| 1918 { | |
| 1919 if (b == c) | |
| 1920 return p; | |
| 1921 ++p; | |
| 1922 } | |
| 1923 return NULL; | |
| 1924 } | |
| 1925 | |
| 1926 /* | |
| 170 | 1927 * Version of strchr() that only works for bytes and handles unsigned char |
| 1928 * strings with characters above 128 correctly. It also doesn't return a | |
| 1929 * pointer to the NUL at the end of the string. | |
| 1930 */ | |
| 1931 char_u * | |
| 1932 vim_strbyte(string, c) | |
| 1933 char_u *string; | |
| 1934 int c; | |
| 1935 { | |
| 1936 char_u *p = string; | |
| 1937 | |
| 1938 while (*p != NUL) | |
| 1939 { | |
| 1940 if (*p == c) | |
| 1941 return p; | |
| 1942 ++p; | |
| 1943 } | |
| 1944 return NULL; | |
| 1945 } | |
| 1946 | |
| 1947 /* | |
| 7 | 1948 * Search for last occurrence of "c" in "string". |
| 500 | 1949 * Return NULL if not found. |
| 170 | 1950 * Does not handle multi-byte char for "c"! |
| 7 | 1951 */ |
| 1952 char_u * | |
| 1953 vim_strrchr(string, c) | |
| 1954 char_u *string; | |
| 1955 int c; | |
| 1956 { | |
| 1957 char_u *retval = NULL; | |
| 170 | 1958 char_u *p = string; |
| 1959 | |
| 1960 while (*p) | |
| 7 | 1961 { |
| 170 | 1962 if (*p == c) |
| 1963 retval = p; | |
| 1964 mb_ptr_adv(p); | |
| 7 | 1965 } |
| 1966 return retval; | |
| 1967 } | |
| 1968 | |
| 1969 /* | |
| 1970 * Vim's version of strpbrk(), in case it's missing. | |
| 1971 * Don't generate a prototype for this, causes problems when it's not used. | |
| 1972 */ | |
| 1973 #ifndef PROTO | |
| 1974 # ifndef HAVE_STRPBRK | |
| 1975 # ifdef vim_strpbrk | |
| 1976 # undef vim_strpbrk | |
| 1977 # endif | |
| 1978 char_u * | |
| 1979 vim_strpbrk(s, charset) | |
| 1980 char_u *s; | |
| 1981 char_u *charset; | |
| 1982 { | |
| 1983 while (*s) | |
| 1984 { | |
| 1985 if (vim_strchr(charset, *s) != NULL) | |
| 1986 return s; | |
| 39 | 1987 mb_ptr_adv(s); |
| 7 | 1988 } |
| 1989 return NULL; | |
| 1990 } | |
| 1991 # endif | |
| 1992 #endif | |
| 1993 | |
| 1994 /* | |
| 1995 * Vim has its own isspace() function, because on some machines isspace() | |
| 1996 * can't handle characters above 128. | |
| 1997 */ | |
| 1998 int | |
| 1999 vim_isspace(x) | |
| 2000 int x; | |
| 2001 { | |
| 2002 return ((x >= 9 && x <= 13) || x == ' '); | |
| 2003 } | |
| 2004 | |
| 2005 /************************************************************************ | |
| 119 | 2006 * Functions for handling growing arrays. |
| 7 | 2007 */ |
| 2008 | |
| 2009 /* | |
| 2010 * Clear an allocated growing array. | |
| 2011 */ | |
| 2012 void | |
| 2013 ga_clear(gap) | |
| 2014 garray_T *gap; | |
| 2015 { | |
| 2016 vim_free(gap->ga_data); | |
| 2017 ga_init(gap); | |
| 2018 } | |
| 2019 | |
| 2020 /* | |
| 2021 * Clear a growing array that contains a list of strings. | |
| 2022 */ | |
| 2023 void | |
| 2024 ga_clear_strings(gap) | |
| 2025 garray_T *gap; | |
| 2026 { | |
| 2027 int i; | |
| 2028 | |
| 2029 for (i = 0; i < gap->ga_len; ++i) | |
| 2030 vim_free(((char_u **)(gap->ga_data))[i]); | |
| 2031 ga_clear(gap); | |
| 2032 } | |
| 2033 | |
| 2034 /* | |
| 2035 * Initialize a growing array. Don't forget to set ga_itemsize and | |
| 2036 * ga_growsize! Or use ga_init2(). | |
| 2037 */ | |
| 2038 void | |
| 2039 ga_init(gap) | |
| 2040 garray_T *gap; | |
| 2041 { | |
| 2042 gap->ga_data = NULL; | |
| 41 | 2043 gap->ga_maxlen = 0; |
| 7 | 2044 gap->ga_len = 0; |
| 2045 } | |
| 2046 | |
| 2047 void | |
| 2048 ga_init2(gap, itemsize, growsize) | |
| 2049 garray_T *gap; | |
| 2050 int itemsize; | |
| 2051 int growsize; | |
| 2052 { | |
| 2053 ga_init(gap); | |
| 2054 gap->ga_itemsize = itemsize; | |
| 2055 gap->ga_growsize = growsize; | |
| 2056 } | |
| 2057 | |
| 2058 /* | |
| 2059 * Make room in growing array "gap" for at least "n" items. | |
| 2060 * Return FAIL for failure, OK otherwise. | |
| 2061 */ | |
| 2062 int | |
| 2063 ga_grow(gap, n) | |
| 2064 garray_T *gap; | |
| 2065 int n; | |
| 2066 { | |
| 3376 | 2067 size_t old_len; |
| 2068 size_t new_len; | |
| 7 | 2069 char_u *pp; |
| 2070 | |
| 41 | 2071 if (gap->ga_maxlen - gap->ga_len < n) |
| 7 | 2072 { |
| 2073 if (n < gap->ga_growsize) | |
| 2074 n = gap->ga_growsize; | |
| 3376 | 2075 new_len = gap->ga_itemsize * (gap->ga_len + n); |
| 2076 pp = (gap->ga_data == NULL) | |
| 3386 | 2077 ? alloc((unsigned)new_len) : vim_realloc(gap->ga_data, new_len); |
| 7 | 2078 if (pp == NULL) |
| 2079 return FAIL; | |
| 3376 | 2080 old_len = gap->ga_itemsize * gap->ga_maxlen; |
| 2081 vim_memset(pp + old_len, 0, new_len - old_len); | |
| 41 | 2082 gap->ga_maxlen = gap->ga_len + n; |
| 7 | 2083 gap->ga_data = pp; |
| 2084 } | |
| 2085 return OK; | |
| 2086 } | |
| 2087 | |
| 2088 /* | |
|
2487
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2089 * For a growing array that contains a list of strings: concatenate all the |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2090 * strings with a separating comma. |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2091 * Returns NULL when out of memory. |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2092 */ |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2093 char_u * |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2094 ga_concat_strings(gap) |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2095 garray_T *gap; |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2096 { |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2097 int i; |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2098 int len = 0; |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2099 char_u *s; |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2100 |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2101 for (i = 0; i < gap->ga_len; ++i) |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2102 len += (int)STRLEN(((char_u **)(gap->ga_data))[i]) + 1; |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2103 |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2104 s = alloc(len + 1); |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2105 if (s != NULL) |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2106 { |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2107 *s = NUL; |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2108 for (i = 0; i < gap->ga_len; ++i) |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2109 { |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2110 if (*s != NUL) |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2111 STRCAT(s, ","); |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2112 STRCAT(s, ((char_u **)(gap->ga_data))[i]); |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2113 } |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2114 } |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2115 return s; |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2116 } |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2117 |
|
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2118 /* |
| 7 | 2119 * Concatenate a string to a growarray which contains characters. |
| 2120 * Note: Does NOT copy the NUL at the end! | |
| 2121 */ | |
| 2122 void | |
| 2123 ga_concat(gap, s) | |
| 2124 garray_T *gap; | |
| 2125 char_u *s; | |
| 2126 { | |
| 2127 int len = (int)STRLEN(s); | |
| 2128 | |
| 2129 if (ga_grow(gap, len) == OK) | |
| 2130 { | |
| 2131 mch_memmove((char *)gap->ga_data + gap->ga_len, s, (size_t)len); | |
| 2132 gap->ga_len += len; | |
| 2133 } | |
| 2134 } | |
| 2135 | |
| 2136 /* | |
| 2137 * Append one byte to a growarray which contains bytes. | |
| 2138 */ | |
| 2139 void | |
| 2140 ga_append(gap, c) | |
| 2141 garray_T *gap; | |
| 2142 int c; | |
| 2143 { | |
| 2144 if (ga_grow(gap, 1) == OK) | |
| 2145 { | |
| 2146 *((char *)gap->ga_data + gap->ga_len) = c; | |
| 2147 ++gap->ga_len; | |
| 2148 } | |
| 2149 } | |
| 2150 | |
| 2935 | 2151 #if (defined(UNIX) && !defined(USE_SYSTEM)) || defined(WIN3264) |
| 2152 /* | |
| 2153 * Append the text in "gap" below the cursor line and clear "gap". | |
| 2154 */ | |
| 2155 void | |
| 2156 append_ga_line(gap) | |
| 2157 garray_T *gap; | |
| 2158 { | |
| 2159 /* Remove trailing CR. */ | |
| 2160 if (gap->ga_len > 0 | |
| 2161 && !curbuf->b_p_bin | |
| 2162 && ((char_u *)gap->ga_data)[gap->ga_len - 1] == CAR) | |
| 2163 --gap->ga_len; | |
| 2164 ga_append(gap, NUL); | |
| 2165 ml_append(curwin->w_cursor.lnum++, gap->ga_data, 0, FALSE); | |
| 2166 gap->ga_len = 0; | |
| 2167 } | |
| 2168 #endif | |
| 2169 | |
| 7 | 2170 /************************************************************************ |
| 2171 * functions that use lookup tables for various things, generally to do with | |
| 2172 * special key codes. | |
| 2173 */ | |
| 2174 | |
| 2175 /* | |
| 2176 * Some useful tables. | |
| 2177 */ | |
| 2178 | |
| 2179 static struct modmasktable | |
| 2180 { | |
| 2181 short mod_mask; /* Bit-mask for particular key modifier */ | |
| 2182 short mod_flag; /* Bit(s) for particular key modifier */ | |
| 2183 char_u name; /* Single letter name of modifier */ | |
| 2184 } mod_mask_table[] = | |
| 2185 { | |
| 2186 {MOD_MASK_ALT, MOD_MASK_ALT, (char_u)'M'}, | |
| 179 | 2187 {MOD_MASK_META, MOD_MASK_META, (char_u)'T'}, |
| 7 | 2188 {MOD_MASK_CTRL, MOD_MASK_CTRL, (char_u)'C'}, |
| 2189 {MOD_MASK_SHIFT, MOD_MASK_SHIFT, (char_u)'S'}, | |
| 2190 {MOD_MASK_MULTI_CLICK, MOD_MASK_2CLICK, (char_u)'2'}, | |
| 2191 {MOD_MASK_MULTI_CLICK, MOD_MASK_3CLICK, (char_u)'3'}, | |
| 2192 {MOD_MASK_MULTI_CLICK, MOD_MASK_4CLICK, (char_u)'4'}, | |
| 2193 #ifdef MACOS | |
| 2194 {MOD_MASK_CMD, MOD_MASK_CMD, (char_u)'D'}, | |
| 2195 #endif | |
| 2196 /* 'A' must be the last one */ | |
| 2197 {MOD_MASK_ALT, MOD_MASK_ALT, (char_u)'A'}, | |
| 2198 {0, 0, NUL} | |
| 2199 }; | |
| 2200 | |
| 2201 /* | |
| 2202 * Shifted key terminal codes and their unshifted equivalent. | |
| 1209 | 2203 * Don't add mouse codes here, they are handled separately! |
| 7 | 2204 */ |
| 2205 #define MOD_KEYS_ENTRY_SIZE 5 | |
| 2206 | |
| 2207 static char_u modifier_keys_table[] = | |
| 2208 { | |
| 2209 /* mod mask with modifier without modifier */ | |
| 2210 MOD_MASK_SHIFT, '&', '9', '@', '1', /* begin */ | |
| 2211 MOD_MASK_SHIFT, '&', '0', '@', '2', /* cancel */ | |
| 2212 MOD_MASK_SHIFT, '*', '1', '@', '4', /* command */ | |
| 2213 MOD_MASK_SHIFT, '*', '2', '@', '5', /* copy */ | |
| 2214 MOD_MASK_SHIFT, '*', '3', '@', '6', /* create */ | |
| 2215 MOD_MASK_SHIFT, '*', '4', 'k', 'D', /* delete char */ | |
| 2216 MOD_MASK_SHIFT, '*', '5', 'k', 'L', /* delete line */ | |
| 2217 MOD_MASK_SHIFT, '*', '7', '@', '7', /* end */ | |
| 2218 MOD_MASK_CTRL, KS_EXTRA, (int)KE_C_END, '@', '7', /* end */ | |
| 2219 MOD_MASK_SHIFT, '*', '9', '@', '9', /* exit */ | |
| 2220 MOD_MASK_SHIFT, '*', '0', '@', '0', /* find */ | |
| 2221 MOD_MASK_SHIFT, '#', '1', '%', '1', /* help */ | |
| 2222 MOD_MASK_SHIFT, '#', '2', 'k', 'h', /* home */ | |
| 2223 MOD_MASK_CTRL, KS_EXTRA, (int)KE_C_HOME, 'k', 'h', /* home */ | |
| 2224 MOD_MASK_SHIFT, '#', '3', 'k', 'I', /* insert */ | |
| 2225 MOD_MASK_SHIFT, '#', '4', 'k', 'l', /* left arrow */ | |
| 2226 MOD_MASK_CTRL, KS_EXTRA, (int)KE_C_LEFT, 'k', 'l', /* left arrow */ | |
| 2227 MOD_MASK_SHIFT, '%', 'a', '%', '3', /* message */ | |
| 2228 MOD_MASK_SHIFT, '%', 'b', '%', '4', /* move */ | |
| 2229 MOD_MASK_SHIFT, '%', 'c', '%', '5', /* next */ | |
| 2230 MOD_MASK_SHIFT, '%', 'd', '%', '7', /* options */ | |
| 2231 MOD_MASK_SHIFT, '%', 'e', '%', '8', /* previous */ | |
| 2232 MOD_MASK_SHIFT, '%', 'f', '%', '9', /* print */ | |
| 2233 MOD_MASK_SHIFT, '%', 'g', '%', '0', /* redo */ | |
| 2234 MOD_MASK_SHIFT, '%', 'h', '&', '3', /* replace */ | |
| 2235 MOD_MASK_SHIFT, '%', 'i', 'k', 'r', /* right arr. */ | |
| 2236 MOD_MASK_CTRL, KS_EXTRA, (int)KE_C_RIGHT, 'k', 'r', /* right arr. */ | |
| 2237 MOD_MASK_SHIFT, '%', 'j', '&', '5', /* resume */ | |
| 2238 MOD_MASK_SHIFT, '!', '1', '&', '6', /* save */ | |
| 2239 MOD_MASK_SHIFT, '!', '2', '&', '7', /* suspend */ | |
| 2240 MOD_MASK_SHIFT, '!', '3', '&', '8', /* undo */ | |
| 2241 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_UP, 'k', 'u', /* up arrow */ | |
| 2242 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_DOWN, 'k', 'd', /* down arrow */ | |
| 2243 | |
| 2244 /* vt100 F1 */ | |
| 2245 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_XF1, KS_EXTRA, (int)KE_XF1, | |
| 2246 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_XF2, KS_EXTRA, (int)KE_XF2, | |
| 2247 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_XF3, KS_EXTRA, (int)KE_XF3, | |
| 2248 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_XF4, KS_EXTRA, (int)KE_XF4, | |
| 2249 | |
| 2250 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F1, 'k', '1', /* F1 */ | |
| 2251 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F2, 'k', '2', | |
| 2252 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F3, 'k', '3', | |
| 2253 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F4, 'k', '4', | |
| 2254 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F5, 'k', '5', | |
| 2255 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F6, 'k', '6', | |
| 2256 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F7, 'k', '7', | |
| 2257 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F8, 'k', '8', | |
| 2258 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F9, 'k', '9', | |
| 2259 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F10, 'k', ';', /* F10 */ | |
| 2260 | |
| 2261 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F11, 'F', '1', | |
| 2262 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F12, 'F', '2', | |
| 2263 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F13, 'F', '3', | |
| 2264 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F14, 'F', '4', | |
| 2265 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F15, 'F', '5', | |
| 2266 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F16, 'F', '6', | |
| 2267 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F17, 'F', '7', | |
| 2268 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F18, 'F', '8', | |
| 2269 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F19, 'F', '9', | |
| 2270 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F20, 'F', 'A', | |
| 2271 | |
| 2272 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F21, 'F', 'B', | |
| 2273 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F22, 'F', 'C', | |
| 2274 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F23, 'F', 'D', | |
| 2275 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F24, 'F', 'E', | |
| 2276 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F25, 'F', 'F', | |
| 2277 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F26, 'F', 'G', | |
| 2278 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F27, 'F', 'H', | |
| 2279 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F28, 'F', 'I', | |
| 2280 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F29, 'F', 'J', | |
| 2281 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F30, 'F', 'K', | |
| 2282 | |
| 2283 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F31, 'F', 'L', | |
| 2284 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F32, 'F', 'M', | |
| 2285 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F33, 'F', 'N', | |
| 2286 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F34, 'F', 'O', | |
| 2287 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F35, 'F', 'P', | |
| 2288 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F36, 'F', 'Q', | |
| 2289 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F37, 'F', 'R', | |
| 2290 | |
| 2291 /* TAB pseudo code*/ | |
| 2292 MOD_MASK_SHIFT, 'k', 'B', KS_EXTRA, (int)KE_TAB, | |
| 2293 | |
| 2294 NUL | |
| 2295 }; | |
| 2296 | |
| 2297 static struct key_name_entry | |
| 2298 { | |
| 2299 int key; /* Special key code or ascii value */ | |
| 2300 char_u *name; /* Name of key */ | |
| 2301 } key_names_table[] = | |
| 2302 { | |
| 2303 {' ', (char_u *)"Space"}, | |
| 2304 {TAB, (char_u *)"Tab"}, | |
| 2305 {K_TAB, (char_u *)"Tab"}, | |
| 2306 {NL, (char_u *)"NL"}, | |
| 2307 {NL, (char_u *)"NewLine"}, /* Alternative name */ | |
| 2308 {NL, (char_u *)"LineFeed"}, /* Alternative name */ | |
| 2309 {NL, (char_u *)"LF"}, /* Alternative name */ | |
| 2310 {CAR, (char_u *)"CR"}, | |
| 2311 {CAR, (char_u *)"Return"}, /* Alternative name */ | |
| 2312 {CAR, (char_u *)"Enter"}, /* Alternative name */ | |
| 2313 {K_BS, (char_u *)"BS"}, | |
| 2314 {K_BS, (char_u *)"BackSpace"}, /* Alternative name */ | |
| 2315 {ESC, (char_u *)"Esc"}, | |
| 2316 {CSI, (char_u *)"CSI"}, | |
| 2317 {K_CSI, (char_u *)"xCSI"}, | |
| 2318 {'|', (char_u *)"Bar"}, | |
| 2319 {'\\', (char_u *)"Bslash"}, | |
| 2320 {K_DEL, (char_u *)"Del"}, | |
| 2321 {K_DEL, (char_u *)"Delete"}, /* Alternative name */ | |
| 2322 {K_KDEL, (char_u *)"kDel"}, | |
| 2323 {K_UP, (char_u *)"Up"}, | |
| 2324 {K_DOWN, (char_u *)"Down"}, | |
| 2325 {K_LEFT, (char_u *)"Left"}, | |
| 2326 {K_RIGHT, (char_u *)"Right"}, | |
| 180 | 2327 {K_XUP, (char_u *)"xUp"}, |
| 2328 {K_XDOWN, (char_u *)"xDown"}, | |
| 2329 {K_XLEFT, (char_u *)"xLeft"}, | |
| 2330 {K_XRIGHT, (char_u *)"xRight"}, | |
| 7 | 2331 |
| 2332 {K_F1, (char_u *)"F1"}, | |
| 2333 {K_F2, (char_u *)"F2"}, | |
| 2334 {K_F3, (char_u *)"F3"}, | |
| 2335 {K_F4, (char_u *)"F4"}, | |
| 2336 {K_F5, (char_u *)"F5"}, | |
| 2337 {K_F6, (char_u *)"F6"}, | |
| 2338 {K_F7, (char_u *)"F7"}, | |
| 2339 {K_F8, (char_u *)"F8"}, | |
| 2340 {K_F9, (char_u *)"F9"}, | |
| 2341 {K_F10, (char_u *)"F10"}, | |
| 2342 | |
| 2343 {K_F11, (char_u *)"F11"}, | |
| 2344 {K_F12, (char_u *)"F12"}, | |
| 2345 {K_F13, (char_u *)"F13"}, | |
| 2346 {K_F14, (char_u *)"F14"}, | |
| 2347 {K_F15, (char_u *)"F15"}, | |
| 2348 {K_F16, (char_u *)"F16"}, | |
| 2349 {K_F17, (char_u *)"F17"}, | |
| 2350 {K_F18, (char_u *)"F18"}, | |
| 2351 {K_F19, (char_u *)"F19"}, | |
| 2352 {K_F20, (char_u *)"F20"}, | |
| 2353 | |
| 2354 {K_F21, (char_u *)"F21"}, | |
| 2355 {K_F22, (char_u *)"F22"}, | |
| 2356 {K_F23, (char_u *)"F23"}, | |
| 2357 {K_F24, (char_u *)"F24"}, | |
| 2358 {K_F25, (char_u *)"F25"}, | |
| 2359 {K_F26, (char_u *)"F26"}, | |
| 2360 {K_F27, (char_u *)"F27"}, | |
| 2361 {K_F28, (char_u *)"F28"}, | |
| 2362 {K_F29, (char_u *)"F29"}, | |
| 2363 {K_F30, (char_u *)"F30"}, | |
| 2364 | |
| 2365 {K_F31, (char_u *)"F31"}, | |
| 2366 {K_F32, (char_u *)"F32"}, | |
| 2367 {K_F33, (char_u *)"F33"}, | |
| 2368 {K_F34, (char_u *)"F34"}, | |
| 2369 {K_F35, (char_u *)"F35"}, | |
| 2370 {K_F36, (char_u *)"F36"}, | |
| 2371 {K_F37, (char_u *)"F37"}, | |
| 2372 | |
| 2373 {K_XF1, (char_u *)"xF1"}, | |
| 2374 {K_XF2, (char_u *)"xF2"}, | |
| 2375 {K_XF3, (char_u *)"xF3"}, | |
| 2376 {K_XF4, (char_u *)"xF4"}, | |
| 2377 | |
| 2378 {K_HELP, (char_u *)"Help"}, | |
| 2379 {K_UNDO, (char_u *)"Undo"}, | |
| 2380 {K_INS, (char_u *)"Insert"}, | |
| 2381 {K_INS, (char_u *)"Ins"}, /* Alternative name */ | |
| 2382 {K_KINS, (char_u *)"kInsert"}, | |
| 2383 {K_HOME, (char_u *)"Home"}, | |
| 2384 {K_KHOME, (char_u *)"kHome"}, | |
| 2385 {K_XHOME, (char_u *)"xHome"}, | |
| 230 | 2386 {K_ZHOME, (char_u *)"zHome"}, |
| 7 | 2387 {K_END, (char_u *)"End"}, |
| 2388 {K_KEND, (char_u *)"kEnd"}, | |
| 2389 {K_XEND, (char_u *)"xEnd"}, | |
| 230 | 2390 {K_ZEND, (char_u *)"zEnd"}, |
| 7 | 2391 {K_PAGEUP, (char_u *)"PageUp"}, |
| 2392 {K_PAGEDOWN, (char_u *)"PageDown"}, | |
| 2393 {K_KPAGEUP, (char_u *)"kPageUp"}, | |
| 2394 {K_KPAGEDOWN, (char_u *)"kPageDown"}, | |
| 2395 | |
| 2396 {K_KPLUS, (char_u *)"kPlus"}, | |
| 2397 {K_KMINUS, (char_u *)"kMinus"}, | |
| 2398 {K_KDIVIDE, (char_u *)"kDivide"}, | |
| 2399 {K_KMULTIPLY, (char_u *)"kMultiply"}, | |
| 2400 {K_KENTER, (char_u *)"kEnter"}, | |
| 2401 {K_KPOINT, (char_u *)"kPoint"}, | |
| 2402 | |
| 2403 {K_K0, (char_u *)"k0"}, | |
| 2404 {K_K1, (char_u *)"k1"}, | |
| 2405 {K_K2, (char_u *)"k2"}, | |
| 2406 {K_K3, (char_u *)"k3"}, | |
| 2407 {K_K4, (char_u *)"k4"}, | |
| 2408 {K_K5, (char_u *)"k5"}, | |
| 2409 {K_K6, (char_u *)"k6"}, | |
| 2410 {K_K7, (char_u *)"k7"}, | |
| 2411 {K_K8, (char_u *)"k8"}, | |
| 2412 {K_K9, (char_u *)"k9"}, | |
| 2413 | |
| 2414 {'<', (char_u *)"lt"}, | |
| 2415 | |
| 2416 {K_MOUSE, (char_u *)"Mouse"}, | |
| 3273 | 2417 #ifdef FEAT_MOUSE_NET |
| 7 | 2418 {K_NETTERM_MOUSE, (char_u *)"NetMouse"}, |
| 3273 | 2419 #endif |
| 2420 #ifdef FEAT_MOUSE_DEC | |
| 7 | 2421 {K_DEC_MOUSE, (char_u *)"DecMouse"}, |
| 3273 | 2422 #endif |
| 2423 #ifdef FEAT_MOUSE_JSB | |
| 7 | 2424 {K_JSBTERM_MOUSE, (char_u *)"JsbMouse"}, |
| 3273 | 2425 #endif |
| 2426 #ifdef FEAT_MOUSE_PTERM | |
| 7 | 2427 {K_PTERM_MOUSE, (char_u *)"PtermMouse"}, |
| 3273 | 2428 #endif |
| 2429 #ifdef FEAT_MOUSE_URXVT | |
| 2430 {K_URXVT_MOUSE, (char_u *)"UrxvtMouse"}, | |
| 2431 #endif | |
| 7 | 2432 {K_LEFTMOUSE, (char_u *)"LeftMouse"}, |
| 2433 {K_LEFTMOUSE_NM, (char_u *)"LeftMouseNM"}, | |
| 2434 {K_LEFTDRAG, (char_u *)"LeftDrag"}, | |
| 2435 {K_LEFTRELEASE, (char_u *)"LeftRelease"}, | |
| 2436 {K_LEFTRELEASE_NM, (char_u *)"LeftReleaseNM"}, | |
| 2437 {K_MIDDLEMOUSE, (char_u *)"MiddleMouse"}, | |
| 2438 {K_MIDDLEDRAG, (char_u *)"MiddleDrag"}, | |
| 2439 {K_MIDDLERELEASE, (char_u *)"MiddleRelease"}, | |
| 2440 {K_RIGHTMOUSE, (char_u *)"RightMouse"}, | |
| 2441 {K_RIGHTDRAG, (char_u *)"RightDrag"}, | |
| 2442 {K_RIGHTRELEASE, (char_u *)"RightRelease"}, | |
|
2409
0ca06a92adfb
Add support for horizontal scroll wheel. (Bjorn Winckler)
Bram Moolenaar <bram@vim.org>
parents:
2363
diff
changeset
|
2443 {K_MOUSEDOWN, (char_u *)"ScrollWheelUp"}, |
|
0ca06a92adfb
Add support for horizontal scroll wheel. (Bjorn Winckler)
Bram Moolenaar <bram@vim.org>
parents:
2363
diff
changeset
|
2444 {K_MOUSEUP, (char_u *)"ScrollWheelDown"}, |
|
0ca06a92adfb
Add support for horizontal scroll wheel. (Bjorn Winckler)
Bram Moolenaar <bram@vim.org>
parents:
2363
diff
changeset
|
2445 {K_MOUSELEFT, (char_u *)"ScrollWheelRight"}, |
|
0ca06a92adfb
Add support for horizontal scroll wheel. (Bjorn Winckler)
Bram Moolenaar <bram@vim.org>
parents:
2363
diff
changeset
|
2446 {K_MOUSERIGHT, (char_u *)"ScrollWheelLeft"}, |
|
0ca06a92adfb
Add support for horizontal scroll wheel. (Bjorn Winckler)
Bram Moolenaar <bram@vim.org>
parents:
2363
diff
changeset
|
2447 {K_MOUSEDOWN, (char_u *)"MouseDown"}, /* OBSOLETE: Use */ |
|
0ca06a92adfb
Add support for horizontal scroll wheel. (Bjorn Winckler)
Bram Moolenaar <bram@vim.org>
parents:
2363
diff
changeset
|
2448 {K_MOUSEUP, (char_u *)"MouseUp"}, /* ScrollWheelXXX instead */ |
| 7 | 2449 {K_X1MOUSE, (char_u *)"X1Mouse"}, |
| 2450 {K_X1DRAG, (char_u *)"X1Drag"}, | |
| 2451 {K_X1RELEASE, (char_u *)"X1Release"}, | |
| 2452 {K_X2MOUSE, (char_u *)"X2Mouse"}, | |
| 2453 {K_X2DRAG, (char_u *)"X2Drag"}, | |
| 2454 {K_X2RELEASE, (char_u *)"X2Release"}, | |
| 2455 {K_DROP, (char_u *)"Drop"}, | |
| 2456 {K_ZERO, (char_u *)"Nul"}, | |
| 2457 #ifdef FEAT_EVAL | |
| 2458 {K_SNR, (char_u *)"SNR"}, | |
| 2459 #endif | |
| 2460 {K_PLUG, (char_u *)"Plug"}, | |
| 2461 {0, NULL} | |
| 2462 }; | |
| 2463 | |
| 2464 #define KEY_NAMES_TABLE_LEN (sizeof(key_names_table) / sizeof(struct key_name_entry)) | |
| 2465 | |
| 2466 #ifdef FEAT_MOUSE | |
| 2467 static struct mousetable | |
| 2468 { | |
| 2469 int pseudo_code; /* Code for pseudo mouse event */ | |
| 2470 int button; /* Which mouse button is it? */ | |
| 2471 int is_click; /* Is it a mouse button click event? */ | |
| 2472 int is_drag; /* Is it a mouse drag event? */ | |
| 2473 } mouse_table[] = | |
| 2474 { | |
| 2475 {(int)KE_LEFTMOUSE, MOUSE_LEFT, TRUE, FALSE}, | |
| 2476 #ifdef FEAT_GUI | |
| 2477 {(int)KE_LEFTMOUSE_NM, MOUSE_LEFT, TRUE, FALSE}, | |
| 2478 #endif | |
| 2479 {(int)KE_LEFTDRAG, MOUSE_LEFT, FALSE, TRUE}, | |
| 2480 {(int)KE_LEFTRELEASE, MOUSE_LEFT, FALSE, FALSE}, | |
| 2481 #ifdef FEAT_GUI | |
| 2482 {(int)KE_LEFTRELEASE_NM, MOUSE_LEFT, FALSE, FALSE}, | |
| 2483 #endif | |
| 2484 {(int)KE_MIDDLEMOUSE, MOUSE_MIDDLE, TRUE, FALSE}, | |
| 2485 {(int)KE_MIDDLEDRAG, MOUSE_MIDDLE, FALSE, TRUE}, | |
| 2486 {(int)KE_MIDDLERELEASE, MOUSE_MIDDLE, FALSE, FALSE}, | |
| 2487 {(int)KE_RIGHTMOUSE, MOUSE_RIGHT, TRUE, FALSE}, | |
| 2488 {(int)KE_RIGHTDRAG, MOUSE_RIGHT, FALSE, TRUE}, | |
| 2489 {(int)KE_RIGHTRELEASE, MOUSE_RIGHT, FALSE, FALSE}, | |
| 2490 {(int)KE_X1MOUSE, MOUSE_X1, TRUE, FALSE}, | |
| 2491 {(int)KE_X1DRAG, MOUSE_X1, FALSE, TRUE}, | |
| 2492 {(int)KE_X1RELEASE, MOUSE_X1, FALSE, FALSE}, | |
| 2493 {(int)KE_X2MOUSE, MOUSE_X2, TRUE, FALSE}, | |
| 2494 {(int)KE_X2DRAG, MOUSE_X2, FALSE, TRUE}, | |
| 2495 {(int)KE_X2RELEASE, MOUSE_X2, FALSE, FALSE}, | |
| 2496 /* DRAG without CLICK */ | |
| 2497 {(int)KE_IGNORE, MOUSE_RELEASE, FALSE, TRUE}, | |
| 2498 /* RELEASE without CLICK */ | |
| 2499 {(int)KE_IGNORE, MOUSE_RELEASE, FALSE, FALSE}, | |
| 2500 {0, 0, 0, 0}, | |
| 2501 }; | |
| 2502 #endif /* FEAT_MOUSE */ | |
| 2503 | |
| 2504 /* | |
| 2505 * Return the modifier mask bit (MOD_MASK_*) which corresponds to the given | |
| 2506 * modifier name ('S' for Shift, 'C' for Ctrl etc). | |
| 2507 */ | |
| 2508 int | |
| 2509 name_to_mod_mask(c) | |
| 2510 int c; | |
| 2511 { | |
| 2512 int i; | |
| 2513 | |
| 2514 c = TOUPPER_ASC(c); | |
| 2515 for (i = 0; mod_mask_table[i].mod_mask != 0; i++) | |
| 2516 if (c == mod_mask_table[i].name) | |
| 2517 return mod_mask_table[i].mod_flag; | |
| 2518 return 0; | |
| 2519 } | |
| 2520 | |
| 2521 /* | |
| 2522 * Check if if there is a special key code for "key" that includes the | |
| 2523 * modifiers specified. | |
| 2524 */ | |
| 2525 int | |
| 2526 simplify_key(key, modifiers) | |
| 2527 int key; | |
| 2528 int *modifiers; | |
| 2529 { | |
| 2530 int i; | |
| 2531 int key0; | |
| 2532 int key1; | |
| 2533 | |
| 2534 if (*modifiers & (MOD_MASK_SHIFT | MOD_MASK_CTRL | MOD_MASK_ALT)) | |
| 2535 { | |
| 2536 /* TAB is a special case */ | |
| 2537 if (key == TAB && (*modifiers & MOD_MASK_SHIFT)) | |
| 2538 { | |
| 2539 *modifiers &= ~MOD_MASK_SHIFT; | |
| 2540 return K_S_TAB; | |
| 2541 } | |
| 2542 key0 = KEY2TERMCAP0(key); | |
| 2543 key1 = KEY2TERMCAP1(key); | |
| 2544 for (i = 0; modifier_keys_table[i] != NUL; i += MOD_KEYS_ENTRY_SIZE) | |
| 2545 if (key0 == modifier_keys_table[i + 3] | |
| 2546 && key1 == modifier_keys_table[i + 4] | |
| 2547 && (*modifiers & modifier_keys_table[i])) | |
| 2548 { | |
| 2549 *modifiers &= ~modifier_keys_table[i]; | |
| 2550 return TERMCAP2KEY(modifier_keys_table[i + 1], | |
| 2551 modifier_keys_table[i + 2]); | |
| 2552 } | |
| 2553 } | |
| 2554 return key; | |
| 2555 } | |
| 2556 | |
| 2557 /* | |
| 180 | 2558 * Change <xHome> to <Home>, <xUp> to <Up>, etc. |
| 2559 */ | |
| 2560 int | |
| 2561 handle_x_keys(key) | |
| 2562 int key; | |
| 2563 { | |
| 2564 switch (key) | |
| 2565 { | |
| 2566 case K_XUP: return K_UP; | |
| 2567 case K_XDOWN: return K_DOWN; | |
| 2568 case K_XLEFT: return K_LEFT; | |
| 2569 case K_XRIGHT: return K_RIGHT; | |
| 2570 case K_XHOME: return K_HOME; | |
| 230 | 2571 case K_ZHOME: return K_HOME; |
| 180 | 2572 case K_XEND: return K_END; |
| 230 | 2573 case K_ZEND: return K_END; |
| 180 | 2574 case K_XF1: return K_F1; |
| 2575 case K_XF2: return K_F2; | |
| 2576 case K_XF3: return K_F3; | |
| 2577 case K_XF4: return K_F4; | |
| 2578 case K_S_XF1: return K_S_F1; | |
| 2579 case K_S_XF2: return K_S_F2; | |
| 2580 case K_S_XF3: return K_S_F3; | |
| 2581 case K_S_XF4: return K_S_F4; | |
| 2582 } | |
| 2583 return key; | |
| 2584 } | |
| 2585 | |
| 2586 /* | |
| 7 | 2587 * Return a string which contains the name of the given key when the given |
| 2588 * modifiers are down. | |
| 2589 */ | |
| 2590 char_u * | |
| 2591 get_special_key_name(c, modifiers) | |
| 2592 int c; | |
| 2593 int modifiers; | |
| 2594 { | |
| 2595 static char_u string[MAX_KEY_NAME_LEN + 1]; | |
| 2596 | |
| 2597 int i, idx; | |
| 2598 int table_idx; | |
| 2599 char_u *s; | |
| 2600 | |
| 2601 string[0] = '<'; | |
| 2602 idx = 1; | |
| 2603 | |
| 2604 /* Key that stands for a normal character. */ | |
| 2605 if (IS_SPECIAL(c) && KEY2TERMCAP0(c) == KS_KEY) | |
| 2606 c = KEY2TERMCAP1(c); | |
| 2607 | |
| 2608 /* | |
| 2609 * Translate shifted special keys into unshifted keys and set modifier. | |
| 2610 * Same for CTRL and ALT modifiers. | |
| 2611 */ | |
| 2612 if (IS_SPECIAL(c)) | |
| 2613 { | |
| 2614 for (i = 0; modifier_keys_table[i] != 0; i += MOD_KEYS_ENTRY_SIZE) | |
| 2615 if ( KEY2TERMCAP0(c) == (int)modifier_keys_table[i + 1] | |
| 2616 && (int)KEY2TERMCAP1(c) == (int)modifier_keys_table[i + 2]) | |
| 2617 { | |
| 2618 modifiers |= modifier_keys_table[i]; | |
| 2619 c = TERMCAP2KEY(modifier_keys_table[i + 3], | |
| 2620 modifier_keys_table[i + 4]); | |
| 2621 break; | |
| 2622 } | |
| 2623 } | |
| 2624 | |
| 2625 /* try to find the key in the special key table */ | |
| 2626 table_idx = find_special_key_in_table(c); | |
| 2627 | |
| 2628 /* | |
| 2629 * When not a known special key, and not a printable character, try to | |
| 2630 * extract modifiers. | |
| 2631 */ | |
| 2632 if (c > 0 | |
| 2633 #ifdef FEAT_MBYTE | |
| 2634 && (*mb_char2len)(c) == 1 | |
| 2635 #endif | |
| 2636 ) | |
| 2637 { | |
| 2638 if (table_idx < 0 | |
| 2639 && (!vim_isprintc(c) || (c & 0x7f) == ' ') | |
| 2640 && (c & 0x80)) | |
| 2641 { | |
| 2642 c &= 0x7f; | |
| 2643 modifiers |= MOD_MASK_ALT; | |
| 2644 /* try again, to find the un-alted key in the special key table */ | |
| 2645 table_idx = find_special_key_in_table(c); | |
| 2646 } | |
| 2647 if (table_idx < 0 && !vim_isprintc(c) && c < ' ') | |
| 2648 { | |
| 2649 #ifdef EBCDIC | |
| 2650 c = CtrlChar(c); | |
| 2651 #else | |
| 2652 c += '@'; | |
| 2653 #endif | |
| 2654 modifiers |= MOD_MASK_CTRL; | |
| 2655 } | |
| 2656 } | |
| 2657 | |
| 2658 /* translate the modifier into a string */ | |
| 2659 for (i = 0; mod_mask_table[i].name != 'A'; i++) | |
| 2660 if ((modifiers & mod_mask_table[i].mod_mask) | |
| 2661 == mod_mask_table[i].mod_flag) | |
| 2662 { | |
| 2663 string[idx++] = mod_mask_table[i].name; | |
| 2664 string[idx++] = (char_u)'-'; | |
| 2665 } | |
| 2666 | |
| 2667 if (table_idx < 0) /* unknown special key, may output t_xx */ | |
| 2668 { | |
| 2669 if (IS_SPECIAL(c)) | |
| 2670 { | |
| 2671 string[idx++] = 't'; | |
| 2672 string[idx++] = '_'; | |
| 2673 string[idx++] = KEY2TERMCAP0(c); | |
| 2674 string[idx++] = KEY2TERMCAP1(c); | |
| 2675 } | |
| 2676 /* Not a special key, only modifiers, output directly */ | |
| 2677 else | |
| 2678 { | |
| 2679 #ifdef FEAT_MBYTE | |
| 2680 if (has_mbyte && (*mb_char2len)(c) > 1) | |
| 2681 idx += (*mb_char2bytes)(c, string + idx); | |
| 2682 else | |
| 2683 #endif | |
| 2684 if (vim_isprintc(c)) | |
| 2685 string[idx++] = c; | |
| 2686 else | |
| 2687 { | |
| 2688 s = transchar(c); | |
| 2689 while (*s) | |
| 2690 string[idx++] = *s++; | |
| 2691 } | |
| 2692 } | |
| 2693 } | |
| 2694 else /* use name of special key */ | |
| 2695 { | |
| 2696 STRCPY(string + idx, key_names_table[table_idx].name); | |
| 2697 idx = (int)STRLEN(string); | |
| 2698 } | |
| 2699 string[idx++] = '>'; | |
| 2700 string[idx] = NUL; | |
| 2701 return string; | |
| 2702 } | |
| 2703 | |
| 2704 /* | |
| 2705 * Try translating a <> name at (*srcp)[] to dst[]. | |
| 2706 * Return the number of characters added to dst[], zero for no match. | |
| 2707 * If there is a match, srcp is advanced to after the <> name. | |
| 2708 * dst[] must be big enough to hold the result (up to six characters)! | |
| 2709 */ | |
| 2710 int | |
| 2711 trans_special(srcp, dst, keycode) | |
| 2712 char_u **srcp; | |
| 2713 char_u *dst; | |
| 2714 int keycode; /* prefer key code, e.g. K_DEL instead of DEL */ | |
| 2715 { | |
| 2716 int modifiers = 0; | |
| 2717 int key; | |
| 2718 int dlen = 0; | |
| 2719 | |
| 1775 | 2720 key = find_special_key(srcp, &modifiers, keycode, FALSE); |
| 7 | 2721 if (key == 0) |
| 2722 return 0; | |
| 2723 | |
| 2724 /* Put the appropriate modifier in a string */ | |
| 2725 if (modifiers != 0) | |
| 2726 { | |
| 2727 dst[dlen++] = K_SPECIAL; | |
| 2728 dst[dlen++] = KS_MODIFIER; | |
| 2729 dst[dlen++] = modifiers; | |
| 2730 } | |
| 2731 | |
| 2732 if (IS_SPECIAL(key)) | |
| 2733 { | |
| 2734 dst[dlen++] = K_SPECIAL; | |
| 2735 dst[dlen++] = KEY2TERMCAP0(key); | |
| 2736 dst[dlen++] = KEY2TERMCAP1(key); | |
| 2737 } | |
| 2738 #ifdef FEAT_MBYTE | |
| 2739 else if (has_mbyte && !keycode) | |
| 2740 dlen += (*mb_char2bytes)(key, dst + dlen); | |
| 2741 #endif | |
| 2742 else if (keycode) | |
| 2743 dlen = (int)(add_char2buf(key, dst + dlen) - dst); | |
| 2744 else | |
| 2745 dst[dlen++] = key; | |
| 2746 | |
| 2747 return dlen; | |
| 2748 } | |
| 2749 | |
| 2750 /* | |
| 2751 * Try translating a <> name at (*srcp)[], return the key and modifiers. | |
| 2752 * srcp is advanced to after the <> name. | |
| 2753 * returns 0 if there is no match. | |
| 2754 */ | |
| 2755 int | |
| 1775 | 2756 find_special_key(srcp, modp, keycode, keep_x_key) |
| 7 | 2757 char_u **srcp; |
| 2758 int *modp; | |
| 1775 | 2759 int keycode; /* prefer key code, e.g. K_DEL instead of DEL */ |
| 2760 int keep_x_key; /* don't translate xHome to Home key */ | |
| 7 | 2761 { |
| 2762 char_u *last_dash; | |
| 2763 char_u *end_of_name; | |
| 2764 char_u *src; | |
| 2765 char_u *bp; | |
| 2766 int modifiers; | |
| 2767 int bit; | |
| 2768 int key; | |
| 835 | 2769 unsigned long n; |
| 3024 | 2770 int l; |
| 7 | 2771 |
| 2772 src = *srcp; | |
| 2773 if (src[0] != '<') | |
| 2774 return 0; | |
| 2775 | |
| 2776 /* Find end of modifier list */ | |
| 2777 last_dash = src; | |
| 2778 for (bp = src + 1; *bp == '-' || vim_isIDc(*bp); bp++) | |
| 2779 { | |
| 2780 if (*bp == '-') | |
| 2781 { | |
| 2782 last_dash = bp; | |
| 3024 | 2783 if (bp[1] != NUL) |
| 2784 { | |
| 2785 #ifdef FEAT_MBYTE | |
| 2786 if (has_mbyte) | |
| 2787 l = mb_ptr2len(bp + 1); | |
| 2788 else | |
| 2789 #endif | |
| 2790 l = 1; | |
| 2791 if (bp[l + 1] == '>') | |
| 2792 bp += l; /* anything accepted, like <C-?> */ | |
| 2793 } | |
| 7 | 2794 } |
| 2795 if (bp[0] == 't' && bp[1] == '_' && bp[2] && bp[3]) | |
| 2796 bp += 3; /* skip t_xx, xx may be '-' or '>' */ | |
| 3026 | 2797 else if (STRNICMP(bp, "char-", 5) == 0) |
| 2798 { | |
| 2799 vim_str2nr(bp + 5, NULL, &l, TRUE, TRUE, NULL, NULL); | |
| 2800 bp += l + 5; | |
| 2801 break; | |
| 2802 } | |
| 7 | 2803 } |
| 2804 | |
| 2805 if (*bp == '>') /* found matching '>' */ | |
| 2806 { | |
| 2807 end_of_name = bp + 1; | |
| 2808 | |
| 2809 /* Which modifiers are given? */ | |
| 2810 modifiers = 0x0; | |
| 2811 for (bp = src + 1; bp < last_dash; bp++) | |
| 2812 { | |
| 2813 if (*bp != '-') | |
| 2814 { | |
| 2815 bit = name_to_mod_mask(*bp); | |
| 2816 if (bit == 0x0) | |
| 2817 break; /* Illegal modifier name */ | |
| 2818 modifiers |= bit; | |
| 2819 } | |
| 2820 } | |
| 2821 | |
| 2822 /* | |
| 2823 * Legal modifier name. | |
| 2824 */ | |
| 2825 if (bp >= last_dash) | |
| 2826 { | |
| 3024 | 2827 if (STRNICMP(last_dash + 1, "char-", 5) == 0 |
| 2828 && VIM_ISDIGIT(last_dash[6])) | |
| 2829 { | |
| 2830 /* <Char-123> or <Char-033> or <Char-0x33> */ | |
| 2831 vim_str2nr(last_dash + 6, NULL, NULL, TRUE, TRUE, NULL, &n); | |
| 3026 | 2832 key = (int)n; |
| 3024 | 2833 } |
| 7 | 2834 else |
| 180 | 2835 { |
| 3026 | 2836 /* |
| 2837 * Modifier with single letter, or special key name. | |
| 2838 */ | |
| 2839 #ifdef FEAT_MBYTE | |
| 2840 if (has_mbyte) | |
| 2841 l = mb_ptr2len(last_dash + 1); | |
| 2842 else | |
| 2843 #endif | |
| 2844 l = 1; | |
| 2845 if (modifiers != 0 && last_dash[l + 1] == '>') | |
| 2846 key = PTR2CHAR(last_dash + 1); | |
| 2847 else | |
| 2848 { | |
| 2849 key = get_special_key_code(last_dash + 1); | |
| 2850 if (!keep_x_key) | |
| 2851 key = handle_x_keys(key); | |
| 2852 } | |
| 180 | 2853 } |
| 7 | 2854 |
| 2855 /* | |
| 2856 * get_special_key_code() may return NUL for invalid | |
| 2857 * special key name. | |
| 2858 */ | |
| 2859 if (key != NUL) | |
| 2860 { | |
| 2861 /* | |
| 2862 * Only use a modifier when there is no special key code that | |
| 2863 * includes the modifier. | |
| 2864 */ | |
| 2865 key = simplify_key(key, &modifiers); | |
| 2866 | |
| 2867 if (!keycode) | |
| 2868 { | |
| 2869 /* don't want keycode, use single byte code */ | |
| 2870 if (key == K_BS) | |
| 2871 key = BS; | |
| 2872 else if (key == K_DEL || key == K_KDEL) | |
| 2873 key = DEL; | |
| 2874 } | |
| 2875 | |
| 2876 /* | |
| 2877 * Normal Key with modifier: Try to make a single byte code. | |
| 2878 */ | |
| 2879 if (!IS_SPECIAL(key)) | |
| 2880 key = extract_modifiers(key, &modifiers); | |
| 2881 | |
| 2882 *modp = modifiers; | |
| 2883 *srcp = end_of_name; | |
| 2884 return key; | |
| 2885 } | |
| 2886 } | |
| 2887 } | |
| 2888 return 0; | |
| 2889 } | |
| 2890 | |
| 2891 /* | |
| 2892 * Try to include modifiers in the key. | |
| 2893 * Changes "Shift-a" to 'A', "Alt-A" to 0xc0, etc. | |
| 2894 */ | |
| 2895 int | |
| 2896 extract_modifiers(key, modp) | |
| 2897 int key; | |
| 2898 int *modp; | |
| 2899 { | |
| 2900 int modifiers = *modp; | |
| 2901 | |
| 2902 #ifdef MACOS | |
| 2903 /* Command-key really special, No fancynest */ | |
| 2904 if (!(modifiers & MOD_MASK_CMD)) | |
| 2905 #endif | |
| 2906 if ((modifiers & MOD_MASK_SHIFT) && ASCII_ISALPHA(key)) | |
| 2907 { | |
| 2908 key = TOUPPER_ASC(key); | |
| 2909 modifiers &= ~MOD_MASK_SHIFT; | |
| 2910 } | |
| 2911 if ((modifiers & MOD_MASK_CTRL) | |
| 2912 #ifdef EBCDIC | |
| 2913 /* * TODO: EBCDIC Better use: | |
| 2914 * && (Ctrl_chr(key) || key == '?') | |
| 2915 * ??? */ | |
| 2916 && strchr("?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_", key) | |
| 2917 != NULL | |
| 2918 #else | |
| 2919 && ((key >= '?' && key <= '_') || ASCII_ISALPHA(key)) | |
| 2920 #endif | |
| 2921 ) | |
| 2922 { | |
| 2923 key = Ctrl_chr(key); | |
| 2924 modifiers &= ~MOD_MASK_CTRL; | |
| 2925 /* <C-@> is <Nul> */ | |
| 2926 if (key == 0) | |
| 2927 key = K_ZERO; | |
| 2928 } | |
| 2929 #ifdef MACOS | |
| 2930 /* Command-key really special, No fancynest */ | |
| 2931 if (!(modifiers & MOD_MASK_CMD)) | |
| 2932 #endif | |
| 2933 if ((modifiers & MOD_MASK_ALT) && key < 0x80 | |
| 2934 #ifdef FEAT_MBYTE | |
| 2935 && !enc_dbcs /* avoid creating a lead byte */ | |
| 2936 #endif | |
| 2937 ) | |
| 2938 { | |
| 2939 key |= 0x80; | |
| 2940 modifiers &= ~MOD_MASK_ALT; /* remove the META modifier */ | |
| 2941 } | |
| 2942 | |
| 2943 *modp = modifiers; | |
| 2944 return key; | |
| 2945 } | |
| 2946 | |
| 2947 /* | |
| 2948 * Try to find key "c" in the special key table. | |
| 2949 * Return the index when found, -1 when not found. | |
| 2950 */ | |
| 2951 int | |
| 2952 find_special_key_in_table(c) | |
| 2953 int c; | |
| 2954 { | |
| 2955 int i; | |
| 2956 | |
| 2957 for (i = 0; key_names_table[i].name != NULL; i++) | |
| 2958 if (c == key_names_table[i].key) | |
| 2959 break; | |
| 2960 if (key_names_table[i].name == NULL) | |
| 2961 i = -1; | |
| 2962 return i; | |
| 2963 } | |
| 2964 | |
| 2965 /* | |
| 2966 * Find the special key with the given name (the given string does not have to | |
| 2967 * end with NUL, the name is assumed to end before the first non-idchar). | |
| 2968 * If the name starts with "t_" the next two characters are interpreted as a | |
| 2969 * termcap name. | |
| 2970 * Return the key code, or 0 if not found. | |
| 2971 */ | |
| 2972 int | |
| 2973 get_special_key_code(name) | |
| 2974 char_u *name; | |
| 2975 { | |
| 2976 char_u *table_name; | |
| 2977 char_u string[3]; | |
| 2978 int i, j; | |
| 2979 | |
| 2980 /* | |
| 2981 * If it's <t_xx> we get the code for xx from the termcap | |
| 2982 */ | |
| 2983 if (name[0] == 't' && name[1] == '_' && name[2] != NUL && name[3] != NUL) | |
| 2984 { | |
| 2985 string[0] = name[2]; | |
| 2986 string[1] = name[3]; | |
| 2987 string[2] = NUL; | |
| 2988 if (add_termcap_entry(string, FALSE) == OK) | |
| 2989 return TERMCAP2KEY(name[2], name[3]); | |
| 2990 } | |
| 2991 else | |
| 2992 for (i = 0; key_names_table[i].name != NULL; i++) | |
| 2993 { | |
| 2994 table_name = key_names_table[i].name; | |
| 2995 for (j = 0; vim_isIDc(name[j]) && table_name[j] != NUL; j++) | |
| 2996 if (TOLOWER_ASC(table_name[j]) != TOLOWER_ASC(name[j])) | |
| 2997 break; | |
| 2998 if (!vim_isIDc(name[j]) && table_name[j] == NUL) | |
| 2999 return key_names_table[i].key; | |
| 3000 } | |
| 3001 return 0; | |
| 3002 } | |
| 3003 | |
| 1661 | 3004 #if defined(FEAT_CMDL_COMPL) || defined(PROTO) |
| 7 | 3005 char_u * |
| 3006 get_key_name(i) | |
| 3007 int i; | |
| 3008 { | |
| 1881 | 3009 if (i >= (int)KEY_NAMES_TABLE_LEN) |
| 7 | 3010 return NULL; |
| 3011 return key_names_table[i].name; | |
| 3012 } | |
| 3013 #endif | |
| 3014 | |
| 1661 | 3015 #if defined(FEAT_MOUSE) || defined(PROTO) |
| 7 | 3016 /* |
| 3017 * Look up the given mouse code to return the relevant information in the other | |
| 3018 * arguments. Return which button is down or was released. | |
| 3019 */ | |
| 3020 int | |
| 3021 get_mouse_button(code, is_click, is_drag) | |
| 3022 int code; | |
| 3023 int *is_click; | |
| 3024 int *is_drag; | |
| 3025 { | |
| 3026 int i; | |
| 3027 | |
| 3028 for (i = 0; mouse_table[i].pseudo_code; i++) | |
| 3029 if (code == mouse_table[i].pseudo_code) | |
| 3030 { | |
| 3031 *is_click = mouse_table[i].is_click; | |
| 3032 *is_drag = mouse_table[i].is_drag; | |
| 3033 return mouse_table[i].button; | |
| 3034 } | |
| 3035 return 0; /* Shouldn't get here */ | |
| 3036 } | |
| 3037 | |
| 3038 /* | |
| 3039 * Return the appropriate pseudo mouse event token (KE_LEFTMOUSE etc) based on | |
| 3040 * the given information about which mouse button is down, and whether the | |
| 3041 * mouse was clicked, dragged or released. | |
| 3042 */ | |
| 3043 int | |
| 3044 get_pseudo_mouse_code(button, is_click, is_drag) | |
| 3045 int button; /* eg MOUSE_LEFT */ | |
| 3046 int is_click; | |
| 3047 int is_drag; | |
| 3048 { | |
| 3049 int i; | |
| 3050 | |
| 3051 for (i = 0; mouse_table[i].pseudo_code; i++) | |
| 3052 if (button == mouse_table[i].button | |
| 3053 && is_click == mouse_table[i].is_click | |
| 3054 && is_drag == mouse_table[i].is_drag) | |
| 3055 { | |
| 3056 #ifdef FEAT_GUI | |
| 263 | 3057 /* Trick: a non mappable left click and release has mouse_col -1 |
| 3058 * or added MOUSE_COLOFF. Used for 'mousefocus' in | |
| 3059 * gui_mouse_moved() */ | |
| 3060 if (mouse_col < 0 || mouse_col > MOUSE_COLOFF) | |
| 7 | 3061 { |
| 263 | 3062 if (mouse_col < 0) |
| 3063 mouse_col = 0; | |
| 3064 else | |
| 3065 mouse_col -= MOUSE_COLOFF; | |
| 7 | 3066 if (mouse_table[i].pseudo_code == (int)KE_LEFTMOUSE) |
| 3067 return (int)KE_LEFTMOUSE_NM; | |
| 3068 if (mouse_table[i].pseudo_code == (int)KE_LEFTRELEASE) | |
| 3069 return (int)KE_LEFTRELEASE_NM; | |
| 3070 } | |
| 3071 #endif | |
| 3072 return mouse_table[i].pseudo_code; | |
| 3073 } | |
| 1209 | 3074 return (int)KE_IGNORE; /* not recognized, ignore it */ |
| 7 | 3075 } |
| 3076 #endif /* FEAT_MOUSE */ | |
| 3077 | |
| 3078 /* | |
| 3079 * Return the current end-of-line type: EOL_DOS, EOL_UNIX or EOL_MAC. | |
| 3080 */ | |
| 3081 int | |
| 3082 get_fileformat(buf) | |
| 3083 buf_T *buf; | |
| 3084 { | |
| 3085 int c = *buf->b_p_ff; | |
| 3086 | |
| 3087 if (buf->b_p_bin || c == 'u') | |
| 3088 return EOL_UNIX; | |
| 3089 if (c == 'm') | |
| 3090 return EOL_MAC; | |
| 3091 return EOL_DOS; | |
| 3092 } | |
| 3093 | |
| 3094 /* | |
| 3095 * Like get_fileformat(), but override 'fileformat' with "p" for "++opt=val" | |
| 3096 * argument. | |
| 3097 */ | |
| 3098 int | |
| 3099 get_fileformat_force(buf, eap) | |
| 3100 buf_T *buf; | |
| 3101 exarg_T *eap; /* can be NULL! */ | |
| 3102 { | |
| 3103 int c; | |
| 3104 | |
| 3105 if (eap != NULL && eap->force_ff != 0) | |
| 3106 c = eap->cmd[eap->force_ff]; | |
| 3107 else | |
| 3108 { | |
| 3109 if ((eap != NULL && eap->force_bin != 0) | |
| 3110 ? (eap->force_bin == FORCE_BIN) : buf->b_p_bin) | |
| 3111 return EOL_UNIX; | |
| 3112 c = *buf->b_p_ff; | |
| 3113 } | |
| 3114 if (c == 'u') | |
| 3115 return EOL_UNIX; | |
| 3116 if (c == 'm') | |
| 3117 return EOL_MAC; | |
| 3118 return EOL_DOS; | |
| 3119 } | |
| 3120 | |
| 3121 /* | |
| 3122 * Set the current end-of-line type to EOL_DOS, EOL_UNIX or EOL_MAC. | |
| 3123 * Sets both 'textmode' and 'fileformat'. | |
| 3124 * Note: Does _not_ set global value of 'textmode'! | |
| 3125 */ | |
| 3126 void | |
| 3127 set_fileformat(t, opt_flags) | |
| 3128 int t; | |
| 3129 int opt_flags; /* OPT_LOCAL and/or OPT_GLOBAL */ | |
| 3130 { | |
| 3131 char *p = NULL; | |
| 3132 | |
| 3133 switch (t) | |
| 3134 { | |
| 3135 case EOL_DOS: | |
| 3136 p = FF_DOS; | |
| 3137 curbuf->b_p_tx = TRUE; | |
| 3138 break; | |
| 3139 case EOL_UNIX: | |
| 3140 p = FF_UNIX; | |
| 3141 curbuf->b_p_tx = FALSE; | |
| 3142 break; | |
| 3143 case EOL_MAC: | |
| 3144 p = FF_MAC; | |
| 3145 curbuf->b_p_tx = FALSE; | |
| 3146 break; | |
| 3147 } | |
| 3148 if (p != NULL) | |
| 3149 set_string_option_direct((char_u *)"ff", -1, (char_u *)p, | |
| 694 | 3150 OPT_FREE | opt_flags, 0); |
| 3151 | |
| 7 | 3152 #ifdef FEAT_WINDOWS |
| 671 | 3153 /* This may cause the buffer to become (un)modified. */ |
| 7 | 3154 check_status(curbuf); |
| 673 | 3155 redraw_tabline = TRUE; |
| 7 | 3156 #endif |
| 3157 #ifdef FEAT_TITLE | |
| 3158 need_maketitle = TRUE; /* set window title later */ | |
| 3159 #endif | |
| 3160 } | |
| 3161 | |
| 3162 /* | |
| 3163 * Return the default fileformat from 'fileformats'. | |
| 3164 */ | |
| 3165 int | |
| 3166 default_fileformat() | |
| 3167 { | |
| 3168 switch (*p_ffs) | |
| 3169 { | |
| 3170 case 'm': return EOL_MAC; | |
| 3171 case 'd': return EOL_DOS; | |
| 3172 } | |
| 3173 return EOL_UNIX; | |
| 3174 } | |
| 3175 | |
| 3176 /* | |
| 3177 * Call shell. Calls mch_call_shell, with 'shellxquote' added. | |
| 3178 */ | |
| 3179 int | |
| 3180 call_shell(cmd, opt) | |
| 3181 char_u *cmd; | |
| 3182 int opt; | |
| 3183 { | |
| 3184 char_u *ncmd; | |
| 3185 int retval; | |
| 170 | 3186 #ifdef FEAT_PROFILE |
| 3187 proftime_T wait_time; | |
| 3188 #endif | |
| 7 | 3189 |
| 3190 if (p_verbose > 3) | |
| 3191 { | |
| 293 | 3192 verbose_enter(); |
| 273 | 3193 smsg((char_u *)_("Calling shell to execute: \"%s\""), |
| 7 | 3194 cmd == NULL ? p_sh : cmd); |
| 3195 out_char('\n'); | |
| 3196 cursor_on(); | |
| 293 | 3197 verbose_leave(); |
| 7 | 3198 } |
| 3199 | |
| 170 | 3200 #ifdef FEAT_PROFILE |
| 789 | 3201 if (do_profiling == PROF_YES) |
| 170 | 3202 prof_child_enter(&wait_time); |
| 3203 #endif | |
| 3204 | |
| 7 | 3205 if (*p_sh == NUL) |
| 3206 { | |
| 3207 EMSG(_(e_shellempty)); | |
| 3208 retval = -1; | |
| 3209 } | |
| 3210 else | |
| 3211 { | |
| 3212 #ifdef FEAT_GUI_MSWIN | |
| 3213 /* Don't hide the pointer while executing a shell command. */ | |
| 3214 gui_mch_mousehide(FALSE); | |
| 3215 #endif | |
| 3216 #ifdef FEAT_GUI | |
| 3217 ++hold_gui_events; | |
| 3218 #endif | |
| 3219 /* The external command may update a tags file, clear cached tags. */ | |
| 3220 tag_freematch(); | |
| 3221 | |
| 3222 if (cmd == NULL || *p_sxq == NUL) | |
| 3223 retval = mch_call_shell(cmd, opt); | |
| 3224 else | |
| 3225 { | |
| 3359 | 3226 char_u *ecmd = cmd; |
| 3227 | |
| 3228 if (*p_sxe != NUL && STRCMP(p_sxq, "(") == 0) | |
| 3229 { | |
| 3230 ecmd = vim_strsave_escaped_ext(cmd, p_sxe, '^', FALSE); | |
| 3231 if (ecmd == NULL) | |
| 3232 ecmd = cmd; | |
| 3233 } | |
| 3234 ncmd = alloc((unsigned)(STRLEN(ecmd) + STRLEN(p_sxq) * 2 + 1)); | |
| 7 | 3235 if (ncmd != NULL) |
| 3236 { | |
| 3237 STRCPY(ncmd, p_sxq); | |
| 3359 | 3238 STRCAT(ncmd, ecmd); |
| 3357 | 3239 /* When 'shellxquote' is ( append ). |
| 3240 * When 'shellxquote' is "( append )". */ | |
| 3241 STRCAT(ncmd, STRCMP(p_sxq, "(") == 0 ? (char_u *)")" | |
| 3242 : STRCMP(p_sxq, "\"(") == 0 ? (char_u *)")\"" | |
| 3243 : p_sxq); | |
| 7 | 3244 retval = mch_call_shell(ncmd, opt); |
| 3245 vim_free(ncmd); | |
| 3246 } | |
| 3247 else | |
| 3248 retval = -1; | |
| 3359 | 3249 if (ecmd != cmd) |
| 3250 vim_free(ecmd); | |
| 7 | 3251 } |
| 3252 #ifdef FEAT_GUI | |
| 3253 --hold_gui_events; | |
| 3254 #endif | |
| 3255 /* | |
| 3256 * Check the window size, in case it changed while executing the | |
| 3257 * external command. | |
| 3258 */ | |
| 3259 shell_resized_check(); | |
| 3260 } | |
| 3261 | |
| 3262 #ifdef FEAT_EVAL | |
| 3263 set_vim_var_nr(VV_SHELL_ERROR, (long)retval); | |
| 170 | 3264 # ifdef FEAT_PROFILE |
| 789 | 3265 if (do_profiling == PROF_YES) |
| 170 | 3266 prof_child_exit(&wait_time); |
| 3267 # endif | |
| 7 | 3268 #endif |
| 3269 | |
| 3270 return retval; | |
| 3271 } | |
| 3272 | |
| 3273 /* | |
| 789 | 3274 * VISUAL, SELECTMODE and OP_PENDING State are never set, they are equal to |
| 3275 * NORMAL State with a condition. This function returns the real State. | |
| 7 | 3276 */ |
| 3277 int | |
| 3278 get_real_state() | |
| 3279 { | |
| 3280 if (State & NORMAL) | |
| 3281 { | |
| 3282 #ifdef FEAT_VISUAL | |
| 3283 if (VIsual_active) | |
| 789 | 3284 { |
| 3285 if (VIsual_select) | |
| 3286 return SELECTMODE; | |
| 7 | 3287 return VISUAL; |
| 789 | 3288 } |
| 7 | 3289 else |
| 3290 #endif | |
| 3291 if (finish_op) | |
| 789 | 3292 return OP_PENDING; |
| 7 | 3293 } |
| 3294 return State; | |
| 3295 } | |
| 3296 | |
| 39 | 3297 #if defined(FEAT_MBYTE) || defined(PROTO) |
| 3298 /* | |
| 3299 * Return TRUE if "p" points to just after a path separator. | |
| 2939 | 3300 * Takes care of multi-byte characters. |
| 39 | 3301 * "b" must point to the start of the file name |
| 3302 */ | |
| 3303 int | |
| 3304 after_pathsep(b, p) | |
| 3305 char_u *b; | |
| 3306 char_u *p; | |
| 3307 { | |
| 2939 | 3308 return p > b && vim_ispathsep(p[-1]) |
| 39 | 3309 && (!has_mbyte || (*mb_head_off)(b, p - 1) == 0); |
| 3310 } | |
| 3311 #endif | |
| 3312 | |
| 3313 /* | |
| 3314 * Return TRUE if file names "f1" and "f2" are in the same directory. | |
| 3315 * "f1" may be a short name, "f2" must be a full path. | |
| 3316 */ | |
| 3317 int | |
| 3318 same_directory(f1, f2) | |
| 3319 char_u *f1; | |
| 3320 char_u *f2; | |
| 3321 { | |
| 3322 char_u ffname[MAXPATHL]; | |
| 3323 char_u *t1; | |
| 3324 char_u *t2; | |
| 3325 | |
| 3326 /* safety check */ | |
| 3327 if (f1 == NULL || f2 == NULL) | |
| 3328 return FALSE; | |
| 3329 | |
| 3330 (void)vim_FullName(f1, ffname, MAXPATHL, FALSE); | |
| 3331 t1 = gettail_sep(ffname); | |
| 3332 t2 = gettail_sep(f2); | |
| 3333 return (t1 - ffname == t2 - f2 | |
| 3334 && pathcmp((char *)ffname, (char *)f2, (int)(t1 - ffname)) == 0); | |
| 3335 } | |
| 3336 | |
| 7 | 3337 #if defined(FEAT_SESSION) || defined(MSWIN) || defined(FEAT_GUI_MAC) \ |
| 574 | 3338 || ((defined(FEAT_GUI_GTK)) \ |
| 11 | 3339 && ( defined(FEAT_WINDOWS) || defined(FEAT_DND)) ) \ |
| 7 | 3340 || defined(FEAT_SUN_WORKSHOP) || defined(FEAT_NETBEANS_INTG) \ |
| 3341 || defined(PROTO) | |
| 3342 /* | |
| 3343 * Change to a file's directory. | |
| 3344 * Caller must call shorten_fnames()! | |
| 3345 * Return OK or FAIL. | |
| 3346 */ | |
| 3347 int | |
| 3348 vim_chdirfile(fname) | |
| 3349 char_u *fname; | |
| 3350 { | |
| 39 | 3351 char_u dir[MAXPATHL]; |
| 3352 | |
| 418 | 3353 vim_strncpy(dir, fname, MAXPATHL - 1); |
| 39 | 3354 *gettail_sep(dir) = NUL; |
| 3355 return mch_chdir((char *)dir) == 0 ? OK : FAIL; | |
| 7 | 3356 } |
| 3357 #endif | |
| 3358 | |
| 3359 #if defined(STAT_IGNORES_SLASH) || defined(PROTO) | |
| 3360 /* | |
| 3361 * Check if "name" ends in a slash and is not a directory. | |
| 3362 * Used for systems where stat() ignores a trailing slash on a file name. | |
| 3363 * The Vim code assumes a trailing slash is only ignored for a directory. | |
| 3364 */ | |
| 3365 int | |
| 3366 illegal_slash(name) | |
| 3367 char *name; | |
| 3368 { | |
| 3369 if (name[0] == NUL) | |
| 3370 return FALSE; /* no file name is not illegal */ | |
| 3371 if (name[strlen(name) - 1] != '/') | |
| 3372 return FALSE; /* no trailing slash */ | |
| 3373 if (mch_isdir((char_u *)name)) | |
| 3374 return FALSE; /* trailing slash for a directory */ | |
| 3375 return TRUE; | |
| 3376 } | |
| 3377 #endif | |
| 3378 | |
| 3379 #if defined(CURSOR_SHAPE) || defined(PROTO) | |
| 3380 | |
| 3381 /* | |
| 3382 * Handling of cursor and mouse pointer shapes in various modes. | |
| 3383 */ | |
| 3384 | |
| 3385 cursorentry_T shape_table[SHAPE_IDX_COUNT] = | |
| 3386 { | |
| 3387 /* The values will be filled in from the 'guicursor' and 'mouseshape' | |
| 3388 * defaults when Vim starts. | |
| 3389 * Adjust the SHAPE_IDX_ defines when making changes! */ | |
| 3390 {0, 0, 0, 700L, 400L, 250L, 0, 0, "n", SHAPE_CURSOR+SHAPE_MOUSE}, | |
| 3391 {0, 0, 0, 700L, 400L, 250L, 0, 0, "v", SHAPE_CURSOR+SHAPE_MOUSE}, | |
| 3392 {0, 0, 0, 700L, 400L, 250L, 0, 0, "i", SHAPE_CURSOR+SHAPE_MOUSE}, | |
| 3393 {0, 0, 0, 700L, 400L, 250L, 0, 0, "r", SHAPE_CURSOR+SHAPE_MOUSE}, | |
| 3394 {0, 0, 0, 700L, 400L, 250L, 0, 0, "c", SHAPE_CURSOR+SHAPE_MOUSE}, | |
| 3395 {0, 0, 0, 700L, 400L, 250L, 0, 0, "ci", SHAPE_CURSOR+SHAPE_MOUSE}, | |
| 3396 {0, 0, 0, 700L, 400L, 250L, 0, 0, "cr", SHAPE_CURSOR+SHAPE_MOUSE}, | |
| 3397 {0, 0, 0, 700L, 400L, 250L, 0, 0, "o", SHAPE_CURSOR+SHAPE_MOUSE}, | |
| 3398 {0, 0, 0, 700L, 400L, 250L, 0, 0, "ve", SHAPE_CURSOR+SHAPE_MOUSE}, | |
| 3399 {0, 0, 0, 0L, 0L, 0L, 0, 0, "e", SHAPE_MOUSE}, | |
| 3400 {0, 0, 0, 0L, 0L, 0L, 0, 0, "s", SHAPE_MOUSE}, | |
| 3401 {0, 0, 0, 0L, 0L, 0L, 0, 0, "sd", SHAPE_MOUSE}, | |
| 3402 {0, 0, 0, 0L, 0L, 0L, 0, 0, "vs", SHAPE_MOUSE}, | |
| 3403 {0, 0, 0, 0L, 0L, 0L, 0, 0, "vd", SHAPE_MOUSE}, | |
| 3404 {0, 0, 0, 0L, 0L, 0L, 0, 0, "m", SHAPE_MOUSE}, | |
| 3405 {0, 0, 0, 0L, 0L, 0L, 0, 0, "ml", SHAPE_MOUSE}, | |
| 3406 {0, 0, 0, 100L, 100L, 100L, 0, 0, "sm", SHAPE_CURSOR}, | |
| 3407 }; | |
| 3408 | |
| 3409 #ifdef FEAT_MOUSESHAPE | |
| 3410 /* | |
| 3411 * Table with names for mouse shapes. Keep in sync with all the tables for | |
| 3412 * mch_set_mouse_shape()!. | |
| 3413 */ | |
| 3414 static char * mshape_names[] = | |
| 3415 { | |
| 3416 "arrow", /* default, must be the first one */ | |
| 3417 "blank", /* hidden */ | |
| 3418 "beam", | |
| 3419 "updown", | |
| 3420 "udsizing", | |
| 3421 "leftright", | |
| 3422 "lrsizing", | |
| 3423 "busy", | |
| 3424 "no", | |
| 3425 "crosshair", | |
| 3426 "hand1", | |
| 3427 "hand2", | |
| 3428 "pencil", | |
| 3429 "question", | |
| 3430 "rightup-arrow", | |
| 3431 "up-arrow", | |
| 3432 NULL | |
| 3433 }; | |
| 3434 #endif | |
| 3435 | |
| 3436 /* | |
| 3437 * Parse the 'guicursor' option ("what" is SHAPE_CURSOR) or 'mouseshape' | |
| 3438 * ("what" is SHAPE_MOUSE). | |
| 3439 * Returns error message for an illegal option, NULL otherwise. | |
| 3440 */ | |
| 3441 char_u * | |
| 3442 parse_shape_opt(what) | |
| 3443 int what; | |
| 3444 { | |
| 3445 char_u *modep; | |
| 3446 char_u *colonp; | |
| 3447 char_u *commap; | |
| 3448 char_u *slashp; | |
| 3449 char_u *p, *endp; | |
| 3450 int idx = 0; /* init for GCC */ | |
| 3451 int all_idx; | |
| 3452 int len; | |
| 3453 int i; | |
| 3454 long n; | |
| 3455 int found_ve = FALSE; /* found "ve" flag */ | |
| 3456 int round; | |
| 3457 | |
| 3458 /* | |
| 3459 * First round: check for errors; second round: do it for real. | |
| 3460 */ | |
| 3461 for (round = 1; round <= 2; ++round) | |
| 3462 { | |
| 3463 /* | |
| 3464 * Repeat for all comma separated parts. | |
| 3465 */ | |
| 3466 #ifdef FEAT_MOUSESHAPE | |
| 3467 if (what == SHAPE_MOUSE) | |
| 3468 modep = p_mouseshape; | |
| 3469 else | |
| 3470 #endif | |
| 3471 modep = p_guicursor; | |
| 3472 while (*modep != NUL) | |
| 3473 { | |
| 3474 colonp = vim_strchr(modep, ':'); | |
| 3475 if (colonp == NULL) | |
| 3476 return (char_u *)N_("E545: Missing colon"); | |
| 3477 if (colonp == modep) | |
| 3478 return (char_u *)N_("E546: Illegal mode"); | |
| 3479 commap = vim_strchr(modep, ','); | |
| 3480 | |
| 3481 /* | |
| 3482 * Repeat for all mode's before the colon. | |
| 3483 * For the 'a' mode, we loop to handle all the modes. | |
| 3484 */ | |
| 3485 all_idx = -1; | |
| 3486 while (modep < colonp || all_idx >= 0) | |
| 3487 { | |
| 3488 if (all_idx < 0) | |
| 3489 { | |
| 3490 /* Find the mode. */ | |
| 3491 if (modep[1] == '-' || modep[1] == ':') | |
| 3492 len = 1; | |
| 3493 else | |
| 3494 len = 2; | |
| 3495 if (len == 1 && TOLOWER_ASC(modep[0]) == 'a') | |
| 3496 all_idx = SHAPE_IDX_COUNT - 1; | |
| 3497 else | |
| 3498 { | |
| 3499 for (idx = 0; idx < SHAPE_IDX_COUNT; ++idx) | |
| 3500 if (STRNICMP(modep, shape_table[idx].name, len) | |
| 3501 == 0) | |
| 3502 break; | |
| 3503 if (idx == SHAPE_IDX_COUNT | |
| 3504 || (shape_table[idx].used_for & what) == 0) | |
| 3505 return (char_u *)N_("E546: Illegal mode"); | |
| 3506 if (len == 2 && modep[0] == 'v' && modep[1] == 'e') | |
| 3507 found_ve = TRUE; | |
| 3508 } | |
| 3509 modep += len + 1; | |
| 3510 } | |
| 3511 | |
| 3512 if (all_idx >= 0) | |
| 3513 idx = all_idx--; | |
| 3514 else if (round == 2) | |
| 3515 { | |
| 3516 #ifdef FEAT_MOUSESHAPE | |
| 3517 if (what == SHAPE_MOUSE) | |
| 3518 { | |
| 3519 /* Set the default, for the missing parts */ | |
| 3520 shape_table[idx].mshape = 0; | |
| 3521 } | |
| 3522 else | |
| 3523 #endif | |
| 3524 { | |
| 3525 /* Set the defaults, for the missing parts */ | |
| 3526 shape_table[idx].shape = SHAPE_BLOCK; | |
| 3527 shape_table[idx].blinkwait = 700L; | |
| 3528 shape_table[idx].blinkon = 400L; | |
| 3529 shape_table[idx].blinkoff = 250L; | |
| 3530 } | |
| 3531 } | |
| 3532 | |
| 3533 /* Parse the part after the colon */ | |
| 3534 for (p = colonp + 1; *p && *p != ','; ) | |
| 3535 { | |
| 3536 #ifdef FEAT_MOUSESHAPE | |
| 3537 if (what == SHAPE_MOUSE) | |
| 3538 { | |
| 3539 for (i = 0; ; ++i) | |
| 3540 { | |
| 3541 if (mshape_names[i] == NULL) | |
| 3542 { | |
| 3543 if (!VIM_ISDIGIT(*p)) | |
| 3544 return (char_u *)N_("E547: Illegal mouseshape"); | |
| 3545 if (round == 2) | |
| 3546 shape_table[idx].mshape = | |
| 3547 getdigits(&p) + MSHAPE_NUMBERED; | |
| 3548 else | |
| 3549 (void)getdigits(&p); | |
| 3550 break; | |
| 3551 } | |
| 3552 len = (int)STRLEN(mshape_names[i]); | |
| 3553 if (STRNICMP(p, mshape_names[i], len) == 0) | |
| 3554 { | |
| 3555 if (round == 2) | |
| 3556 shape_table[idx].mshape = i; | |
| 3557 p += len; | |
| 3558 break; | |
| 3559 } | |
| 3560 } | |
| 3561 } | |
| 3562 else /* if (what == SHAPE_MOUSE) */ | |
| 3563 #endif | |
| 3564 { | |
| 3565 /* | |
| 3566 * First handle the ones with a number argument. | |
| 3567 */ | |
| 3568 i = *p; | |
| 3569 len = 0; | |
| 3570 if (STRNICMP(p, "ver", 3) == 0) | |
| 3571 len = 3; | |
| 3572 else if (STRNICMP(p, "hor", 3) == 0) | |
| 3573 len = 3; | |
| 3574 else if (STRNICMP(p, "blinkwait", 9) == 0) | |
| 3575 len = 9; | |
| 3576 else if (STRNICMP(p, "blinkon", 7) == 0) | |
| 3577 len = 7; | |
| 3578 else if (STRNICMP(p, "blinkoff", 8) == 0) | |
| 3579 len = 8; | |
| 3580 if (len != 0) | |
| 3581 { | |
| 3582 p += len; | |
| 3583 if (!VIM_ISDIGIT(*p)) | |
| 3584 return (char_u *)N_("E548: digit expected"); | |
| 3585 n = getdigits(&p); | |
| 3586 if (len == 3) /* "ver" or "hor" */ | |
| 3587 { | |
| 3588 if (n == 0) | |
| 3589 return (char_u *)N_("E549: Illegal percentage"); | |
| 3590 if (round == 2) | |
| 3591 { | |
| 3592 if (TOLOWER_ASC(i) == 'v') | |
| 3593 shape_table[idx].shape = SHAPE_VER; | |
| 3594 else | |
| 3595 shape_table[idx].shape = SHAPE_HOR; | |
| 3596 shape_table[idx].percentage = n; | |
| 3597 } | |
| 3598 } | |
| 3599 else if (round == 2) | |
| 3600 { | |
| 3601 if (len == 9) | |
| 3602 shape_table[idx].blinkwait = n; | |
| 3603 else if (len == 7) | |
| 3604 shape_table[idx].blinkon = n; | |
| 3605 else | |
| 3606 shape_table[idx].blinkoff = n; | |
| 3607 } | |
| 3608 } | |
| 3609 else if (STRNICMP(p, "block", 5) == 0) | |
| 3610 { | |
| 3611 if (round == 2) | |
| 3612 shape_table[idx].shape = SHAPE_BLOCK; | |
| 3613 p += 5; | |
| 3614 } | |
| 3615 else /* must be a highlight group name then */ | |
| 3616 { | |
| 3617 endp = vim_strchr(p, '-'); | |
| 3618 if (commap == NULL) /* last part */ | |
| 3619 { | |
| 3620 if (endp == NULL) | |
| 3621 endp = p + STRLEN(p); /* find end of part */ | |
| 3622 } | |
| 3623 else if (endp > commap || endp == NULL) | |
| 3624 endp = commap; | |
| 3625 slashp = vim_strchr(p, '/'); | |
| 3626 if (slashp != NULL && slashp < endp) | |
| 3627 { | |
| 3628 /* "group/langmap_group" */ | |
| 3629 i = syn_check_group(p, (int)(slashp - p)); | |
| 3630 p = slashp + 1; | |
| 3631 } | |
| 3632 if (round == 2) | |
| 3633 { | |
| 3634 shape_table[idx].id = syn_check_group(p, | |
| 3635 (int)(endp - p)); | |
| 3636 shape_table[idx].id_lm = shape_table[idx].id; | |
| 3637 if (slashp != NULL && slashp < endp) | |
| 3638 shape_table[idx].id = i; | |
| 3639 } | |
| 3640 p = endp; | |
| 3641 } | |
| 3642 } /* if (what != SHAPE_MOUSE) */ | |
| 3643 | |
| 3644 if (*p == '-') | |
| 3645 ++p; | |
| 3646 } | |
| 3647 } | |
| 3648 modep = p; | |
| 3649 if (*modep == ',') | |
| 3650 ++modep; | |
| 3651 } | |
| 3652 } | |
| 3653 | |
| 3654 /* If the 's' flag is not given, use the 'v' cursor for 's' */ | |
| 3655 if (!found_ve) | |
| 3656 { | |
| 3657 #ifdef FEAT_MOUSESHAPE | |
| 3658 if (what == SHAPE_MOUSE) | |
| 3659 { | |
| 3660 shape_table[SHAPE_IDX_VE].mshape = shape_table[SHAPE_IDX_V].mshape; | |
| 3661 } | |
| 3662 else | |
| 3663 #endif | |
| 3664 { | |
| 3665 shape_table[SHAPE_IDX_VE].shape = shape_table[SHAPE_IDX_V].shape; | |
| 3666 shape_table[SHAPE_IDX_VE].percentage = | |
| 3667 shape_table[SHAPE_IDX_V].percentage; | |
| 3668 shape_table[SHAPE_IDX_VE].blinkwait = | |
| 3669 shape_table[SHAPE_IDX_V].blinkwait; | |
| 3670 shape_table[SHAPE_IDX_VE].blinkon = | |
| 3671 shape_table[SHAPE_IDX_V].blinkon; | |
| 3672 shape_table[SHAPE_IDX_VE].blinkoff = | |
| 3673 shape_table[SHAPE_IDX_V].blinkoff; | |
| 3674 shape_table[SHAPE_IDX_VE].id = shape_table[SHAPE_IDX_V].id; | |
| 3675 shape_table[SHAPE_IDX_VE].id_lm = shape_table[SHAPE_IDX_V].id_lm; | |
| 3676 } | |
| 3677 } | |
| 3678 | |
| 3679 return NULL; | |
| 3680 } | |
| 3681 | |
| 500 | 3682 # if defined(MCH_CURSOR_SHAPE) || defined(FEAT_GUI) \ |
| 3683 || defined(FEAT_MOUSESHAPE) || defined(PROTO) | |
| 7 | 3684 /* |
| 3685 * Return the index into shape_table[] for the current mode. | |
| 3686 * When "mouse" is TRUE, consider indexes valid for the mouse pointer. | |
| 3687 */ | |
| 3688 int | |
| 3689 get_shape_idx(mouse) | |
| 3690 int mouse; | |
| 3691 { | |
| 3692 #ifdef FEAT_MOUSESHAPE | |
| 3693 if (mouse && (State == HITRETURN || State == ASKMORE)) | |
| 3694 { | |
| 3695 # ifdef FEAT_GUI | |
| 87 | 3696 int x, y; |
| 3697 gui_mch_getmouse(&x, &y); | |
| 3698 if (Y_2_ROW(y) == Rows - 1) | |
| 7 | 3699 return SHAPE_IDX_MOREL; |
| 3700 # endif | |
| 3701 return SHAPE_IDX_MORE; | |
| 3702 } | |
| 3703 if (mouse && drag_status_line) | |
| 3704 return SHAPE_IDX_SDRAG; | |
| 3705 # ifdef FEAT_VERTSPLIT | |
| 3706 if (mouse && drag_sep_line) | |
| 3707 return SHAPE_IDX_VDRAG; | |
| 3708 # endif | |
| 3709 #endif | |
| 3710 if (!mouse && State == SHOWMATCH) | |
| 3711 return SHAPE_IDX_SM; | |
| 3712 #ifdef FEAT_VREPLACE | |
| 3713 if (State & VREPLACE_FLAG) | |
| 3714 return SHAPE_IDX_R; | |
| 3715 #endif | |
| 3716 if (State & REPLACE_FLAG) | |
| 3717 return SHAPE_IDX_R; | |
| 3718 if (State & INSERT) | |
| 3719 return SHAPE_IDX_I; | |
| 3720 if (State & CMDLINE) | |
| 3721 { | |
| 3722 if (cmdline_at_end()) | |
| 3723 return SHAPE_IDX_C; | |
| 3724 if (cmdline_overstrike()) | |
| 3725 return SHAPE_IDX_CR; | |
| 3726 return SHAPE_IDX_CI; | |
| 3727 } | |
| 3728 if (finish_op) | |
| 3729 return SHAPE_IDX_O; | |
| 3730 #ifdef FEAT_VISUAL | |
| 3731 if (VIsual_active) | |
| 3732 { | |
| 3733 if (*p_sel == 'e') | |
| 3734 return SHAPE_IDX_VE; | |
| 3735 else | |
| 3736 return SHAPE_IDX_V; | |
| 3737 } | |
| 3738 #endif | |
| 3739 return SHAPE_IDX_N; | |
| 3740 } | |
| 500 | 3741 #endif |
| 7 | 3742 |
| 3743 # if defined(FEAT_MOUSESHAPE) || defined(PROTO) | |
| 3744 static int old_mouse_shape = 0; | |
| 3745 | |
| 3746 /* | |
| 3747 * Set the mouse shape: | |
| 3748 * If "shape" is -1, use shape depending on the current mode, | |
| 3749 * depending on the current state. | |
| 3750 * If "shape" is -2, only update the shape when it's CLINE or STATUS (used | |
| 3751 * when the mouse moves off the status or command line). | |
| 3752 */ | |
| 3753 void | |
| 3754 update_mouseshape(shape_idx) | |
| 3755 int shape_idx; | |
| 3756 { | |
| 3757 int new_mouse_shape; | |
| 3758 | |
| 3759 /* Only works in GUI mode. */ | |
| 227 | 3760 if (!gui.in_use || gui.starting) |
| 7 | 3761 return; |
| 3762 | |
| 3763 /* Postpone the updating when more is to come. Speeds up executing of | |
| 3764 * mappings. */ | |
| 3765 if (shape_idx == -1 && char_avail()) | |
| 3766 { | |
| 3767 postponed_mouseshape = TRUE; | |
| 3768 return; | |
| 3769 } | |
| 3770 | |
| 864 | 3771 /* When ignoring the mouse don't change shape on the statusline. */ |
| 3772 if (*p_mouse == NUL | |
| 3773 && (shape_idx == SHAPE_IDX_CLINE | |
| 3774 || shape_idx == SHAPE_IDX_STATUS | |
| 3775 || shape_idx == SHAPE_IDX_VSEP)) | |
| 3776 shape_idx = -2; | |
| 3777 | |
| 7 | 3778 if (shape_idx == -2 |
| 3779 && old_mouse_shape != shape_table[SHAPE_IDX_CLINE].mshape | |
| 3780 && old_mouse_shape != shape_table[SHAPE_IDX_STATUS].mshape | |
| 3781 && old_mouse_shape != shape_table[SHAPE_IDX_VSEP].mshape) | |
| 3782 return; | |
| 3783 if (shape_idx < 0) | |
| 3784 new_mouse_shape = shape_table[get_shape_idx(TRUE)].mshape; | |
| 3785 else | |
| 3786 new_mouse_shape = shape_table[shape_idx].mshape; | |
| 3787 if (new_mouse_shape != old_mouse_shape) | |
| 3788 { | |
| 3789 mch_set_mouse_shape(new_mouse_shape); | |
| 3790 old_mouse_shape = new_mouse_shape; | |
| 3791 } | |
| 3792 postponed_mouseshape = FALSE; | |
| 3793 } | |
| 3794 # endif | |
| 3795 | |
| 3796 #endif /* CURSOR_SHAPE */ | |
| 3797 | |
| 3798 | |
| 3799 #ifdef FEAT_CRYPT | |
| 3800 /* | |
| 1209 | 3801 * Optional encryption support. |
| 7 | 3802 * Mohsin Ahmed, mosh@sasi.com, 98-09-24 |
| 3803 * Based on zip/crypt sources. | |
| 3804 * | |
| 3805 * NOTE FOR USA: Since 2000 exporting this code from the USA is allowed to | |
| 3806 * most countries. There are a few exceptions, but that still should not be a | |
| 3807 * problem since this code was originally created in Europe and India. | |
|
2180
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
3808 * |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
3809 * Blowfish addition originally made by Mohsin Ahmed, |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
3810 * http://www.cs.albany.edu/~mosh 2010-03-14 |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
3811 * Based on blowfish by Bruce Schneier (http://www.schneier.com/blowfish.html) |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
3812 * and sha256 by Christophe Devine. |
| 7 | 3813 */ |
| 3814 | |
| 3815 /* from zip.h */ | |
| 3816 | |
| 3817 typedef unsigned short ush; /* unsigned 16-bit value */ | |
| 3818 typedef unsigned long ulg; /* unsigned 32-bit value */ | |
| 3819 | |
| 3820 static void make_crc_tab __ARGS((void)); | |
| 3821 | |
| 297 | 3822 static ulg crc_32_tab[256]; |
| 7 | 3823 |
| 3824 /* | |
| 3825 * Fill the CRC table. | |
| 3826 */ | |
| 3827 static void | |
| 3828 make_crc_tab() | |
| 3829 { | |
| 3830 ulg s,t,v; | |
| 3831 static int done = FALSE; | |
| 3832 | |
| 3833 if (done) | |
| 3834 return; | |
| 3835 for (t = 0; t < 256; t++) | |
| 3836 { | |
| 3837 v = t; | |
| 3838 for (s = 0; s < 8; s++) | |
| 3839 v = (v >> 1) ^ ((v & 1) * (ulg)0xedb88320L); | |
| 3840 crc_32_tab[t] = v; | |
| 3841 } | |
| 3842 done = TRUE; | |
| 3843 } | |
| 3844 | |
| 3845 #define CRC32(c, b) (crc_32_tab[((int)(c) ^ (b)) & 0xff] ^ ((c) >> 8)) | |
| 3846 | |
| 3847 static ulg keys[3]; /* keys defining the pseudo-random sequence */ | |
| 3848 | |
| 3849 /* | |
| 2244 | 3850 * Return the next byte in the pseudo-random sequence. |
| 7 | 3851 */ |
| 2244 | 3852 #define DECRYPT_BYTE_ZIP(t) { \ |
| 3853 ush temp; \ | |
| 3854 \ | |
| 3855 temp = (ush)keys[2] | 2; \ | |
| 3856 t = (int)(((unsigned)(temp * (temp ^ 1)) >> 8) & 0xff); \ | |
| 3857 } | |
| 3858 | |
| 3859 /* | |
| 3860 * Update the encryption keys with the next byte of plain text. | |
| 3861 */ | |
| 3862 #define UPDATE_KEYS_ZIP(c) { \ | |
| 3863 keys[0] = CRC32(keys[0], (c)); \ | |
| 3864 keys[1] += keys[0] & 0xff; \ | |
| 3865 keys[1] = keys[1] * 134775813L + 1; \ | |
| 3866 keys[2] = CRC32(keys[2], (int)(keys[1] >> 24)); \ | |
| 7 | 3867 } |
| 3868 | |
| 2267 | 3869 static int crypt_busy = 0; |
| 3870 static ulg saved_keys[3]; | |
| 3871 static int saved_crypt_method; | |
| 3872 | |
| 3873 /* | |
|
2360
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3874 * Return int value for crypt method string: |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3875 * 0 for "zip", the old method. Also for any non-valid value. |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3876 * 1 for "blowfish". |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3877 */ |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3878 int |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3879 crypt_method_from_string(s) |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3880 char_u *s; |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3881 { |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3882 return *s == 'b' ? 1 : 0; |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3883 } |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3884 |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3885 /* |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3886 * Get the crypt method for buffer "buf" as a number. |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3887 */ |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3888 int |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3889 get_crypt_method(buf) |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3890 buf_T *buf; |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3891 { |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3892 return crypt_method_from_string(*buf->b_p_cm == NUL ? p_cm : buf->b_p_cm); |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3893 } |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3894 |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3895 /* |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3896 * Set the crypt method for buffer "buf" to "method" using the int value as |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3897 * returned by crypt_method_from_string(). |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3898 */ |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3899 void |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3900 set_crypt_method(buf, method) |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3901 buf_T *buf; |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3902 int method; |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3903 { |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3904 free_string_option(buf->b_p_cm); |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3905 buf->b_p_cm = vim_strsave((char_u *)(method == 0 ? "zip" : "blowfish")); |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3906 } |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3907 |
|
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3908 /* |
| 2267 | 3909 * Prepare for initializing encryption. If already doing encryption then save |
| 3910 * the state. | |
|
2545
298d8d6e69be
Avoid warnings from the clang compiler. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2522
diff
changeset
|
3911 * Must always be called symmetrically with crypt_pop_state(). |
| 2267 | 3912 */ |
| 3913 void | |
| 3914 crypt_push_state() | |
| 3915 { | |
| 3916 if (crypt_busy == 1) | |
| 3917 { | |
| 3918 /* save the state */ | |
| 3919 if (use_crypt_method == 0) | |
| 3920 { | |
| 3921 saved_keys[0] = keys[0]; | |
| 3922 saved_keys[1] = keys[1]; | |
| 3923 saved_keys[2] = keys[2]; | |
| 3924 } | |
| 3925 else | |
| 3926 bf_crypt_save(); | |
| 3927 saved_crypt_method = use_crypt_method; | |
| 3928 } | |
| 3929 else if (crypt_busy > 1) | |
| 3930 EMSG2(_(e_intern2), "crypt_push_state()"); | |
| 3931 ++crypt_busy; | |
| 3932 } | |
| 3933 | |
| 3934 /* | |
| 3935 * End encryption. If doing encryption before crypt_push_state() then restore | |
| 3936 * the saved state. | |
|
2545
298d8d6e69be
Avoid warnings from the clang compiler. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2522
diff
changeset
|
3937 * Must always be called symmetrically with crypt_push_state(). |
| 2267 | 3938 */ |
| 3939 void | |
| 3940 crypt_pop_state() | |
| 3941 { | |
| 3942 --crypt_busy; | |
| 3943 if (crypt_busy == 1) | |
| 3944 { | |
| 3945 use_crypt_method = saved_crypt_method; | |
| 3946 if (use_crypt_method == 0) | |
| 3947 { | |
| 3948 keys[0] = saved_keys[0]; | |
| 3949 keys[1] = saved_keys[1]; | |
| 3950 keys[2] = saved_keys[2]; | |
| 3951 } | |
| 3952 else | |
| 3953 bf_crypt_restore(); | |
| 3954 } | |
| 3955 } | |
| 3956 | |
| 7 | 3957 /* |
| 2244 | 3958 * Encrypt "from[len]" into "to[len]". |
| 3959 * "from" and "to" can be equal to encrypt in place. | |
| 7 | 3960 */ |
|
2180
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
3961 void |
| 2244 | 3962 crypt_encode(from, len, to) |
| 3963 char_u *from; | |
| 3964 size_t len; | |
| 3965 char_u *to; | |
| 7 | 3966 { |
| 2244 | 3967 size_t i; |
| 3968 int ztemp, t; | |
| 3969 | |
| 3970 if (use_crypt_method == 0) | |
| 3971 for (i = 0; i < len; ++i) | |
| 3972 { | |
| 3973 ztemp = from[i]; | |
| 3974 DECRYPT_BYTE_ZIP(t); | |
| 3975 UPDATE_KEYS_ZIP(ztemp); | |
| 3976 to[i] = t ^ ztemp; | |
| 3977 } | |
|
2180
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
3978 else |
|
2245
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
3979 bf_crypt_encode(from, len, to); |
| 2244 | 3980 } |
| 3981 | |
| 3982 /* | |
| 3983 * Decrypt "ptr[len]" in place. | |
| 3984 */ | |
| 3985 void | |
| 3986 crypt_decode(ptr, len) | |
| 3987 char_u *ptr; | |
| 3988 long len; | |
| 3989 { | |
| 3990 char_u *p; | |
| 3991 | |
| 3992 if (use_crypt_method == 0) | |
| 3993 for (p = ptr; p < ptr + len; ++p) | |
| 3994 { | |
| 3995 ush temp; | |
| 3996 | |
| 3997 temp = (ush)keys[2] | 2; | |
| 3998 temp = (int)(((unsigned)(temp * (temp ^ 1)) >> 8) & 0xff); | |
| 3999 UPDATE_KEYS_ZIP(*p ^= temp); | |
| 4000 } | |
| 4001 else | |
|
2245
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4002 bf_crypt_decode(ptr, len); |
| 7 | 4003 } |
| 4004 | |
| 4005 /* | |
| 4006 * Initialize the encryption keys and the random header according to | |
| 4007 * the given password. | |
| 4008 * If "passwd" is NULL or empty, don't do anything. | |
| 4009 */ | |
| 4010 void | |
| 4011 crypt_init_keys(passwd) | |
| 4012 char_u *passwd; /* password string with which to modify keys */ | |
| 4013 { | |
| 4014 if (passwd != NULL && *passwd != NUL) | |
| 4015 { | |
| 2244 | 4016 if (use_crypt_method == 0) |
|
2245
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4017 { |
|
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4018 char_u *p; |
|
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4019 |
|
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4020 make_crc_tab(); |
|
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4021 keys[0] = 305419896L; |
|
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4022 keys[1] = 591751049L; |
|
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4023 keys[2] = 878082192L; |
|
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4024 for (p = passwd; *p!= NUL; ++p) |
| 2244 | 4025 { |
|
2245
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4026 UPDATE_KEYS_ZIP((int)*p); |
| 2244 | 4027 } |
|
2245
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4028 } |
| 2244 | 4029 else |
|
2245
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4030 bf_crypt_init_keys(passwd); |
| 7 | 4031 } |
| 4032 } | |
| 4033 | |
| 4034 /* | |
|
2180
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4035 * Free an allocated crypt key. Clear the text to make sure it doesn't stay |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4036 * in memory anywhere. |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4037 */ |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4038 void |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4039 free_crypt_key(key) |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4040 char_u *key; |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4041 { |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4042 char_u *p; |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4043 |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4044 if (key != NULL) |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4045 { |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4046 for (p = key; *p != NUL; ++p) |
|
2211
dded7e33d0a9
Fix wrong memory access when clearing crypt key.
Bram Moolenaar <bram@vim.org>
parents:
2180
diff
changeset
|
4047 *p = 0; |
|
2180
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4048 vim_free(key); |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4049 } |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4050 } |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4051 |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4052 /* |
| 7 | 4053 * Ask the user for a crypt key. |
|
2180
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4054 * When "store" is TRUE, the new key is stored in the 'key' option, and the |
| 7 | 4055 * 'key' option value is returned: Don't free it. |
| 4056 * When "store" is FALSE, the typed key is returned in allocated memory. | |
| 4057 * Returns NULL on failure. | |
| 4058 */ | |
| 4059 char_u * | |
| 4060 get_crypt_key(store, twice) | |
| 4061 int store; | |
| 4062 int twice; /* Ask for the key twice. */ | |
| 4063 { | |
| 4064 char_u *p1, *p2 = NULL; | |
| 4065 int round; | |
| 4066 | |
| 4067 for (round = 0; ; ++round) | |
| 4068 { | |
| 4069 cmdline_star = TRUE; | |
| 4070 cmdline_row = msg_row; | |
| 4071 p1 = getcmdline_prompt(NUL, round == 0 | |
| 4072 ? (char_u *)_("Enter encryption key: ") | |
| 531 | 4073 : (char_u *)_("Enter same key again: "), 0, EXPAND_NOTHING, |
| 4074 NULL); | |
| 7 | 4075 cmdline_star = FALSE; |
| 4076 | |
| 4077 if (p1 == NULL) | |
| 4078 break; | |
| 4079 | |
| 4080 if (round == twice) | |
| 4081 { | |
| 4082 if (p2 != NULL && STRCMP(p1, p2) != 0) | |
| 4083 { | |
| 4084 MSG(_("Keys don't match!")); | |
|
2180
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4085 free_crypt_key(p1); |
|
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4086 free_crypt_key(p2); |
| 7 | 4087 p2 = NULL; |
| 4088 round = -1; /* do it again */ | |
| 4089 continue; | |
| 4090 } | |
|
2180
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4091 |
| 7 | 4092 if (store) |
| 4093 { | |
| 4094 set_option_value((char_u *)"key", 0L, p1, OPT_LOCAL); | |
|
2180
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4095 free_crypt_key(p1); |
| 7 | 4096 p1 = curbuf->b_p_key; |
| 4097 } | |
| 4098 break; | |
| 4099 } | |
| 4100 p2 = p1; | |
| 4101 } | |
| 4102 | |
| 4103 /* since the user typed this, no need to wait for return */ | |
| 2267 | 4104 if (msg_didout) |
| 4105 msg_putchar('\n'); | |
|
2491
904cd1c26a1e
After entering a crypt key would need to hit return to continue.
Bram Moolenaar <bram@vim.org>
parents:
2487
diff
changeset
|
4106 need_wait_return = FALSE; |
| 7 | 4107 msg_didout = FALSE; |
| 4108 | |
|
2180
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4109 free_crypt_key(p2); |
| 7 | 4110 return p1; |
| 4111 } | |
| 4112 | |
| 4113 #endif /* FEAT_CRYPT */ | |
| 4114 | |
| 4115 /* TODO: make some #ifdef for this */ | |
| 4116 /*--------[ file searching ]-------------------------------------------------*/ | |
| 4117 /* | |
| 4118 * File searching functions for 'path', 'tags' and 'cdpath' options. | |
| 4119 * External visible functions: | |
| 4120 * vim_findfile_init() creates/initialises the search context | |
| 4121 * vim_findfile_free_visited() free list of visited files/dirs of search | |
| 4122 * context | |
| 4123 * vim_findfile() find a file in the search context | |
| 4124 * vim_findfile_cleanup() cleanup/free search context created by | |
| 4125 * vim_findfile_init() | |
| 4126 * | |
| 4127 * All static functions and variables start with 'ff_' | |
| 4128 * | |
| 4129 * In general it works like this: | |
| 4130 * First you create yourself a search context by calling vim_findfile_init(). | |
| 4131 * It is possible to give a search context from a previous call to | |
| 4132 * vim_findfile_init(), so it can be reused. After this you call vim_findfile() | |
| 4133 * until you are satisfied with the result or it returns NULL. On every call it | |
| 4134 * returns the next file which matches the conditions given to | |
| 4135 * vim_findfile_init(). If it doesn't find a next file it returns NULL. | |
| 4136 * | |
| 4137 * It is possible to call vim_findfile_init() again to reinitialise your search | |
| 4138 * with some new parameters. Don't forget to pass your old search context to | |
| 4139 * it, so it can reuse it and especially reuse the list of already visited | |
| 4140 * directories. If you want to delete the list of already visited directories | |
| 4141 * simply call vim_findfile_free_visited(). | |
| 4142 * | |
| 4143 * When you are done call vim_findfile_cleanup() to free the search context. | |
| 4144 * | |
| 4145 * The function vim_findfile_init() has a long comment, which describes the | |
| 4146 * needed parameters. | |
| 4147 * | |
| 4148 * | |
| 4149 * | |
| 4150 * ATTENTION: | |
| 4151 * ========== | |
| 1072 | 4152 * Also we use an allocated search context here, this functions are NOT |
| 7 | 4153 * thread-safe!!!!! |
| 4154 * | |
| 4155 * To minimize parameter passing (or because I'm to lazy), only the | |
| 4156 * external visible functions get a search context as a parameter. This is | |
| 4157 * then assigned to a static global, which is used throughout the local | |
| 4158 * functions. | |
| 4159 */ | |
| 4160 | |
| 4161 /* | |
| 4162 * type for the directory search stack | |
| 4163 */ | |
| 4164 typedef struct ff_stack | |
| 4165 { | |
| 4166 struct ff_stack *ffs_prev; | |
| 4167 | |
| 4168 /* the fix part (no wildcards) and the part containing the wildcards | |
| 4169 * of the search path | |
| 4170 */ | |
| 4171 char_u *ffs_fix_path; | |
| 4172 #ifdef FEAT_PATH_EXTRA | |
| 4173 char_u *ffs_wc_path; | |
| 4174 #endif | |
| 4175 | |
| 4176 /* files/dirs found in the above directory, matched by the first wildcard | |
| 4177 * of wc_part | |
| 4178 */ | |
| 4179 char_u **ffs_filearray; | |
| 4180 int ffs_filearray_size; | |
| 4181 char_u ffs_filearray_cur; /* needed for partly handled dirs */ | |
| 4182 | |
| 4183 /* to store status of partly handled directories | |
| 1541 | 4184 * 0: we work on this directory for the first time |
| 7 | 4185 * 1: this directory was partly searched in an earlier step |
| 1541 | 4186 */ |
| 7 | 4187 int ffs_stage; |
| 4188 | |
| 4189 /* How deep are we in the directory tree? | |
| 4190 * Counts backward from value of level parameter to vim_findfile_init | |
| 4191 */ | |
| 4192 int ffs_level; | |
| 4193 | |
| 4194 /* Did we already expand '**' to an empty string? */ | |
| 4195 int ffs_star_star_empty; | |
| 4196 } ff_stack_T; | |
| 4197 | |
| 4198 /* | |
| 4199 * type for already visited directories or files. | |
| 4200 */ | |
| 4201 typedef struct ff_visited | |
| 4202 { | |
| 4203 struct ff_visited *ffv_next; | |
| 4204 | |
| 4205 #ifdef FEAT_PATH_EXTRA | |
| 4206 /* Visited directories are different if the wildcard string are | |
| 4207 * different. So we have to save it. | |
| 4208 */ | |
| 4209 char_u *ffv_wc_path; | |
| 4210 #endif | |
| 4211 /* for unix use inode etc for comparison (needed because of links), else | |
| 4212 * use filename. | |
| 4213 */ | |
| 4214 #ifdef UNIX | |
| 1881 | 4215 int ffv_dev_valid; /* ffv_dev and ffv_ino were set */ |
| 4216 dev_t ffv_dev; /* device number */ | |
| 7 | 4217 ino_t ffv_ino; /* inode number */ |
| 4218 #endif | |
| 4219 /* The memory for this struct is allocated according to the length of | |
| 4220 * ffv_fname. | |
| 4221 */ | |
| 4222 char_u ffv_fname[1]; /* actually longer */ | |
| 4223 } ff_visited_T; | |
| 4224 | |
| 4225 /* | |
| 4226 * We might have to manage several visited lists during a search. | |
| 1209 | 4227 * This is especially needed for the tags option. If tags is set to: |
| 7 | 4228 * "./++/tags,./++/TAGS,++/tags" (replace + with *) |
| 4229 * So we have to do 3 searches: | |
| 4230 * 1) search from the current files directory downward for the file "tags" | |
| 4231 * 2) search from the current files directory downward for the file "TAGS" | |
| 4232 * 3) search from Vims current directory downwards for the file "tags" | |
| 4233 * As you can see, the first and the third search are for the same file, so for | |
| 4234 * the third search we can use the visited list of the first search. For the | |
| 4235 * second search we must start from a empty visited list. | |
| 4236 * The struct ff_visited_list_hdr is used to manage a linked list of already | |
| 4237 * visited lists. | |
| 4238 */ | |
| 4239 typedef struct ff_visited_list_hdr | |
| 4240 { | |
| 4241 struct ff_visited_list_hdr *ffvl_next; | |
| 4242 | |
| 4243 /* the filename the attached visited list is for */ | |
| 4244 char_u *ffvl_filename; | |
| 4245 | |
| 4246 ff_visited_T *ffvl_visited_list; | |
| 4247 | |
| 4248 } ff_visited_list_hdr_T; | |
| 4249 | |
| 4250 | |
| 4251 /* | |
| 4252 * '**' can be expanded to several directory levels. | |
| 1209 | 4253 * Set the default maximum depth. |
| 7 | 4254 */ |
| 4255 #define FF_MAX_STAR_STAR_EXPAND ((char_u)30) | |
| 1541 | 4256 |
| 7 | 4257 /* |
| 4258 * The search context: | |
| 4259 * ffsc_stack_ptr: the stack for the dirs to search | |
| 4260 * ffsc_visited_list: the currently active visited list | |
| 4261 * ffsc_dir_visited_list: the currently active visited list for search dirs | |
| 4262 * ffsc_visited_lists_list: the list of all visited lists | |
| 4263 * ffsc_dir_visited_lists_list: the list of all visited lists for search dirs | |
| 4264 * ffsc_file_to_search: the file to search for | |
| 4265 * ffsc_start_dir: the starting directory, if search path was relative | |
| 4266 * ffsc_fix_path: the fix part of the given path (without wildcards) | |
| 4267 * Needed for upward search. | |
| 4268 * ffsc_wc_path: the part of the given path containing wildcards | |
| 4269 * ffsc_level: how many levels of dirs to search downwards | |
| 4270 * ffsc_stopdirs_v: array of stop directories for upward search | |
| 1541 | 4271 * ffsc_find_what: FINDFILE_BOTH, FINDFILE_DIR or FINDFILE_FILE |
|
2521
d890c820722f
Fix: 'suffixesadd' was used for finding tags file.
Bram Moolenaar <bram@vim.org>
parents:
2520
diff
changeset
|
4272 * ffsc_tagfile: searching for tags file, don't use 'suffixesadd' |
| 7 | 4273 */ |
| 4274 typedef struct ff_search_ctx_T | |
| 4275 { | |
| 4276 ff_stack_T *ffsc_stack_ptr; | |
| 4277 ff_visited_list_hdr_T *ffsc_visited_list; | |
| 4278 ff_visited_list_hdr_T *ffsc_dir_visited_list; | |
| 4279 ff_visited_list_hdr_T *ffsc_visited_lists_list; | |
| 4280 ff_visited_list_hdr_T *ffsc_dir_visited_lists_list; | |
| 4281 char_u *ffsc_file_to_search; | |
| 4282 char_u *ffsc_start_dir; | |
| 4283 char_u *ffsc_fix_path; | |
| 4284 #ifdef FEAT_PATH_EXTRA | |
| 4285 char_u *ffsc_wc_path; | |
| 4286 int ffsc_level; | |
| 4287 char_u **ffsc_stopdirs_v; | |
| 4288 #endif | |
| 1541 | 4289 int ffsc_find_what; |
|
2521
d890c820722f
Fix: 'suffixesadd' was used for finding tags file.
Bram Moolenaar <bram@vim.org>
parents:
2520
diff
changeset
|
4290 int ffsc_tagfile; |
| 359 | 4291 } ff_search_ctx_T; |
| 4292 | |
| 7 | 4293 /* locally needed functions */ |
| 4294 #ifdef FEAT_PATH_EXTRA | |
| 4295 static int ff_check_visited __ARGS((ff_visited_T **, char_u *, char_u *)); | |
| 4296 #else | |
| 4297 static int ff_check_visited __ARGS((ff_visited_T **, char_u *)); | |
| 4298 #endif | |
| 4299 static void vim_findfile_free_visited_list __ARGS((ff_visited_list_hdr_T **list_headp)); | |
| 4300 static void ff_free_visited_list __ARGS((ff_visited_T *vl)); | |
| 4301 static ff_visited_list_hdr_T* ff_get_visited_list __ARGS((char_u *, ff_visited_list_hdr_T **list_headp)); | |
| 4302 #ifdef FEAT_PATH_EXTRA | |
| 4303 static int ff_wc_equal __ARGS((char_u *s1, char_u *s2)); | |
| 4304 #endif | |
| 4305 | |
| 1541 | 4306 static void ff_push __ARGS((ff_search_ctx_T *search_ctx, ff_stack_T *stack_ptr)); |
| 4307 static ff_stack_T *ff_pop __ARGS((ff_search_ctx_T *search_ctx)); | |
| 4308 static void ff_clear __ARGS((ff_search_ctx_T *search_ctx)); | |
| 4309 static void ff_free_stack_element __ARGS((ff_stack_T *stack_ptr)); | |
| 7 | 4310 #ifdef FEAT_PATH_EXTRA |
| 4311 static ff_stack_T *ff_create_stack_element __ARGS((char_u *, char_u *, int, int)); | |
| 4312 #else | |
| 4313 static ff_stack_T *ff_create_stack_element __ARGS((char_u *, int, int)); | |
| 4314 #endif | |
| 4315 #ifdef FEAT_PATH_EXTRA | |
| 4316 static int ff_path_in_stoplist __ARGS((char_u *, int, char_u **)); | |
| 4317 #endif | |
| 4318 | |
| 3202 | 4319 static char_u e_pathtoolong[] = N_("E854: path too long for completion"); |
| 4320 | |
| 7 | 4321 #if 0 |
| 4322 /* | |
| 4323 * if someone likes findfirst/findnext, here are the functions | |
| 4324 * NOT TESTED!! | |
| 4325 */ | |
| 4326 | |
| 4327 static void *ff_fn_search_context = NULL; | |
| 4328 | |
| 4329 char_u * | |
| 4330 vim_findfirst(path, filename, level) | |
| 4331 char_u *path; | |
| 4332 char_u *filename; | |
| 4333 int level; | |
| 4334 { | |
| 4335 ff_fn_search_context = | |
| 4336 vim_findfile_init(path, filename, NULL, level, TRUE, FALSE, | |
| 4337 ff_fn_search_context, rel_fname); | |
| 4338 if (NULL == ff_fn_search_context) | |
| 4339 return NULL; | |
| 4340 else | |
| 4341 return vim_findnext() | |
| 4342 } | |
| 4343 | |
| 4344 char_u * | |
| 4345 vim_findnext() | |
| 4346 { | |
| 4347 char_u *ret = vim_findfile(ff_fn_search_context); | |
| 4348 | |
| 4349 if (NULL == ret) | |
| 4350 { | |
| 4351 vim_findfile_cleanup(ff_fn_search_context); | |
| 4352 ff_fn_search_context = NULL; | |
| 4353 } | |
| 4354 return ret; | |
| 4355 } | |
| 4356 #endif | |
| 4357 | |
| 4358 /* | |
|
2522
d7ecfc8b784c
Update help about wildcards in 'tags' option.
Bram Moolenaar <bram@vim.org>
parents:
2521
diff
changeset
|
4359 * Initialization routine for vim_findfile(). |
| 7 | 4360 * |
|
2211
dded7e33d0a9
Fix wrong memory access when clearing crypt key.
Bram Moolenaar <bram@vim.org>
parents:
2180
diff
changeset
|
4361 * Returns the newly allocated search context or NULL if an error occurred. |
| 7 | 4362 * |
| 4363 * Don't forget to clean up by calling vim_findfile_cleanup() if you are done | |
| 4364 * with the search context. | |
| 4365 * | |
| 4366 * Find the file 'filename' in the directory 'path'. | |
| 4367 * The parameter 'path' may contain wildcards. If so only search 'level' | |
| 4368 * directories deep. The parameter 'level' is the absolute maximum and is | |
| 4369 * not related to restricts given to the '**' wildcard. If 'level' is 100 | |
| 4370 * and you use '**200' vim_findfile() will stop after 100 levels. | |
| 4371 * | |
| 1541 | 4372 * 'filename' cannot contain wildcards! It is used as-is, no backslashes to |
| 4373 * escape special characters. | |
| 4374 * | |
| 7 | 4375 * If 'stopdirs' is not NULL and nothing is found downward, the search is |
| 4376 * restarted on the next higher directory level. This is repeated until the | |
| 4377 * start-directory of a search is contained in 'stopdirs'. 'stopdirs' has the | |
| 4378 * format ";*<dirname>*\(;<dirname>\)*;\=$". | |
| 4379 * | |
| 4380 * If the 'path' is relative, the starting dir for the search is either VIM's | |
| 4381 * current dir or if the path starts with "./" the current files dir. | |
|
2211
dded7e33d0a9
Fix wrong memory access when clearing crypt key.
Bram Moolenaar <bram@vim.org>
parents:
2180
diff
changeset
|
4382 * If the 'path' is absolute, the starting dir is that part of the path before |
| 7 | 4383 * the first wildcard. |
| 4384 * | |
| 4385 * Upward search is only done on the starting dir. | |
| 4386 * | |
| 4387 * If 'free_visited' is TRUE the list of already visited files/directories is | |
| 4388 * cleared. Set this to FALSE if you just want to search from another | |
| 4389 * directory, but want to be sure that no directory from a previous search is | |
| 4390 * searched again. This is useful if you search for a file at different places. | |
| 4391 * The list of visited files/dirs can also be cleared with the function | |
| 4392 * vim_findfile_free_visited(). | |
| 4393 * | |
| 1541 | 4394 * Set the parameter 'find_what' to FINDFILE_DIR if you want to search for |
| 4395 * directories only, FINDFILE_FILE for files only, FINDFILE_BOTH for both. | |
| 7 | 4396 * |
| 4397 * A search context returned by a previous call to vim_findfile_init() can be | |
| 1541 | 4398 * passed in the parameter "search_ctx_arg". This context is reused and |
| 4399 * reinitialized with the new parameters. The list of already visited | |
| 7 | 4400 * directories from this context is only deleted if the parameter |
| 1541 | 4401 * "free_visited" is true. Be aware that the passed "search_ctx_arg" is freed |
| 4402 * if the reinitialization fails. | |
| 7 | 4403 * |
| 1541 | 4404 * If you don't have a search context from a previous call "search_ctx_arg" |
| 4405 * must be NULL. | |
| 7 | 4406 * |
| 4407 * This function silently ignores a few errors, vim_findfile() will have | |
| 4408 * limited functionality then. | |
| 4409 */ | |
| 4410 void * | |
| 1541 | 4411 vim_findfile_init(path, filename, stopdirs, level, free_visited, find_what, |
| 4412 search_ctx_arg, tagfile, rel_fname) | |
| 7 | 4413 char_u *path; |
| 4414 char_u *filename; | |
| 1881 | 4415 char_u *stopdirs UNUSED; |
| 7 | 4416 int level; |
| 4417 int free_visited; | |
| 1541 | 4418 int find_what; |
| 4419 void *search_ctx_arg; | |
|
2521
d890c820722f
Fix: 'suffixesadd' was used for finding tags file.
Bram Moolenaar <bram@vim.org>
parents:
2520
diff
changeset
|
4420 int tagfile; /* expanding names of tags files */ |
| 7 | 4421 char_u *rel_fname; /* file name to use for "." */ |
| 4422 { | |
| 4423 #ifdef FEAT_PATH_EXTRA | |
| 1541 | 4424 char_u *wc_part; |
| 4425 #endif | |
| 4426 ff_stack_T *sptr; | |
| 4427 ff_search_ctx_T *search_ctx; | |
| 7 | 4428 |
| 4429 /* If a search context is given by the caller, reuse it, else allocate a | |
| 4430 * new one. | |
| 4431 */ | |
| 1541 | 4432 if (search_ctx_arg != NULL) |
| 4433 search_ctx = search_ctx_arg; | |
| 7 | 4434 else |
| 4435 { | |
| 1541 | 4436 search_ctx = (ff_search_ctx_T*)alloc((unsigned)sizeof(ff_search_ctx_T)); |
| 4437 if (search_ctx == NULL) | |
| 7 | 4438 goto error_return; |
|
2215
cccb71c2c5c1
Fix uninit memory read in undo code. Fix uint32_t in proto file.
Bram Moolenaar <bram@vim.org>
parents:
2211
diff
changeset
|
4439 vim_memset(search_ctx, 0, sizeof(ff_search_ctx_T)); |
| 7 | 4440 } |
| 1541 | 4441 search_ctx->ffsc_find_what = find_what; |
|
2521
d890c820722f
Fix: 'suffixesadd' was used for finding tags file.
Bram Moolenaar <bram@vim.org>
parents:
2520
diff
changeset
|
4442 search_ctx->ffsc_tagfile = tagfile; |
| 7 | 4443 |
| 4444 /* clear the search context, but NOT the visited lists */ | |
| 1541 | 4445 ff_clear(search_ctx); |
| 7 | 4446 |
| 4447 /* clear visited list if wanted */ | |
| 4448 if (free_visited == TRUE) | |
| 1541 | 4449 vim_findfile_free_visited(search_ctx); |
| 7 | 4450 else |
| 4451 { | |
| 4452 /* Reuse old visited lists. Get the visited list for the given | |
| 4453 * filename. If no list for the current filename exists, creates a new | |
| 1541 | 4454 * one. */ |
| 4455 search_ctx->ffsc_visited_list = ff_get_visited_list(filename, | |
| 4456 &search_ctx->ffsc_visited_lists_list); | |
| 4457 if (search_ctx->ffsc_visited_list == NULL) | |
| 7 | 4458 goto error_return; |
| 1541 | 4459 search_ctx->ffsc_dir_visited_list = ff_get_visited_list(filename, |
| 4460 &search_ctx->ffsc_dir_visited_lists_list); | |
| 4461 if (search_ctx->ffsc_dir_visited_list == NULL) | |
| 7 | 4462 goto error_return; |
| 4463 } | |
| 4464 | |
| 4465 if (ff_expand_buffer == NULL) | |
| 4466 { | |
| 4467 ff_expand_buffer = (char_u*)alloc(MAXPATHL); | |
| 4468 if (ff_expand_buffer == NULL) | |
| 4469 goto error_return; | |
| 4470 } | |
| 4471 | |
| 4472 /* Store information on starting dir now if path is relative. | |
| 20 | 4473 * If path is absolute, we do that later. */ |
| 7 | 4474 if (path[0] == '.' |
| 4475 && (vim_ispathsep(path[1]) || path[1] == NUL) | |
| 4476 && (!tagfile || vim_strchr(p_cpo, CPO_DOTTAG) == NULL) | |
| 4477 && rel_fname != NULL) | |
| 4478 { | |
| 4479 int len = (int)(gettail(rel_fname) - rel_fname); | |
| 4480 | |
| 4481 if (!vim_isAbsName(rel_fname) && len + 1 < MAXPATHL) | |
| 4482 { | |
| 4483 /* Make the start dir an absolute path name. */ | |
| 418 | 4484 vim_strncpy(ff_expand_buffer, rel_fname, len); |
| 1541 | 4485 search_ctx->ffsc_start_dir = FullName_save(ff_expand_buffer, FALSE); |
| 7 | 4486 } |
| 4487 else | |
| 1541 | 4488 search_ctx->ffsc_start_dir = vim_strnsave(rel_fname, len); |
| 4489 if (search_ctx->ffsc_start_dir == NULL) | |
| 7 | 4490 goto error_return; |
| 4491 if (*++path != NUL) | |
| 4492 ++path; | |
| 4493 } | |
| 4494 else if (*path == NUL || !vim_isAbsName(path)) | |
| 4495 { | |
| 4496 #ifdef BACKSLASH_IN_FILENAME | |
| 4497 /* "c:dir" needs "c:" to be expanded, otherwise use current dir */ | |
| 4498 if (*path != NUL && path[1] == ':') | |
| 4499 { | |
| 4500 char_u drive[3]; | |
| 4501 | |
| 4502 drive[0] = path[0]; | |
| 4503 drive[1] = ':'; | |
| 4504 drive[2] = NUL; | |
| 4505 if (vim_FullName(drive, ff_expand_buffer, MAXPATHL, TRUE) == FAIL) | |
| 4506 goto error_return; | |
| 4507 path += 2; | |
| 4508 } | |
| 4509 else | |
| 4510 #endif | |
| 4511 if (mch_dirname(ff_expand_buffer, MAXPATHL) == FAIL) | |
| 4512 goto error_return; | |
| 4513 | |
| 1541 | 4514 search_ctx->ffsc_start_dir = vim_strsave(ff_expand_buffer); |
| 4515 if (search_ctx->ffsc_start_dir == NULL) | |
| 7 | 4516 goto error_return; |
| 4517 | |
| 4518 #ifdef BACKSLASH_IN_FILENAME | |
| 4519 /* A path that starts with "/dir" is relative to the drive, not to the | |
| 4520 * directory (but not for "//machine/dir"). Only use the drive name. */ | |
| 4521 if ((*path == '/' || *path == '\\') | |
| 4522 && path[1] != path[0] | |
| 1541 | 4523 && search_ctx->ffsc_start_dir[1] == ':') |
| 4524 search_ctx->ffsc_start_dir[2] = NUL; | |
| 7 | 4525 #endif |
| 4526 } | |
| 4527 | |
| 4528 #ifdef FEAT_PATH_EXTRA | |
| 4529 /* | |
| 4530 * If stopdirs are given, split them into an array of pointers. | |
| 4531 * If this fails (mem allocation), there is no upward search at all or a | |
| 4532 * stop directory is not recognized -> continue silently. | |
| 4533 * If stopdirs just contains a ";" or is empty, | |
| 1541 | 4534 * search_ctx->ffsc_stopdirs_v will only contain a NULL pointer. This |
| 7 | 4535 * is handled as unlimited upward search. See function |
| 4536 * ff_path_in_stoplist() for details. | |
| 4537 */ | |
| 4538 if (stopdirs != NULL) | |
| 4539 { | |
| 4540 char_u *walker = stopdirs; | |
| 4541 int dircount; | |
| 4542 | |
| 4543 while (*walker == ';') | |
| 4544 walker++; | |
| 4545 | |
| 4546 dircount = 1; | |
| 1541 | 4547 search_ctx->ffsc_stopdirs_v = |
| 4548 (char_u **)alloc((unsigned)sizeof(char_u *)); | |
| 4549 | |
| 4550 if (search_ctx->ffsc_stopdirs_v != NULL) | |
| 7 | 4551 { |
| 4552 do | |
| 4553 { | |
| 4554 char_u *helper; | |
| 4555 void *ptr; | |
| 4556 | |
| 4557 helper = walker; | |
| 1541 | 4558 ptr = vim_realloc(search_ctx->ffsc_stopdirs_v, |
| 7 | 4559 (dircount + 1) * sizeof(char_u *)); |
| 4560 if (ptr) | |
| 1541 | 4561 search_ctx->ffsc_stopdirs_v = ptr; |
| 7 | 4562 else |
| 4563 /* ignore, keep what we have and continue */ | |
| 4564 break; | |
| 4565 walker = vim_strchr(walker, ';'); | |
| 4566 if (walker) | |
| 4567 { | |
| 1541 | 4568 search_ctx->ffsc_stopdirs_v[dircount-1] = |
| 4569 vim_strnsave(helper, (int)(walker - helper)); | |
| 7 | 4570 walker++; |
| 4571 } | |
| 4572 else | |
| 4573 /* this might be "", which means ascent till top | |
| 4574 * of directory tree. | |
| 4575 */ | |
| 1541 | 4576 search_ctx->ffsc_stopdirs_v[dircount-1] = |
| 4577 vim_strsave(helper); | |
| 7 | 4578 |
| 4579 dircount++; | |
| 4580 | |
| 4581 } while (walker != NULL); | |
| 1541 | 4582 search_ctx->ffsc_stopdirs_v[dircount-1] = NULL; |
| 7 | 4583 } |
| 4584 } | |
| 4585 #endif | |
| 4586 | |
| 4587 #ifdef FEAT_PATH_EXTRA | |
| 1541 | 4588 search_ctx->ffsc_level = level; |
| 7 | 4589 |
| 4590 /* split into: | |
| 4591 * -fix path | |
| 4592 * -wildcard_stuff (might be NULL) | |
| 4593 */ | |
| 4594 wc_part = vim_strchr(path, '*'); | |
| 4595 if (wc_part != NULL) | |
| 4596 { | |
| 4597 int llevel; | |
| 4598 int len; | |
| 29 | 4599 char *errpt; |
| 7 | 4600 |
| 4601 /* save the fix part of the path */ | |
| 1541 | 4602 search_ctx->ffsc_fix_path = vim_strnsave(path, (int)(wc_part - path)); |
| 7 | 4603 |
| 4604 /* | |
| 4605 * copy wc_path and add restricts to the '**' wildcard. | |
| 1209 | 4606 * The octet after a '**' is used as a (binary) counter. |
| 7 | 4607 * So '**3' is transposed to '**^C' ('^C' is ASCII value 3) |
| 4608 * or '**76' is transposed to '**N'( 'N' is ASCII value 76). | |
| 4609 * For EBCDIC you get different character values. | |
| 4610 * If no restrict is given after '**' the default is used. | |
| 1993 | 4611 * Due to this technique the path looks awful if you print it as a |
| 7 | 4612 * string. |
| 4613 */ | |
| 4614 len = 0; | |
| 4615 while (*wc_part != NUL) | |
| 4616 { | |
| 3202 | 4617 if (len + 5 >= MAXPATHL) |
| 4618 { | |
| 4619 EMSG(_(e_pathtoolong)); | |
| 4620 break; | |
| 4621 } | |
| 7 | 4622 if (STRNCMP(wc_part, "**", 2) == 0) |
| 4623 { | |
| 4624 ff_expand_buffer[len++] = *wc_part++; | |
| 4625 ff_expand_buffer[len++] = *wc_part++; | |
| 4626 | |
| 29 | 4627 llevel = strtol((char *)wc_part, &errpt, 10); |
| 4628 if ((char_u *)errpt != wc_part && llevel > 0 && llevel < 255) | |
| 7 | 4629 ff_expand_buffer[len++] = llevel; |
| 29 | 4630 else if ((char_u *)errpt != wc_part && llevel == 0) |
| 7 | 4631 /* restrict is 0 -> remove already added '**' */ |
| 4632 len -= 2; | |
| 4633 else | |
| 4634 ff_expand_buffer[len++] = FF_MAX_STAR_STAR_EXPAND; | |
| 29 | 4635 wc_part = (char_u *)errpt; |
| 461 | 4636 if (*wc_part != NUL && !vim_ispathsep(*wc_part)) |
| 7 | 4637 { |
| 4638 EMSG2(_("E343: Invalid path: '**[number]' must be at the end of the path or be followed by '%s'."), PATHSEPSTR); | |
| 4639 goto error_return; | |
| 4640 } | |
| 4641 } | |
| 4642 else | |
| 4643 ff_expand_buffer[len++] = *wc_part++; | |
| 4644 } | |
| 4645 ff_expand_buffer[len] = NUL; | |
| 1541 | 4646 search_ctx->ffsc_wc_path = vim_strsave(ff_expand_buffer); |
| 4647 | |
| 4648 if (search_ctx->ffsc_wc_path == NULL) | |
| 7 | 4649 goto error_return; |
| 4650 } | |
| 4651 else | |
| 4652 #endif | |
| 1541 | 4653 search_ctx->ffsc_fix_path = vim_strsave(path); |
| 4654 | |
| 4655 if (search_ctx->ffsc_start_dir == NULL) | |
| 7 | 4656 { |
| 4657 /* store the fix part as startdir. | |
| 4658 * This is needed if the parameter path is fully qualified. | |
| 4659 */ | |
| 1541 | 4660 search_ctx->ffsc_start_dir = vim_strsave(search_ctx->ffsc_fix_path); |
|
2445
04dae202d316
Fixes for coverity warnings.
Bram Moolenaar <bram@vim.org>
parents:
2409
diff
changeset
|
4661 if (search_ctx->ffsc_start_dir == NULL) |
|
04dae202d316
Fixes for coverity warnings.
Bram Moolenaar <bram@vim.org>
parents:
2409
diff
changeset
|
4662 goto error_return; |
|
04dae202d316
Fixes for coverity warnings.
Bram Moolenaar <bram@vim.org>
parents:
2409
diff
changeset
|
4663 search_ctx->ffsc_fix_path[0] = NUL; |
| 7 | 4664 } |
| 4665 | |
| 4666 /* create an absolute path */ | |
| 3202 | 4667 if (STRLEN(search_ctx->ffsc_start_dir) |
| 4668 + STRLEN(search_ctx->ffsc_fix_path) + 3 >= MAXPATHL) | |
| 4669 { | |
| 4670 EMSG(_(e_pathtoolong)); | |
| 4671 goto error_return; | |
| 4672 } | |
| 1541 | 4673 STRCPY(ff_expand_buffer, search_ctx->ffsc_start_dir); |
| 7 | 4674 add_pathsep(ff_expand_buffer); |
| 1541 | 4675 STRCAT(ff_expand_buffer, search_ctx->ffsc_fix_path); |
| 7 | 4676 add_pathsep(ff_expand_buffer); |
| 4677 | |
| 4678 sptr = ff_create_stack_element(ff_expand_buffer, | |
| 4679 #ifdef FEAT_PATH_EXTRA | |
| 1541 | 4680 search_ctx->ffsc_wc_path, |
| 7 | 4681 #endif |
| 4682 level, 0); | |
| 4683 | |
| 4684 if (sptr == NULL) | |
| 4685 goto error_return; | |
| 4686 | |
| 1541 | 4687 ff_push(search_ctx, sptr); |
| 4688 | |
| 4689 search_ctx->ffsc_file_to_search = vim_strsave(filename); | |
| 4690 if (search_ctx->ffsc_file_to_search == NULL) | |
| 7 | 4691 goto error_return; |
| 4692 | |
| 1541 | 4693 return search_ctx; |
| 7 | 4694 |
| 4695 error_return: | |
| 4696 /* | |
| 4697 * We clear the search context now! | |
| 4698 * Even when the caller gave us a (perhaps valid) context we free it here, | |
| 4699 * as we might have already destroyed it. | |
| 4700 */ | |
| 1541 | 4701 vim_findfile_cleanup(search_ctx); |
| 7 | 4702 return NULL; |
| 4703 } | |
| 4704 | |
| 4705 #if defined(FEAT_PATH_EXTRA) || defined(PROTO) | |
| 4706 /* | |
| 4707 * Get the stopdir string. Check that ';' is not escaped. | |
| 4708 */ | |
| 4709 char_u * | |
| 4710 vim_findfile_stopdir(buf) | |
| 4711 char_u *buf; | |
| 4712 { | |
| 4713 char_u *r_ptr = buf; | |
| 4714 | |
| 4715 while (*r_ptr != NUL && *r_ptr != ';') | |
| 4716 { | |
| 4717 if (r_ptr[0] == '\\' && r_ptr[1] == ';') | |
| 4718 { | |
| 2984 | 4719 /* Overwrite the escape char, |
| 4720 * use STRLEN(r_ptr) to move the trailing '\0'. */ | |
| 1621 | 4721 STRMOVE(r_ptr, r_ptr + 1); |
| 7 | 4722 r_ptr++; |
| 4723 } | |
| 4724 r_ptr++; | |
| 4725 } | |
| 4726 if (*r_ptr == ';') | |
| 4727 { | |
| 4728 *r_ptr = 0; | |
| 4729 r_ptr++; | |
| 4730 } | |
| 4731 else if (*r_ptr == NUL) | |
| 4732 r_ptr = NULL; | |
| 4733 return r_ptr; | |
| 4734 } | |
| 4735 #endif | |
| 4736 | |
| 1541 | 4737 /* |
| 4738 * Clean up the given search context. Can handle a NULL pointer. | |
| 4739 */ | |
| 7 | 4740 void |
| 4741 vim_findfile_cleanup(ctx) | |
| 4742 void *ctx; | |
| 4743 { | |
| 359 | 4744 if (ctx == NULL) |
| 7 | 4745 return; |
| 4746 | |
| 4747 vim_findfile_free_visited(ctx); | |
| 1541 | 4748 ff_clear(ctx); |
| 7 | 4749 vim_free(ctx); |
| 4750 } | |
| 4751 | |
| 4752 /* | |
| 4753 * Find a file in a search context. | |
| 4754 * The search context was created with vim_findfile_init() above. | |
| 4755 * Return a pointer to an allocated file name or NULL if nothing found. | |
| 4756 * To get all matching files call this function until you get NULL. | |
| 4757 * | |
| 20 | 4758 * If the passed search_context is NULL, NULL is returned. |
| 7 | 4759 * |
| 4760 * The search algorithm is depth first. To change this replace the | |
| 4761 * stack with a list (don't forget to leave partly searched directories on the | |
| 4762 * top of the list). | |
| 4763 */ | |
| 4764 char_u * | |
| 1541 | 4765 vim_findfile(search_ctx_arg) |
| 4766 void *search_ctx_arg; | |
| 7 | 4767 { |
| 4768 char_u *file_path; | |
| 4769 #ifdef FEAT_PATH_EXTRA | |
| 4770 char_u *rest_of_wildcards; | |
| 4771 char_u *path_end = NULL; | |
| 4772 #endif | |
| 1541 | 4773 ff_stack_T *stackp; |
| 7 | 4774 #if defined(FEAT_SEARCHPATH) || defined(FEAT_PATH_EXTRA) |
| 4775 int len; | |
| 4776 #endif | |
| 4777 int i; | |
| 4778 char_u *p; | |
| 4779 #ifdef FEAT_SEARCHPATH | |
| 4780 char_u *suf; | |
| 4781 #endif | |
| 1541 | 4782 ff_search_ctx_T *search_ctx; |
| 4783 | |
| 4784 if (search_ctx_arg == NULL) | |
| 7 | 4785 return NULL; |
| 4786 | |
| 1541 | 4787 search_ctx = (ff_search_ctx_T *)search_ctx_arg; |
| 7 | 4788 |
| 4789 /* | |
| 4790 * filepath is used as buffer for various actions and as the storage to | |
| 4791 * return a found filename. | |
| 4792 */ | |
| 4793 if ((file_path = alloc((int)MAXPATHL)) == NULL) | |
| 4794 return NULL; | |
| 4795 | |
| 4796 #ifdef FEAT_PATH_EXTRA | |
| 4797 /* store the end of the start dir -- needed for upward search */ | |
| 1541 | 4798 if (search_ctx->ffsc_start_dir != NULL) |
| 4799 path_end = &search_ctx->ffsc_start_dir[ | |
| 4800 STRLEN(search_ctx->ffsc_start_dir)]; | |
| 7 | 4801 #endif |
| 4802 | |
| 4803 #ifdef FEAT_PATH_EXTRA | |
| 4804 /* upward search loop */ | |
| 4805 for (;;) | |
| 4806 { | |
| 4807 #endif | |
| 4808 /* downward search loop */ | |
| 4809 for (;;) | |
| 4810 { | |
| 4811 /* check if user user wants to stop the search*/ | |
| 4812 ui_breakcheck(); | |
| 4813 if (got_int) | |
| 4814 break; | |
| 4815 | |
| 4816 /* get directory to work on from stack */ | |
| 1541 | 4817 stackp = ff_pop(search_ctx); |
| 4818 if (stackp == NULL) | |
| 7 | 4819 break; |
| 4820 | |
| 4821 /* | |
| 4822 * TODO: decide if we leave this test in | |
| 4823 * | |
| 4824 * GOOD: don't search a directory(-tree) twice. | |
| 4825 * BAD: - check linked list for every new directory entered. | |
| 4826 * - check for double files also done below | |
| 4827 * | |
| 4828 * Here we check if we already searched this directory. | |
| 4829 * We already searched a directory if: | |
| 4830 * 1) The directory is the same. | |
| 4831 * 2) We would use the same wildcard string. | |
| 4832 * | |
| 4833 * Good if you have links on same directory via several ways | |
| 4834 * or you have selfreferences in directories (e.g. SuSE Linux 6.3: | |
| 4835 * /etc/rc.d/init.d is linked to /etc/rc.d -> endless loop) | |
| 4836 * | |
| 4837 * This check is only needed for directories we work on for the | |
| 1541 | 4838 * first time (hence stackp->ff_filearray == NULL) |
| 7 | 4839 */ |
| 1541 | 4840 if (stackp->ffs_filearray == NULL |
| 4841 && ff_check_visited(&search_ctx->ffsc_dir_visited_list | |
| 7 | 4842 ->ffvl_visited_list, |
| 1541 | 4843 stackp->ffs_fix_path |
| 7 | 4844 #ifdef FEAT_PATH_EXTRA |
| 1541 | 4845 , stackp->ffs_wc_path |
| 7 | 4846 #endif |
| 4847 ) == FAIL) | |
| 4848 { | |
| 4849 #ifdef FF_VERBOSE | |
| 4850 if (p_verbose >= 5) | |
| 4851 { | |
| 293 | 4852 verbose_enter_scroll(); |
| 7 | 4853 smsg((char_u *)"Already Searched: %s (%s)", |
| 1541 | 4854 stackp->ffs_fix_path, stackp->ffs_wc_path); |
| 7 | 4855 /* don't overwrite this either */ |
| 4856 msg_puts((char_u *)"\n"); | |
| 293 | 4857 verbose_leave_scroll(); |
| 7 | 4858 } |
| 4859 #endif | |
| 1541 | 4860 ff_free_stack_element(stackp); |
| 7 | 4861 continue; |
| 4862 } | |
| 4863 #ifdef FF_VERBOSE | |
| 4864 else if (p_verbose >= 5) | |
| 4865 { | |
| 293 | 4866 verbose_enter_scroll(); |
| 273 | 4867 smsg((char_u *)"Searching: %s (%s)", |
| 1541 | 4868 stackp->ffs_fix_path, stackp->ffs_wc_path); |
| 7 | 4869 /* don't overwrite this either */ |
| 4870 msg_puts((char_u *)"\n"); | |
| 293 | 4871 verbose_leave_scroll(); |
| 7 | 4872 } |
| 4873 #endif | |
| 4874 | |
| 4875 /* check depth */ | |
| 1541 | 4876 if (stackp->ffs_level <= 0) |
| 7 | 4877 { |
| 1541 | 4878 ff_free_stack_element(stackp); |
| 7 | 4879 continue; |
| 4880 } | |
| 4881 | |
| 4882 file_path[0] = NUL; | |
| 4883 | |
| 4884 /* | |
| 4885 * If no filearray till now expand wildcards | |
| 4886 * The function expand_wildcards() can handle an array of paths | |
| 4887 * and all possible expands are returned in one array. We use this | |
| 4888 * to handle the expansion of '**' into an empty string. | |
| 4889 */ | |
| 1541 | 4890 if (stackp->ffs_filearray == NULL) |
| 7 | 4891 { |
| 4892 char_u *dirptrs[2]; | |
| 4893 | |
| 4894 /* we use filepath to build the path expand_wildcards() should | |
| 4895 * expand. | |
| 4896 */ | |
| 4897 dirptrs[0] = file_path; | |
| 4898 dirptrs[1] = NULL; | |
| 4899 | |
| 4900 /* if we have a start dir copy it in */ | |
| 1541 | 4901 if (!vim_isAbsName(stackp->ffs_fix_path) |
| 4902 && search_ctx->ffsc_start_dir) | |
| 7 | 4903 { |
| 1541 | 4904 STRCPY(file_path, search_ctx->ffsc_start_dir); |
| 7 | 4905 add_pathsep(file_path); |
| 4906 } | |
| 4907 | |
| 4908 /* append the fix part of the search path */ | |
| 1541 | 4909 STRCAT(file_path, stackp->ffs_fix_path); |
| 7 | 4910 add_pathsep(file_path); |
| 4911 | |
| 4912 #ifdef FEAT_PATH_EXTRA | |
| 1541 | 4913 rest_of_wildcards = stackp->ffs_wc_path; |
| 7 | 4914 if (*rest_of_wildcards != NUL) |
| 4915 { | |
| 4916 len = (int)STRLEN(file_path); | |
| 4917 if (STRNCMP(rest_of_wildcards, "**", 2) == 0) | |
| 4918 { | |
| 4919 /* pointer to the restrict byte | |
| 4920 * The restrict byte is not a character! | |
| 4921 */ | |
| 4922 p = rest_of_wildcards + 2; | |
| 4923 | |
| 4924 if (*p > 0) | |
| 4925 { | |
| 4926 (*p)--; | |
| 4927 file_path[len++] = '*'; | |
| 4928 } | |
| 4929 | |
| 4930 if (*p == 0) | |
| 4931 { | |
| 4932 /* remove '**<numb> from wildcards */ | |
| 1621 | 4933 STRMOVE(rest_of_wildcards, rest_of_wildcards + 3); |
| 7 | 4934 } |
| 4935 else | |
| 4936 rest_of_wildcards += 3; | |
| 4937 | |
| 1541 | 4938 if (stackp->ffs_star_star_empty == 0) |
| 7 | 4939 { |
| 4940 /* if not done before, expand '**' to empty */ | |
| 1541 | 4941 stackp->ffs_star_star_empty = 1; |
| 4942 dirptrs[1] = stackp->ffs_fix_path; | |
| 7 | 4943 } |
| 4944 } | |
| 4945 | |
| 4946 /* | |
| 4947 * Here we copy until the next path separator or the end of | |
| 4948 * the path. If we stop at a path separator, there is | |
| 1209 | 4949 * still something else left. This is handled below by |
| 7 | 4950 * pushing every directory returned from expand_wildcards() |
| 4951 * on the stack again for further search. | |
| 4952 */ | |
| 4953 while (*rest_of_wildcards | |
| 4954 && !vim_ispathsep(*rest_of_wildcards)) | |
| 4955 file_path[len++] = *rest_of_wildcards++; | |
| 4956 | |
| 4957 file_path[len] = NUL; | |
| 4958 if (vim_ispathsep(*rest_of_wildcards)) | |
| 4959 rest_of_wildcards++; | |
| 4960 } | |
| 4961 #endif | |
| 4962 | |
| 4963 /* | |
| 4964 * Expand wildcards like "*" and "$VAR". | |
| 4965 * If the path is a URL don't try this. | |
| 4966 */ | |
| 4967 if (path_with_url(dirptrs[0])) | |
| 4968 { | |
| 1541 | 4969 stackp->ffs_filearray = (char_u **) |
| 7 | 4970 alloc((unsigned)sizeof(char *)); |
| 1541 | 4971 if (stackp->ffs_filearray != NULL |
| 4972 && (stackp->ffs_filearray[0] | |
| 7 | 4973 = vim_strsave(dirptrs[0])) != NULL) |
| 1541 | 4974 stackp->ffs_filearray_size = 1; |
| 7 | 4975 else |
| 1541 | 4976 stackp->ffs_filearray_size = 0; |
| 7 | 4977 } |
| 4978 else | |
| 2984 | 4979 /* Add EW_NOTWILD because the expanded path may contain |
| 4980 * wildcard characters that are to be taken literally. | |
| 4981 * This is a bit of a hack. */ | |
| 7 | 4982 expand_wildcards((dirptrs[1] == NULL) ? 1 : 2, dirptrs, |
| 1541 | 4983 &stackp->ffs_filearray_size, |
| 4984 &stackp->ffs_filearray, | |
| 2984 | 4985 EW_DIR|EW_ADDSLASH|EW_SILENT|EW_NOTWILD); |
| 7 | 4986 |
| 1541 | 4987 stackp->ffs_filearray_cur = 0; |
| 4988 stackp->ffs_stage = 0; | |
| 7 | 4989 } |
| 4990 #ifdef FEAT_PATH_EXTRA | |
| 4991 else | |
| 1541 | 4992 rest_of_wildcards = &stackp->ffs_wc_path[ |
| 4993 STRLEN(stackp->ffs_wc_path)]; | |
| 4994 #endif | |
| 4995 | |
| 4996 if (stackp->ffs_stage == 0) | |
| 7 | 4997 { |
| 4998 /* this is the first time we work on this directory */ | |
| 4999 #ifdef FEAT_PATH_EXTRA | |
| 5000 if (*rest_of_wildcards == NUL) | |
| 5001 #endif | |
| 5002 { | |
| 5003 /* | |
| 5004 * we don't have further wildcards to expand, so we have to | |
| 5005 * check for the final file now | |
| 5006 */ | |
| 1541 | 5007 for (i = stackp->ffs_filearray_cur; |
| 5008 i < stackp->ffs_filearray_size; ++i) | |
| 7 | 5009 { |
| 1541 | 5010 if (!path_with_url(stackp->ffs_filearray[i]) |
| 5011 && !mch_isdir(stackp->ffs_filearray[i])) | |
| 7 | 5012 continue; /* not a directory */ |
| 5013 | |
| 1993 | 5014 /* prepare the filename to be checked for existence |
| 7 | 5015 * below */ |
| 1541 | 5016 STRCPY(file_path, stackp->ffs_filearray[i]); |
| 7 | 5017 add_pathsep(file_path); |
| 1541 | 5018 STRCAT(file_path, search_ctx->ffsc_file_to_search); |
| 7 | 5019 |
| 5020 /* | |
| 5021 * Try without extra suffix and then with suffixes | |
| 5022 * from 'suffixesadd'. | |
| 5023 */ | |
| 5024 #ifdef FEAT_SEARCHPATH | |
| 5025 len = (int)STRLEN(file_path); | |
|
2521
d890c820722f
Fix: 'suffixesadd' was used for finding tags file.
Bram Moolenaar <bram@vim.org>
parents:
2520
diff
changeset
|
5026 if (search_ctx->ffsc_tagfile) |
|
d890c820722f
Fix: 'suffixesadd' was used for finding tags file.
Bram Moolenaar <bram@vim.org>
parents:
2520
diff
changeset
|
5027 suf = (char_u *)""; |
|
d890c820722f
Fix: 'suffixesadd' was used for finding tags file.
Bram Moolenaar <bram@vim.org>
parents:
2520
diff
changeset
|
5028 else |
|
d890c820722f
Fix: 'suffixesadd' was used for finding tags file.
Bram Moolenaar <bram@vim.org>
parents:
2520
diff
changeset
|
5029 suf = curbuf->b_p_sua; |
| 7 | 5030 for (;;) |
| 5031 #endif | |
| 5032 { | |
| 5033 /* if file exists and we didn't already find it */ | |
| 5034 if ((path_with_url(file_path) | |
| 1541 | 5035 || (mch_getperm(file_path) >= 0 |
| 5036 && (search_ctx->ffsc_find_what | |
| 5037 == FINDFILE_BOTH | |
| 5038 || ((search_ctx->ffsc_find_what | |
| 5039 == FINDFILE_DIR) | |
| 5040 == mch_isdir(file_path))))) | |
| 7 | 5041 #ifndef FF_VERBOSE |
| 5042 && (ff_check_visited( | |
| 1541 | 5043 &search_ctx->ffsc_visited_list->ffvl_visited_list, |
| 7 | 5044 file_path |
| 5045 #ifdef FEAT_PATH_EXTRA | |
| 5046 , (char_u *)"" | |
| 5047 #endif | |
| 5048 ) == OK) | |
| 5049 #endif | |
| 5050 ) | |
| 5051 { | |
| 5052 #ifdef FF_VERBOSE | |
| 5053 if (ff_check_visited( | |
| 1541 | 5054 &search_ctx->ffsc_visited_list->ffvl_visited_list, |
| 7 | 5055 file_path |
| 5056 #ifdef FEAT_PATH_EXTRA | |
| 5057 , (char_u *)"" | |
| 5058 #endif | |
| 5059 ) == FAIL) | |
| 5060 { | |
| 5061 if (p_verbose >= 5) | |
| 5062 { | |
| 293 | 5063 verbose_enter_scroll(); |
| 273 | 5064 smsg((char_u *)"Already: %s", |
| 7 | 5065 file_path); |
| 5066 /* don't overwrite this either */ | |
| 5067 msg_puts((char_u *)"\n"); | |
| 293 | 5068 verbose_leave_scroll(); |
| 7 | 5069 } |
| 5070 continue; | |
| 5071 } | |
| 5072 #endif | |
| 5073 | |
| 5074 /* push dir to examine rest of subdirs later */ | |
| 1541 | 5075 stackp->ffs_filearray_cur = i + 1; |
| 5076 ff_push(search_ctx, stackp); | |
| 7 | 5077 |
| 1789 | 5078 if (!path_with_url(file_path)) |
| 5079 simplify_filename(file_path); | |
| 7 | 5080 if (mch_dirname(ff_expand_buffer, MAXPATHL) |
| 5081 == OK) | |
| 5082 { | |
| 5083 p = shorten_fname(file_path, | |
| 5084 ff_expand_buffer); | |
| 5085 if (p != NULL) | |
| 1621 | 5086 STRMOVE(file_path, p); |
| 7 | 5087 } |
| 5088 #ifdef FF_VERBOSE | |
| 5089 if (p_verbose >= 5) | |
| 5090 { | |
| 293 | 5091 verbose_enter_scroll(); |
| 273 | 5092 smsg((char_u *)"HIT: %s", file_path); |
| 7 | 5093 /* don't overwrite this either */ |
| 5094 msg_puts((char_u *)"\n"); | |
| 293 | 5095 verbose_leave_scroll(); |
| 7 | 5096 } |
| 5097 #endif | |
| 5098 return file_path; | |
| 5099 } | |
| 5100 | |
| 5101 #ifdef FEAT_SEARCHPATH | |
| 5102 /* Not found or found already, try next suffix. */ | |
| 5103 if (*suf == NUL) | |
| 5104 break; | |
| 5105 copy_option_part(&suf, file_path + len, | |
| 5106 MAXPATHL - len, ","); | |
| 5107 #endif | |
| 5108 } | |
| 5109 } | |
| 5110 } | |
| 5111 #ifdef FEAT_PATH_EXTRA | |
| 5112 else | |
| 5113 { | |
| 5114 /* | |
| 5115 * still wildcards left, push the directories for further | |
| 5116 * search | |
| 5117 */ | |
| 1541 | 5118 for (i = stackp->ffs_filearray_cur; |
| 5119 i < stackp->ffs_filearray_size; ++i) | |
| 7 | 5120 { |
| 1541 | 5121 if (!mch_isdir(stackp->ffs_filearray[i])) |
| 7 | 5122 continue; /* not a directory */ |
| 5123 | |
| 1541 | 5124 ff_push(search_ctx, |
| 5125 ff_create_stack_element( | |
| 5126 stackp->ffs_filearray[i], | |
| 5127 rest_of_wildcards, | |
| 5128 stackp->ffs_level - 1, 0)); | |
| 7 | 5129 } |
| 5130 } | |
| 5131 #endif | |
| 1541 | 5132 stackp->ffs_filearray_cur = 0; |
| 5133 stackp->ffs_stage = 1; | |
| 7 | 5134 } |
| 5135 | |
| 5136 #ifdef FEAT_PATH_EXTRA | |
| 5137 /* | |
| 5138 * if wildcards contains '**' we have to descent till we reach the | |
| 5139 * leaves of the directory tree. | |
| 5140 */ | |
| 1541 | 5141 if (STRNCMP(stackp->ffs_wc_path, "**", 2) == 0) |
| 7 | 5142 { |
| 1541 | 5143 for (i = stackp->ffs_filearray_cur; |
| 5144 i < stackp->ffs_filearray_size; ++i) | |
| 7 | 5145 { |
| 1541 | 5146 if (fnamecmp(stackp->ffs_filearray[i], |
| 5147 stackp->ffs_fix_path) == 0) | |
| 7 | 5148 continue; /* don't repush same directory */ |
| 1541 | 5149 if (!mch_isdir(stackp->ffs_filearray[i])) |
| 7 | 5150 continue; /* not a directory */ |
| 1541 | 5151 ff_push(search_ctx, |
| 5152 ff_create_stack_element(stackp->ffs_filearray[i], | |
| 5153 stackp->ffs_wc_path, stackp->ffs_level - 1, 1)); | |
| 7 | 5154 } |
| 5155 } | |
| 5156 #endif | |
| 5157 | |
| 5158 /* we are done with the current directory */ | |
| 1541 | 5159 ff_free_stack_element(stackp); |
| 7 | 5160 |
| 5161 } | |
| 5162 | |
| 5163 #ifdef FEAT_PATH_EXTRA | |
| 5164 /* If we reached this, we didn't find anything downwards. | |
| 5165 * Let's check if we should do an upward search. | |
| 5166 */ | |
| 1541 | 5167 if (search_ctx->ffsc_start_dir |
| 5168 && search_ctx->ffsc_stopdirs_v != NULL && !got_int) | |
| 7 | 5169 { |
| 5170 ff_stack_T *sptr; | |
| 5171 | |
| 5172 /* is the last starting directory in the stop list? */ | |
| 1541 | 5173 if (ff_path_in_stoplist(search_ctx->ffsc_start_dir, |
| 5174 (int)(path_end - search_ctx->ffsc_start_dir), | |
| 5175 search_ctx->ffsc_stopdirs_v) == TRUE) | |
| 7 | 5176 break; |
| 5177 | |
| 5178 /* cut of last dir */ | |
| 1541 | 5179 while (path_end > search_ctx->ffsc_start_dir |
| 5180 && vim_ispathsep(*path_end)) | |
| 7 | 5181 path_end--; |
| 1541 | 5182 while (path_end > search_ctx->ffsc_start_dir |
| 5183 && !vim_ispathsep(path_end[-1])) | |
| 7 | 5184 path_end--; |
| 5185 *path_end = 0; | |
| 5186 path_end--; | |
| 5187 | |
| 1541 | 5188 if (*search_ctx->ffsc_start_dir == 0) |
| 7 | 5189 break; |
| 5190 | |
| 1541 | 5191 STRCPY(file_path, search_ctx->ffsc_start_dir); |
| 7 | 5192 add_pathsep(file_path); |
| 1541 | 5193 STRCAT(file_path, search_ctx->ffsc_fix_path); |
| 7 | 5194 |
| 5195 /* create a new stack entry */ | |
| 5196 sptr = ff_create_stack_element(file_path, | |
| 1541 | 5197 search_ctx->ffsc_wc_path, search_ctx->ffsc_level, 0); |
| 7 | 5198 if (sptr == NULL) |
| 5199 break; | |
| 1541 | 5200 ff_push(search_ctx, sptr); |
| 7 | 5201 } |
| 5202 else | |
| 5203 break; | |
| 5204 } | |
| 5205 #endif | |
| 5206 | |
| 5207 vim_free(file_path); | |
| 5208 return NULL; | |
| 5209 } | |
| 5210 | |
| 5211 /* | |
| 5212 * Free the list of lists of visited files and directories | |
| 5213 * Can handle it if the passed search_context is NULL; | |
| 5214 */ | |
| 5215 void | |
| 1541 | 5216 vim_findfile_free_visited(search_ctx_arg) |
| 5217 void *search_ctx_arg; | |
| 7 | 5218 { |
| 1541 | 5219 ff_search_ctx_T *search_ctx; |
| 5220 | |
| 5221 if (search_ctx_arg == NULL) | |
| 7 | 5222 return; |
| 5223 | |
| 1541 | 5224 search_ctx = (ff_search_ctx_T *)search_ctx_arg; |
| 5225 vim_findfile_free_visited_list(&search_ctx->ffsc_visited_lists_list); | |
| 5226 vim_findfile_free_visited_list(&search_ctx->ffsc_dir_visited_lists_list); | |
| 7 | 5227 } |
| 5228 | |
| 5229 static void | |
| 5230 vim_findfile_free_visited_list(list_headp) | |
| 5231 ff_visited_list_hdr_T **list_headp; | |
| 5232 { | |
| 5233 ff_visited_list_hdr_T *vp; | |
| 5234 | |
| 5235 while (*list_headp != NULL) | |
| 5236 { | |
| 5237 vp = (*list_headp)->ffvl_next; | |
| 5238 ff_free_visited_list((*list_headp)->ffvl_visited_list); | |
| 5239 | |
| 5240 vim_free((*list_headp)->ffvl_filename); | |
| 5241 vim_free(*list_headp); | |
| 5242 *list_headp = vp; | |
| 5243 } | |
| 5244 *list_headp = NULL; | |
| 5245 } | |
| 5246 | |
| 5247 static void | |
| 5248 ff_free_visited_list(vl) | |
| 5249 ff_visited_T *vl; | |
| 5250 { | |
| 5251 ff_visited_T *vp; | |
| 5252 | |
| 5253 while (vl != NULL) | |
| 5254 { | |
| 5255 vp = vl->ffv_next; | |
| 5256 #ifdef FEAT_PATH_EXTRA | |
| 5257 vim_free(vl->ffv_wc_path); | |
| 5258 #endif | |
| 5259 vim_free(vl); | |
| 5260 vl = vp; | |
| 5261 } | |
| 5262 vl = NULL; | |
| 5263 } | |
| 5264 | |
| 5265 /* | |
| 5266 * Returns the already visited list for the given filename. If none is found it | |
| 5267 * allocates a new one. | |
| 5268 */ | |
| 5269 static ff_visited_list_hdr_T* | |
| 5270 ff_get_visited_list(filename, list_headp) | |
| 5271 char_u *filename; | |
| 5272 ff_visited_list_hdr_T **list_headp; | |
| 5273 { | |
| 5274 ff_visited_list_hdr_T *retptr = NULL; | |
| 5275 | |
| 5276 /* check if a visited list for the given filename exists */ | |
| 5277 if (*list_headp != NULL) | |
| 5278 { | |
| 5279 retptr = *list_headp; | |
| 5280 while (retptr != NULL) | |
| 5281 { | |
| 5282 if (fnamecmp(filename, retptr->ffvl_filename) == 0) | |
| 5283 { | |
| 5284 #ifdef FF_VERBOSE | |
| 5285 if (p_verbose >= 5) | |
| 5286 { | |
| 293 | 5287 verbose_enter_scroll(); |
| 273 | 5288 smsg((char_u *)"ff_get_visited_list: FOUND list for %s", |
| 7 | 5289 filename); |
| 5290 /* don't overwrite this either */ | |
| 5291 msg_puts((char_u *)"\n"); | |
| 293 | 5292 verbose_leave_scroll(); |
| 7 | 5293 } |
| 5294 #endif | |
| 5295 return retptr; | |
| 5296 } | |
| 5297 retptr = retptr->ffvl_next; | |
| 5298 } | |
| 5299 } | |
| 5300 | |
| 5301 #ifdef FF_VERBOSE | |
| 5302 if (p_verbose >= 5) | |
| 5303 { | |
| 293 | 5304 verbose_enter_scroll(); |
| 273 | 5305 smsg((char_u *)"ff_get_visited_list: new list for %s", filename); |
| 7 | 5306 /* don't overwrite this either */ |
| 5307 msg_puts((char_u *)"\n"); | |
| 293 | 5308 verbose_leave_scroll(); |
| 7 | 5309 } |
| 5310 #endif | |
| 5311 | |
| 5312 /* | |
| 5313 * if we reach this we didn't find a list and we have to allocate new list | |
| 5314 */ | |
| 5315 retptr = (ff_visited_list_hdr_T*)alloc((unsigned)sizeof(*retptr)); | |
| 5316 if (retptr == NULL) | |
| 5317 return NULL; | |
| 5318 | |
| 5319 retptr->ffvl_visited_list = NULL; | |
| 5320 retptr->ffvl_filename = vim_strsave(filename); | |
| 5321 if (retptr->ffvl_filename == NULL) | |
| 5322 { | |
| 5323 vim_free(retptr); | |
| 5324 return NULL; | |
| 5325 } | |
| 5326 retptr->ffvl_next = *list_headp; | |
| 5327 *list_headp = retptr; | |
| 5328 | |
| 5329 return retptr; | |
| 5330 } | |
| 5331 | |
| 5332 #ifdef FEAT_PATH_EXTRA | |
| 5333 /* | |
| 5334 * check if two wildcard paths are equal. Returns TRUE or FALSE. | |
| 5335 * They are equal if: | |
| 5336 * - both paths are NULL | |
| 5337 * - they have the same length | |
| 5338 * - char by char comparison is OK | |
| 5339 * - the only differences are in the counters behind a '**', so | |
| 5340 * '**\20' is equal to '**\24' | |
| 5341 */ | |
| 5342 static int | |
| 5343 ff_wc_equal(s1, s2) | |
| 5344 char_u *s1; | |
| 5345 char_u *s2; | |
| 5346 { | |
| 5347 int i; | |
| 5348 | |
| 5349 if (s1 == s2) | |
| 5350 return TRUE; | |
| 5351 | |
| 5352 if (s1 == NULL || s2 == NULL) | |
| 5353 return FALSE; | |
| 5354 | |
| 5355 if (STRLEN(s1) != STRLEN(s2)) | |
| 5356 return FAIL; | |
| 5357 | |
| 5358 for (i = 0; s1[i] != NUL && s2[i] != NUL; i++) | |
| 5359 { | |
| 5360 if (s1[i] != s2[i] | |
| 5361 #ifdef CASE_INSENSITIVE_FILENAME | |
| 5362 && TOUPPER_LOC(s1[i]) != TOUPPER_LOC(s2[i]) | |
| 5363 #endif | |
| 5364 ) | |
| 5365 { | |
| 5366 if (i >= 2) | |
| 5367 if (s1[i-1] == '*' && s1[i-2] == '*') | |
| 5368 continue; | |
| 5369 else | |
| 5370 return FAIL; | |
| 5371 else | |
| 5372 return FAIL; | |
| 5373 } | |
| 5374 } | |
| 5375 return TRUE; | |
| 5376 } | |
| 5377 #endif | |
| 5378 | |
| 5379 /* | |
| 5380 * maintains the list of already visited files and dirs | |
| 5381 * returns FAIL if the given file/dir is already in the list | |
| 5382 * returns OK if it is newly added | |
| 5383 * | |
| 5384 * TODO: What to do on memory allocation problems? | |
| 5385 * -> return TRUE - Better the file is found several times instead of | |
| 5386 * never. | |
| 5387 */ | |
| 5388 static int | |
| 5389 ff_check_visited(visited_list, fname | |
| 5390 #ifdef FEAT_PATH_EXTRA | |
| 5391 , wc_path | |
| 5392 #endif | |
| 5393 ) | |
| 5394 ff_visited_T **visited_list; | |
| 5395 char_u *fname; | |
| 5396 #ifdef FEAT_PATH_EXTRA | |
| 5397 char_u *wc_path; | |
| 5398 #endif | |
| 5399 { | |
| 5400 ff_visited_T *vp; | |
| 5401 #ifdef UNIX | |
| 5402 struct stat st; | |
| 5403 int url = FALSE; | |
| 5404 #endif | |
| 5405 | |
| 5406 /* For an URL we only compare the name, otherwise we compare the | |
| 5407 * device/inode (unix) or the full path name (not Unix). */ | |
| 5408 if (path_with_url(fname)) | |
| 5409 { | |
| 418 | 5410 vim_strncpy(ff_expand_buffer, fname, MAXPATHL - 1); |
| 7 | 5411 #ifdef UNIX |
| 5412 url = TRUE; | |
| 5413 #endif | |
| 5414 } | |
| 5415 else | |
| 5416 { | |
| 5417 ff_expand_buffer[0] = NUL; | |
| 5418 #ifdef UNIX | |
| 5419 if (mch_stat((char *)fname, &st) < 0) | |
| 5420 #else | |
| 5421 if (vim_FullName(fname, ff_expand_buffer, MAXPATHL, TRUE) == FAIL) | |
| 5422 #endif | |
| 5423 return FAIL; | |
| 5424 } | |
| 5425 | |
| 5426 /* check against list of already visited files */ | |
| 5427 for (vp = *visited_list; vp != NULL; vp = vp->ffv_next) | |
| 5428 { | |
| 5429 if ( | |
| 5430 #ifdef UNIX | |
| 1881 | 5431 !url ? (vp->ffv_dev_valid && vp->ffv_dev == st.st_dev |
| 5432 && vp->ffv_ino == st.st_ino) | |
| 5433 : | |
| 7 | 5434 #endif |
| 5435 fnamecmp(vp->ffv_fname, ff_expand_buffer) == 0 | |
| 5436 ) | |
| 5437 { | |
| 5438 #ifdef FEAT_PATH_EXTRA | |
| 5439 /* are the wildcard parts equal */ | |
| 5440 if (ff_wc_equal(vp->ffv_wc_path, wc_path) == TRUE) | |
| 5441 #endif | |
| 5442 /* already visited */ | |
| 5443 return FAIL; | |
| 5444 } | |
| 5445 } | |
| 5446 | |
| 5447 /* | |
| 5448 * New file/dir. Add it to the list of visited files/dirs. | |
| 5449 */ | |
| 5450 vp = (ff_visited_T *)alloc((unsigned)(sizeof(ff_visited_T) | |
| 5451 + STRLEN(ff_expand_buffer))); | |
| 5452 | |
| 5453 if (vp != NULL) | |
| 5454 { | |
| 5455 #ifdef UNIX | |
| 5456 if (!url) | |
| 5457 { | |
| 1881 | 5458 vp->ffv_dev_valid = TRUE; |
| 7 | 5459 vp->ffv_ino = st.st_ino; |
| 5460 vp->ffv_dev = st.st_dev; | |
| 5461 vp->ffv_fname[0] = NUL; | |
| 5462 } | |
| 5463 else | |
| 5464 { | |
| 1881 | 5465 vp->ffv_dev_valid = FALSE; |
| 7 | 5466 #endif |
| 5467 STRCPY(vp->ffv_fname, ff_expand_buffer); | |
| 5468 #ifdef UNIX | |
| 5469 } | |
| 5470 #endif | |
| 5471 #ifdef FEAT_PATH_EXTRA | |
| 5472 if (wc_path != NULL) | |
| 5473 vp->ffv_wc_path = vim_strsave(wc_path); | |
| 5474 else | |
| 5475 vp->ffv_wc_path = NULL; | |
| 5476 #endif | |
| 5477 | |
| 5478 vp->ffv_next = *visited_list; | |
| 5479 *visited_list = vp; | |
| 5480 } | |
| 5481 | |
| 5482 return OK; | |
| 5483 } | |
| 5484 | |
| 5485 /* | |
| 5486 * create stack element from given path pieces | |
| 5487 */ | |
| 5488 static ff_stack_T * | |
| 5489 ff_create_stack_element(fix_part, | |
| 5490 #ifdef FEAT_PATH_EXTRA | |
| 5491 wc_part, | |
| 5492 #endif | |
| 5493 level, star_star_empty) | |
| 5494 char_u *fix_part; | |
| 5495 #ifdef FEAT_PATH_EXTRA | |
| 5496 char_u *wc_part; | |
| 5497 #endif | |
| 5498 int level; | |
| 5499 int star_star_empty; | |
| 5500 { | |
| 5501 ff_stack_T *new; | |
| 5502 | |
| 5503 new = (ff_stack_T *)alloc((unsigned)sizeof(ff_stack_T)); | |
| 5504 if (new == NULL) | |
| 5505 return NULL; | |
| 5506 | |
| 5507 new->ffs_prev = NULL; | |
| 5508 new->ffs_filearray = NULL; | |
| 5509 new->ffs_filearray_size = 0; | |
| 5510 new->ffs_filearray_cur = 0; | |
| 5511 new->ffs_stage = 0; | |
| 5512 new->ffs_level = level; | |
| 5513 new->ffs_star_star_empty = star_star_empty;; | |
| 5514 | |
| 5515 /* the following saves NULL pointer checks in vim_findfile */ | |
| 5516 if (fix_part == NULL) | |
| 5517 fix_part = (char_u *)""; | |
| 5518 new->ffs_fix_path = vim_strsave(fix_part); | |
| 5519 | |
| 5520 #ifdef FEAT_PATH_EXTRA | |
| 5521 if (wc_part == NULL) | |
| 5522 wc_part = (char_u *)""; | |
| 5523 new->ffs_wc_path = vim_strsave(wc_part); | |
| 5524 #endif | |
| 5525 | |
| 5526 if (new->ffs_fix_path == NULL | |
| 5527 #ifdef FEAT_PATH_EXTRA | |
| 5528 || new->ffs_wc_path == NULL | |
| 5529 #endif | |
| 5530 ) | |
| 5531 { | |
| 5532 ff_free_stack_element(new); | |
| 5533 new = NULL; | |
| 5534 } | |
| 5535 | |
| 5536 return new; | |
| 5537 } | |
| 5538 | |
| 5539 /* | |
| 1541 | 5540 * Push a dir on the directory stack. |
| 7 | 5541 */ |
| 5542 static void | |
| 1541 | 5543 ff_push(search_ctx, stack_ptr) |
| 5544 ff_search_ctx_T *search_ctx; | |
| 5545 ff_stack_T *stack_ptr; | |
| 7 | 5546 { |
| 5547 /* check for NULL pointer, not to return an error to the user, but | |
| 359 | 5548 * to prevent a crash */ |
| 1541 | 5549 if (stack_ptr != NULL) |
| 7 | 5550 { |
| 1541 | 5551 stack_ptr->ffs_prev = search_ctx->ffsc_stack_ptr; |
| 5552 search_ctx->ffsc_stack_ptr = stack_ptr; | |
| 7 | 5553 } |
| 5554 } | |
| 5555 | |
| 5556 /* | |
| 1541 | 5557 * Pop a dir from the directory stack. |
| 5558 * Returns NULL if stack is empty. | |
| 7 | 5559 */ |
| 5560 static ff_stack_T * | |
| 1541 | 5561 ff_pop(search_ctx) |
| 5562 ff_search_ctx_T *search_ctx; | |
| 7 | 5563 { |
| 5564 ff_stack_T *sptr; | |
| 5565 | |
| 1541 | 5566 sptr = search_ctx->ffsc_stack_ptr; |
| 5567 if (search_ctx->ffsc_stack_ptr != NULL) | |
| 5568 search_ctx->ffsc_stack_ptr = search_ctx->ffsc_stack_ptr->ffs_prev; | |
| 7 | 5569 |
| 5570 return sptr; | |
| 5571 } | |
| 5572 | |
| 5573 /* | |
| 5574 * free the given stack element | |
| 5575 */ | |
| 5576 static void | |
| 1541 | 5577 ff_free_stack_element(stack_ptr) |
| 5578 ff_stack_T *stack_ptr; | |
| 7 | 5579 { |
| 5580 /* vim_free handles possible NULL pointers */ | |
| 1541 | 5581 vim_free(stack_ptr->ffs_fix_path); |
| 7 | 5582 #ifdef FEAT_PATH_EXTRA |
| 1541 | 5583 vim_free(stack_ptr->ffs_wc_path); |
| 5584 #endif | |
| 5585 | |
| 5586 if (stack_ptr->ffs_filearray != NULL) | |
| 5587 FreeWild(stack_ptr->ffs_filearray_size, stack_ptr->ffs_filearray); | |
| 5588 | |
| 5589 vim_free(stack_ptr); | |
| 7 | 5590 } |
| 5591 | |
| 5592 /* | |
| 1541 | 5593 * Clear the search context, but NOT the visited list. |
| 7 | 5594 */ |
| 5595 static void | |
| 1541 | 5596 ff_clear(search_ctx) |
| 5597 ff_search_ctx_T *search_ctx; | |
| 7 | 5598 { |
| 5599 ff_stack_T *sptr; | |
| 5600 | |
| 5601 /* clear up stack */ | |
| 1541 | 5602 while ((sptr = ff_pop(search_ctx)) != NULL) |
| 7 | 5603 ff_free_stack_element(sptr); |
| 5604 | |
| 1541 | 5605 vim_free(search_ctx->ffsc_file_to_search); |
| 5606 vim_free(search_ctx->ffsc_start_dir); | |
| 5607 vim_free(search_ctx->ffsc_fix_path); | |
| 7 | 5608 #ifdef FEAT_PATH_EXTRA |
| 1541 | 5609 vim_free(search_ctx->ffsc_wc_path); |
| 7 | 5610 #endif |
| 5611 | |
| 5612 #ifdef FEAT_PATH_EXTRA | |
| 1541 | 5613 if (search_ctx->ffsc_stopdirs_v != NULL) |
| 7 | 5614 { |
| 5615 int i = 0; | |
| 5616 | |
| 1541 | 5617 while (search_ctx->ffsc_stopdirs_v[i] != NULL) |
| 7 | 5618 { |
| 1541 | 5619 vim_free(search_ctx->ffsc_stopdirs_v[i]); |
| 7 | 5620 i++; |
| 5621 } | |
| 1541 | 5622 vim_free(search_ctx->ffsc_stopdirs_v); |
| 7 | 5623 } |
| 1541 | 5624 search_ctx->ffsc_stopdirs_v = NULL; |
| 7 | 5625 #endif |
| 5626 | |
| 5627 /* reset everything */ | |
| 1541 | 5628 search_ctx->ffsc_file_to_search = NULL; |
| 5629 search_ctx->ffsc_start_dir = NULL; | |
| 5630 search_ctx->ffsc_fix_path = NULL; | |
| 7 | 5631 #ifdef FEAT_PATH_EXTRA |
| 1541 | 5632 search_ctx->ffsc_wc_path = NULL; |
| 5633 search_ctx->ffsc_level = 0; | |
| 7 | 5634 #endif |
| 5635 } | |
| 5636 | |
| 5637 #ifdef FEAT_PATH_EXTRA | |
| 5638 /* | |
| 5639 * check if the given path is in the stopdirs | |
| 5640 * returns TRUE if yes else FALSE | |
| 5641 */ | |
| 5642 static int | |
| 5643 ff_path_in_stoplist(path, path_len, stopdirs_v) | |
| 5644 char_u *path; | |
| 5645 int path_len; | |
| 5646 char_u **stopdirs_v; | |
| 5647 { | |
| 5648 int i = 0; | |
| 5649 | |
| 5650 /* eat up trailing path separators, except the first */ | |
| 461 | 5651 while (path_len > 1 && vim_ispathsep(path[path_len - 1])) |
| 7 | 5652 path_len--; |
| 5653 | |
| 5654 /* if no path consider it as match */ | |
| 5655 if (path_len == 0) | |
| 5656 return TRUE; | |
| 5657 | |
| 5658 for (i = 0; stopdirs_v[i] != NULL; i++) | |
| 5659 { | |
| 5660 if ((int)STRLEN(stopdirs_v[i]) > path_len) | |
| 5661 { | |
| 5662 /* match for parent directory. So '/home' also matches | |
| 5663 * '/home/rks'. Check for PATHSEP in stopdirs_v[i], else | |
| 5664 * '/home/r' would also match '/home/rks' | |
| 5665 */ | |
| 5666 if (fnamencmp(stopdirs_v[i], path, path_len) == 0 | |
| 461 | 5667 && vim_ispathsep(stopdirs_v[i][path_len])) |
| 7 | 5668 return TRUE; |
| 5669 } | |
| 5670 else | |
| 5671 { | |
| 5672 if (fnamecmp(stopdirs_v[i], path) == 0) | |
| 5673 return TRUE; | |
| 5674 } | |
| 5675 } | |
| 5676 return FALSE; | |
| 5677 } | |
| 5678 #endif | |
| 5679 | |
| 5680 #if defined(FEAT_SEARCHPATH) || defined(PROTO) | |
| 5681 /* | |
| 1541 | 5682 * Find the file name "ptr[len]" in the path. Also finds directory names. |
| 7 | 5683 * |
| 5684 * On the first call set the parameter 'first' to TRUE to initialize | |
| 5685 * the search. For repeating calls to FALSE. | |
| 5686 * | |
| 5687 * Repeating calls will return other files called 'ptr[len]' from the path. | |
| 5688 * | |
| 5689 * Only on the first call 'ptr' and 'len' are used. For repeating calls they | |
| 5690 * don't need valid values. | |
| 5691 * | |
| 5692 * If nothing found on the first call the option FNAME_MESS will issue the | |
| 5693 * message: | |
| 5694 * 'Can't find file "<file>" in path' | |
| 5695 * On repeating calls: | |
| 5696 * 'No more file "<file>" found in path' | |
| 5697 * | |
| 5698 * options: | |
| 5699 * FNAME_MESS give error message when not found | |
| 5700 * | |
| 5701 * Uses NameBuff[]! | |
| 5702 * | |
| 5703 * Returns an allocated string for the file name. NULL for error. | |
| 5704 * | |
| 5705 */ | |
| 5706 char_u * | |
| 5707 find_file_in_path(ptr, len, options, first, rel_fname) | |
| 5708 char_u *ptr; /* file name */ | |
| 5709 int len; /* length of file name */ | |
| 5710 int options; | |
| 5711 int first; /* use count'th matching file name */ | |
| 5712 char_u *rel_fname; /* file name searching relative to */ | |
| 5713 { | |
| 5714 return find_file_in_path_option(ptr, len, options, first, | |
| 5715 *curbuf->b_p_path == NUL ? p_path : curbuf->b_p_path, | |
| 1541 | 5716 FINDFILE_BOTH, rel_fname, curbuf->b_p_sua); |
| 7 | 5717 } |
| 5718 | |
| 359 | 5719 static char_u *ff_file_to_find = NULL; |
| 5720 static void *fdip_search_ctx = NULL; | |
| 5721 | |
| 5722 #if defined(EXITFREE) | |
| 5723 static void | |
| 5724 free_findfile() | |
| 5725 { | |
| 5726 vim_free(ff_file_to_find); | |
| 5727 vim_findfile_cleanup(fdip_search_ctx); | |
| 5728 } | |
| 5729 #endif | |
| 5730 | |
| 7 | 5731 /* |
| 5732 * Find the directory name "ptr[len]" in the path. | |
| 5733 * | |
| 5734 * options: | |
| 5735 * FNAME_MESS give error message when not found | |
| 5736 * | |
| 5737 * Uses NameBuff[]! | |
| 5738 * | |
| 5739 * Returns an allocated string for the file name. NULL for error. | |
| 5740 */ | |
| 5741 char_u * | |
| 5742 find_directory_in_path(ptr, len, options, rel_fname) | |
| 5743 char_u *ptr; /* file name */ | |
| 5744 int len; /* length of file name */ | |
| 5745 int options; | |
| 5746 char_u *rel_fname; /* file name searching relative to */ | |
| 5747 { | |
| 5748 return find_file_in_path_option(ptr, len, options, TRUE, p_cdpath, | |
| 1541 | 5749 FINDFILE_DIR, rel_fname, (char_u *)""); |
| 7 | 5750 } |
| 5751 | |
| 19 | 5752 char_u * |
| 1541 | 5753 find_file_in_path_option(ptr, len, options, first, path_option, find_what, rel_fname, suffixes) |
| 7 | 5754 char_u *ptr; /* file name */ |
| 5755 int len; /* length of file name */ | |
| 5756 int options; | |
| 5757 int first; /* use count'th matching file name */ | |
| 5758 char_u *path_option; /* p_path or p_cdpath */ | |
| 1541 | 5759 int find_what; /* FINDFILE_FILE, _DIR or _BOTH */ |
| 7 | 5760 char_u *rel_fname; /* file name we are looking relative to. */ |
| 794 | 5761 char_u *suffixes; /* list of suffixes, 'suffixesadd' option */ |
| 7 | 5762 { |
| 5763 static char_u *dir; | |
| 5764 static int did_findfile_init = FALSE; | |
| 5765 char_u save_char; | |
| 5766 char_u *file_name = NULL; | |
| 5767 char_u *buf = NULL; | |
| 5768 int rel_to_curdir; | |
| 5769 #ifdef AMIGA | |
| 5770 struct Process *proc = (struct Process *)FindTask(0L); | |
| 5771 APTR save_winptr = proc->pr_WindowPtr; | |
| 5772 | |
| 5773 /* Avoid a requester here for a volume that doesn't exist. */ | |
| 5774 proc->pr_WindowPtr = (APTR)-1L; | |
| 5775 #endif | |
| 5776 | |
| 5777 if (first == TRUE) | |
| 5778 { | |
| 5779 /* copy file name into NameBuff, expanding environment variables */ | |
| 5780 save_char = ptr[len]; | |
| 5781 ptr[len] = NUL; | |
| 5782 expand_env(ptr, NameBuff, MAXPATHL); | |
| 5783 ptr[len] = save_char; | |
| 5784 | |
| 359 | 5785 vim_free(ff_file_to_find); |
| 5786 ff_file_to_find = vim_strsave(NameBuff); | |
| 5787 if (ff_file_to_find == NULL) /* out of memory */ | |
| 7 | 5788 { |
| 5789 file_name = NULL; | |
| 5790 goto theend; | |
| 5791 } | |
| 5792 } | |
| 5793 | |
| 359 | 5794 rel_to_curdir = (ff_file_to_find[0] == '.' |
| 5795 && (ff_file_to_find[1] == NUL | |
| 5796 || vim_ispathsep(ff_file_to_find[1]) | |
| 5797 || (ff_file_to_find[1] == '.' | |
| 5798 && (ff_file_to_find[2] == NUL | |
| 5799 || vim_ispathsep(ff_file_to_find[2]))))); | |
| 5800 if (vim_isAbsName(ff_file_to_find) | |
| 7 | 5801 /* "..", "../path", "." and "./path": don't use the path_option */ |
| 5802 || rel_to_curdir | |
| 5803 #if defined(MSWIN) || defined(MSDOS) || defined(OS2) | |
| 5804 /* handle "\tmp" as absolute path */ | |
| 359 | 5805 || vim_ispathsep(ff_file_to_find[0]) |
| 1993 | 5806 /* handle "c:name" as absolute path */ |
| 359 | 5807 || (ff_file_to_find[0] != NUL && ff_file_to_find[1] == ':') |
| 7 | 5808 #endif |
| 5809 #ifdef AMIGA | |
| 5810 /* handle ":tmp" as absolute path */ | |
| 359 | 5811 || ff_file_to_find[0] == ':' |
| 7 | 5812 #endif |
| 5813 ) | |
| 5814 { | |
| 5815 /* | |
| 5816 * Absolute path, no need to use "path_option". | |
| 5817 * If this is not a first call, return NULL. We already returned a | |
| 5818 * filename on the first call. | |
| 5819 */ | |
| 5820 if (first == TRUE) | |
| 5821 { | |
| 5822 int l; | |
| 5823 int run; | |
| 5824 | |
| 359 | 5825 if (path_with_url(ff_file_to_find)) |
| 7 | 5826 { |
| 359 | 5827 file_name = vim_strsave(ff_file_to_find); |
| 7 | 5828 goto theend; |
| 5829 } | |
| 5830 | |
| 5831 /* When FNAME_REL flag given first use the directory of the file. | |
| 5832 * Otherwise or when this fails use the current directory. */ | |
| 5833 for (run = 1; run <= 2; ++run) | |
| 5834 { | |
| 359 | 5835 l = (int)STRLEN(ff_file_to_find); |
| 7 | 5836 if (run == 1 |
| 5837 && rel_to_curdir | |
| 5838 && (options & FNAME_REL) | |
| 5839 && rel_fname != NULL | |
| 5840 && STRLEN(rel_fname) + l < MAXPATHL) | |
| 5841 { | |
| 5842 STRCPY(NameBuff, rel_fname); | |
| 359 | 5843 STRCPY(gettail(NameBuff), ff_file_to_find); |
| 7 | 5844 l = (int)STRLEN(NameBuff); |
| 5845 } | |
| 5846 else | |
| 5847 { | |
| 359 | 5848 STRCPY(NameBuff, ff_file_to_find); |
| 7 | 5849 run = 2; |
| 5850 } | |
| 5851 | |
| 5852 /* When the file doesn't exist, try adding parts of | |
| 5853 * 'suffixesadd'. */ | |
| 794 | 5854 buf = suffixes; |
| 7 | 5855 for (;;) |
| 5856 { | |
| 5857 if ( | |
| 5858 #ifdef DJGPP | |
| 5859 /* "C:" by itself will fail for mch_getperm(), | |
| 5860 * assume it's always valid. */ | |
| 1541 | 5861 (find_what != FINDFILE_FILE && NameBuff[0] != NUL |
| 7 | 5862 && NameBuff[1] == ':' |
| 5863 && NameBuff[2] == NUL) || | |
| 5864 #endif | |
| 5865 (mch_getperm(NameBuff) >= 0 | |
| 1541 | 5866 && (find_what == FINDFILE_BOTH |
| 5867 || ((find_what == FINDFILE_DIR) | |
| 5868 == mch_isdir(NameBuff))))) | |
| 7 | 5869 { |
| 5870 file_name = vim_strsave(NameBuff); | |
| 5871 goto theend; | |
| 5872 } | |
| 5873 if (*buf == NUL) | |
| 5874 break; | |
| 5875 copy_option_part(&buf, NameBuff + l, MAXPATHL - l, ","); | |
| 5876 } | |
| 5877 } | |
| 5878 } | |
| 5879 } | |
| 5880 else | |
| 5881 { | |
| 5882 /* | |
| 5883 * Loop over all paths in the 'path' or 'cdpath' option. | |
| 5884 * When "first" is set, first setup to the start of the option. | |
| 5885 * Otherwise continue to find the next match. | |
| 5886 */ | |
| 5887 if (first == TRUE) | |
| 5888 { | |
| 5889 /* vim_findfile_free_visited can handle a possible NULL pointer */ | |
| 359 | 5890 vim_findfile_free_visited(fdip_search_ctx); |
| 7 | 5891 dir = path_option; |
| 5892 did_findfile_init = FALSE; | |
| 5893 } | |
| 5894 | |
| 5895 for (;;) | |
| 5896 { | |
| 5897 if (did_findfile_init) | |
| 5898 { | |
| 359 | 5899 file_name = vim_findfile(fdip_search_ctx); |
| 7 | 5900 if (file_name != NULL) |
| 5901 break; | |
| 5902 | |
| 5903 did_findfile_init = FALSE; | |
| 5904 } | |
| 5905 else | |
| 5906 { | |
| 5907 char_u *r_ptr; | |
| 5908 | |
| 5909 if (dir == NULL || *dir == NUL) | |
| 5910 { | |
| 5911 /* We searched all paths of the option, now we can | |
| 5912 * free the search context. */ | |
| 359 | 5913 vim_findfile_cleanup(fdip_search_ctx); |
| 5914 fdip_search_ctx = NULL; | |
| 7 | 5915 break; |
| 5916 } | |
| 5917 | |
| 5918 if ((buf = alloc((int)(MAXPATHL))) == NULL) | |
| 5919 break; | |
| 5920 | |
| 5921 /* copy next path */ | |
| 5922 buf[0] = 0; | |
| 5923 copy_option_part(&dir, buf, MAXPATHL, " ,"); | |
| 5924 | |
| 5925 #ifdef FEAT_PATH_EXTRA | |
| 5926 /* get the stopdir string */ | |
| 5927 r_ptr = vim_findfile_stopdir(buf); | |
| 5928 #else | |
| 5929 r_ptr = NULL; | |
| 5930 #endif | |
| 359 | 5931 fdip_search_ctx = vim_findfile_init(buf, ff_file_to_find, |
| 1541 | 5932 r_ptr, 100, FALSE, find_what, |
| 359 | 5933 fdip_search_ctx, FALSE, rel_fname); |
| 5934 if (fdip_search_ctx != NULL) | |
| 7 | 5935 did_findfile_init = TRUE; |
| 5936 vim_free(buf); | |
| 5937 } | |
| 5938 } | |
| 5939 } | |
| 5940 if (file_name == NULL && (options & FNAME_MESS)) | |
| 5941 { | |
| 5942 if (first == TRUE) | |
| 5943 { | |
| 1541 | 5944 if (find_what == FINDFILE_DIR) |
| 7 | 5945 EMSG2(_("E344: Can't find directory \"%s\" in cdpath"), |
| 359 | 5946 ff_file_to_find); |
| 7 | 5947 else |
| 5948 EMSG2(_("E345: Can't find file \"%s\" in path"), | |
| 359 | 5949 ff_file_to_find); |
| 7 | 5950 } |
| 5951 else | |
| 5952 { | |
| 1541 | 5953 if (find_what == FINDFILE_DIR) |
| 7 | 5954 EMSG2(_("E346: No more directory \"%s\" found in cdpath"), |
| 359 | 5955 ff_file_to_find); |
| 7 | 5956 else |
| 5957 EMSG2(_("E347: No more file \"%s\" found in path"), | |
| 359 | 5958 ff_file_to_find); |
| 7 | 5959 } |
| 5960 } | |
| 5961 | |
| 5962 theend: | |
| 5963 #ifdef AMIGA | |
| 5964 proc->pr_WindowPtr = save_winptr; | |
| 5965 #endif | |
| 5966 return file_name; | |
| 5967 } | |
| 5968 | |
| 5969 #endif /* FEAT_SEARCHPATH */ | |
| 5970 | |
| 5971 /* | |
| 5972 * Change directory to "new_dir". If FEAT_SEARCHPATH is defined, search | |
| 5973 * 'cdpath' for relative directory names, otherwise just mch_chdir(). | |
| 5974 */ | |
| 5975 int | |
| 5976 vim_chdir(new_dir) | |
| 5977 char_u *new_dir; | |
| 5978 { | |
| 5979 #ifndef FEAT_SEARCHPATH | |
| 5980 return mch_chdir((char *)new_dir); | |
| 5981 #else | |
| 5982 char_u *dir_name; | |
| 5983 int r; | |
| 5984 | |
| 5985 dir_name = find_directory_in_path(new_dir, (int)STRLEN(new_dir), | |
| 5986 FNAME_MESS, curbuf->b_ffname); | |
| 5987 if (dir_name == NULL) | |
| 5988 return -1; | |
| 5989 r = mch_chdir((char *)dir_name); | |
| 5990 vim_free(dir_name); | |
| 5991 return r; | |
| 5992 #endif | |
| 5993 } | |
| 5994 | |
| 5995 /* | |
| 418 | 5996 * Get user name from machine-specific function. |
| 7 | 5997 * Returns the user name in "buf[len]". |
| 418 | 5998 * Some systems are quite slow in obtaining the user name (Windows NT), thus |
| 5999 * cache the result. | |
| 7 | 6000 * Returns OK or FAIL. |
| 6001 */ | |
| 6002 int | |
| 6003 get_user_name(buf, len) | |
| 6004 char_u *buf; | |
| 6005 int len; | |
| 6006 { | |
| 359 | 6007 if (username == NULL) |
| 7 | 6008 { |
| 6009 if (mch_get_user_name(buf, len) == FAIL) | |
| 6010 return FAIL; | |
| 359 | 6011 username = vim_strsave(buf); |
| 7 | 6012 } |
| 6013 else | |
| 418 | 6014 vim_strncpy(buf, username, len - 1); |
| 7 | 6015 return OK; |
| 6016 } | |
| 6017 | |
| 6018 #ifndef HAVE_QSORT | |
| 6019 /* | |
| 6020 * Our own qsort(), for systems that don't have it. | |
| 6021 * It's simple and slow. From the K&R C book. | |
| 6022 */ | |
| 6023 void | |
| 6024 qsort(base, elm_count, elm_size, cmp) | |
| 6025 void *base; | |
| 6026 size_t elm_count; | |
| 6027 size_t elm_size; | |
| 6028 int (*cmp) __ARGS((const void *, const void *)); | |
| 6029 { | |
| 6030 char_u *buf; | |
| 6031 char_u *p1; | |
| 6032 char_u *p2; | |
| 6033 int i, j; | |
| 6034 int gap; | |
| 6035 | |
| 6036 buf = alloc((unsigned)elm_size); | |
| 6037 if (buf == NULL) | |
| 6038 return; | |
| 6039 | |
| 6040 for (gap = elm_count / 2; gap > 0; gap /= 2) | |
| 6041 for (i = gap; i < elm_count; ++i) | |
| 6042 for (j = i - gap; j >= 0; j -= gap) | |
| 6043 { | |
| 6044 /* Compare the elements. */ | |
| 6045 p1 = (char_u *)base + j * elm_size; | |
| 6046 p2 = (char_u *)base + (j + gap) * elm_size; | |
| 6047 if ((*cmp)((void *)p1, (void *)p2) <= 0) | |
| 6048 break; | |
| 1993 | 6049 /* Exchange the elements. */ |
| 7 | 6050 mch_memmove(buf, p1, elm_size); |
| 6051 mch_memmove(p1, p2, elm_size); | |
| 6052 mch_memmove(p2, buf, elm_size); | |
| 6053 } | |
| 6054 | |
| 6055 vim_free(buf); | |
| 6056 } | |
| 6057 #endif | |
| 6058 | |
| 6059 /* | |
| 6060 * Sort an array of strings. | |
| 6061 */ | |
| 6062 static int | |
| 6063 #ifdef __BORLANDC__ | |
| 6064 _RTLENTRYF | |
| 6065 #endif | |
| 6066 sort_compare __ARGS((const void *s1, const void *s2)); | |
| 6067 | |
| 6068 static int | |
| 6069 #ifdef __BORLANDC__ | |
| 6070 _RTLENTRYF | |
| 6071 #endif | |
| 6072 sort_compare(s1, s2) | |
| 6073 const void *s1; | |
| 6074 const void *s2; | |
| 6075 { | |
| 6076 return STRCMP(*(char **)s1, *(char **)s2); | |
| 6077 } | |
| 6078 | |
| 6079 void | |
| 6080 sort_strings(files, count) | |
| 6081 char_u **files; | |
| 6082 int count; | |
| 6083 { | |
| 6084 qsort((void *)files, (size_t)count, sizeof(char_u *), sort_compare); | |
| 6085 } | |
| 6086 | |
| 6087 #if !defined(NO_EXPANDPATH) || defined(PROTO) | |
| 6088 /* | |
| 6089 * Compare path "p[]" to "q[]". | |
| 39 | 6090 * If "maxlen" >= 0 compare "p[maxlen]" to "q[maxlen]" |
| 7 | 6091 * Return value like strcmp(p, q), but consider path separators. |
| 6092 */ | |
| 6093 int | |
| 39 | 6094 pathcmp(p, q, maxlen) |
| 7 | 6095 const char *p, *q; |
| 39 | 6096 int maxlen; |
| 7 | 6097 { |
| 6098 int i; | |
| 41 | 6099 const char *s = NULL; |
| 7 | 6100 |
| 39 | 6101 for (i = 0; maxlen < 0 || i < maxlen; ++i) |
| 7 | 6102 { |
| 6103 /* End of "p": check if "q" also ends or just has a slash. */ | |
| 6104 if (p[i] == NUL) | |
| 6105 { | |
| 6106 if (q[i] == NUL) /* full match */ | |
| 6107 return 0; | |
| 6108 s = q; | |
| 6109 break; | |
| 6110 } | |
| 6111 | |
| 6112 /* End of "q": check if "p" just has a slash. */ | |
| 6113 if (q[i] == NUL) | |
| 6114 { | |
| 6115 s = p; | |
| 6116 break; | |
| 6117 } | |
| 6118 | |
| 6119 if ( | |
| 6120 #ifdef CASE_INSENSITIVE_FILENAME | |
| 6121 TOUPPER_LOC(p[i]) != TOUPPER_LOC(q[i]) | |
| 6122 #else | |
| 6123 p[i] != q[i] | |
| 6124 #endif | |
| 6125 #ifdef BACKSLASH_IN_FILENAME | |
| 6126 /* consider '/' and '\\' to be equal */ | |
| 6127 && !((p[i] == '/' && q[i] == '\\') | |
| 6128 || (p[i] == '\\' && q[i] == '/')) | |
| 6129 #endif | |
| 6130 ) | |
| 6131 { | |
| 6132 if (vim_ispathsep(p[i])) | |
| 6133 return -1; | |
| 6134 if (vim_ispathsep(q[i])) | |
| 6135 return 1; | |
| 6136 return ((char_u *)p)[i] - ((char_u *)q)[i]; /* no match */ | |
| 6137 } | |
| 6138 } | |
| 41 | 6139 if (s == NULL) /* "i" ran into "maxlen" */ |
| 6140 return 0; | |
| 7 | 6141 |
| 6142 /* ignore a trailing slash, but not "//" or ":/" */ | |
| 41 | 6143 if (s[i + 1] == NUL |
| 6144 && i > 0 | |
| 6145 && !after_pathsep((char_u *)s, (char_u *)s + i) | |
| 7 | 6146 #ifdef BACKSLASH_IN_FILENAME |
| 41 | 6147 && (s[i] == '/' || s[i] == '\\') |
| 7 | 6148 #else |
| 41 | 6149 && s[i] == '/' |
| 7 | 6150 #endif |
| 41 | 6151 ) |
| 7 | 6152 return 0; /* match with trailing slash */ |
| 6153 if (s == q) | |
| 6154 return -1; /* no match */ | |
| 6155 return 1; | |
| 6156 } | |
| 6157 #endif | |
| 6158 | |
| 6159 /* | |
| 6160 * The putenv() implementation below comes from the "screen" program. | |
| 6161 * Included with permission from Juergen Weigert. | |
| 6162 * See pty.c for the copyright notice. | |
| 6163 */ | |
| 6164 | |
| 6165 /* | |
| 6166 * putenv -- put value into environment | |
| 6167 * | |
| 6168 * Usage: i = putenv (string) | |
| 6169 * int i; | |
| 6170 * char *string; | |
| 6171 * | |
| 6172 * where string is of the form <name>=<value>. | |
| 6173 * Putenv returns 0 normally, -1 on error (not enough core for malloc). | |
| 6174 * | |
| 6175 * Putenv may need to add a new name into the environment, or to | |
| 6176 * associate a value longer than the current value with a particular | |
| 6177 * name. So, to make life simpler, putenv() copies your entire | |
| 6178 * environment into the heap (i.e. malloc()) from the stack | |
| 6179 * (i.e. where it resides when your process is initiated) the first | |
| 6180 * time you call it. | |
| 6181 * | |
| 6182 * (history removed, not very interesting. See the "screen" sources.) | |
| 6183 */ | |
| 6184 | |
| 6185 #if !defined(HAVE_SETENV) && !defined(HAVE_PUTENV) | |
| 6186 | |
| 6187 #define EXTRASIZE 5 /* increment to add to env. size */ | |
| 6188 | |
| 6189 static int envsize = -1; /* current size of environment */ | |
| 6190 #ifndef MACOS_CLASSIC | |
| 6191 extern | |
| 6192 #endif | |
| 6193 char **environ; /* the global which is your env. */ | |
| 6194 | |
| 6195 static int findenv __ARGS((char *name)); /* look for a name in the env. */ | |
| 6196 static int newenv __ARGS((void)); /* copy env. from stack to heap */ | |
| 6197 static int moreenv __ARGS((void)); /* incr. size of env. */ | |
| 6198 | |
| 6199 int | |
| 6200 putenv(string) | |
| 6201 const char *string; | |
| 6202 { | |
| 6203 int i; | |
| 6204 char *p; | |
| 6205 | |
| 6206 if (envsize < 0) | |
| 6207 { /* first time putenv called */ | |
| 6208 if (newenv() < 0) /* copy env. to heap */ | |
| 6209 return -1; | |
| 6210 } | |
| 6211 | |
| 6212 i = findenv((char *)string); /* look for name in environment */ | |
| 6213 | |
| 6214 if (i < 0) | |
| 6215 { /* name must be added */ | |
| 6216 for (i = 0; environ[i]; i++); | |
| 6217 if (i >= (envsize - 1)) | |
| 6218 { /* need new slot */ | |
| 6219 if (moreenv() < 0) | |
| 6220 return -1; | |
| 6221 } | |
| 6222 p = (char *)alloc((unsigned)(strlen(string) + 1)); | |
| 6223 if (p == NULL) /* not enough core */ | |
| 6224 return -1; | |
| 6225 environ[i + 1] = 0; /* new end of env. */ | |
| 6226 } | |
| 6227 else | |
| 6228 { /* name already in env. */ | |
| 6229 p = vim_realloc(environ[i], strlen(string) + 1); | |
| 6230 if (p == NULL) | |
| 6231 return -1; | |
| 6232 } | |
| 6233 sprintf(p, "%s", string); /* copy into env. */ | |
| 6234 environ[i] = p; | |
| 6235 | |
| 6236 return 0; | |
| 6237 } | |
| 6238 | |
| 6239 static int | |
| 6240 findenv(name) | |
| 6241 char *name; | |
| 6242 { | |
| 6243 char *namechar, *envchar; | |
| 6244 int i, found; | |
| 6245 | |
| 6246 found = 0; | |
| 6247 for (i = 0; environ[i] && !found; i++) | |
| 6248 { | |
| 6249 envchar = environ[i]; | |
| 6250 namechar = name; | |
| 6251 while (*namechar && *namechar != '=' && (*namechar == *envchar)) | |
| 6252 { | |
| 6253 namechar++; | |
| 6254 envchar++; | |
| 6255 } | |
| 6256 found = ((*namechar == '\0' || *namechar == '=') && *envchar == '='); | |
| 6257 } | |
| 6258 return found ? i - 1 : -1; | |
| 6259 } | |
| 6260 | |
| 6261 static int | |
| 6262 newenv() | |
| 6263 { | |
| 6264 char **env, *elem; | |
| 6265 int i, esize; | |
| 6266 | |
| 6267 #ifdef MACOS | |
| 6268 /* for Mac a new, empty environment is created */ | |
| 6269 i = 0; | |
| 6270 #else | |
| 6271 for (i = 0; environ[i]; i++) | |
| 6272 ; | |
| 6273 #endif | |
| 6274 esize = i + EXTRASIZE + 1; | |
| 6275 env = (char **)alloc((unsigned)(esize * sizeof (elem))); | |
| 6276 if (env == NULL) | |
| 6277 return -1; | |
| 6278 | |
| 6279 #ifndef MACOS | |
| 6280 for (i = 0; environ[i]; i++) | |
| 6281 { | |
| 6282 elem = (char *)alloc((unsigned)(strlen(environ[i]) + 1)); | |
| 6283 if (elem == NULL) | |
| 6284 return -1; | |
| 6285 env[i] = elem; | |
| 6286 strcpy(elem, environ[i]); | |
| 6287 } | |
| 6288 #endif | |
| 6289 | |
| 6290 env[i] = 0; | |
| 6291 environ = env; | |
| 6292 envsize = esize; | |
| 6293 return 0; | |
| 6294 } | |
| 6295 | |
| 6296 static int | |
| 6297 moreenv() | |
| 6298 { | |
| 6299 int esize; | |
| 6300 char **env; | |
| 6301 | |
| 6302 esize = envsize + EXTRASIZE; | |
| 6303 env = (char **)vim_realloc((char *)environ, esize * sizeof (*env)); | |
| 6304 if (env == 0) | |
| 6305 return -1; | |
| 6306 environ = env; | |
| 6307 envsize = esize; | |
| 6308 return 0; | |
| 6309 } | |
| 6310 | |
| 6311 # ifdef USE_VIMPTY_GETENV | |
| 6312 char_u * | |
| 6313 vimpty_getenv(string) | |
| 6314 const char_u *string; | |
| 6315 { | |
| 6316 int i; | |
| 6317 char_u *p; | |
| 6318 | |
| 6319 if (envsize < 0) | |
| 6320 return NULL; | |
| 6321 | |
| 6322 i = findenv((char *)string); | |
| 6323 | |
| 6324 if (i < 0) | |
| 6325 return NULL; | |
| 6326 | |
| 6327 p = vim_strchr((char_u *)environ[i], '='); | |
| 6328 return (p + 1); | |
| 6329 } | |
| 6330 # endif | |
| 6331 | |
| 6332 #endif /* !defined(HAVE_SETENV) && !defined(HAVE_PUTENV) */ | |
| 313 | 6333 |
| 741 | 6334 #if defined(FEAT_EVAL) || defined(FEAT_SPELL) || defined(PROTO) |
| 313 | 6335 /* |
| 6336 * Return 0 for not writable, 1 for writable file, 2 for a dir which we have | |
| 6337 * rights to write into. | |
| 6338 */ | |
| 6339 int | |
| 6340 filewritable(fname) | |
| 6341 char_u *fname; | |
| 6342 { | |
| 6343 int retval = 0; | |
| 6344 #if defined(UNIX) || defined(VMS) | |
| 6345 int perm = 0; | |
| 6346 #endif | |
| 6347 | |
| 6348 #if defined(UNIX) || defined(VMS) | |
| 6349 perm = mch_getperm(fname); | |
| 6350 #endif | |
| 6351 #ifndef MACOS_CLASSIC /* TODO: get either mch_writable or mch_access */ | |
| 6352 if ( | |
| 6353 # ifdef WIN3264 | |
| 6354 mch_writable(fname) && | |
| 6355 # else | |
| 6356 # if defined(UNIX) || defined(VMS) | |
| 6357 (perm & 0222) && | |
| 6358 # endif | |
| 6359 # endif | |
| 6360 mch_access((char *)fname, W_OK) == 0 | |
| 6361 ) | |
| 6362 #endif | |
| 6363 { | |
| 6364 ++retval; | |
| 6365 if (mch_isdir(fname)) | |
| 6366 ++retval; | |
| 6367 } | |
| 6368 return retval; | |
| 6369 } | |
| 6370 #endif | |
| 332 | 6371 |
| 6372 /* | |
| 6373 * Print an error message with one or two "%s" and one or two string arguments. | |
| 6374 * This is not in message.c to avoid a warning for prototypes. | |
| 6375 */ | |
| 6376 int | |
| 6377 emsg3(s, a1, a2) | |
| 6378 char_u *s, *a1, *a2; | |
| 6379 { | |
| 840 | 6380 if (emsg_not_now()) |
| 332 | 6381 return TRUE; /* no error messages at the moment */ |
| 1438 | 6382 #ifdef HAVE_STDARG_H |
| 6383 vim_snprintf((char *)IObuff, IOSIZE, (char *)s, a1, a2); | |
| 6384 #else | |
| 840 | 6385 vim_snprintf((char *)IObuff, IOSIZE, (char *)s, (long_u)a1, (long_u)a2); |
| 1438 | 6386 #endif |
| 332 | 6387 return emsg(IObuff); |
| 6388 } | |
| 6389 | |
| 6390 /* | |
| 6391 * Print an error message with one "%ld" and one long int argument. | |
| 6392 * This is not in message.c to avoid a warning for prototypes. | |
| 6393 */ | |
| 6394 int | |
| 6395 emsgn(s, n) | |
| 6396 char_u *s; | |
| 6397 long n; | |
| 6398 { | |
| 840 | 6399 if (emsg_not_now()) |
| 332 | 6400 return TRUE; /* no error messages at the moment */ |
| 6401 vim_snprintf((char *)IObuff, IOSIZE, (char *)s, n); | |
| 6402 return emsg(IObuff); | |
| 6403 } | |
|
2229
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6404 |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6405 #if defined(FEAT_SPELL) || defined(FEAT_PERSISTENT_UNDO) || defined(PROTO) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6406 /* |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6407 * Read 2 bytes from "fd" and turn them into an int, MSB first. |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6408 */ |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6409 int |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6410 get2c(fd) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6411 FILE *fd; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6412 { |
|
2231
aa6412cab544
Various improvements to undo file code to make it more robust.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6413 int n; |
|
2229
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6414 |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6415 n = getc(fd); |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6416 n = (n << 8) + getc(fd); |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6417 return n; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6418 } |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6419 |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6420 /* |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6421 * Read 3 bytes from "fd" and turn them into an int, MSB first. |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6422 */ |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6423 int |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6424 get3c(fd) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6425 FILE *fd; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6426 { |
|
2231
aa6412cab544
Various improvements to undo file code to make it more robust.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6427 int n; |
|
2229
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6428 |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6429 n = getc(fd); |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6430 n = (n << 8) + getc(fd); |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6431 n = (n << 8) + getc(fd); |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6432 return n; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6433 } |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6434 |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6435 /* |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6436 * Read 4 bytes from "fd" and turn them into an int, MSB first. |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6437 */ |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6438 int |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6439 get4c(fd) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6440 FILE *fd; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6441 { |
|
2231
aa6412cab544
Various improvements to undo file code to make it more robust.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6442 int n; |
|
2229
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6443 |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6444 n = getc(fd); |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6445 n = (n << 8) + getc(fd); |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6446 n = (n << 8) + getc(fd); |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6447 n = (n << 8) + getc(fd); |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6448 return n; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6449 } |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6450 |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6451 /* |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6452 * Read 8 bytes from "fd" and turn them into a time_t, MSB first. |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6453 */ |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6454 time_t |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6455 get8ctime(fd) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6456 FILE *fd; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6457 { |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6458 time_t n = 0; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6459 int i; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6460 |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6461 for (i = 0; i < 8; ++i) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6462 n = (n << 8) + getc(fd); |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6463 return n; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6464 } |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6465 |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6466 /* |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6467 * Read a string of length "cnt" from "fd" into allocated memory. |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6468 * Returns NULL when out of memory or unable to read that many bytes. |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6469 */ |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6470 char_u * |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6471 read_string(fd, cnt) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6472 FILE *fd; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6473 int cnt; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6474 { |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6475 char_u *str; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6476 int i; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6477 int c; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6478 |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6479 /* allocate memory */ |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6480 str = alloc((unsigned)cnt + 1); |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6481 if (str != NULL) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6482 { |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6483 /* Read the string. Quit when running into the EOF. */ |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6484 for (i = 0; i < cnt; ++i) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6485 { |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6486 c = getc(fd); |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6487 if (c == EOF) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6488 { |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6489 vim_free(str); |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6490 return NULL; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6491 } |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6492 str[i] = c; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6493 } |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6494 str[i] = NUL; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6495 } |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6496 return str; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6497 } |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6498 |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6499 /* |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6500 * Write a number to file "fd", MSB first, in "len" bytes. |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6501 */ |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6502 int |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6503 put_bytes(fd, nr, len) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6504 FILE *fd; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6505 long_u nr; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6506 int len; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6507 { |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6508 int i; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6509 |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6510 for (i = len - 1; i >= 0; --i) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6511 if (putc((int)(nr >> (i * 8)), fd) == EOF) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6512 return FAIL; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6513 return OK; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6514 } |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6515 |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6516 #ifdef _MSC_VER |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6517 # if (_MSC_VER <= 1200) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6518 /* This line is required for VC6 without the service pack. Also see the |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6519 * matching #pragma below. */ |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6520 # pragma optimize("", off) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6521 # endif |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6522 #endif |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6523 |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6524 /* |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6525 * Write time_t to file "fd" in 8 bytes. |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6526 */ |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6527 void |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6528 put_time(fd, the_time) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6529 FILE *fd; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6530 time_t the_time; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6531 { |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6532 int c; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6533 int i; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6534 time_t wtime = the_time; |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6535 |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6536 /* time_t can be up to 8 bytes in size, more than long_u, thus we |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6537 * can't use put_bytes() here. |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6538 * Another problem is that ">>" may do an arithmetic shift that keeps the |
|
2232
2e6906bbc5f4
A few more fixes for undo file. Split test in two parts so that it doesn't
Bram Moolenaar <bram@vim.org>
parents:
2231
diff
changeset
|
6539 * sign. This happens for large values of wtime. A cast to long_u may |
|
2e6906bbc5f4
A few more fixes for undo file. Split test in two parts so that it doesn't
Bram Moolenaar <bram@vim.org>
parents:
2231
diff
changeset
|
6540 * truncate if time_t is 8 bytes. So only use a cast when it is 4 bytes, |
|
2e6906bbc5f4
A few more fixes for undo file. Split test in two parts so that it doesn't
Bram Moolenaar <bram@vim.org>
parents:
2231
diff
changeset
|
6541 * it's safe to assume that long_u is 4 bytes or more and when using 8 |
|
2e6906bbc5f4
A few more fixes for undo file. Split test in two parts so that it doesn't
Bram Moolenaar <bram@vim.org>
parents:
2231
diff
changeset
|
6542 * bytes the top bit won't be set. */ |
|
2229
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6543 for (i = 7; i >= 0; --i) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6544 { |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6545 if (i + 1 > (int)sizeof(time_t)) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6546 /* ">>" doesn't work well when shifting more bits than avail */ |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6547 putc(0, fd); |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6548 else |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6549 { |
|
2232
2e6906bbc5f4
A few more fixes for undo file. Split test in two parts so that it doesn't
Bram Moolenaar <bram@vim.org>
parents:
2231
diff
changeset
|
6550 #if defined(SIZEOF_TIME_T) && SIZEOF_TIME_T > 4 |
|
2245
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
6551 c = (int)(wtime >> (i * 8)); |
|
2232
2e6906bbc5f4
A few more fixes for undo file. Split test in two parts so that it doesn't
Bram Moolenaar <bram@vim.org>
parents:
2231
diff
changeset
|
6552 #else |
|
2245
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
6553 c = (int)((long_u)wtime >> (i * 8)); |
|
2232
2e6906bbc5f4
A few more fixes for undo file. Split test in two parts so that it doesn't
Bram Moolenaar <bram@vim.org>
parents:
2231
diff
changeset
|
6554 #endif |
|
2229
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6555 putc(c, fd); |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6556 } |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6557 } |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6558 } |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6559 |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6560 #ifdef _MSC_VER |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6561 # if (_MSC_VER <= 1200) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6562 # pragma optimize("", on) |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6563 # endif |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6564 #endif |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6565 |
|
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6566 #endif |
| 3257 | 6567 |
| 6568 #if (defined(FEAT_MBYTE) && defined(FEAT_QUICKFIX)) \ | |
| 6569 || defined(FEAT_SPELL) || defined(PROTO) | |
| 6570 /* | |
| 6571 * Return TRUE if string "s" contains a non-ASCII character (128 or higher). | |
| 6572 * When "s" is NULL FALSE is returned. | |
| 6573 */ | |
| 6574 int | |
| 6575 has_non_ascii(s) | |
| 6576 char_u *s; | |
| 6577 { | |
| 6578 char_u *p; | |
| 6579 | |
| 6580 if (s != NULL) | |
| 6581 for (p = s; *p != NUL; ++p) | |
| 6582 if (*p >= 128) | |
| 6583 return TRUE; | |
| 6584 return FALSE; | |
| 6585 } | |
| 6586 #endif |