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