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