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