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