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