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