1 /* vi:set ts=8 sts=4 sw=4:
3 * VIM - Vi IMproved by Bram Moolenaar
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.
11 * misc2.c: Various functions.
15 static char_u
*username
= NULL
; /* cached result of mch_get_user_name() */
17 static char_u
*ff_expand_buffer
= NULL
; /* used for expanding filenames */
19 #if defined(FEAT_VIRTUALEDIT) || defined(PROTO)
20 static int coladvance2
__ARGS((pos_T
*pos
, int addspaces
, int finetune
, colnr_T wcol
));
23 * Return TRUE if in the current mode we need to use virtual.
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"
31 if (virtual_op
!= MAYBE
)
33 return (ve_flags
== VE_ALL
35 || ((ve_flags
& VE_BLOCK
) && VIsual_active
&& VIsual_mode
== Ctrl_V
)
37 || ((ve_flags
& VE_INSERT
) && (State
& INSERT
)));
41 * Get the screen position of the cursor.
48 getvvcol(curwin
, &curwin
->w_cursor
, &x
, NULL
, NULL
);
53 * Get the screen position of character col with a coladd in the cursor line.
56 getviscol2(col
, coladd
)
63 pos
.lnum
= curwin
->w_cursor
.lnum
;
66 getvvcol(curwin
, &pos
, &x
, NULL
, NULL
);
71 * Go to column "wcol", and add/insert white space as necessary to get the
72 * cursor in that column.
73 * The caller must have saved the cursor line for undo!
76 coladvance_force(wcol
)
79 int rc
= coladvance2(&curwin
->w_cursor
, TRUE
, FALSE
, wcol
);
82 curwin
->w_valid
&= ~VALID_VIRTCOL
;
85 /* Virtcol is valid */
86 curwin
->w_valid
|= VALID_VIRTCOL
;
87 curwin
->w_virtcol
= wcol
;
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.
100 * return OK if desired column is reached, FAIL if not
106 int rc
= getvpos(&curwin
->w_cursor
, wcol
);
108 if (wcol
== MAXCOL
|| rc
== FAIL
)
109 curwin
->w_valid
&= ~VALID_VIRTCOL
;
110 else if (*ml_get_cursor() != TAB
)
112 /* Virtcol is valid when not on a TAB */
113 curwin
->w_valid
|= VALID_VIRTCOL
;
114 curwin
->w_virtcol
= wcol
;
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
128 #ifdef FEAT_VIRTUALEDIT
129 return coladvance2(pos
, FALSE
, virtual_active(), wcol
);
133 coladvance2(pos
, addspaces
, finetune
, wcol
)
135 int addspaces
; /* change the text to achieve our goal? */
136 int finetune
; /* change char offset for the exact column */
137 colnr_T wcol
; /* column to move to */
146 #ifdef FEAT_LINEBREAK
150 one_more
= (State
& INSERT
)
151 || restart_edit
!= NUL
153 || (VIsual_active
&& *p_sel
!= 'o')
155 #ifdef FEAT_VIRTUALEDIT
156 || ((ve_flags
& VE_ONEMORE
) && wcol
< MAXCOL
)
159 line
= ml_get_curline();
163 idx
= (int)STRLEN(line
) - 1 + one_more
;
166 #ifdef FEAT_VIRTUALEDIT
167 if ((addspaces
|| finetune
) && !VIsual_active
)
169 curwin
->w_curswant
= linetabsize(line
) + one_more
;
170 if (curwin
->w_curswant
> 0)
171 --curwin
->w_curswant
;
177 #ifdef FEAT_VIRTUALEDIT
178 int width
= W_WIDTH(curwin
) - win_col_off(curwin
);
182 # ifdef FEAT_VERTSPLIT
183 && curwin
->w_width
!= 0
185 && wcol
>= (colnr_T
)width
)
187 csize
= linetabsize(line
);
191 if (wcol
/ width
> (colnr_T
)csize
/ width
192 && ((State
& INSERT
) == 0 || (int)wcol
> csize
+ 1))
194 /* In case of line wrapping don't move the cursor beyond the
195 * right screen edge. In Insert mode allow going just beyond
196 * the last character (like what happens when typing and
197 * reaching the right window edge). */
198 wcol
= (csize
/ width
+ 1) * width
- 1;
205 while (col
<= wcol
&& *ptr
!= NUL
)
207 /* Count a tab for what it's worth (if list mode not on) */
208 #ifdef FEAT_LINEBREAK
209 csize
= win_lbr_chartabsize(curwin
, ptr
, col
, &head
);
212 csize
= lbr_chartabsize_adv(&ptr
, col
);
216 idx
= (int)(ptr
- line
);
218 * Handle all the special cases. The virtual_active() check
219 * is needed to ensure that a virtual position off the end of
220 * a line has the correct indexing. The one_more comparison
221 * replaces an explicit add of one_more later on.
223 if (col
> wcol
|| (!virtual_active() && one_more
== 0))
226 # ifdef FEAT_LINEBREAK
227 /* Don't count the chars from 'showbreak'. */
233 #ifdef FEAT_VIRTUALEDIT
236 && ((col
!= wcol
&& col
!= wcol
+ 1) || csize
> 1))
238 /* 'virtualedit' is set: The difference between wcol and col is
239 * filled with spaces. */
241 if (line
[idx
] == NUL
)
244 int correct
= wcol
- col
;
245 char_u
*newline
= alloc(idx
+ correct
+ 1);
251 for (t
= 0; t
< idx
; ++t
)
252 newline
[t
] = line
[t
];
254 for (t
= 0; t
< correct
; ++t
)
255 newline
[t
+ idx
] = ' ';
257 newline
[idx
+ correct
] = NUL
;
259 ml_replace(pos
->lnum
, newline
, FALSE
);
260 changed_bytes(pos
->lnum
, (colnr_T
)idx
);
267 int linelen
= (int)STRLEN(line
);
268 int correct
= wcol
- col
- csize
+ 1; /* negative!! */
273 if (-correct
> csize
)
276 newline
= alloc(linelen
+ csize
);
280 for (t
= 0; t
< linelen
; t
++)
283 newline
[s
++] = line
[t
];
285 for (v
= 0; v
< csize
; v
++)
289 newline
[linelen
+ csize
- 1] = NUL
;
291 ml_replace(pos
->lnum
, newline
, FALSE
);
292 changed_bytes(pos
->lnum
, idx
);
293 idx
+= (csize
- 1 + correct
);
305 #ifdef FEAT_VIRTUALEDIT
312 /* The width of the last character is used to set coladd. */
317 getvcol(curwin
, pos
, &scol
, NULL
, &ecol
);
318 pos
->coladd
= ecol
- scol
;
323 int b
= (int)wcol
- (int)col
;
325 /* The difference between wcol and col is used to set coladd. */
326 if (b
> 0 && b
< (MAXCOL
- 2 * W_WIDTH(curwin
)))
335 /* prevent cursor from moving on the trail byte */
346 * Increment the cursor position. See inc() for return values.
351 return inc(&curwin
->w_cursor
);
355 * Increment the line pointer "lp" crossing line boundaries as necessary.
356 * Return 1 when going to the next line.
357 * Return 2 when moving forward onto a NUL at the end of the line).
358 * Return -1 when at the end of file.
359 * Return 0 otherwise.
365 char_u
*p
= ml_get_pos(lp
);
367 if (*p
!= NUL
) /* still within line, move to next char (may be NUL) */
372 int l
= (*mb_ptr2len
)(p
);
375 return ((p
[l
] != NUL
) ? 0 : 2);
379 #ifdef FEAT_VIRTUALEDIT
382 return ((p
[1] != NUL
) ? 0 : 2);
384 if (lp
->lnum
!= curbuf
->b_ml
.ml_line_count
) /* there is a next line */
388 #ifdef FEAT_VIRTUALEDIT
397 * incl(lp): same as inc(), but skip the NUL at the end of non-empty lines
405 if ((r
= inc(lp
)) >= 1 && lp
->col
)
413 * Decrement the line pointer 'p' crossing line boundaries as necessary.
414 * Return 1 when crossing a line, -1 when at start of file, 0 otherwise.
419 return dec(&curwin
->w_cursor
);
428 #ifdef FEAT_VIRTUALEDIT
431 if (lp
->col
> 0) /* still within line */
437 p
= ml_get(lp
->lnum
);
438 lp
->col
-= (*mb_head_off
)(p
, p
+ lp
->col
);
443 if (lp
->lnum
> 1) /* there is a prior line */
446 p
= ml_get(lp
->lnum
);
447 lp
->col
= (colnr_T
)STRLEN(p
);
450 lp
->col
-= (*mb_head_off
)(p
, p
+ lp
->col
);
454 return -1; /* at start of file */
458 * decl(lp): same as dec(), but skip the NUL at the end of non-empty lines
466 if ((r
= dec(lp
)) == 1 && lp
->col
)
472 * Make sure curwin->w_cursor.lnum is valid.
477 if (curwin
->w_cursor
.lnum
> curbuf
->b_ml
.ml_line_count
)
480 /* If there is a closed fold at the end of the file, put the cursor in
481 * its first line. Otherwise in the last line. */
482 if (!hasFolding(curbuf
->b_ml
.ml_line_count
,
483 &curwin
->w_cursor
.lnum
, NULL
))
485 curwin
->w_cursor
.lnum
= curbuf
->b_ml
.ml_line_count
;
487 if (curwin
->w_cursor
.lnum
<= 0)
488 curwin
->w_cursor
.lnum
= 1;
492 * Make sure curwin->w_cursor.col is valid.
498 #ifdef FEAT_VIRTUALEDIT
499 colnr_T oldcol
= curwin
->w_cursor
.col
+ curwin
->w_cursor
.coladd
;
502 len
= (colnr_T
)STRLEN(ml_get_curline());
504 curwin
->w_cursor
.col
= 0;
505 else if (curwin
->w_cursor
.col
>= len
)
507 /* Allow cursor past end-of-line when:
508 * - in Insert mode or restarting Insert mode
509 * - in Visual mode and 'selection' isn't "old"
510 * - 'virtualedit' is set */
511 if ((State
& INSERT
) || restart_edit
513 || (VIsual_active
&& *p_sel
!= 'o')
515 #ifdef FEAT_VIRTUALEDIT
516 || (ve_flags
& VE_ONEMORE
)
519 curwin
->w_cursor
.col
= len
;
522 curwin
->w_cursor
.col
= len
- 1;
524 /* prevent cursor from moving on the trail byte */
531 #ifdef FEAT_VIRTUALEDIT
532 /* If virtual editing is on, we can leave the cursor on the old position,
533 * only we must set it to virtual. But don't do it when at the end of the
535 if (oldcol
== MAXCOL
)
536 curwin
->w_cursor
.coladd
= 0;
537 else if (ve_flags
== VE_ALL
)
538 curwin
->w_cursor
.coladd
= oldcol
- curwin
->w_cursor
.col
;
543 * make sure curwin->w_cursor in on a valid character
552 #if defined(FEAT_TEXTOBJ) || defined(PROTO)
554 * Make sure curwin->w_cursor is not on the NUL at the end of the line.
555 * Allow it when in Visual mode and 'selection' is not "old".
560 if (curwin
->w_cursor
.col
> 0
562 && (!VIsual_active
|| *p_sel
== 'o')
564 && gchar_cursor() == NUL
)
565 --curwin
->w_cursor
.col
;
570 * When curwin->w_leftcol has changed, adjust the cursor position.
571 * Return TRUE if the cursor was moved.
580 changed_cline_bef_curs();
581 lastcol
= curwin
->w_leftcol
+ W_WIDTH(curwin
) - curwin_col_off() - 1;
585 * If the cursor is right or left of the screen, move it to last or first
588 if (curwin
->w_virtcol
> (colnr_T
)(lastcol
- p_siso
))
591 coladvance((colnr_T
)(lastcol
- p_siso
));
593 else if (curwin
->w_virtcol
< curwin
->w_leftcol
+ p_siso
)
596 (void)coladvance((colnr_T
)(curwin
->w_leftcol
+ p_siso
));
600 * If the start of the character under the cursor is not on the screen,
601 * advance the cursor one more char. If this fails (last char of the
602 * line) adjust the scrolling.
604 getvvcol(curwin
, &curwin
->w_cursor
, &s
, NULL
, &e
);
605 if (e
> (colnr_T
)lastcol
)
610 else if (s
< curwin
->w_leftcol
)
613 if (coladvance(e
+ 1) == FAIL
) /* there isn't another character */
615 curwin
->w_leftcol
= s
; /* adjust w_leftcol instead */
616 changed_cline_bef_curs();
621 curwin
->w_set_curswant
= TRUE
;
622 redraw_later(NOT_VALID
);
626 /**********************************************************************
627 * Various routines dealing with allocation and deallocation of memory.
630 #if defined(MEM_PROFILE) || defined(PROTO)
632 # define MEM_SIZES 8200
633 static long_u mem_allocs
[MEM_SIZES
];
634 static long_u mem_frees
[MEM_SIZES
];
635 static long_u mem_allocated
;
636 static long_u mem_freed
;
637 static long_u mem_peak
;
638 static long_u num_alloc
;
639 static long_u num_freed
;
641 static void mem_pre_alloc_s
__ARGS((size_t *sizep
));
642 static void mem_pre_alloc_l
__ARGS((long_u
*sizep
));
643 static void mem_post_alloc
__ARGS((void **pp
, size_t size
));
644 static void mem_pre_free
__ARGS((void **pp
));
647 mem_pre_alloc_s(sizep
)
650 *sizep
+= sizeof(size_t);
654 mem_pre_alloc_l(sizep
)
657 *sizep
+= sizeof(size_t);
661 mem_post_alloc(pp
, size
)
667 size
-= sizeof(size_t);
668 *(long_u
*)*pp
= size
;
669 if (size
<= MEM_SIZES
-1)
670 mem_allocs
[size
-1]++;
672 mem_allocs
[MEM_SIZES
-1]++;
673 mem_allocated
+= size
;
674 if (mem_allocated
- mem_freed
> mem_peak
)
675 mem_peak
= mem_allocated
- mem_freed
;
677 *pp
= (void *)((char *)*pp
+ sizeof(size_t));
686 *pp
= (void *)((char *)*pp
- sizeof(size_t));
687 size
= *(size_t *)*pp
;
688 if (size
<= MEM_SIZES
-1)
691 mem_frees
[MEM_SIZES
-1]++;
697 * called on exit via atexit()
700 vim_mem_profile_dump()
706 for (i
= 0; i
< MEM_SIZES
- 1; i
++)
708 if (mem_allocs
[i
] || mem_frees
[i
])
710 if (mem_frees
[i
] > mem_allocs
[i
])
711 printf("\r\n%s", _("ERROR: "));
712 printf("[%4d / %4lu-%-4lu] ", i
+ 1, mem_allocs
[i
], mem_frees
[i
]);
726 if (mem_frees
[i
] > mem_allocs
[i
])
727 printf(_("ERROR: "));
728 printf("[>%d / %4lu-%-4lu]", i
, mem_allocs
[i
], mem_frees
[i
]);
731 printf(_("\n[bytes] total alloc-freed %lu-%lu, in use %lu, peak use %lu\n"),
732 mem_allocated
, mem_freed
, mem_allocated
- mem_freed
, mem_peak
);
733 printf(_("[calls] total re/malloc()'s %lu, total free()'s %lu\n\n"),
734 num_alloc
, num_freed
);
737 #endif /* MEM_PROFILE */
740 * Some memory is reserved for error messages and for being able to
741 * call mf_release_all(), which needs some memory for mf_trans_add().
743 #if defined(MSDOS) && !defined(DJGPP)
745 # define KEEP_ROOM 8192L
747 # define KEEP_ROOM (2 * 8192L)
751 * Note: if unsigned is 16 bits we can only allocate up to 64K with alloc().
752 * Use lalloc for larger blocks.
758 return (lalloc((long_u
)size
, TRUE
));
762 * Allocate memory and set all bytes to zero.
770 p
= (lalloc((long_u
)size
, TRUE
));
772 (void)vim_memset(p
, 0, (size_t)size
);
777 * alloc() with check for maximum line length
783 #if !defined(UNIX) && !defined(__EMX__)
784 if (sizeof(int) == 2 && size
> 0x7fff)
786 /* Don't hide this message */
788 EMSG(_("E340: Line is becoming too long"));
792 return (lalloc((long_u
)size
, TRUE
));
796 * Allocate memory like lalloc() and set all bytes to zero.
799 lalloc_clear(size
, message
)
805 p
= (lalloc(size
, message
));
807 (void)vim_memset(p
, 0, (size_t)size
);
812 * Low level memory allocation function.
813 * This is used often, KEEP IT FAST!
816 lalloc(size
, message
)
820 char_u
*p
; /* pointer to new storage space */
821 static int releasing
= FALSE
; /* don't do mf_release_all() recursive */
823 #if defined(HAVE_AVAIL_MEM) && !defined(SMALL_MEM)
824 static long_u allocated
= 0; /* allocated since last avail check */
827 /* Safety check for allocating zero bytes */
830 /* Don't hide this message */
832 EMSGN(_("E341: Internal error: lalloc(%ld, )"), size
);
837 mem_pre_alloc_l(&size
);
840 #if defined(MSDOS) && !defined(DJGPP)
841 if (size
>= 0xfff0) /* in MSDOS we can't deal with >64K blocks */
847 * Loop when out of memory: Try to release some memfile blocks and
848 * if some blocks are released call malloc again.
853 * Handle three kind of systems:
854 * 1. No check for available memory: Just return.
855 * 2. Slow check for available memory: call mch_avail_mem() after
856 * allocating KEEP_ROOM amount of memory.
857 * 3. Strict check for available memory: call mch_avail_mem()
859 if ((p
= (char_u
*)malloc((size_t)size
)) != NULL
)
861 #ifndef HAVE_AVAIL_MEM
862 /* 1. No check for available memory: Just return. */
866 /* 2. Slow check for available memory: call mch_avail_mem() after
867 * allocating (KEEP_ROOM / 2) amount of memory. */
869 if (allocated
< KEEP_ROOM
/ 2)
873 /* 3. check for available memory: call mch_avail_mem() */
874 if (mch_avail_mem(TRUE
) < KEEP_ROOM
&& !releasing
)
876 vim_free((char *)p
); /* System is low... no go! */
884 * Remember that mf_release_all() is being called to avoid an endless
885 * loop, because mf_release_all() may call alloc() recursively.
891 clear_sb_text(); /* free any scrollback text */
892 try_again
= mf_release_all(); /* release as many blocks as possible */
894 try_again
|= garbage_collect(); /* cleanup recursive lists/dicts */
902 if (message
&& p
== NULL
)
903 do_outofmem_msg(size
);
907 mem_post_alloc((void **)&p
, (size_t)size
);
912 #if defined(MEM_PROFILE) || defined(PROTO)
914 * realloc() with memory profiling.
917 mem_realloc(ptr
, size
)
924 mem_pre_alloc_s(&size
);
926 p
= realloc(ptr
, size
);
928 mem_post_alloc(&p
, size
);
935 * Avoid repeating the error message many times (they take 1 second each).
936 * Did_outofmem_msg is reset when a character is read.
939 do_outofmem_msg(size
)
942 if (!did_outofmem_msg
)
944 /* Don't hide this message */
946 EMSGN(_("E342: Out of memory! (allocating %lu bytes)"), size
);
947 did_outofmem_msg
= TRUE
;
951 #if defined(EXITFREE) || defined(PROTO)
953 # if defined(FEAT_SEARCHPATH)
954 static void free_findfile
__ARGS((void));
958 * Free everything that we allocated.
959 * Can be used to detect memory leaks, e.g., with ccmalloc.
960 * NOTE: This is tricky! Things are freed that functions depend on. Don't be
961 * surprised if Vim crashes...
962 * Some things can't be freed, esp. things local to a library function.
967 buf_T
*buf
, *nextbuf
;
968 static int entered
= FALSE
;
970 /* When we cause a crash here it is caught and Vim tries to exit cleanly.
971 * Don't try freeing everything again. */
977 block_autocmds(); /* don't want to trigger autocommands here */
981 /* close all tabs and windows */
982 if (first_tabpage
->tp_next
!= NULL
)
983 do_cmdline_cmd((char_u
*)"tabonly!");
984 if (firstwin
!= lastwin
)
985 do_cmdline_cmd((char_u
*)"only!");
988 # if defined(FEAT_SPELL)
989 /* Free all spell info. */
993 # if defined(FEAT_USR_CMDS)
994 /* Clear user commands (before deleting buffers). */
1000 do_cmdline_cmd((char_u
*)"aunmenu *");
1003 /* Clear mappings, abbreviations, breakpoints. */
1004 do_cmdline_cmd((char_u
*)"mapclear");
1005 do_cmdline_cmd((char_u
*)"mapclear!");
1006 do_cmdline_cmd((char_u
*)"abclear");
1007 # if defined(FEAT_EVAL)
1008 do_cmdline_cmd((char_u
*)"breakdel *");
1010 # if defined(FEAT_PROFILE)
1011 do_cmdline_cmd((char_u
*)"profdel *");
1017 # if defined(FEAT_SEARCHPATH)
1021 /* Obviously named calls. */
1022 # if defined(FEAT_AUTOCMD)
1023 free_all_autocmds();
1028 alist_clear(&global_alist
);
1030 free_search_patterns();
1033 free_prev_shellcmd();
1034 free_regexp_stuff();
1038 set_expr_line(NULL
);
1043 clear_sb_text(); /* free any scrollback text */
1045 /* Free some global vars. */
1047 # ifdef FEAT_CLIPBOARD
1048 vim_free(clip_exclude_prog
);
1050 vim_free(last_cmdline
);
1051 # ifdef FEAT_CMDHIST
1052 vim_free(new_last_cmdline
);
1054 set_keep_msg(NULL
, 0);
1055 vim_free(ff_expand_buffer
);
1057 /* Clear cmdline history. */
1059 # ifdef FEAT_CMDHIST
1063 #ifdef FEAT_QUICKFIX
1068 /* Free all location lists */
1069 FOR_ALL_WINDOWS(win
)
1074 /* Close all script inputs. */
1075 close_all_scripts();
1077 #if defined(FEAT_WINDOWS)
1078 /* Destroy all windows. Must come before freeing buffers. */
1082 /* Free all buffers. Reset 'autochdir' to avoid accessing things that
1083 * were freed already. */
1084 #ifdef FEAT_AUTOCHDIR
1087 for (buf
= firstbuf
; buf
!= NULL
; )
1089 nextbuf
= buf
->b_next
;
1090 close_buffer(NULL
, buf
, DOBUF_WIPE
);
1092 buf
= nextbuf
; /* didn't work, try next one */
1101 /* Clear registers. */
1106 #if defined(FEAT_CLIENTSERVER) && defined(FEAT_X11)
1107 vim_free(serverDelayedStartName
);
1110 /* highlight info */
1113 reset_last_sourcing();
1116 free_tabpage(first_tabpage
);
1117 first_tabpage
= NULL
;
1121 /* Machine-specific free. */
1125 /* message history */
1127 if (delete_first_msg() == FAIL
)
1136 /* screenlines (can't display anything now!) */
1139 #if defined(USE_XSMP)
1153 * copy a string into newly allocated memory
1162 len
= (unsigned)STRLEN(string
) + 1;
1165 mch_memmove(p
, string
, (size_t)len
);
1170 vim_strnsave(string
, len
)
1176 p
= alloc((unsigned)(len
+ 1));
1179 STRNCPY(p
, string
, len
);
1186 * Same as vim_strsave(), but any characters found in esc_chars are preceded
1190 vim_strsave_escaped(string
, esc_chars
)
1194 return vim_strsave_escaped_ext(string
, esc_chars
, '\\', FALSE
);
1198 * Same as vim_strsave_escaped(), but when "bsl" is TRUE also escape
1199 * characters where rem_backslash() would remove the backslash.
1200 * Escape the characters with "cc".
1203 vim_strsave_escaped_ext(string
, esc_chars
, cc
, bsl
)
1211 char_u
*escaped_string
;
1218 * First count the number of backslashes required.
1219 * Then allocate the memory and insert them.
1221 length
= 1; /* count the trailing NUL */
1222 for (p
= string
; *p
; p
++)
1225 if (has_mbyte
&& (l
= (*mb_ptr2len
)(p
)) > 1)
1227 length
+= l
; /* count a multibyte char */
1232 if (vim_strchr(esc_chars
, *p
) != NULL
|| (bsl
&& rem_backslash(p
)))
1233 ++length
; /* count a backslash */
1234 ++length
; /* count an ordinary char */
1236 escaped_string
= alloc(length
);
1237 if (escaped_string
!= NULL
)
1239 p2
= escaped_string
;
1240 for (p
= string
; *p
; p
++)
1243 if (has_mbyte
&& (l
= (*mb_ptr2len
)(p
)) > 1)
1245 mch_memmove(p2
, p
, (size_t)l
);
1247 p
+= l
- 1; /* skip multibyte char */
1251 if (vim_strchr(esc_chars
, *p
) != NULL
|| (bsl
&& rem_backslash(p
)))
1257 return escaped_string
;
1260 #if defined(FEAT_EVAL) || defined(PROTO)
1262 * Escape "string" for use as a shell argument with system().
1263 * This uses single quotes, except when we know we need to use double qoutes
1264 * (MS-DOS and MS-Windows without 'shellslash' set).
1265 * Also replace "%", "#" and things like "<cfile>" when "do_special" is TRUE.
1266 * Returns the result in allocated memory, NULL if we have run out.
1269 vim_strsave_shellescape(string
, do_special
)
1276 char_u
*escaped_string
;
1279 /* First count the number of extra bytes required. */
1280 length
= (unsigned)STRLEN(string
) + 3; /* two quotes and a trailing NUL */
1281 for (p
= string
; *p
!= NUL
; mb_ptr_adv(p
))
1283 # if defined(WIN32) || defined(WIN16) || defined(DOS)
1287 ++length
; /* " -> "" */
1292 length
+= 3; /* ' => '\'' */
1293 if (do_special
&& find_cmdline_var(p
, &l
) >= 0)
1295 ++length
; /* insert backslash */
1300 /* Allocate memory for the result and fill it. */
1301 escaped_string
= alloc(length
);
1302 if (escaped_string
!= NULL
)
1306 /* add opening quote */
1307 # if defined(WIN32) || defined(WIN16) || defined(DOS)
1314 for (p
= string
; *p
!= NUL
; )
1316 # if defined(WIN32) || defined(WIN16) || defined(DOS)
1338 if (do_special
&& find_cmdline_var(p
, &l
) >= 0)
1340 *d
++ = '\\'; /* insert backslash */
1341 while (--l
>= 0) /* copy the var */
1348 /* add terminating quote and finish with a NUL */
1349 # if defined(WIN32) || defined(WIN16) || defined(DOS)
1358 return escaped_string
;
1363 * Like vim_strsave(), but make all characters uppercase.
1364 * This uses ASCII lower-to-upper case translation, language independent.
1367 vim_strsave_up(string
)
1372 p1
= vim_strsave(string
);
1378 * Like vim_strnsave(), but make all characters uppercase.
1379 * This uses ASCII lower-to-upper case translation, language independent.
1382 vim_strnsave_up(string
, len
)
1388 p1
= vim_strnsave(string
, len
);
1394 * ASCII lower-to-upper case translation, language independent.
1406 while ((c
= *p2
) != NUL
)
1408 *p2
++ = isalpha(c
) ? toupper(c
) : c
;
1410 *p2
++ = (c
< 'a' || c
> 'z') ? c
: (c
- 0x20);
1415 #if defined(FEAT_EVAL) || defined(FEAT_SPELL) || defined(PROTO)
1417 * Make string "s" all upper-case and return it in allocated memory.
1418 * Handles multi-byte characters as well as possible.
1419 * Returns NULL when out of memory.
1428 res
= p
= vim_strsave(orig
);
1442 c
= utf_ptr2char(p
);
1443 uc
= utf_toupper(c
);
1445 /* Reallocate string when byte count changes. This is rare,
1446 * thus it's OK to do another malloc()/free(). */
1448 nl
= utf_char2len(uc
);
1451 s
= alloc((unsigned)STRLEN(res
) + 1 + nl
- l
);
1454 mch_memmove(s
, res
, p
- res
);
1455 STRCPY(s
+ (p
- res
) + nl
, p
+ l
);
1461 utf_char2bytes(uc
, p
);
1464 else if (has_mbyte
&& (l
= (*mb_ptr2len
)(p
)) > 1)
1465 p
+= l
; /* skip multi-byte character */
1469 *p
= TOUPPER_LOC(*p
); /* note that toupper() can be a macro */
1479 * copy a space a number of times
1482 copy_spaces(ptr
, count
)
1493 #if defined(FEAT_VISUALEXTRA) || defined(PROTO)
1495 * Copy a character a number of times.
1496 * Does not work for multi-byte charactes!
1499 copy_chars(ptr
, count
, c
)
1513 * delete spaces at the end of a string
1516 del_trailing_spaces(ptr
)
1521 q
= ptr
+ STRLEN(ptr
);
1522 while (--q
> ptr
&& vim_iswhite(q
[0]) && q
[-1] != '\\' && q
[-1] != Ctrl_V
)
1527 * Like strncpy(), but always terminate the result with one NUL.
1528 * "to" must be "len + 1" long!
1531 vim_strncpy(to
, from
, len
)
1536 STRNCPY(to
, from
, len
);
1541 * Isolate one part of a string option where parts are separated with
1543 * The part is copied into "buf[maxlen]".
1544 * "*option" is advanced to the next part.
1545 * The length is returned.
1548 copy_option_part(option
, buf
, maxlen
, sep_chars
)
1555 char_u
*p
= *option
;
1557 /* skip '.' at start of option part, for 'suffixes' */
1560 while (*p
!= NUL
&& vim_strchr((char_u
*)sep_chars
, *p
) == NULL
)
1563 * Skip backslash before a separator character and space.
1565 if (p
[0] == '\\' && vim_strchr((char_u
*)sep_chars
, p
[1]) != NULL
)
1567 if (len
< maxlen
- 1)
1573 if (*p
!= NUL
&& *p
!= ',') /* skip non-standard separator */
1575 p
= skip_to_option_part(p
); /* p points to next file name */
1582 * Replacement for free() that ignores NULL pointers.
1583 * Also skip free() when exiting for sure, this helps when we caught a deadly
1584 * signal that was caused by a crash in free().
1590 if (x
!= NULL
&& !really_exiting
)
1601 vim_memset(ptr
, c
, size
)
1616 * Return zero when "b1" and "b2" are the same for "len" bytes.
1617 * Return non-zero otherwise.
1620 vim_memcmp(b1
, b2
, len
)
1625 char_u
*p1
= (char_u
*)b1
, *p2
= (char_u
*)b2
;
1627 for ( ; len
> 0; --len
)
1640 * Version of memmove() that handles overlapping source and destination.
1641 * For systems that don't have a function that is guaranteed to do that (SYSV).
1644 mch_memmove(dst_arg
, src_arg
, len
)
1645 void *src_arg
, *dst_arg
;
1649 * A void doesn't have a size, we use char pointers.
1651 char *dst
= dst_arg
, *src
= src_arg
;
1653 /* overlap, copy backwards */
1654 if (dst
> src
&& dst
< src
+ len
)
1661 else /* copy forwards */
1667 #if (!defined(HAVE_STRCASECMP) && !defined(HAVE_STRICMP)) || defined(PROTO)
1669 * Compare two strings, ignoring case, using current locale.
1670 * Doesn't work for multi-byte characters.
1671 * return 0 for match, < 0 for smaller, > 0 for bigger
1682 i
= (int)TOLOWER_LOC(*s1
) - (int)TOLOWER_LOC(*s2
);
1684 return i
; /* this character different */
1686 break; /* strings match until NUL */
1690 return 0; /* strings match */
1694 #if (!defined(HAVE_STRNCASECMP) && !defined(HAVE_STRNICMP)) || defined(PROTO)
1696 * Compare two strings, for length "len", ignoring case, using current locale.
1697 * Doesn't work for multi-byte characters.
1698 * return 0 for match, < 0 for smaller, > 0 for bigger
1701 vim_strnicmp(s1
, s2
, len
)
1710 i
= (int)TOLOWER_LOC(*s1
) - (int)TOLOWER_LOC(*s2
);
1712 return i
; /* this character different */
1714 break; /* strings match until NUL */
1719 return 0; /* strings match */
1723 #if 0 /* currently not used */
1725 * Check if string "s2" appears somewhere in "s1" while ignoring case.
1726 * Return NULL if not, a pointer to the first occurrence if it does.
1734 int len
= STRLEN(s2
);
1735 char_u
*end
= s1
+ STRLEN(s1
) - len
;
1737 for (p
= s1
; p
<= end
; ++p
)
1738 if (STRNICMP(p
, s2
, len
) == 0)
1745 * Version of strchr() and strrchr() that handle unsigned char strings
1746 * with characters from 128 to 255 correctly. It also doesn't return a
1747 * pointer to the NUL at the end of the string.
1750 vim_strchr(string
, c
)
1759 if (enc_utf8
&& c
>= 0x80)
1763 if (utf_ptr2char(p
) == c
)
1765 p
+= (*mb_ptr2len
)(p
);
1769 if (enc_dbcs
!= 0 && c
> 255)
1773 c
= ((unsigned)c
>> 8) & 0xff;
1774 while ((b
= *p
) != NUL
)
1776 if (b
== c
&& p
[1] == n2
)
1778 p
+= (*mb_ptr2len
)(p
);
1784 while ((b
= *p
) != NUL
)
1788 p
+= (*mb_ptr2len
)(p
);
1793 while ((b
= *p
) != NUL
)
1803 * Version of strchr() that only works for bytes and handles unsigned char
1804 * strings with characters above 128 correctly. It also doesn't return a
1805 * pointer to the NUL at the end of the string.
1808 vim_strbyte(string
, c
)
1824 * Search for last occurrence of "c" in "string".
1825 * Return NULL if not found.
1826 * Does not handle multi-byte char for "c"!
1829 vim_strrchr(string
, c
)
1833 char_u
*retval
= NULL
;
1846 * Vim's version of strpbrk(), in case it's missing.
1847 * Don't generate a prototype for this, causes problems when it's not used.
1850 # ifndef HAVE_STRPBRK
1855 vim_strpbrk(s
, charset
)
1861 if (vim_strchr(charset
, *s
) != NULL
)
1871 * Vim has its own isspace() function, because on some machines isspace()
1872 * can't handle characters above 128.
1878 return ((x
>= 9 && x
<= 13) || x
== ' ');
1881 /************************************************************************
1882 * Functions for handling growing arrays.
1886 * Clear an allocated growing array.
1892 vim_free(gap
->ga_data
);
1897 * Clear a growing array that contains a list of strings.
1900 ga_clear_strings(gap
)
1905 for (i
= 0; i
< gap
->ga_len
; ++i
)
1906 vim_free(((char_u
**)(gap
->ga_data
))[i
]);
1911 * Initialize a growing array. Don't forget to set ga_itemsize and
1912 * ga_growsize! Or use ga_init2().
1918 gap
->ga_data
= NULL
;
1924 ga_init2(gap
, itemsize
, growsize
)
1930 gap
->ga_itemsize
= itemsize
;
1931 gap
->ga_growsize
= growsize
;
1935 * Make room in growing array "gap" for at least "n" items.
1936 * Return FAIL for failure, OK otherwise.
1946 if (gap
->ga_maxlen
- gap
->ga_len
< n
)
1948 if (n
< gap
->ga_growsize
)
1949 n
= gap
->ga_growsize
;
1950 len
= gap
->ga_itemsize
* (gap
->ga_len
+ n
);
1951 pp
= alloc_clear((unsigned)len
);
1954 gap
->ga_maxlen
= gap
->ga_len
+ n
;
1955 if (gap
->ga_data
!= NULL
)
1957 mch_memmove(pp
, gap
->ga_data
,
1958 (size_t)(gap
->ga_itemsize
* gap
->ga_len
));
1959 vim_free(gap
->ga_data
);
1967 * Concatenate a string to a growarray which contains characters.
1968 * Note: Does NOT copy the NUL at the end!
1975 int len
= (int)STRLEN(s
);
1977 if (ga_grow(gap
, len
) == OK
)
1979 mch_memmove((char *)gap
->ga_data
+ gap
->ga_len
, s
, (size_t)len
);
1985 * Append one byte to a growarray which contains bytes.
1992 if (ga_grow(gap
, 1) == OK
)
1994 *((char *)gap
->ga_data
+ gap
->ga_len
) = c
;
1999 /************************************************************************
2000 * functions that use lookup tables for various things, generally to do with
2001 * special key codes.
2005 * Some useful tables.
2008 static struct modmasktable
2010 short mod_mask
; /* Bit-mask for particular key modifier */
2011 short mod_flag
; /* Bit(s) for particular key modifier */
2012 char_u name
; /* Single letter name of modifier */
2013 } mod_mask_table
[] =
2015 {MOD_MASK_ALT
, MOD_MASK_ALT
, (char_u
)'M'},
2016 {MOD_MASK_META
, MOD_MASK_META
, (char_u
)'T'},
2017 {MOD_MASK_CTRL
, MOD_MASK_CTRL
, (char_u
)'C'},
2018 {MOD_MASK_SHIFT
, MOD_MASK_SHIFT
, (char_u
)'S'},
2019 {MOD_MASK_MULTI_CLICK
, MOD_MASK_2CLICK
, (char_u
)'2'},
2020 {MOD_MASK_MULTI_CLICK
, MOD_MASK_3CLICK
, (char_u
)'3'},
2021 {MOD_MASK_MULTI_CLICK
, MOD_MASK_4CLICK
, (char_u
)'4'},
2023 {MOD_MASK_CMD
, MOD_MASK_CMD
, (char_u
)'D'},
2025 /* 'A' must be the last one */
2026 {MOD_MASK_ALT
, MOD_MASK_ALT
, (char_u
)'A'},
2031 * Shifted key terminal codes and their unshifted equivalent.
2032 * Don't add mouse codes here, they are handled separately!
2034 #define MOD_KEYS_ENTRY_SIZE 5
2036 static char_u modifier_keys_table
[] =
2038 /* mod mask with modifier without modifier */
2039 MOD_MASK_SHIFT
, '&', '9', '@', '1', /* begin */
2040 MOD_MASK_SHIFT
, '&', '0', '@', '2', /* cancel */
2041 MOD_MASK_SHIFT
, '*', '1', '@', '4', /* command */
2042 MOD_MASK_SHIFT
, '*', '2', '@', '5', /* copy */
2043 MOD_MASK_SHIFT
, '*', '3', '@', '6', /* create */
2044 MOD_MASK_SHIFT
, '*', '4', 'k', 'D', /* delete char */
2045 MOD_MASK_SHIFT
, '*', '5', 'k', 'L', /* delete line */
2046 MOD_MASK_SHIFT
, '*', '7', '@', '7', /* end */
2047 MOD_MASK_CTRL
, KS_EXTRA
, (int)KE_C_END
, '@', '7', /* end */
2048 MOD_MASK_SHIFT
, '*', '9', '@', '9', /* exit */
2049 MOD_MASK_SHIFT
, '*', '0', '@', '0', /* find */
2050 MOD_MASK_SHIFT
, '#', '1', '%', '1', /* help */
2051 MOD_MASK_SHIFT
, '#', '2', 'k', 'h', /* home */
2052 MOD_MASK_CTRL
, KS_EXTRA
, (int)KE_C_HOME
, 'k', 'h', /* home */
2053 MOD_MASK_SHIFT
, '#', '3', 'k', 'I', /* insert */
2054 MOD_MASK_SHIFT
, '#', '4', 'k', 'l', /* left arrow */
2055 MOD_MASK_CTRL
, KS_EXTRA
, (int)KE_C_LEFT
, 'k', 'l', /* left arrow */
2056 MOD_MASK_SHIFT
, '%', 'a', '%', '3', /* message */
2057 MOD_MASK_SHIFT
, '%', 'b', '%', '4', /* move */
2058 MOD_MASK_SHIFT
, '%', 'c', '%', '5', /* next */
2059 MOD_MASK_SHIFT
, '%', 'd', '%', '7', /* options */
2060 MOD_MASK_SHIFT
, '%', 'e', '%', '8', /* previous */
2061 MOD_MASK_SHIFT
, '%', 'f', '%', '9', /* print */
2062 MOD_MASK_SHIFT
, '%', 'g', '%', '0', /* redo */
2063 MOD_MASK_SHIFT
, '%', 'h', '&', '3', /* replace */
2064 MOD_MASK_SHIFT
, '%', 'i', 'k', 'r', /* right arr. */
2065 MOD_MASK_CTRL
, KS_EXTRA
, (int)KE_C_RIGHT
, 'k', 'r', /* right arr. */
2066 MOD_MASK_SHIFT
, '%', 'j', '&', '5', /* resume */
2067 MOD_MASK_SHIFT
, '!', '1', '&', '6', /* save */
2068 MOD_MASK_SHIFT
, '!', '2', '&', '7', /* suspend */
2069 MOD_MASK_SHIFT
, '!', '3', '&', '8', /* undo */
2070 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_UP
, 'k', 'u', /* up arrow */
2071 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_DOWN
, 'k', 'd', /* down arrow */
2074 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_XF1
, KS_EXTRA
, (int)KE_XF1
,
2075 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_XF2
, KS_EXTRA
, (int)KE_XF2
,
2076 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_XF3
, KS_EXTRA
, (int)KE_XF3
,
2077 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_XF4
, KS_EXTRA
, (int)KE_XF4
,
2079 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F1
, 'k', '1', /* F1 */
2080 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F2
, 'k', '2',
2081 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F3
, 'k', '3',
2082 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F4
, 'k', '4',
2083 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F5
, 'k', '5',
2084 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F6
, 'k', '6',
2085 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F7
, 'k', '7',
2086 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F8
, 'k', '8',
2087 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F9
, 'k', '9',
2088 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F10
, 'k', ';', /* F10 */
2090 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F11
, 'F', '1',
2091 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F12
, 'F', '2',
2092 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F13
, 'F', '3',
2093 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F14
, 'F', '4',
2094 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F15
, 'F', '5',
2095 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F16
, 'F', '6',
2096 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F17
, 'F', '7',
2097 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F18
, 'F', '8',
2098 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F19
, 'F', '9',
2099 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F20
, 'F', 'A',
2101 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F21
, 'F', 'B',
2102 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F22
, 'F', 'C',
2103 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F23
, 'F', 'D',
2104 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F24
, 'F', 'E',
2105 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F25
, 'F', 'F',
2106 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F26
, 'F', 'G',
2107 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F27
, 'F', 'H',
2108 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F28
, 'F', 'I',
2109 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F29
, 'F', 'J',
2110 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F30
, 'F', 'K',
2112 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F31
, 'F', 'L',
2113 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F32
, 'F', 'M',
2114 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F33
, 'F', 'N',
2115 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F34
, 'F', 'O',
2116 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F35
, 'F', 'P',
2117 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F36
, 'F', 'Q',
2118 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F37
, 'F', 'R',
2120 /* TAB pseudo code*/
2121 MOD_MASK_SHIFT
, 'k', 'B', KS_EXTRA
, (int)KE_TAB
,
2126 static struct key_name_entry
2128 int key
; /* Special key code or ascii value */
2129 char_u
*name
; /* Name of key */
2130 } key_names_table
[] =
2132 {' ', (char_u
*)"Space"},
2133 {TAB
, (char_u
*)"Tab"},
2134 {K_TAB
, (char_u
*)"Tab"},
2135 {NL
, (char_u
*)"NL"},
2136 {NL
, (char_u
*)"NewLine"}, /* Alternative name */
2137 {NL
, (char_u
*)"LineFeed"}, /* Alternative name */
2138 {NL
, (char_u
*)"LF"}, /* Alternative name */
2139 {CAR
, (char_u
*)"CR"},
2140 {CAR
, (char_u
*)"Return"}, /* Alternative name */
2141 {CAR
, (char_u
*)"Enter"}, /* Alternative name */
2142 {K_BS
, (char_u
*)"BS"},
2143 {K_BS
, (char_u
*)"BackSpace"}, /* Alternative name */
2144 {ESC
, (char_u
*)"Esc"},
2145 {CSI
, (char_u
*)"CSI"},
2146 {K_CSI
, (char_u
*)"xCSI"},
2147 {'|', (char_u
*)"Bar"},
2148 {'\\', (char_u
*)"Bslash"},
2149 {K_DEL
, (char_u
*)"Del"},
2150 {K_DEL
, (char_u
*)"Delete"}, /* Alternative name */
2151 {K_KDEL
, (char_u
*)"kDel"},
2152 {K_UP
, (char_u
*)"Up"},
2153 {K_DOWN
, (char_u
*)"Down"},
2154 {K_LEFT
, (char_u
*)"Left"},
2155 {K_RIGHT
, (char_u
*)"Right"},
2156 {K_XUP
, (char_u
*)"xUp"},
2157 {K_XDOWN
, (char_u
*)"xDown"},
2158 {K_XLEFT
, (char_u
*)"xLeft"},
2159 {K_XRIGHT
, (char_u
*)"xRight"},
2161 {K_F1
, (char_u
*)"F1"},
2162 {K_F2
, (char_u
*)"F2"},
2163 {K_F3
, (char_u
*)"F3"},
2164 {K_F4
, (char_u
*)"F4"},
2165 {K_F5
, (char_u
*)"F5"},
2166 {K_F6
, (char_u
*)"F6"},
2167 {K_F7
, (char_u
*)"F7"},
2168 {K_F8
, (char_u
*)"F8"},
2169 {K_F9
, (char_u
*)"F9"},
2170 {K_F10
, (char_u
*)"F10"},
2172 {K_F11
, (char_u
*)"F11"},
2173 {K_F12
, (char_u
*)"F12"},
2174 {K_F13
, (char_u
*)"F13"},
2175 {K_F14
, (char_u
*)"F14"},
2176 {K_F15
, (char_u
*)"F15"},
2177 {K_F16
, (char_u
*)"F16"},
2178 {K_F17
, (char_u
*)"F17"},
2179 {K_F18
, (char_u
*)"F18"},
2180 {K_F19
, (char_u
*)"F19"},
2181 {K_F20
, (char_u
*)"F20"},
2183 {K_F21
, (char_u
*)"F21"},
2184 {K_F22
, (char_u
*)"F22"},
2185 {K_F23
, (char_u
*)"F23"},
2186 {K_F24
, (char_u
*)"F24"},
2187 {K_F25
, (char_u
*)"F25"},
2188 {K_F26
, (char_u
*)"F26"},
2189 {K_F27
, (char_u
*)"F27"},
2190 {K_F28
, (char_u
*)"F28"},
2191 {K_F29
, (char_u
*)"F29"},
2192 {K_F30
, (char_u
*)"F30"},
2194 {K_F31
, (char_u
*)"F31"},
2195 {K_F32
, (char_u
*)"F32"},
2196 {K_F33
, (char_u
*)"F33"},
2197 {K_F34
, (char_u
*)"F34"},
2198 {K_F35
, (char_u
*)"F35"},
2199 {K_F36
, (char_u
*)"F36"},
2200 {K_F37
, (char_u
*)"F37"},
2202 {K_XF1
, (char_u
*)"xF1"},
2203 {K_XF2
, (char_u
*)"xF2"},
2204 {K_XF3
, (char_u
*)"xF3"},
2205 {K_XF4
, (char_u
*)"xF4"},
2207 {K_HELP
, (char_u
*)"Help"},
2208 {K_UNDO
, (char_u
*)"Undo"},
2209 {K_INS
, (char_u
*)"Insert"},
2210 {K_INS
, (char_u
*)"Ins"}, /* Alternative name */
2211 {K_KINS
, (char_u
*)"kInsert"},
2212 {K_HOME
, (char_u
*)"Home"},
2213 {K_KHOME
, (char_u
*)"kHome"},
2214 {K_XHOME
, (char_u
*)"xHome"},
2215 {K_ZHOME
, (char_u
*)"zHome"},
2216 {K_END
, (char_u
*)"End"},
2217 {K_KEND
, (char_u
*)"kEnd"},
2218 {K_XEND
, (char_u
*)"xEnd"},
2219 {K_ZEND
, (char_u
*)"zEnd"},
2220 {K_PAGEUP
, (char_u
*)"PageUp"},
2221 {K_PAGEDOWN
, (char_u
*)"PageDown"},
2222 {K_KPAGEUP
, (char_u
*)"kPageUp"},
2223 {K_KPAGEDOWN
, (char_u
*)"kPageDown"},
2225 {K_KPLUS
, (char_u
*)"kPlus"},
2226 {K_KMINUS
, (char_u
*)"kMinus"},
2227 {K_KDIVIDE
, (char_u
*)"kDivide"},
2228 {K_KMULTIPLY
, (char_u
*)"kMultiply"},
2229 {K_KENTER
, (char_u
*)"kEnter"},
2230 {K_KPOINT
, (char_u
*)"kPoint"},
2232 {K_K0
, (char_u
*)"k0"},
2233 {K_K1
, (char_u
*)"k1"},
2234 {K_K2
, (char_u
*)"k2"},
2235 {K_K3
, (char_u
*)"k3"},
2236 {K_K4
, (char_u
*)"k4"},
2237 {K_K5
, (char_u
*)"k5"},
2238 {K_K6
, (char_u
*)"k6"},
2239 {K_K7
, (char_u
*)"k7"},
2240 {K_K8
, (char_u
*)"k8"},
2241 {K_K9
, (char_u
*)"k9"},
2243 {'<', (char_u
*)"lt"},
2245 {K_MOUSE
, (char_u
*)"Mouse"},
2246 {K_NETTERM_MOUSE
, (char_u
*)"NetMouse"},
2247 {K_DEC_MOUSE
, (char_u
*)"DecMouse"},
2248 {K_JSBTERM_MOUSE
, (char_u
*)"JsbMouse"},
2249 {K_PTERM_MOUSE
, (char_u
*)"PtermMouse"},
2250 {K_LEFTMOUSE
, (char_u
*)"LeftMouse"},
2251 {K_LEFTMOUSE_NM
, (char_u
*)"LeftMouseNM"},
2252 {K_LEFTDRAG
, (char_u
*)"LeftDrag"},
2253 {K_LEFTRELEASE
, (char_u
*)"LeftRelease"},
2254 {K_LEFTRELEASE_NM
, (char_u
*)"LeftReleaseNM"},
2255 {K_MIDDLEMOUSE
, (char_u
*)"MiddleMouse"},
2256 {K_MIDDLEDRAG
, (char_u
*)"MiddleDrag"},
2257 {K_MIDDLERELEASE
, (char_u
*)"MiddleRelease"},
2258 {K_RIGHTMOUSE
, (char_u
*)"RightMouse"},
2259 {K_RIGHTDRAG
, (char_u
*)"RightDrag"},
2260 {K_RIGHTRELEASE
, (char_u
*)"RightRelease"},
2261 {K_MOUSEDOWN
, (char_u
*)"MouseDown"},
2262 {K_MOUSEUP
, (char_u
*)"MouseUp"},
2263 {K_X1MOUSE
, (char_u
*)"X1Mouse"},
2264 {K_X1DRAG
, (char_u
*)"X1Drag"},
2265 {K_X1RELEASE
, (char_u
*)"X1Release"},
2266 {K_X2MOUSE
, (char_u
*)"X2Mouse"},
2267 {K_X2DRAG
, (char_u
*)"X2Drag"},
2268 {K_X2RELEASE
, (char_u
*)"X2Release"},
2269 {K_DROP
, (char_u
*)"Drop"},
2270 {K_ZERO
, (char_u
*)"Nul"},
2272 {K_SNR
, (char_u
*)"SNR"},
2274 {K_PLUG
, (char_u
*)"Plug"},
2278 #define KEY_NAMES_TABLE_LEN (sizeof(key_names_table) / sizeof(struct key_name_entry))
2281 static struct mousetable
2283 int pseudo_code
; /* Code for pseudo mouse event */
2284 int button
; /* Which mouse button is it? */
2285 int is_click
; /* Is it a mouse button click event? */
2286 int is_drag
; /* Is it a mouse drag event? */
2289 {(int)KE_LEFTMOUSE
, MOUSE_LEFT
, TRUE
, FALSE
},
2291 {(int)KE_LEFTMOUSE_NM
, MOUSE_LEFT
, TRUE
, FALSE
},
2293 {(int)KE_LEFTDRAG
, MOUSE_LEFT
, FALSE
, TRUE
},
2294 {(int)KE_LEFTRELEASE
, MOUSE_LEFT
, FALSE
, FALSE
},
2296 {(int)KE_LEFTRELEASE_NM
, MOUSE_LEFT
, FALSE
, FALSE
},
2298 {(int)KE_MIDDLEMOUSE
, MOUSE_MIDDLE
, TRUE
, FALSE
},
2299 {(int)KE_MIDDLEDRAG
, MOUSE_MIDDLE
, FALSE
, TRUE
},
2300 {(int)KE_MIDDLERELEASE
, MOUSE_MIDDLE
, FALSE
, FALSE
},
2301 {(int)KE_RIGHTMOUSE
, MOUSE_RIGHT
, TRUE
, FALSE
},
2302 {(int)KE_RIGHTDRAG
, MOUSE_RIGHT
, FALSE
, TRUE
},
2303 {(int)KE_RIGHTRELEASE
, MOUSE_RIGHT
, FALSE
, FALSE
},
2304 {(int)KE_X1MOUSE
, MOUSE_X1
, TRUE
, FALSE
},
2305 {(int)KE_X1DRAG
, MOUSE_X1
, FALSE
, TRUE
},
2306 {(int)KE_X1RELEASE
, MOUSE_X1
, FALSE
, FALSE
},
2307 {(int)KE_X2MOUSE
, MOUSE_X2
, TRUE
, FALSE
},
2308 {(int)KE_X2DRAG
, MOUSE_X2
, FALSE
, TRUE
},
2309 {(int)KE_X2RELEASE
, MOUSE_X2
, FALSE
, FALSE
},
2310 /* DRAG without CLICK */
2311 {(int)KE_IGNORE
, MOUSE_RELEASE
, FALSE
, TRUE
},
2312 /* RELEASE without CLICK */
2313 {(int)KE_IGNORE
, MOUSE_RELEASE
, FALSE
, FALSE
},
2316 #endif /* FEAT_MOUSE */
2319 * Return the modifier mask bit (MOD_MASK_*) which corresponds to the given
2320 * modifier name ('S' for Shift, 'C' for Ctrl etc).
2329 for (i
= 0; mod_mask_table
[i
].mod_mask
!= 0; i
++)
2330 if (c
== mod_mask_table
[i
].name
)
2331 return mod_mask_table
[i
].mod_flag
;
2336 * Check if if there is a special key code for "key" that includes the
2337 * modifiers specified.
2340 simplify_key(key
, modifiers
)
2348 if (*modifiers
& (MOD_MASK_SHIFT
| MOD_MASK_CTRL
| MOD_MASK_ALT
))
2350 /* TAB is a special case */
2351 if (key
== TAB
&& (*modifiers
& MOD_MASK_SHIFT
))
2353 *modifiers
&= ~MOD_MASK_SHIFT
;
2356 key0
= KEY2TERMCAP0(key
);
2357 key1
= KEY2TERMCAP1(key
);
2358 for (i
= 0; modifier_keys_table
[i
] != NUL
; i
+= MOD_KEYS_ENTRY_SIZE
)
2359 if (key0
== modifier_keys_table
[i
+ 3]
2360 && key1
== modifier_keys_table
[i
+ 4]
2361 && (*modifiers
& modifier_keys_table
[i
]))
2363 *modifiers
&= ~modifier_keys_table
[i
];
2364 return TERMCAP2KEY(modifier_keys_table
[i
+ 1],
2365 modifier_keys_table
[i
+ 2]);
2372 * Change <xHome> to <Home>, <xUp> to <Up>, etc.
2380 case K_XUP
: return K_UP
;
2381 case K_XDOWN
: return K_DOWN
;
2382 case K_XLEFT
: return K_LEFT
;
2383 case K_XRIGHT
: return K_RIGHT
;
2384 case K_XHOME
: return K_HOME
;
2385 case K_ZHOME
: return K_HOME
;
2386 case K_XEND
: return K_END
;
2387 case K_ZEND
: return K_END
;
2388 case K_XF1
: return K_F1
;
2389 case K_XF2
: return K_F2
;
2390 case K_XF3
: return K_F3
;
2391 case K_XF4
: return K_F4
;
2392 case K_S_XF1
: return K_S_F1
;
2393 case K_S_XF2
: return K_S_F2
;
2394 case K_S_XF3
: return K_S_F3
;
2395 case K_S_XF4
: return K_S_F4
;
2401 * Return a string which contains the name of the given key when the given
2402 * modifiers are down.
2405 get_special_key_name(c
, modifiers
)
2409 static char_u string
[MAX_KEY_NAME_LEN
+ 1];
2418 /* Key that stands for a normal character. */
2419 if (IS_SPECIAL(c
) && KEY2TERMCAP0(c
) == KS_KEY
)
2420 c
= KEY2TERMCAP1(c
);
2423 * Translate shifted special keys into unshifted keys and set modifier.
2424 * Same for CTRL and ALT modifiers.
2428 for (i
= 0; modifier_keys_table
[i
] != 0; i
+= MOD_KEYS_ENTRY_SIZE
)
2429 if ( KEY2TERMCAP0(c
) == (int)modifier_keys_table
[i
+ 1]
2430 && (int)KEY2TERMCAP1(c
) == (int)modifier_keys_table
[i
+ 2])
2432 modifiers
|= modifier_keys_table
[i
];
2433 c
= TERMCAP2KEY(modifier_keys_table
[i
+ 3],
2434 modifier_keys_table
[i
+ 4]);
2439 /* try to find the key in the special key table */
2440 table_idx
= find_special_key_in_table(c
);
2443 * When not a known special key, and not a printable character, try to
2444 * extract modifiers.
2448 && (*mb_char2len
)(c
) == 1
2453 && (!vim_isprintc(c
) || (c
& 0x7f) == ' ')
2457 modifiers
|= MOD_MASK_ALT
;
2458 /* try again, to find the un-alted key in the special key table */
2459 table_idx
= find_special_key_in_table(c
);
2461 if (table_idx
< 0 && !vim_isprintc(c
) && c
< ' ')
2468 modifiers
|= MOD_MASK_CTRL
;
2472 /* translate the modifier into a string */
2473 for (i
= 0; mod_mask_table
[i
].name
!= 'A'; i
++)
2474 if ((modifiers
& mod_mask_table
[i
].mod_mask
)
2475 == mod_mask_table
[i
].mod_flag
)
2477 string
[idx
++] = mod_mask_table
[i
].name
;
2478 string
[idx
++] = (char_u
)'-';
2481 if (table_idx
< 0) /* unknown special key, may output t_xx */
2485 string
[idx
++] = 't';
2486 string
[idx
++] = '_';
2487 string
[idx
++] = KEY2TERMCAP0(c
);
2488 string
[idx
++] = KEY2TERMCAP1(c
);
2490 /* Not a special key, only modifiers, output directly */
2494 if (has_mbyte
&& (*mb_char2len
)(c
) > 1)
2495 idx
+= (*mb_char2bytes
)(c
, string
+ idx
);
2498 if (vim_isprintc(c
))
2504 string
[idx
++] = *s
++;
2508 else /* use name of special key */
2510 STRCPY(string
+ idx
, key_names_table
[table_idx
].name
);
2511 idx
= (int)STRLEN(string
);
2513 string
[idx
++] = '>';
2519 * Try translating a <> name at (*srcp)[] to dst[].
2520 * Return the number of characters added to dst[], zero for no match.
2521 * If there is a match, srcp is advanced to after the <> name.
2522 * dst[] must be big enough to hold the result (up to six characters)!
2525 trans_special(srcp
, dst
, keycode
)
2528 int keycode
; /* prefer key code, e.g. K_DEL instead of DEL */
2534 key
= find_special_key(srcp
, &modifiers
, keycode
);
2538 /* Put the appropriate modifier in a string */
2541 dst
[dlen
++] = K_SPECIAL
;
2542 dst
[dlen
++] = KS_MODIFIER
;
2543 dst
[dlen
++] = modifiers
;
2546 if (IS_SPECIAL(key
))
2548 dst
[dlen
++] = K_SPECIAL
;
2549 dst
[dlen
++] = KEY2TERMCAP0(key
);
2550 dst
[dlen
++] = KEY2TERMCAP1(key
);
2553 else if (has_mbyte
&& !keycode
)
2554 dlen
+= (*mb_char2bytes
)(key
, dst
+ dlen
);
2557 dlen
= (int)(add_char2buf(key
, dst
+ dlen
) - dst
);
2565 * Try translating a <> name at (*srcp)[], return the key and modifiers.
2566 * srcp is advanced to after the <> name.
2567 * returns 0 if there is no match.
2570 find_special_key(srcp
, modp
, keycode
)
2573 int keycode
; /* prefer key code, e.g. K_DEL instead of DEL */
2576 char_u
*end_of_name
;
2588 /* Find end of modifier list */
2590 for (bp
= src
+ 1; *bp
== '-' || vim_isIDc(*bp
); bp
++)
2595 if (bp
[1] != NUL
&& bp
[2] == '>')
2596 ++bp
; /* anything accepted, like <C-?> */
2598 if (bp
[0] == 't' && bp
[1] == '_' && bp
[2] && bp
[3])
2599 bp
+= 3; /* skip t_xx, xx may be '-' or '>' */
2602 if (*bp
== '>') /* found matching '>' */
2604 end_of_name
= bp
+ 1;
2606 if (STRNICMP(src
+ 1, "char-", 5) == 0 && VIM_ISDIGIT(src
[6]))
2608 /* <Char-123> or <Char-033> or <Char-0x33> */
2609 vim_str2nr(src
+ 6, NULL
, NULL
, TRUE
, TRUE
, NULL
, &n
);
2611 *srcp
= end_of_name
;
2615 /* Which modifiers are given? */
2617 for (bp
= src
+ 1; bp
< last_dash
; bp
++)
2621 bit
= name_to_mod_mask(*bp
);
2623 break; /* Illegal modifier name */
2629 * Legal modifier name.
2631 if (bp
>= last_dash
)
2634 * Modifier with single letter, or special key name.
2636 if (modifiers
!= 0 && last_dash
[2] == '>')
2640 key
= get_special_key_code(last_dash
+ 1);
2641 key
= handle_x_keys(key
);
2645 * get_special_key_code() may return NUL for invalid
2651 * Only use a modifier when there is no special key code that
2652 * includes the modifier.
2654 key
= simplify_key(key
, &modifiers
);
2658 /* don't want keycode, use single byte code */
2661 else if (key
== K_DEL
|| key
== K_KDEL
)
2666 * Normal Key with modifier: Try to make a single byte code.
2668 if (!IS_SPECIAL(key
))
2669 key
= extract_modifiers(key
, &modifiers
);
2672 *srcp
= end_of_name
;
2681 * Try to include modifiers in the key.
2682 * Changes "Shift-a" to 'A', "Alt-A" to 0xc0, etc.
2685 extract_modifiers(key
, modp
)
2689 int modifiers
= *modp
;
2692 /* Command-key really special, No fancynest */
2693 if (!(modifiers
& MOD_MASK_CMD
))
2695 if ((modifiers
& MOD_MASK_SHIFT
) && ASCII_ISALPHA(key
))
2697 key
= TOUPPER_ASC(key
);
2698 modifiers
&= ~MOD_MASK_SHIFT
;
2700 if ((modifiers
& MOD_MASK_CTRL
)
2702 /* * TODO: EBCDIC Better use:
2703 * && (Ctrl_chr(key) || key == '?')
2705 && strchr("?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_", key
)
2708 && ((key
>= '?' && key
<= '_') || ASCII_ISALPHA(key
))
2712 key
= Ctrl_chr(key
);
2713 modifiers
&= ~MOD_MASK_CTRL
;
2714 /* <C-@> is <Nul> */
2719 /* Command-key really special, No fancynest */
2720 if (!(modifiers
& MOD_MASK_CMD
))
2722 if ((modifiers
& MOD_MASK_ALT
) && key
< 0x80
2724 && !enc_dbcs
/* avoid creating a lead byte */
2729 modifiers
&= ~MOD_MASK_ALT
; /* remove the META modifier */
2737 * Try to find key "c" in the special key table.
2738 * Return the index when found, -1 when not found.
2741 find_special_key_in_table(c
)
2746 for (i
= 0; key_names_table
[i
].name
!= NULL
; i
++)
2747 if (c
== key_names_table
[i
].key
)
2749 if (key_names_table
[i
].name
== NULL
)
2755 * Find the special key with the given name (the given string does not have to
2756 * end with NUL, the name is assumed to end before the first non-idchar).
2757 * If the name starts with "t_" the next two characters are interpreted as a
2759 * Return the key code, or 0 if not found.
2762 get_special_key_code(name
)
2770 * If it's <t_xx> we get the code for xx from the termcap
2772 if (name
[0] == 't' && name
[1] == '_' && name
[2] != NUL
&& name
[3] != NUL
)
2774 string
[0] = name
[2];
2775 string
[1] = name
[3];
2777 if (add_termcap_entry(string
, FALSE
) == OK
)
2778 return TERMCAP2KEY(name
[2], name
[3]);
2781 for (i
= 0; key_names_table
[i
].name
!= NULL
; i
++)
2783 table_name
= key_names_table
[i
].name
;
2784 for (j
= 0; vim_isIDc(name
[j
]) && table_name
[j
] != NUL
; j
++)
2785 if (TOLOWER_ASC(table_name
[j
]) != TOLOWER_ASC(name
[j
]))
2787 if (!vim_isIDc(name
[j
]) && table_name
[j
] == NUL
)
2788 return key_names_table
[i
].key
;
2793 #if defined(FEAT_CMDL_COMPL) || defined(PROTO)
2798 if (i
>= KEY_NAMES_TABLE_LEN
)
2800 return key_names_table
[i
].name
;
2804 #if defined(FEAT_MOUSE) || defined(PROTO)
2806 * Look up the given mouse code to return the relevant information in the other
2807 * arguments. Return which button is down or was released.
2810 get_mouse_button(code
, is_click
, is_drag
)
2817 for (i
= 0; mouse_table
[i
].pseudo_code
; i
++)
2818 if (code
== mouse_table
[i
].pseudo_code
)
2820 *is_click
= mouse_table
[i
].is_click
;
2821 *is_drag
= mouse_table
[i
].is_drag
;
2822 return mouse_table
[i
].button
;
2824 return 0; /* Shouldn't get here */
2828 * Return the appropriate pseudo mouse event token (KE_LEFTMOUSE etc) based on
2829 * the given information about which mouse button is down, and whether the
2830 * mouse was clicked, dragged or released.
2833 get_pseudo_mouse_code(button
, is_click
, is_drag
)
2834 int button
; /* eg MOUSE_LEFT */
2840 for (i
= 0; mouse_table
[i
].pseudo_code
; i
++)
2841 if (button
== mouse_table
[i
].button
2842 && is_click
== mouse_table
[i
].is_click
2843 && is_drag
== mouse_table
[i
].is_drag
)
2846 /* Trick: a non mappable left click and release has mouse_col -1
2847 * or added MOUSE_COLOFF. Used for 'mousefocus' in
2848 * gui_mouse_moved() */
2849 if (mouse_col
< 0 || mouse_col
> MOUSE_COLOFF
)
2854 mouse_col
-= MOUSE_COLOFF
;
2855 if (mouse_table
[i
].pseudo_code
== (int)KE_LEFTMOUSE
)
2856 return (int)KE_LEFTMOUSE_NM
;
2857 if (mouse_table
[i
].pseudo_code
== (int)KE_LEFTRELEASE
)
2858 return (int)KE_LEFTRELEASE_NM
;
2861 return mouse_table
[i
].pseudo_code
;
2863 return (int)KE_IGNORE
; /* not recognized, ignore it */
2865 #endif /* FEAT_MOUSE */
2868 * Return the current end-of-line type: EOL_DOS, EOL_UNIX or EOL_MAC.
2874 int c
= *buf
->b_p_ff
;
2876 if (buf
->b_p_bin
|| c
== 'u')
2884 * Like get_fileformat(), but override 'fileformat' with "p" for "++opt=val"
2888 get_fileformat_force(buf
, eap
)
2890 exarg_T
*eap
; /* can be NULL! */
2894 if (eap
!= NULL
&& eap
->force_ff
!= 0)
2895 c
= eap
->cmd
[eap
->force_ff
];
2898 if ((eap
!= NULL
&& eap
->force_bin
!= 0)
2899 ? (eap
->force_bin
== FORCE_BIN
) : buf
->b_p_bin
)
2911 * Set the current end-of-line type to EOL_DOS, EOL_UNIX or EOL_MAC.
2912 * Sets both 'textmode' and 'fileformat'.
2913 * Note: Does _not_ set global value of 'textmode'!
2916 set_fileformat(t
, opt_flags
)
2918 int opt_flags
; /* OPT_LOCAL and/or OPT_GLOBAL */
2926 curbuf
->b_p_tx
= TRUE
;
2930 curbuf
->b_p_tx
= FALSE
;
2934 curbuf
->b_p_tx
= FALSE
;
2938 set_string_option_direct((char_u
*)"ff", -1, (char_u
*)p
,
2939 OPT_FREE
| opt_flags
, 0);
2942 /* This may cause the buffer to become (un)modified. */
2943 check_status(curbuf
);
2944 redraw_tabline
= TRUE
;
2947 need_maketitle
= TRUE
; /* set window title later */
2952 * Return the default fileformat from 'fileformats'.
2955 default_fileformat()
2959 case 'm': return EOL_MAC
;
2960 case 'd': return EOL_DOS
;
2966 * Call shell. Calls mch_call_shell, with 'shellxquote' added.
2969 call_shell(cmd
, opt
)
2976 proftime_T wait_time
;
2982 smsg((char_u
*)_("Calling shell to execute: \"%s\""),
2983 cmd
== NULL
? p_sh
: cmd
);
2990 if (do_profiling
== PROF_YES
)
2991 prof_child_enter(&wait_time
);
2996 EMSG(_(e_shellempty
));
3001 #ifdef FEAT_GUI_MSWIN
3002 /* Don't hide the pointer while executing a shell command. */
3003 gui_mch_mousehide(FALSE
);
3008 /* The external command may update a tags file, clear cached tags. */
3011 if (cmd
== NULL
|| *p_sxq
== NUL
)
3012 retval
= mch_call_shell(cmd
, opt
);
3015 ncmd
= alloc((unsigned)(STRLEN(cmd
) + STRLEN(p_sxq
) * 2 + 1));
3018 STRCPY(ncmd
, p_sxq
);
3020 STRCAT(ncmd
, p_sxq
);
3021 retval
= mch_call_shell(ncmd
, opt
);
3031 * Check the window size, in case it changed while executing the
3034 shell_resized_check();
3038 set_vim_var_nr(VV_SHELL_ERROR
, (long)retval
);
3039 # ifdef FEAT_PROFILE
3040 if (do_profiling
== PROF_YES
)
3041 prof_child_exit(&wait_time
);
3049 * VISUAL, SELECTMODE and OP_PENDING State are never set, they are equal to
3050 * NORMAL State with a condition. This function returns the real State.
3072 #if defined(FEAT_MBYTE) || defined(PROTO)
3074 * Return TRUE if "p" points to just after a path separator.
3075 * Take care of multi-byte characters.
3076 * "b" must point to the start of the file name
3083 return vim_ispathsep(p
[-1])
3084 && (!has_mbyte
|| (*mb_head_off
)(b
, p
- 1) == 0);
3089 * Return TRUE if file names "f1" and "f2" are in the same directory.
3090 * "f1" may be a short name, "f2" must be a full path.
3093 same_directory(f1
, f2
)
3097 char_u ffname
[MAXPATHL
];
3102 if (f1
== NULL
|| f2
== NULL
)
3105 (void)vim_FullName(f1
, ffname
, MAXPATHL
, FALSE
);
3106 t1
= gettail_sep(ffname
);
3107 t2
= gettail_sep(f2
);
3108 return (t1
- ffname
== t2
- f2
3109 && pathcmp((char *)ffname
, (char *)f2
, (int)(t1
- ffname
)) == 0);
3112 #if defined(FEAT_SESSION) || defined(MSWIN) || defined(FEAT_GUI_MAC) \
3113 || ((defined(FEAT_GUI_GTK)) \
3114 && ( defined(FEAT_WINDOWS) || defined(FEAT_DND)) ) \
3115 || defined(FEAT_SUN_WORKSHOP) || defined(FEAT_NETBEANS_INTG) \
3118 * Change to a file's directory.
3119 * Caller must call shorten_fnames()!
3120 * Return OK or FAIL.
3123 vim_chdirfile(fname
)
3126 char_u dir
[MAXPATHL
];
3128 vim_strncpy(dir
, fname
, MAXPATHL
- 1);
3129 *gettail_sep(dir
) = NUL
;
3130 return mch_chdir((char *)dir
) == 0 ? OK
: FAIL
;
3134 #if defined(STAT_IGNORES_SLASH) || defined(PROTO)
3136 * Check if "name" ends in a slash and is not a directory.
3137 * Used for systems where stat() ignores a trailing slash on a file name.
3138 * The Vim code assumes a trailing slash is only ignored for a directory.
3145 return FALSE
; /* no file name is not illegal */
3146 if (name
[strlen(name
) - 1] != '/')
3147 return FALSE
; /* no trailing slash */
3148 if (mch_isdir((char_u
*)name
))
3149 return FALSE
; /* trailing slash for a directory */
3154 #if defined(CURSOR_SHAPE) || defined(PROTO)
3157 * Handling of cursor and mouse pointer shapes in various modes.
3160 cursorentry_T shape_table
[SHAPE_IDX_COUNT
] =
3162 /* The values will be filled in from the 'guicursor' and 'mouseshape'
3163 * defaults when Vim starts.
3164 * Adjust the SHAPE_IDX_ defines when making changes! */
3165 {0, 0, 0, 700L, 400L, 250L, 0, 0, "n", SHAPE_CURSOR
+SHAPE_MOUSE
},
3166 {0, 0, 0, 700L, 400L, 250L, 0, 0, "v", SHAPE_CURSOR
+SHAPE_MOUSE
},
3167 {0, 0, 0, 700L, 400L, 250L, 0, 0, "i", SHAPE_CURSOR
+SHAPE_MOUSE
},
3168 {0, 0, 0, 700L, 400L, 250L, 0, 0, "r", SHAPE_CURSOR
+SHAPE_MOUSE
},
3169 {0, 0, 0, 700L, 400L, 250L, 0, 0, "c", SHAPE_CURSOR
+SHAPE_MOUSE
},
3170 {0, 0, 0, 700L, 400L, 250L, 0, 0, "ci", SHAPE_CURSOR
+SHAPE_MOUSE
},
3171 {0, 0, 0, 700L, 400L, 250L, 0, 0, "cr", SHAPE_CURSOR
+SHAPE_MOUSE
},
3172 {0, 0, 0, 700L, 400L, 250L, 0, 0, "o", SHAPE_CURSOR
+SHAPE_MOUSE
},
3173 {0, 0, 0, 700L, 400L, 250L, 0, 0, "ve", SHAPE_CURSOR
+SHAPE_MOUSE
},
3174 {0, 0, 0, 0L, 0L, 0L, 0, 0, "e", SHAPE_MOUSE
},
3175 {0, 0, 0, 0L, 0L, 0L, 0, 0, "s", SHAPE_MOUSE
},
3176 {0, 0, 0, 0L, 0L, 0L, 0, 0, "sd", SHAPE_MOUSE
},
3177 {0, 0, 0, 0L, 0L, 0L, 0, 0, "vs", SHAPE_MOUSE
},
3178 {0, 0, 0, 0L, 0L, 0L, 0, 0, "vd", SHAPE_MOUSE
},
3179 {0, 0, 0, 0L, 0L, 0L, 0, 0, "m", SHAPE_MOUSE
},
3180 {0, 0, 0, 0L, 0L, 0L, 0, 0, "ml", SHAPE_MOUSE
},
3181 {0, 0, 0, 100L, 100L, 100L, 0, 0, "sm", SHAPE_CURSOR
},
3184 #ifdef FEAT_MOUSESHAPE
3186 * Table with names for mouse shapes. Keep in sync with all the tables for
3187 * mch_set_mouse_shape()!.
3189 static char * mshape_names
[] =
3191 "arrow", /* default, must be the first one */
3192 "blank", /* hidden */
3212 * Parse the 'guicursor' option ("what" is SHAPE_CURSOR) or 'mouseshape'
3213 * ("what" is SHAPE_MOUSE).
3214 * Returns error message for an illegal option, NULL otherwise.
3217 parse_shape_opt(what
)
3225 int idx
= 0; /* init for GCC */
3230 int found_ve
= FALSE
; /* found "ve" flag */
3234 * First round: check for errors; second round: do it for real.
3236 for (round
= 1; round
<= 2; ++round
)
3239 * Repeat for all comma separated parts.
3241 #ifdef FEAT_MOUSESHAPE
3242 if (what
== SHAPE_MOUSE
)
3243 modep
= p_mouseshape
;
3246 modep
= p_guicursor
;
3247 while (*modep
!= NUL
)
3249 colonp
= vim_strchr(modep
, ':');
3251 return (char_u
*)N_("E545: Missing colon");
3252 if (colonp
== modep
)
3253 return (char_u
*)N_("E546: Illegal mode");
3254 commap
= vim_strchr(modep
, ',');
3257 * Repeat for all mode's before the colon.
3258 * For the 'a' mode, we loop to handle all the modes.
3261 while (modep
< colonp
|| all_idx
>= 0)
3265 /* Find the mode. */
3266 if (modep
[1] == '-' || modep
[1] == ':')
3270 if (len
== 1 && TOLOWER_ASC(modep
[0]) == 'a')
3271 all_idx
= SHAPE_IDX_COUNT
- 1;
3274 for (idx
= 0; idx
< SHAPE_IDX_COUNT
; ++idx
)
3275 if (STRNICMP(modep
, shape_table
[idx
].name
, len
)
3278 if (idx
== SHAPE_IDX_COUNT
3279 || (shape_table
[idx
].used_for
& what
) == 0)
3280 return (char_u
*)N_("E546: Illegal mode");
3281 if (len
== 2 && modep
[0] == 'v' && modep
[1] == 'e')
3289 else if (round
== 2)
3291 #ifdef FEAT_MOUSESHAPE
3292 if (what
== SHAPE_MOUSE
)
3294 /* Set the default, for the missing parts */
3295 shape_table
[idx
].mshape
= 0;
3300 /* Set the defaults, for the missing parts */
3301 shape_table
[idx
].shape
= SHAPE_BLOCK
;
3302 shape_table
[idx
].blinkwait
= 700L;
3303 shape_table
[idx
].blinkon
= 400L;
3304 shape_table
[idx
].blinkoff
= 250L;
3308 /* Parse the part after the colon */
3309 for (p
= colonp
+ 1; *p
&& *p
!= ','; )
3311 #ifdef FEAT_MOUSESHAPE
3312 if (what
== SHAPE_MOUSE
)
3316 if (mshape_names
[i
] == NULL
)
3318 if (!VIM_ISDIGIT(*p
))
3319 return (char_u
*)N_("E547: Illegal mouseshape");
3321 shape_table
[idx
].mshape
=
3322 getdigits(&p
) + MSHAPE_NUMBERED
;
3324 (void)getdigits(&p
);
3327 len
= (int)STRLEN(mshape_names
[i
]);
3328 if (STRNICMP(p
, mshape_names
[i
], len
) == 0)
3331 shape_table
[idx
].mshape
= i
;
3337 else /* if (what == SHAPE_MOUSE) */
3341 * First handle the ones with a number argument.
3345 if (STRNICMP(p
, "ver", 3) == 0)
3347 else if (STRNICMP(p
, "hor", 3) == 0)
3349 else if (STRNICMP(p
, "blinkwait", 9) == 0)
3351 else if (STRNICMP(p
, "blinkon", 7) == 0)
3353 else if (STRNICMP(p
, "blinkoff", 8) == 0)
3358 if (!VIM_ISDIGIT(*p
))
3359 return (char_u
*)N_("E548: digit expected");
3361 if (len
== 3) /* "ver" or "hor" */
3364 return (char_u
*)N_("E549: Illegal percentage");
3367 if (TOLOWER_ASC(i
) == 'v')
3368 shape_table
[idx
].shape
= SHAPE_VER
;
3370 shape_table
[idx
].shape
= SHAPE_HOR
;
3371 shape_table
[idx
].percentage
= n
;
3374 else if (round
== 2)
3377 shape_table
[idx
].blinkwait
= n
;
3379 shape_table
[idx
].blinkon
= n
;
3381 shape_table
[idx
].blinkoff
= n
;
3384 else if (STRNICMP(p
, "block", 5) == 0)
3387 shape_table
[idx
].shape
= SHAPE_BLOCK
;
3390 else /* must be a highlight group name then */
3392 endp
= vim_strchr(p
, '-');
3393 if (commap
== NULL
) /* last part */
3396 endp
= p
+ STRLEN(p
); /* find end of part */
3398 else if (endp
> commap
|| endp
== NULL
)
3400 slashp
= vim_strchr(p
, '/');
3401 if (slashp
!= NULL
&& slashp
< endp
)
3403 /* "group/langmap_group" */
3404 i
= syn_check_group(p
, (int)(slashp
- p
));
3409 shape_table
[idx
].id
= syn_check_group(p
,
3411 shape_table
[idx
].id_lm
= shape_table
[idx
].id
;
3412 if (slashp
!= NULL
&& slashp
< endp
)
3413 shape_table
[idx
].id
= i
;
3417 } /* if (what != SHAPE_MOUSE) */
3429 /* If the 's' flag is not given, use the 'v' cursor for 's' */
3432 #ifdef FEAT_MOUSESHAPE
3433 if (what
== SHAPE_MOUSE
)
3435 shape_table
[SHAPE_IDX_VE
].mshape
= shape_table
[SHAPE_IDX_V
].mshape
;
3440 shape_table
[SHAPE_IDX_VE
].shape
= shape_table
[SHAPE_IDX_V
].shape
;
3441 shape_table
[SHAPE_IDX_VE
].percentage
=
3442 shape_table
[SHAPE_IDX_V
].percentage
;
3443 shape_table
[SHAPE_IDX_VE
].blinkwait
=
3444 shape_table
[SHAPE_IDX_V
].blinkwait
;
3445 shape_table
[SHAPE_IDX_VE
].blinkon
=
3446 shape_table
[SHAPE_IDX_V
].blinkon
;
3447 shape_table
[SHAPE_IDX_VE
].blinkoff
=
3448 shape_table
[SHAPE_IDX_V
].blinkoff
;
3449 shape_table
[SHAPE_IDX_VE
].id
= shape_table
[SHAPE_IDX_V
].id
;
3450 shape_table
[SHAPE_IDX_VE
].id_lm
= shape_table
[SHAPE_IDX_V
].id_lm
;
3457 # if defined(MCH_CURSOR_SHAPE) || defined(FEAT_GUI) \
3458 || defined(FEAT_MOUSESHAPE) || defined(PROTO)
3460 * Return the index into shape_table[] for the current mode.
3461 * When "mouse" is TRUE, consider indexes valid for the mouse pointer.
3464 get_shape_idx(mouse
)
3467 #ifdef FEAT_MOUSESHAPE
3468 if (mouse
&& (State
== HITRETURN
|| State
== ASKMORE
))
3472 gui_mch_getmouse(&x
, &y
);
3473 if (Y_2_ROW(y
) == Rows
- 1)
3474 return SHAPE_IDX_MOREL
;
3476 return SHAPE_IDX_MORE
;
3478 if (mouse
&& drag_status_line
)
3479 return SHAPE_IDX_SDRAG
;
3480 # ifdef FEAT_VERTSPLIT
3481 if (mouse
&& drag_sep_line
)
3482 return SHAPE_IDX_VDRAG
;
3485 if (!mouse
&& State
== SHOWMATCH
)
3486 return SHAPE_IDX_SM
;
3487 #ifdef FEAT_VREPLACE
3488 if (State
& VREPLACE_FLAG
)
3491 if (State
& REPLACE_FLAG
)
3495 if (State
& CMDLINE
)
3497 if (cmdline_at_end())
3499 if (cmdline_overstrike())
3500 return SHAPE_IDX_CR
;
3501 return SHAPE_IDX_CI
;
3509 return SHAPE_IDX_VE
;
3518 # if defined(FEAT_MOUSESHAPE) || defined(PROTO)
3519 static int old_mouse_shape
= 0;
3522 * Set the mouse shape:
3523 * If "shape" is -1, use shape depending on the current mode,
3524 * depending on the current state.
3525 * If "shape" is -2, only update the shape when it's CLINE or STATUS (used
3526 * when the mouse moves off the status or command line).
3529 update_mouseshape(shape_idx
)
3532 int new_mouse_shape
;
3534 /* Only works in GUI mode. */
3535 if (!gui
.in_use
|| gui
.starting
)
3538 /* Postpone the updating when more is to come. Speeds up executing of
3540 if (shape_idx
== -1 && char_avail())
3542 postponed_mouseshape
= TRUE
;
3546 /* When ignoring the mouse don't change shape on the statusline. */
3548 && (shape_idx
== SHAPE_IDX_CLINE
3549 || shape_idx
== SHAPE_IDX_STATUS
3550 || shape_idx
== SHAPE_IDX_VSEP
))
3554 && old_mouse_shape
!= shape_table
[SHAPE_IDX_CLINE
].mshape
3555 && old_mouse_shape
!= shape_table
[SHAPE_IDX_STATUS
].mshape
3556 && old_mouse_shape
!= shape_table
[SHAPE_IDX_VSEP
].mshape
)
3559 new_mouse_shape
= shape_table
[get_shape_idx(TRUE
)].mshape
;
3561 new_mouse_shape
= shape_table
[shape_idx
].mshape
;
3562 if (new_mouse_shape
!= old_mouse_shape
)
3564 mch_set_mouse_shape(new_mouse_shape
);
3565 old_mouse_shape
= new_mouse_shape
;
3567 postponed_mouseshape
= FALSE
;
3571 #endif /* CURSOR_SHAPE */
3576 * Optional encryption support.
3577 * Mohsin Ahmed, mosh@sasi.com, 98-09-24
3578 * Based on zip/crypt sources.
3580 * NOTE FOR USA: Since 2000 exporting this code from the USA is allowed to
3581 * most countries. There are a few exceptions, but that still should not be a
3582 * problem since this code was originally created in Europe and India.
3587 typedef unsigned short ush
; /* unsigned 16-bit value */
3588 typedef unsigned long ulg
; /* unsigned 32-bit value */
3590 static void make_crc_tab
__ARGS((void));
3592 static ulg crc_32_tab
[256];
3595 * Fill the CRC table.
3601 static int done
= FALSE
;
3605 for (t
= 0; t
< 256; t
++)
3608 for (s
= 0; s
< 8; s
++)
3609 v
= (v
>> 1) ^ ((v
& 1) * (ulg
)0xedb88320L
);
3615 #define CRC32(c, b) (crc_32_tab[((int)(c) ^ (b)) & 0xff] ^ ((c) >> 8))
3618 static ulg keys
[3]; /* keys defining the pseudo-random sequence */
3621 * Return the next byte in the pseudo-random sequence
3628 temp
= (ush
)keys
[2] | 2;
3629 return (int)(((unsigned)(temp
* (temp
^ 1)) >> 8) & 0xff);
3633 * Update the encryption keys with the next byte of plain text
3637 int c
; /* byte of plain text */
3639 keys
[0] = CRC32(keys
[0], c
);
3640 keys
[1] += keys
[0] & 0xff;
3641 keys
[1] = keys
[1] * 134775813L + 1;
3642 keys
[2] = CRC32(keys
[2], (int)(keys
[1] >> 24));
3647 * Initialize the encryption keys and the random header according to
3648 * the given password.
3649 * If "passwd" is NULL or empty, don't do anything.
3652 crypt_init_keys(passwd
)
3653 char_u
*passwd
; /* password string with which to modify keys */
3655 if (passwd
!= NULL
&& *passwd
!= NUL
)
3658 keys
[0] = 305419896L;
3659 keys
[1] = 591751049L;
3660 keys
[2] = 878082192L;
3661 while (*passwd
!= '\0')
3662 update_keys((int)*passwd
++);
3667 * Ask the user for a crypt key.
3668 * When "store" is TRUE, the new key in stored in the 'key' option, and the
3669 * 'key' option value is returned: Don't free it.
3670 * When "store" is FALSE, the typed key is returned in allocated memory.
3671 * Returns NULL on failure.
3674 get_crypt_key(store
, twice
)
3676 int twice
; /* Ask for the key twice. */
3678 char_u
*p1
, *p2
= NULL
;
3681 for (round
= 0; ; ++round
)
3683 cmdline_star
= TRUE
;
3684 cmdline_row
= msg_row
;
3685 p1
= getcmdline_prompt(NUL
, round
== 0
3686 ? (char_u
*)_("Enter encryption key: ")
3687 : (char_u
*)_("Enter same key again: "), 0, EXPAND_NOTHING
,
3689 cmdline_star
= FALSE
;
3696 if (p2
!= NULL
&& STRCMP(p1
, p2
) != 0)
3698 MSG(_("Keys don't match!"));
3702 round
= -1; /* do it again */
3707 set_option_value((char_u
*)"key", 0L, p1
, OPT_LOCAL
);
3709 p1
= curbuf
->b_p_key
;
3716 /* since the user typed this, no need to wait for return */
3717 need_wait_return
= FALSE
;
3724 #endif /* FEAT_CRYPT */
3726 /* TODO: make some #ifdef for this */
3727 /*--------[ file searching ]-------------------------------------------------*/
3729 * File searching functions for 'path', 'tags' and 'cdpath' options.
3730 * External visible functions:
3731 * vim_findfile_init() creates/initialises the search context
3732 * vim_findfile_free_visited() free list of visited files/dirs of search
3734 * vim_findfile() find a file in the search context
3735 * vim_findfile_cleanup() cleanup/free search context created by
3736 * vim_findfile_init()
3738 * All static functions and variables start with 'ff_'
3740 * In general it works like this:
3741 * First you create yourself a search context by calling vim_findfile_init().
3742 * It is possible to give a search context from a previous call to
3743 * vim_findfile_init(), so it can be reused. After this you call vim_findfile()
3744 * until you are satisfied with the result or it returns NULL. On every call it
3745 * returns the next file which matches the conditions given to
3746 * vim_findfile_init(). If it doesn't find a next file it returns NULL.
3748 * It is possible to call vim_findfile_init() again to reinitialise your search
3749 * with some new parameters. Don't forget to pass your old search context to
3750 * it, so it can reuse it and especially reuse the list of already visited
3751 * directories. If you want to delete the list of already visited directories
3752 * simply call vim_findfile_free_visited().
3754 * When you are done call vim_findfile_cleanup() to free the search context.
3756 * The function vim_findfile_init() has a long comment, which describes the
3757 * needed parameters.
3763 * Also we use an allocated search context here, this functions are NOT
3766 * To minimize parameter passing (or because I'm to lazy), only the
3767 * external visible functions get a search context as a parameter. This is
3768 * then assigned to a static global, which is used throughout the local
3773 * type for the directory search stack
3775 typedef struct ff_stack
3777 struct ff_stack
*ffs_prev
;
3779 /* the fix part (no wildcards) and the part containing the wildcards
3780 * of the search path
3782 char_u
*ffs_fix_path
;
3783 #ifdef FEAT_PATH_EXTRA
3784 char_u
*ffs_wc_path
;
3787 /* files/dirs found in the above directory, matched by the first wildcard
3790 char_u
**ffs_filearray
;
3791 int ffs_filearray_size
;
3792 char_u ffs_filearray_cur
; /* needed for partly handled dirs */
3794 /* to store status of partly handled directories
3795 * 0: we work on this directory for the first time
3796 * 1: this directory was partly searched in an earlier step
3800 /* How deep are we in the directory tree?
3801 * Counts backward from value of level parameter to vim_findfile_init
3805 /* Did we already expand '**' to an empty string? */
3806 int ffs_star_star_empty
;
3810 * type for already visited directories or files.
3812 typedef struct ff_visited
3814 struct ff_visited
*ffv_next
;
3816 #ifdef FEAT_PATH_EXTRA
3817 /* Visited directories are different if the wildcard string are
3818 * different. So we have to save it.
3820 char_u
*ffv_wc_path
;
3822 /* for unix use inode etc for comparison (needed because of links), else
3826 int ffv_dev
; /* device number (-1 if not set) */
3827 ino_t ffv_ino
; /* inode number */
3829 /* The memory for this struct is allocated according to the length of
3832 char_u ffv_fname
[1]; /* actually longer */
3836 * We might have to manage several visited lists during a search.
3837 * This is especially needed for the tags option. If tags is set to:
3838 * "./++/tags,./++/TAGS,++/tags" (replace + with *)
3839 * So we have to do 3 searches:
3840 * 1) search from the current files directory downward for the file "tags"
3841 * 2) search from the current files directory downward for the file "TAGS"
3842 * 3) search from Vims current directory downwards for the file "tags"
3843 * As you can see, the first and the third search are for the same file, so for
3844 * the third search we can use the visited list of the first search. For the
3845 * second search we must start from a empty visited list.
3846 * The struct ff_visited_list_hdr is used to manage a linked list of already
3849 typedef struct ff_visited_list_hdr
3851 struct ff_visited_list_hdr
*ffvl_next
;
3853 /* the filename the attached visited list is for */
3854 char_u
*ffvl_filename
;
3856 ff_visited_T
*ffvl_visited_list
;
3858 } ff_visited_list_hdr_T
;
3862 * '**' can be expanded to several directory levels.
3863 * Set the default maximum depth.
3865 #define FF_MAX_STAR_STAR_EXPAND ((char_u)30)
3868 * The search context:
3869 * ffsc_stack_ptr: the stack for the dirs to search
3870 * ffsc_visited_list: the currently active visited list
3871 * ffsc_dir_visited_list: the currently active visited list for search dirs
3872 * ffsc_visited_lists_list: the list of all visited lists
3873 * ffsc_dir_visited_lists_list: the list of all visited lists for search dirs
3874 * ffsc_file_to_search: the file to search for
3875 * ffsc_start_dir: the starting directory, if search path was relative
3876 * ffsc_fix_path: the fix part of the given path (without wildcards)
3877 * Needed for upward search.
3878 * ffsc_wc_path: the part of the given path containing wildcards
3879 * ffsc_level: how many levels of dirs to search downwards
3880 * ffsc_stopdirs_v: array of stop directories for upward search
3881 * ffsc_find_what: FINDFILE_BOTH, FINDFILE_DIR or FINDFILE_FILE
3883 typedef struct ff_search_ctx_T
3885 ff_stack_T
*ffsc_stack_ptr
;
3886 ff_visited_list_hdr_T
*ffsc_visited_list
;
3887 ff_visited_list_hdr_T
*ffsc_dir_visited_list
;
3888 ff_visited_list_hdr_T
*ffsc_visited_lists_list
;
3889 ff_visited_list_hdr_T
*ffsc_dir_visited_lists_list
;
3890 char_u
*ffsc_file_to_search
;
3891 char_u
*ffsc_start_dir
;
3892 char_u
*ffsc_fix_path
;
3893 #ifdef FEAT_PATH_EXTRA
3894 char_u
*ffsc_wc_path
;
3896 char_u
**ffsc_stopdirs_v
;
3901 /* locally needed functions */
3902 #ifdef FEAT_PATH_EXTRA
3903 static int ff_check_visited
__ARGS((ff_visited_T
**, char_u
*, char_u
*));
3905 static int ff_check_visited
__ARGS((ff_visited_T
**, char_u
*));
3907 static void vim_findfile_free_visited_list
__ARGS((ff_visited_list_hdr_T
**list_headp
));
3908 static void ff_free_visited_list
__ARGS((ff_visited_T
*vl
));
3909 static ff_visited_list_hdr_T
* ff_get_visited_list
__ARGS((char_u
*, ff_visited_list_hdr_T
**list_headp
));
3910 #ifdef FEAT_PATH_EXTRA
3911 static int ff_wc_equal
__ARGS((char_u
*s1
, char_u
*s2
));
3914 static void ff_push
__ARGS((ff_search_ctx_T
*search_ctx
, ff_stack_T
*stack_ptr
));
3915 static ff_stack_T
*ff_pop
__ARGS((ff_search_ctx_T
*search_ctx
));
3916 static void ff_clear
__ARGS((ff_search_ctx_T
*search_ctx
));
3917 static void ff_free_stack_element
__ARGS((ff_stack_T
*stack_ptr
));
3918 #ifdef FEAT_PATH_EXTRA
3919 static ff_stack_T
*ff_create_stack_element
__ARGS((char_u
*, char_u
*, int, int));
3921 static ff_stack_T
*ff_create_stack_element
__ARGS((char_u
*, int, int));
3923 #ifdef FEAT_PATH_EXTRA
3924 static int ff_path_in_stoplist
__ARGS((char_u
*, int, char_u
**));
3929 * if someone likes findfirst/findnext, here are the functions
3933 static void *ff_fn_search_context
= NULL
;
3936 vim_findfirst(path
, filename
, level
)
3941 ff_fn_search_context
=
3942 vim_findfile_init(path
, filename
, NULL
, level
, TRUE
, FALSE
,
3943 ff_fn_search_context
, rel_fname
);
3944 if (NULL
== ff_fn_search_context
)
3947 return vim_findnext()
3953 char_u
*ret
= vim_findfile(ff_fn_search_context
);
3957 vim_findfile_cleanup(ff_fn_search_context
);
3958 ff_fn_search_context
= NULL
;
3965 * Initialization routine for vim_findfile.
3967 * Returns the newly allocated search context or NULL if an error occured.
3969 * Don't forget to clean up by calling vim_findfile_cleanup() if you are done
3970 * with the search context.
3972 * Find the file 'filename' in the directory 'path'.
3973 * The parameter 'path' may contain wildcards. If so only search 'level'
3974 * directories deep. The parameter 'level' is the absolute maximum and is
3975 * not related to restricts given to the '**' wildcard. If 'level' is 100
3976 * and you use '**200' vim_findfile() will stop after 100 levels.
3978 * 'filename' cannot contain wildcards! It is used as-is, no backslashes to
3979 * escape special characters.
3981 * If 'stopdirs' is not NULL and nothing is found downward, the search is
3982 * restarted on the next higher directory level. This is repeated until the
3983 * start-directory of a search is contained in 'stopdirs'. 'stopdirs' has the
3984 * format ";*<dirname>*\(;<dirname>\)*;\=$".
3986 * If the 'path' is relative, the starting dir for the search is either VIM's
3987 * current dir or if the path starts with "./" the current files dir.
3988 * If the 'path' is absolut, the starting dir is that part of the path before
3989 * the first wildcard.
3991 * Upward search is only done on the starting dir.
3993 * If 'free_visited' is TRUE the list of already visited files/directories is
3994 * cleared. Set this to FALSE if you just want to search from another
3995 * directory, but want to be sure that no directory from a previous search is
3996 * searched again. This is useful if you search for a file at different places.
3997 * The list of visited files/dirs can also be cleared with the function
3998 * vim_findfile_free_visited().
4000 * Set the parameter 'find_what' to FINDFILE_DIR if you want to search for
4001 * directories only, FINDFILE_FILE for files only, FINDFILE_BOTH for both.
4003 * A search context returned by a previous call to vim_findfile_init() can be
4004 * passed in the parameter "search_ctx_arg". This context is reused and
4005 * reinitialized with the new parameters. The list of already visited
4006 * directories from this context is only deleted if the parameter
4007 * "free_visited" is true. Be aware that the passed "search_ctx_arg" is freed
4008 * if the reinitialization fails.
4010 * If you don't have a search context from a previous call "search_ctx_arg"
4013 * This function silently ignores a few errors, vim_findfile() will have
4014 * limited functionality then.
4018 vim_findfile_init(path
, filename
, stopdirs
, level
, free_visited
, find_what
,
4019 search_ctx_arg
, tagfile
, rel_fname
)
4026 void *search_ctx_arg
;
4028 char_u
*rel_fname
; /* file name to use for "." */
4030 #ifdef FEAT_PATH_EXTRA
4034 ff_search_ctx_T
*search_ctx
;
4036 /* If a search context is given by the caller, reuse it, else allocate a
4039 if (search_ctx_arg
!= NULL
)
4040 search_ctx
= search_ctx_arg
;
4043 search_ctx
= (ff_search_ctx_T
*)alloc((unsigned)sizeof(ff_search_ctx_T
));
4044 if (search_ctx
== NULL
)
4046 memset(search_ctx
, 0, sizeof(ff_search_ctx_T
));
4048 search_ctx
->ffsc_find_what
= find_what
;
4050 /* clear the search context, but NOT the visited lists */
4051 ff_clear(search_ctx
);
4053 /* clear visited list if wanted */
4054 if (free_visited
== TRUE
)
4055 vim_findfile_free_visited(search_ctx
);
4058 /* Reuse old visited lists. Get the visited list for the given
4059 * filename. If no list for the current filename exists, creates a new
4061 search_ctx
->ffsc_visited_list
= ff_get_visited_list(filename
,
4062 &search_ctx
->ffsc_visited_lists_list
);
4063 if (search_ctx
->ffsc_visited_list
== NULL
)
4065 search_ctx
->ffsc_dir_visited_list
= ff_get_visited_list(filename
,
4066 &search_ctx
->ffsc_dir_visited_lists_list
);
4067 if (search_ctx
->ffsc_dir_visited_list
== NULL
)
4071 if (ff_expand_buffer
== NULL
)
4073 ff_expand_buffer
= (char_u
*)alloc(MAXPATHL
);
4074 if (ff_expand_buffer
== NULL
)
4078 /* Store information on starting dir now if path is relative.
4079 * If path is absolute, we do that later. */
4081 && (vim_ispathsep(path
[1]) || path
[1] == NUL
)
4082 && (!tagfile
|| vim_strchr(p_cpo
, CPO_DOTTAG
) == NULL
)
4083 && rel_fname
!= NULL
)
4085 int len
= (int)(gettail(rel_fname
) - rel_fname
);
4087 if (!vim_isAbsName(rel_fname
) && len
+ 1 < MAXPATHL
)
4089 /* Make the start dir an absolute path name. */
4090 vim_strncpy(ff_expand_buffer
, rel_fname
, len
);
4091 search_ctx
->ffsc_start_dir
= FullName_save(ff_expand_buffer
, FALSE
);
4094 search_ctx
->ffsc_start_dir
= vim_strnsave(rel_fname
, len
);
4095 if (search_ctx
->ffsc_start_dir
== NULL
)
4100 else if (*path
== NUL
|| !vim_isAbsName(path
))
4102 #ifdef BACKSLASH_IN_FILENAME
4103 /* "c:dir" needs "c:" to be expanded, otherwise use current dir */
4104 if (*path
!= NUL
&& path
[1] == ':')
4111 if (vim_FullName(drive
, ff_expand_buffer
, MAXPATHL
, TRUE
) == FAIL
)
4117 if (mch_dirname(ff_expand_buffer
, MAXPATHL
) == FAIL
)
4120 search_ctx
->ffsc_start_dir
= vim_strsave(ff_expand_buffer
);
4121 if (search_ctx
->ffsc_start_dir
== NULL
)
4124 #ifdef BACKSLASH_IN_FILENAME
4125 /* A path that starts with "/dir" is relative to the drive, not to the
4126 * directory (but not for "//machine/dir"). Only use the drive name. */
4127 if ((*path
== '/' || *path
== '\\')
4128 && path
[1] != path
[0]
4129 && search_ctx
->ffsc_start_dir
[1] == ':')
4130 search_ctx
->ffsc_start_dir
[2] = NUL
;
4134 #ifdef FEAT_PATH_EXTRA
4136 * If stopdirs are given, split them into an array of pointers.
4137 * If this fails (mem allocation), there is no upward search at all or a
4138 * stop directory is not recognized -> continue silently.
4139 * If stopdirs just contains a ";" or is empty,
4140 * search_ctx->ffsc_stopdirs_v will only contain a NULL pointer. This
4141 * is handled as unlimited upward search. See function
4142 * ff_path_in_stoplist() for details.
4144 if (stopdirs
!= NULL
)
4146 char_u
*walker
= stopdirs
;
4149 while (*walker
== ';')
4153 search_ctx
->ffsc_stopdirs_v
=
4154 (char_u
**)alloc((unsigned)sizeof(char_u
*));
4156 if (search_ctx
->ffsc_stopdirs_v
!= NULL
)
4164 ptr
= vim_realloc(search_ctx
->ffsc_stopdirs_v
,
4165 (dircount
+ 1) * sizeof(char_u
*));
4167 search_ctx
->ffsc_stopdirs_v
= ptr
;
4169 /* ignore, keep what we have and continue */
4171 walker
= vim_strchr(walker
, ';');
4174 search_ctx
->ffsc_stopdirs_v
[dircount
-1] =
4175 vim_strnsave(helper
, (int)(walker
- helper
));
4179 /* this might be "", which means ascent till top
4180 * of directory tree.
4182 search_ctx
->ffsc_stopdirs_v
[dircount
-1] =
4183 vim_strsave(helper
);
4187 } while (walker
!= NULL
);
4188 search_ctx
->ffsc_stopdirs_v
[dircount
-1] = NULL
;
4193 #ifdef FEAT_PATH_EXTRA
4194 search_ctx
->ffsc_level
= level
;
4198 * -wildcard_stuff (might be NULL)
4200 wc_part
= vim_strchr(path
, '*');
4201 if (wc_part
!= NULL
)
4207 /* save the fix part of the path */
4208 search_ctx
->ffsc_fix_path
= vim_strnsave(path
, (int)(wc_part
- path
));
4211 * copy wc_path and add restricts to the '**' wildcard.
4212 * The octet after a '**' is used as a (binary) counter.
4213 * So '**3' is transposed to '**^C' ('^C' is ASCII value 3)
4214 * or '**76' is transposed to '**N'( 'N' is ASCII value 76).
4215 * For EBCDIC you get different character values.
4216 * If no restrict is given after '**' the default is used.
4217 * Due to this technic the path looks awful if you print it as a
4221 while (*wc_part
!= NUL
)
4223 if (STRNCMP(wc_part
, "**", 2) == 0)
4225 ff_expand_buffer
[len
++] = *wc_part
++;
4226 ff_expand_buffer
[len
++] = *wc_part
++;
4228 llevel
= strtol((char *)wc_part
, &errpt
, 10);
4229 if ((char_u
*)errpt
!= wc_part
&& llevel
> 0 && llevel
< 255)
4230 ff_expand_buffer
[len
++] = llevel
;
4231 else if ((char_u
*)errpt
!= wc_part
&& llevel
== 0)
4232 /* restrict is 0 -> remove already added '**' */
4235 ff_expand_buffer
[len
++] = FF_MAX_STAR_STAR_EXPAND
;
4236 wc_part
= (char_u
*)errpt
;
4237 if (*wc_part
!= NUL
&& !vim_ispathsep(*wc_part
))
4239 EMSG2(_("E343: Invalid path: '**[number]' must be at the end of the path or be followed by '%s'."), PATHSEPSTR
);
4244 ff_expand_buffer
[len
++] = *wc_part
++;
4246 ff_expand_buffer
[len
] = NUL
;
4247 search_ctx
->ffsc_wc_path
= vim_strsave(ff_expand_buffer
);
4249 if (search_ctx
->ffsc_wc_path
== NULL
)
4254 search_ctx
->ffsc_fix_path
= vim_strsave(path
);
4256 if (search_ctx
->ffsc_start_dir
== NULL
)
4258 /* store the fix part as startdir.
4259 * This is needed if the parameter path is fully qualified.
4261 search_ctx
->ffsc_start_dir
= vim_strsave(search_ctx
->ffsc_fix_path
);
4262 if (search_ctx
->ffsc_start_dir
)
4263 search_ctx
->ffsc_fix_path
[0] = NUL
;
4266 /* create an absolute path */
4267 STRCPY(ff_expand_buffer
, search_ctx
->ffsc_start_dir
);
4268 add_pathsep(ff_expand_buffer
);
4269 STRCAT(ff_expand_buffer
, search_ctx
->ffsc_fix_path
);
4270 add_pathsep(ff_expand_buffer
);
4272 sptr
= ff_create_stack_element(ff_expand_buffer
,
4273 #ifdef FEAT_PATH_EXTRA
4274 search_ctx
->ffsc_wc_path
,
4281 ff_push(search_ctx
, sptr
);
4283 search_ctx
->ffsc_file_to_search
= vim_strsave(filename
);
4284 if (search_ctx
->ffsc_file_to_search
== NULL
)
4291 * We clear the search context now!
4292 * Even when the caller gave us a (perhaps valid) context we free it here,
4293 * as we might have already destroyed it.
4295 vim_findfile_cleanup(search_ctx
);
4299 #if defined(FEAT_PATH_EXTRA) || defined(PROTO)
4301 * Get the stopdir string. Check that ';' is not escaped.
4304 vim_findfile_stopdir(buf
)
4307 char_u
*r_ptr
= buf
;
4309 while (*r_ptr
!= NUL
&& *r_ptr
!= ';')
4311 if (r_ptr
[0] == '\\' && r_ptr
[1] == ';')
4313 /* overwrite the escape char,
4314 * use STRLEN(r_ptr) to move the trailing '\0'
4316 STRMOVE(r_ptr
, r_ptr
+ 1);
4326 else if (*r_ptr
== NUL
)
4333 * Clean up the given search context. Can handle a NULL pointer.
4336 vim_findfile_cleanup(ctx
)
4342 vim_findfile_free_visited(ctx
);
4348 * Find a file in a search context.
4349 * The search context was created with vim_findfile_init() above.
4350 * Return a pointer to an allocated file name or NULL if nothing found.
4351 * To get all matching files call this function until you get NULL.
4353 * If the passed search_context is NULL, NULL is returned.
4355 * The search algorithm is depth first. To change this replace the
4356 * stack with a list (don't forget to leave partly searched directories on the
4360 vim_findfile(search_ctx_arg
)
4361 void *search_ctx_arg
;
4364 #ifdef FEAT_PATH_EXTRA
4365 char_u
*rest_of_wildcards
;
4366 char_u
*path_end
= NULL
;
4369 #if defined(FEAT_SEARCHPATH) || defined(FEAT_PATH_EXTRA)
4374 #ifdef FEAT_SEARCHPATH
4377 ff_search_ctx_T
*search_ctx
;
4379 if (search_ctx_arg
== NULL
)
4382 search_ctx
= (ff_search_ctx_T
*)search_ctx_arg
;
4385 * filepath is used as buffer for various actions and as the storage to
4386 * return a found filename.
4388 if ((file_path
= alloc((int)MAXPATHL
)) == NULL
)
4391 #ifdef FEAT_PATH_EXTRA
4392 /* store the end of the start dir -- needed for upward search */
4393 if (search_ctx
->ffsc_start_dir
!= NULL
)
4394 path_end
= &search_ctx
->ffsc_start_dir
[
4395 STRLEN(search_ctx
->ffsc_start_dir
)];
4398 #ifdef FEAT_PATH_EXTRA
4399 /* upward search loop */
4403 /* downward search loop */
4406 /* check if user user wants to stop the search*/
4411 /* get directory to work on from stack */
4412 stackp
= ff_pop(search_ctx
);
4417 * TODO: decide if we leave this test in
4419 * GOOD: don't search a directory(-tree) twice.
4420 * BAD: - check linked list for every new directory entered.
4421 * - check for double files also done below
4423 * Here we check if we already searched this directory.
4424 * We already searched a directory if:
4425 * 1) The directory is the same.
4426 * 2) We would use the same wildcard string.
4428 * Good if you have links on same directory via several ways
4429 * or you have selfreferences in directories (e.g. SuSE Linux 6.3:
4430 * /etc/rc.d/init.d is linked to /etc/rc.d -> endless loop)
4432 * This check is only needed for directories we work on for the
4433 * first time (hence stackp->ff_filearray == NULL)
4435 if (stackp
->ffs_filearray
== NULL
4436 && ff_check_visited(&search_ctx
->ffsc_dir_visited_list
4437 ->ffvl_visited_list
,
4438 stackp
->ffs_fix_path
4439 #ifdef FEAT_PATH_EXTRA
4440 , stackp
->ffs_wc_path
4447 verbose_enter_scroll();
4448 smsg((char_u
*)"Already Searched: %s (%s)",
4449 stackp
->ffs_fix_path
, stackp
->ffs_wc_path
);
4450 /* don't overwrite this either */
4451 msg_puts((char_u
*)"\n");
4452 verbose_leave_scroll();
4455 ff_free_stack_element(stackp
);
4459 else if (p_verbose
>= 5)
4461 verbose_enter_scroll();
4462 smsg((char_u
*)"Searching: %s (%s)",
4463 stackp
->ffs_fix_path
, stackp
->ffs_wc_path
);
4464 /* don't overwrite this either */
4465 msg_puts((char_u
*)"\n");
4466 verbose_leave_scroll();
4471 if (stackp
->ffs_level
<= 0)
4473 ff_free_stack_element(stackp
);
4480 * If no filearray till now expand wildcards
4481 * The function expand_wildcards() can handle an array of paths
4482 * and all possible expands are returned in one array. We use this
4483 * to handle the expansion of '**' into an empty string.
4485 if (stackp
->ffs_filearray
== NULL
)
4489 /* we use filepath to build the path expand_wildcards() should
4492 dirptrs
[0] = file_path
;
4495 /* if we have a start dir copy it in */
4496 if (!vim_isAbsName(stackp
->ffs_fix_path
)
4497 && search_ctx
->ffsc_start_dir
)
4499 STRCPY(file_path
, search_ctx
->ffsc_start_dir
);
4500 add_pathsep(file_path
);
4503 /* append the fix part of the search path */
4504 STRCAT(file_path
, stackp
->ffs_fix_path
);
4505 add_pathsep(file_path
);
4507 #ifdef FEAT_PATH_EXTRA
4508 rest_of_wildcards
= stackp
->ffs_wc_path
;
4509 if (*rest_of_wildcards
!= NUL
)
4511 len
= (int)STRLEN(file_path
);
4512 if (STRNCMP(rest_of_wildcards
, "**", 2) == 0)
4514 /* pointer to the restrict byte
4515 * The restrict byte is not a character!
4517 p
= rest_of_wildcards
+ 2;
4522 file_path
[len
++] = '*';
4527 /* remove '**<numb> from wildcards */
4528 STRMOVE(rest_of_wildcards
, rest_of_wildcards
+ 3);
4531 rest_of_wildcards
+= 3;
4533 if (stackp
->ffs_star_star_empty
== 0)
4535 /* if not done before, expand '**' to empty */
4536 stackp
->ffs_star_star_empty
= 1;
4537 dirptrs
[1] = stackp
->ffs_fix_path
;
4542 * Here we copy until the next path separator or the end of
4543 * the path. If we stop at a path separator, there is
4544 * still something else left. This is handled below by
4545 * pushing every directory returned from expand_wildcards()
4546 * on the stack again for further search.
4548 while (*rest_of_wildcards
4549 && !vim_ispathsep(*rest_of_wildcards
))
4550 file_path
[len
++] = *rest_of_wildcards
++;
4552 file_path
[len
] = NUL
;
4553 if (vim_ispathsep(*rest_of_wildcards
))
4554 rest_of_wildcards
++;
4559 * Expand wildcards like "*" and "$VAR".
4560 * If the path is a URL don't try this.
4562 if (path_with_url(dirptrs
[0]))
4564 stackp
->ffs_filearray
= (char_u
**)
4565 alloc((unsigned)sizeof(char *));
4566 if (stackp
->ffs_filearray
!= NULL
4567 && (stackp
->ffs_filearray
[0]
4568 = vim_strsave(dirptrs
[0])) != NULL
)
4569 stackp
->ffs_filearray_size
= 1;
4571 stackp
->ffs_filearray_size
= 0;
4574 expand_wildcards((dirptrs
[1] == NULL
) ? 1 : 2, dirptrs
,
4575 &stackp
->ffs_filearray_size
,
4576 &stackp
->ffs_filearray
,
4577 EW_DIR
|EW_ADDSLASH
|EW_SILENT
);
4579 stackp
->ffs_filearray_cur
= 0;
4580 stackp
->ffs_stage
= 0;
4582 #ifdef FEAT_PATH_EXTRA
4584 rest_of_wildcards
= &stackp
->ffs_wc_path
[
4585 STRLEN(stackp
->ffs_wc_path
)];
4588 if (stackp
->ffs_stage
== 0)
4590 /* this is the first time we work on this directory */
4591 #ifdef FEAT_PATH_EXTRA
4592 if (*rest_of_wildcards
== NUL
)
4596 * we don't have further wildcards to expand, so we have to
4597 * check for the final file now
4599 for (i
= stackp
->ffs_filearray_cur
;
4600 i
< stackp
->ffs_filearray_size
; ++i
)
4602 if (!path_with_url(stackp
->ffs_filearray
[i
])
4603 && !mch_isdir(stackp
->ffs_filearray
[i
]))
4604 continue; /* not a directory */
4606 /* prepare the filename to be checked for existance
4608 STRCPY(file_path
, stackp
->ffs_filearray
[i
]);
4609 add_pathsep(file_path
);
4610 STRCAT(file_path
, search_ctx
->ffsc_file_to_search
);
4613 * Try without extra suffix and then with suffixes
4614 * from 'suffixesadd'.
4616 #ifdef FEAT_SEARCHPATH
4617 len
= (int)STRLEN(file_path
);
4618 suf
= curbuf
->b_p_sua
;
4622 /* if file exists and we didn't already find it */
4623 if ((path_with_url(file_path
)
4624 || (mch_getperm(file_path
) >= 0
4625 && (search_ctx
->ffsc_find_what
4627 || ((search_ctx
->ffsc_find_what
4629 == mch_isdir(file_path
)))))
4631 && (ff_check_visited(
4632 &search_ctx
->ffsc_visited_list
->ffvl_visited_list
,
4634 #ifdef FEAT_PATH_EXTRA
4642 if (ff_check_visited(
4643 &search_ctx
->ffsc_visited_list
->ffvl_visited_list
,
4645 #ifdef FEAT_PATH_EXTRA
4652 verbose_enter_scroll();
4653 smsg((char_u
*)"Already: %s",
4655 /* don't overwrite this either */
4656 msg_puts((char_u
*)"\n");
4657 verbose_leave_scroll();
4663 /* push dir to examine rest of subdirs later */
4664 stackp
->ffs_filearray_cur
= i
+ 1;
4665 ff_push(search_ctx
, stackp
);
4667 simplify_filename(file_path
);
4668 if (mch_dirname(ff_expand_buffer
, MAXPATHL
)
4671 p
= shorten_fname(file_path
,
4674 STRMOVE(file_path
, p
);
4679 verbose_enter_scroll();
4680 smsg((char_u
*)"HIT: %s", file_path
);
4681 /* don't overwrite this either */
4682 msg_puts((char_u
*)"\n");
4683 verbose_leave_scroll();
4689 #ifdef FEAT_SEARCHPATH
4690 /* Not found or found already, try next suffix. */
4693 copy_option_part(&suf
, file_path
+ len
,
4694 MAXPATHL
- len
, ",");
4699 #ifdef FEAT_PATH_EXTRA
4703 * still wildcards left, push the directories for further
4706 for (i
= stackp
->ffs_filearray_cur
;
4707 i
< stackp
->ffs_filearray_size
; ++i
)
4709 if (!mch_isdir(stackp
->ffs_filearray
[i
]))
4710 continue; /* not a directory */
4713 ff_create_stack_element(
4714 stackp
->ffs_filearray
[i
],
4716 stackp
->ffs_level
- 1, 0));
4720 stackp
->ffs_filearray_cur
= 0;
4721 stackp
->ffs_stage
= 1;
4724 #ifdef FEAT_PATH_EXTRA
4726 * if wildcards contains '**' we have to descent till we reach the
4727 * leaves of the directory tree.
4729 if (STRNCMP(stackp
->ffs_wc_path
, "**", 2) == 0)
4731 for (i
= stackp
->ffs_filearray_cur
;
4732 i
< stackp
->ffs_filearray_size
; ++i
)
4734 if (fnamecmp(stackp
->ffs_filearray
[i
],
4735 stackp
->ffs_fix_path
) == 0)
4736 continue; /* don't repush same directory */
4737 if (!mch_isdir(stackp
->ffs_filearray
[i
]))
4738 continue; /* not a directory */
4740 ff_create_stack_element(stackp
->ffs_filearray
[i
],
4741 stackp
->ffs_wc_path
, stackp
->ffs_level
- 1, 1));
4746 /* we are done with the current directory */
4747 ff_free_stack_element(stackp
);
4751 #ifdef FEAT_PATH_EXTRA
4752 /* If we reached this, we didn't find anything downwards.
4753 * Let's check if we should do an upward search.
4755 if (search_ctx
->ffsc_start_dir
4756 && search_ctx
->ffsc_stopdirs_v
!= NULL
&& !got_int
)
4760 /* is the last starting directory in the stop list? */
4761 if (ff_path_in_stoplist(search_ctx
->ffsc_start_dir
,
4762 (int)(path_end
- search_ctx
->ffsc_start_dir
),
4763 search_ctx
->ffsc_stopdirs_v
) == TRUE
)
4766 /* cut of last dir */
4767 while (path_end
> search_ctx
->ffsc_start_dir
4768 && vim_ispathsep(*path_end
))
4770 while (path_end
> search_ctx
->ffsc_start_dir
4771 && !vim_ispathsep(path_end
[-1]))
4776 if (*search_ctx
->ffsc_start_dir
== 0)
4779 STRCPY(file_path
, search_ctx
->ffsc_start_dir
);
4780 add_pathsep(file_path
);
4781 STRCAT(file_path
, search_ctx
->ffsc_fix_path
);
4783 /* create a new stack entry */
4784 sptr
= ff_create_stack_element(file_path
,
4785 search_ctx
->ffsc_wc_path
, search_ctx
->ffsc_level
, 0);
4788 ff_push(search_ctx
, sptr
);
4795 vim_free(file_path
);
4800 * Free the list of lists of visited files and directories
4801 * Can handle it if the passed search_context is NULL;
4804 vim_findfile_free_visited(search_ctx_arg
)
4805 void *search_ctx_arg
;
4807 ff_search_ctx_T
*search_ctx
;
4809 if (search_ctx_arg
== NULL
)
4812 search_ctx
= (ff_search_ctx_T
*)search_ctx_arg
;
4813 vim_findfile_free_visited_list(&search_ctx
->ffsc_visited_lists_list
);
4814 vim_findfile_free_visited_list(&search_ctx
->ffsc_dir_visited_lists_list
);
4818 vim_findfile_free_visited_list(list_headp
)
4819 ff_visited_list_hdr_T
**list_headp
;
4821 ff_visited_list_hdr_T
*vp
;
4823 while (*list_headp
!= NULL
)
4825 vp
= (*list_headp
)->ffvl_next
;
4826 ff_free_visited_list((*list_headp
)->ffvl_visited_list
);
4828 vim_free((*list_headp
)->ffvl_filename
);
4829 vim_free(*list_headp
);
4836 ff_free_visited_list(vl
)
4844 #ifdef FEAT_PATH_EXTRA
4845 vim_free(vl
->ffv_wc_path
);
4854 * Returns the already visited list for the given filename. If none is found it
4855 * allocates a new one.
4857 static ff_visited_list_hdr_T
*
4858 ff_get_visited_list(filename
, list_headp
)
4860 ff_visited_list_hdr_T
**list_headp
;
4862 ff_visited_list_hdr_T
*retptr
= NULL
;
4864 /* check if a visited list for the given filename exists */
4865 if (*list_headp
!= NULL
)
4867 retptr
= *list_headp
;
4868 while (retptr
!= NULL
)
4870 if (fnamecmp(filename
, retptr
->ffvl_filename
) == 0)
4875 verbose_enter_scroll();
4876 smsg((char_u
*)"ff_get_visited_list: FOUND list for %s",
4878 /* don't overwrite this either */
4879 msg_puts((char_u
*)"\n");
4880 verbose_leave_scroll();
4885 retptr
= retptr
->ffvl_next
;
4892 verbose_enter_scroll();
4893 smsg((char_u
*)"ff_get_visited_list: new list for %s", filename
);
4894 /* don't overwrite this either */
4895 msg_puts((char_u
*)"\n");
4896 verbose_leave_scroll();
4901 * if we reach this we didn't find a list and we have to allocate new list
4903 retptr
= (ff_visited_list_hdr_T
*)alloc((unsigned)sizeof(*retptr
));
4907 retptr
->ffvl_visited_list
= NULL
;
4908 retptr
->ffvl_filename
= vim_strsave(filename
);
4909 if (retptr
->ffvl_filename
== NULL
)
4914 retptr
->ffvl_next
= *list_headp
;
4915 *list_headp
= retptr
;
4920 #ifdef FEAT_PATH_EXTRA
4922 * check if two wildcard paths are equal. Returns TRUE or FALSE.
4923 * They are equal if:
4924 * - both paths are NULL
4925 * - they have the same length
4926 * - char by char comparison is OK
4927 * - the only differences are in the counters behind a '**', so
4928 * '**\20' is equal to '**\24'
4940 if (s1
== NULL
|| s2
== NULL
)
4943 if (STRLEN(s1
) != STRLEN(s2
))
4946 for (i
= 0; s1
[i
] != NUL
&& s2
[i
] != NUL
; i
++)
4949 #ifdef CASE_INSENSITIVE_FILENAME
4950 && TOUPPER_LOC(s1
[i
]) != TOUPPER_LOC(s2
[i
])
4955 if (s1
[i
-1] == '*' && s1
[i
-2] == '*')
4968 * maintains the list of already visited files and dirs
4969 * returns FAIL if the given file/dir is already in the list
4970 * returns OK if it is newly added
4972 * TODO: What to do on memory allocation problems?
4973 * -> return TRUE - Better the file is found several times instead of
4977 ff_check_visited(visited_list
, fname
4978 #ifdef FEAT_PATH_EXTRA
4982 ff_visited_T
**visited_list
;
4984 #ifdef FEAT_PATH_EXTRA
4994 /* For an URL we only compare the name, otherwise we compare the
4995 * device/inode (unix) or the full path name (not Unix). */
4996 if (path_with_url(fname
))
4998 vim_strncpy(ff_expand_buffer
, fname
, MAXPATHL
- 1);
5005 ff_expand_buffer
[0] = NUL
;
5007 if (mch_stat((char *)fname
, &st
) < 0)
5009 if (vim_FullName(fname
, ff_expand_buffer
, MAXPATHL
, TRUE
) == FAIL
)
5014 /* check against list of already visited files */
5015 for (vp
= *visited_list
; vp
!= NULL
; vp
= vp
->ffv_next
)
5020 ? (vp
->ffv_dev
== st
.st_dev
5021 && vp
->ffv_ino
== st
.st_ino
)
5024 fnamecmp(vp
->ffv_fname
, ff_expand_buffer
) == 0
5027 #ifdef FEAT_PATH_EXTRA
5028 /* are the wildcard parts equal */
5029 if (ff_wc_equal(vp
->ffv_wc_path
, wc_path
) == TRUE
)
5031 /* already visited */
5037 * New file/dir. Add it to the list of visited files/dirs.
5039 vp
= (ff_visited_T
*)alloc((unsigned)(sizeof(ff_visited_T
)
5040 + STRLEN(ff_expand_buffer
)));
5047 vp
->ffv_ino
= st
.st_ino
;
5048 vp
->ffv_dev
= st
.st_dev
;
5049 vp
->ffv_fname
[0] = NUL
;
5056 STRCPY(vp
->ffv_fname
, ff_expand_buffer
);
5060 #ifdef FEAT_PATH_EXTRA
5061 if (wc_path
!= NULL
)
5062 vp
->ffv_wc_path
= vim_strsave(wc_path
);
5064 vp
->ffv_wc_path
= NULL
;
5067 vp
->ffv_next
= *visited_list
;
5075 * create stack element from given path pieces
5078 ff_create_stack_element(fix_part
,
5079 #ifdef FEAT_PATH_EXTRA
5082 level
, star_star_empty
)
5084 #ifdef FEAT_PATH_EXTRA
5088 int star_star_empty
;
5092 new = (ff_stack_T
*)alloc((unsigned)sizeof(ff_stack_T
));
5096 new->ffs_prev
= NULL
;
5097 new->ffs_filearray
= NULL
;
5098 new->ffs_filearray_size
= 0;
5099 new->ffs_filearray_cur
= 0;
5101 new->ffs_level
= level
;
5102 new->ffs_star_star_empty
= star_star_empty
;;
5104 /* the following saves NULL pointer checks in vim_findfile */
5105 if (fix_part
== NULL
)
5106 fix_part
= (char_u
*)"";
5107 new->ffs_fix_path
= vim_strsave(fix_part
);
5109 #ifdef FEAT_PATH_EXTRA
5110 if (wc_part
== NULL
)
5111 wc_part
= (char_u
*)"";
5112 new->ffs_wc_path
= vim_strsave(wc_part
);
5115 if (new->ffs_fix_path
== NULL
5116 #ifdef FEAT_PATH_EXTRA
5117 || new->ffs_wc_path
== NULL
5121 ff_free_stack_element(new);
5129 * Push a dir on the directory stack.
5132 ff_push(search_ctx
, stack_ptr
)
5133 ff_search_ctx_T
*search_ctx
;
5134 ff_stack_T
*stack_ptr
;
5136 /* check for NULL pointer, not to return an error to the user, but
5137 * to prevent a crash */
5138 if (stack_ptr
!= NULL
)
5140 stack_ptr
->ffs_prev
= search_ctx
->ffsc_stack_ptr
;
5141 search_ctx
->ffsc_stack_ptr
= stack_ptr
;
5146 * Pop a dir from the directory stack.
5147 * Returns NULL if stack is empty.
5151 ff_search_ctx_T
*search_ctx
;
5155 sptr
= search_ctx
->ffsc_stack_ptr
;
5156 if (search_ctx
->ffsc_stack_ptr
!= NULL
)
5157 search_ctx
->ffsc_stack_ptr
= search_ctx
->ffsc_stack_ptr
->ffs_prev
;
5163 * free the given stack element
5166 ff_free_stack_element(stack_ptr
)
5167 ff_stack_T
*stack_ptr
;
5169 /* vim_free handles possible NULL pointers */
5170 vim_free(stack_ptr
->ffs_fix_path
);
5171 #ifdef FEAT_PATH_EXTRA
5172 vim_free(stack_ptr
->ffs_wc_path
);
5175 if (stack_ptr
->ffs_filearray
!= NULL
)
5176 FreeWild(stack_ptr
->ffs_filearray_size
, stack_ptr
->ffs_filearray
);
5178 vim_free(stack_ptr
);
5182 * Clear the search context, but NOT the visited list.
5185 ff_clear(search_ctx
)
5186 ff_search_ctx_T
*search_ctx
;
5190 /* clear up stack */
5191 while ((sptr
= ff_pop(search_ctx
)) != NULL
)
5192 ff_free_stack_element(sptr
);
5194 vim_free(search_ctx
->ffsc_file_to_search
);
5195 vim_free(search_ctx
->ffsc_start_dir
);
5196 vim_free(search_ctx
->ffsc_fix_path
);
5197 #ifdef FEAT_PATH_EXTRA
5198 vim_free(search_ctx
->ffsc_wc_path
);
5201 #ifdef FEAT_PATH_EXTRA
5202 if (search_ctx
->ffsc_stopdirs_v
!= NULL
)
5206 while (search_ctx
->ffsc_stopdirs_v
[i
] != NULL
)
5208 vim_free(search_ctx
->ffsc_stopdirs_v
[i
]);
5211 vim_free(search_ctx
->ffsc_stopdirs_v
);
5213 search_ctx
->ffsc_stopdirs_v
= NULL
;
5216 /* reset everything */
5217 search_ctx
->ffsc_file_to_search
= NULL
;
5218 search_ctx
->ffsc_start_dir
= NULL
;
5219 search_ctx
->ffsc_fix_path
= NULL
;
5220 #ifdef FEAT_PATH_EXTRA
5221 search_ctx
->ffsc_wc_path
= NULL
;
5222 search_ctx
->ffsc_level
= 0;
5226 #ifdef FEAT_PATH_EXTRA
5228 * check if the given path is in the stopdirs
5229 * returns TRUE if yes else FALSE
5232 ff_path_in_stoplist(path
, path_len
, stopdirs_v
)
5235 char_u
**stopdirs_v
;
5239 /* eat up trailing path separators, except the first */
5240 while (path_len
> 1 && vim_ispathsep(path
[path_len
- 1]))
5243 /* if no path consider it as match */
5247 for (i
= 0; stopdirs_v
[i
] != NULL
; i
++)
5249 if ((int)STRLEN(stopdirs_v
[i
]) > path_len
)
5251 /* match for parent directory. So '/home' also matches
5252 * '/home/rks'. Check for PATHSEP in stopdirs_v[i], else
5253 * '/home/r' would also match '/home/rks'
5255 if (fnamencmp(stopdirs_v
[i
], path
, path_len
) == 0
5256 && vim_ispathsep(stopdirs_v
[i
][path_len
]))
5261 if (fnamecmp(stopdirs_v
[i
], path
) == 0)
5269 #if defined(FEAT_SEARCHPATH) || defined(PROTO)
5271 * Find the file name "ptr[len]" in the path. Also finds directory names.
5273 * On the first call set the parameter 'first' to TRUE to initialize
5274 * the search. For repeating calls to FALSE.
5276 * Repeating calls will return other files called 'ptr[len]' from the path.
5278 * Only on the first call 'ptr' and 'len' are used. For repeating calls they
5279 * don't need valid values.
5281 * If nothing found on the first call the option FNAME_MESS will issue the
5283 * 'Can't find file "<file>" in path'
5284 * On repeating calls:
5285 * 'No more file "<file>" found in path'
5288 * FNAME_MESS give error message when not found
5292 * Returns an allocated string for the file name. NULL for error.
5296 find_file_in_path(ptr
, len
, options
, first
, rel_fname
)
5297 char_u
*ptr
; /* file name */
5298 int len
; /* length of file name */
5300 int first
; /* use count'th matching file name */
5301 char_u
*rel_fname
; /* file name searching relative to */
5303 return find_file_in_path_option(ptr
, len
, options
, first
,
5304 *curbuf
->b_p_path
== NUL
? p_path
: curbuf
->b_p_path
,
5305 FINDFILE_BOTH
, rel_fname
, curbuf
->b_p_sua
);
5308 static char_u
*ff_file_to_find
= NULL
;
5309 static void *fdip_search_ctx
= NULL
;
5311 #if defined(EXITFREE)
5315 vim_free(ff_file_to_find
);
5316 vim_findfile_cleanup(fdip_search_ctx
);
5321 * Find the directory name "ptr[len]" in the path.
5324 * FNAME_MESS give error message when not found
5328 * Returns an allocated string for the file name. NULL for error.
5331 find_directory_in_path(ptr
, len
, options
, rel_fname
)
5332 char_u
*ptr
; /* file name */
5333 int len
; /* length of file name */
5335 char_u
*rel_fname
; /* file name searching relative to */
5337 return find_file_in_path_option(ptr
, len
, options
, TRUE
, p_cdpath
,
5338 FINDFILE_DIR
, rel_fname
, (char_u
*)"");
5342 find_file_in_path_option(ptr
, len
, options
, first
, path_option
, find_what
, rel_fname
, suffixes
)
5343 char_u
*ptr
; /* file name */
5344 int len
; /* length of file name */
5346 int first
; /* use count'th matching file name */
5347 char_u
*path_option
; /* p_path or p_cdpath */
5348 int find_what
; /* FINDFILE_FILE, _DIR or _BOTH */
5349 char_u
*rel_fname
; /* file name we are looking relative to. */
5350 char_u
*suffixes
; /* list of suffixes, 'suffixesadd' option */
5353 static int did_findfile_init
= FALSE
;
5355 char_u
*file_name
= NULL
;
5359 struct Process
*proc
= (struct Process
*)FindTask(0L);
5360 APTR save_winptr
= proc
->pr_WindowPtr
;
5362 /* Avoid a requester here for a volume that doesn't exist. */
5363 proc
->pr_WindowPtr
= (APTR
)-1L;
5368 /* copy file name into NameBuff, expanding environment variables */
5369 save_char
= ptr
[len
];
5371 expand_env(ptr
, NameBuff
, MAXPATHL
);
5372 ptr
[len
] = save_char
;
5374 vim_free(ff_file_to_find
);
5375 ff_file_to_find
= vim_strsave(NameBuff
);
5376 if (ff_file_to_find
== NULL
) /* out of memory */
5383 rel_to_curdir
= (ff_file_to_find
[0] == '.'
5384 && (ff_file_to_find
[1] == NUL
5385 || vim_ispathsep(ff_file_to_find
[1])
5386 || (ff_file_to_find
[1] == '.'
5387 && (ff_file_to_find
[2] == NUL
5388 || vim_ispathsep(ff_file_to_find
[2])))));
5389 if (vim_isAbsName(ff_file_to_find
)
5390 /* "..", "../path", "." and "./path": don't use the path_option */
5392 #if defined(MSWIN) || defined(MSDOS) || defined(OS2)
5393 /* handle "\tmp" as absolute path */
5394 || vim_ispathsep(ff_file_to_find
[0])
5395 /* handle "c:name" as absulute path */
5396 || (ff_file_to_find
[0] != NUL
&& ff_file_to_find
[1] == ':')
5399 /* handle ":tmp" as absolute path */
5400 || ff_file_to_find
[0] == ':'
5405 * Absolute path, no need to use "path_option".
5406 * If this is not a first call, return NULL. We already returned a
5407 * filename on the first call.
5414 if (path_with_url(ff_file_to_find
))
5416 file_name
= vim_strsave(ff_file_to_find
);
5420 /* When FNAME_REL flag given first use the directory of the file.
5421 * Otherwise or when this fails use the current directory. */
5422 for (run
= 1; run
<= 2; ++run
)
5424 l
= (int)STRLEN(ff_file_to_find
);
5427 && (options
& FNAME_REL
)
5428 && rel_fname
!= NULL
5429 && STRLEN(rel_fname
) + l
< MAXPATHL
)
5431 STRCPY(NameBuff
, rel_fname
);
5432 STRCPY(gettail(NameBuff
), ff_file_to_find
);
5433 l
= (int)STRLEN(NameBuff
);
5437 STRCPY(NameBuff
, ff_file_to_find
);
5441 /* When the file doesn't exist, try adding parts of
5448 /* "C:" by itself will fail for mch_getperm(),
5449 * assume it's always valid. */
5450 (find_what
!= FINDFILE_FILE
&& NameBuff
[0] != NUL
5451 && NameBuff
[1] == ':'
5452 && NameBuff
[2] == NUL
) ||
5454 (mch_getperm(NameBuff
) >= 0
5455 && (find_what
== FINDFILE_BOTH
5456 || ((find_what
== FINDFILE_DIR
)
5457 == mch_isdir(NameBuff
)))))
5459 file_name
= vim_strsave(NameBuff
);
5464 copy_option_part(&buf
, NameBuff
+ l
, MAXPATHL
- l
, ",");
5472 * Loop over all paths in the 'path' or 'cdpath' option.
5473 * When "first" is set, first setup to the start of the option.
5474 * Otherwise continue to find the next match.
5478 /* vim_findfile_free_visited can handle a possible NULL pointer */
5479 vim_findfile_free_visited(fdip_search_ctx
);
5481 did_findfile_init
= FALSE
;
5486 if (did_findfile_init
)
5488 file_name
= vim_findfile(fdip_search_ctx
);
5489 if (file_name
!= NULL
)
5492 did_findfile_init
= FALSE
;
5498 if (dir
== NULL
|| *dir
== NUL
)
5500 /* We searched all paths of the option, now we can
5501 * free the search context. */
5502 vim_findfile_cleanup(fdip_search_ctx
);
5503 fdip_search_ctx
= NULL
;
5507 if ((buf
= alloc((int)(MAXPATHL
))) == NULL
)
5510 /* copy next path */
5512 copy_option_part(&dir
, buf
, MAXPATHL
, " ,");
5514 #ifdef FEAT_PATH_EXTRA
5515 /* get the stopdir string */
5516 r_ptr
= vim_findfile_stopdir(buf
);
5520 fdip_search_ctx
= vim_findfile_init(buf
, ff_file_to_find
,
5521 r_ptr
, 100, FALSE
, find_what
,
5522 fdip_search_ctx
, FALSE
, rel_fname
);
5523 if (fdip_search_ctx
!= NULL
)
5524 did_findfile_init
= TRUE
;
5529 if (file_name
== NULL
&& (options
& FNAME_MESS
))
5533 if (find_what
== FINDFILE_DIR
)
5534 EMSG2(_("E344: Can't find directory \"%s\" in cdpath"),
5537 EMSG2(_("E345: Can't find file \"%s\" in path"),
5542 if (find_what
== FINDFILE_DIR
)
5543 EMSG2(_("E346: No more directory \"%s\" found in cdpath"),
5546 EMSG2(_("E347: No more file \"%s\" found in path"),
5553 proc
->pr_WindowPtr
= save_winptr
;
5558 #endif /* FEAT_SEARCHPATH */
5561 * Change directory to "new_dir". If FEAT_SEARCHPATH is defined, search
5562 * 'cdpath' for relative directory names, otherwise just mch_chdir().
5568 #ifndef FEAT_SEARCHPATH
5569 return mch_chdir((char *)new_dir
);
5574 dir_name
= find_directory_in_path(new_dir
, (int)STRLEN(new_dir
),
5575 FNAME_MESS
, curbuf
->b_ffname
);
5576 if (dir_name
== NULL
)
5578 r
= mch_chdir((char *)dir_name
);
5585 * Get user name from machine-specific function.
5586 * Returns the user name in "buf[len]".
5587 * Some systems are quite slow in obtaining the user name (Windows NT), thus
5589 * Returns OK or FAIL.
5592 get_user_name(buf
, len
)
5596 if (username
== NULL
)
5598 if (mch_get_user_name(buf
, len
) == FAIL
)
5600 username
= vim_strsave(buf
);
5603 vim_strncpy(buf
, username
, len
- 1);
5609 * Our own qsort(), for systems that don't have it.
5610 * It's simple and slow. From the K&R C book.
5613 qsort(base
, elm_count
, elm_size
, cmp
)
5617 int (*cmp
) __ARGS((const void *, const void *));
5625 buf
= alloc((unsigned)elm_size
);
5629 for (gap
= elm_count
/ 2; gap
> 0; gap
/= 2)
5630 for (i
= gap
; i
< elm_count
; ++i
)
5631 for (j
= i
- gap
; j
>= 0; j
-= gap
)
5633 /* Compare the elements. */
5634 p1
= (char_u
*)base
+ j
* elm_size
;
5635 p2
= (char_u
*)base
+ (j
+ gap
) * elm_size
;
5636 if ((*cmp
)((void *)p1
, (void *)p2
) <= 0)
5638 /* Exchange the elemets. */
5639 mch_memmove(buf
, p1
, elm_size
);
5640 mch_memmove(p1
, p2
, elm_size
);
5641 mch_memmove(p2
, buf
, elm_size
);
5649 * Sort an array of strings.
5655 sort_compare
__ARGS((const void *s1
, const void *s2
));
5661 sort_compare(s1
, s2
)
5665 return STRCMP(*(char **)s1
, *(char **)s2
);
5669 sort_strings(files
, count
)
5673 qsort((void *)files
, (size_t)count
, sizeof(char_u
*), sort_compare
);
5676 #if !defined(NO_EXPANDPATH) || defined(PROTO)
5678 * Compare path "p[]" to "q[]".
5679 * If "maxlen" >= 0 compare "p[maxlen]" to "q[maxlen]"
5680 * Return value like strcmp(p, q), but consider path separators.
5683 pathcmp(p
, q
, maxlen
)
5688 const char *s
= NULL
;
5690 for (i
= 0; maxlen
< 0 || i
< maxlen
; ++i
)
5692 /* End of "p": check if "q" also ends or just has a slash. */
5695 if (q
[i
] == NUL
) /* full match */
5701 /* End of "q": check if "p" just has a slash. */
5709 #ifdef CASE_INSENSITIVE_FILENAME
5710 TOUPPER_LOC(p
[i
]) != TOUPPER_LOC(q
[i
])
5714 #ifdef BACKSLASH_IN_FILENAME
5715 /* consider '/' and '\\' to be equal */
5716 && !((p
[i
] == '/' && q
[i
] == '\\')
5717 || (p
[i
] == '\\' && q
[i
] == '/'))
5721 if (vim_ispathsep(p
[i
]))
5723 if (vim_ispathsep(q
[i
]))
5725 return ((char_u
*)p
)[i
] - ((char_u
*)q
)[i
]; /* no match */
5728 if (s
== NULL
) /* "i" ran into "maxlen" */
5731 /* ignore a trailing slash, but not "//" or ":/" */
5734 && !after_pathsep((char_u
*)s
, (char_u
*)s
+ i
)
5735 #ifdef BACKSLASH_IN_FILENAME
5736 && (s
[i
] == '/' || s
[i
] == '\\')
5741 return 0; /* match with trailing slash */
5743 return -1; /* no match */
5749 * The putenv() implementation below comes from the "screen" program.
5750 * Included with permission from Juergen Weigert.
5751 * See pty.c for the copyright notice.
5755 * putenv -- put value into environment
5757 * Usage: i = putenv (string)
5761 * where string is of the form <name>=<value>.
5762 * Putenv returns 0 normally, -1 on error (not enough core for malloc).
5764 * Putenv may need to add a new name into the environment, or to
5765 * associate a value longer than the current value with a particular
5766 * name. So, to make life simpler, putenv() copies your entire
5767 * environment into the heap (i.e. malloc()) from the stack
5768 * (i.e. where it resides when your process is initiated) the first
5771 * (history removed, not very interesting. See the "screen" sources.)
5774 #if !defined(HAVE_SETENV) && !defined(HAVE_PUTENV)
5776 #define EXTRASIZE 5 /* increment to add to env. size */
5778 static int envsize
= -1; /* current size of environment */
5779 #ifndef MACOS_CLASSIC
5782 char **environ
; /* the global which is your env. */
5784 static int findenv
__ARGS((char *name
)); /* look for a name in the env. */
5785 static int newenv
__ARGS((void)); /* copy env. from stack to heap */
5786 static int moreenv
__ARGS((void)); /* incr. size of env. */
5796 { /* first time putenv called */
5797 if (newenv() < 0) /* copy env. to heap */
5801 i
= findenv((char *)string
); /* look for name in environment */
5804 { /* name must be added */
5805 for (i
= 0; environ
[i
]; i
++);
5806 if (i
>= (envsize
- 1))
5807 { /* need new slot */
5811 p
= (char *)alloc((unsigned)(strlen(string
) + 1));
5812 if (p
== NULL
) /* not enough core */
5814 environ
[i
+ 1] = 0; /* new end of env. */
5817 { /* name already in env. */
5818 p
= vim_realloc(environ
[i
], strlen(string
) + 1);
5822 sprintf(p
, "%s", string
); /* copy into env. */
5832 char *namechar
, *envchar
;
5836 for (i
= 0; environ
[i
] && !found
; i
++)
5838 envchar
= environ
[i
];
5840 while (*namechar
&& *namechar
!= '=' && (*namechar
== *envchar
))
5845 found
= ((*namechar
== '\0' || *namechar
== '=') && *envchar
== '=');
5847 return found
? i
- 1 : -1;
5857 /* for Mac a new, empty environment is created */
5860 for (i
= 0; environ
[i
]; i
++)
5863 esize
= i
+ EXTRASIZE
+ 1;
5864 env
= (char **)alloc((unsigned)(esize
* sizeof (elem
)));
5869 for (i
= 0; environ
[i
]; i
++)
5871 elem
= (char *)alloc((unsigned)(strlen(environ
[i
]) + 1));
5875 strcpy(elem
, environ
[i
]);
5891 esize
= envsize
+ EXTRASIZE
;
5892 env
= (char **)vim_realloc((char *)environ
, esize
* sizeof (*env
));
5900 # ifdef USE_VIMPTY_GETENV
5902 vimpty_getenv(string
)
5903 const char_u
*string
;
5911 i
= findenv((char *)string
);
5916 p
= vim_strchr((char_u
*)environ
[i
], '=');
5921 #endif /* !defined(HAVE_SETENV) && !defined(HAVE_PUTENV) */
5923 #if defined(FEAT_EVAL) || defined(FEAT_SPELL) || defined(PROTO)
5925 * Return 0 for not writable, 1 for writable file, 2 for a dir which we have
5926 * rights to write into.
5933 #if defined(UNIX) || defined(VMS)
5937 #if defined(UNIX) || defined(VMS)
5938 perm
= mch_getperm(fname
);
5940 #ifndef MACOS_CLASSIC /* TODO: get either mch_writable or mch_access */
5943 mch_writable(fname
) &&
5945 # if defined(UNIX) || defined(VMS)
5949 mch_access((char *)fname
, W_OK
) == 0
5954 if (mch_isdir(fname
))
5962 * Print an error message with one or two "%s" and one or two string arguments.
5963 * This is not in message.c to avoid a warning for prototypes.
5967 char_u
*s
, *a1
, *a2
;
5970 return TRUE
; /* no error messages at the moment */
5971 #ifdef HAVE_STDARG_H
5972 vim_snprintf((char *)IObuff
, IOSIZE
, (char *)s
, a1
, a2
);
5974 vim_snprintf((char *)IObuff
, IOSIZE
, (char *)s
, (long_u
)a1
, (long_u
)a2
);
5976 return emsg(IObuff
);
5980 * Print an error message with one "%ld" and one long int argument.
5981 * This is not in message.c to avoid a warning for prototypes.
5989 return TRUE
; /* no error messages at the moment */
5990 vim_snprintf((char *)IObuff
, IOSIZE
, (char *)s
, n
);
5991 return emsg(IObuff
);