Mercurial > vim
annotate src/misc2.c @ 5713:7f6acd6dc5b3
Added tag v7-4-201 for changeset 06e5f65c34d8
author | Bram Moolenaar <bram@vim.org> |
---|---|
date | Wed, 12 Mar 2014 18:55:58 +0100 |
parents | 40f18a1c1592 |
children | 50dbef5e774a |
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 { |
5564 | 490 (void)hasFoldingWin(wp, lnum, &lnum, NULL, TRUE, NULL); |
2178
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
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 { |
5564 | 502 (void)hasFoldingWin(wp, lnum, NULL, &lnum, TRUE, NULL); |
2178
c6f1aa1e9f32
Add 'relativenumber' patch from Markus Heidelberg.
Bram Moolenaar <bram@vim.org>
parents:
2027
diff
changeset
|
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 |
4805
66803af09906
updated for version 7.3.1149
Bram Moolenaar <bram@vim.org>
parents:
4352
diff
changeset
|
1137 vim_regfree(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>". | |
5690 | 1372 * When "do_newline" is FALSE do not escape newline unless it is csh shell. |
985 | 1373 * Returns the result in allocated memory, NULL if we have run out. |
1374 */ | |
1375 char_u * | |
5690 | 1376 vim_strsave_shellescape(string, do_special, do_newline) |
985 | 1377 char_u *string; |
1661 | 1378 int do_special; |
5690 | 1379 int do_newline; |
985 | 1380 { |
1381 unsigned length; | |
1382 char_u *p; | |
1383 char_u *d; | |
1384 char_u *escaped_string; | |
1661 | 1385 int l; |
1673 | 1386 int csh_like; |
1387 | |
1388 /* Only csh and similar shells expand '!' within single quotes. For sh and | |
1389 * the like we must not put a backslash before it, it will be taken | |
1390 * literally. If do_special is set the '!' will be escaped twice. | |
1391 * Csh also needs to have "\n" escaped twice when do_special is set. */ | |
1685 | 1392 csh_like = csh_like_shell(); |
985 | 1393 |
1394 /* First count the number of extra bytes required. */ | |
1072 | 1395 length = (unsigned)STRLEN(string) + 3; /* two quotes and a trailing NUL */ |
985 | 1396 for (p = string; *p != NUL; mb_ptr_adv(p)) |
1397 { | |
1398 # if defined(WIN32) || defined(WIN16) || defined(DOS) | |
1399 if (!p_ssl) | |
1400 { | |
1401 if (*p == '"') | |
1402 ++length; /* " -> "" */ | |
1403 } | |
1404 else | |
1405 # endif | |
1406 if (*p == '\'') | |
1407 length += 3; /* ' => '\'' */ | |
5690 | 1408 if ((*p == '\n' && (csh_like || do_newline)) |
1409 || (*p == '!' && (csh_like || do_special))) | |
1673 | 1410 { |
1411 ++length; /* insert backslash */ | |
1412 if (csh_like && do_special) | |
1413 ++length; /* insert backslash */ | |
1414 } | |
1661 | 1415 if (do_special && find_cmdline_var(p, &l) >= 0) |
1416 { | |
1417 ++length; /* insert backslash */ | |
1418 p += l - 1; | |
1419 } | |
985 | 1420 } |
1421 | |
1422 /* Allocate memory for the result and fill it. */ | |
1423 escaped_string = alloc(length); | |
1424 if (escaped_string != NULL) | |
1425 { | |
1426 d = escaped_string; | |
1427 | |
1428 /* add opening quote */ | |
1429 # if defined(WIN32) || defined(WIN16) || defined(DOS) | |
1430 if (!p_ssl) | |
1431 *d++ = '"'; | |
1432 else | |
1433 # endif | |
1434 *d++ = '\''; | |
1435 | |
1436 for (p = string; *p != NUL; ) | |
1437 { | |
1438 # if defined(WIN32) || defined(WIN16) || defined(DOS) | |
1439 if (!p_ssl) | |
1440 { | |
1441 if (*p == '"') | |
1442 { | |
1443 *d++ = '"'; | |
1444 *d++ = '"'; | |
1445 ++p; | |
1446 continue; | |
1447 } | |
1448 } | |
1449 else | |
1450 # endif | |
1451 if (*p == '\'') | |
1452 { | |
1661 | 1453 *d++ = '\''; |
1454 *d++ = '\\'; | |
1455 *d++ = '\''; | |
1456 *d++ = '\''; | |
985 | 1457 ++p; |
1458 continue; | |
1459 } | |
5690 | 1460 if ((*p == '\n' && (csh_like || do_newline)) |
1461 || (*p == '!' && (csh_like || do_special))) | |
1673 | 1462 { |
1463 *d++ = '\\'; | |
1464 if (csh_like && do_special) | |
1465 *d++ = '\\'; | |
1466 *d++ = *p++; | |
1467 continue; | |
1468 } | |
1661 | 1469 if (do_special && find_cmdline_var(p, &l) >= 0) |
1470 { | |
1471 *d++ = '\\'; /* insert backslash */ | |
1472 while (--l >= 0) /* copy the var */ | |
1473 *d++ = *p++; | |
2009 | 1474 continue; |
1661 | 1475 } |
985 | 1476 |
1477 MB_COPY_CHAR(p, d); | |
1478 } | |
1479 | |
1480 /* add terminating quote and finish with a NUL */ | |
1481 # if defined(WIN32) || defined(WIN16) || defined(DOS) | |
1482 if (!p_ssl) | |
1483 *d++ = '"'; | |
1484 else | |
1485 # endif | |
1486 *d++ = '\''; | |
1487 *d = NUL; | |
1488 } | |
1489 | |
1490 return escaped_string; | |
1491 } | |
1492 | |
7 | 1493 /* |
1494 * Like vim_strsave(), but make all characters uppercase. | |
1495 * This uses ASCII lower-to-upper case translation, language independent. | |
1496 */ | |
1497 char_u * | |
1498 vim_strsave_up(string) | |
1499 char_u *string; | |
1500 { | |
1501 char_u *p1; | |
1502 | |
1503 p1 = vim_strsave(string); | |
1504 vim_strup(p1); | |
1505 return p1; | |
1506 } | |
1507 | |
1508 /* | |
1509 * Like vim_strnsave(), but make all characters uppercase. | |
1510 * This uses ASCII lower-to-upper case translation, language independent. | |
1511 */ | |
1512 char_u * | |
1513 vim_strnsave_up(string, len) | |
1514 char_u *string; | |
1515 int len; | |
1516 { | |
1517 char_u *p1; | |
1518 | |
1519 p1 = vim_strnsave(string, len); | |
1520 vim_strup(p1); | |
1521 return p1; | |
1522 } | |
1523 | |
1524 /* | |
1525 * ASCII lower-to-upper case translation, language independent. | |
1526 */ | |
1527 void | |
1528 vim_strup(p) | |
1529 char_u *p; | |
1530 { | |
1531 char_u *p2; | |
1532 int c; | |
1533 | |
1534 if (p != NULL) | |
1535 { | |
1536 p2 = p; | |
1537 while ((c = *p2) != NUL) | |
1538 #ifdef EBCDIC | |
1539 *p2++ = isalpha(c) ? toupper(c) : c; | |
1540 #else | |
1541 *p2++ = (c < 'a' || c > 'z') ? c : (c - 0x20); | |
1542 #endif | |
1543 } | |
1544 } | |
1545 | |
741 | 1546 #if defined(FEAT_EVAL) || defined(FEAT_SPELL) || defined(PROTO) |
323 | 1547 /* |
1548 * Make string "s" all upper-case and return it in allocated memory. | |
1549 * Handles multi-byte characters as well as possible. | |
1550 * Returns NULL when out of memory. | |
1551 */ | |
1552 char_u * | |
1553 strup_save(orig) | |
1554 char_u *orig; | |
1555 { | |
1556 char_u *p; | |
1557 char_u *res; | |
1558 | |
1559 res = p = vim_strsave(orig); | |
1560 | |
1561 if (res != NULL) | |
1562 while (*p != NUL) | |
1563 { | |
1564 # ifdef FEAT_MBYTE | |
1565 int l; | |
1566 | |
1567 if (enc_utf8) | |
1568 { | |
1569 int c, uc; | |
3263 | 1570 int newl; |
323 | 1571 char_u *s; |
1572 | |
1573 c = utf_ptr2char(p); | |
1574 uc = utf_toupper(c); | |
1575 | |
1576 /* Reallocate string when byte count changes. This is rare, | |
1577 * thus it's OK to do another malloc()/free(). */ | |
474 | 1578 l = utf_ptr2len(p); |
3263 | 1579 newl = utf_char2len(uc); |
1580 if (newl != l) | |
323 | 1581 { |
3263 | 1582 s = alloc((unsigned)STRLEN(res) + 1 + newl - l); |
323 | 1583 if (s == NULL) |
1584 break; | |
1585 mch_memmove(s, res, p - res); | |
3263 | 1586 STRCPY(s + (p - res) + newl, p + l); |
323 | 1587 p = s + (p - res); |
1588 vim_free(res); | |
1589 res = s; | |
1590 } | |
1591 | |
1592 utf_char2bytes(uc, p); | |
3263 | 1593 p += newl; |
323 | 1594 } |
474 | 1595 else if (has_mbyte && (l = (*mb_ptr2len)(p)) > 1) |
323 | 1596 p += l; /* skip multi-byte character */ |
1597 else | |
1598 # endif | |
1599 { | |
1600 *p = TOUPPER_LOC(*p); /* note that toupper() can be a macro */ | |
1601 p++; | |
1602 } | |
1603 } | |
1604 | |
1605 return res; | |
1606 } | |
1607 #endif | |
1608 | |
7 | 1609 /* |
1610 * copy a space a number of times | |
1611 */ | |
1612 void | |
1613 copy_spaces(ptr, count) | |
1614 char_u *ptr; | |
1615 size_t count; | |
1616 { | |
1617 size_t i = count; | |
1618 char_u *p = ptr; | |
1619 | |
1620 while (i--) | |
1621 *p++ = ' '; | |
1622 } | |
1623 | |
1624 #if defined(FEAT_VISUALEXTRA) || defined(PROTO) | |
1625 /* | |
1626 * Copy a character a number of times. | |
1993 | 1627 * Does not work for multi-byte characters! |
7 | 1628 */ |
1629 void | |
1630 copy_chars(ptr, count, c) | |
1631 char_u *ptr; | |
1632 size_t count; | |
1633 int c; | |
1634 { | |
1635 size_t i = count; | |
1636 char_u *p = ptr; | |
1637 | |
1638 while (i--) | |
1639 *p++ = c; | |
1640 } | |
1641 #endif | |
1642 | |
1643 /* | |
1644 * delete spaces at the end of a string | |
1645 */ | |
1646 void | |
1647 del_trailing_spaces(ptr) | |
1648 char_u *ptr; | |
1649 { | |
1650 char_u *q; | |
1651 | |
1652 q = ptr + STRLEN(ptr); | |
1653 while (--q > ptr && vim_iswhite(q[0]) && q[-1] != '\\' && q[-1] != Ctrl_V) | |
1654 *q = NUL; | |
1655 } | |
1656 | |
1657 /* | |
323 | 1658 * Like strncpy(), but always terminate the result with one NUL. |
378 | 1659 * "to" must be "len + 1" long! |
7 | 1660 */ |
1661 void | |
1662 vim_strncpy(to, from, len) | |
323 | 1663 char_u *to; |
1664 char_u *from; | |
418 | 1665 size_t len; |
7 | 1666 { |
323 | 1667 STRNCPY(to, from, len); |
1668 to[len] = NUL; | |
7 | 1669 } |
1670 | |
1671 /* | |
2768 | 1672 * Like strcat(), but make sure the result fits in "tosize" bytes and is |
1673 * always NUL terminated. | |
1674 */ | |
1675 void | |
1676 vim_strcat(to, from, tosize) | |
1677 char_u *to; | |
1678 char_u *from; | |
1679 size_t tosize; | |
1680 { | |
1681 size_t tolen = STRLEN(to); | |
1682 size_t fromlen = STRLEN(from); | |
1683 | |
1684 if (tolen + fromlen + 1 > tosize) | |
1685 { | |
1686 mch_memmove(to + tolen, from, tosize - tolen - 1); | |
1687 to[tosize - 1] = NUL; | |
1688 } | |
1689 else | |
1690 STRCPY(to + tolen, from); | |
1691 } | |
1692 | |
1693 /* | |
7 | 1694 * Isolate one part of a string option where parts are separated with |
1695 * "sep_chars". | |
459 | 1696 * The part is copied into "buf[maxlen]". |
7 | 1697 * "*option" is advanced to the next part. |
1698 * The length is returned. | |
1699 */ | |
1700 int | |
1701 copy_option_part(option, buf, maxlen, sep_chars) | |
1702 char_u **option; | |
1703 char_u *buf; | |
1704 int maxlen; | |
1705 char *sep_chars; | |
1706 { | |
1707 int len = 0; | |
1708 char_u *p = *option; | |
1709 | |
1710 /* skip '.' at start of option part, for 'suffixes' */ | |
1711 if (*p == '.') | |
1712 buf[len++] = *p++; | |
1713 while (*p != NUL && vim_strchr((char_u *)sep_chars, *p) == NULL) | |
1714 { | |
1715 /* | |
1716 * Skip backslash before a separator character and space. | |
1717 */ | |
1718 if (p[0] == '\\' && vim_strchr((char_u *)sep_chars, p[1]) != NULL) | |
1719 ++p; | |
1720 if (len < maxlen - 1) | |
1721 buf[len++] = *p; | |
1722 ++p; | |
1723 } | |
1724 buf[len] = NUL; | |
1725 | |
1726 if (*p != NUL && *p != ',') /* skip non-standard separator */ | |
1727 ++p; | |
1728 p = skip_to_option_part(p); /* p points to next file name */ | |
1729 | |
1730 *option = p; | |
1731 return len; | |
1732 } | |
1733 | |
1734 /* | |
625 | 1735 * Replacement for free() that ignores NULL pointers. |
1736 * Also skip free() when exiting for sure, this helps when we caught a deadly | |
1737 * signal that was caused by a crash in free(). | |
7 | 1738 */ |
1739 void | |
1740 vim_free(x) | |
1741 void *x; | |
1742 { | |
625 | 1743 if (x != NULL && !really_exiting) |
7 | 1744 { |
1745 #ifdef MEM_PROFILE | |
1746 mem_pre_free(&x); | |
1747 #endif | |
1748 free(x); | |
1749 } | |
1750 } | |
1751 | |
1752 #ifndef HAVE_MEMSET | |
1753 void * | |
1754 vim_memset(ptr, c, size) | |
1755 void *ptr; | |
1756 int c; | |
1757 size_t size; | |
1758 { | |
1759 char *p = ptr; | |
1760 | |
1761 while (size-- > 0) | |
1762 *p++ = c; | |
1763 return ptr; | |
1764 } | |
1765 #endif | |
1766 | |
1767 #ifdef VIM_MEMCMP | |
1768 /* | |
1769 * Return zero when "b1" and "b2" are the same for "len" bytes. | |
1770 * Return non-zero otherwise. | |
1771 */ | |
1772 int | |
1773 vim_memcmp(b1, b2, len) | |
1774 void *b1; | |
1775 void *b2; | |
1776 size_t len; | |
1777 { | |
1778 char_u *p1 = (char_u *)b1, *p2 = (char_u *)b2; | |
1779 | |
1780 for ( ; len > 0; --len) | |
1781 { | |
1782 if (*p1 != *p2) | |
1783 return 1; | |
1784 ++p1; | |
1785 ++p2; | |
1786 } | |
1787 return 0; | |
1788 } | |
1789 #endif | |
1790 | |
1791 #ifdef VIM_MEMMOVE | |
1792 /* | |
1793 * Version of memmove() that handles overlapping source and destination. | |
1794 * For systems that don't have a function that is guaranteed to do that (SYSV). | |
1795 */ | |
1796 void | |
1797 mch_memmove(dst_arg, src_arg, len) | |
1798 void *src_arg, *dst_arg; | |
1799 size_t len; | |
1800 { | |
1801 /* | |
1802 * A void doesn't have a size, we use char pointers. | |
1803 */ | |
1804 char *dst = dst_arg, *src = src_arg; | |
1805 | |
1806 /* overlap, copy backwards */ | |
1807 if (dst > src && dst < src + len) | |
1808 { | |
1809 src += len; | |
1810 dst += len; | |
1811 while (len-- > 0) | |
1812 *--dst = *--src; | |
1813 } | |
1814 else /* copy forwards */ | |
1815 while (len-- > 0) | |
1816 *dst++ = *src++; | |
1817 } | |
1818 #endif | |
1819 | |
1820 #if (!defined(HAVE_STRCASECMP) && !defined(HAVE_STRICMP)) || defined(PROTO) | |
1821 /* | |
1822 * Compare two strings, ignoring case, using current locale. | |
1823 * Doesn't work for multi-byte characters. | |
1824 * return 0 for match, < 0 for smaller, > 0 for bigger | |
1825 */ | |
1826 int | |
1827 vim_stricmp(s1, s2) | |
1828 char *s1; | |
1829 char *s2; | |
1830 { | |
1831 int i; | |
1832 | |
1833 for (;;) | |
1834 { | |
1835 i = (int)TOLOWER_LOC(*s1) - (int)TOLOWER_LOC(*s2); | |
1836 if (i != 0) | |
1837 return i; /* this character different */ | |
1838 if (*s1 == NUL) | |
1839 break; /* strings match until NUL */ | |
1840 ++s1; | |
1841 ++s2; | |
1842 } | |
1843 return 0; /* strings match */ | |
1844 } | |
1845 #endif | |
1846 | |
1847 #if (!defined(HAVE_STRNCASECMP) && !defined(HAVE_STRNICMP)) || defined(PROTO) | |
1848 /* | |
1849 * Compare two strings, for length "len", ignoring case, using current locale. | |
1850 * Doesn't work for multi-byte characters. | |
1851 * return 0 for match, < 0 for smaller, > 0 for bigger | |
1852 */ | |
1853 int | |
1854 vim_strnicmp(s1, s2, len) | |
1855 char *s1; | |
1856 char *s2; | |
1857 size_t len; | |
1858 { | |
1859 int i; | |
1860 | |
1861 while (len > 0) | |
1862 { | |
1863 i = (int)TOLOWER_LOC(*s1) - (int)TOLOWER_LOC(*s2); | |
1864 if (i != 0) | |
1865 return i; /* this character different */ | |
1866 if (*s1 == NUL) | |
1867 break; /* strings match until NUL */ | |
1868 ++s1; | |
1869 ++s2; | |
1870 --len; | |
1871 } | |
1872 return 0; /* strings match */ | |
1873 } | |
1874 #endif | |
1875 | |
1876 /* | |
1877 * Version of strchr() and strrchr() that handle unsigned char strings | |
170 | 1878 * with characters from 128 to 255 correctly. It also doesn't return a |
1879 * pointer to the NUL at the end of the string. | |
7 | 1880 */ |
1881 char_u * | |
1882 vim_strchr(string, c) | |
1883 char_u *string; | |
1884 int c; | |
1885 { | |
1886 char_u *p; | |
1887 int b; | |
1888 | |
1889 p = string; | |
1890 #ifdef FEAT_MBYTE | |
1891 if (enc_utf8 && c >= 0x80) | |
1892 { | |
1893 while (*p != NUL) | |
1894 { | |
1895 if (utf_ptr2char(p) == c) | |
1896 return p; | |
474 | 1897 p += (*mb_ptr2len)(p); |
7 | 1898 } |
1899 return NULL; | |
1900 } | |
1901 if (enc_dbcs != 0 && c > 255) | |
1902 { | |
1903 int n2 = c & 0xff; | |
1904 | |
1905 c = ((unsigned)c >> 8) & 0xff; | |
1906 while ((b = *p) != NUL) | |
1907 { | |
1908 if (b == c && p[1] == n2) | |
1909 return p; | |
474 | 1910 p += (*mb_ptr2len)(p); |
7 | 1911 } |
1912 return NULL; | |
1913 } | |
1914 if (has_mbyte) | |
1915 { | |
1916 while ((b = *p) != NUL) | |
1917 { | |
1918 if (b == c) | |
1919 return p; | |
474 | 1920 p += (*mb_ptr2len)(p); |
7 | 1921 } |
1922 return NULL; | |
1923 } | |
1924 #endif | |
1925 while ((b = *p) != NUL) | |
1926 { | |
1927 if (b == c) | |
1928 return p; | |
1929 ++p; | |
1930 } | |
1931 return NULL; | |
1932 } | |
1933 | |
1934 /* | |
170 | 1935 * Version of strchr() that only works for bytes and handles unsigned char |
1936 * strings with characters above 128 correctly. It also doesn't return a | |
1937 * pointer to the NUL at the end of the string. | |
1938 */ | |
1939 char_u * | |
1940 vim_strbyte(string, c) | |
1941 char_u *string; | |
1942 int c; | |
1943 { | |
1944 char_u *p = string; | |
1945 | |
1946 while (*p != NUL) | |
1947 { | |
1948 if (*p == c) | |
1949 return p; | |
1950 ++p; | |
1951 } | |
1952 return NULL; | |
1953 } | |
1954 | |
1955 /* | |
7 | 1956 * Search for last occurrence of "c" in "string". |
500 | 1957 * Return NULL if not found. |
170 | 1958 * Does not handle multi-byte char for "c"! |
7 | 1959 */ |
1960 char_u * | |
1961 vim_strrchr(string, c) | |
1962 char_u *string; | |
1963 int c; | |
1964 { | |
1965 char_u *retval = NULL; | |
170 | 1966 char_u *p = string; |
1967 | |
1968 while (*p) | |
7 | 1969 { |
170 | 1970 if (*p == c) |
1971 retval = p; | |
1972 mb_ptr_adv(p); | |
7 | 1973 } |
1974 return retval; | |
1975 } | |
1976 | |
1977 /* | |
1978 * Vim's version of strpbrk(), in case it's missing. | |
1979 * Don't generate a prototype for this, causes problems when it's not used. | |
1980 */ | |
1981 #ifndef PROTO | |
1982 # ifndef HAVE_STRPBRK | |
1983 # ifdef vim_strpbrk | |
1984 # undef vim_strpbrk | |
1985 # endif | |
1986 char_u * | |
1987 vim_strpbrk(s, charset) | |
1988 char_u *s; | |
1989 char_u *charset; | |
1990 { | |
1991 while (*s) | |
1992 { | |
1993 if (vim_strchr(charset, *s) != NULL) | |
1994 return s; | |
39 | 1995 mb_ptr_adv(s); |
7 | 1996 } |
1997 return NULL; | |
1998 } | |
1999 # endif | |
2000 #endif | |
2001 | |
2002 /* | |
2003 * Vim has its own isspace() function, because on some machines isspace() | |
2004 * can't handle characters above 128. | |
2005 */ | |
2006 int | |
2007 vim_isspace(x) | |
2008 int x; | |
2009 { | |
2010 return ((x >= 9 && x <= 13) || x == ' '); | |
2011 } | |
2012 | |
2013 /************************************************************************ | |
119 | 2014 * Functions for handling growing arrays. |
7 | 2015 */ |
2016 | |
2017 /* | |
2018 * Clear an allocated growing array. | |
2019 */ | |
2020 void | |
2021 ga_clear(gap) | |
2022 garray_T *gap; | |
2023 { | |
2024 vim_free(gap->ga_data); | |
2025 ga_init(gap); | |
2026 } | |
2027 | |
2028 /* | |
2029 * Clear a growing array that contains a list of strings. | |
2030 */ | |
2031 void | |
2032 ga_clear_strings(gap) | |
2033 garray_T *gap; | |
2034 { | |
2035 int i; | |
2036 | |
2037 for (i = 0; i < gap->ga_len; ++i) | |
2038 vim_free(((char_u **)(gap->ga_data))[i]); | |
2039 ga_clear(gap); | |
2040 } | |
2041 | |
2042 /* | |
2043 * Initialize a growing array. Don't forget to set ga_itemsize and | |
2044 * ga_growsize! Or use ga_init2(). | |
2045 */ | |
2046 void | |
2047 ga_init(gap) | |
2048 garray_T *gap; | |
2049 { | |
2050 gap->ga_data = NULL; | |
41 | 2051 gap->ga_maxlen = 0; |
7 | 2052 gap->ga_len = 0; |
2053 } | |
2054 | |
2055 void | |
2056 ga_init2(gap, itemsize, growsize) | |
2057 garray_T *gap; | |
2058 int itemsize; | |
2059 int growsize; | |
2060 { | |
2061 ga_init(gap); | |
2062 gap->ga_itemsize = itemsize; | |
2063 gap->ga_growsize = growsize; | |
2064 } | |
2065 | |
2066 /* | |
2067 * Make room in growing array "gap" for at least "n" items. | |
2068 * Return FAIL for failure, OK otherwise. | |
2069 */ | |
2070 int | |
2071 ga_grow(gap, n) | |
2072 garray_T *gap; | |
2073 int n; | |
2074 { | |
3376 | 2075 size_t old_len; |
2076 size_t new_len; | |
7 | 2077 char_u *pp; |
2078 | |
41 | 2079 if (gap->ga_maxlen - gap->ga_len < n) |
7 | 2080 { |
2081 if (n < gap->ga_growsize) | |
2082 n = gap->ga_growsize; | |
3376 | 2083 new_len = gap->ga_itemsize * (gap->ga_len + n); |
2084 pp = (gap->ga_data == NULL) | |
3386 | 2085 ? alloc((unsigned)new_len) : vim_realloc(gap->ga_data, new_len); |
7 | 2086 if (pp == NULL) |
2087 return FAIL; | |
3376 | 2088 old_len = gap->ga_itemsize * gap->ga_maxlen; |
2089 vim_memset(pp + old_len, 0, new_len - old_len); | |
41 | 2090 gap->ga_maxlen = gap->ga_len + n; |
7 | 2091 gap->ga_data = pp; |
2092 } | |
2093 return OK; | |
2094 } | |
2095 | |
2096 /* | |
2487
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2097 * 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
|
2098 * 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
|
2099 * 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
|
2100 */ |
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2101 char_u * |
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2102 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
|
2103 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
|
2104 { |
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2105 int i; |
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2106 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
|
2107 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
|
2108 |
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2109 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
|
2110 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
|
2111 |
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2112 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
|
2113 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
|
2114 { |
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2115 *s = NUL; |
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2116 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
|
2117 { |
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2118 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
|
2119 STRCAT(s, ","); |
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2120 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
|
2121 } |
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2122 } |
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2123 return s; |
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2124 } |
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2125 |
7ec9ada2cd81
Make :find completion consistent between Unix and MS-Windows. Add a test.
Bram Moolenaar <bram@vim.org>
parents:
2445
diff
changeset
|
2126 /* |
7 | 2127 * Concatenate a string to a growarray which contains characters. |
2128 * Note: Does NOT copy the NUL at the end! | |
2129 */ | |
2130 void | |
2131 ga_concat(gap, s) | |
2132 garray_T *gap; | |
2133 char_u *s; | |
2134 { | |
2135 int len = (int)STRLEN(s); | |
2136 | |
2137 if (ga_grow(gap, len) == OK) | |
2138 { | |
2139 mch_memmove((char *)gap->ga_data + gap->ga_len, s, (size_t)len); | |
2140 gap->ga_len += len; | |
2141 } | |
2142 } | |
2143 | |
2144 /* | |
2145 * Append one byte to a growarray which contains bytes. | |
2146 */ | |
2147 void | |
2148 ga_append(gap, c) | |
2149 garray_T *gap; | |
2150 int c; | |
2151 { | |
2152 if (ga_grow(gap, 1) == OK) | |
2153 { | |
2154 *((char *)gap->ga_data + gap->ga_len) = c; | |
2155 ++gap->ga_len; | |
2156 } | |
2157 } | |
2158 | |
2935 | 2159 #if (defined(UNIX) && !defined(USE_SYSTEM)) || defined(WIN3264) |
2160 /* | |
2161 * Append the text in "gap" below the cursor line and clear "gap". | |
2162 */ | |
2163 void | |
2164 append_ga_line(gap) | |
2165 garray_T *gap; | |
2166 { | |
2167 /* Remove trailing CR. */ | |
2168 if (gap->ga_len > 0 | |
2169 && !curbuf->b_p_bin | |
2170 && ((char_u *)gap->ga_data)[gap->ga_len - 1] == CAR) | |
2171 --gap->ga_len; | |
2172 ga_append(gap, NUL); | |
2173 ml_append(curwin->w_cursor.lnum++, gap->ga_data, 0, FALSE); | |
2174 gap->ga_len = 0; | |
2175 } | |
2176 #endif | |
2177 | |
7 | 2178 /************************************************************************ |
2179 * functions that use lookup tables for various things, generally to do with | |
2180 * special key codes. | |
2181 */ | |
2182 | |
2183 /* | |
2184 * Some useful tables. | |
2185 */ | |
2186 | |
2187 static struct modmasktable | |
2188 { | |
2189 short mod_mask; /* Bit-mask for particular key modifier */ | |
2190 short mod_flag; /* Bit(s) for particular key modifier */ | |
2191 char_u name; /* Single letter name of modifier */ | |
2192 } mod_mask_table[] = | |
2193 { | |
2194 {MOD_MASK_ALT, MOD_MASK_ALT, (char_u)'M'}, | |
179 | 2195 {MOD_MASK_META, MOD_MASK_META, (char_u)'T'}, |
7 | 2196 {MOD_MASK_CTRL, MOD_MASK_CTRL, (char_u)'C'}, |
2197 {MOD_MASK_SHIFT, MOD_MASK_SHIFT, (char_u)'S'}, | |
2198 {MOD_MASK_MULTI_CLICK, MOD_MASK_2CLICK, (char_u)'2'}, | |
2199 {MOD_MASK_MULTI_CLICK, MOD_MASK_3CLICK, (char_u)'3'}, | |
2200 {MOD_MASK_MULTI_CLICK, MOD_MASK_4CLICK, (char_u)'4'}, | |
2201 #ifdef MACOS | |
2202 {MOD_MASK_CMD, MOD_MASK_CMD, (char_u)'D'}, | |
2203 #endif | |
2204 /* 'A' must be the last one */ | |
2205 {MOD_MASK_ALT, MOD_MASK_ALT, (char_u)'A'}, | |
2206 {0, 0, NUL} | |
2207 }; | |
2208 | |
2209 /* | |
2210 * Shifted key terminal codes and their unshifted equivalent. | |
1209 | 2211 * Don't add mouse codes here, they are handled separately! |
7 | 2212 */ |
2213 #define MOD_KEYS_ENTRY_SIZE 5 | |
2214 | |
2215 static char_u modifier_keys_table[] = | |
2216 { | |
2217 /* mod mask with modifier without modifier */ | |
2218 MOD_MASK_SHIFT, '&', '9', '@', '1', /* begin */ | |
2219 MOD_MASK_SHIFT, '&', '0', '@', '2', /* cancel */ | |
2220 MOD_MASK_SHIFT, '*', '1', '@', '4', /* command */ | |
2221 MOD_MASK_SHIFT, '*', '2', '@', '5', /* copy */ | |
2222 MOD_MASK_SHIFT, '*', '3', '@', '6', /* create */ | |
2223 MOD_MASK_SHIFT, '*', '4', 'k', 'D', /* delete char */ | |
2224 MOD_MASK_SHIFT, '*', '5', 'k', 'L', /* delete line */ | |
2225 MOD_MASK_SHIFT, '*', '7', '@', '7', /* end */ | |
2226 MOD_MASK_CTRL, KS_EXTRA, (int)KE_C_END, '@', '7', /* end */ | |
2227 MOD_MASK_SHIFT, '*', '9', '@', '9', /* exit */ | |
2228 MOD_MASK_SHIFT, '*', '0', '@', '0', /* find */ | |
2229 MOD_MASK_SHIFT, '#', '1', '%', '1', /* help */ | |
2230 MOD_MASK_SHIFT, '#', '2', 'k', 'h', /* home */ | |
2231 MOD_MASK_CTRL, KS_EXTRA, (int)KE_C_HOME, 'k', 'h', /* home */ | |
2232 MOD_MASK_SHIFT, '#', '3', 'k', 'I', /* insert */ | |
2233 MOD_MASK_SHIFT, '#', '4', 'k', 'l', /* left arrow */ | |
2234 MOD_MASK_CTRL, KS_EXTRA, (int)KE_C_LEFT, 'k', 'l', /* left arrow */ | |
2235 MOD_MASK_SHIFT, '%', 'a', '%', '3', /* message */ | |
2236 MOD_MASK_SHIFT, '%', 'b', '%', '4', /* move */ | |
2237 MOD_MASK_SHIFT, '%', 'c', '%', '5', /* next */ | |
2238 MOD_MASK_SHIFT, '%', 'd', '%', '7', /* options */ | |
2239 MOD_MASK_SHIFT, '%', 'e', '%', '8', /* previous */ | |
2240 MOD_MASK_SHIFT, '%', 'f', '%', '9', /* print */ | |
2241 MOD_MASK_SHIFT, '%', 'g', '%', '0', /* redo */ | |
2242 MOD_MASK_SHIFT, '%', 'h', '&', '3', /* replace */ | |
2243 MOD_MASK_SHIFT, '%', 'i', 'k', 'r', /* right arr. */ | |
2244 MOD_MASK_CTRL, KS_EXTRA, (int)KE_C_RIGHT, 'k', 'r', /* right arr. */ | |
2245 MOD_MASK_SHIFT, '%', 'j', '&', '5', /* resume */ | |
2246 MOD_MASK_SHIFT, '!', '1', '&', '6', /* save */ | |
2247 MOD_MASK_SHIFT, '!', '2', '&', '7', /* suspend */ | |
2248 MOD_MASK_SHIFT, '!', '3', '&', '8', /* undo */ | |
2249 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_UP, 'k', 'u', /* up arrow */ | |
2250 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_DOWN, 'k', 'd', /* down arrow */ | |
2251 | |
2252 /* vt100 F1 */ | |
2253 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_XF1, KS_EXTRA, (int)KE_XF1, | |
2254 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_XF2, KS_EXTRA, (int)KE_XF2, | |
2255 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_XF3, KS_EXTRA, (int)KE_XF3, | |
2256 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_XF4, KS_EXTRA, (int)KE_XF4, | |
2257 | |
2258 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F1, 'k', '1', /* F1 */ | |
2259 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F2, 'k', '2', | |
2260 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F3, 'k', '3', | |
2261 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F4, 'k', '4', | |
2262 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F5, 'k', '5', | |
2263 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F6, 'k', '6', | |
2264 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F7, 'k', '7', | |
2265 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F8, 'k', '8', | |
2266 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F9, 'k', '9', | |
2267 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F10, 'k', ';', /* F10 */ | |
2268 | |
2269 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F11, 'F', '1', | |
2270 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F12, 'F', '2', | |
2271 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F13, 'F', '3', | |
2272 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F14, 'F', '4', | |
2273 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F15, 'F', '5', | |
2274 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F16, 'F', '6', | |
2275 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F17, 'F', '7', | |
2276 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F18, 'F', '8', | |
2277 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F19, 'F', '9', | |
2278 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F20, 'F', 'A', | |
2279 | |
2280 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F21, 'F', 'B', | |
2281 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F22, 'F', 'C', | |
2282 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F23, 'F', 'D', | |
2283 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F24, 'F', 'E', | |
2284 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F25, 'F', 'F', | |
2285 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F26, 'F', 'G', | |
2286 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F27, 'F', 'H', | |
2287 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F28, 'F', 'I', | |
2288 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F29, 'F', 'J', | |
2289 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F30, 'F', 'K', | |
2290 | |
2291 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F31, 'F', 'L', | |
2292 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F32, 'F', 'M', | |
2293 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F33, 'F', 'N', | |
2294 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F34, 'F', 'O', | |
2295 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F35, 'F', 'P', | |
2296 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F36, 'F', 'Q', | |
2297 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F37, 'F', 'R', | |
2298 | |
2299 /* TAB pseudo code*/ | |
2300 MOD_MASK_SHIFT, 'k', 'B', KS_EXTRA, (int)KE_TAB, | |
2301 | |
2302 NUL | |
2303 }; | |
2304 | |
2305 static struct key_name_entry | |
2306 { | |
2307 int key; /* Special key code or ascii value */ | |
2308 char_u *name; /* Name of key */ | |
2309 } key_names_table[] = | |
2310 { | |
2311 {' ', (char_u *)"Space"}, | |
2312 {TAB, (char_u *)"Tab"}, | |
2313 {K_TAB, (char_u *)"Tab"}, | |
2314 {NL, (char_u *)"NL"}, | |
2315 {NL, (char_u *)"NewLine"}, /* Alternative name */ | |
2316 {NL, (char_u *)"LineFeed"}, /* Alternative name */ | |
2317 {NL, (char_u *)"LF"}, /* Alternative name */ | |
2318 {CAR, (char_u *)"CR"}, | |
2319 {CAR, (char_u *)"Return"}, /* Alternative name */ | |
2320 {CAR, (char_u *)"Enter"}, /* Alternative name */ | |
2321 {K_BS, (char_u *)"BS"}, | |
2322 {K_BS, (char_u *)"BackSpace"}, /* Alternative name */ | |
2323 {ESC, (char_u *)"Esc"}, | |
2324 {CSI, (char_u *)"CSI"}, | |
2325 {K_CSI, (char_u *)"xCSI"}, | |
2326 {'|', (char_u *)"Bar"}, | |
2327 {'\\', (char_u *)"Bslash"}, | |
2328 {K_DEL, (char_u *)"Del"}, | |
2329 {K_DEL, (char_u *)"Delete"}, /* Alternative name */ | |
2330 {K_KDEL, (char_u *)"kDel"}, | |
2331 {K_UP, (char_u *)"Up"}, | |
2332 {K_DOWN, (char_u *)"Down"}, | |
2333 {K_LEFT, (char_u *)"Left"}, | |
2334 {K_RIGHT, (char_u *)"Right"}, | |
180 | 2335 {K_XUP, (char_u *)"xUp"}, |
2336 {K_XDOWN, (char_u *)"xDown"}, | |
2337 {K_XLEFT, (char_u *)"xLeft"}, | |
2338 {K_XRIGHT, (char_u *)"xRight"}, | |
7 | 2339 |
2340 {K_F1, (char_u *)"F1"}, | |
2341 {K_F2, (char_u *)"F2"}, | |
2342 {K_F3, (char_u *)"F3"}, | |
2343 {K_F4, (char_u *)"F4"}, | |
2344 {K_F5, (char_u *)"F5"}, | |
2345 {K_F6, (char_u *)"F6"}, | |
2346 {K_F7, (char_u *)"F7"}, | |
2347 {K_F8, (char_u *)"F8"}, | |
2348 {K_F9, (char_u *)"F9"}, | |
2349 {K_F10, (char_u *)"F10"}, | |
2350 | |
2351 {K_F11, (char_u *)"F11"}, | |
2352 {K_F12, (char_u *)"F12"}, | |
2353 {K_F13, (char_u *)"F13"}, | |
2354 {K_F14, (char_u *)"F14"}, | |
2355 {K_F15, (char_u *)"F15"}, | |
2356 {K_F16, (char_u *)"F16"}, | |
2357 {K_F17, (char_u *)"F17"}, | |
2358 {K_F18, (char_u *)"F18"}, | |
2359 {K_F19, (char_u *)"F19"}, | |
2360 {K_F20, (char_u *)"F20"}, | |
2361 | |
2362 {K_F21, (char_u *)"F21"}, | |
2363 {K_F22, (char_u *)"F22"}, | |
2364 {K_F23, (char_u *)"F23"}, | |
2365 {K_F24, (char_u *)"F24"}, | |
2366 {K_F25, (char_u *)"F25"}, | |
2367 {K_F26, (char_u *)"F26"}, | |
2368 {K_F27, (char_u *)"F27"}, | |
2369 {K_F28, (char_u *)"F28"}, | |
2370 {K_F29, (char_u *)"F29"}, | |
2371 {K_F30, (char_u *)"F30"}, | |
2372 | |
2373 {K_F31, (char_u *)"F31"}, | |
2374 {K_F32, (char_u *)"F32"}, | |
2375 {K_F33, (char_u *)"F33"}, | |
2376 {K_F34, (char_u *)"F34"}, | |
2377 {K_F35, (char_u *)"F35"}, | |
2378 {K_F36, (char_u *)"F36"}, | |
2379 {K_F37, (char_u *)"F37"}, | |
2380 | |
2381 {K_XF1, (char_u *)"xF1"}, | |
2382 {K_XF2, (char_u *)"xF2"}, | |
2383 {K_XF3, (char_u *)"xF3"}, | |
2384 {K_XF4, (char_u *)"xF4"}, | |
2385 | |
2386 {K_HELP, (char_u *)"Help"}, | |
2387 {K_UNDO, (char_u *)"Undo"}, | |
2388 {K_INS, (char_u *)"Insert"}, | |
2389 {K_INS, (char_u *)"Ins"}, /* Alternative name */ | |
2390 {K_KINS, (char_u *)"kInsert"}, | |
2391 {K_HOME, (char_u *)"Home"}, | |
2392 {K_KHOME, (char_u *)"kHome"}, | |
2393 {K_XHOME, (char_u *)"xHome"}, | |
230 | 2394 {K_ZHOME, (char_u *)"zHome"}, |
7 | 2395 {K_END, (char_u *)"End"}, |
2396 {K_KEND, (char_u *)"kEnd"}, | |
2397 {K_XEND, (char_u *)"xEnd"}, | |
230 | 2398 {K_ZEND, (char_u *)"zEnd"}, |
7 | 2399 {K_PAGEUP, (char_u *)"PageUp"}, |
2400 {K_PAGEDOWN, (char_u *)"PageDown"}, | |
2401 {K_KPAGEUP, (char_u *)"kPageUp"}, | |
2402 {K_KPAGEDOWN, (char_u *)"kPageDown"}, | |
2403 | |
2404 {K_KPLUS, (char_u *)"kPlus"}, | |
2405 {K_KMINUS, (char_u *)"kMinus"}, | |
2406 {K_KDIVIDE, (char_u *)"kDivide"}, | |
2407 {K_KMULTIPLY, (char_u *)"kMultiply"}, | |
2408 {K_KENTER, (char_u *)"kEnter"}, | |
2409 {K_KPOINT, (char_u *)"kPoint"}, | |
2410 | |
2411 {K_K0, (char_u *)"k0"}, | |
2412 {K_K1, (char_u *)"k1"}, | |
2413 {K_K2, (char_u *)"k2"}, | |
2414 {K_K3, (char_u *)"k3"}, | |
2415 {K_K4, (char_u *)"k4"}, | |
2416 {K_K5, (char_u *)"k5"}, | |
2417 {K_K6, (char_u *)"k6"}, | |
2418 {K_K7, (char_u *)"k7"}, | |
2419 {K_K8, (char_u *)"k8"}, | |
2420 {K_K9, (char_u *)"k9"}, | |
2421 | |
2422 {'<', (char_u *)"lt"}, | |
2423 | |
2424 {K_MOUSE, (char_u *)"Mouse"}, | |
3273 | 2425 #ifdef FEAT_MOUSE_NET |
7 | 2426 {K_NETTERM_MOUSE, (char_u *)"NetMouse"}, |
3273 | 2427 #endif |
2428 #ifdef FEAT_MOUSE_DEC | |
7 | 2429 {K_DEC_MOUSE, (char_u *)"DecMouse"}, |
3273 | 2430 #endif |
2431 #ifdef FEAT_MOUSE_JSB | |
7 | 2432 {K_JSBTERM_MOUSE, (char_u *)"JsbMouse"}, |
3273 | 2433 #endif |
2434 #ifdef FEAT_MOUSE_PTERM | |
7 | 2435 {K_PTERM_MOUSE, (char_u *)"PtermMouse"}, |
3273 | 2436 #endif |
2437 #ifdef FEAT_MOUSE_URXVT | |
2438 {K_URXVT_MOUSE, (char_u *)"UrxvtMouse"}, | |
2439 #endif | |
3746 | 2440 #ifdef FEAT_MOUSE_SGR |
2441 {K_SGR_MOUSE, (char_u *)"SgrMouse"}, | |
2442 #endif | |
7 | 2443 {K_LEFTMOUSE, (char_u *)"LeftMouse"}, |
2444 {K_LEFTMOUSE_NM, (char_u *)"LeftMouseNM"}, | |
2445 {K_LEFTDRAG, (char_u *)"LeftDrag"}, | |
2446 {K_LEFTRELEASE, (char_u *)"LeftRelease"}, | |
2447 {K_LEFTRELEASE_NM, (char_u *)"LeftReleaseNM"}, | |
2448 {K_MIDDLEMOUSE, (char_u *)"MiddleMouse"}, | |
2449 {K_MIDDLEDRAG, (char_u *)"MiddleDrag"}, | |
2450 {K_MIDDLERELEASE, (char_u *)"MiddleRelease"}, | |
2451 {K_RIGHTMOUSE, (char_u *)"RightMouse"}, | |
2452 {K_RIGHTDRAG, (char_u *)"RightDrag"}, | |
2453 {K_RIGHTRELEASE, (char_u *)"RightRelease"}, | |
2409
0ca06a92adfb
Add support for horizontal scroll wheel. (Bjorn Winckler)
Bram Moolenaar <bram@vim.org>
parents:
2363
diff
changeset
|
2454 {K_MOUSEDOWN, (char_u *)"ScrollWheelUp"}, |
0ca06a92adfb
Add support for horizontal scroll wheel. (Bjorn Winckler)
Bram Moolenaar <bram@vim.org>
parents:
2363
diff
changeset
|
2455 {K_MOUSEUP, (char_u *)"ScrollWheelDown"}, |
0ca06a92adfb
Add support for horizontal scroll wheel. (Bjorn Winckler)
Bram Moolenaar <bram@vim.org>
parents:
2363
diff
changeset
|
2456 {K_MOUSELEFT, (char_u *)"ScrollWheelRight"}, |
0ca06a92adfb
Add support for horizontal scroll wheel. (Bjorn Winckler)
Bram Moolenaar <bram@vim.org>
parents:
2363
diff
changeset
|
2457 {K_MOUSERIGHT, (char_u *)"ScrollWheelLeft"}, |
0ca06a92adfb
Add support for horizontal scroll wheel. (Bjorn Winckler)
Bram Moolenaar <bram@vim.org>
parents:
2363
diff
changeset
|
2458 {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
|
2459 {K_MOUSEUP, (char_u *)"MouseUp"}, /* ScrollWheelXXX instead */ |
7 | 2460 {K_X1MOUSE, (char_u *)"X1Mouse"}, |
2461 {K_X1DRAG, (char_u *)"X1Drag"}, | |
2462 {K_X1RELEASE, (char_u *)"X1Release"}, | |
2463 {K_X2MOUSE, (char_u *)"X2Mouse"}, | |
2464 {K_X2DRAG, (char_u *)"X2Drag"}, | |
2465 {K_X2RELEASE, (char_u *)"X2Release"}, | |
2466 {K_DROP, (char_u *)"Drop"}, | |
2467 {K_ZERO, (char_u *)"Nul"}, | |
2468 #ifdef FEAT_EVAL | |
2469 {K_SNR, (char_u *)"SNR"}, | |
2470 #endif | |
2471 {K_PLUG, (char_u *)"Plug"}, | |
2472 {0, NULL} | |
2473 }; | |
2474 | |
2475 #define KEY_NAMES_TABLE_LEN (sizeof(key_names_table) / sizeof(struct key_name_entry)) | |
2476 | |
2477 #ifdef FEAT_MOUSE | |
2478 static struct mousetable | |
2479 { | |
2480 int pseudo_code; /* Code for pseudo mouse event */ | |
2481 int button; /* Which mouse button is it? */ | |
2482 int is_click; /* Is it a mouse button click event? */ | |
2483 int is_drag; /* Is it a mouse drag event? */ | |
2484 } mouse_table[] = | |
2485 { | |
2486 {(int)KE_LEFTMOUSE, MOUSE_LEFT, TRUE, FALSE}, | |
2487 #ifdef FEAT_GUI | |
2488 {(int)KE_LEFTMOUSE_NM, MOUSE_LEFT, TRUE, FALSE}, | |
2489 #endif | |
2490 {(int)KE_LEFTDRAG, MOUSE_LEFT, FALSE, TRUE}, | |
2491 {(int)KE_LEFTRELEASE, MOUSE_LEFT, FALSE, FALSE}, | |
2492 #ifdef FEAT_GUI | |
2493 {(int)KE_LEFTRELEASE_NM, MOUSE_LEFT, FALSE, FALSE}, | |
2494 #endif | |
2495 {(int)KE_MIDDLEMOUSE, MOUSE_MIDDLE, TRUE, FALSE}, | |
2496 {(int)KE_MIDDLEDRAG, MOUSE_MIDDLE, FALSE, TRUE}, | |
2497 {(int)KE_MIDDLERELEASE, MOUSE_MIDDLE, FALSE, FALSE}, | |
2498 {(int)KE_RIGHTMOUSE, MOUSE_RIGHT, TRUE, FALSE}, | |
2499 {(int)KE_RIGHTDRAG, MOUSE_RIGHT, FALSE, TRUE}, | |
2500 {(int)KE_RIGHTRELEASE, MOUSE_RIGHT, FALSE, FALSE}, | |
2501 {(int)KE_X1MOUSE, MOUSE_X1, TRUE, FALSE}, | |
2502 {(int)KE_X1DRAG, MOUSE_X1, FALSE, TRUE}, | |
2503 {(int)KE_X1RELEASE, MOUSE_X1, FALSE, FALSE}, | |
2504 {(int)KE_X2MOUSE, MOUSE_X2, TRUE, FALSE}, | |
2505 {(int)KE_X2DRAG, MOUSE_X2, FALSE, TRUE}, | |
2506 {(int)KE_X2RELEASE, MOUSE_X2, FALSE, FALSE}, | |
2507 /* DRAG without CLICK */ | |
2508 {(int)KE_IGNORE, MOUSE_RELEASE, FALSE, TRUE}, | |
2509 /* RELEASE without CLICK */ | |
2510 {(int)KE_IGNORE, MOUSE_RELEASE, FALSE, FALSE}, | |
2511 {0, 0, 0, 0}, | |
2512 }; | |
2513 #endif /* FEAT_MOUSE */ | |
2514 | |
2515 /* | |
2516 * Return the modifier mask bit (MOD_MASK_*) which corresponds to the given | |
2517 * modifier name ('S' for Shift, 'C' for Ctrl etc). | |
2518 */ | |
2519 int | |
2520 name_to_mod_mask(c) | |
2521 int c; | |
2522 { | |
2523 int i; | |
2524 | |
2525 c = TOUPPER_ASC(c); | |
2526 for (i = 0; mod_mask_table[i].mod_mask != 0; i++) | |
2527 if (c == mod_mask_table[i].name) | |
2528 return mod_mask_table[i].mod_flag; | |
2529 return 0; | |
2530 } | |
2531 | |
2532 /* | |
2533 * Check if if there is a special key code for "key" that includes the | |
2534 * modifiers specified. | |
2535 */ | |
2536 int | |
2537 simplify_key(key, modifiers) | |
2538 int key; | |
2539 int *modifiers; | |
2540 { | |
2541 int i; | |
2542 int key0; | |
2543 int key1; | |
2544 | |
2545 if (*modifiers & (MOD_MASK_SHIFT | MOD_MASK_CTRL | MOD_MASK_ALT)) | |
2546 { | |
2547 /* TAB is a special case */ | |
2548 if (key == TAB && (*modifiers & MOD_MASK_SHIFT)) | |
2549 { | |
2550 *modifiers &= ~MOD_MASK_SHIFT; | |
2551 return K_S_TAB; | |
2552 } | |
2553 key0 = KEY2TERMCAP0(key); | |
2554 key1 = KEY2TERMCAP1(key); | |
2555 for (i = 0; modifier_keys_table[i] != NUL; i += MOD_KEYS_ENTRY_SIZE) | |
2556 if (key0 == modifier_keys_table[i + 3] | |
2557 && key1 == modifier_keys_table[i + 4] | |
2558 && (*modifiers & modifier_keys_table[i])) | |
2559 { | |
2560 *modifiers &= ~modifier_keys_table[i]; | |
2561 return TERMCAP2KEY(modifier_keys_table[i + 1], | |
2562 modifier_keys_table[i + 2]); | |
2563 } | |
2564 } | |
2565 return key; | |
2566 } | |
2567 | |
2568 /* | |
180 | 2569 * Change <xHome> to <Home>, <xUp> to <Up>, etc. |
2570 */ | |
2571 int | |
2572 handle_x_keys(key) | |
2573 int key; | |
2574 { | |
2575 switch (key) | |
2576 { | |
2577 case K_XUP: return K_UP; | |
2578 case K_XDOWN: return K_DOWN; | |
2579 case K_XLEFT: return K_LEFT; | |
2580 case K_XRIGHT: return K_RIGHT; | |
2581 case K_XHOME: return K_HOME; | |
230 | 2582 case K_ZHOME: return K_HOME; |
180 | 2583 case K_XEND: return K_END; |
230 | 2584 case K_ZEND: return K_END; |
180 | 2585 case K_XF1: return K_F1; |
2586 case K_XF2: return K_F2; | |
2587 case K_XF3: return K_F3; | |
2588 case K_XF4: return K_F4; | |
2589 case K_S_XF1: return K_S_F1; | |
2590 case K_S_XF2: return K_S_F2; | |
2591 case K_S_XF3: return K_S_F3; | |
2592 case K_S_XF4: return K_S_F4; | |
2593 } | |
2594 return key; | |
2595 } | |
2596 | |
2597 /* | |
7 | 2598 * Return a string which contains the name of the given key when the given |
2599 * modifiers are down. | |
2600 */ | |
2601 char_u * | |
2602 get_special_key_name(c, modifiers) | |
2603 int c; | |
2604 int modifiers; | |
2605 { | |
2606 static char_u string[MAX_KEY_NAME_LEN + 1]; | |
2607 | |
2608 int i, idx; | |
2609 int table_idx; | |
2610 char_u *s; | |
2611 | |
2612 string[0] = '<'; | |
2613 idx = 1; | |
2614 | |
2615 /* Key that stands for a normal character. */ | |
2616 if (IS_SPECIAL(c) && KEY2TERMCAP0(c) == KS_KEY) | |
2617 c = KEY2TERMCAP1(c); | |
2618 | |
2619 /* | |
2620 * Translate shifted special keys into unshifted keys and set modifier. | |
2621 * Same for CTRL and ALT modifiers. | |
2622 */ | |
2623 if (IS_SPECIAL(c)) | |
2624 { | |
2625 for (i = 0; modifier_keys_table[i] != 0; i += MOD_KEYS_ENTRY_SIZE) | |
2626 if ( KEY2TERMCAP0(c) == (int)modifier_keys_table[i + 1] | |
2627 && (int)KEY2TERMCAP1(c) == (int)modifier_keys_table[i + 2]) | |
2628 { | |
2629 modifiers |= modifier_keys_table[i]; | |
2630 c = TERMCAP2KEY(modifier_keys_table[i + 3], | |
2631 modifier_keys_table[i + 4]); | |
2632 break; | |
2633 } | |
2634 } | |
2635 | |
2636 /* try to find the key in the special key table */ | |
2637 table_idx = find_special_key_in_table(c); | |
2638 | |
2639 /* | |
2640 * When not a known special key, and not a printable character, try to | |
2641 * extract modifiers. | |
2642 */ | |
2643 if (c > 0 | |
2644 #ifdef FEAT_MBYTE | |
2645 && (*mb_char2len)(c) == 1 | |
2646 #endif | |
2647 ) | |
2648 { | |
2649 if (table_idx < 0 | |
2650 && (!vim_isprintc(c) || (c & 0x7f) == ' ') | |
2651 && (c & 0x80)) | |
2652 { | |
2653 c &= 0x7f; | |
2654 modifiers |= MOD_MASK_ALT; | |
2655 /* try again, to find the un-alted key in the special key table */ | |
2656 table_idx = find_special_key_in_table(c); | |
2657 } | |
2658 if (table_idx < 0 && !vim_isprintc(c) && c < ' ') | |
2659 { | |
2660 #ifdef EBCDIC | |
2661 c = CtrlChar(c); | |
2662 #else | |
2663 c += '@'; | |
2664 #endif | |
2665 modifiers |= MOD_MASK_CTRL; | |
2666 } | |
2667 } | |
2668 | |
2669 /* translate the modifier into a string */ | |
2670 for (i = 0; mod_mask_table[i].name != 'A'; i++) | |
2671 if ((modifiers & mod_mask_table[i].mod_mask) | |
2672 == mod_mask_table[i].mod_flag) | |
2673 { | |
2674 string[idx++] = mod_mask_table[i].name; | |
2675 string[idx++] = (char_u)'-'; | |
2676 } | |
2677 | |
2678 if (table_idx < 0) /* unknown special key, may output t_xx */ | |
2679 { | |
2680 if (IS_SPECIAL(c)) | |
2681 { | |
2682 string[idx++] = 't'; | |
2683 string[idx++] = '_'; | |
2684 string[idx++] = KEY2TERMCAP0(c); | |
2685 string[idx++] = KEY2TERMCAP1(c); | |
2686 } | |
2687 /* Not a special key, only modifiers, output directly */ | |
2688 else | |
2689 { | |
2690 #ifdef FEAT_MBYTE | |
2691 if (has_mbyte && (*mb_char2len)(c) > 1) | |
2692 idx += (*mb_char2bytes)(c, string + idx); | |
2693 else | |
2694 #endif | |
2695 if (vim_isprintc(c)) | |
2696 string[idx++] = c; | |
2697 else | |
2698 { | |
2699 s = transchar(c); | |
2700 while (*s) | |
2701 string[idx++] = *s++; | |
2702 } | |
2703 } | |
2704 } | |
2705 else /* use name of special key */ | |
2706 { | |
2707 STRCPY(string + idx, key_names_table[table_idx].name); | |
2708 idx = (int)STRLEN(string); | |
2709 } | |
2710 string[idx++] = '>'; | |
2711 string[idx] = NUL; | |
2712 return string; | |
2713 } | |
2714 | |
2715 /* | |
2716 * Try translating a <> name at (*srcp)[] to dst[]. | |
2717 * Return the number of characters added to dst[], zero for no match. | |
2718 * If there is a match, srcp is advanced to after the <> name. | |
2719 * dst[] must be big enough to hold the result (up to six characters)! | |
2720 */ | |
2721 int | |
2722 trans_special(srcp, dst, keycode) | |
2723 char_u **srcp; | |
2724 char_u *dst; | |
2725 int keycode; /* prefer key code, e.g. K_DEL instead of DEL */ | |
2726 { | |
2727 int modifiers = 0; | |
2728 int key; | |
2729 int dlen = 0; | |
2730 | |
1775 | 2731 key = find_special_key(srcp, &modifiers, keycode, FALSE); |
7 | 2732 if (key == 0) |
2733 return 0; | |
2734 | |
2735 /* Put the appropriate modifier in a string */ | |
2736 if (modifiers != 0) | |
2737 { | |
2738 dst[dlen++] = K_SPECIAL; | |
2739 dst[dlen++] = KS_MODIFIER; | |
2740 dst[dlen++] = modifiers; | |
2741 } | |
2742 | |
2743 if (IS_SPECIAL(key)) | |
2744 { | |
2745 dst[dlen++] = K_SPECIAL; | |
2746 dst[dlen++] = KEY2TERMCAP0(key); | |
2747 dst[dlen++] = KEY2TERMCAP1(key); | |
2748 } | |
2749 #ifdef FEAT_MBYTE | |
2750 else if (has_mbyte && !keycode) | |
2751 dlen += (*mb_char2bytes)(key, dst + dlen); | |
2752 #endif | |
2753 else if (keycode) | |
2754 dlen = (int)(add_char2buf(key, dst + dlen) - dst); | |
2755 else | |
2756 dst[dlen++] = key; | |
2757 | |
2758 return dlen; | |
2759 } | |
2760 | |
2761 /* | |
2762 * Try translating a <> name at (*srcp)[], return the key and modifiers. | |
2763 * srcp is advanced to after the <> name. | |
2764 * returns 0 if there is no match. | |
2765 */ | |
2766 int | |
1775 | 2767 find_special_key(srcp, modp, keycode, keep_x_key) |
7 | 2768 char_u **srcp; |
2769 int *modp; | |
1775 | 2770 int keycode; /* prefer key code, e.g. K_DEL instead of DEL */ |
2771 int keep_x_key; /* don't translate xHome to Home key */ | |
7 | 2772 { |
2773 char_u *last_dash; | |
2774 char_u *end_of_name; | |
2775 char_u *src; | |
2776 char_u *bp; | |
2777 int modifiers; | |
2778 int bit; | |
2779 int key; | |
835 | 2780 unsigned long n; |
3024 | 2781 int l; |
7 | 2782 |
2783 src = *srcp; | |
2784 if (src[0] != '<') | |
2785 return 0; | |
2786 | |
2787 /* Find end of modifier list */ | |
2788 last_dash = src; | |
2789 for (bp = src + 1; *bp == '-' || vim_isIDc(*bp); bp++) | |
2790 { | |
2791 if (*bp == '-') | |
2792 { | |
2793 last_dash = bp; | |
3024 | 2794 if (bp[1] != NUL) |
2795 { | |
2796 #ifdef FEAT_MBYTE | |
2797 if (has_mbyte) | |
2798 l = mb_ptr2len(bp + 1); | |
2799 else | |
2800 #endif | |
2801 l = 1; | |
2802 if (bp[l + 1] == '>') | |
2803 bp += l; /* anything accepted, like <C-?> */ | |
2804 } | |
7 | 2805 } |
2806 if (bp[0] == 't' && bp[1] == '_' && bp[2] && bp[3]) | |
2807 bp += 3; /* skip t_xx, xx may be '-' or '>' */ | |
3026 | 2808 else if (STRNICMP(bp, "char-", 5) == 0) |
2809 { | |
2810 vim_str2nr(bp + 5, NULL, &l, TRUE, TRUE, NULL, NULL); | |
2811 bp += l + 5; | |
2812 break; | |
2813 } | |
7 | 2814 } |
2815 | |
2816 if (*bp == '>') /* found matching '>' */ | |
2817 { | |
2818 end_of_name = bp + 1; | |
2819 | |
2820 /* Which modifiers are given? */ | |
2821 modifiers = 0x0; | |
2822 for (bp = src + 1; bp < last_dash; bp++) | |
2823 { | |
2824 if (*bp != '-') | |
2825 { | |
2826 bit = name_to_mod_mask(*bp); | |
2827 if (bit == 0x0) | |
2828 break; /* Illegal modifier name */ | |
2829 modifiers |= bit; | |
2830 } | |
2831 } | |
2832 | |
2833 /* | |
2834 * Legal modifier name. | |
2835 */ | |
2836 if (bp >= last_dash) | |
2837 { | |
3024 | 2838 if (STRNICMP(last_dash + 1, "char-", 5) == 0 |
2839 && VIM_ISDIGIT(last_dash[6])) | |
2840 { | |
2841 /* <Char-123> or <Char-033> or <Char-0x33> */ | |
2842 vim_str2nr(last_dash + 6, NULL, NULL, TRUE, TRUE, NULL, &n); | |
3026 | 2843 key = (int)n; |
3024 | 2844 } |
7 | 2845 else |
180 | 2846 { |
3026 | 2847 /* |
2848 * Modifier with single letter, or special key name. | |
2849 */ | |
2850 #ifdef FEAT_MBYTE | |
2851 if (has_mbyte) | |
2852 l = mb_ptr2len(last_dash + 1); | |
2853 else | |
2854 #endif | |
2855 l = 1; | |
2856 if (modifiers != 0 && last_dash[l + 1] == '>') | |
2857 key = PTR2CHAR(last_dash + 1); | |
2858 else | |
2859 { | |
2860 key = get_special_key_code(last_dash + 1); | |
2861 if (!keep_x_key) | |
2862 key = handle_x_keys(key); | |
2863 } | |
180 | 2864 } |
7 | 2865 |
2866 /* | |
2867 * get_special_key_code() may return NUL for invalid | |
2868 * special key name. | |
2869 */ | |
2870 if (key != NUL) | |
2871 { | |
2872 /* | |
2873 * Only use a modifier when there is no special key code that | |
2874 * includes the modifier. | |
2875 */ | |
2876 key = simplify_key(key, &modifiers); | |
2877 | |
2878 if (!keycode) | |
2879 { | |
2880 /* don't want keycode, use single byte code */ | |
2881 if (key == K_BS) | |
2882 key = BS; | |
2883 else if (key == K_DEL || key == K_KDEL) | |
2884 key = DEL; | |
2885 } | |
2886 | |
2887 /* | |
2888 * Normal Key with modifier: Try to make a single byte code. | |
2889 */ | |
2890 if (!IS_SPECIAL(key)) | |
2891 key = extract_modifiers(key, &modifiers); | |
2892 | |
2893 *modp = modifiers; | |
2894 *srcp = end_of_name; | |
2895 return key; | |
2896 } | |
2897 } | |
2898 } | |
2899 return 0; | |
2900 } | |
2901 | |
2902 /* | |
2903 * Try to include modifiers in the key. | |
2904 * Changes "Shift-a" to 'A', "Alt-A" to 0xc0, etc. | |
2905 */ | |
2906 int | |
2907 extract_modifiers(key, modp) | |
2908 int key; | |
2909 int *modp; | |
2910 { | |
2911 int modifiers = *modp; | |
2912 | |
2913 #ifdef MACOS | |
4352 | 2914 /* Command-key really special, no fancynest */ |
7 | 2915 if (!(modifiers & MOD_MASK_CMD)) |
2916 #endif | |
2917 if ((modifiers & MOD_MASK_SHIFT) && ASCII_ISALPHA(key)) | |
2918 { | |
2919 key = TOUPPER_ASC(key); | |
2920 modifiers &= ~MOD_MASK_SHIFT; | |
2921 } | |
2922 if ((modifiers & MOD_MASK_CTRL) | |
2923 #ifdef EBCDIC | |
2924 /* * TODO: EBCDIC Better use: | |
2925 * && (Ctrl_chr(key) || key == '?') | |
2926 * ??? */ | |
2927 && strchr("?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_", key) | |
2928 != NULL | |
2929 #else | |
2930 && ((key >= '?' && key <= '_') || ASCII_ISALPHA(key)) | |
2931 #endif | |
2932 ) | |
2933 { | |
2934 key = Ctrl_chr(key); | |
2935 modifiers &= ~MOD_MASK_CTRL; | |
2936 /* <C-@> is <Nul> */ | |
2937 if (key == 0) | |
2938 key = K_ZERO; | |
2939 } | |
2940 #ifdef MACOS | |
4352 | 2941 /* Command-key really special, no fancynest */ |
7 | 2942 if (!(modifiers & MOD_MASK_CMD)) |
2943 #endif | |
2944 if ((modifiers & MOD_MASK_ALT) && key < 0x80 | |
2945 #ifdef FEAT_MBYTE | |
2946 && !enc_dbcs /* avoid creating a lead byte */ | |
2947 #endif | |
2948 ) | |
2949 { | |
2950 key |= 0x80; | |
2951 modifiers &= ~MOD_MASK_ALT; /* remove the META modifier */ | |
2952 } | |
2953 | |
2954 *modp = modifiers; | |
2955 return key; | |
2956 } | |
2957 | |
2958 /* | |
2959 * Try to find key "c" in the special key table. | |
2960 * Return the index when found, -1 when not found. | |
2961 */ | |
2962 int | |
2963 find_special_key_in_table(c) | |
2964 int c; | |
2965 { | |
2966 int i; | |
2967 | |
2968 for (i = 0; key_names_table[i].name != NULL; i++) | |
2969 if (c == key_names_table[i].key) | |
2970 break; | |
2971 if (key_names_table[i].name == NULL) | |
2972 i = -1; | |
2973 return i; | |
2974 } | |
2975 | |
2976 /* | |
2977 * Find the special key with the given name (the given string does not have to | |
2978 * end with NUL, the name is assumed to end before the first non-idchar). | |
2979 * If the name starts with "t_" the next two characters are interpreted as a | |
2980 * termcap name. | |
2981 * Return the key code, or 0 if not found. | |
2982 */ | |
2983 int | |
2984 get_special_key_code(name) | |
2985 char_u *name; | |
2986 { | |
2987 char_u *table_name; | |
2988 char_u string[3]; | |
2989 int i, j; | |
2990 | |
2991 /* | |
2992 * If it's <t_xx> we get the code for xx from the termcap | |
2993 */ | |
2994 if (name[0] == 't' && name[1] == '_' && name[2] != NUL && name[3] != NUL) | |
2995 { | |
2996 string[0] = name[2]; | |
2997 string[1] = name[3]; | |
2998 string[2] = NUL; | |
2999 if (add_termcap_entry(string, FALSE) == OK) | |
3000 return TERMCAP2KEY(name[2], name[3]); | |
3001 } | |
3002 else | |
3003 for (i = 0; key_names_table[i].name != NULL; i++) | |
3004 { | |
3005 table_name = key_names_table[i].name; | |
3006 for (j = 0; vim_isIDc(name[j]) && table_name[j] != NUL; j++) | |
3007 if (TOLOWER_ASC(table_name[j]) != TOLOWER_ASC(name[j])) | |
3008 break; | |
3009 if (!vim_isIDc(name[j]) && table_name[j] == NUL) | |
3010 return key_names_table[i].key; | |
3011 } | |
3012 return 0; | |
3013 } | |
3014 | |
1661 | 3015 #if defined(FEAT_CMDL_COMPL) || defined(PROTO) |
7 | 3016 char_u * |
3017 get_key_name(i) | |
3018 int i; | |
3019 { | |
1881 | 3020 if (i >= (int)KEY_NAMES_TABLE_LEN) |
7 | 3021 return NULL; |
3022 return key_names_table[i].name; | |
3023 } | |
3024 #endif | |
3025 | |
1661 | 3026 #if defined(FEAT_MOUSE) || defined(PROTO) |
7 | 3027 /* |
3028 * Look up the given mouse code to return the relevant information in the other | |
3029 * arguments. Return which button is down or was released. | |
3030 */ | |
3031 int | |
3032 get_mouse_button(code, is_click, is_drag) | |
3033 int code; | |
3034 int *is_click; | |
3035 int *is_drag; | |
3036 { | |
3037 int i; | |
3038 | |
3039 for (i = 0; mouse_table[i].pseudo_code; i++) | |
3040 if (code == mouse_table[i].pseudo_code) | |
3041 { | |
3042 *is_click = mouse_table[i].is_click; | |
3043 *is_drag = mouse_table[i].is_drag; | |
3044 return mouse_table[i].button; | |
3045 } | |
3046 return 0; /* Shouldn't get here */ | |
3047 } | |
3048 | |
3049 /* | |
3050 * Return the appropriate pseudo mouse event token (KE_LEFTMOUSE etc) based on | |
3051 * the given information about which mouse button is down, and whether the | |
3052 * mouse was clicked, dragged or released. | |
3053 */ | |
3054 int | |
3055 get_pseudo_mouse_code(button, is_click, is_drag) | |
3056 int button; /* eg MOUSE_LEFT */ | |
3057 int is_click; | |
3058 int is_drag; | |
3059 { | |
3060 int i; | |
3061 | |
3062 for (i = 0; mouse_table[i].pseudo_code; i++) | |
3063 if (button == mouse_table[i].button | |
3064 && is_click == mouse_table[i].is_click | |
3065 && is_drag == mouse_table[i].is_drag) | |
3066 { | |
3067 #ifdef FEAT_GUI | |
263 | 3068 /* Trick: a non mappable left click and release has mouse_col -1 |
3069 * or added MOUSE_COLOFF. Used for 'mousefocus' in | |
3070 * gui_mouse_moved() */ | |
3071 if (mouse_col < 0 || mouse_col > MOUSE_COLOFF) | |
7 | 3072 { |
263 | 3073 if (mouse_col < 0) |
3074 mouse_col = 0; | |
3075 else | |
3076 mouse_col -= MOUSE_COLOFF; | |
7 | 3077 if (mouse_table[i].pseudo_code == (int)KE_LEFTMOUSE) |
3078 return (int)KE_LEFTMOUSE_NM; | |
3079 if (mouse_table[i].pseudo_code == (int)KE_LEFTRELEASE) | |
3080 return (int)KE_LEFTRELEASE_NM; | |
3081 } | |
3082 #endif | |
3083 return mouse_table[i].pseudo_code; | |
3084 } | |
1209 | 3085 return (int)KE_IGNORE; /* not recognized, ignore it */ |
7 | 3086 } |
3087 #endif /* FEAT_MOUSE */ | |
3088 | |
3089 /* | |
3090 * Return the current end-of-line type: EOL_DOS, EOL_UNIX or EOL_MAC. | |
3091 */ | |
3092 int | |
3093 get_fileformat(buf) | |
3094 buf_T *buf; | |
3095 { | |
3096 int c = *buf->b_p_ff; | |
3097 | |
3098 if (buf->b_p_bin || c == 'u') | |
3099 return EOL_UNIX; | |
3100 if (c == 'm') | |
3101 return EOL_MAC; | |
3102 return EOL_DOS; | |
3103 } | |
3104 | |
3105 /* | |
3106 * Like get_fileformat(), but override 'fileformat' with "p" for "++opt=val" | |
3107 * argument. | |
3108 */ | |
3109 int | |
3110 get_fileformat_force(buf, eap) | |
3111 buf_T *buf; | |
3112 exarg_T *eap; /* can be NULL! */ | |
3113 { | |
3114 int c; | |
3115 | |
3116 if (eap != NULL && eap->force_ff != 0) | |
3117 c = eap->cmd[eap->force_ff]; | |
3118 else | |
3119 { | |
3120 if ((eap != NULL && eap->force_bin != 0) | |
3121 ? (eap->force_bin == FORCE_BIN) : buf->b_p_bin) | |
3122 return EOL_UNIX; | |
3123 c = *buf->b_p_ff; | |
3124 } | |
3125 if (c == 'u') | |
3126 return EOL_UNIX; | |
3127 if (c == 'm') | |
3128 return EOL_MAC; | |
3129 return EOL_DOS; | |
3130 } | |
3131 | |
3132 /* | |
3133 * Set the current end-of-line type to EOL_DOS, EOL_UNIX or EOL_MAC. | |
3134 * Sets both 'textmode' and 'fileformat'. | |
3135 * Note: Does _not_ set global value of 'textmode'! | |
3136 */ | |
3137 void | |
3138 set_fileformat(t, opt_flags) | |
3139 int t; | |
3140 int opt_flags; /* OPT_LOCAL and/or OPT_GLOBAL */ | |
3141 { | |
3142 char *p = NULL; | |
3143 | |
3144 switch (t) | |
3145 { | |
3146 case EOL_DOS: | |
3147 p = FF_DOS; | |
3148 curbuf->b_p_tx = TRUE; | |
3149 break; | |
3150 case EOL_UNIX: | |
3151 p = FF_UNIX; | |
3152 curbuf->b_p_tx = FALSE; | |
3153 break; | |
3154 case EOL_MAC: | |
3155 p = FF_MAC; | |
3156 curbuf->b_p_tx = FALSE; | |
3157 break; | |
3158 } | |
3159 if (p != NULL) | |
3160 set_string_option_direct((char_u *)"ff", -1, (char_u *)p, | |
694 | 3161 OPT_FREE | opt_flags, 0); |
3162 | |
7 | 3163 #ifdef FEAT_WINDOWS |
671 | 3164 /* This may cause the buffer to become (un)modified. */ |
7 | 3165 check_status(curbuf); |
673 | 3166 redraw_tabline = TRUE; |
7 | 3167 #endif |
3168 #ifdef FEAT_TITLE | |
3169 need_maketitle = TRUE; /* set window title later */ | |
3170 #endif | |
3171 } | |
3172 | |
3173 /* | |
3174 * Return the default fileformat from 'fileformats'. | |
3175 */ | |
3176 int | |
3177 default_fileformat() | |
3178 { | |
3179 switch (*p_ffs) | |
3180 { | |
3181 case 'm': return EOL_MAC; | |
3182 case 'd': return EOL_DOS; | |
3183 } | |
3184 return EOL_UNIX; | |
3185 } | |
3186 | |
3187 /* | |
3188 * Call shell. Calls mch_call_shell, with 'shellxquote' added. | |
3189 */ | |
3190 int | |
3191 call_shell(cmd, opt) | |
3192 char_u *cmd; | |
3193 int opt; | |
3194 { | |
3195 char_u *ncmd; | |
3196 int retval; | |
170 | 3197 #ifdef FEAT_PROFILE |
3198 proftime_T wait_time; | |
3199 #endif | |
7 | 3200 |
3201 if (p_verbose > 3) | |
3202 { | |
293 | 3203 verbose_enter(); |
273 | 3204 smsg((char_u *)_("Calling shell to execute: \"%s\""), |
7 | 3205 cmd == NULL ? p_sh : cmd); |
3206 out_char('\n'); | |
3207 cursor_on(); | |
293 | 3208 verbose_leave(); |
7 | 3209 } |
3210 | |
170 | 3211 #ifdef FEAT_PROFILE |
789 | 3212 if (do_profiling == PROF_YES) |
170 | 3213 prof_child_enter(&wait_time); |
3214 #endif | |
3215 | |
7 | 3216 if (*p_sh == NUL) |
3217 { | |
3218 EMSG(_(e_shellempty)); | |
3219 retval = -1; | |
3220 } | |
3221 else | |
3222 { | |
3223 #ifdef FEAT_GUI_MSWIN | |
3224 /* Don't hide the pointer while executing a shell command. */ | |
3225 gui_mch_mousehide(FALSE); | |
3226 #endif | |
3227 #ifdef FEAT_GUI | |
3228 ++hold_gui_events; | |
3229 #endif | |
3230 /* The external command may update a tags file, clear cached tags. */ | |
3231 tag_freematch(); | |
3232 | |
3233 if (cmd == NULL || *p_sxq == NUL) | |
3234 retval = mch_call_shell(cmd, opt); | |
3235 else | |
3236 { | |
3359 | 3237 char_u *ecmd = cmd; |
3238 | |
3239 if (*p_sxe != NUL && STRCMP(p_sxq, "(") == 0) | |
3240 { | |
3241 ecmd = vim_strsave_escaped_ext(cmd, p_sxe, '^', FALSE); | |
3242 if (ecmd == NULL) | |
3243 ecmd = cmd; | |
3244 } | |
3245 ncmd = alloc((unsigned)(STRLEN(ecmd) + STRLEN(p_sxq) * 2 + 1)); | |
7 | 3246 if (ncmd != NULL) |
3247 { | |
3248 STRCPY(ncmd, p_sxq); | |
3359 | 3249 STRCAT(ncmd, ecmd); |
3357 | 3250 /* When 'shellxquote' is ( append ). |
3251 * When 'shellxquote' is "( append )". */ | |
3252 STRCAT(ncmd, STRCMP(p_sxq, "(") == 0 ? (char_u *)")" | |
3253 : STRCMP(p_sxq, "\"(") == 0 ? (char_u *)")\"" | |
3254 : p_sxq); | |
7 | 3255 retval = mch_call_shell(ncmd, opt); |
3256 vim_free(ncmd); | |
3257 } | |
3258 else | |
3259 retval = -1; | |
3359 | 3260 if (ecmd != cmd) |
3261 vim_free(ecmd); | |
7 | 3262 } |
3263 #ifdef FEAT_GUI | |
3264 --hold_gui_events; | |
3265 #endif | |
3266 /* | |
3267 * Check the window size, in case it changed while executing the | |
3268 * external command. | |
3269 */ | |
3270 shell_resized_check(); | |
3271 } | |
3272 | |
3273 #ifdef FEAT_EVAL | |
3274 set_vim_var_nr(VV_SHELL_ERROR, (long)retval); | |
170 | 3275 # ifdef FEAT_PROFILE |
789 | 3276 if (do_profiling == PROF_YES) |
170 | 3277 prof_child_exit(&wait_time); |
3278 # endif | |
7 | 3279 #endif |
3280 | |
3281 return retval; | |
3282 } | |
3283 | |
3284 /* | |
789 | 3285 * VISUAL, SELECTMODE and OP_PENDING State are never set, they are equal to |
3286 * NORMAL State with a condition. This function returns the real State. | |
7 | 3287 */ |
3288 int | |
3289 get_real_state() | |
3290 { | |
3291 if (State & NORMAL) | |
3292 { | |
3293 #ifdef FEAT_VISUAL | |
3294 if (VIsual_active) | |
789 | 3295 { |
3296 if (VIsual_select) | |
3297 return SELECTMODE; | |
7 | 3298 return VISUAL; |
789 | 3299 } |
7 | 3300 else |
3301 #endif | |
3302 if (finish_op) | |
789 | 3303 return OP_PENDING; |
7 | 3304 } |
3305 return State; | |
3306 } | |
3307 | |
39 | 3308 #if defined(FEAT_MBYTE) || defined(PROTO) |
3309 /* | |
3310 * Return TRUE if "p" points to just after a path separator. | |
2939 | 3311 * Takes care of multi-byte characters. |
39 | 3312 * "b" must point to the start of the file name |
3313 */ | |
3314 int | |
3315 after_pathsep(b, p) | |
3316 char_u *b; | |
3317 char_u *p; | |
3318 { | |
2939 | 3319 return p > b && vim_ispathsep(p[-1]) |
39 | 3320 && (!has_mbyte || (*mb_head_off)(b, p - 1) == 0); |
3321 } | |
3322 #endif | |
3323 | |
3324 /* | |
3325 * Return TRUE if file names "f1" and "f2" are in the same directory. | |
3326 * "f1" may be a short name, "f2" must be a full path. | |
3327 */ | |
3328 int | |
3329 same_directory(f1, f2) | |
3330 char_u *f1; | |
3331 char_u *f2; | |
3332 { | |
3333 char_u ffname[MAXPATHL]; | |
3334 char_u *t1; | |
3335 char_u *t2; | |
3336 | |
3337 /* safety check */ | |
3338 if (f1 == NULL || f2 == NULL) | |
3339 return FALSE; | |
3340 | |
3341 (void)vim_FullName(f1, ffname, MAXPATHL, FALSE); | |
3342 t1 = gettail_sep(ffname); | |
3343 t2 = gettail_sep(f2); | |
3344 return (t1 - ffname == t2 - f2 | |
3345 && pathcmp((char *)ffname, (char *)f2, (int)(t1 - ffname)) == 0); | |
3346 } | |
3347 | |
7 | 3348 #if defined(FEAT_SESSION) || defined(MSWIN) || defined(FEAT_GUI_MAC) \ |
574 | 3349 || ((defined(FEAT_GUI_GTK)) \ |
11 | 3350 && ( defined(FEAT_WINDOWS) || defined(FEAT_DND)) ) \ |
7 | 3351 || defined(FEAT_SUN_WORKSHOP) || defined(FEAT_NETBEANS_INTG) \ |
3352 || defined(PROTO) | |
3353 /* | |
3354 * Change to a file's directory. | |
3355 * Caller must call shorten_fnames()! | |
3356 * Return OK or FAIL. | |
3357 */ | |
3358 int | |
3359 vim_chdirfile(fname) | |
3360 char_u *fname; | |
3361 { | |
39 | 3362 char_u dir[MAXPATHL]; |
3363 | |
418 | 3364 vim_strncpy(dir, fname, MAXPATHL - 1); |
39 | 3365 *gettail_sep(dir) = NUL; |
3366 return mch_chdir((char *)dir) == 0 ? OK : FAIL; | |
7 | 3367 } |
3368 #endif | |
3369 | |
3370 #if defined(STAT_IGNORES_SLASH) || defined(PROTO) | |
3371 /* | |
3372 * Check if "name" ends in a slash and is not a directory. | |
3373 * Used for systems where stat() ignores a trailing slash on a file name. | |
3374 * The Vim code assumes a trailing slash is only ignored for a directory. | |
3375 */ | |
3376 int | |
3377 illegal_slash(name) | |
3378 char *name; | |
3379 { | |
3380 if (name[0] == NUL) | |
3381 return FALSE; /* no file name is not illegal */ | |
3382 if (name[strlen(name) - 1] != '/') | |
3383 return FALSE; /* no trailing slash */ | |
3384 if (mch_isdir((char_u *)name)) | |
3385 return FALSE; /* trailing slash for a directory */ | |
3386 return TRUE; | |
3387 } | |
3388 #endif | |
3389 | |
3390 #if defined(CURSOR_SHAPE) || defined(PROTO) | |
3391 | |
3392 /* | |
3393 * Handling of cursor and mouse pointer shapes in various modes. | |
3394 */ | |
3395 | |
3396 cursorentry_T shape_table[SHAPE_IDX_COUNT] = | |
3397 { | |
3398 /* The values will be filled in from the 'guicursor' and 'mouseshape' | |
3399 * defaults when Vim starts. | |
3400 * Adjust the SHAPE_IDX_ defines when making changes! */ | |
3401 {0, 0, 0, 700L, 400L, 250L, 0, 0, "n", SHAPE_CURSOR+SHAPE_MOUSE}, | |
3402 {0, 0, 0, 700L, 400L, 250L, 0, 0, "v", SHAPE_CURSOR+SHAPE_MOUSE}, | |
3403 {0, 0, 0, 700L, 400L, 250L, 0, 0, "i", SHAPE_CURSOR+SHAPE_MOUSE}, | |
3404 {0, 0, 0, 700L, 400L, 250L, 0, 0, "r", SHAPE_CURSOR+SHAPE_MOUSE}, | |
3405 {0, 0, 0, 700L, 400L, 250L, 0, 0, "c", SHAPE_CURSOR+SHAPE_MOUSE}, | |
3406 {0, 0, 0, 700L, 400L, 250L, 0, 0, "ci", SHAPE_CURSOR+SHAPE_MOUSE}, | |
3407 {0, 0, 0, 700L, 400L, 250L, 0, 0, "cr", SHAPE_CURSOR+SHAPE_MOUSE}, | |
3408 {0, 0, 0, 700L, 400L, 250L, 0, 0, "o", SHAPE_CURSOR+SHAPE_MOUSE}, | |
3409 {0, 0, 0, 700L, 400L, 250L, 0, 0, "ve", SHAPE_CURSOR+SHAPE_MOUSE}, | |
3410 {0, 0, 0, 0L, 0L, 0L, 0, 0, "e", SHAPE_MOUSE}, | |
3411 {0, 0, 0, 0L, 0L, 0L, 0, 0, "s", SHAPE_MOUSE}, | |
3412 {0, 0, 0, 0L, 0L, 0L, 0, 0, "sd", SHAPE_MOUSE}, | |
3413 {0, 0, 0, 0L, 0L, 0L, 0, 0, "vs", SHAPE_MOUSE}, | |
3414 {0, 0, 0, 0L, 0L, 0L, 0, 0, "vd", SHAPE_MOUSE}, | |
3415 {0, 0, 0, 0L, 0L, 0L, 0, 0, "m", SHAPE_MOUSE}, | |
3416 {0, 0, 0, 0L, 0L, 0L, 0, 0, "ml", SHAPE_MOUSE}, | |
3417 {0, 0, 0, 100L, 100L, 100L, 0, 0, "sm", SHAPE_CURSOR}, | |
3418 }; | |
3419 | |
3420 #ifdef FEAT_MOUSESHAPE | |
3421 /* | |
3422 * Table with names for mouse shapes. Keep in sync with all the tables for | |
3423 * mch_set_mouse_shape()!. | |
3424 */ | |
3425 static char * mshape_names[] = | |
3426 { | |
3427 "arrow", /* default, must be the first one */ | |
3428 "blank", /* hidden */ | |
3429 "beam", | |
3430 "updown", | |
3431 "udsizing", | |
3432 "leftright", | |
3433 "lrsizing", | |
3434 "busy", | |
3435 "no", | |
3436 "crosshair", | |
3437 "hand1", | |
3438 "hand2", | |
3439 "pencil", | |
3440 "question", | |
3441 "rightup-arrow", | |
3442 "up-arrow", | |
3443 NULL | |
3444 }; | |
3445 #endif | |
3446 | |
3447 /* | |
3448 * Parse the 'guicursor' option ("what" is SHAPE_CURSOR) or 'mouseshape' | |
3449 * ("what" is SHAPE_MOUSE). | |
3450 * Returns error message for an illegal option, NULL otherwise. | |
3451 */ | |
3452 char_u * | |
3453 parse_shape_opt(what) | |
3454 int what; | |
3455 { | |
3456 char_u *modep; | |
3457 char_u *colonp; | |
3458 char_u *commap; | |
3459 char_u *slashp; | |
3460 char_u *p, *endp; | |
3461 int idx = 0; /* init for GCC */ | |
3462 int all_idx; | |
3463 int len; | |
3464 int i; | |
3465 long n; | |
3466 int found_ve = FALSE; /* found "ve" flag */ | |
3467 int round; | |
3468 | |
3469 /* | |
3470 * First round: check for errors; second round: do it for real. | |
3471 */ | |
3472 for (round = 1; round <= 2; ++round) | |
3473 { | |
3474 /* | |
3475 * Repeat for all comma separated parts. | |
3476 */ | |
3477 #ifdef FEAT_MOUSESHAPE | |
3478 if (what == SHAPE_MOUSE) | |
3479 modep = p_mouseshape; | |
3480 else | |
3481 #endif | |
3482 modep = p_guicursor; | |
3483 while (*modep != NUL) | |
3484 { | |
3485 colonp = vim_strchr(modep, ':'); | |
3486 if (colonp == NULL) | |
3487 return (char_u *)N_("E545: Missing colon"); | |
3488 if (colonp == modep) | |
3489 return (char_u *)N_("E546: Illegal mode"); | |
3490 commap = vim_strchr(modep, ','); | |
3491 | |
3492 /* | |
3493 * Repeat for all mode's before the colon. | |
3494 * For the 'a' mode, we loop to handle all the modes. | |
3495 */ | |
3496 all_idx = -1; | |
3497 while (modep < colonp || all_idx >= 0) | |
3498 { | |
3499 if (all_idx < 0) | |
3500 { | |
3501 /* Find the mode. */ | |
3502 if (modep[1] == '-' || modep[1] == ':') | |
3503 len = 1; | |
3504 else | |
3505 len = 2; | |
3506 if (len == 1 && TOLOWER_ASC(modep[0]) == 'a') | |
3507 all_idx = SHAPE_IDX_COUNT - 1; | |
3508 else | |
3509 { | |
3510 for (idx = 0; idx < SHAPE_IDX_COUNT; ++idx) | |
3511 if (STRNICMP(modep, shape_table[idx].name, len) | |
3512 == 0) | |
3513 break; | |
3514 if (idx == SHAPE_IDX_COUNT | |
3515 || (shape_table[idx].used_for & what) == 0) | |
3516 return (char_u *)N_("E546: Illegal mode"); | |
3517 if (len == 2 && modep[0] == 'v' && modep[1] == 'e') | |
3518 found_ve = TRUE; | |
3519 } | |
3520 modep += len + 1; | |
3521 } | |
3522 | |
3523 if (all_idx >= 0) | |
3524 idx = all_idx--; | |
3525 else if (round == 2) | |
3526 { | |
3527 #ifdef FEAT_MOUSESHAPE | |
3528 if (what == SHAPE_MOUSE) | |
3529 { | |
3530 /* Set the default, for the missing parts */ | |
3531 shape_table[idx].mshape = 0; | |
3532 } | |
3533 else | |
3534 #endif | |
3535 { | |
3536 /* Set the defaults, for the missing parts */ | |
3537 shape_table[idx].shape = SHAPE_BLOCK; | |
3538 shape_table[idx].blinkwait = 700L; | |
3539 shape_table[idx].blinkon = 400L; | |
3540 shape_table[idx].blinkoff = 250L; | |
3541 } | |
3542 } | |
3543 | |
3544 /* Parse the part after the colon */ | |
3545 for (p = colonp + 1; *p && *p != ','; ) | |
3546 { | |
3547 #ifdef FEAT_MOUSESHAPE | |
3548 if (what == SHAPE_MOUSE) | |
3549 { | |
3550 for (i = 0; ; ++i) | |
3551 { | |
3552 if (mshape_names[i] == NULL) | |
3553 { | |
3554 if (!VIM_ISDIGIT(*p)) | |
3555 return (char_u *)N_("E547: Illegal mouseshape"); | |
3556 if (round == 2) | |
3557 shape_table[idx].mshape = | |
3558 getdigits(&p) + MSHAPE_NUMBERED; | |
3559 else | |
3560 (void)getdigits(&p); | |
3561 break; | |
3562 } | |
3563 len = (int)STRLEN(mshape_names[i]); | |
3564 if (STRNICMP(p, mshape_names[i], len) == 0) | |
3565 { | |
3566 if (round == 2) | |
3567 shape_table[idx].mshape = i; | |
3568 p += len; | |
3569 break; | |
3570 } | |
3571 } | |
3572 } | |
3573 else /* if (what == SHAPE_MOUSE) */ | |
3574 #endif | |
3575 { | |
3576 /* | |
3577 * First handle the ones with a number argument. | |
3578 */ | |
3579 i = *p; | |
3580 len = 0; | |
3581 if (STRNICMP(p, "ver", 3) == 0) | |
3582 len = 3; | |
3583 else if (STRNICMP(p, "hor", 3) == 0) | |
3584 len = 3; | |
3585 else if (STRNICMP(p, "blinkwait", 9) == 0) | |
3586 len = 9; | |
3587 else if (STRNICMP(p, "blinkon", 7) == 0) | |
3588 len = 7; | |
3589 else if (STRNICMP(p, "blinkoff", 8) == 0) | |
3590 len = 8; | |
3591 if (len != 0) | |
3592 { | |
3593 p += len; | |
3594 if (!VIM_ISDIGIT(*p)) | |
3595 return (char_u *)N_("E548: digit expected"); | |
3596 n = getdigits(&p); | |
3597 if (len == 3) /* "ver" or "hor" */ | |
3598 { | |
3599 if (n == 0) | |
3600 return (char_u *)N_("E549: Illegal percentage"); | |
3601 if (round == 2) | |
3602 { | |
3603 if (TOLOWER_ASC(i) == 'v') | |
3604 shape_table[idx].shape = SHAPE_VER; | |
3605 else | |
3606 shape_table[idx].shape = SHAPE_HOR; | |
3607 shape_table[idx].percentage = n; | |
3608 } | |
3609 } | |
3610 else if (round == 2) | |
3611 { | |
3612 if (len == 9) | |
3613 shape_table[idx].blinkwait = n; | |
3614 else if (len == 7) | |
3615 shape_table[idx].blinkon = n; | |
3616 else | |
3617 shape_table[idx].blinkoff = n; | |
3618 } | |
3619 } | |
3620 else if (STRNICMP(p, "block", 5) == 0) | |
3621 { | |
3622 if (round == 2) | |
3623 shape_table[idx].shape = SHAPE_BLOCK; | |
3624 p += 5; | |
3625 } | |
3626 else /* must be a highlight group name then */ | |
3627 { | |
3628 endp = vim_strchr(p, '-'); | |
3629 if (commap == NULL) /* last part */ | |
3630 { | |
3631 if (endp == NULL) | |
3632 endp = p + STRLEN(p); /* find end of part */ | |
3633 } | |
3634 else if (endp > commap || endp == NULL) | |
3635 endp = commap; | |
3636 slashp = vim_strchr(p, '/'); | |
3637 if (slashp != NULL && slashp < endp) | |
3638 { | |
3639 /* "group/langmap_group" */ | |
3640 i = syn_check_group(p, (int)(slashp - p)); | |
3641 p = slashp + 1; | |
3642 } | |
3643 if (round == 2) | |
3644 { | |
3645 shape_table[idx].id = syn_check_group(p, | |
3646 (int)(endp - p)); | |
3647 shape_table[idx].id_lm = shape_table[idx].id; | |
3648 if (slashp != NULL && slashp < endp) | |
3649 shape_table[idx].id = i; | |
3650 } | |
3651 p = endp; | |
3652 } | |
3653 } /* if (what != SHAPE_MOUSE) */ | |
3654 | |
3655 if (*p == '-') | |
3656 ++p; | |
3657 } | |
3658 } | |
3659 modep = p; | |
3660 if (*modep == ',') | |
3661 ++modep; | |
3662 } | |
3663 } | |
3664 | |
3665 /* If the 's' flag is not given, use the 'v' cursor for 's' */ | |
3666 if (!found_ve) | |
3667 { | |
3668 #ifdef FEAT_MOUSESHAPE | |
3669 if (what == SHAPE_MOUSE) | |
3670 { | |
3671 shape_table[SHAPE_IDX_VE].mshape = shape_table[SHAPE_IDX_V].mshape; | |
3672 } | |
3673 else | |
3674 #endif | |
3675 { | |
3676 shape_table[SHAPE_IDX_VE].shape = shape_table[SHAPE_IDX_V].shape; | |
3677 shape_table[SHAPE_IDX_VE].percentage = | |
3678 shape_table[SHAPE_IDX_V].percentage; | |
3679 shape_table[SHAPE_IDX_VE].blinkwait = | |
3680 shape_table[SHAPE_IDX_V].blinkwait; | |
3681 shape_table[SHAPE_IDX_VE].blinkon = | |
3682 shape_table[SHAPE_IDX_V].blinkon; | |
3683 shape_table[SHAPE_IDX_VE].blinkoff = | |
3684 shape_table[SHAPE_IDX_V].blinkoff; | |
3685 shape_table[SHAPE_IDX_VE].id = shape_table[SHAPE_IDX_V].id; | |
3686 shape_table[SHAPE_IDX_VE].id_lm = shape_table[SHAPE_IDX_V].id_lm; | |
3687 } | |
3688 } | |
3689 | |
3690 return NULL; | |
3691 } | |
3692 | |
500 | 3693 # if defined(MCH_CURSOR_SHAPE) || defined(FEAT_GUI) \ |
3694 || defined(FEAT_MOUSESHAPE) || defined(PROTO) | |
7 | 3695 /* |
3696 * Return the index into shape_table[] for the current mode. | |
3697 * When "mouse" is TRUE, consider indexes valid for the mouse pointer. | |
3698 */ | |
3699 int | |
3700 get_shape_idx(mouse) | |
3701 int mouse; | |
3702 { | |
3703 #ifdef FEAT_MOUSESHAPE | |
3704 if (mouse && (State == HITRETURN || State == ASKMORE)) | |
3705 { | |
3706 # ifdef FEAT_GUI | |
87 | 3707 int x, y; |
3708 gui_mch_getmouse(&x, &y); | |
3709 if (Y_2_ROW(y) == Rows - 1) | |
7 | 3710 return SHAPE_IDX_MOREL; |
3711 # endif | |
3712 return SHAPE_IDX_MORE; | |
3713 } | |
3714 if (mouse && drag_status_line) | |
3715 return SHAPE_IDX_SDRAG; | |
3716 # ifdef FEAT_VERTSPLIT | |
3717 if (mouse && drag_sep_line) | |
3718 return SHAPE_IDX_VDRAG; | |
3719 # endif | |
3720 #endif | |
3721 if (!mouse && State == SHOWMATCH) | |
3722 return SHAPE_IDX_SM; | |
3723 #ifdef FEAT_VREPLACE | |
3724 if (State & VREPLACE_FLAG) | |
3725 return SHAPE_IDX_R; | |
3726 #endif | |
3727 if (State & REPLACE_FLAG) | |
3728 return SHAPE_IDX_R; | |
3729 if (State & INSERT) | |
3730 return SHAPE_IDX_I; | |
3731 if (State & CMDLINE) | |
3732 { | |
3733 if (cmdline_at_end()) | |
3734 return SHAPE_IDX_C; | |
3735 if (cmdline_overstrike()) | |
3736 return SHAPE_IDX_CR; | |
3737 return SHAPE_IDX_CI; | |
3738 } | |
3739 if (finish_op) | |
3740 return SHAPE_IDX_O; | |
3741 #ifdef FEAT_VISUAL | |
3742 if (VIsual_active) | |
3743 { | |
3744 if (*p_sel == 'e') | |
3745 return SHAPE_IDX_VE; | |
3746 else | |
3747 return SHAPE_IDX_V; | |
3748 } | |
3749 #endif | |
3750 return SHAPE_IDX_N; | |
3751 } | |
500 | 3752 #endif |
7 | 3753 |
3754 # if defined(FEAT_MOUSESHAPE) || defined(PROTO) | |
3755 static int old_mouse_shape = 0; | |
3756 | |
3757 /* | |
3758 * Set the mouse shape: | |
3759 * If "shape" is -1, use shape depending on the current mode, | |
3760 * depending on the current state. | |
3761 * If "shape" is -2, only update the shape when it's CLINE or STATUS (used | |
3762 * when the mouse moves off the status or command line). | |
3763 */ | |
3764 void | |
3765 update_mouseshape(shape_idx) | |
3766 int shape_idx; | |
3767 { | |
3768 int new_mouse_shape; | |
3769 | |
3770 /* Only works in GUI mode. */ | |
227 | 3771 if (!gui.in_use || gui.starting) |
7 | 3772 return; |
3773 | |
3774 /* Postpone the updating when more is to come. Speeds up executing of | |
3775 * mappings. */ | |
3776 if (shape_idx == -1 && char_avail()) | |
3777 { | |
3778 postponed_mouseshape = TRUE; | |
3779 return; | |
3780 } | |
3781 | |
864 | 3782 /* When ignoring the mouse don't change shape on the statusline. */ |
3783 if (*p_mouse == NUL | |
3784 && (shape_idx == SHAPE_IDX_CLINE | |
3785 || shape_idx == SHAPE_IDX_STATUS | |
3786 || shape_idx == SHAPE_IDX_VSEP)) | |
3787 shape_idx = -2; | |
3788 | |
7 | 3789 if (shape_idx == -2 |
3790 && old_mouse_shape != shape_table[SHAPE_IDX_CLINE].mshape | |
3791 && old_mouse_shape != shape_table[SHAPE_IDX_STATUS].mshape | |
3792 && old_mouse_shape != shape_table[SHAPE_IDX_VSEP].mshape) | |
3793 return; | |
3794 if (shape_idx < 0) | |
3795 new_mouse_shape = shape_table[get_shape_idx(TRUE)].mshape; | |
3796 else | |
3797 new_mouse_shape = shape_table[shape_idx].mshape; | |
3798 if (new_mouse_shape != old_mouse_shape) | |
3799 { | |
3800 mch_set_mouse_shape(new_mouse_shape); | |
3801 old_mouse_shape = new_mouse_shape; | |
3802 } | |
3803 postponed_mouseshape = FALSE; | |
3804 } | |
3805 # endif | |
3806 | |
3807 #endif /* CURSOR_SHAPE */ | |
3808 | |
3809 | |
3810 #ifdef FEAT_CRYPT | |
3811 /* | |
1209 | 3812 * Optional encryption support. |
7 | 3813 * Mohsin Ahmed, mosh@sasi.com, 98-09-24 |
3814 * Based on zip/crypt sources. | |
3815 * | |
3816 * NOTE FOR USA: Since 2000 exporting this code from the USA is allowed to | |
3817 * most countries. There are a few exceptions, but that still should not be a | |
3818 * 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
|
3819 * |
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
3820 * 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
|
3821 * 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
|
3822 * 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
|
3823 * and sha256 by Christophe Devine. |
7 | 3824 */ |
3825 | |
3826 /* from zip.h */ | |
3827 | |
3828 typedef unsigned short ush; /* unsigned 16-bit value */ | |
3829 typedef unsigned long ulg; /* unsigned 32-bit value */ | |
3830 | |
3831 static void make_crc_tab __ARGS((void)); | |
3832 | |
297 | 3833 static ulg crc_32_tab[256]; |
7 | 3834 |
3835 /* | |
3836 * Fill the CRC table. | |
3837 */ | |
3838 static void | |
3839 make_crc_tab() | |
3840 { | |
3841 ulg s,t,v; | |
3842 static int done = FALSE; | |
3843 | |
3844 if (done) | |
3845 return; | |
3846 for (t = 0; t < 256; t++) | |
3847 { | |
3848 v = t; | |
3849 for (s = 0; s < 8; s++) | |
3850 v = (v >> 1) ^ ((v & 1) * (ulg)0xedb88320L); | |
3851 crc_32_tab[t] = v; | |
3852 } | |
3853 done = TRUE; | |
3854 } | |
3855 | |
3856 #define CRC32(c, b) (crc_32_tab[((int)(c) ^ (b)) & 0xff] ^ ((c) >> 8)) | |
3857 | |
3858 static ulg keys[3]; /* keys defining the pseudo-random sequence */ | |
3859 | |
3860 /* | |
2244 | 3861 * Return the next byte in the pseudo-random sequence. |
7 | 3862 */ |
2244 | 3863 #define DECRYPT_BYTE_ZIP(t) { \ |
3864 ush temp; \ | |
3865 \ | |
3866 temp = (ush)keys[2] | 2; \ | |
3970 | 3867 t = (int)(((unsigned)(temp * (temp ^ 1U)) >> 8) & 0xff); \ |
2244 | 3868 } |
3869 | |
3870 /* | |
3871 * Update the encryption keys with the next byte of plain text. | |
3872 */ | |
3873 #define UPDATE_KEYS_ZIP(c) { \ | |
3874 keys[0] = CRC32(keys[0], (c)); \ | |
3875 keys[1] += keys[0] & 0xff; \ | |
3876 keys[1] = keys[1] * 134775813L + 1; \ | |
3877 keys[2] = CRC32(keys[2], (int)(keys[1] >> 24)); \ | |
7 | 3878 } |
3879 | |
2267 | 3880 static int crypt_busy = 0; |
3881 static ulg saved_keys[3]; | |
3882 static int saved_crypt_method; | |
3883 | |
3884 /* | |
2360
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3885 * 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
|
3886 * 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
|
3887 * 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
|
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 int |
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3890 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
|
3891 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
|
3892 { |
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3893 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
|
3894 } |
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3895 |
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3896 /* |
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3897 * 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
|
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 int |
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3900 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
|
3901 buf_T *buf; |
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3902 { |
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3903 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
|
3904 } |
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3905 |
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3906 /* |
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3907 * 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
|
3908 * 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
|
3909 */ |
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3910 void |
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3911 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
|
3912 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
|
3913 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
|
3914 { |
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3915 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
|
3916 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
|
3917 } |
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3918 |
d8e4b27cef80
Change 'cryptmethod' from a number to a string option. Make it global-local.
Bram Moolenaar <bram@vim.org>
parents:
2267
diff
changeset
|
3919 /* |
2267 | 3920 * Prepare for initializing encryption. If already doing encryption then save |
3921 * the state. | |
2545
298d8d6e69be
Avoid warnings from the clang compiler. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2522
diff
changeset
|
3922 * Must always be called symmetrically with crypt_pop_state(). |
2267 | 3923 */ |
3924 void | |
3925 crypt_push_state() | |
3926 { | |
3927 if (crypt_busy == 1) | |
3928 { | |
3929 /* save the state */ | |
3930 if (use_crypt_method == 0) | |
3931 { | |
3932 saved_keys[0] = keys[0]; | |
3933 saved_keys[1] = keys[1]; | |
3934 saved_keys[2] = keys[2]; | |
3935 } | |
3936 else | |
3937 bf_crypt_save(); | |
3938 saved_crypt_method = use_crypt_method; | |
3939 } | |
3940 else if (crypt_busy > 1) | |
3941 EMSG2(_(e_intern2), "crypt_push_state()"); | |
3942 ++crypt_busy; | |
3943 } | |
3944 | |
3945 /* | |
3946 * End encryption. If doing encryption before crypt_push_state() then restore | |
3947 * the saved state. | |
2545
298d8d6e69be
Avoid warnings from the clang compiler. (Dominique Pelle)
Bram Moolenaar <bram@vim.org>
parents:
2522
diff
changeset
|
3948 * Must always be called symmetrically with crypt_push_state(). |
2267 | 3949 */ |
3950 void | |
3951 crypt_pop_state() | |
3952 { | |
3953 --crypt_busy; | |
3954 if (crypt_busy == 1) | |
3955 { | |
3956 use_crypt_method = saved_crypt_method; | |
3957 if (use_crypt_method == 0) | |
3958 { | |
3959 keys[0] = saved_keys[0]; | |
3960 keys[1] = saved_keys[1]; | |
3961 keys[2] = saved_keys[2]; | |
3962 } | |
3963 else | |
3964 bf_crypt_restore(); | |
3965 } | |
3966 } | |
3967 | |
7 | 3968 /* |
2244 | 3969 * Encrypt "from[len]" into "to[len]". |
3970 * "from" and "to" can be equal to encrypt in place. | |
7 | 3971 */ |
2180
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
3972 void |
2244 | 3973 crypt_encode(from, len, to) |
3974 char_u *from; | |
3975 size_t len; | |
3976 char_u *to; | |
7 | 3977 { |
2244 | 3978 size_t i; |
3979 int ztemp, t; | |
3980 | |
3981 if (use_crypt_method == 0) | |
3982 for (i = 0; i < len; ++i) | |
3983 { | |
3984 ztemp = from[i]; | |
3985 DECRYPT_BYTE_ZIP(t); | |
3986 UPDATE_KEYS_ZIP(ztemp); | |
3987 to[i] = t ^ ztemp; | |
3988 } | |
2180
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
3989 else |
2245
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
3990 bf_crypt_encode(from, len, to); |
2244 | 3991 } |
3992 | |
3993 /* | |
3994 * Decrypt "ptr[len]" in place. | |
3995 */ | |
3996 void | |
3997 crypt_decode(ptr, len) | |
3998 char_u *ptr; | |
3999 long len; | |
4000 { | |
4001 char_u *p; | |
4002 | |
4003 if (use_crypt_method == 0) | |
4004 for (p = ptr; p < ptr + len; ++p) | |
4005 { | |
4006 ush temp; | |
4007 | |
4008 temp = (ush)keys[2] | 2; | |
3970 | 4009 temp = (int)(((unsigned)(temp * (temp ^ 1U)) >> 8) & 0xff); |
2244 | 4010 UPDATE_KEYS_ZIP(*p ^= temp); |
4011 } | |
4012 else | |
2245
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4013 bf_crypt_decode(ptr, len); |
7 | 4014 } |
4015 | |
4016 /* | |
4017 * Initialize the encryption keys and the random header according to | |
4018 * the given password. | |
4019 * If "passwd" is NULL or empty, don't do anything. | |
4020 */ | |
4021 void | |
4022 crypt_init_keys(passwd) | |
4023 char_u *passwd; /* password string with which to modify keys */ | |
4024 { | |
4025 if (passwd != NULL && *passwd != NUL) | |
4026 { | |
2244 | 4027 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
|
4028 { |
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4029 char_u *p; |
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4030 |
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4031 make_crc_tab(); |
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4032 keys[0] = 305419896L; |
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4033 keys[1] = 591751049L; |
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4034 keys[2] = 878082192L; |
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4035 for (p = passwd; *p!= NUL; ++p) |
2244 | 4036 { |
2245
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4037 UPDATE_KEYS_ZIP((int)*p); |
2244 | 4038 } |
2245
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4039 } |
2244 | 4040 else |
2245
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
4041 bf_crypt_init_keys(passwd); |
7 | 4042 } |
4043 } | |
4044 | |
4045 /* | |
2180
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4046 * 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
|
4047 * in memory anywhere. |
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4048 */ |
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4049 void |
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4050 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
|
4051 char_u *key; |
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4052 { |
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4053 char_u *p; |
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 if (key != NULL) |
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4056 { |
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4057 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
|
4058 *p = 0; |
2180
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4059 vim_free(key); |
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4060 } |
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4061 } |
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4062 |
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4063 /* |
7 | 4064 * 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
|
4065 * When "store" is TRUE, the new key is stored in the 'key' option, and the |
7 | 4066 * 'key' option value is returned: Don't free it. |
4067 * When "store" is FALSE, the typed key is returned in allocated memory. | |
4068 * Returns NULL on failure. | |
4069 */ | |
4070 char_u * | |
4071 get_crypt_key(store, twice) | |
4072 int store; | |
4073 int twice; /* Ask for the key twice. */ | |
4074 { | |
4075 char_u *p1, *p2 = NULL; | |
4076 int round; | |
4077 | |
4078 for (round = 0; ; ++round) | |
4079 { | |
4080 cmdline_star = TRUE; | |
4081 cmdline_row = msg_row; | |
4082 p1 = getcmdline_prompt(NUL, round == 0 | |
4083 ? (char_u *)_("Enter encryption key: ") | |
531 | 4084 : (char_u *)_("Enter same key again: "), 0, EXPAND_NOTHING, |
4085 NULL); | |
7 | 4086 cmdline_star = FALSE; |
4087 | |
4088 if (p1 == NULL) | |
4089 break; | |
4090 | |
4091 if (round == twice) | |
4092 { | |
4093 if (p2 != NULL && STRCMP(p1, p2) != 0) | |
4094 { | |
4095 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
|
4096 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
|
4097 free_crypt_key(p2); |
7 | 4098 p2 = NULL; |
4099 round = -1; /* do it again */ | |
4100 continue; | |
4101 } | |
2180
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4102 |
7 | 4103 if (store) |
4104 { | |
4105 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
|
4106 free_crypt_key(p1); |
7 | 4107 p1 = curbuf->b_p_key; |
4108 } | |
4109 break; | |
4110 } | |
4111 p2 = p1; | |
4112 } | |
4113 | |
4114 /* since the user typed this, no need to wait for return */ | |
2267 | 4115 if (msg_didout) |
4116 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
|
4117 need_wait_return = FALSE; |
7 | 4118 msg_didout = FALSE; |
4119 | |
2180
f60a0c9cbe6c
Add the blowfish encryption patch from Mohsin Ahmed. Needs more work.
Bram Moolenaar <bram@vim.org>
parents:
2178
diff
changeset
|
4120 free_crypt_key(p2); |
7 | 4121 return p1; |
4122 } | |
4123 | |
4124 #endif /* FEAT_CRYPT */ | |
4125 | |
4126 /* TODO: make some #ifdef for this */ | |
4127 /*--------[ file searching ]-------------------------------------------------*/ | |
4128 /* | |
4129 * File searching functions for 'path', 'tags' and 'cdpath' options. | |
4130 * External visible functions: | |
4131 * vim_findfile_init() creates/initialises the search context | |
4132 * vim_findfile_free_visited() free list of visited files/dirs of search | |
4133 * context | |
4134 * vim_findfile() find a file in the search context | |
4135 * vim_findfile_cleanup() cleanup/free search context created by | |
4136 * vim_findfile_init() | |
4137 * | |
4138 * All static functions and variables start with 'ff_' | |
4139 * | |
4140 * In general it works like this: | |
4141 * First you create yourself a search context by calling vim_findfile_init(). | |
4142 * It is possible to give a search context from a previous call to | |
4143 * vim_findfile_init(), so it can be reused. After this you call vim_findfile() | |
4144 * until you are satisfied with the result or it returns NULL. On every call it | |
4145 * returns the next file which matches the conditions given to | |
4146 * vim_findfile_init(). If it doesn't find a next file it returns NULL. | |
4147 * | |
4148 * It is possible to call vim_findfile_init() again to reinitialise your search | |
4149 * with some new parameters. Don't forget to pass your old search context to | |
4150 * it, so it can reuse it and especially reuse the list of already visited | |
4151 * directories. If you want to delete the list of already visited directories | |
4152 * simply call vim_findfile_free_visited(). | |
4153 * | |
4154 * When you are done call vim_findfile_cleanup() to free the search context. | |
4155 * | |
4156 * The function vim_findfile_init() has a long comment, which describes the | |
4157 * needed parameters. | |
4158 * | |
4159 * | |
4160 * | |
4161 * ATTENTION: | |
4162 * ========== | |
1072 | 4163 * Also we use an allocated search context here, this functions are NOT |
7 | 4164 * thread-safe!!!!! |
4165 * | |
4166 * To minimize parameter passing (or because I'm to lazy), only the | |
4167 * external visible functions get a search context as a parameter. This is | |
4168 * then assigned to a static global, which is used throughout the local | |
4169 * functions. | |
4170 */ | |
4171 | |
4172 /* | |
4173 * type for the directory search stack | |
4174 */ | |
4175 typedef struct ff_stack | |
4176 { | |
4177 struct ff_stack *ffs_prev; | |
4178 | |
4179 /* the fix part (no wildcards) and the part containing the wildcards | |
4180 * of the search path | |
4181 */ | |
4182 char_u *ffs_fix_path; | |
4183 #ifdef FEAT_PATH_EXTRA | |
4184 char_u *ffs_wc_path; | |
4185 #endif | |
4186 | |
4187 /* files/dirs found in the above directory, matched by the first wildcard | |
4188 * of wc_part | |
4189 */ | |
4190 char_u **ffs_filearray; | |
4191 int ffs_filearray_size; | |
4192 char_u ffs_filearray_cur; /* needed for partly handled dirs */ | |
4193 | |
4194 /* to store status of partly handled directories | |
1541 | 4195 * 0: we work on this directory for the first time |
7 | 4196 * 1: this directory was partly searched in an earlier step |
1541 | 4197 */ |
7 | 4198 int ffs_stage; |
4199 | |
4200 /* How deep are we in the directory tree? | |
4201 * Counts backward from value of level parameter to vim_findfile_init | |
4202 */ | |
4203 int ffs_level; | |
4204 | |
4205 /* Did we already expand '**' to an empty string? */ | |
4206 int ffs_star_star_empty; | |
4207 } ff_stack_T; | |
4208 | |
4209 /* | |
4210 * type for already visited directories or files. | |
4211 */ | |
4212 typedef struct ff_visited | |
4213 { | |
4214 struct ff_visited *ffv_next; | |
4215 | |
4216 #ifdef FEAT_PATH_EXTRA | |
4217 /* Visited directories are different if the wildcard string are | |
4218 * different. So we have to save it. | |
4219 */ | |
4220 char_u *ffv_wc_path; | |
4221 #endif | |
4222 /* for unix use inode etc for comparison (needed because of links), else | |
4223 * use filename. | |
4224 */ | |
4225 #ifdef UNIX | |
1881 | 4226 int ffv_dev_valid; /* ffv_dev and ffv_ino were set */ |
4227 dev_t ffv_dev; /* device number */ | |
7 | 4228 ino_t ffv_ino; /* inode number */ |
4229 #endif | |
4230 /* The memory for this struct is allocated according to the length of | |
4231 * ffv_fname. | |
4232 */ | |
4233 char_u ffv_fname[1]; /* actually longer */ | |
4234 } ff_visited_T; | |
4235 | |
4236 /* | |
4237 * We might have to manage several visited lists during a search. | |
1209 | 4238 * This is especially needed for the tags option. If tags is set to: |
7 | 4239 * "./++/tags,./++/TAGS,++/tags" (replace + with *) |
4240 * So we have to do 3 searches: | |
4241 * 1) search from the current files directory downward for the file "tags" | |
4242 * 2) search from the current files directory downward for the file "TAGS" | |
4243 * 3) search from Vims current directory downwards for the file "tags" | |
4244 * As you can see, the first and the third search are for the same file, so for | |
4245 * the third search we can use the visited list of the first search. For the | |
4246 * second search we must start from a empty visited list. | |
4247 * The struct ff_visited_list_hdr is used to manage a linked list of already | |
4248 * visited lists. | |
4249 */ | |
4250 typedef struct ff_visited_list_hdr | |
4251 { | |
4252 struct ff_visited_list_hdr *ffvl_next; | |
4253 | |
4254 /* the filename the attached visited list is for */ | |
4255 char_u *ffvl_filename; | |
4256 | |
4257 ff_visited_T *ffvl_visited_list; | |
4258 | |
4259 } ff_visited_list_hdr_T; | |
4260 | |
4261 | |
4262 /* | |
4263 * '**' can be expanded to several directory levels. | |
1209 | 4264 * Set the default maximum depth. |
7 | 4265 */ |
4266 #define FF_MAX_STAR_STAR_EXPAND ((char_u)30) | |
1541 | 4267 |
7 | 4268 /* |
4269 * The search context: | |
4270 * ffsc_stack_ptr: the stack for the dirs to search | |
4271 * ffsc_visited_list: the currently active visited list | |
4272 * ffsc_dir_visited_list: the currently active visited list for search dirs | |
4273 * ffsc_visited_lists_list: the list of all visited lists | |
4274 * ffsc_dir_visited_lists_list: the list of all visited lists for search dirs | |
4275 * ffsc_file_to_search: the file to search for | |
4276 * ffsc_start_dir: the starting directory, if search path was relative | |
4277 * ffsc_fix_path: the fix part of the given path (without wildcards) | |
4278 * Needed for upward search. | |
4279 * ffsc_wc_path: the part of the given path containing wildcards | |
4280 * ffsc_level: how many levels of dirs to search downwards | |
4281 * ffsc_stopdirs_v: array of stop directories for upward search | |
1541 | 4282 * 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
|
4283 * ffsc_tagfile: searching for tags file, don't use 'suffixesadd' |
7 | 4284 */ |
4285 typedef struct ff_search_ctx_T | |
4286 { | |
4287 ff_stack_T *ffsc_stack_ptr; | |
4288 ff_visited_list_hdr_T *ffsc_visited_list; | |
4289 ff_visited_list_hdr_T *ffsc_dir_visited_list; | |
4290 ff_visited_list_hdr_T *ffsc_visited_lists_list; | |
4291 ff_visited_list_hdr_T *ffsc_dir_visited_lists_list; | |
4292 char_u *ffsc_file_to_search; | |
4293 char_u *ffsc_start_dir; | |
4294 char_u *ffsc_fix_path; | |
4295 #ifdef FEAT_PATH_EXTRA | |
4296 char_u *ffsc_wc_path; | |
4297 int ffsc_level; | |
4298 char_u **ffsc_stopdirs_v; | |
4299 #endif | |
1541 | 4300 int ffsc_find_what; |
2521
d890c820722f
Fix: 'suffixesadd' was used for finding tags file.
Bram Moolenaar <bram@vim.org>
parents:
2520
diff
changeset
|
4301 int ffsc_tagfile; |
359 | 4302 } ff_search_ctx_T; |
4303 | |
7 | 4304 /* locally needed functions */ |
4305 #ifdef FEAT_PATH_EXTRA | |
4306 static int ff_check_visited __ARGS((ff_visited_T **, char_u *, char_u *)); | |
4307 #else | |
4308 static int ff_check_visited __ARGS((ff_visited_T **, char_u *)); | |
4309 #endif | |
4310 static void vim_findfile_free_visited_list __ARGS((ff_visited_list_hdr_T **list_headp)); | |
4311 static void ff_free_visited_list __ARGS((ff_visited_T *vl)); | |
4312 static ff_visited_list_hdr_T* ff_get_visited_list __ARGS((char_u *, ff_visited_list_hdr_T **list_headp)); | |
4313 #ifdef FEAT_PATH_EXTRA | |
4314 static int ff_wc_equal __ARGS((char_u *s1, char_u *s2)); | |
4315 #endif | |
4316 | |
1541 | 4317 static void ff_push __ARGS((ff_search_ctx_T *search_ctx, ff_stack_T *stack_ptr)); |
4318 static ff_stack_T *ff_pop __ARGS((ff_search_ctx_T *search_ctx)); | |
4319 static void ff_clear __ARGS((ff_search_ctx_T *search_ctx)); | |
4320 static void ff_free_stack_element __ARGS((ff_stack_T *stack_ptr)); | |
7 | 4321 #ifdef FEAT_PATH_EXTRA |
4322 static ff_stack_T *ff_create_stack_element __ARGS((char_u *, char_u *, int, int)); | |
4323 #else | |
4324 static ff_stack_T *ff_create_stack_element __ARGS((char_u *, int, int)); | |
4325 #endif | |
4326 #ifdef FEAT_PATH_EXTRA | |
4327 static int ff_path_in_stoplist __ARGS((char_u *, int, char_u **)); | |
4328 #endif | |
4329 | |
3202 | 4330 static char_u e_pathtoolong[] = N_("E854: path too long for completion"); |
4331 | |
7 | 4332 #if 0 |
4333 /* | |
4334 * if someone likes findfirst/findnext, here are the functions | |
4335 * NOT TESTED!! | |
4336 */ | |
4337 | |
4338 static void *ff_fn_search_context = NULL; | |
4339 | |
4340 char_u * | |
4341 vim_findfirst(path, filename, level) | |
4342 char_u *path; | |
4343 char_u *filename; | |
4344 int level; | |
4345 { | |
4346 ff_fn_search_context = | |
4347 vim_findfile_init(path, filename, NULL, level, TRUE, FALSE, | |
4348 ff_fn_search_context, rel_fname); | |
4349 if (NULL == ff_fn_search_context) | |
4350 return NULL; | |
4351 else | |
4352 return vim_findnext() | |
4353 } | |
4354 | |
4355 char_u * | |
4356 vim_findnext() | |
4357 { | |
4358 char_u *ret = vim_findfile(ff_fn_search_context); | |
4359 | |
4360 if (NULL == ret) | |
4361 { | |
4362 vim_findfile_cleanup(ff_fn_search_context); | |
4363 ff_fn_search_context = NULL; | |
4364 } | |
4365 return ret; | |
4366 } | |
4367 #endif | |
4368 | |
4369 /* | |
2522
d7ecfc8b784c
Update help about wildcards in 'tags' option.
Bram Moolenaar <bram@vim.org>
parents:
2521
diff
changeset
|
4370 * Initialization routine for vim_findfile(). |
7 | 4371 * |
2211
dded7e33d0a9
Fix wrong memory access when clearing crypt key.
Bram Moolenaar <bram@vim.org>
parents:
2180
diff
changeset
|
4372 * Returns the newly allocated search context or NULL if an error occurred. |
7 | 4373 * |
4374 * Don't forget to clean up by calling vim_findfile_cleanup() if you are done | |
4375 * with the search context. | |
4376 * | |
4377 * Find the file 'filename' in the directory 'path'. | |
4378 * The parameter 'path' may contain wildcards. If so only search 'level' | |
4379 * directories deep. The parameter 'level' is the absolute maximum and is | |
4380 * not related to restricts given to the '**' wildcard. If 'level' is 100 | |
4381 * and you use '**200' vim_findfile() will stop after 100 levels. | |
4382 * | |
1541 | 4383 * 'filename' cannot contain wildcards! It is used as-is, no backslashes to |
4384 * escape special characters. | |
4385 * | |
7 | 4386 * If 'stopdirs' is not NULL and nothing is found downward, the search is |
4387 * restarted on the next higher directory level. This is repeated until the | |
4388 * start-directory of a search is contained in 'stopdirs'. 'stopdirs' has the | |
4389 * format ";*<dirname>*\(;<dirname>\)*;\=$". | |
4390 * | |
4391 * If the 'path' is relative, the starting dir for the search is either VIM's | |
4392 * 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
|
4393 * If the 'path' is absolute, the starting dir is that part of the path before |
7 | 4394 * the first wildcard. |
4395 * | |
4396 * Upward search is only done on the starting dir. | |
4397 * | |
4398 * If 'free_visited' is TRUE the list of already visited files/directories is | |
4399 * cleared. Set this to FALSE if you just want to search from another | |
4400 * directory, but want to be sure that no directory from a previous search is | |
4401 * searched again. This is useful if you search for a file at different places. | |
4402 * The list of visited files/dirs can also be cleared with the function | |
4403 * vim_findfile_free_visited(). | |
4404 * | |
1541 | 4405 * Set the parameter 'find_what' to FINDFILE_DIR if you want to search for |
4406 * directories only, FINDFILE_FILE for files only, FINDFILE_BOTH for both. | |
7 | 4407 * |
4408 * A search context returned by a previous call to vim_findfile_init() can be | |
1541 | 4409 * passed in the parameter "search_ctx_arg". This context is reused and |
4410 * reinitialized with the new parameters. The list of already visited | |
7 | 4411 * directories from this context is only deleted if the parameter |
1541 | 4412 * "free_visited" is true. Be aware that the passed "search_ctx_arg" is freed |
4413 * if the reinitialization fails. | |
7 | 4414 * |
1541 | 4415 * If you don't have a search context from a previous call "search_ctx_arg" |
4416 * must be NULL. | |
7 | 4417 * |
4418 * This function silently ignores a few errors, vim_findfile() will have | |
4419 * limited functionality then. | |
4420 */ | |
4421 void * | |
1541 | 4422 vim_findfile_init(path, filename, stopdirs, level, free_visited, find_what, |
4423 search_ctx_arg, tagfile, rel_fname) | |
7 | 4424 char_u *path; |
4425 char_u *filename; | |
1881 | 4426 char_u *stopdirs UNUSED; |
7 | 4427 int level; |
4428 int free_visited; | |
1541 | 4429 int find_what; |
4430 void *search_ctx_arg; | |
2521
d890c820722f
Fix: 'suffixesadd' was used for finding tags file.
Bram Moolenaar <bram@vim.org>
parents:
2520
diff
changeset
|
4431 int tagfile; /* expanding names of tags files */ |
7 | 4432 char_u *rel_fname; /* file name to use for "." */ |
4433 { | |
4434 #ifdef FEAT_PATH_EXTRA | |
1541 | 4435 char_u *wc_part; |
4436 #endif | |
4437 ff_stack_T *sptr; | |
4438 ff_search_ctx_T *search_ctx; | |
7 | 4439 |
4440 /* If a search context is given by the caller, reuse it, else allocate a | |
4441 * new one. | |
4442 */ | |
1541 | 4443 if (search_ctx_arg != NULL) |
4444 search_ctx = search_ctx_arg; | |
7 | 4445 else |
4446 { | |
1541 | 4447 search_ctx = (ff_search_ctx_T*)alloc((unsigned)sizeof(ff_search_ctx_T)); |
4448 if (search_ctx == NULL) | |
7 | 4449 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
|
4450 vim_memset(search_ctx, 0, sizeof(ff_search_ctx_T)); |
7 | 4451 } |
1541 | 4452 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
|
4453 search_ctx->ffsc_tagfile = tagfile; |
7 | 4454 |
4455 /* clear the search context, but NOT the visited lists */ | |
1541 | 4456 ff_clear(search_ctx); |
7 | 4457 |
4458 /* clear visited list if wanted */ | |
4459 if (free_visited == TRUE) | |
1541 | 4460 vim_findfile_free_visited(search_ctx); |
7 | 4461 else |
4462 { | |
4463 /* Reuse old visited lists. Get the visited list for the given | |
4464 * filename. If no list for the current filename exists, creates a new | |
1541 | 4465 * one. */ |
4466 search_ctx->ffsc_visited_list = ff_get_visited_list(filename, | |
4467 &search_ctx->ffsc_visited_lists_list); | |
4468 if (search_ctx->ffsc_visited_list == NULL) | |
7 | 4469 goto error_return; |
1541 | 4470 search_ctx->ffsc_dir_visited_list = ff_get_visited_list(filename, |
4471 &search_ctx->ffsc_dir_visited_lists_list); | |
4472 if (search_ctx->ffsc_dir_visited_list == NULL) | |
7 | 4473 goto error_return; |
4474 } | |
4475 | |
4476 if (ff_expand_buffer == NULL) | |
4477 { | |
4478 ff_expand_buffer = (char_u*)alloc(MAXPATHL); | |
4479 if (ff_expand_buffer == NULL) | |
4480 goto error_return; | |
4481 } | |
4482 | |
4483 /* Store information on starting dir now if path is relative. | |
20 | 4484 * If path is absolute, we do that later. */ |
7 | 4485 if (path[0] == '.' |
4486 && (vim_ispathsep(path[1]) || path[1] == NUL) | |
4487 && (!tagfile || vim_strchr(p_cpo, CPO_DOTTAG) == NULL) | |
4488 && rel_fname != NULL) | |
4489 { | |
4490 int len = (int)(gettail(rel_fname) - rel_fname); | |
4491 | |
4492 if (!vim_isAbsName(rel_fname) && len + 1 < MAXPATHL) | |
4493 { | |
4494 /* Make the start dir an absolute path name. */ | |
418 | 4495 vim_strncpy(ff_expand_buffer, rel_fname, len); |
1541 | 4496 search_ctx->ffsc_start_dir = FullName_save(ff_expand_buffer, FALSE); |
7 | 4497 } |
4498 else | |
1541 | 4499 search_ctx->ffsc_start_dir = vim_strnsave(rel_fname, len); |
4500 if (search_ctx->ffsc_start_dir == NULL) | |
7 | 4501 goto error_return; |
4502 if (*++path != NUL) | |
4503 ++path; | |
4504 } | |
4505 else if (*path == NUL || !vim_isAbsName(path)) | |
4506 { | |
4507 #ifdef BACKSLASH_IN_FILENAME | |
4508 /* "c:dir" needs "c:" to be expanded, otherwise use current dir */ | |
4509 if (*path != NUL && path[1] == ':') | |
4510 { | |
4511 char_u drive[3]; | |
4512 | |
4513 drive[0] = path[0]; | |
4514 drive[1] = ':'; | |
4515 drive[2] = NUL; | |
4516 if (vim_FullName(drive, ff_expand_buffer, MAXPATHL, TRUE) == FAIL) | |
4517 goto error_return; | |
4518 path += 2; | |
4519 } | |
4520 else | |
4521 #endif | |
4522 if (mch_dirname(ff_expand_buffer, MAXPATHL) == FAIL) | |
4523 goto error_return; | |
4524 | |
1541 | 4525 search_ctx->ffsc_start_dir = vim_strsave(ff_expand_buffer); |
4526 if (search_ctx->ffsc_start_dir == NULL) | |
7 | 4527 goto error_return; |
4528 | |
4529 #ifdef BACKSLASH_IN_FILENAME | |
4530 /* A path that starts with "/dir" is relative to the drive, not to the | |
4531 * directory (but not for "//machine/dir"). Only use the drive name. */ | |
4532 if ((*path == '/' || *path == '\\') | |
4533 && path[1] != path[0] | |
1541 | 4534 && search_ctx->ffsc_start_dir[1] == ':') |
4535 search_ctx->ffsc_start_dir[2] = NUL; | |
7 | 4536 #endif |
4537 } | |
4538 | |
4539 #ifdef FEAT_PATH_EXTRA | |
4540 /* | |
4541 * If stopdirs are given, split them into an array of pointers. | |
4542 * If this fails (mem allocation), there is no upward search at all or a | |
4543 * stop directory is not recognized -> continue silently. | |
4544 * If stopdirs just contains a ";" or is empty, | |
1541 | 4545 * search_ctx->ffsc_stopdirs_v will only contain a NULL pointer. This |
7 | 4546 * is handled as unlimited upward search. See function |
4547 * ff_path_in_stoplist() for details. | |
4548 */ | |
4549 if (stopdirs != NULL) | |
4550 { | |
4551 char_u *walker = stopdirs; | |
4552 int dircount; | |
4553 | |
4554 while (*walker == ';') | |
4555 walker++; | |
4556 | |
4557 dircount = 1; | |
1541 | 4558 search_ctx->ffsc_stopdirs_v = |
4559 (char_u **)alloc((unsigned)sizeof(char_u *)); | |
4560 | |
4561 if (search_ctx->ffsc_stopdirs_v != NULL) | |
7 | 4562 { |
4563 do | |
4564 { | |
4565 char_u *helper; | |
4566 void *ptr; | |
4567 | |
4568 helper = walker; | |
1541 | 4569 ptr = vim_realloc(search_ctx->ffsc_stopdirs_v, |
7 | 4570 (dircount + 1) * sizeof(char_u *)); |
4571 if (ptr) | |
1541 | 4572 search_ctx->ffsc_stopdirs_v = ptr; |
7 | 4573 else |
4574 /* ignore, keep what we have and continue */ | |
4575 break; | |
4576 walker = vim_strchr(walker, ';'); | |
4577 if (walker) | |
4578 { | |
1541 | 4579 search_ctx->ffsc_stopdirs_v[dircount-1] = |
4580 vim_strnsave(helper, (int)(walker - helper)); | |
7 | 4581 walker++; |
4582 } | |
4583 else | |
4584 /* this might be "", which means ascent till top | |
4585 * of directory tree. | |
4586 */ | |
1541 | 4587 search_ctx->ffsc_stopdirs_v[dircount-1] = |
4588 vim_strsave(helper); | |
7 | 4589 |
4590 dircount++; | |
4591 | |
4592 } while (walker != NULL); | |
1541 | 4593 search_ctx->ffsc_stopdirs_v[dircount-1] = NULL; |
7 | 4594 } |
4595 } | |
4596 #endif | |
4597 | |
4598 #ifdef FEAT_PATH_EXTRA | |
1541 | 4599 search_ctx->ffsc_level = level; |
7 | 4600 |
4601 /* split into: | |
4602 * -fix path | |
4603 * -wildcard_stuff (might be NULL) | |
4604 */ | |
4605 wc_part = vim_strchr(path, '*'); | |
4606 if (wc_part != NULL) | |
4607 { | |
4608 int llevel; | |
4609 int len; | |
29 | 4610 char *errpt; |
7 | 4611 |
4612 /* save the fix part of the path */ | |
1541 | 4613 search_ctx->ffsc_fix_path = vim_strnsave(path, (int)(wc_part - path)); |
7 | 4614 |
4615 /* | |
4616 * copy wc_path and add restricts to the '**' wildcard. | |
1209 | 4617 * The octet after a '**' is used as a (binary) counter. |
7 | 4618 * So '**3' is transposed to '**^C' ('^C' is ASCII value 3) |
4619 * or '**76' is transposed to '**N'( 'N' is ASCII value 76). | |
4620 * For EBCDIC you get different character values. | |
4621 * If no restrict is given after '**' the default is used. | |
1993 | 4622 * Due to this technique the path looks awful if you print it as a |
7 | 4623 * string. |
4624 */ | |
4625 len = 0; | |
4626 while (*wc_part != NUL) | |
4627 { | |
3202 | 4628 if (len + 5 >= MAXPATHL) |
4629 { | |
4630 EMSG(_(e_pathtoolong)); | |
4631 break; | |
4632 } | |
7 | 4633 if (STRNCMP(wc_part, "**", 2) == 0) |
4634 { | |
4635 ff_expand_buffer[len++] = *wc_part++; | |
4636 ff_expand_buffer[len++] = *wc_part++; | |
4637 | |
29 | 4638 llevel = strtol((char *)wc_part, &errpt, 10); |
4639 if ((char_u *)errpt != wc_part && llevel > 0 && llevel < 255) | |
7 | 4640 ff_expand_buffer[len++] = llevel; |
29 | 4641 else if ((char_u *)errpt != wc_part && llevel == 0) |
7 | 4642 /* restrict is 0 -> remove already added '**' */ |
4643 len -= 2; | |
4644 else | |
4645 ff_expand_buffer[len++] = FF_MAX_STAR_STAR_EXPAND; | |
29 | 4646 wc_part = (char_u *)errpt; |
461 | 4647 if (*wc_part != NUL && !vim_ispathsep(*wc_part)) |
7 | 4648 { |
4649 EMSG2(_("E343: Invalid path: '**[number]' must be at the end of the path or be followed by '%s'."), PATHSEPSTR); | |
4650 goto error_return; | |
4651 } | |
4652 } | |
4653 else | |
4654 ff_expand_buffer[len++] = *wc_part++; | |
4655 } | |
4656 ff_expand_buffer[len] = NUL; | |
1541 | 4657 search_ctx->ffsc_wc_path = vim_strsave(ff_expand_buffer); |
4658 | |
4659 if (search_ctx->ffsc_wc_path == NULL) | |
7 | 4660 goto error_return; |
4661 } | |
4662 else | |
4663 #endif | |
1541 | 4664 search_ctx->ffsc_fix_path = vim_strsave(path); |
4665 | |
4666 if (search_ctx->ffsc_start_dir == NULL) | |
7 | 4667 { |
4668 /* store the fix part as startdir. | |
4669 * This is needed if the parameter path is fully qualified. | |
4670 */ | |
1541 | 4671 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
|
4672 if (search_ctx->ffsc_start_dir == NULL) |
04dae202d316
Fixes for coverity warnings.
Bram Moolenaar <bram@vim.org>
parents:
2409
diff
changeset
|
4673 goto error_return; |
04dae202d316
Fixes for coverity warnings.
Bram Moolenaar <bram@vim.org>
parents:
2409
diff
changeset
|
4674 search_ctx->ffsc_fix_path[0] = NUL; |
7 | 4675 } |
4676 | |
4677 /* create an absolute path */ | |
3202 | 4678 if (STRLEN(search_ctx->ffsc_start_dir) |
4679 + STRLEN(search_ctx->ffsc_fix_path) + 3 >= MAXPATHL) | |
4680 { | |
4681 EMSG(_(e_pathtoolong)); | |
4682 goto error_return; | |
4683 } | |
1541 | 4684 STRCPY(ff_expand_buffer, search_ctx->ffsc_start_dir); |
7 | 4685 add_pathsep(ff_expand_buffer); |
5108
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4686 { |
5124
6f24376028af
updated for version 7.3.1305
Bram Moolenaar <bram@vim.org>
parents:
5116
diff
changeset
|
4687 int eb_len = (int)STRLEN(ff_expand_buffer); |
6f24376028af
updated for version 7.3.1305
Bram Moolenaar <bram@vim.org>
parents:
5116
diff
changeset
|
4688 char_u *buf = alloc(eb_len |
6f24376028af
updated for version 7.3.1305
Bram Moolenaar <bram@vim.org>
parents:
5116
diff
changeset
|
4689 + (int)STRLEN(search_ctx->ffsc_fix_path) + 1); |
5108
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4690 |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4691 STRCPY(buf, ff_expand_buffer); |
5110
dafd77a15d44
updated for version 7.3.1298
Bram Moolenaar <bram@vim.org>
parents:
5108
diff
changeset
|
4692 STRCPY(buf + eb_len, search_ctx->ffsc_fix_path); |
5108
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4693 if (mch_isdir(buf)) |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4694 { |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4695 STRCAT(ff_expand_buffer, search_ctx->ffsc_fix_path); |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4696 add_pathsep(ff_expand_buffer); |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4697 } |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4698 #ifdef FEAT_PATH_EXTRA |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4699 else |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4700 { |
5116
6cabac58f26f
updated for version 7.3.1301
Bram Moolenaar <bram@vim.org>
parents:
5110
diff
changeset
|
4701 char_u *p = gettail(search_ctx->ffsc_fix_path); |
5571 | 4702 char_u *wc_path = NULL; |
4703 char_u *temp = NULL; | |
5108
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4704 int len = 0; |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4705 |
5116
6cabac58f26f
updated for version 7.3.1301
Bram Moolenaar <bram@vim.org>
parents:
5110
diff
changeset
|
4706 if (p > search_ctx->ffsc_fix_path) |
5108
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4707 { |
5124
6f24376028af
updated for version 7.3.1305
Bram Moolenaar <bram@vim.org>
parents:
5116
diff
changeset
|
4708 len = (int)(p - search_ctx->ffsc_fix_path) - 1; |
5108
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4709 STRNCAT(ff_expand_buffer, search_ctx->ffsc_fix_path, len); |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4710 add_pathsep(ff_expand_buffer); |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4711 } |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4712 else |
5124
6f24376028af
updated for version 7.3.1305
Bram Moolenaar <bram@vim.org>
parents:
5116
diff
changeset
|
4713 len = (int)STRLEN(search_ctx->ffsc_fix_path); |
5108
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4714 |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4715 if (search_ctx->ffsc_wc_path != NULL) |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4716 { |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4717 wc_path = vim_strsave(search_ctx->ffsc_wc_path); |
5124
6f24376028af
updated for version 7.3.1305
Bram Moolenaar <bram@vim.org>
parents:
5116
diff
changeset
|
4718 temp = alloc((int)(STRLEN(search_ctx->ffsc_wc_path) |
5151
d0288faf3086
updated for version 7.4a.002
Bram Moolenaar <bram@vim.org>
parents:
5124
diff
changeset
|
4719 + STRLEN(search_ctx->ffsc_fix_path + len) |
d0288faf3086
updated for version 7.4a.002
Bram Moolenaar <bram@vim.org>
parents:
5124
diff
changeset
|
4720 + 1)); |
5108
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4721 } |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4722 |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4723 if (temp == NULL || wc_path == NULL) |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4724 { |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4725 vim_free(buf); |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4726 vim_free(temp); |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4727 vim_free(wc_path); |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4728 goto error_return; |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4729 } |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4730 |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4731 STRCPY(temp, search_ctx->ffsc_fix_path + len); |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4732 STRCAT(temp, search_ctx->ffsc_wc_path); |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4733 vim_free(search_ctx->ffsc_wc_path); |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4734 vim_free(wc_path); |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4735 search_ctx->ffsc_wc_path = temp; |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4736 } |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4737 #endif |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4738 vim_free(buf); |
cb0a5c9c0f9b
updated for version 7.3.1297
Bram Moolenaar <bram@vim.org>
parents:
4805
diff
changeset
|
4739 } |
7 | 4740 |
4741 sptr = ff_create_stack_element(ff_expand_buffer, | |
4742 #ifdef FEAT_PATH_EXTRA | |
1541 | 4743 search_ctx->ffsc_wc_path, |
7 | 4744 #endif |
4745 level, 0); | |
4746 | |
4747 if (sptr == NULL) | |
4748 goto error_return; | |
4749 | |
1541 | 4750 ff_push(search_ctx, sptr); |
4751 | |
4752 search_ctx->ffsc_file_to_search = vim_strsave(filename); | |
4753 if (search_ctx->ffsc_file_to_search == NULL) | |
7 | 4754 goto error_return; |
4755 | |
1541 | 4756 return search_ctx; |
7 | 4757 |
4758 error_return: | |
4759 /* | |
4760 * We clear the search context now! | |
4761 * Even when the caller gave us a (perhaps valid) context we free it here, | |
4762 * as we might have already destroyed it. | |
4763 */ | |
1541 | 4764 vim_findfile_cleanup(search_ctx); |
7 | 4765 return NULL; |
4766 } | |
4767 | |
4768 #if defined(FEAT_PATH_EXTRA) || defined(PROTO) | |
4769 /* | |
4770 * Get the stopdir string. Check that ';' is not escaped. | |
4771 */ | |
4772 char_u * | |
4773 vim_findfile_stopdir(buf) | |
4774 char_u *buf; | |
4775 { | |
4776 char_u *r_ptr = buf; | |
4777 | |
4778 while (*r_ptr != NUL && *r_ptr != ';') | |
4779 { | |
4780 if (r_ptr[0] == '\\' && r_ptr[1] == ';') | |
4781 { | |
2984 | 4782 /* Overwrite the escape char, |
4783 * use STRLEN(r_ptr) to move the trailing '\0'. */ | |
1621 | 4784 STRMOVE(r_ptr, r_ptr + 1); |
7 | 4785 r_ptr++; |
4786 } | |
4787 r_ptr++; | |
4788 } | |
4789 if (*r_ptr == ';') | |
4790 { | |
4791 *r_ptr = 0; | |
4792 r_ptr++; | |
4793 } | |
4794 else if (*r_ptr == NUL) | |
4795 r_ptr = NULL; | |
4796 return r_ptr; | |
4797 } | |
4798 #endif | |
4799 | |
1541 | 4800 /* |
4801 * Clean up the given search context. Can handle a NULL pointer. | |
4802 */ | |
7 | 4803 void |
4804 vim_findfile_cleanup(ctx) | |
4805 void *ctx; | |
4806 { | |
359 | 4807 if (ctx == NULL) |
7 | 4808 return; |
4809 | |
4810 vim_findfile_free_visited(ctx); | |
1541 | 4811 ff_clear(ctx); |
7 | 4812 vim_free(ctx); |
4813 } | |
4814 | |
4815 /* | |
4816 * Find a file in a search context. | |
4817 * The search context was created with vim_findfile_init() above. | |
4818 * Return a pointer to an allocated file name or NULL if nothing found. | |
4819 * To get all matching files call this function until you get NULL. | |
4820 * | |
20 | 4821 * If the passed search_context is NULL, NULL is returned. |
7 | 4822 * |
4823 * The search algorithm is depth first. To change this replace the | |
4824 * stack with a list (don't forget to leave partly searched directories on the | |
4825 * top of the list). | |
4826 */ | |
4827 char_u * | |
1541 | 4828 vim_findfile(search_ctx_arg) |
4829 void *search_ctx_arg; | |
7 | 4830 { |
4831 char_u *file_path; | |
4832 #ifdef FEAT_PATH_EXTRA | |
4833 char_u *rest_of_wildcards; | |
4834 char_u *path_end = NULL; | |
4835 #endif | |
1541 | 4836 ff_stack_T *stackp; |
7 | 4837 #if defined(FEAT_SEARCHPATH) || defined(FEAT_PATH_EXTRA) |
4838 int len; | |
4839 #endif | |
4840 int i; | |
4841 char_u *p; | |
4842 #ifdef FEAT_SEARCHPATH | |
4843 char_u *suf; | |
4844 #endif | |
1541 | 4845 ff_search_ctx_T *search_ctx; |
4846 | |
4847 if (search_ctx_arg == NULL) | |
7 | 4848 return NULL; |
4849 | |
1541 | 4850 search_ctx = (ff_search_ctx_T *)search_ctx_arg; |
7 | 4851 |
4852 /* | |
4853 * filepath is used as buffer for various actions and as the storage to | |
4854 * return a found filename. | |
4855 */ | |
4856 if ((file_path = alloc((int)MAXPATHL)) == NULL) | |
4857 return NULL; | |
4858 | |
4859 #ifdef FEAT_PATH_EXTRA | |
4860 /* store the end of the start dir -- needed for upward search */ | |
1541 | 4861 if (search_ctx->ffsc_start_dir != NULL) |
4862 path_end = &search_ctx->ffsc_start_dir[ | |
4863 STRLEN(search_ctx->ffsc_start_dir)]; | |
7 | 4864 #endif |
4865 | |
4866 #ifdef FEAT_PATH_EXTRA | |
4867 /* upward search loop */ | |
4868 for (;;) | |
4869 { | |
4870 #endif | |
4871 /* downward search loop */ | |
4872 for (;;) | |
4873 { | |
4874 /* check if user user wants to stop the search*/ | |
4875 ui_breakcheck(); | |
4876 if (got_int) | |
4877 break; | |
4878 | |
4879 /* get directory to work on from stack */ | |
1541 | 4880 stackp = ff_pop(search_ctx); |
4881 if (stackp == NULL) | |
7 | 4882 break; |
4883 | |
4884 /* | |
4885 * TODO: decide if we leave this test in | |
4886 * | |
4887 * GOOD: don't search a directory(-tree) twice. | |
4888 * BAD: - check linked list for every new directory entered. | |
4889 * - check for double files also done below | |
4890 * | |
4891 * Here we check if we already searched this directory. | |
4892 * We already searched a directory if: | |
4893 * 1) The directory is the same. | |
4894 * 2) We would use the same wildcard string. | |
4895 * | |
4896 * Good if you have links on same directory via several ways | |
4897 * or you have selfreferences in directories (e.g. SuSE Linux 6.3: | |
4898 * /etc/rc.d/init.d is linked to /etc/rc.d -> endless loop) | |
4899 * | |
4900 * This check is only needed for directories we work on for the | |
1541 | 4901 * first time (hence stackp->ff_filearray == NULL) |
7 | 4902 */ |
1541 | 4903 if (stackp->ffs_filearray == NULL |
4904 && ff_check_visited(&search_ctx->ffsc_dir_visited_list | |
7 | 4905 ->ffvl_visited_list, |
1541 | 4906 stackp->ffs_fix_path |
7 | 4907 #ifdef FEAT_PATH_EXTRA |
1541 | 4908 , stackp->ffs_wc_path |
7 | 4909 #endif |
4910 ) == FAIL) | |
4911 { | |
4912 #ifdef FF_VERBOSE | |
4913 if (p_verbose >= 5) | |
4914 { | |
293 | 4915 verbose_enter_scroll(); |
7 | 4916 smsg((char_u *)"Already Searched: %s (%s)", |
1541 | 4917 stackp->ffs_fix_path, stackp->ffs_wc_path); |
7 | 4918 /* don't overwrite this either */ |
4919 msg_puts((char_u *)"\n"); | |
293 | 4920 verbose_leave_scroll(); |
7 | 4921 } |
4922 #endif | |
1541 | 4923 ff_free_stack_element(stackp); |
7 | 4924 continue; |
4925 } | |
4926 #ifdef FF_VERBOSE | |
4927 else if (p_verbose >= 5) | |
4928 { | |
293 | 4929 verbose_enter_scroll(); |
273 | 4930 smsg((char_u *)"Searching: %s (%s)", |
1541 | 4931 stackp->ffs_fix_path, stackp->ffs_wc_path); |
7 | 4932 /* don't overwrite this either */ |
4933 msg_puts((char_u *)"\n"); | |
293 | 4934 verbose_leave_scroll(); |
7 | 4935 } |
4936 #endif | |
4937 | |
4938 /* check depth */ | |
1541 | 4939 if (stackp->ffs_level <= 0) |
7 | 4940 { |
1541 | 4941 ff_free_stack_element(stackp); |
7 | 4942 continue; |
4943 } | |
4944 | |
4945 file_path[0] = NUL; | |
4946 | |
4947 /* | |
4948 * If no filearray till now expand wildcards | |
4949 * The function expand_wildcards() can handle an array of paths | |
4950 * and all possible expands are returned in one array. We use this | |
4951 * to handle the expansion of '**' into an empty string. | |
4952 */ | |
1541 | 4953 if (stackp->ffs_filearray == NULL) |
7 | 4954 { |
4955 char_u *dirptrs[2]; | |
4956 | |
4957 /* we use filepath to build the path expand_wildcards() should | |
4958 * expand. | |
4959 */ | |
4960 dirptrs[0] = file_path; | |
4961 dirptrs[1] = NULL; | |
4962 | |
4963 /* if we have a start dir copy it in */ | |
1541 | 4964 if (!vim_isAbsName(stackp->ffs_fix_path) |
4965 && search_ctx->ffsc_start_dir) | |
7 | 4966 { |
1541 | 4967 STRCPY(file_path, search_ctx->ffsc_start_dir); |
7 | 4968 add_pathsep(file_path); |
4969 } | |
4970 | |
4971 /* append the fix part of the search path */ | |
1541 | 4972 STRCAT(file_path, stackp->ffs_fix_path); |
7 | 4973 add_pathsep(file_path); |
4974 | |
4975 #ifdef FEAT_PATH_EXTRA | |
1541 | 4976 rest_of_wildcards = stackp->ffs_wc_path; |
7 | 4977 if (*rest_of_wildcards != NUL) |
4978 { | |
4979 len = (int)STRLEN(file_path); | |
4980 if (STRNCMP(rest_of_wildcards, "**", 2) == 0) | |
4981 { | |
4982 /* pointer to the restrict byte | |
4983 * The restrict byte is not a character! | |
4984 */ | |
4985 p = rest_of_wildcards + 2; | |
4986 | |
4987 if (*p > 0) | |
4988 { | |
4989 (*p)--; | |
4990 file_path[len++] = '*'; | |
4991 } | |
4992 | |
4993 if (*p == 0) | |
4994 { | |
4995 /* remove '**<numb> from wildcards */ | |
1621 | 4996 STRMOVE(rest_of_wildcards, rest_of_wildcards + 3); |
7 | 4997 } |
4998 else | |
4999 rest_of_wildcards += 3; | |
5000 | |
1541 | 5001 if (stackp->ffs_star_star_empty == 0) |
7 | 5002 { |
5003 /* if not done before, expand '**' to empty */ | |
1541 | 5004 stackp->ffs_star_star_empty = 1; |
5005 dirptrs[1] = stackp->ffs_fix_path; | |
7 | 5006 } |
5007 } | |
5008 | |
5009 /* | |
5010 * Here we copy until the next path separator or the end of | |
5011 * the path. If we stop at a path separator, there is | |
1209 | 5012 * still something else left. This is handled below by |
7 | 5013 * pushing every directory returned from expand_wildcards() |
5014 * on the stack again for further search. | |
5015 */ | |
5016 while (*rest_of_wildcards | |
5017 && !vim_ispathsep(*rest_of_wildcards)) | |
5018 file_path[len++] = *rest_of_wildcards++; | |
5019 | |
5020 file_path[len] = NUL; | |
5021 if (vim_ispathsep(*rest_of_wildcards)) | |
5022 rest_of_wildcards++; | |
5023 } | |
5024 #endif | |
5025 | |
5026 /* | |
5027 * Expand wildcards like "*" and "$VAR". | |
5028 * If the path is a URL don't try this. | |
5029 */ | |
5030 if (path_with_url(dirptrs[0])) | |
5031 { | |
1541 | 5032 stackp->ffs_filearray = (char_u **) |
7 | 5033 alloc((unsigned)sizeof(char *)); |
1541 | 5034 if (stackp->ffs_filearray != NULL |
5035 && (stackp->ffs_filearray[0] | |
7 | 5036 = vim_strsave(dirptrs[0])) != NULL) |
1541 | 5037 stackp->ffs_filearray_size = 1; |
7 | 5038 else |
1541 | 5039 stackp->ffs_filearray_size = 0; |
7 | 5040 } |
5041 else | |
2984 | 5042 /* Add EW_NOTWILD because the expanded path may contain |
5043 * wildcard characters that are to be taken literally. | |
5044 * This is a bit of a hack. */ | |
7 | 5045 expand_wildcards((dirptrs[1] == NULL) ? 1 : 2, dirptrs, |
1541 | 5046 &stackp->ffs_filearray_size, |
5047 &stackp->ffs_filearray, | |
2984 | 5048 EW_DIR|EW_ADDSLASH|EW_SILENT|EW_NOTWILD); |
7 | 5049 |
1541 | 5050 stackp->ffs_filearray_cur = 0; |
5051 stackp->ffs_stage = 0; | |
7 | 5052 } |
5053 #ifdef FEAT_PATH_EXTRA | |
5054 else | |
1541 | 5055 rest_of_wildcards = &stackp->ffs_wc_path[ |
5056 STRLEN(stackp->ffs_wc_path)]; | |
5057 #endif | |
5058 | |
5059 if (stackp->ffs_stage == 0) | |
7 | 5060 { |
5061 /* this is the first time we work on this directory */ | |
5062 #ifdef FEAT_PATH_EXTRA | |
5063 if (*rest_of_wildcards == NUL) | |
5064 #endif | |
5065 { | |
5066 /* | |
4805
66803af09906
updated for version 7.3.1149
Bram Moolenaar <bram@vim.org>
parents:
4352
diff
changeset
|
5067 * We don't have further wildcards to expand, so we have to |
66803af09906
updated for version 7.3.1149
Bram Moolenaar <bram@vim.org>
parents:
4352
diff
changeset
|
5068 * check for the final file now. |
7 | 5069 */ |
1541 | 5070 for (i = stackp->ffs_filearray_cur; |
5071 i < stackp->ffs_filearray_size; ++i) | |
7 | 5072 { |
1541 | 5073 if (!path_with_url(stackp->ffs_filearray[i]) |
5074 && !mch_isdir(stackp->ffs_filearray[i])) | |
7 | 5075 continue; /* not a directory */ |
5076 | |
1993 | 5077 /* prepare the filename to be checked for existence |
7 | 5078 * below */ |
1541 | 5079 STRCPY(file_path, stackp->ffs_filearray[i]); |
7 | 5080 add_pathsep(file_path); |
1541 | 5081 STRCAT(file_path, search_ctx->ffsc_file_to_search); |
7 | 5082 |
5083 /* | |
5084 * Try without extra suffix and then with suffixes | |
5085 * from 'suffixesadd'. | |
5086 */ | |
5087 #ifdef FEAT_SEARCHPATH | |
5088 len = (int)STRLEN(file_path); | |
2521
d890c820722f
Fix: 'suffixesadd' was used for finding tags file.
Bram Moolenaar <bram@vim.org>
parents:
2520
diff
changeset
|
5089 if (search_ctx->ffsc_tagfile) |
d890c820722f
Fix: 'suffixesadd' was used for finding tags file.
Bram Moolenaar <bram@vim.org>
parents:
2520
diff
changeset
|
5090 suf = (char_u *)""; |
d890c820722f
Fix: 'suffixesadd' was used for finding tags file.
Bram Moolenaar <bram@vim.org>
parents:
2520
diff
changeset
|
5091 else |
d890c820722f
Fix: 'suffixesadd' was used for finding tags file.
Bram Moolenaar <bram@vim.org>
parents:
2520
diff
changeset
|
5092 suf = curbuf->b_p_sua; |
7 | 5093 for (;;) |
5094 #endif | |
5095 { | |
5096 /* if file exists and we didn't already find it */ | |
5097 if ((path_with_url(file_path) | |
1541 | 5098 || (mch_getperm(file_path) >= 0 |
5099 && (search_ctx->ffsc_find_what | |
5100 == FINDFILE_BOTH | |
5101 || ((search_ctx->ffsc_find_what | |
5102 == FINDFILE_DIR) | |
5103 == mch_isdir(file_path))))) | |
7 | 5104 #ifndef FF_VERBOSE |
5105 && (ff_check_visited( | |
1541 | 5106 &search_ctx->ffsc_visited_list->ffvl_visited_list, |
7 | 5107 file_path |
5108 #ifdef FEAT_PATH_EXTRA | |
5109 , (char_u *)"" | |
5110 #endif | |
5111 ) == OK) | |
5112 #endif | |
5113 ) | |
5114 { | |
5115 #ifdef FF_VERBOSE | |
5116 if (ff_check_visited( | |
1541 | 5117 &search_ctx->ffsc_visited_list->ffvl_visited_list, |
7 | 5118 file_path |
5119 #ifdef FEAT_PATH_EXTRA | |
5120 , (char_u *)"" | |
5121 #endif | |
5122 ) == FAIL) | |
5123 { | |
5124 if (p_verbose >= 5) | |
5125 { | |
293 | 5126 verbose_enter_scroll(); |
273 | 5127 smsg((char_u *)"Already: %s", |
7 | 5128 file_path); |
5129 /* don't overwrite this either */ | |
5130 msg_puts((char_u *)"\n"); | |
293 | 5131 verbose_leave_scroll(); |
7 | 5132 } |
5133 continue; | |
5134 } | |
5135 #endif | |
5136 | |
5137 /* push dir to examine rest of subdirs later */ | |
1541 | 5138 stackp->ffs_filearray_cur = i + 1; |
5139 ff_push(search_ctx, stackp); | |
7 | 5140 |
1789 | 5141 if (!path_with_url(file_path)) |
5142 simplify_filename(file_path); | |
7 | 5143 if (mch_dirname(ff_expand_buffer, MAXPATHL) |
5144 == OK) | |
5145 { | |
5146 p = shorten_fname(file_path, | |
5147 ff_expand_buffer); | |
5148 if (p != NULL) | |
1621 | 5149 STRMOVE(file_path, p); |
7 | 5150 } |
5151 #ifdef FF_VERBOSE | |
5152 if (p_verbose >= 5) | |
5153 { | |
293 | 5154 verbose_enter_scroll(); |
273 | 5155 smsg((char_u *)"HIT: %s", file_path); |
7 | 5156 /* don't overwrite this either */ |
5157 msg_puts((char_u *)"\n"); | |
293 | 5158 verbose_leave_scroll(); |
7 | 5159 } |
5160 #endif | |
5161 return file_path; | |
5162 } | |
5163 | |
5164 #ifdef FEAT_SEARCHPATH | |
5165 /* Not found or found already, try next suffix. */ | |
5166 if (*suf == NUL) | |
5167 break; | |
5168 copy_option_part(&suf, file_path + len, | |
5169 MAXPATHL - len, ","); | |
5170 #endif | |
5171 } | |
5172 } | |
5173 } | |
5174 #ifdef FEAT_PATH_EXTRA | |
5175 else | |
5176 { | |
5177 /* | |
5178 * still wildcards left, push the directories for further | |
5179 * search | |
5180 */ | |
1541 | 5181 for (i = stackp->ffs_filearray_cur; |
5182 i < stackp->ffs_filearray_size; ++i) | |
7 | 5183 { |
1541 | 5184 if (!mch_isdir(stackp->ffs_filearray[i])) |
7 | 5185 continue; /* not a directory */ |
5186 | |
1541 | 5187 ff_push(search_ctx, |
5188 ff_create_stack_element( | |
5189 stackp->ffs_filearray[i], | |
5190 rest_of_wildcards, | |
5191 stackp->ffs_level - 1, 0)); | |
7 | 5192 } |
5193 } | |
5194 #endif | |
1541 | 5195 stackp->ffs_filearray_cur = 0; |
5196 stackp->ffs_stage = 1; | |
7 | 5197 } |
5198 | |
5199 #ifdef FEAT_PATH_EXTRA | |
5200 /* | |
5201 * if wildcards contains '**' we have to descent till we reach the | |
5202 * leaves of the directory tree. | |
5203 */ | |
1541 | 5204 if (STRNCMP(stackp->ffs_wc_path, "**", 2) == 0) |
7 | 5205 { |
1541 | 5206 for (i = stackp->ffs_filearray_cur; |
5207 i < stackp->ffs_filearray_size; ++i) | |
7 | 5208 { |
1541 | 5209 if (fnamecmp(stackp->ffs_filearray[i], |
5210 stackp->ffs_fix_path) == 0) | |
7 | 5211 continue; /* don't repush same directory */ |
1541 | 5212 if (!mch_isdir(stackp->ffs_filearray[i])) |
7 | 5213 continue; /* not a directory */ |
1541 | 5214 ff_push(search_ctx, |
5215 ff_create_stack_element(stackp->ffs_filearray[i], | |
5216 stackp->ffs_wc_path, stackp->ffs_level - 1, 1)); | |
7 | 5217 } |
5218 } | |
5219 #endif | |
5220 | |
5221 /* we are done with the current directory */ | |
1541 | 5222 ff_free_stack_element(stackp); |
7 | 5223 |
5224 } | |
5225 | |
5226 #ifdef FEAT_PATH_EXTRA | |
5227 /* If we reached this, we didn't find anything downwards. | |
5228 * Let's check if we should do an upward search. | |
5229 */ | |
1541 | 5230 if (search_ctx->ffsc_start_dir |
5231 && search_ctx->ffsc_stopdirs_v != NULL && !got_int) | |
7 | 5232 { |
5233 ff_stack_T *sptr; | |
5234 | |
5235 /* is the last starting directory in the stop list? */ | |
1541 | 5236 if (ff_path_in_stoplist(search_ctx->ffsc_start_dir, |
5237 (int)(path_end - search_ctx->ffsc_start_dir), | |
5238 search_ctx->ffsc_stopdirs_v) == TRUE) | |
7 | 5239 break; |
5240 | |
5241 /* cut of last dir */ | |
1541 | 5242 while (path_end > search_ctx->ffsc_start_dir |
5243 && vim_ispathsep(*path_end)) | |
7 | 5244 path_end--; |
1541 | 5245 while (path_end > search_ctx->ffsc_start_dir |
5246 && !vim_ispathsep(path_end[-1])) | |
7 | 5247 path_end--; |
5248 *path_end = 0; | |
5249 path_end--; | |
5250 | |
1541 | 5251 if (*search_ctx->ffsc_start_dir == 0) |
7 | 5252 break; |
5253 | |
1541 | 5254 STRCPY(file_path, search_ctx->ffsc_start_dir); |
7 | 5255 add_pathsep(file_path); |
1541 | 5256 STRCAT(file_path, search_ctx->ffsc_fix_path); |
7 | 5257 |
5258 /* create a new stack entry */ | |
5259 sptr = ff_create_stack_element(file_path, | |
1541 | 5260 search_ctx->ffsc_wc_path, search_ctx->ffsc_level, 0); |
7 | 5261 if (sptr == NULL) |
5262 break; | |
1541 | 5263 ff_push(search_ctx, sptr); |
7 | 5264 } |
5265 else | |
5266 break; | |
5267 } | |
5268 #endif | |
5269 | |
5270 vim_free(file_path); | |
5271 return NULL; | |
5272 } | |
5273 | |
5274 /* | |
5275 * Free the list of lists of visited files and directories | |
5276 * Can handle it if the passed search_context is NULL; | |
5277 */ | |
5278 void | |
1541 | 5279 vim_findfile_free_visited(search_ctx_arg) |
5280 void *search_ctx_arg; | |
7 | 5281 { |
1541 | 5282 ff_search_ctx_T *search_ctx; |
5283 | |
5284 if (search_ctx_arg == NULL) | |
7 | 5285 return; |
5286 | |
1541 | 5287 search_ctx = (ff_search_ctx_T *)search_ctx_arg; |
5288 vim_findfile_free_visited_list(&search_ctx->ffsc_visited_lists_list); | |
5289 vim_findfile_free_visited_list(&search_ctx->ffsc_dir_visited_lists_list); | |
7 | 5290 } |
5291 | |
5292 static void | |
5293 vim_findfile_free_visited_list(list_headp) | |
5294 ff_visited_list_hdr_T **list_headp; | |
5295 { | |
5296 ff_visited_list_hdr_T *vp; | |
5297 | |
5298 while (*list_headp != NULL) | |
5299 { | |
5300 vp = (*list_headp)->ffvl_next; | |
5301 ff_free_visited_list((*list_headp)->ffvl_visited_list); | |
5302 | |
5303 vim_free((*list_headp)->ffvl_filename); | |
5304 vim_free(*list_headp); | |
5305 *list_headp = vp; | |
5306 } | |
5307 *list_headp = NULL; | |
5308 } | |
5309 | |
5310 static void | |
5311 ff_free_visited_list(vl) | |
5312 ff_visited_T *vl; | |
5313 { | |
5314 ff_visited_T *vp; | |
5315 | |
5316 while (vl != NULL) | |
5317 { | |
5318 vp = vl->ffv_next; | |
5319 #ifdef FEAT_PATH_EXTRA | |
5320 vim_free(vl->ffv_wc_path); | |
5321 #endif | |
5322 vim_free(vl); | |
5323 vl = vp; | |
5324 } | |
5325 vl = NULL; | |
5326 } | |
5327 | |
5328 /* | |
5329 * Returns the already visited list for the given filename. If none is found it | |
5330 * allocates a new one. | |
5331 */ | |
5332 static ff_visited_list_hdr_T* | |
5333 ff_get_visited_list(filename, list_headp) | |
5334 char_u *filename; | |
5335 ff_visited_list_hdr_T **list_headp; | |
5336 { | |
5337 ff_visited_list_hdr_T *retptr = NULL; | |
5338 | |
5339 /* check if a visited list for the given filename exists */ | |
5340 if (*list_headp != NULL) | |
5341 { | |
5342 retptr = *list_headp; | |
5343 while (retptr != NULL) | |
5344 { | |
5345 if (fnamecmp(filename, retptr->ffvl_filename) == 0) | |
5346 { | |
5347 #ifdef FF_VERBOSE | |
5348 if (p_verbose >= 5) | |
5349 { | |
293 | 5350 verbose_enter_scroll(); |
273 | 5351 smsg((char_u *)"ff_get_visited_list: FOUND list for %s", |
7 | 5352 filename); |
5353 /* don't overwrite this either */ | |
5354 msg_puts((char_u *)"\n"); | |
293 | 5355 verbose_leave_scroll(); |
7 | 5356 } |
5357 #endif | |
5358 return retptr; | |
5359 } | |
5360 retptr = retptr->ffvl_next; | |
5361 } | |
5362 } | |
5363 | |
5364 #ifdef FF_VERBOSE | |
5365 if (p_verbose >= 5) | |
5366 { | |
293 | 5367 verbose_enter_scroll(); |
273 | 5368 smsg((char_u *)"ff_get_visited_list: new list for %s", filename); |
7 | 5369 /* don't overwrite this either */ |
5370 msg_puts((char_u *)"\n"); | |
293 | 5371 verbose_leave_scroll(); |
7 | 5372 } |
5373 #endif | |
5374 | |
5375 /* | |
5376 * if we reach this we didn't find a list and we have to allocate new list | |
5377 */ | |
5378 retptr = (ff_visited_list_hdr_T*)alloc((unsigned)sizeof(*retptr)); | |
5379 if (retptr == NULL) | |
5380 return NULL; | |
5381 | |
5382 retptr->ffvl_visited_list = NULL; | |
5383 retptr->ffvl_filename = vim_strsave(filename); | |
5384 if (retptr->ffvl_filename == NULL) | |
5385 { | |
5386 vim_free(retptr); | |
5387 return NULL; | |
5388 } | |
5389 retptr->ffvl_next = *list_headp; | |
5390 *list_headp = retptr; | |
5391 | |
5392 return retptr; | |
5393 } | |
5394 | |
5395 #ifdef FEAT_PATH_EXTRA | |
5396 /* | |
5397 * check if two wildcard paths are equal. Returns TRUE or FALSE. | |
5398 * They are equal if: | |
5399 * - both paths are NULL | |
5400 * - they have the same length | |
5401 * - char by char comparison is OK | |
5402 * - the only differences are in the counters behind a '**', so | |
5403 * '**\20' is equal to '**\24' | |
5404 */ | |
5405 static int | |
5406 ff_wc_equal(s1, s2) | |
5407 char_u *s1; | |
5408 char_u *s2; | |
5409 { | |
5410 int i; | |
4246 | 5411 int prev1 = NUL; |
5412 int prev2 = NUL; | |
7 | 5413 |
5414 if (s1 == s2) | |
5415 return TRUE; | |
5416 | |
5417 if (s1 == NULL || s2 == NULL) | |
5418 return FALSE; | |
5419 | |
5420 if (STRLEN(s1) != STRLEN(s2)) | |
5421 return FAIL; | |
5422 | |
4246 | 5423 for (i = 0; s1[i] != NUL && s2[i] != NUL; i += MB_PTR2LEN(s1 + i)) |
7 | 5424 { |
4246 | 5425 int c1 = PTR2CHAR(s1 + i); |
5426 int c2 = PTR2CHAR(s2 + i); | |
5427 | |
5428 if ((p_fic ? MB_TOLOWER(c1) != MB_TOLOWER(c2) : c1 != c2) | |
5429 && (prev1 != '*' || prev2 != '*')) | |
5430 return FAIL; | |
5431 prev2 = prev1; | |
5432 prev1 = c1; | |
7 | 5433 } |
5434 return TRUE; | |
5435 } | |
5436 #endif | |
5437 | |
5438 /* | |
5439 * maintains the list of already visited files and dirs | |
5440 * returns FAIL if the given file/dir is already in the list | |
5441 * returns OK if it is newly added | |
5442 * | |
5443 * TODO: What to do on memory allocation problems? | |
5444 * -> return TRUE - Better the file is found several times instead of | |
5445 * never. | |
5446 */ | |
5447 static int | |
5448 ff_check_visited(visited_list, fname | |
5449 #ifdef FEAT_PATH_EXTRA | |
5450 , wc_path | |
5451 #endif | |
5452 ) | |
5453 ff_visited_T **visited_list; | |
5454 char_u *fname; | |
5455 #ifdef FEAT_PATH_EXTRA | |
5456 char_u *wc_path; | |
5457 #endif | |
5458 { | |
5459 ff_visited_T *vp; | |
5460 #ifdef UNIX | |
5461 struct stat st; | |
5462 int url = FALSE; | |
5463 #endif | |
5464 | |
5465 /* For an URL we only compare the name, otherwise we compare the | |
5466 * device/inode (unix) or the full path name (not Unix). */ | |
5467 if (path_with_url(fname)) | |
5468 { | |
418 | 5469 vim_strncpy(ff_expand_buffer, fname, MAXPATHL - 1); |
7 | 5470 #ifdef UNIX |
5471 url = TRUE; | |
5472 #endif | |
5473 } | |
5474 else | |
5475 { | |
5476 ff_expand_buffer[0] = NUL; | |
5477 #ifdef UNIX | |
5478 if (mch_stat((char *)fname, &st) < 0) | |
5479 #else | |
5480 if (vim_FullName(fname, ff_expand_buffer, MAXPATHL, TRUE) == FAIL) | |
5481 #endif | |
5482 return FAIL; | |
5483 } | |
5484 | |
5485 /* check against list of already visited files */ | |
5486 for (vp = *visited_list; vp != NULL; vp = vp->ffv_next) | |
5487 { | |
5488 if ( | |
5489 #ifdef UNIX | |
1881 | 5490 !url ? (vp->ffv_dev_valid && vp->ffv_dev == st.st_dev |
5491 && vp->ffv_ino == st.st_ino) | |
5492 : | |
7 | 5493 #endif |
5494 fnamecmp(vp->ffv_fname, ff_expand_buffer) == 0 | |
5495 ) | |
5496 { | |
5497 #ifdef FEAT_PATH_EXTRA | |
5498 /* are the wildcard parts equal */ | |
5499 if (ff_wc_equal(vp->ffv_wc_path, wc_path) == TRUE) | |
5500 #endif | |
5501 /* already visited */ | |
5502 return FAIL; | |
5503 } | |
5504 } | |
5505 | |
5506 /* | |
5507 * New file/dir. Add it to the list of visited files/dirs. | |
5508 */ | |
5509 vp = (ff_visited_T *)alloc((unsigned)(sizeof(ff_visited_T) | |
5510 + STRLEN(ff_expand_buffer))); | |
5511 | |
5512 if (vp != NULL) | |
5513 { | |
5514 #ifdef UNIX | |
5515 if (!url) | |
5516 { | |
1881 | 5517 vp->ffv_dev_valid = TRUE; |
7 | 5518 vp->ffv_ino = st.st_ino; |
5519 vp->ffv_dev = st.st_dev; | |
5520 vp->ffv_fname[0] = NUL; | |
5521 } | |
5522 else | |
5523 { | |
1881 | 5524 vp->ffv_dev_valid = FALSE; |
7 | 5525 #endif |
5526 STRCPY(vp->ffv_fname, ff_expand_buffer); | |
5527 #ifdef UNIX | |
5528 } | |
5529 #endif | |
5530 #ifdef FEAT_PATH_EXTRA | |
5531 if (wc_path != NULL) | |
5532 vp->ffv_wc_path = vim_strsave(wc_path); | |
5533 else | |
5534 vp->ffv_wc_path = NULL; | |
5535 #endif | |
5536 | |
5537 vp->ffv_next = *visited_list; | |
5538 *visited_list = vp; | |
5539 } | |
5540 | |
5541 return OK; | |
5542 } | |
5543 | |
5544 /* | |
5545 * create stack element from given path pieces | |
5546 */ | |
5547 static ff_stack_T * | |
5548 ff_create_stack_element(fix_part, | |
5549 #ifdef FEAT_PATH_EXTRA | |
5550 wc_part, | |
5551 #endif | |
5552 level, star_star_empty) | |
5553 char_u *fix_part; | |
5554 #ifdef FEAT_PATH_EXTRA | |
5555 char_u *wc_part; | |
5556 #endif | |
5557 int level; | |
5558 int star_star_empty; | |
5559 { | |
5560 ff_stack_T *new; | |
5561 | |
5562 new = (ff_stack_T *)alloc((unsigned)sizeof(ff_stack_T)); | |
5563 if (new == NULL) | |
5564 return NULL; | |
5565 | |
5566 new->ffs_prev = NULL; | |
5567 new->ffs_filearray = NULL; | |
5568 new->ffs_filearray_size = 0; | |
5569 new->ffs_filearray_cur = 0; | |
5570 new->ffs_stage = 0; | |
5571 new->ffs_level = level; | |
5572 new->ffs_star_star_empty = star_star_empty;; | |
5573 | |
5574 /* the following saves NULL pointer checks in vim_findfile */ | |
5575 if (fix_part == NULL) | |
5576 fix_part = (char_u *)""; | |
5577 new->ffs_fix_path = vim_strsave(fix_part); | |
5578 | |
5579 #ifdef FEAT_PATH_EXTRA | |
5580 if (wc_part == NULL) | |
5581 wc_part = (char_u *)""; | |
5582 new->ffs_wc_path = vim_strsave(wc_part); | |
5583 #endif | |
5584 | |
5585 if (new->ffs_fix_path == NULL | |
5586 #ifdef FEAT_PATH_EXTRA | |
5587 || new->ffs_wc_path == NULL | |
5588 #endif | |
5589 ) | |
5590 { | |
5591 ff_free_stack_element(new); | |
5592 new = NULL; | |
5593 } | |
5594 | |
5595 return new; | |
5596 } | |
5597 | |
5598 /* | |
1541 | 5599 * Push a dir on the directory stack. |
7 | 5600 */ |
5601 static void | |
1541 | 5602 ff_push(search_ctx, stack_ptr) |
5603 ff_search_ctx_T *search_ctx; | |
5604 ff_stack_T *stack_ptr; | |
7 | 5605 { |
5606 /* check for NULL pointer, not to return an error to the user, but | |
359 | 5607 * to prevent a crash */ |
1541 | 5608 if (stack_ptr != NULL) |
7 | 5609 { |
1541 | 5610 stack_ptr->ffs_prev = search_ctx->ffsc_stack_ptr; |
5611 search_ctx->ffsc_stack_ptr = stack_ptr; | |
7 | 5612 } |
5613 } | |
5614 | |
5615 /* | |
1541 | 5616 * Pop a dir from the directory stack. |
5617 * Returns NULL if stack is empty. | |
7 | 5618 */ |
5619 static ff_stack_T * | |
1541 | 5620 ff_pop(search_ctx) |
5621 ff_search_ctx_T *search_ctx; | |
7 | 5622 { |
5623 ff_stack_T *sptr; | |
5624 | |
1541 | 5625 sptr = search_ctx->ffsc_stack_ptr; |
5626 if (search_ctx->ffsc_stack_ptr != NULL) | |
5627 search_ctx->ffsc_stack_ptr = search_ctx->ffsc_stack_ptr->ffs_prev; | |
7 | 5628 |
5629 return sptr; | |
5630 } | |
5631 | |
5632 /* | |
5633 * free the given stack element | |
5634 */ | |
5635 static void | |
1541 | 5636 ff_free_stack_element(stack_ptr) |
5637 ff_stack_T *stack_ptr; | |
7 | 5638 { |
5639 /* vim_free handles possible NULL pointers */ | |
1541 | 5640 vim_free(stack_ptr->ffs_fix_path); |
7 | 5641 #ifdef FEAT_PATH_EXTRA |
1541 | 5642 vim_free(stack_ptr->ffs_wc_path); |
5643 #endif | |
5644 | |
5645 if (stack_ptr->ffs_filearray != NULL) | |
5646 FreeWild(stack_ptr->ffs_filearray_size, stack_ptr->ffs_filearray); | |
5647 | |
5648 vim_free(stack_ptr); | |
7 | 5649 } |
5650 | |
5651 /* | |
1541 | 5652 * Clear the search context, but NOT the visited list. |
7 | 5653 */ |
5654 static void | |
1541 | 5655 ff_clear(search_ctx) |
5656 ff_search_ctx_T *search_ctx; | |
7 | 5657 { |
5658 ff_stack_T *sptr; | |
5659 | |
5660 /* clear up stack */ | |
1541 | 5661 while ((sptr = ff_pop(search_ctx)) != NULL) |
7 | 5662 ff_free_stack_element(sptr); |
5663 | |
1541 | 5664 vim_free(search_ctx->ffsc_file_to_search); |
5665 vim_free(search_ctx->ffsc_start_dir); | |
5666 vim_free(search_ctx->ffsc_fix_path); | |
7 | 5667 #ifdef FEAT_PATH_EXTRA |
1541 | 5668 vim_free(search_ctx->ffsc_wc_path); |
7 | 5669 #endif |
5670 | |
5671 #ifdef FEAT_PATH_EXTRA | |
1541 | 5672 if (search_ctx->ffsc_stopdirs_v != NULL) |
7 | 5673 { |
5674 int i = 0; | |
5675 | |
1541 | 5676 while (search_ctx->ffsc_stopdirs_v[i] != NULL) |
7 | 5677 { |
1541 | 5678 vim_free(search_ctx->ffsc_stopdirs_v[i]); |
7 | 5679 i++; |
5680 } | |
1541 | 5681 vim_free(search_ctx->ffsc_stopdirs_v); |
7 | 5682 } |
1541 | 5683 search_ctx->ffsc_stopdirs_v = NULL; |
7 | 5684 #endif |
5685 | |
5686 /* reset everything */ | |
1541 | 5687 search_ctx->ffsc_file_to_search = NULL; |
5688 search_ctx->ffsc_start_dir = NULL; | |
5689 search_ctx->ffsc_fix_path = NULL; | |
7 | 5690 #ifdef FEAT_PATH_EXTRA |
1541 | 5691 search_ctx->ffsc_wc_path = NULL; |
5692 search_ctx->ffsc_level = 0; | |
7 | 5693 #endif |
5694 } | |
5695 | |
5696 #ifdef FEAT_PATH_EXTRA | |
5697 /* | |
5698 * check if the given path is in the stopdirs | |
5699 * returns TRUE if yes else FALSE | |
5700 */ | |
5701 static int | |
5702 ff_path_in_stoplist(path, path_len, stopdirs_v) | |
5703 char_u *path; | |
5704 int path_len; | |
5705 char_u **stopdirs_v; | |
5706 { | |
5707 int i = 0; | |
5708 | |
5709 /* eat up trailing path separators, except the first */ | |
461 | 5710 while (path_len > 1 && vim_ispathsep(path[path_len - 1])) |
7 | 5711 path_len--; |
5712 | |
5713 /* if no path consider it as match */ | |
5714 if (path_len == 0) | |
5715 return TRUE; | |
5716 | |
5717 for (i = 0; stopdirs_v[i] != NULL; i++) | |
5718 { | |
5719 if ((int)STRLEN(stopdirs_v[i]) > path_len) | |
5720 { | |
5721 /* match for parent directory. So '/home' also matches | |
5722 * '/home/rks'. Check for PATHSEP in stopdirs_v[i], else | |
5723 * '/home/r' would also match '/home/rks' | |
5724 */ | |
5725 if (fnamencmp(stopdirs_v[i], path, path_len) == 0 | |
461 | 5726 && vim_ispathsep(stopdirs_v[i][path_len])) |
7 | 5727 return TRUE; |
5728 } | |
5729 else | |
5730 { | |
5731 if (fnamecmp(stopdirs_v[i], path) == 0) | |
5732 return TRUE; | |
5733 } | |
5734 } | |
5735 return FALSE; | |
5736 } | |
5737 #endif | |
5738 | |
5739 #if defined(FEAT_SEARCHPATH) || defined(PROTO) | |
5740 /* | |
1541 | 5741 * Find the file name "ptr[len]" in the path. Also finds directory names. |
7 | 5742 * |
5743 * On the first call set the parameter 'first' to TRUE to initialize | |
5744 * the search. For repeating calls to FALSE. | |
5745 * | |
5746 * Repeating calls will return other files called 'ptr[len]' from the path. | |
5747 * | |
5748 * Only on the first call 'ptr' and 'len' are used. For repeating calls they | |
5749 * don't need valid values. | |
5750 * | |
5751 * If nothing found on the first call the option FNAME_MESS will issue the | |
5752 * message: | |
5753 * 'Can't find file "<file>" in path' | |
5754 * On repeating calls: | |
5755 * 'No more file "<file>" found in path' | |
5756 * | |
5757 * options: | |
5758 * FNAME_MESS give error message when not found | |
5759 * | |
5760 * Uses NameBuff[]! | |
5761 * | |
5762 * Returns an allocated string for the file name. NULL for error. | |
5763 * | |
5764 */ | |
5765 char_u * | |
5766 find_file_in_path(ptr, len, options, first, rel_fname) | |
5767 char_u *ptr; /* file name */ | |
5768 int len; /* length of file name */ | |
5769 int options; | |
5770 int first; /* use count'th matching file name */ | |
5771 char_u *rel_fname; /* file name searching relative to */ | |
5772 { | |
5773 return find_file_in_path_option(ptr, len, options, first, | |
5774 *curbuf->b_p_path == NUL ? p_path : curbuf->b_p_path, | |
1541 | 5775 FINDFILE_BOTH, rel_fname, curbuf->b_p_sua); |
7 | 5776 } |
5777 | |
359 | 5778 static char_u *ff_file_to_find = NULL; |
5779 static void *fdip_search_ctx = NULL; | |
5780 | |
5781 #if defined(EXITFREE) | |
5782 static void | |
5783 free_findfile() | |
5784 { | |
5785 vim_free(ff_file_to_find); | |
5786 vim_findfile_cleanup(fdip_search_ctx); | |
5787 } | |
5788 #endif | |
5789 | |
7 | 5790 /* |
5791 * Find the directory name "ptr[len]" in the path. | |
5792 * | |
5793 * options: | |
5794 * FNAME_MESS give error message when not found | |
5795 * | |
5796 * Uses NameBuff[]! | |
5797 * | |
5798 * Returns an allocated string for the file name. NULL for error. | |
5799 */ | |
5800 char_u * | |
5801 find_directory_in_path(ptr, len, options, rel_fname) | |
5802 char_u *ptr; /* file name */ | |
5803 int len; /* length of file name */ | |
5804 int options; | |
5805 char_u *rel_fname; /* file name searching relative to */ | |
5806 { | |
5807 return find_file_in_path_option(ptr, len, options, TRUE, p_cdpath, | |
1541 | 5808 FINDFILE_DIR, rel_fname, (char_u *)""); |
7 | 5809 } |
5810 | |
19 | 5811 char_u * |
1541 | 5812 find_file_in_path_option(ptr, len, options, first, path_option, find_what, rel_fname, suffixes) |
7 | 5813 char_u *ptr; /* file name */ |
5814 int len; /* length of file name */ | |
5815 int options; | |
5816 int first; /* use count'th matching file name */ | |
5817 char_u *path_option; /* p_path or p_cdpath */ | |
1541 | 5818 int find_what; /* FINDFILE_FILE, _DIR or _BOTH */ |
7 | 5819 char_u *rel_fname; /* file name we are looking relative to. */ |
794 | 5820 char_u *suffixes; /* list of suffixes, 'suffixesadd' option */ |
7 | 5821 { |
5822 static char_u *dir; | |
5823 static int did_findfile_init = FALSE; | |
5824 char_u save_char; | |
5825 char_u *file_name = NULL; | |
5826 char_u *buf = NULL; | |
5827 int rel_to_curdir; | |
5828 #ifdef AMIGA | |
5829 struct Process *proc = (struct Process *)FindTask(0L); | |
5830 APTR save_winptr = proc->pr_WindowPtr; | |
5831 | |
5832 /* Avoid a requester here for a volume that doesn't exist. */ | |
5833 proc->pr_WindowPtr = (APTR)-1L; | |
5834 #endif | |
5835 | |
5836 if (first == TRUE) | |
5837 { | |
5838 /* copy file name into NameBuff, expanding environment variables */ | |
5839 save_char = ptr[len]; | |
5840 ptr[len] = NUL; | |
5841 expand_env(ptr, NameBuff, MAXPATHL); | |
5842 ptr[len] = save_char; | |
5843 | |
359 | 5844 vim_free(ff_file_to_find); |
5845 ff_file_to_find = vim_strsave(NameBuff); | |
5846 if (ff_file_to_find == NULL) /* out of memory */ | |
7 | 5847 { |
5848 file_name = NULL; | |
5849 goto theend; | |
5850 } | |
5851 } | |
5852 | |
359 | 5853 rel_to_curdir = (ff_file_to_find[0] == '.' |
5854 && (ff_file_to_find[1] == NUL | |
5855 || vim_ispathsep(ff_file_to_find[1]) | |
5856 || (ff_file_to_find[1] == '.' | |
5857 && (ff_file_to_find[2] == NUL | |
5858 || vim_ispathsep(ff_file_to_find[2]))))); | |
5859 if (vim_isAbsName(ff_file_to_find) | |
7 | 5860 /* "..", "../path", "." and "./path": don't use the path_option */ |
5861 || rel_to_curdir | |
5862 #if defined(MSWIN) || defined(MSDOS) || defined(OS2) | |
5863 /* handle "\tmp" as absolute path */ | |
359 | 5864 || vim_ispathsep(ff_file_to_find[0]) |
1993 | 5865 /* handle "c:name" as absolute path */ |
359 | 5866 || (ff_file_to_find[0] != NUL && ff_file_to_find[1] == ':') |
7 | 5867 #endif |
5868 #ifdef AMIGA | |
5869 /* handle ":tmp" as absolute path */ | |
359 | 5870 || ff_file_to_find[0] == ':' |
7 | 5871 #endif |
5872 ) | |
5873 { | |
5874 /* | |
5875 * Absolute path, no need to use "path_option". | |
5876 * If this is not a first call, return NULL. We already returned a | |
5877 * filename on the first call. | |
5878 */ | |
5879 if (first == TRUE) | |
5880 { | |
5881 int l; | |
5882 int run; | |
5883 | |
359 | 5884 if (path_with_url(ff_file_to_find)) |
7 | 5885 { |
359 | 5886 file_name = vim_strsave(ff_file_to_find); |
7 | 5887 goto theend; |
5888 } | |
5889 | |
5890 /* When FNAME_REL flag given first use the directory of the file. | |
5891 * Otherwise or when this fails use the current directory. */ | |
5892 for (run = 1; run <= 2; ++run) | |
5893 { | |
359 | 5894 l = (int)STRLEN(ff_file_to_find); |
7 | 5895 if (run == 1 |
5896 && rel_to_curdir | |
5897 && (options & FNAME_REL) | |
5898 && rel_fname != NULL | |
5899 && STRLEN(rel_fname) + l < MAXPATHL) | |
5900 { | |
5901 STRCPY(NameBuff, rel_fname); | |
359 | 5902 STRCPY(gettail(NameBuff), ff_file_to_find); |
7 | 5903 l = (int)STRLEN(NameBuff); |
5904 } | |
5905 else | |
5906 { | |
359 | 5907 STRCPY(NameBuff, ff_file_to_find); |
7 | 5908 run = 2; |
5909 } | |
5910 | |
5911 /* When the file doesn't exist, try adding parts of | |
5912 * 'suffixesadd'. */ | |
794 | 5913 buf = suffixes; |
7 | 5914 for (;;) |
5915 { | |
5916 if ( | |
5917 #ifdef DJGPP | |
5918 /* "C:" by itself will fail for mch_getperm(), | |
5919 * assume it's always valid. */ | |
1541 | 5920 (find_what != FINDFILE_FILE && NameBuff[0] != NUL |
7 | 5921 && NameBuff[1] == ':' |
5922 && NameBuff[2] == NUL) || | |
5923 #endif | |
5924 (mch_getperm(NameBuff) >= 0 | |
1541 | 5925 && (find_what == FINDFILE_BOTH |
5926 || ((find_what == FINDFILE_DIR) | |
5927 == mch_isdir(NameBuff))))) | |
7 | 5928 { |
5929 file_name = vim_strsave(NameBuff); | |
5930 goto theend; | |
5931 } | |
5932 if (*buf == NUL) | |
5933 break; | |
5934 copy_option_part(&buf, NameBuff + l, MAXPATHL - l, ","); | |
5935 } | |
5936 } | |
5937 } | |
5938 } | |
5939 else | |
5940 { | |
5941 /* | |
5942 * Loop over all paths in the 'path' or 'cdpath' option. | |
5943 * When "first" is set, first setup to the start of the option. | |
5944 * Otherwise continue to find the next match. | |
5945 */ | |
5946 if (first == TRUE) | |
5947 { | |
5948 /* vim_findfile_free_visited can handle a possible NULL pointer */ | |
359 | 5949 vim_findfile_free_visited(fdip_search_ctx); |
7 | 5950 dir = path_option; |
5951 did_findfile_init = FALSE; | |
5952 } | |
5953 | |
5954 for (;;) | |
5955 { | |
5956 if (did_findfile_init) | |
5957 { | |
359 | 5958 file_name = vim_findfile(fdip_search_ctx); |
7 | 5959 if (file_name != NULL) |
5960 break; | |
5961 | |
5962 did_findfile_init = FALSE; | |
5963 } | |
5964 else | |
5965 { | |
5966 char_u *r_ptr; | |
5967 | |
5968 if (dir == NULL || *dir == NUL) | |
5969 { | |
5970 /* We searched all paths of the option, now we can | |
5971 * free the search context. */ | |
359 | 5972 vim_findfile_cleanup(fdip_search_ctx); |
5973 fdip_search_ctx = NULL; | |
7 | 5974 break; |
5975 } | |
5976 | |
5977 if ((buf = alloc((int)(MAXPATHL))) == NULL) | |
5978 break; | |
5979 | |
5980 /* copy next path */ | |
5981 buf[0] = 0; | |
5982 copy_option_part(&dir, buf, MAXPATHL, " ,"); | |
5983 | |
5984 #ifdef FEAT_PATH_EXTRA | |
5985 /* get the stopdir string */ | |
5986 r_ptr = vim_findfile_stopdir(buf); | |
5987 #else | |
5988 r_ptr = NULL; | |
5989 #endif | |
359 | 5990 fdip_search_ctx = vim_findfile_init(buf, ff_file_to_find, |
1541 | 5991 r_ptr, 100, FALSE, find_what, |
359 | 5992 fdip_search_ctx, FALSE, rel_fname); |
5993 if (fdip_search_ctx != NULL) | |
7 | 5994 did_findfile_init = TRUE; |
5995 vim_free(buf); | |
5996 } | |
5997 } | |
5998 } | |
5999 if (file_name == NULL && (options & FNAME_MESS)) | |
6000 { | |
6001 if (first == TRUE) | |
6002 { | |
1541 | 6003 if (find_what == FINDFILE_DIR) |
7 | 6004 EMSG2(_("E344: Can't find directory \"%s\" in cdpath"), |
359 | 6005 ff_file_to_find); |
7 | 6006 else |
6007 EMSG2(_("E345: Can't find file \"%s\" in path"), | |
359 | 6008 ff_file_to_find); |
7 | 6009 } |
6010 else | |
6011 { | |
1541 | 6012 if (find_what == FINDFILE_DIR) |
7 | 6013 EMSG2(_("E346: No more directory \"%s\" found in cdpath"), |
359 | 6014 ff_file_to_find); |
7 | 6015 else |
6016 EMSG2(_("E347: No more file \"%s\" found in path"), | |
359 | 6017 ff_file_to_find); |
7 | 6018 } |
6019 } | |
6020 | |
6021 theend: | |
6022 #ifdef AMIGA | |
6023 proc->pr_WindowPtr = save_winptr; | |
6024 #endif | |
6025 return file_name; | |
6026 } | |
6027 | |
6028 #endif /* FEAT_SEARCHPATH */ | |
6029 | |
6030 /* | |
6031 * Change directory to "new_dir". If FEAT_SEARCHPATH is defined, search | |
6032 * 'cdpath' for relative directory names, otherwise just mch_chdir(). | |
6033 */ | |
6034 int | |
6035 vim_chdir(new_dir) | |
6036 char_u *new_dir; | |
6037 { | |
6038 #ifndef FEAT_SEARCHPATH | |
6039 return mch_chdir((char *)new_dir); | |
6040 #else | |
6041 char_u *dir_name; | |
6042 int r; | |
6043 | |
6044 dir_name = find_directory_in_path(new_dir, (int)STRLEN(new_dir), | |
6045 FNAME_MESS, curbuf->b_ffname); | |
6046 if (dir_name == NULL) | |
6047 return -1; | |
6048 r = mch_chdir((char *)dir_name); | |
6049 vim_free(dir_name); | |
6050 return r; | |
6051 #endif | |
6052 } | |
6053 | |
6054 /* | |
418 | 6055 * Get user name from machine-specific function. |
7 | 6056 * Returns the user name in "buf[len]". |
418 | 6057 * Some systems are quite slow in obtaining the user name (Windows NT), thus |
6058 * cache the result. | |
7 | 6059 * Returns OK or FAIL. |
6060 */ | |
6061 int | |
6062 get_user_name(buf, len) | |
6063 char_u *buf; | |
6064 int len; | |
6065 { | |
359 | 6066 if (username == NULL) |
7 | 6067 { |
6068 if (mch_get_user_name(buf, len) == FAIL) | |
6069 return FAIL; | |
359 | 6070 username = vim_strsave(buf); |
7 | 6071 } |
6072 else | |
418 | 6073 vim_strncpy(buf, username, len - 1); |
7 | 6074 return OK; |
6075 } | |
6076 | |
6077 #ifndef HAVE_QSORT | |
6078 /* | |
6079 * Our own qsort(), for systems that don't have it. | |
6080 * It's simple and slow. From the K&R C book. | |
6081 */ | |
6082 void | |
6083 qsort(base, elm_count, elm_size, cmp) | |
6084 void *base; | |
6085 size_t elm_count; | |
6086 size_t elm_size; | |
6087 int (*cmp) __ARGS((const void *, const void *)); | |
6088 { | |
6089 char_u *buf; | |
6090 char_u *p1; | |
6091 char_u *p2; | |
6092 int i, j; | |
6093 int gap; | |
6094 | |
6095 buf = alloc((unsigned)elm_size); | |
6096 if (buf == NULL) | |
6097 return; | |
6098 | |
6099 for (gap = elm_count / 2; gap > 0; gap /= 2) | |
6100 for (i = gap; i < elm_count; ++i) | |
6101 for (j = i - gap; j >= 0; j -= gap) | |
6102 { | |
6103 /* Compare the elements. */ | |
6104 p1 = (char_u *)base + j * elm_size; | |
6105 p2 = (char_u *)base + (j + gap) * elm_size; | |
6106 if ((*cmp)((void *)p1, (void *)p2) <= 0) | |
6107 break; | |
1993 | 6108 /* Exchange the elements. */ |
7 | 6109 mch_memmove(buf, p1, elm_size); |
6110 mch_memmove(p1, p2, elm_size); | |
6111 mch_memmove(p2, buf, elm_size); | |
6112 } | |
6113 | |
6114 vim_free(buf); | |
6115 } | |
6116 #endif | |
6117 | |
6118 /* | |
6119 * Sort an array of strings. | |
6120 */ | |
6121 static int | |
6122 #ifdef __BORLANDC__ | |
6123 _RTLENTRYF | |
6124 #endif | |
6125 sort_compare __ARGS((const void *s1, const void *s2)); | |
6126 | |
6127 static int | |
6128 #ifdef __BORLANDC__ | |
6129 _RTLENTRYF | |
6130 #endif | |
6131 sort_compare(s1, s2) | |
6132 const void *s1; | |
6133 const void *s2; | |
6134 { | |
6135 return STRCMP(*(char **)s1, *(char **)s2); | |
6136 } | |
6137 | |
6138 void | |
6139 sort_strings(files, count) | |
6140 char_u **files; | |
6141 int count; | |
6142 { | |
6143 qsort((void *)files, (size_t)count, sizeof(char_u *), sort_compare); | |
6144 } | |
6145 | |
6146 #if !defined(NO_EXPANDPATH) || defined(PROTO) | |
6147 /* | |
6148 * Compare path "p[]" to "q[]". | |
39 | 6149 * If "maxlen" >= 0 compare "p[maxlen]" to "q[maxlen]" |
7 | 6150 * Return value like strcmp(p, q), but consider path separators. |
6151 */ | |
6152 int | |
39 | 6153 pathcmp(p, q, maxlen) |
7 | 6154 const char *p, *q; |
39 | 6155 int maxlen; |
7 | 6156 { |
6157 int i; | |
4276 | 6158 int c1, c2; |
41 | 6159 const char *s = NULL; |
7 | 6160 |
4276 | 6161 for (i = 0; maxlen < 0 || i < maxlen; i += MB_PTR2LEN((char_u *)p + i)) |
7 | 6162 { |
4276 | 6163 c1 = PTR2CHAR((char_u *)p + i); |
6164 c2 = PTR2CHAR((char_u *)q + i); | |
6165 | |
7 | 6166 /* End of "p": check if "q" also ends or just has a slash. */ |
4276 | 6167 if (c1 == NUL) |
7 | 6168 { |
4276 | 6169 if (c2 == NUL) /* full match */ |
7 | 6170 return 0; |
6171 s = q; | |
6172 break; | |
6173 } | |
6174 | |
6175 /* End of "q": check if "p" just has a slash. */ | |
4276 | 6176 if (c2 == NUL) |
7 | 6177 { |
6178 s = p; | |
6179 break; | |
6180 } | |
6181 | |
4276 | 6182 if ((p_fic ? MB_TOUPPER(c1) != MB_TOUPPER(c2) : c1 != c2) |
7 | 6183 #ifdef BACKSLASH_IN_FILENAME |
6184 /* consider '/' and '\\' to be equal */ | |
4276 | 6185 && !((c1 == '/' && c2 == '\\') |
6186 || (c1 == '\\' && c2 == '/')) | |
7 | 6187 #endif |
6188 ) | |
6189 { | |
4276 | 6190 if (vim_ispathsep(c1)) |
7 | 6191 return -1; |
4276 | 6192 if (vim_ispathsep(c2)) |
7 | 6193 return 1; |
4276 | 6194 return p_fic ? MB_TOUPPER(c1) - MB_TOUPPER(c2) |
6195 : c1 - c2; /* no match */ | |
7 | 6196 } |
6197 } | |
41 | 6198 if (s == NULL) /* "i" ran into "maxlen" */ |
6199 return 0; | |
7 | 6200 |
4276 | 6201 c1 = PTR2CHAR((char_u *)s + i); |
6202 c2 = PTR2CHAR((char_u *)s + i + MB_PTR2LEN((char_u *)s + i)); | |
7 | 6203 /* ignore a trailing slash, but not "//" or ":/" */ |
4276 | 6204 if (c2 == NUL |
41 | 6205 && i > 0 |
6206 && !after_pathsep((char_u *)s, (char_u *)s + i) | |
7 | 6207 #ifdef BACKSLASH_IN_FILENAME |
4276 | 6208 && (c1 == '/' || c1 == '\\') |
7 | 6209 #else |
4276 | 6210 && c1 == '/' |
7 | 6211 #endif |
41 | 6212 ) |
7 | 6213 return 0; /* match with trailing slash */ |
6214 if (s == q) | |
6215 return -1; /* no match */ | |
6216 return 1; | |
6217 } | |
6218 #endif | |
6219 | |
6220 /* | |
6221 * The putenv() implementation below comes from the "screen" program. | |
6222 * Included with permission from Juergen Weigert. | |
6223 * See pty.c for the copyright notice. | |
6224 */ | |
6225 | |
6226 /* | |
6227 * putenv -- put value into environment | |
6228 * | |
6229 * Usage: i = putenv (string) | |
6230 * int i; | |
6231 * char *string; | |
6232 * | |
6233 * where string is of the form <name>=<value>. | |
6234 * Putenv returns 0 normally, -1 on error (not enough core for malloc). | |
6235 * | |
6236 * Putenv may need to add a new name into the environment, or to | |
6237 * associate a value longer than the current value with a particular | |
6238 * name. So, to make life simpler, putenv() copies your entire | |
6239 * environment into the heap (i.e. malloc()) from the stack | |
6240 * (i.e. where it resides when your process is initiated) the first | |
6241 * time you call it. | |
6242 * | |
6243 * (history removed, not very interesting. See the "screen" sources.) | |
6244 */ | |
6245 | |
6246 #if !defined(HAVE_SETENV) && !defined(HAVE_PUTENV) | |
6247 | |
6248 #define EXTRASIZE 5 /* increment to add to env. size */ | |
6249 | |
6250 static int envsize = -1; /* current size of environment */ | |
6251 #ifndef MACOS_CLASSIC | |
6252 extern | |
6253 #endif | |
6254 char **environ; /* the global which is your env. */ | |
6255 | |
6256 static int findenv __ARGS((char *name)); /* look for a name in the env. */ | |
6257 static int newenv __ARGS((void)); /* copy env. from stack to heap */ | |
6258 static int moreenv __ARGS((void)); /* incr. size of env. */ | |
6259 | |
6260 int | |
6261 putenv(string) | |
6262 const char *string; | |
6263 { | |
6264 int i; | |
6265 char *p; | |
6266 | |
6267 if (envsize < 0) | |
6268 { /* first time putenv called */ | |
6269 if (newenv() < 0) /* copy env. to heap */ | |
6270 return -1; | |
6271 } | |
6272 | |
6273 i = findenv((char *)string); /* look for name in environment */ | |
6274 | |
6275 if (i < 0) | |
6276 { /* name must be added */ | |
6277 for (i = 0; environ[i]; i++); | |
6278 if (i >= (envsize - 1)) | |
6279 { /* need new slot */ | |
6280 if (moreenv() < 0) | |
6281 return -1; | |
6282 } | |
6283 p = (char *)alloc((unsigned)(strlen(string) + 1)); | |
6284 if (p == NULL) /* not enough core */ | |
6285 return -1; | |
6286 environ[i + 1] = 0; /* new end of env. */ | |
6287 } | |
6288 else | |
6289 { /* name already in env. */ | |
6290 p = vim_realloc(environ[i], strlen(string) + 1); | |
6291 if (p == NULL) | |
6292 return -1; | |
6293 } | |
6294 sprintf(p, "%s", string); /* copy into env. */ | |
6295 environ[i] = p; | |
6296 | |
6297 return 0; | |
6298 } | |
6299 | |
6300 static int | |
6301 findenv(name) | |
6302 char *name; | |
6303 { | |
6304 char *namechar, *envchar; | |
6305 int i, found; | |
6306 | |
6307 found = 0; | |
6308 for (i = 0; environ[i] && !found; i++) | |
6309 { | |
6310 envchar = environ[i]; | |
6311 namechar = name; | |
6312 while (*namechar && *namechar != '=' && (*namechar == *envchar)) | |
6313 { | |
6314 namechar++; | |
6315 envchar++; | |
6316 } | |
6317 found = ((*namechar == '\0' || *namechar == '=') && *envchar == '='); | |
6318 } | |
6319 return found ? i - 1 : -1; | |
6320 } | |
6321 | |
6322 static int | |
6323 newenv() | |
6324 { | |
6325 char **env, *elem; | |
6326 int i, esize; | |
6327 | |
6328 #ifdef MACOS | |
6329 /* for Mac a new, empty environment is created */ | |
6330 i = 0; | |
6331 #else | |
6332 for (i = 0; environ[i]; i++) | |
6333 ; | |
6334 #endif | |
6335 esize = i + EXTRASIZE + 1; | |
6336 env = (char **)alloc((unsigned)(esize * sizeof (elem))); | |
6337 if (env == NULL) | |
6338 return -1; | |
6339 | |
6340 #ifndef MACOS | |
6341 for (i = 0; environ[i]; i++) | |
6342 { | |
6343 elem = (char *)alloc((unsigned)(strlen(environ[i]) + 1)); | |
6344 if (elem == NULL) | |
6345 return -1; | |
6346 env[i] = elem; | |
6347 strcpy(elem, environ[i]); | |
6348 } | |
6349 #endif | |
6350 | |
6351 env[i] = 0; | |
6352 environ = env; | |
6353 envsize = esize; | |
6354 return 0; | |
6355 } | |
6356 | |
6357 static int | |
6358 moreenv() | |
6359 { | |
6360 int esize; | |
6361 char **env; | |
6362 | |
6363 esize = envsize + EXTRASIZE; | |
6364 env = (char **)vim_realloc((char *)environ, esize * sizeof (*env)); | |
6365 if (env == 0) | |
6366 return -1; | |
6367 environ = env; | |
6368 envsize = esize; | |
6369 return 0; | |
6370 } | |
6371 | |
6372 # ifdef USE_VIMPTY_GETENV | |
6373 char_u * | |
6374 vimpty_getenv(string) | |
6375 const char_u *string; | |
6376 { | |
6377 int i; | |
6378 char_u *p; | |
6379 | |
6380 if (envsize < 0) | |
6381 return NULL; | |
6382 | |
6383 i = findenv((char *)string); | |
6384 | |
6385 if (i < 0) | |
6386 return NULL; | |
6387 | |
6388 p = vim_strchr((char_u *)environ[i], '='); | |
6389 return (p + 1); | |
6390 } | |
6391 # endif | |
6392 | |
6393 #endif /* !defined(HAVE_SETENV) && !defined(HAVE_PUTENV) */ | |
313 | 6394 |
741 | 6395 #if defined(FEAT_EVAL) || defined(FEAT_SPELL) || defined(PROTO) |
313 | 6396 /* |
6397 * Return 0 for not writable, 1 for writable file, 2 for a dir which we have | |
6398 * rights to write into. | |
6399 */ | |
6400 int | |
6401 filewritable(fname) | |
6402 char_u *fname; | |
6403 { | |
6404 int retval = 0; | |
6405 #if defined(UNIX) || defined(VMS) | |
6406 int perm = 0; | |
6407 #endif | |
6408 | |
6409 #if defined(UNIX) || defined(VMS) | |
6410 perm = mch_getperm(fname); | |
6411 #endif | |
6412 #ifndef MACOS_CLASSIC /* TODO: get either mch_writable or mch_access */ | |
6413 if ( | |
6414 # ifdef WIN3264 | |
6415 mch_writable(fname) && | |
6416 # else | |
6417 # if defined(UNIX) || defined(VMS) | |
6418 (perm & 0222) && | |
6419 # endif | |
6420 # endif | |
6421 mch_access((char *)fname, W_OK) == 0 | |
6422 ) | |
6423 #endif | |
6424 { | |
6425 ++retval; | |
6426 if (mch_isdir(fname)) | |
6427 ++retval; | |
6428 } | |
6429 return retval; | |
6430 } | |
6431 #endif | |
332 | 6432 |
6433 /* | |
6434 * Print an error message with one or two "%s" and one or two string arguments. | |
6435 * This is not in message.c to avoid a warning for prototypes. | |
6436 */ | |
6437 int | |
6438 emsg3(s, a1, a2) | |
6439 char_u *s, *a1, *a2; | |
6440 { | |
840 | 6441 if (emsg_not_now()) |
332 | 6442 return TRUE; /* no error messages at the moment */ |
1438 | 6443 #ifdef HAVE_STDARG_H |
6444 vim_snprintf((char *)IObuff, IOSIZE, (char *)s, a1, a2); | |
6445 #else | |
840 | 6446 vim_snprintf((char *)IObuff, IOSIZE, (char *)s, (long_u)a1, (long_u)a2); |
1438 | 6447 #endif |
332 | 6448 return emsg(IObuff); |
6449 } | |
6450 | |
6451 /* | |
6452 * Print an error message with one "%ld" and one long int argument. | |
6453 * This is not in message.c to avoid a warning for prototypes. | |
6454 */ | |
6455 int | |
6456 emsgn(s, n) | |
6457 char_u *s; | |
6458 long n; | |
6459 { | |
840 | 6460 if (emsg_not_now()) |
332 | 6461 return TRUE; /* no error messages at the moment */ |
6462 vim_snprintf((char *)IObuff, IOSIZE, (char *)s, n); | |
6463 return emsg(IObuff); | |
6464 } | |
2229
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6465 |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6466 #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
|
6467 /* |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6468 * 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
|
6469 */ |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6470 int |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6471 get2c(fd) |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6472 FILE *fd; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6473 { |
2231
aa6412cab544
Various improvements to undo file code to make it more robust.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6474 int n; |
2229
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6475 |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6476 n = getc(fd); |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6477 n = (n << 8) + getc(fd); |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6478 return n; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6479 } |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6480 |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6481 /* |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6482 * 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
|
6483 */ |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6484 int |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6485 get3c(fd) |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6486 FILE *fd; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6487 { |
2231
aa6412cab544
Various improvements to undo file code to make it more robust.
Bram Moolenaar <bram@vim.org>
parents:
2229
diff
changeset
|
6488 int n; |
2229
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 n = getc(fd); |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6491 n = (n << 8) + getc(fd); |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6492 n = (n << 8) + getc(fd); |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6493 return n; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6494 } |
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 /* |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6497 * 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
|
6498 */ |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6499 int |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6500 get4c(fd) |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6501 FILE *fd; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6502 { |
5347 | 6503 /* Use unsigned rather than int otherwise result is undefined |
6504 * when left-shift sets the MSB. */ | |
6505 unsigned n; | |
6506 | |
6507 n = (unsigned)getc(fd); | |
6508 n = (n << 8) + (unsigned)getc(fd); | |
6509 n = (n << 8) + (unsigned)getc(fd); | |
6510 n = (n << 8) + (unsigned)getc(fd); | |
6511 return (int)n; | |
2229
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6512 } |
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 /* |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6515 * 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
|
6516 */ |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6517 time_t |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6518 get8ctime(fd) |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6519 FILE *fd; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6520 { |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6521 time_t n = 0; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6522 int i; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6523 |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6524 for (i = 0; i < 8; ++i) |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6525 n = (n << 8) + getc(fd); |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6526 return n; |
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 /* |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6530 * 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
|
6531 * 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
|
6532 */ |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6533 char_u * |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6534 read_string(fd, cnt) |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6535 FILE *fd; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6536 int cnt; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6537 { |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6538 char_u *str; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6539 int i; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6540 int c; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6541 |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6542 /* allocate memory */ |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6543 str = alloc((unsigned)cnt + 1); |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6544 if (str != NULL) |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6545 { |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6546 /* 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
|
6547 for (i = 0; i < cnt; ++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 c = getc(fd); |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6550 if (c == EOF) |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6551 { |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6552 vim_free(str); |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6553 return NULL; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6554 } |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6555 str[i] = c; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6556 } |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6557 str[i] = NUL; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6558 } |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6559 return str; |
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 * 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
|
6564 */ |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6565 int |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6566 put_bytes(fd, nr, len) |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6567 FILE *fd; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6568 long_u nr; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6569 int len; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6570 { |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6571 int i; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6572 |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6573 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
|
6574 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
|
6575 return FAIL; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6576 return OK; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6577 } |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6578 |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6579 #ifdef _MSC_VER |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6580 # if (_MSC_VER <= 1200) |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6581 /* 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
|
6582 * matching #pragma below. */ |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6583 # pragma optimize("", off) |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6584 # endif |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6585 #endif |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6586 |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6587 /* |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6588 * 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
|
6589 */ |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6590 void |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6591 put_time(fd, the_time) |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6592 FILE *fd; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6593 time_t the_time; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6594 { |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6595 int c; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6596 int i; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6597 time_t wtime = the_time; |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6598 |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6599 /* 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
|
6600 * can't use put_bytes() here. |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6601 * 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
|
6602 * 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
|
6603 * 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
|
6604 * 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
|
6605 * 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
|
6606 for (i = 7; i >= 0; --i) |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6607 { |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6608 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
|
6609 /* ">>" 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
|
6610 putc(0, fd); |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6611 else |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6612 { |
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
|
6613 #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
|
6614 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
|
6615 #else |
2245
4e0124f5aee2
Optimize the blowfish crypt/decrypt code a bit more.
Bram Moolenaar <bram@vim.org>
parents:
2244
diff
changeset
|
6616 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
|
6617 #endif |
2229
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6618 putc(c, fd); |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6619 } |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6620 } |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6621 } |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6622 |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6623 #ifdef _MSC_VER |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6624 # if (_MSC_VER <= 1200) |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6625 # pragma optimize("", on) |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6626 # endif |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6627 #endif |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6628 |
d45902a5c61c
Fix a few more things for persistent undo.
Bram Moolenaar <bram@vim.org>
parents:
2215
diff
changeset
|
6629 #endif |
3257 | 6630 |
6631 #if (defined(FEAT_MBYTE) && defined(FEAT_QUICKFIX)) \ | |
6632 || defined(FEAT_SPELL) || defined(PROTO) | |
6633 /* | |
6634 * Return TRUE if string "s" contains a non-ASCII character (128 or higher). | |
6635 * When "s" is NULL FALSE is returned. | |
6636 */ | |
6637 int | |
6638 has_non_ascii(s) | |
6639 char_u *s; | |
6640 { | |
6641 char_u *p; | |
6642 | |
6643 if (s != NULL) | |
6644 for (p = s; *p != NUL; ++p) | |
6645 if (*p >= 128) | |
6646 return TRUE; | |
6647 return FALSE; | |
6648 } | |
6649 #endif |