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