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.
16 # include <fcntl.h> /* for chdir() */
19 static char_u
*username
= NULL
; /* cached result of mch_get_user_name() */
21 static char_u
*ff_expand_buffer
= NULL
; /* used for expanding filenames */
23 #if defined(FEAT_VIRTUALEDIT) || defined(PROTO)
24 static int coladvance2
__ARGS((pos_T
*pos
, int addspaces
, int finetune
, colnr_T wcol
));
27 * Return TRUE if in the current mode we need to use virtual.
32 /* While an operator is being executed we return "virtual_op", because
33 * VIsual_active has already been reset, thus we can't check for "block"
35 if (virtual_op
!= MAYBE
)
37 return (ve_flags
== VE_ALL
39 || ((ve_flags
& VE_BLOCK
) && VIsual_active
&& VIsual_mode
== Ctrl_V
)
41 || ((ve_flags
& VE_INSERT
) && (State
& INSERT
)));
45 * Get the screen position of the cursor.
52 getvvcol(curwin
, &curwin
->w_cursor
, &x
, NULL
, NULL
);
57 * Get the screen position of character col with a coladd in the cursor line.
60 getviscol2(col
, coladd
)
67 pos
.lnum
= curwin
->w_cursor
.lnum
;
70 getvvcol(curwin
, &pos
, &x
, NULL
, NULL
);
75 * Go to column "wcol", and add/insert white space as necessary to get the
76 * cursor in that column.
77 * The caller must have saved the cursor line for undo!
80 coladvance_force(wcol
)
83 int rc
= coladvance2(&curwin
->w_cursor
, TRUE
, FALSE
, wcol
);
86 curwin
->w_valid
&= ~VALID_VIRTCOL
;
89 /* Virtcol is valid */
90 curwin
->w_valid
|= VALID_VIRTCOL
;
91 curwin
->w_virtcol
= wcol
;
98 * Try to advance the Cursor to the specified screen column.
99 * If virtual editing: fine tune the cursor position.
100 * Note that all virtual positions off the end of a line should share
101 * a curwin->w_cursor.col value (n.b. this is equal to STRLEN(line)),
102 * beginning at coladd 0.
104 * return OK if desired column is reached, FAIL if not
110 int rc
= getvpos(&curwin
->w_cursor
, wcol
);
112 if (wcol
== MAXCOL
|| rc
== FAIL
)
113 curwin
->w_valid
&= ~VALID_VIRTCOL
;
114 else if (*ml_get_cursor() != TAB
)
116 /* Virtcol is valid when not on a TAB */
117 curwin
->w_valid
|= VALID_VIRTCOL
;
118 curwin
->w_virtcol
= wcol
;
124 * Return in "pos" the position of the cursor advanced to screen column "wcol".
125 * return OK if desired column is reached, FAIL if not
132 #ifdef FEAT_VIRTUALEDIT
133 return coladvance2(pos
, FALSE
, virtual_active(), wcol
);
137 coladvance2(pos
, addspaces
, finetune
, wcol
)
139 int addspaces
; /* change the text to achieve our goal? */
140 int finetune
; /* change char offset for the exact column */
141 colnr_T wcol
; /* column to move to */
150 #ifdef FEAT_LINEBREAK
154 one_more
= (State
& INSERT
)
155 || restart_edit
!= NUL
157 || (VIsual_active
&& *p_sel
!= 'o')
159 #ifdef FEAT_VIRTUALEDIT
160 || ((ve_flags
& VE_ONEMORE
) && wcol
< MAXCOL
)
163 line
= ml_get_curline();
167 idx
= (int)STRLEN(line
) - 1 + one_more
;
170 #ifdef FEAT_VIRTUALEDIT
171 if ((addspaces
|| finetune
) && !VIsual_active
)
173 curwin
->w_curswant
= linetabsize(line
) + one_more
;
174 if (curwin
->w_curswant
> 0)
175 --curwin
->w_curswant
;
181 #ifdef FEAT_VIRTUALEDIT
182 int width
= W_WIDTH(curwin
) - win_col_off(curwin
);
186 # ifdef FEAT_VERTSPLIT
187 && curwin
->w_width
!= 0
189 && wcol
>= (colnr_T
)width
)
191 csize
= linetabsize(line
);
195 if (wcol
/ width
> (colnr_T
)csize
/ width
196 && ((State
& INSERT
) == 0 || (int)wcol
> csize
+ 1))
198 /* In case of line wrapping don't move the cursor beyond the
199 * right screen edge. In Insert mode allow going just beyond
200 * the last character (like what happens when typing and
201 * reaching the right window edge). */
202 wcol
= (csize
/ width
+ 1) * width
- 1;
209 while (col
<= wcol
&& *ptr
!= NUL
)
211 /* Count a tab for what it's worth (if list mode not on) */
212 #ifdef FEAT_LINEBREAK
213 csize
= win_lbr_chartabsize(curwin
, ptr
, col
, &head
);
216 csize
= lbr_chartabsize_adv(&ptr
, col
);
220 idx
= (int)(ptr
- line
);
222 * Handle all the special cases. The virtual_active() check
223 * is needed to ensure that a virtual position off the end of
224 * a line has the correct indexing. The one_more comparison
225 * replaces an explicit add of one_more later on.
227 if (col
> wcol
|| (!virtual_active() && one_more
== 0))
230 # ifdef FEAT_LINEBREAK
231 /* Don't count the chars from 'showbreak'. */
237 #ifdef FEAT_VIRTUALEDIT
240 && ((col
!= wcol
&& col
!= wcol
+ 1) || csize
> 1))
242 /* 'virtualedit' is set: The difference between wcol and col is
243 * filled with spaces. */
245 if (line
[idx
] == NUL
)
248 int correct
= wcol
- col
;
249 char_u
*newline
= alloc(idx
+ correct
+ 1);
255 for (t
= 0; t
< idx
; ++t
)
256 newline
[t
] = line
[t
];
258 for (t
= 0; t
< correct
; ++t
)
259 newline
[t
+ idx
] = ' ';
261 newline
[idx
+ correct
] = NUL
;
263 ml_replace(pos
->lnum
, newline
, FALSE
);
264 changed_bytes(pos
->lnum
, (colnr_T
)idx
);
271 int linelen
= (int)STRLEN(line
);
272 int correct
= wcol
- col
- csize
+ 1; /* negative!! */
277 if (-correct
> csize
)
280 newline
= alloc(linelen
+ csize
);
284 for (t
= 0; t
< linelen
; t
++)
287 newline
[s
++] = line
[t
];
289 for (v
= 0; v
< csize
; v
++)
293 newline
[linelen
+ csize
- 1] = NUL
;
295 ml_replace(pos
->lnum
, newline
, FALSE
);
296 changed_bytes(pos
->lnum
, idx
);
297 idx
+= (csize
- 1 + correct
);
309 #ifdef FEAT_VIRTUALEDIT
316 /* The width of the last character is used to set coladd. */
321 getvcol(curwin
, pos
, &scol
, NULL
, &ecol
);
322 pos
->coladd
= ecol
- scol
;
327 int b
= (int)wcol
- (int)col
;
329 /* The difference between wcol and col is used to set coladd. */
330 if (b
> 0 && b
< (MAXCOL
- 2 * W_WIDTH(curwin
)))
339 /* prevent cursor from moving on the trail byte */
352 * Increment the line pointer 'p' crossing line boundaries as necessary.
353 * Return 1 when going to the next line.
354 * Return 2 when moving forward onto a NUL at the end of the line).
355 * Return -1 when at the end of file.
356 * Return 0 otherwise.
361 return inc(&curwin
->w_cursor
);
368 char_u
*p
= ml_get_pos(lp
);
370 if (*p
!= NUL
) /* still within line, move to next char (may be NUL) */
375 int l
= (*mb_ptr2len
)(p
);
378 return ((p
[l
] != NUL
) ? 0 : 2);
382 #ifdef FEAT_VIRTUALEDIT
385 return ((p
[1] != NUL
) ? 0 : 2);
387 if (lp
->lnum
!= curbuf
->b_ml
.ml_line_count
) /* there is a next line */
391 #ifdef FEAT_VIRTUALEDIT
400 * incl(lp): same as inc(), but skip the NUL at the end of non-empty lines
408 if ((r
= inc(lp
)) >= 1 && lp
->col
)
416 * Decrement the line pointer 'p' crossing line boundaries as necessary.
417 * Return 1 when crossing a line, -1 when at start of file, 0 otherwise.
422 return dec(&curwin
->w_cursor
);
431 #ifdef FEAT_VIRTUALEDIT
434 if (lp
->col
> 0) /* still within line */
440 p
= ml_get(lp
->lnum
);
441 lp
->col
-= (*mb_head_off
)(p
, p
+ lp
->col
);
446 if (lp
->lnum
> 1) /* there is a prior line */
449 p
= ml_get(lp
->lnum
);
450 lp
->col
= (colnr_T
)STRLEN(p
);
453 lp
->col
-= (*mb_head_off
)(p
, p
+ lp
->col
);
457 return -1; /* at start of file */
461 * decl(lp): same as dec(), but skip the NUL at the end of non-empty lines
469 if ((r
= dec(lp
)) == 1 && lp
->col
)
475 * Make sure curwin->w_cursor.lnum is valid.
480 if (curwin
->w_cursor
.lnum
> curbuf
->b_ml
.ml_line_count
)
483 /* If there is a closed fold at the end of the file, put the cursor in
484 * its first line. Otherwise in the last line. */
485 if (!hasFolding(curbuf
->b_ml
.ml_line_count
,
486 &curwin
->w_cursor
.lnum
, NULL
))
488 curwin
->w_cursor
.lnum
= curbuf
->b_ml
.ml_line_count
;
490 if (curwin
->w_cursor
.lnum
<= 0)
491 curwin
->w_cursor
.lnum
= 1;
495 * Make sure curwin->w_cursor.col is valid.
501 #ifdef FEAT_VIRTUALEDIT
502 colnr_T oldcol
= curwin
->w_cursor
.col
+ curwin
->w_cursor
.coladd
;
505 len
= (colnr_T
)STRLEN(ml_get_curline());
507 curwin
->w_cursor
.col
= 0;
508 else if (curwin
->w_cursor
.col
>= len
)
510 /* Allow cursor past end-of-line when:
511 * - in Insert mode or restarting Insert mode
512 * - in Visual mode and 'selection' isn't "old"
513 * - 'virtualedit' is set */
514 if ((State
& INSERT
) || restart_edit
516 || (VIsual_active
&& *p_sel
!= 'o')
518 #ifdef FEAT_VIRTUALEDIT
519 || (ve_flags
& VE_ONEMORE
)
522 curwin
->w_cursor
.col
= len
;
525 curwin
->w_cursor
.col
= len
- 1;
527 /* prevent cursor from moving on the trail byte */
534 #ifdef FEAT_VIRTUALEDIT
535 /* If virtual editing is on, we can leave the cursor on the old position,
536 * only we must set it to virtual. But don't do it when at the end of the
538 if (oldcol
== MAXCOL
)
539 curwin
->w_cursor
.coladd
= 0;
540 else if (ve_flags
== VE_ALL
)
541 curwin
->w_cursor
.coladd
= oldcol
- curwin
->w_cursor
.col
;
546 * make sure curwin->w_cursor in on a valid character
555 #if defined(FEAT_TEXTOBJ) || defined(PROTO)
557 * Make sure curwin->w_cursor is not on the NUL at the end of the line.
558 * Allow it when in Visual mode and 'selection' is not "old".
563 if (curwin
->w_cursor
.col
> 0
565 && (!VIsual_active
|| *p_sel
== 'o')
567 && gchar_cursor() == NUL
)
568 --curwin
->w_cursor
.col
;
573 * When curwin->w_leftcol has changed, adjust the cursor position.
574 * Return TRUE if the cursor was moved.
583 changed_cline_bef_curs();
584 lastcol
= curwin
->w_leftcol
+ W_WIDTH(curwin
) - curwin_col_off() - 1;
588 * If the cursor is right or left of the screen, move it to last or first
591 if (curwin
->w_virtcol
> (colnr_T
)(lastcol
- p_siso
))
594 coladvance((colnr_T
)(lastcol
- p_siso
));
596 else if (curwin
->w_virtcol
< curwin
->w_leftcol
+ p_siso
)
599 (void)coladvance((colnr_T
)(curwin
->w_leftcol
+ p_siso
));
603 * If the start of the character under the cursor is not on the screen,
604 * advance the cursor one more char. If this fails (last char of the
605 * line) adjust the scrolling.
607 getvvcol(curwin
, &curwin
->w_cursor
, &s
, NULL
, &e
);
608 if (e
> (colnr_T
)lastcol
)
613 else if (s
< curwin
->w_leftcol
)
616 if (coladvance(e
+ 1) == FAIL
) /* there isn't another character */
618 curwin
->w_leftcol
= s
; /* adjust w_leftcol instead */
619 changed_cline_bef_curs();
624 curwin
->w_set_curswant
= TRUE
;
625 redraw_later(NOT_VALID
);
629 /**********************************************************************
630 * Various routines dealing with allocation and deallocation of memory.
633 #if defined(MEM_PROFILE) || defined(PROTO)
635 # define MEM_SIZES 8200
636 static long_u mem_allocs
[MEM_SIZES
];
637 static long_u mem_frees
[MEM_SIZES
];
638 static long_u mem_allocated
;
639 static long_u mem_freed
;
640 static long_u mem_peak
;
641 static long_u num_alloc
;
642 static long_u num_freed
;
644 static void mem_pre_alloc_s
__ARGS((size_t *sizep
));
645 static void mem_pre_alloc_l
__ARGS((long_u
*sizep
));
646 static void mem_post_alloc
__ARGS((void **pp
, size_t size
));
647 static void mem_pre_free
__ARGS((void **pp
));
650 mem_pre_alloc_s(sizep
)
653 *sizep
+= sizeof(size_t);
657 mem_pre_alloc_l(sizep
)
660 *sizep
+= sizeof(size_t);
664 mem_post_alloc(pp
, size
)
670 size
-= sizeof(size_t);
671 *(long_u
*)*pp
= size
;
672 if (size
<= MEM_SIZES
-1)
673 mem_allocs
[size
-1]++;
675 mem_allocs
[MEM_SIZES
-1]++;
676 mem_allocated
+= size
;
677 if (mem_allocated
- mem_freed
> mem_peak
)
678 mem_peak
= mem_allocated
- mem_freed
;
680 *pp
= (void *)((char *)*pp
+ sizeof(size_t));
689 *pp
= (void *)((char *)*pp
- sizeof(size_t));
690 size
= *(size_t *)*pp
;
691 if (size
<= MEM_SIZES
-1)
694 mem_frees
[MEM_SIZES
-1]++;
700 * called on exit via atexit()
703 vim_mem_profile_dump()
709 for (i
= 0; i
< MEM_SIZES
- 1; i
++)
711 if (mem_allocs
[i
] || mem_frees
[i
])
713 if (mem_frees
[i
] > mem_allocs
[i
])
714 printf("\r\n%s", _("ERROR: "));
715 printf("[%4d / %4lu-%-4lu] ", i
+ 1, mem_allocs
[i
], mem_frees
[i
]);
729 if (mem_frees
[i
] > mem_allocs
[i
])
730 printf(_("ERROR: "));
731 printf("[>%d / %4lu-%-4lu]", i
, mem_allocs
[i
], mem_frees
[i
]);
734 printf(_("\n[bytes] total alloc-freed %lu-%lu, in use %lu, peak use %lu\n"),
735 mem_allocated
, mem_freed
, mem_allocated
- mem_freed
, mem_peak
);
736 printf(_("[calls] total re/malloc()'s %lu, total free()'s %lu\n\n"),
737 num_alloc
, num_freed
);
740 #endif /* MEM_PROFILE */
743 * Some memory is reserved for error messages and for being able to
744 * call mf_release_all(), which needs some memory for mf_trans_add().
746 #if defined(MSDOS) && !defined(DJGPP)
748 # define KEEP_ROOM 8192L
750 # define KEEP_ROOM (2 * 8192L)
754 * Note: if unsinged is 16 bits we can only allocate up to 64K with alloc().
755 * Use lalloc for larger blocks.
761 return (lalloc((long_u
)size
, TRUE
));
765 * Allocate memory and set all bytes to zero.
773 p
= (lalloc((long_u
)size
, TRUE
));
775 (void)vim_memset(p
, 0, (size_t)size
);
780 * alloc() with check for maximum line length
786 #if !defined(UNIX) && !defined(__EMX__)
787 if (sizeof(int) == 2 && size
> 0x7fff)
789 /* Don't hide this message */
791 EMSG(_("E340: Line is becoming too long"));
795 return (lalloc((long_u
)size
, TRUE
));
799 * Allocate memory like lalloc() and set all bytes to zero.
802 lalloc_clear(size
, message
)
808 p
= (lalloc(size
, message
));
810 (void)vim_memset(p
, 0, (size_t)size
);
815 * Low level memory allocation function.
816 * This is used often, KEEP IT FAST!
819 lalloc(size
, message
)
823 char_u
*p
; /* pointer to new storage space */
824 static int releasing
= FALSE
; /* don't do mf_release_all() recursive */
826 #if defined(HAVE_AVAIL_MEM) && !defined(SMALL_MEM)
827 static long_u allocated
= 0; /* allocated since last avail check */
830 /* Safety check for allocating zero bytes */
833 /* Don't hide this message */
835 EMSGN(_("E341: Internal error: lalloc(%ld, )"), size
);
840 mem_pre_alloc_l(&size
);
843 #if defined(MSDOS) && !defined(DJGPP)
844 if (size
>= 0xfff0) /* in MSDOS we can't deal with >64K blocks */
850 * Loop when out of memory: Try to release some memfile blocks and
851 * if some blocks are released call malloc again.
856 * Handle three kind of systems:
857 * 1. No check for available memory: Just return.
858 * 2. Slow check for available memory: call mch_avail_mem() after
859 * allocating KEEP_ROOM amount of memory.
860 * 3. Strict check for available memory: call mch_avail_mem()
862 if ((p
= (char_u
*)malloc((size_t)size
)) != NULL
)
864 #ifndef HAVE_AVAIL_MEM
865 /* 1. No check for available memory: Just return. */
869 /* 2. Slow check for available memory: call mch_avail_mem() after
870 * allocating (KEEP_ROOM / 2) amount of memory. */
872 if (allocated
< KEEP_ROOM
/ 2)
876 /* 3. check for available memory: call mch_avail_mem() */
877 if (mch_avail_mem(TRUE
) < KEEP_ROOM
&& !releasing
)
879 vim_free((char *)p
); /* System is low... no go! */
887 * Remember that mf_release_all() is being called to avoid an endless
888 * loop, because mf_release_all() may call alloc() recursively.
894 clear_sb_text(); /* free any scrollback text */
895 try_again
= mf_release_all(); /* release as many blocks as possible */
897 try_again
|= garbage_collect(); /* cleanup recursive lists/dicts */
905 if (message
&& p
== NULL
)
906 do_outofmem_msg(size
);
910 mem_post_alloc((void **)&p
, (size_t)size
);
915 #if defined(MEM_PROFILE) || defined(PROTO)
917 * realloc() with memory profiling.
920 mem_realloc(ptr
, size
)
927 mem_pre_alloc_s(&size
);
929 p
= realloc(ptr
, size
);
931 mem_post_alloc(&p
, size
);
938 * Avoid repeating the error message many times (they take 1 second each).
939 * Did_outofmem_msg is reset when a character is read.
942 do_outofmem_msg(size
)
945 if (!did_outofmem_msg
)
947 /* Don't hide this message */
949 EMSGN(_("E342: Out of memory! (allocating %lu bytes)"), size
);
950 did_outofmem_msg
= TRUE
;
954 #if defined(EXITFREE) || defined(PROTO)
956 # if defined(FEAT_SEARCHPATH)
957 static void free_findfile
__ARGS((void));
961 * Free everything that we allocated.
962 * Can be used to detect memory leaks, e.g., with ccmalloc.
963 * NOTE: This is tricky! Things are freed that functions depend on. Don't be
964 * surprised if Vim crashes...
965 * Some things can't be freed, esp. things local to a library function.
970 buf_T
*buf
, *nextbuf
;
971 static int entered
= FALSE
;
973 /* When we cause a crash here it is caught and Vim tries to exit cleanly.
974 * Don't try freeing everything again. */
980 block_autocmds(); /* don't want to trigger autocommands here */
984 /* close all tabs and windows */
985 if (first_tabpage
->tp_next
!= NULL
)
986 do_cmdline_cmd((char_u
*)"tabonly!");
987 if (firstwin
!= lastwin
)
988 do_cmdline_cmd((char_u
*)"only!");
991 # if defined(FEAT_SPELL)
992 /* Free all spell info. */
996 # if defined(FEAT_USR_CMDS)
997 /* Clear user commands (before deleting buffers). */
1003 do_cmdline_cmd((char_u
*)"aunmenu *");
1006 /* Clear mappings, abbreviations, breakpoints. */
1007 do_cmdline_cmd((char_u
*)"mapclear");
1008 do_cmdline_cmd((char_u
*)"mapclear!");
1009 do_cmdline_cmd((char_u
*)"abclear");
1010 # if defined(FEAT_EVAL)
1011 do_cmdline_cmd((char_u
*)"breakdel *");
1013 # if defined(FEAT_PROFILE)
1014 do_cmdline_cmd((char_u
*)"profdel *");
1020 # if defined(FEAT_SEARCHPATH)
1024 /* Obviously named calls. */
1025 # if defined(FEAT_AUTOCMD)
1026 free_all_autocmds();
1031 alist_clear(&global_alist
);
1033 free_search_patterns();
1036 free_prev_shellcmd();
1037 free_regexp_stuff();
1041 set_expr_line(NULL
);
1046 clear_sb_text(); /* free any scrollback text */
1048 /* Free some global vars. */
1050 # ifdef FEAT_CLIPBOARD
1051 vim_free(clip_exclude_prog
);
1053 vim_free(last_cmdline
);
1054 # ifdef FEAT_CMDHIST
1055 vim_free(new_last_cmdline
);
1057 set_keep_msg(NULL
, 0);
1058 vim_free(ff_expand_buffer
);
1060 /* Clear cmdline history. */
1062 # ifdef FEAT_CMDHIST
1066 #ifdef FEAT_QUICKFIX
1071 /* Free all location lists */
1072 FOR_ALL_WINDOWS(win
)
1077 /* Close all script inputs. */
1078 close_all_scripts();
1080 #if defined(FEAT_WINDOWS)
1081 /* Destroy all windows. Must come before freeing buffers. */
1085 /* Free all buffers. */
1086 for (buf
= firstbuf
; buf
!= NULL
; )
1088 nextbuf
= buf
->b_next
;
1089 close_buffer(NULL
, buf
, DOBUF_WIPE
);
1091 buf
= nextbuf
; /* didn't work, try next one */
1100 /* Clear registers. */
1105 #if defined(FEAT_CLIENTSERVER) && defined(FEAT_X11)
1106 vim_free(serverDelayedStartName
);
1109 /* highlight info */
1112 reset_last_sourcing();
1115 free_tabpage(first_tabpage
);
1116 first_tabpage
= NULL
;
1120 /* Machine-specific free. */
1124 /* message history */
1126 if (delete_first_msg() == FAIL
)
1135 /* screenlines (can't display anything now!) */
1138 #if defined(USE_XSMP)
1152 * copy a string into newly allocated memory
1161 len
= (unsigned)STRLEN(string
) + 1;
1164 mch_memmove(p
, string
, (size_t)len
);
1169 vim_strnsave(string
, len
)
1175 p
= alloc((unsigned)(len
+ 1));
1178 STRNCPY(p
, string
, len
);
1185 * Same as vim_strsave(), but any characters found in esc_chars are preceded
1189 vim_strsave_escaped(string
, esc_chars
)
1193 return vim_strsave_escaped_ext(string
, esc_chars
, '\\', FALSE
);
1197 * Same as vim_strsave_escaped(), but when "bsl" is TRUE also escape
1198 * characters where rem_backslash() would remove the backslash.
1199 * Escape the characters with "cc".
1202 vim_strsave_escaped_ext(string
, esc_chars
, cc
, bsl
)
1210 char_u
*escaped_string
;
1217 * First count the number of backslashes required.
1218 * Then allocate the memory and insert them.
1220 length
= 1; /* count the trailing NUL */
1221 for (p
= string
; *p
; p
++)
1224 if (has_mbyte
&& (l
= (*mb_ptr2len
)(p
)) > 1)
1226 length
+= l
; /* count a multibyte char */
1231 if (vim_strchr(esc_chars
, *p
) != NULL
|| (bsl
&& rem_backslash(p
)))
1232 ++length
; /* count a backslash */
1233 ++length
; /* count an ordinary char */
1235 escaped_string
= alloc(length
);
1236 if (escaped_string
!= NULL
)
1238 p2
= escaped_string
;
1239 for (p
= string
; *p
; p
++)
1242 if (has_mbyte
&& (l
= (*mb_ptr2len
)(p
)) > 1)
1244 mch_memmove(p2
, p
, (size_t)l
);
1246 p
+= l
- 1; /* skip multibyte char */
1250 if (vim_strchr(esc_chars
, *p
) != NULL
|| (bsl
&& rem_backslash(p
)))
1256 return escaped_string
;
1259 #if defined(FEAT_EVAL) || defined(PROTO)
1261 * Escape "string" for use as a shell argument with system().
1262 * This uses single quotes, except when we know we need to use double qoutes
1263 * (MS-DOS and MS-Windows without 'shellslash' set).
1264 * Returns the result in allocated memory, NULL if we have run out.
1267 vim_strsave_shellescape(string
)
1273 char_u
*escaped_string
;
1275 /* First count the number of extra bytes required. */
1276 length
= (unsigned)STRLEN(string
) + 3; /* two quotes and a trailing NUL */
1277 for (p
= string
; *p
!= NUL
; mb_ptr_adv(p
))
1279 # if defined(WIN32) || defined(WIN16) || defined(DOS)
1283 ++length
; /* " -> "" */
1288 length
+= 3; /* ' => '\'' */
1291 /* Allocate memory for the result and fill it. */
1292 escaped_string
= alloc(length
);
1293 if (escaped_string
!= NULL
)
1297 /* add opening quote */
1298 # if defined(WIN32) || defined(WIN16) || defined(DOS)
1305 for (p
= string
; *p
!= NUL
; )
1307 # if defined(WIN32) || defined(WIN16) || defined(DOS)
1333 /* add terminating quote and finish with a NUL */
1334 # if defined(WIN32) || defined(WIN16) || defined(DOS)
1343 return escaped_string
;
1348 * Like vim_strsave(), but make all characters uppercase.
1349 * This uses ASCII lower-to-upper case translation, language independent.
1352 vim_strsave_up(string
)
1357 p1
= vim_strsave(string
);
1363 * Like vim_strnsave(), but make all characters uppercase.
1364 * This uses ASCII lower-to-upper case translation, language independent.
1367 vim_strnsave_up(string
, len
)
1373 p1
= vim_strnsave(string
, len
);
1379 * ASCII lower-to-upper case translation, language independent.
1391 while ((c
= *p2
) != NUL
)
1393 *p2
++ = isalpha(c
) ? toupper(c
) : c
;
1395 *p2
++ = (c
< 'a' || c
> 'z') ? c
: (c
- 0x20);
1400 #if defined(FEAT_EVAL) || defined(FEAT_SPELL) || defined(PROTO)
1402 * Make string "s" all upper-case and return it in allocated memory.
1403 * Handles multi-byte characters as well as possible.
1404 * Returns NULL when out of memory.
1413 res
= p
= vim_strsave(orig
);
1427 c
= utf_ptr2char(p
);
1428 uc
= utf_toupper(c
);
1430 /* Reallocate string when byte count changes. This is rare,
1431 * thus it's OK to do another malloc()/free(). */
1433 nl
= utf_char2len(uc
);
1436 s
= alloc((unsigned)STRLEN(res
) + 1 + nl
- l
);
1439 mch_memmove(s
, res
, p
- res
);
1440 STRCPY(s
+ (p
- res
) + nl
, p
+ l
);
1446 utf_char2bytes(uc
, p
);
1449 else if (has_mbyte
&& (l
= (*mb_ptr2len
)(p
)) > 1)
1450 p
+= l
; /* skip multi-byte character */
1454 *p
= TOUPPER_LOC(*p
); /* note that toupper() can be a macro */
1464 * copy a space a number of times
1467 copy_spaces(ptr
, count
)
1478 #if defined(FEAT_VISUALEXTRA) || defined(PROTO)
1480 * Copy a character a number of times.
1481 * Does not work for multi-byte charactes!
1484 copy_chars(ptr
, count
, c
)
1498 * delete spaces at the end of a string
1501 del_trailing_spaces(ptr
)
1506 q
= ptr
+ STRLEN(ptr
);
1507 while (--q
> ptr
&& vim_iswhite(q
[0]) && q
[-1] != '\\' && q
[-1] != Ctrl_V
)
1512 * Like strncpy(), but always terminate the result with one NUL.
1513 * "to" must be "len + 1" long!
1516 vim_strncpy(to
, from
, len
)
1521 STRNCPY(to
, from
, len
);
1526 * Isolate one part of a string option where parts are separated with
1528 * The part is copied into "buf[maxlen]".
1529 * "*option" is advanced to the next part.
1530 * The length is returned.
1533 copy_option_part(option
, buf
, maxlen
, sep_chars
)
1540 char_u
*p
= *option
;
1542 /* skip '.' at start of option part, for 'suffixes' */
1545 while (*p
!= NUL
&& vim_strchr((char_u
*)sep_chars
, *p
) == NULL
)
1548 * Skip backslash before a separator character and space.
1550 if (p
[0] == '\\' && vim_strchr((char_u
*)sep_chars
, p
[1]) != NULL
)
1552 if (len
< maxlen
- 1)
1558 if (*p
!= NUL
&& *p
!= ',') /* skip non-standard separator */
1560 p
= skip_to_option_part(p
); /* p points to next file name */
1567 * Replacement for free() that ignores NULL pointers.
1568 * Also skip free() when exiting for sure, this helps when we caught a deadly
1569 * signal that was caused by a crash in free().
1575 if (x
!= NULL
&& !really_exiting
)
1586 vim_memset(ptr
, c
, size
)
1601 * Return zero when "b1" and "b2" are the same for "len" bytes.
1602 * Return non-zero otherwise.
1605 vim_memcmp(b1
, b2
, len
)
1610 char_u
*p1
= (char_u
*)b1
, *p2
= (char_u
*)b2
;
1612 for ( ; len
> 0; --len
)
1625 * Version of memmove() that handles overlapping source and destination.
1626 * For systems that don't have a function that is guaranteed to do that (SYSV).
1629 mch_memmove(dst_arg
, src_arg
, len
)
1630 void *src_arg
, *dst_arg
;
1634 * A void doesn't have a size, we use char pointers.
1636 char *dst
= dst_arg
, *src
= src_arg
;
1638 /* overlap, copy backwards */
1639 if (dst
> src
&& dst
< src
+ len
)
1646 else /* copy forwards */
1652 #if (!defined(HAVE_STRCASECMP) && !defined(HAVE_STRICMP)) || defined(PROTO)
1654 * Compare two strings, ignoring case, using current locale.
1655 * Doesn't work for multi-byte characters.
1656 * return 0 for match, < 0 for smaller, > 0 for bigger
1667 i
= (int)TOLOWER_LOC(*s1
) - (int)TOLOWER_LOC(*s2
);
1669 return i
; /* this character different */
1671 break; /* strings match until NUL */
1675 return 0; /* strings match */
1679 #if (!defined(HAVE_STRNCASECMP) && !defined(HAVE_STRNICMP)) || defined(PROTO)
1681 * Compare two strings, for length "len", ignoring case, using current locale.
1682 * Doesn't work for multi-byte characters.
1683 * return 0 for match, < 0 for smaller, > 0 for bigger
1686 vim_strnicmp(s1
, s2
, len
)
1695 i
= (int)TOLOWER_LOC(*s1
) - (int)TOLOWER_LOC(*s2
);
1697 return i
; /* this character different */
1699 break; /* strings match until NUL */
1704 return 0; /* strings match */
1708 #if 0 /* currently not used */
1710 * Check if string "s2" appears somewhere in "s1" while ignoring case.
1711 * Return NULL if not, a pointer to the first occurrence if it does.
1719 int len
= STRLEN(s2
);
1720 char_u
*end
= s1
+ STRLEN(s1
) - len
;
1722 for (p
= s1
; p
<= end
; ++p
)
1723 if (STRNICMP(p
, s2
, len
) == 0)
1730 * Version of strchr() and strrchr() that handle unsigned char strings
1731 * with characters from 128 to 255 correctly. It also doesn't return a
1732 * pointer to the NUL at the end of the string.
1735 vim_strchr(string
, c
)
1744 if (enc_utf8
&& c
>= 0x80)
1748 if (utf_ptr2char(p
) == c
)
1750 p
+= (*mb_ptr2len
)(p
);
1754 if (enc_dbcs
!= 0 && c
> 255)
1758 c
= ((unsigned)c
>> 8) & 0xff;
1759 while ((b
= *p
) != NUL
)
1761 if (b
== c
&& p
[1] == n2
)
1763 p
+= (*mb_ptr2len
)(p
);
1769 while ((b
= *p
) != NUL
)
1773 p
+= (*mb_ptr2len
)(p
);
1778 while ((b
= *p
) != NUL
)
1788 * Version of strchr() that only works for bytes and handles unsigned char
1789 * strings with characters above 128 correctly. It also doesn't return a
1790 * pointer to the NUL at the end of the string.
1793 vim_strbyte(string
, c
)
1809 * Search for last occurrence of "c" in "string".
1810 * Return NULL if not found.
1811 * Does not handle multi-byte char for "c"!
1814 vim_strrchr(string
, c
)
1818 char_u
*retval
= NULL
;
1831 * Vim's version of strpbrk(), in case it's missing.
1832 * Don't generate a prototype for this, causes problems when it's not used.
1835 # ifndef HAVE_STRPBRK
1840 vim_strpbrk(s
, charset
)
1846 if (vim_strchr(charset
, *s
) != NULL
)
1856 * Vim has its own isspace() function, because on some machines isspace()
1857 * can't handle characters above 128.
1863 return ((x
>= 9 && x
<= 13) || x
== ' ');
1866 /************************************************************************
1867 * Functions for handling growing arrays.
1871 * Clear an allocated growing array.
1877 vim_free(gap
->ga_data
);
1882 * Clear a growing array that contains a list of strings.
1885 ga_clear_strings(gap
)
1890 for (i
= 0; i
< gap
->ga_len
; ++i
)
1891 vim_free(((char_u
**)(gap
->ga_data
))[i
]);
1896 * Initialize a growing array. Don't forget to set ga_itemsize and
1897 * ga_growsize! Or use ga_init2().
1903 gap
->ga_data
= NULL
;
1909 ga_init2(gap
, itemsize
, growsize
)
1915 gap
->ga_itemsize
= itemsize
;
1916 gap
->ga_growsize
= growsize
;
1920 * Make room in growing array "gap" for at least "n" items.
1921 * Return FAIL for failure, OK otherwise.
1931 if (gap
->ga_maxlen
- gap
->ga_len
< n
)
1933 if (n
< gap
->ga_growsize
)
1934 n
= gap
->ga_growsize
;
1935 len
= gap
->ga_itemsize
* (gap
->ga_len
+ n
);
1936 pp
= alloc_clear((unsigned)len
);
1939 gap
->ga_maxlen
= gap
->ga_len
+ n
;
1940 if (gap
->ga_data
!= NULL
)
1942 mch_memmove(pp
, gap
->ga_data
,
1943 (size_t)(gap
->ga_itemsize
* gap
->ga_len
));
1944 vim_free(gap
->ga_data
);
1952 * Concatenate a string to a growarray which contains characters.
1953 * Note: Does NOT copy the NUL at the end!
1960 int len
= (int)STRLEN(s
);
1962 if (ga_grow(gap
, len
) == OK
)
1964 mch_memmove((char *)gap
->ga_data
+ gap
->ga_len
, s
, (size_t)len
);
1970 * Append one byte to a growarray which contains bytes.
1977 if (ga_grow(gap
, 1) == OK
)
1979 *((char *)gap
->ga_data
+ gap
->ga_len
) = c
;
1984 /************************************************************************
1985 * functions that use lookup tables for various things, generally to do with
1986 * special key codes.
1990 * Some useful tables.
1993 static struct modmasktable
1995 short mod_mask
; /* Bit-mask for particular key modifier */
1996 short mod_flag
; /* Bit(s) for particular key modifier */
1997 char_u name
; /* Single letter name of modifier */
1998 } mod_mask_table
[] =
2000 {MOD_MASK_ALT
, MOD_MASK_ALT
, (char_u
)'M'},
2001 {MOD_MASK_META
, MOD_MASK_META
, (char_u
)'T'},
2002 {MOD_MASK_CTRL
, MOD_MASK_CTRL
, (char_u
)'C'},
2003 {MOD_MASK_SHIFT
, MOD_MASK_SHIFT
, (char_u
)'S'},
2004 {MOD_MASK_MULTI_CLICK
, MOD_MASK_2CLICK
, (char_u
)'2'},
2005 {MOD_MASK_MULTI_CLICK
, MOD_MASK_3CLICK
, (char_u
)'3'},
2006 {MOD_MASK_MULTI_CLICK
, MOD_MASK_4CLICK
, (char_u
)'4'},
2008 {MOD_MASK_CMD
, MOD_MASK_CMD
, (char_u
)'D'},
2010 /* 'A' must be the last one */
2011 {MOD_MASK_ALT
, MOD_MASK_ALT
, (char_u
)'A'},
2016 * Shifted key terminal codes and their unshifted equivalent.
2017 * Don't add mouse codes here, they are handled separately!
2019 #define MOD_KEYS_ENTRY_SIZE 5
2021 static char_u modifier_keys_table
[] =
2023 /* mod mask with modifier without modifier */
2024 MOD_MASK_SHIFT
, '&', '9', '@', '1', /* begin */
2025 MOD_MASK_SHIFT
, '&', '0', '@', '2', /* cancel */
2026 MOD_MASK_SHIFT
, '*', '1', '@', '4', /* command */
2027 MOD_MASK_SHIFT
, '*', '2', '@', '5', /* copy */
2028 MOD_MASK_SHIFT
, '*', '3', '@', '6', /* create */
2029 MOD_MASK_SHIFT
, '*', '4', 'k', 'D', /* delete char */
2030 MOD_MASK_SHIFT
, '*', '5', 'k', 'L', /* delete line */
2031 MOD_MASK_SHIFT
, '*', '7', '@', '7', /* end */
2032 MOD_MASK_CTRL
, KS_EXTRA
, (int)KE_C_END
, '@', '7', /* end */
2033 MOD_MASK_SHIFT
, '*', '9', '@', '9', /* exit */
2034 MOD_MASK_SHIFT
, '*', '0', '@', '0', /* find */
2035 MOD_MASK_SHIFT
, '#', '1', '%', '1', /* help */
2036 MOD_MASK_SHIFT
, '#', '2', 'k', 'h', /* home */
2037 MOD_MASK_CTRL
, KS_EXTRA
, (int)KE_C_HOME
, 'k', 'h', /* home */
2038 MOD_MASK_SHIFT
, '#', '3', 'k', 'I', /* insert */
2039 MOD_MASK_SHIFT
, '#', '4', 'k', 'l', /* left arrow */
2040 MOD_MASK_CTRL
, KS_EXTRA
, (int)KE_C_LEFT
, 'k', 'l', /* left arrow */
2041 MOD_MASK_SHIFT
, '%', 'a', '%', '3', /* message */
2042 MOD_MASK_SHIFT
, '%', 'b', '%', '4', /* move */
2043 MOD_MASK_SHIFT
, '%', 'c', '%', '5', /* next */
2044 MOD_MASK_SHIFT
, '%', 'd', '%', '7', /* options */
2045 MOD_MASK_SHIFT
, '%', 'e', '%', '8', /* previous */
2046 MOD_MASK_SHIFT
, '%', 'f', '%', '9', /* print */
2047 MOD_MASK_SHIFT
, '%', 'g', '%', '0', /* redo */
2048 MOD_MASK_SHIFT
, '%', 'h', '&', '3', /* replace */
2049 MOD_MASK_SHIFT
, '%', 'i', 'k', 'r', /* right arr. */
2050 MOD_MASK_CTRL
, KS_EXTRA
, (int)KE_C_RIGHT
, 'k', 'r', /* right arr. */
2051 MOD_MASK_SHIFT
, '%', 'j', '&', '5', /* resume */
2052 MOD_MASK_SHIFT
, '!', '1', '&', '6', /* save */
2053 MOD_MASK_SHIFT
, '!', '2', '&', '7', /* suspend */
2054 MOD_MASK_SHIFT
, '!', '3', '&', '8', /* undo */
2055 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_UP
, 'k', 'u', /* up arrow */
2056 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_DOWN
, 'k', 'd', /* down arrow */
2059 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_XF1
, KS_EXTRA
, (int)KE_XF1
,
2060 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_XF2
, KS_EXTRA
, (int)KE_XF2
,
2061 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_XF3
, KS_EXTRA
, (int)KE_XF3
,
2062 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_XF4
, KS_EXTRA
, (int)KE_XF4
,
2064 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F1
, 'k', '1', /* F1 */
2065 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F2
, 'k', '2',
2066 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F3
, 'k', '3',
2067 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F4
, 'k', '4',
2068 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F5
, 'k', '5',
2069 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F6
, 'k', '6',
2070 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F7
, 'k', '7',
2071 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F8
, 'k', '8',
2072 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F9
, 'k', '9',
2073 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F10
, 'k', ';', /* F10 */
2075 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F11
, 'F', '1',
2076 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F12
, 'F', '2',
2077 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F13
, 'F', '3',
2078 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F14
, 'F', '4',
2079 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F15
, 'F', '5',
2080 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F16
, 'F', '6',
2081 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F17
, 'F', '7',
2082 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F18
, 'F', '8',
2083 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F19
, 'F', '9',
2084 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F20
, 'F', 'A',
2086 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F21
, 'F', 'B',
2087 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F22
, 'F', 'C',
2088 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F23
, 'F', 'D',
2089 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F24
, 'F', 'E',
2090 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F25
, 'F', 'F',
2091 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F26
, 'F', 'G',
2092 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F27
, 'F', 'H',
2093 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F28
, 'F', 'I',
2094 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F29
, 'F', 'J',
2095 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F30
, 'F', 'K',
2097 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F31
, 'F', 'L',
2098 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F32
, 'F', 'M',
2099 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F33
, 'F', 'N',
2100 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F34
, 'F', 'O',
2101 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F35
, 'F', 'P',
2102 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F36
, 'F', 'Q',
2103 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F37
, 'F', 'R',
2105 /* TAB pseudo code*/
2106 MOD_MASK_SHIFT
, 'k', 'B', KS_EXTRA
, (int)KE_TAB
,
2111 static struct key_name_entry
2113 int key
; /* Special key code or ascii value */
2114 char_u
*name
; /* Name of key */
2115 } key_names_table
[] =
2117 {' ', (char_u
*)"Space"},
2118 {TAB
, (char_u
*)"Tab"},
2119 {K_TAB
, (char_u
*)"Tab"},
2120 {NL
, (char_u
*)"NL"},
2121 {NL
, (char_u
*)"NewLine"}, /* Alternative name */
2122 {NL
, (char_u
*)"LineFeed"}, /* Alternative name */
2123 {NL
, (char_u
*)"LF"}, /* Alternative name */
2124 {CAR
, (char_u
*)"CR"},
2125 {CAR
, (char_u
*)"Return"}, /* Alternative name */
2126 {CAR
, (char_u
*)"Enter"}, /* Alternative name */
2127 {K_BS
, (char_u
*)"BS"},
2128 {K_BS
, (char_u
*)"BackSpace"}, /* Alternative name */
2129 {ESC
, (char_u
*)"Esc"},
2130 {CSI
, (char_u
*)"CSI"},
2131 {K_CSI
, (char_u
*)"xCSI"},
2132 {'|', (char_u
*)"Bar"},
2133 {'\\', (char_u
*)"Bslash"},
2134 {K_DEL
, (char_u
*)"Del"},
2135 {K_DEL
, (char_u
*)"Delete"}, /* Alternative name */
2136 {K_KDEL
, (char_u
*)"kDel"},
2137 {K_UP
, (char_u
*)"Up"},
2138 {K_DOWN
, (char_u
*)"Down"},
2139 {K_LEFT
, (char_u
*)"Left"},
2140 {K_RIGHT
, (char_u
*)"Right"},
2141 {K_XUP
, (char_u
*)"xUp"},
2142 {K_XDOWN
, (char_u
*)"xDown"},
2143 {K_XLEFT
, (char_u
*)"xLeft"},
2144 {K_XRIGHT
, (char_u
*)"xRight"},
2146 {K_F1
, (char_u
*)"F1"},
2147 {K_F2
, (char_u
*)"F2"},
2148 {K_F3
, (char_u
*)"F3"},
2149 {K_F4
, (char_u
*)"F4"},
2150 {K_F5
, (char_u
*)"F5"},
2151 {K_F6
, (char_u
*)"F6"},
2152 {K_F7
, (char_u
*)"F7"},
2153 {K_F8
, (char_u
*)"F8"},
2154 {K_F9
, (char_u
*)"F9"},
2155 {K_F10
, (char_u
*)"F10"},
2157 {K_F11
, (char_u
*)"F11"},
2158 {K_F12
, (char_u
*)"F12"},
2159 {K_F13
, (char_u
*)"F13"},
2160 {K_F14
, (char_u
*)"F14"},
2161 {K_F15
, (char_u
*)"F15"},
2162 {K_F16
, (char_u
*)"F16"},
2163 {K_F17
, (char_u
*)"F17"},
2164 {K_F18
, (char_u
*)"F18"},
2165 {K_F19
, (char_u
*)"F19"},
2166 {K_F20
, (char_u
*)"F20"},
2168 {K_F21
, (char_u
*)"F21"},
2169 {K_F22
, (char_u
*)"F22"},
2170 {K_F23
, (char_u
*)"F23"},
2171 {K_F24
, (char_u
*)"F24"},
2172 {K_F25
, (char_u
*)"F25"},
2173 {K_F26
, (char_u
*)"F26"},
2174 {K_F27
, (char_u
*)"F27"},
2175 {K_F28
, (char_u
*)"F28"},
2176 {K_F29
, (char_u
*)"F29"},
2177 {K_F30
, (char_u
*)"F30"},
2179 {K_F31
, (char_u
*)"F31"},
2180 {K_F32
, (char_u
*)"F32"},
2181 {K_F33
, (char_u
*)"F33"},
2182 {K_F34
, (char_u
*)"F34"},
2183 {K_F35
, (char_u
*)"F35"},
2184 {K_F36
, (char_u
*)"F36"},
2185 {K_F37
, (char_u
*)"F37"},
2187 {K_XF1
, (char_u
*)"xF1"},
2188 {K_XF2
, (char_u
*)"xF2"},
2189 {K_XF3
, (char_u
*)"xF3"},
2190 {K_XF4
, (char_u
*)"xF4"},
2192 {K_HELP
, (char_u
*)"Help"},
2193 {K_UNDO
, (char_u
*)"Undo"},
2194 {K_INS
, (char_u
*)"Insert"},
2195 {K_INS
, (char_u
*)"Ins"}, /* Alternative name */
2196 {K_KINS
, (char_u
*)"kInsert"},
2197 {K_HOME
, (char_u
*)"Home"},
2198 {K_KHOME
, (char_u
*)"kHome"},
2199 {K_XHOME
, (char_u
*)"xHome"},
2200 {K_ZHOME
, (char_u
*)"zHome"},
2201 {K_END
, (char_u
*)"End"},
2202 {K_KEND
, (char_u
*)"kEnd"},
2203 {K_XEND
, (char_u
*)"xEnd"},
2204 {K_ZEND
, (char_u
*)"zEnd"},
2205 {K_PAGEUP
, (char_u
*)"PageUp"},
2206 {K_PAGEDOWN
, (char_u
*)"PageDown"},
2207 {K_KPAGEUP
, (char_u
*)"kPageUp"},
2208 {K_KPAGEDOWN
, (char_u
*)"kPageDown"},
2210 {K_KPLUS
, (char_u
*)"kPlus"},
2211 {K_KMINUS
, (char_u
*)"kMinus"},
2212 {K_KDIVIDE
, (char_u
*)"kDivide"},
2213 {K_KMULTIPLY
, (char_u
*)"kMultiply"},
2214 {K_KENTER
, (char_u
*)"kEnter"},
2215 {K_KPOINT
, (char_u
*)"kPoint"},
2217 {K_K0
, (char_u
*)"k0"},
2218 {K_K1
, (char_u
*)"k1"},
2219 {K_K2
, (char_u
*)"k2"},
2220 {K_K3
, (char_u
*)"k3"},
2221 {K_K4
, (char_u
*)"k4"},
2222 {K_K5
, (char_u
*)"k5"},
2223 {K_K6
, (char_u
*)"k6"},
2224 {K_K7
, (char_u
*)"k7"},
2225 {K_K8
, (char_u
*)"k8"},
2226 {K_K9
, (char_u
*)"k9"},
2228 {'<', (char_u
*)"lt"},
2230 {K_MOUSE
, (char_u
*)"Mouse"},
2231 {K_NETTERM_MOUSE
, (char_u
*)"NetMouse"},
2232 {K_DEC_MOUSE
, (char_u
*)"DecMouse"},
2233 {K_JSBTERM_MOUSE
, (char_u
*)"JsbMouse"},
2234 {K_PTERM_MOUSE
, (char_u
*)"PtermMouse"},
2235 {K_LEFTMOUSE
, (char_u
*)"LeftMouse"},
2236 {K_LEFTMOUSE_NM
, (char_u
*)"LeftMouseNM"},
2237 {K_LEFTDRAG
, (char_u
*)"LeftDrag"},
2238 {K_LEFTRELEASE
, (char_u
*)"LeftRelease"},
2239 {K_LEFTRELEASE_NM
, (char_u
*)"LeftReleaseNM"},
2240 {K_MIDDLEMOUSE
, (char_u
*)"MiddleMouse"},
2241 {K_MIDDLEDRAG
, (char_u
*)"MiddleDrag"},
2242 {K_MIDDLERELEASE
, (char_u
*)"MiddleRelease"},
2243 {K_RIGHTMOUSE
, (char_u
*)"RightMouse"},
2244 {K_RIGHTDRAG
, (char_u
*)"RightDrag"},
2245 {K_RIGHTRELEASE
, (char_u
*)"RightRelease"},
2246 {K_MOUSEDOWN
, (char_u
*)"MouseDown"},
2247 {K_MOUSEUP
, (char_u
*)"MouseUp"},
2248 {K_X1MOUSE
, (char_u
*)"X1Mouse"},
2249 {K_X1DRAG
, (char_u
*)"X1Drag"},
2250 {K_X1RELEASE
, (char_u
*)"X1Release"},
2251 {K_X2MOUSE
, (char_u
*)"X2Mouse"},
2252 {K_X2DRAG
, (char_u
*)"X2Drag"},
2253 {K_X2RELEASE
, (char_u
*)"X2Release"},
2254 {K_DROP
, (char_u
*)"Drop"},
2255 {K_ZERO
, (char_u
*)"Nul"},
2257 {K_SNR
, (char_u
*)"SNR"},
2259 {K_PLUG
, (char_u
*)"Plug"},
2263 #define KEY_NAMES_TABLE_LEN (sizeof(key_names_table) / sizeof(struct key_name_entry))
2266 static struct mousetable
2268 int pseudo_code
; /* Code for pseudo mouse event */
2269 int button
; /* Which mouse button is it? */
2270 int is_click
; /* Is it a mouse button click event? */
2271 int is_drag
; /* Is it a mouse drag event? */
2274 {(int)KE_LEFTMOUSE
, MOUSE_LEFT
, TRUE
, FALSE
},
2276 {(int)KE_LEFTMOUSE_NM
, MOUSE_LEFT
, TRUE
, FALSE
},
2278 {(int)KE_LEFTDRAG
, MOUSE_LEFT
, FALSE
, TRUE
},
2279 {(int)KE_LEFTRELEASE
, MOUSE_LEFT
, FALSE
, FALSE
},
2281 {(int)KE_LEFTRELEASE_NM
, MOUSE_LEFT
, FALSE
, FALSE
},
2283 {(int)KE_MIDDLEMOUSE
, MOUSE_MIDDLE
, TRUE
, FALSE
},
2284 {(int)KE_MIDDLEDRAG
, MOUSE_MIDDLE
, FALSE
, TRUE
},
2285 {(int)KE_MIDDLERELEASE
, MOUSE_MIDDLE
, FALSE
, FALSE
},
2286 {(int)KE_RIGHTMOUSE
, MOUSE_RIGHT
, TRUE
, FALSE
},
2287 {(int)KE_RIGHTDRAG
, MOUSE_RIGHT
, FALSE
, TRUE
},
2288 {(int)KE_RIGHTRELEASE
, MOUSE_RIGHT
, FALSE
, FALSE
},
2289 {(int)KE_X1MOUSE
, MOUSE_X1
, TRUE
, FALSE
},
2290 {(int)KE_X1DRAG
, MOUSE_X1
, FALSE
, TRUE
},
2291 {(int)KE_X1RELEASE
, MOUSE_X1
, FALSE
, FALSE
},
2292 {(int)KE_X2MOUSE
, MOUSE_X2
, TRUE
, FALSE
},
2293 {(int)KE_X2DRAG
, MOUSE_X2
, FALSE
, TRUE
},
2294 {(int)KE_X2RELEASE
, MOUSE_X2
, FALSE
, FALSE
},
2295 /* DRAG without CLICK */
2296 {(int)KE_IGNORE
, MOUSE_RELEASE
, FALSE
, TRUE
},
2297 /* RELEASE without CLICK */
2298 {(int)KE_IGNORE
, MOUSE_RELEASE
, FALSE
, FALSE
},
2301 #endif /* FEAT_MOUSE */
2304 * Return the modifier mask bit (MOD_MASK_*) which corresponds to the given
2305 * modifier name ('S' for Shift, 'C' for Ctrl etc).
2314 for (i
= 0; mod_mask_table
[i
].mod_mask
!= 0; i
++)
2315 if (c
== mod_mask_table
[i
].name
)
2316 return mod_mask_table
[i
].mod_flag
;
2321 * Check if if there is a special key code for "key" that includes the
2322 * modifiers specified.
2325 simplify_key(key
, modifiers
)
2333 if (*modifiers
& (MOD_MASK_SHIFT
| MOD_MASK_CTRL
| MOD_MASK_ALT
))
2335 /* TAB is a special case */
2336 if (key
== TAB
&& (*modifiers
& MOD_MASK_SHIFT
))
2338 *modifiers
&= ~MOD_MASK_SHIFT
;
2341 key0
= KEY2TERMCAP0(key
);
2342 key1
= KEY2TERMCAP1(key
);
2343 for (i
= 0; modifier_keys_table
[i
] != NUL
; i
+= MOD_KEYS_ENTRY_SIZE
)
2344 if (key0
== modifier_keys_table
[i
+ 3]
2345 && key1
== modifier_keys_table
[i
+ 4]
2346 && (*modifiers
& modifier_keys_table
[i
]))
2348 *modifiers
&= ~modifier_keys_table
[i
];
2349 return TERMCAP2KEY(modifier_keys_table
[i
+ 1],
2350 modifier_keys_table
[i
+ 2]);
2357 * Change <xHome> to <Home>, <xUp> to <Up>, etc.
2365 case K_XUP
: return K_UP
;
2366 case K_XDOWN
: return K_DOWN
;
2367 case K_XLEFT
: return K_LEFT
;
2368 case K_XRIGHT
: return K_RIGHT
;
2369 case K_XHOME
: return K_HOME
;
2370 case K_ZHOME
: return K_HOME
;
2371 case K_XEND
: return K_END
;
2372 case K_ZEND
: return K_END
;
2373 case K_XF1
: return K_F1
;
2374 case K_XF2
: return K_F2
;
2375 case K_XF3
: return K_F3
;
2376 case K_XF4
: return K_F4
;
2377 case K_S_XF1
: return K_S_F1
;
2378 case K_S_XF2
: return K_S_F2
;
2379 case K_S_XF3
: return K_S_F3
;
2380 case K_S_XF4
: return K_S_F4
;
2386 * Return a string which contains the name of the given key when the given
2387 * modifiers are down.
2390 get_special_key_name(c
, modifiers
)
2394 static char_u string
[MAX_KEY_NAME_LEN
+ 1];
2403 /* Key that stands for a normal character. */
2404 if (IS_SPECIAL(c
) && KEY2TERMCAP0(c
) == KS_KEY
)
2405 c
= KEY2TERMCAP1(c
);
2408 * Translate shifted special keys into unshifted keys and set modifier.
2409 * Same for CTRL and ALT modifiers.
2413 for (i
= 0; modifier_keys_table
[i
] != 0; i
+= MOD_KEYS_ENTRY_SIZE
)
2414 if ( KEY2TERMCAP0(c
) == (int)modifier_keys_table
[i
+ 1]
2415 && (int)KEY2TERMCAP1(c
) == (int)modifier_keys_table
[i
+ 2])
2417 modifiers
|= modifier_keys_table
[i
];
2418 c
= TERMCAP2KEY(modifier_keys_table
[i
+ 3],
2419 modifier_keys_table
[i
+ 4]);
2424 /* try to find the key in the special key table */
2425 table_idx
= find_special_key_in_table(c
);
2428 * When not a known special key, and not a printable character, try to
2429 * extract modifiers.
2433 && (*mb_char2len
)(c
) == 1
2438 && (!vim_isprintc(c
) || (c
& 0x7f) == ' ')
2442 modifiers
|= MOD_MASK_ALT
;
2443 /* try again, to find the un-alted key in the special key table */
2444 table_idx
= find_special_key_in_table(c
);
2446 if (table_idx
< 0 && !vim_isprintc(c
) && c
< ' ')
2453 modifiers
|= MOD_MASK_CTRL
;
2457 /* translate the modifier into a string */
2458 for (i
= 0; mod_mask_table
[i
].name
!= 'A'; i
++)
2459 if ((modifiers
& mod_mask_table
[i
].mod_mask
)
2460 == mod_mask_table
[i
].mod_flag
)
2462 string
[idx
++] = mod_mask_table
[i
].name
;
2463 string
[idx
++] = (char_u
)'-';
2466 if (table_idx
< 0) /* unknown special key, may output t_xx */
2470 string
[idx
++] = 't';
2471 string
[idx
++] = '_';
2472 string
[idx
++] = KEY2TERMCAP0(c
);
2473 string
[idx
++] = KEY2TERMCAP1(c
);
2475 /* Not a special key, only modifiers, output directly */
2479 if (has_mbyte
&& (*mb_char2len
)(c
) > 1)
2480 idx
+= (*mb_char2bytes
)(c
, string
+ idx
);
2483 if (vim_isprintc(c
))
2489 string
[idx
++] = *s
++;
2493 else /* use name of special key */
2495 STRCPY(string
+ idx
, key_names_table
[table_idx
].name
);
2496 idx
= (int)STRLEN(string
);
2498 string
[idx
++] = '>';
2504 * Try translating a <> name at (*srcp)[] to dst[].
2505 * Return the number of characters added to dst[], zero for no match.
2506 * If there is a match, srcp is advanced to after the <> name.
2507 * dst[] must be big enough to hold the result (up to six characters)!
2510 trans_special(srcp
, dst
, keycode
)
2513 int keycode
; /* prefer key code, e.g. K_DEL instead of DEL */
2519 key
= find_special_key(srcp
, &modifiers
, keycode
);
2523 /* Put the appropriate modifier in a string */
2526 dst
[dlen
++] = K_SPECIAL
;
2527 dst
[dlen
++] = KS_MODIFIER
;
2528 dst
[dlen
++] = modifiers
;
2531 if (IS_SPECIAL(key
))
2533 dst
[dlen
++] = K_SPECIAL
;
2534 dst
[dlen
++] = KEY2TERMCAP0(key
);
2535 dst
[dlen
++] = KEY2TERMCAP1(key
);
2538 else if (has_mbyte
&& !keycode
)
2539 dlen
+= (*mb_char2bytes
)(key
, dst
+ dlen
);
2542 dlen
= (int)(add_char2buf(key
, dst
+ dlen
) - dst
);
2550 * Try translating a <> name at (*srcp)[], return the key and modifiers.
2551 * srcp is advanced to after the <> name.
2552 * returns 0 if there is no match.
2555 find_special_key(srcp
, modp
, keycode
)
2558 int keycode
; /* prefer key code, e.g. K_DEL instead of DEL */
2561 char_u
*end_of_name
;
2573 /* Find end of modifier list */
2575 for (bp
= src
+ 1; *bp
== '-' || vim_isIDc(*bp
); bp
++)
2580 if (bp
[1] != NUL
&& bp
[2] == '>')
2581 ++bp
; /* anything accepted, like <C-?> */
2583 if (bp
[0] == 't' && bp
[1] == '_' && bp
[2] && bp
[3])
2584 bp
+= 3; /* skip t_xx, xx may be '-' or '>' */
2587 if (*bp
== '>') /* found matching '>' */
2589 end_of_name
= bp
+ 1;
2591 if (STRNICMP(src
+ 1, "char-", 5) == 0 && VIM_ISDIGIT(src
[6]))
2593 /* <Char-123> or <Char-033> or <Char-0x33> */
2594 vim_str2nr(src
+ 6, NULL
, NULL
, TRUE
, TRUE
, NULL
, &n
);
2596 *srcp
= end_of_name
;
2600 /* Which modifiers are given? */
2602 for (bp
= src
+ 1; bp
< last_dash
; bp
++)
2606 bit
= name_to_mod_mask(*bp
);
2608 break; /* Illegal modifier name */
2614 * Legal modifier name.
2616 if (bp
>= last_dash
)
2619 * Modifier with single letter, or special key name.
2621 if (modifiers
!= 0 && last_dash
[2] == '>')
2625 key
= get_special_key_code(last_dash
+ 1);
2626 key
= handle_x_keys(key
);
2630 * get_special_key_code() may return NUL for invalid
2636 * Only use a modifier when there is no special key code that
2637 * includes the modifier.
2639 key
= simplify_key(key
, &modifiers
);
2643 /* don't want keycode, use single byte code */
2646 else if (key
== K_DEL
|| key
== K_KDEL
)
2651 * Normal Key with modifier: Try to make a single byte code.
2653 if (!IS_SPECIAL(key
))
2654 key
= extract_modifiers(key
, &modifiers
);
2657 *srcp
= end_of_name
;
2666 * Try to include modifiers in the key.
2667 * Changes "Shift-a" to 'A', "Alt-A" to 0xc0, etc.
2670 extract_modifiers(key
, modp
)
2674 int modifiers
= *modp
;
2677 /* Command-key really special, No fancynest */
2678 if (!(modifiers
& MOD_MASK_CMD
))
2680 if ((modifiers
& MOD_MASK_SHIFT
) && ASCII_ISALPHA(key
))
2682 key
= TOUPPER_ASC(key
);
2683 modifiers
&= ~MOD_MASK_SHIFT
;
2685 if ((modifiers
& MOD_MASK_CTRL
)
2687 /* * TODO: EBCDIC Better use:
2688 * && (Ctrl_chr(key) || key == '?')
2690 && strchr("?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_", key
)
2693 && ((key
>= '?' && key
<= '_') || ASCII_ISALPHA(key
))
2697 key
= Ctrl_chr(key
);
2698 modifiers
&= ~MOD_MASK_CTRL
;
2699 /* <C-@> is <Nul> */
2704 /* Command-key really special, No fancynest */
2705 if (!(modifiers
& MOD_MASK_CMD
))
2707 if ((modifiers
& MOD_MASK_ALT
) && key
< 0x80
2709 && !enc_dbcs
/* avoid creating a lead byte */
2714 modifiers
&= ~MOD_MASK_ALT
; /* remove the META modifier */
2722 * Try to find key "c" in the special key table.
2723 * Return the index when found, -1 when not found.
2726 find_special_key_in_table(c
)
2731 for (i
= 0; key_names_table
[i
].name
!= NULL
; i
++)
2732 if (c
== key_names_table
[i
].key
)
2734 if (key_names_table
[i
].name
== NULL
)
2740 * Find the special key with the given name (the given string does not have to
2741 * end with NUL, the name is assumed to end before the first non-idchar).
2742 * If the name starts with "t_" the next two characters are interpreted as a
2744 * Return the key code, or 0 if not found.
2747 get_special_key_code(name
)
2755 * If it's <t_xx> we get the code for xx from the termcap
2757 if (name
[0] == 't' && name
[1] == '_' && name
[2] != NUL
&& name
[3] != NUL
)
2759 string
[0] = name
[2];
2760 string
[1] = name
[3];
2762 if (add_termcap_entry(string
, FALSE
) == OK
)
2763 return TERMCAP2KEY(name
[2], name
[3]);
2766 for (i
= 0; key_names_table
[i
].name
!= NULL
; i
++)
2768 table_name
= key_names_table
[i
].name
;
2769 for (j
= 0; vim_isIDc(name
[j
]) && table_name
[j
] != NUL
; j
++)
2770 if (TOLOWER_ASC(table_name
[j
]) != TOLOWER_ASC(name
[j
]))
2772 if (!vim_isIDc(name
[j
]) && table_name
[j
] == NUL
)
2773 return key_names_table
[i
].key
;
2778 #ifdef FEAT_CMDL_COMPL
2783 if (i
>= KEY_NAMES_TABLE_LEN
)
2785 return key_names_table
[i
].name
;
2791 * Look up the given mouse code to return the relevant information in the other
2792 * arguments. Return which button is down or was released.
2795 get_mouse_button(code
, is_click
, is_drag
)
2802 for (i
= 0; mouse_table
[i
].pseudo_code
; i
++)
2803 if (code
== mouse_table
[i
].pseudo_code
)
2805 *is_click
= mouse_table
[i
].is_click
;
2806 *is_drag
= mouse_table
[i
].is_drag
;
2807 return mouse_table
[i
].button
;
2809 return 0; /* Shouldn't get here */
2813 * Return the appropriate pseudo mouse event token (KE_LEFTMOUSE etc) based on
2814 * the given information about which mouse button is down, and whether the
2815 * mouse was clicked, dragged or released.
2818 get_pseudo_mouse_code(button
, is_click
, is_drag
)
2819 int button
; /* eg MOUSE_LEFT */
2825 for (i
= 0; mouse_table
[i
].pseudo_code
; i
++)
2826 if (button
== mouse_table
[i
].button
2827 && is_click
== mouse_table
[i
].is_click
2828 && is_drag
== mouse_table
[i
].is_drag
)
2831 /* Trick: a non mappable left click and release has mouse_col -1
2832 * or added MOUSE_COLOFF. Used for 'mousefocus' in
2833 * gui_mouse_moved() */
2834 if (mouse_col
< 0 || mouse_col
> MOUSE_COLOFF
)
2839 mouse_col
-= MOUSE_COLOFF
;
2840 if (mouse_table
[i
].pseudo_code
== (int)KE_LEFTMOUSE
)
2841 return (int)KE_LEFTMOUSE_NM
;
2842 if (mouse_table
[i
].pseudo_code
== (int)KE_LEFTRELEASE
)
2843 return (int)KE_LEFTRELEASE_NM
;
2846 return mouse_table
[i
].pseudo_code
;
2848 return (int)KE_IGNORE
; /* not recognized, ignore it */
2850 #endif /* FEAT_MOUSE */
2853 * Return the current end-of-line type: EOL_DOS, EOL_UNIX or EOL_MAC.
2859 int c
= *buf
->b_p_ff
;
2861 if (buf
->b_p_bin
|| c
== 'u')
2869 * Like get_fileformat(), but override 'fileformat' with "p" for "++opt=val"
2873 get_fileformat_force(buf
, eap
)
2875 exarg_T
*eap
; /* can be NULL! */
2879 if (eap
!= NULL
&& eap
->force_ff
!= 0)
2880 c
= eap
->cmd
[eap
->force_ff
];
2883 if ((eap
!= NULL
&& eap
->force_bin
!= 0)
2884 ? (eap
->force_bin
== FORCE_BIN
) : buf
->b_p_bin
)
2896 * Set the current end-of-line type to EOL_DOS, EOL_UNIX or EOL_MAC.
2897 * Sets both 'textmode' and 'fileformat'.
2898 * Note: Does _not_ set global value of 'textmode'!
2901 set_fileformat(t
, opt_flags
)
2903 int opt_flags
; /* OPT_LOCAL and/or OPT_GLOBAL */
2911 curbuf
->b_p_tx
= TRUE
;
2915 curbuf
->b_p_tx
= FALSE
;
2919 curbuf
->b_p_tx
= FALSE
;
2923 set_string_option_direct((char_u
*)"ff", -1, (char_u
*)p
,
2924 OPT_FREE
| opt_flags
, 0);
2927 /* This may cause the buffer to become (un)modified. */
2928 check_status(curbuf
);
2929 redraw_tabline
= TRUE
;
2932 need_maketitle
= TRUE
; /* set window title later */
2937 * Return the default fileformat from 'fileformats'.
2940 default_fileformat()
2944 case 'm': return EOL_MAC
;
2945 case 'd': return EOL_DOS
;
2951 * Call shell. Calls mch_call_shell, with 'shellxquote' added.
2954 call_shell(cmd
, opt
)
2961 proftime_T wait_time
;
2967 smsg((char_u
*)_("Calling shell to execute: \"%s\""),
2968 cmd
== NULL
? p_sh
: cmd
);
2975 if (do_profiling
== PROF_YES
)
2976 prof_child_enter(&wait_time
);
2981 EMSG(_(e_shellempty
));
2986 #ifdef FEAT_GUI_MSWIN
2987 /* Don't hide the pointer while executing a shell command. */
2988 gui_mch_mousehide(FALSE
);
2993 /* The external command may update a tags file, clear cached tags. */
2996 if (cmd
== NULL
|| *p_sxq
== NUL
)
2997 retval
= mch_call_shell(cmd
, opt
);
3000 ncmd
= alloc((unsigned)(STRLEN(cmd
) + STRLEN(p_sxq
) * 2 + 1));
3003 STRCPY(ncmd
, p_sxq
);
3005 STRCAT(ncmd
, p_sxq
);
3006 retval
= mch_call_shell(ncmd
, opt
);
3016 * Check the window size, in case it changed while executing the
3019 shell_resized_check();
3023 set_vim_var_nr(VV_SHELL_ERROR
, (long)retval
);
3024 # ifdef FEAT_PROFILE
3025 if (do_profiling
== PROF_YES
)
3026 prof_child_exit(&wait_time
);
3034 * VISUAL, SELECTMODE and OP_PENDING State are never set, they are equal to
3035 * NORMAL State with a condition. This function returns the real State.
3057 #if defined(FEAT_MBYTE) || defined(PROTO)
3059 * Return TRUE if "p" points to just after a path separator.
3060 * Take care of multi-byte characters.
3061 * "b" must point to the start of the file name
3068 return vim_ispathsep(p
[-1])
3069 && (!has_mbyte
|| (*mb_head_off
)(b
, p
- 1) == 0);
3074 * Return TRUE if file names "f1" and "f2" are in the same directory.
3075 * "f1" may be a short name, "f2" must be a full path.
3078 same_directory(f1
, f2
)
3082 char_u ffname
[MAXPATHL
];
3087 if (f1
== NULL
|| f2
== NULL
)
3090 (void)vim_FullName(f1
, ffname
, MAXPATHL
, FALSE
);
3091 t1
= gettail_sep(ffname
);
3092 t2
= gettail_sep(f2
);
3093 return (t1
- ffname
== t2
- f2
3094 && pathcmp((char *)ffname
, (char *)f2
, (int)(t1
- ffname
)) == 0);
3097 #if defined(FEAT_SESSION) || defined(MSWIN) || defined(FEAT_GUI_MAC) \
3098 || ((defined(FEAT_GUI_GTK)) \
3099 && ( defined(FEAT_WINDOWS) || defined(FEAT_DND)) ) \
3100 || defined(FEAT_SUN_WORKSHOP) || defined(FEAT_NETBEANS_INTG) \
3103 * Change to a file's directory.
3104 * Caller must call shorten_fnames()!
3105 * Return OK or FAIL.
3108 vim_chdirfile(fname
)
3111 char_u dir
[MAXPATHL
];
3113 vim_strncpy(dir
, fname
, MAXPATHL
- 1);
3114 *gettail_sep(dir
) = NUL
;
3115 return mch_chdir((char *)dir
) == 0 ? OK
: FAIL
;
3119 #if defined(STAT_IGNORES_SLASH) || defined(PROTO)
3121 * Check if "name" ends in a slash and is not a directory.
3122 * Used for systems where stat() ignores a trailing slash on a file name.
3123 * The Vim code assumes a trailing slash is only ignored for a directory.
3130 return FALSE
; /* no file name is not illegal */
3131 if (name
[strlen(name
) - 1] != '/')
3132 return FALSE
; /* no trailing slash */
3133 if (mch_isdir((char_u
*)name
))
3134 return FALSE
; /* trailing slash for a directory */
3139 #if defined(CURSOR_SHAPE) || defined(PROTO)
3142 * Handling of cursor and mouse pointer shapes in various modes.
3145 cursorentry_T shape_table
[SHAPE_IDX_COUNT
] =
3147 /* The values will be filled in from the 'guicursor' and 'mouseshape'
3148 * defaults when Vim starts.
3149 * Adjust the SHAPE_IDX_ defines when making changes! */
3150 {0, 0, 0, 700L, 400L, 250L, 0, 0, "n", SHAPE_CURSOR
+SHAPE_MOUSE
},
3151 {0, 0, 0, 700L, 400L, 250L, 0, 0, "v", SHAPE_CURSOR
+SHAPE_MOUSE
},
3152 {0, 0, 0, 700L, 400L, 250L, 0, 0, "i", SHAPE_CURSOR
+SHAPE_MOUSE
},
3153 {0, 0, 0, 700L, 400L, 250L, 0, 0, "r", SHAPE_CURSOR
+SHAPE_MOUSE
},
3154 {0, 0, 0, 700L, 400L, 250L, 0, 0, "c", SHAPE_CURSOR
+SHAPE_MOUSE
},
3155 {0, 0, 0, 700L, 400L, 250L, 0, 0, "ci", SHAPE_CURSOR
+SHAPE_MOUSE
},
3156 {0, 0, 0, 700L, 400L, 250L, 0, 0, "cr", SHAPE_CURSOR
+SHAPE_MOUSE
},
3157 {0, 0, 0, 700L, 400L, 250L, 0, 0, "o", SHAPE_CURSOR
+SHAPE_MOUSE
},
3158 {0, 0, 0, 700L, 400L, 250L, 0, 0, "ve", SHAPE_CURSOR
+SHAPE_MOUSE
},
3159 {0, 0, 0, 0L, 0L, 0L, 0, 0, "e", SHAPE_MOUSE
},
3160 {0, 0, 0, 0L, 0L, 0L, 0, 0, "s", SHAPE_MOUSE
},
3161 {0, 0, 0, 0L, 0L, 0L, 0, 0, "sd", SHAPE_MOUSE
},
3162 {0, 0, 0, 0L, 0L, 0L, 0, 0, "vs", SHAPE_MOUSE
},
3163 {0, 0, 0, 0L, 0L, 0L, 0, 0, "vd", SHAPE_MOUSE
},
3164 {0, 0, 0, 0L, 0L, 0L, 0, 0, "m", SHAPE_MOUSE
},
3165 {0, 0, 0, 0L, 0L, 0L, 0, 0, "ml", SHAPE_MOUSE
},
3166 {0, 0, 0, 100L, 100L, 100L, 0, 0, "sm", SHAPE_CURSOR
},
3169 #ifdef FEAT_MOUSESHAPE
3171 * Table with names for mouse shapes. Keep in sync with all the tables for
3172 * mch_set_mouse_shape()!.
3174 static char * mshape_names
[] =
3176 "arrow", /* default, must be the first one */
3177 "blank", /* hidden */
3197 * Parse the 'guicursor' option ("what" is SHAPE_CURSOR) or 'mouseshape'
3198 * ("what" is SHAPE_MOUSE).
3199 * Returns error message for an illegal option, NULL otherwise.
3202 parse_shape_opt(what
)
3210 int idx
= 0; /* init for GCC */
3215 int found_ve
= FALSE
; /* found "ve" flag */
3219 * First round: check for errors; second round: do it for real.
3221 for (round
= 1; round
<= 2; ++round
)
3224 * Repeat for all comma separated parts.
3226 #ifdef FEAT_MOUSESHAPE
3227 if (what
== SHAPE_MOUSE
)
3228 modep
= p_mouseshape
;
3231 modep
= p_guicursor
;
3232 while (*modep
!= NUL
)
3234 colonp
= vim_strchr(modep
, ':');
3236 return (char_u
*)N_("E545: Missing colon");
3237 if (colonp
== modep
)
3238 return (char_u
*)N_("E546: Illegal mode");
3239 commap
= vim_strchr(modep
, ',');
3242 * Repeat for all mode's before the colon.
3243 * For the 'a' mode, we loop to handle all the modes.
3246 while (modep
< colonp
|| all_idx
>= 0)
3250 /* Find the mode. */
3251 if (modep
[1] == '-' || modep
[1] == ':')
3255 if (len
== 1 && TOLOWER_ASC(modep
[0]) == 'a')
3256 all_idx
= SHAPE_IDX_COUNT
- 1;
3259 for (idx
= 0; idx
< SHAPE_IDX_COUNT
; ++idx
)
3260 if (STRNICMP(modep
, shape_table
[idx
].name
, len
)
3263 if (idx
== SHAPE_IDX_COUNT
3264 || (shape_table
[idx
].used_for
& what
) == 0)
3265 return (char_u
*)N_("E546: Illegal mode");
3266 if (len
== 2 && modep
[0] == 'v' && modep
[1] == 'e')
3274 else if (round
== 2)
3276 #ifdef FEAT_MOUSESHAPE
3277 if (what
== SHAPE_MOUSE
)
3279 /* Set the default, for the missing parts */
3280 shape_table
[idx
].mshape
= 0;
3285 /* Set the defaults, for the missing parts */
3286 shape_table
[idx
].shape
= SHAPE_BLOCK
;
3287 shape_table
[idx
].blinkwait
= 700L;
3288 shape_table
[idx
].blinkon
= 400L;
3289 shape_table
[idx
].blinkoff
= 250L;
3293 /* Parse the part after the colon */
3294 for (p
= colonp
+ 1; *p
&& *p
!= ','; )
3296 #ifdef FEAT_MOUSESHAPE
3297 if (what
== SHAPE_MOUSE
)
3301 if (mshape_names
[i
] == NULL
)
3303 if (!VIM_ISDIGIT(*p
))
3304 return (char_u
*)N_("E547: Illegal mouseshape");
3306 shape_table
[idx
].mshape
=
3307 getdigits(&p
) + MSHAPE_NUMBERED
;
3309 (void)getdigits(&p
);
3312 len
= (int)STRLEN(mshape_names
[i
]);
3313 if (STRNICMP(p
, mshape_names
[i
], len
) == 0)
3316 shape_table
[idx
].mshape
= i
;
3322 else /* if (what == SHAPE_MOUSE) */
3326 * First handle the ones with a number argument.
3330 if (STRNICMP(p
, "ver", 3) == 0)
3332 else if (STRNICMP(p
, "hor", 3) == 0)
3334 else if (STRNICMP(p
, "blinkwait", 9) == 0)
3336 else if (STRNICMP(p
, "blinkon", 7) == 0)
3338 else if (STRNICMP(p
, "blinkoff", 8) == 0)
3343 if (!VIM_ISDIGIT(*p
))
3344 return (char_u
*)N_("E548: digit expected");
3346 if (len
== 3) /* "ver" or "hor" */
3349 return (char_u
*)N_("E549: Illegal percentage");
3352 if (TOLOWER_ASC(i
) == 'v')
3353 shape_table
[idx
].shape
= SHAPE_VER
;
3355 shape_table
[idx
].shape
= SHAPE_HOR
;
3356 shape_table
[idx
].percentage
= n
;
3359 else if (round
== 2)
3362 shape_table
[idx
].blinkwait
= n
;
3364 shape_table
[idx
].blinkon
= n
;
3366 shape_table
[idx
].blinkoff
= n
;
3369 else if (STRNICMP(p
, "block", 5) == 0)
3372 shape_table
[idx
].shape
= SHAPE_BLOCK
;
3375 else /* must be a highlight group name then */
3377 endp
= vim_strchr(p
, '-');
3378 if (commap
== NULL
) /* last part */
3381 endp
= p
+ STRLEN(p
); /* find end of part */
3383 else if (endp
> commap
|| endp
== NULL
)
3385 slashp
= vim_strchr(p
, '/');
3386 if (slashp
!= NULL
&& slashp
< endp
)
3388 /* "group/langmap_group" */
3389 i
= syn_check_group(p
, (int)(slashp
- p
));
3394 shape_table
[idx
].id
= syn_check_group(p
,
3396 shape_table
[idx
].id_lm
= shape_table
[idx
].id
;
3397 if (slashp
!= NULL
&& slashp
< endp
)
3398 shape_table
[idx
].id
= i
;
3402 } /* if (what != SHAPE_MOUSE) */
3414 /* If the 's' flag is not given, use the 'v' cursor for 's' */
3417 #ifdef FEAT_MOUSESHAPE
3418 if (what
== SHAPE_MOUSE
)
3420 shape_table
[SHAPE_IDX_VE
].mshape
= shape_table
[SHAPE_IDX_V
].mshape
;
3425 shape_table
[SHAPE_IDX_VE
].shape
= shape_table
[SHAPE_IDX_V
].shape
;
3426 shape_table
[SHAPE_IDX_VE
].percentage
=
3427 shape_table
[SHAPE_IDX_V
].percentage
;
3428 shape_table
[SHAPE_IDX_VE
].blinkwait
=
3429 shape_table
[SHAPE_IDX_V
].blinkwait
;
3430 shape_table
[SHAPE_IDX_VE
].blinkon
=
3431 shape_table
[SHAPE_IDX_V
].blinkon
;
3432 shape_table
[SHAPE_IDX_VE
].blinkoff
=
3433 shape_table
[SHAPE_IDX_V
].blinkoff
;
3434 shape_table
[SHAPE_IDX_VE
].id
= shape_table
[SHAPE_IDX_V
].id
;
3435 shape_table
[SHAPE_IDX_VE
].id_lm
= shape_table
[SHAPE_IDX_V
].id_lm
;
3442 # if defined(MCH_CURSOR_SHAPE) || defined(FEAT_GUI) \
3443 || defined(FEAT_MOUSESHAPE) || defined(PROTO)
3445 * Return the index into shape_table[] for the current mode.
3446 * When "mouse" is TRUE, consider indexes valid for the mouse pointer.
3449 get_shape_idx(mouse
)
3452 #ifdef FEAT_MOUSESHAPE
3453 if (mouse
&& (State
== HITRETURN
|| State
== ASKMORE
))
3457 gui_mch_getmouse(&x
, &y
);
3458 if (Y_2_ROW(y
) == Rows
- 1)
3459 return SHAPE_IDX_MOREL
;
3461 return SHAPE_IDX_MORE
;
3463 if (mouse
&& drag_status_line
)
3464 return SHAPE_IDX_SDRAG
;
3465 # ifdef FEAT_VERTSPLIT
3466 if (mouse
&& drag_sep_line
)
3467 return SHAPE_IDX_VDRAG
;
3470 if (!mouse
&& State
== SHOWMATCH
)
3471 return SHAPE_IDX_SM
;
3472 #ifdef FEAT_VREPLACE
3473 if (State
& VREPLACE_FLAG
)
3476 if (State
& REPLACE_FLAG
)
3480 if (State
& CMDLINE
)
3482 if (cmdline_at_end())
3484 if (cmdline_overstrike())
3485 return SHAPE_IDX_CR
;
3486 return SHAPE_IDX_CI
;
3494 return SHAPE_IDX_VE
;
3503 # if defined(FEAT_MOUSESHAPE) || defined(PROTO)
3504 static int old_mouse_shape
= 0;
3507 * Set the mouse shape:
3508 * If "shape" is -1, use shape depending on the current mode,
3509 * depending on the current state.
3510 * If "shape" is -2, only update the shape when it's CLINE or STATUS (used
3511 * when the mouse moves off the status or command line).
3514 update_mouseshape(shape_idx
)
3517 int new_mouse_shape
;
3519 /* Only works in GUI mode. */
3520 if (!gui
.in_use
|| gui
.starting
)
3523 /* Postpone the updating when more is to come. Speeds up executing of
3525 if (shape_idx
== -1 && char_avail())
3527 postponed_mouseshape
= TRUE
;
3531 /* When ignoring the mouse don't change shape on the statusline. */
3533 && (shape_idx
== SHAPE_IDX_CLINE
3534 || shape_idx
== SHAPE_IDX_STATUS
3535 || shape_idx
== SHAPE_IDX_VSEP
))
3539 && old_mouse_shape
!= shape_table
[SHAPE_IDX_CLINE
].mshape
3540 && old_mouse_shape
!= shape_table
[SHAPE_IDX_STATUS
].mshape
3541 && old_mouse_shape
!= shape_table
[SHAPE_IDX_VSEP
].mshape
)
3544 new_mouse_shape
= shape_table
[get_shape_idx(TRUE
)].mshape
;
3546 new_mouse_shape
= shape_table
[shape_idx
].mshape
;
3547 if (new_mouse_shape
!= old_mouse_shape
)
3549 mch_set_mouse_shape(new_mouse_shape
);
3550 old_mouse_shape
= new_mouse_shape
;
3552 postponed_mouseshape
= FALSE
;
3556 #endif /* CURSOR_SHAPE */
3561 * Optional encryption support.
3562 * Mohsin Ahmed, mosh@sasi.com, 98-09-24
3563 * Based on zip/crypt sources.
3565 * NOTE FOR USA: Since 2000 exporting this code from the USA is allowed to
3566 * most countries. There are a few exceptions, but that still should not be a
3567 * problem since this code was originally created in Europe and India.
3572 typedef unsigned short ush
; /* unsigned 16-bit value */
3573 typedef unsigned long ulg
; /* unsigned 32-bit value */
3575 static void make_crc_tab
__ARGS((void));
3577 static ulg crc_32_tab
[256];
3580 * Fill the CRC table.
3586 static int done
= FALSE
;
3590 for (t
= 0; t
< 256; t
++)
3593 for (s
= 0; s
< 8; s
++)
3594 v
= (v
>> 1) ^ ((v
& 1) * (ulg
)0xedb88320L
);
3600 #define CRC32(c, b) (crc_32_tab[((int)(c) ^ (b)) & 0xff] ^ ((c) >> 8))
3603 static ulg keys
[3]; /* keys defining the pseudo-random sequence */
3606 * Return the next byte in the pseudo-random sequence
3613 temp
= (ush
)keys
[2] | 2;
3614 return (int)(((unsigned)(temp
* (temp
^ 1)) >> 8) & 0xff);
3618 * Update the encryption keys with the next byte of plain text
3622 int c
; /* byte of plain text */
3624 keys
[0] = CRC32(keys
[0], c
);
3625 keys
[1] += keys
[0] & 0xff;
3626 keys
[1] = keys
[1] * 134775813L + 1;
3627 keys
[2] = CRC32(keys
[2], (int)(keys
[1] >> 24));
3632 * Initialize the encryption keys and the random header according to
3633 * the given password.
3634 * If "passwd" is NULL or empty, don't do anything.
3637 crypt_init_keys(passwd
)
3638 char_u
*passwd
; /* password string with which to modify keys */
3640 if (passwd
!= NULL
&& *passwd
!= NUL
)
3643 keys
[0] = 305419896L;
3644 keys
[1] = 591751049L;
3645 keys
[2] = 878082192L;
3646 while (*passwd
!= '\0')
3647 update_keys((int)*passwd
++);
3652 * Ask the user for a crypt key.
3653 * When "store" is TRUE, the new key in stored in the 'key' option, and the
3654 * 'key' option value is returned: Don't free it.
3655 * When "store" is FALSE, the typed key is returned in allocated memory.
3656 * Returns NULL on failure.
3659 get_crypt_key(store
, twice
)
3661 int twice
; /* Ask for the key twice. */
3663 char_u
*p1
, *p2
= NULL
;
3666 for (round
= 0; ; ++round
)
3668 cmdline_star
= TRUE
;
3669 cmdline_row
= msg_row
;
3670 p1
= getcmdline_prompt(NUL
, round
== 0
3671 ? (char_u
*)_("Enter encryption key: ")
3672 : (char_u
*)_("Enter same key again: "), 0, EXPAND_NOTHING
,
3674 cmdline_star
= FALSE
;
3681 if (p2
!= NULL
&& STRCMP(p1
, p2
) != 0)
3683 MSG(_("Keys don't match!"));
3687 round
= -1; /* do it again */
3692 set_option_value((char_u
*)"key", 0L, p1
, OPT_LOCAL
);
3694 p1
= curbuf
->b_p_key
;
3701 /* since the user typed this, no need to wait for return */
3702 need_wait_return
= FALSE
;
3709 #endif /* FEAT_CRYPT */
3711 /* TODO: make some #ifdef for this */
3712 /*--------[ file searching ]-------------------------------------------------*/
3714 * File searching functions for 'path', 'tags' and 'cdpath' options.
3715 * External visible functions:
3716 * vim_findfile_init() creates/initialises the search context
3717 * vim_findfile_free_visited() free list of visited files/dirs of search
3719 * vim_findfile() find a file in the search context
3720 * vim_findfile_cleanup() cleanup/free search context created by
3721 * vim_findfile_init()
3723 * All static functions and variables start with 'ff_'
3725 * In general it works like this:
3726 * First you create yourself a search context by calling vim_findfile_init().
3727 * It is possible to give a search context from a previous call to
3728 * vim_findfile_init(), so it can be reused. After this you call vim_findfile()
3729 * until you are satisfied with the result or it returns NULL. On every call it
3730 * returns the next file which matches the conditions given to
3731 * vim_findfile_init(). If it doesn't find a next file it returns NULL.
3733 * It is possible to call vim_findfile_init() again to reinitialise your search
3734 * with some new parameters. Don't forget to pass your old search context to
3735 * it, so it can reuse it and especially reuse the list of already visited
3736 * directories. If you want to delete the list of already visited directories
3737 * simply call vim_findfile_free_visited().
3739 * When you are done call vim_findfile_cleanup() to free the search context.
3741 * The function vim_findfile_init() has a long comment, which describes the
3742 * needed parameters.
3748 * Also we use an allocated search context here, this functions are NOT
3751 * To minimize parameter passing (or because I'm to lazy), only the
3752 * external visible functions get a search context as a parameter. This is
3753 * then assigned to a static global, which is used throughout the local
3758 * type for the directory search stack
3760 typedef struct ff_stack
3762 struct ff_stack
*ffs_prev
;
3764 /* the fix part (no wildcards) and the part containing the wildcards
3765 * of the search path
3767 char_u
*ffs_fix_path
;
3768 #ifdef FEAT_PATH_EXTRA
3769 char_u
*ffs_wc_path
;
3772 /* files/dirs found in the above directory, matched by the first wildcard
3775 char_u
**ffs_filearray
;
3776 int ffs_filearray_size
;
3777 char_u ffs_filearray_cur
; /* needed for partly handled dirs */
3779 /* to store status of partly handled directories
3780 * 0: we work on this directory for the first time
3781 * 1: this directory was partly searched in an earlier step
3785 /* How deep are we in the directory tree?
3786 * Counts backward from value of level parameter to vim_findfile_init
3790 /* Did we already expand '**' to an empty string? */
3791 int ffs_star_star_empty
;
3795 * type for already visited directories or files.
3797 typedef struct ff_visited
3799 struct ff_visited
*ffv_next
;
3801 #ifdef FEAT_PATH_EXTRA
3802 /* Visited directories are different if the wildcard string are
3803 * different. So we have to save it.
3805 char_u
*ffv_wc_path
;
3807 /* for unix use inode etc for comparison (needed because of links), else
3811 int ffv_dev
; /* device number (-1 if not set) */
3812 ino_t ffv_ino
; /* inode number */
3814 /* The memory for this struct is allocated according to the length of
3817 char_u ffv_fname
[1]; /* actually longer */
3821 * We might have to manage several visited lists during a search.
3822 * This is especially needed for the tags option. If tags is set to:
3823 * "./++/tags,./++/TAGS,++/tags" (replace + with *)
3824 * So we have to do 3 searches:
3825 * 1) search from the current files directory downward for the file "tags"
3826 * 2) search from the current files directory downward for the file "TAGS"
3827 * 3) search from Vims current directory downwards for the file "tags"
3828 * As you can see, the first and the third search are for the same file, so for
3829 * the third search we can use the visited list of the first search. For the
3830 * second search we must start from a empty visited list.
3831 * The struct ff_visited_list_hdr is used to manage a linked list of already
3834 typedef struct ff_visited_list_hdr
3836 struct ff_visited_list_hdr
*ffvl_next
;
3838 /* the filename the attached visited list is for */
3839 char_u
*ffvl_filename
;
3841 ff_visited_T
*ffvl_visited_list
;
3843 } ff_visited_list_hdr_T
;
3847 * '**' can be expanded to several directory levels.
3848 * Set the default maximum depth.
3850 #define FF_MAX_STAR_STAR_EXPAND ((char_u)30)
3853 * The search context:
3854 * ffsc_stack_ptr: the stack for the dirs to search
3855 * ffsc_visited_list: the currently active visited list
3856 * ffsc_dir_visited_list: the currently active visited list for search dirs
3857 * ffsc_visited_lists_list: the list of all visited lists
3858 * ffsc_dir_visited_lists_list: the list of all visited lists for search dirs
3859 * ffsc_file_to_search: the file to search for
3860 * ffsc_start_dir: the starting directory, if search path was relative
3861 * ffsc_fix_path: the fix part of the given path (without wildcards)
3862 * Needed for upward search.
3863 * ffsc_wc_path: the part of the given path containing wildcards
3864 * ffsc_level: how many levels of dirs to search downwards
3865 * ffsc_stopdirs_v: array of stop directories for upward search
3866 * ffsc_find_what: FINDFILE_BOTH, FINDFILE_DIR or FINDFILE_FILE
3868 typedef struct ff_search_ctx_T
3870 ff_stack_T
*ffsc_stack_ptr
;
3871 ff_visited_list_hdr_T
*ffsc_visited_list
;
3872 ff_visited_list_hdr_T
*ffsc_dir_visited_list
;
3873 ff_visited_list_hdr_T
*ffsc_visited_lists_list
;
3874 ff_visited_list_hdr_T
*ffsc_dir_visited_lists_list
;
3875 char_u
*ffsc_file_to_search
;
3876 char_u
*ffsc_start_dir
;
3877 char_u
*ffsc_fix_path
;
3878 #ifdef FEAT_PATH_EXTRA
3879 char_u
*ffsc_wc_path
;
3881 char_u
**ffsc_stopdirs_v
;
3886 /* locally needed functions */
3887 #ifdef FEAT_PATH_EXTRA
3888 static int ff_check_visited
__ARGS((ff_visited_T
**, char_u
*, char_u
*));
3890 static int ff_check_visited
__ARGS((ff_visited_T
**, char_u
*));
3892 static void vim_findfile_free_visited_list
__ARGS((ff_visited_list_hdr_T
**list_headp
));
3893 static void ff_free_visited_list
__ARGS((ff_visited_T
*vl
));
3894 static ff_visited_list_hdr_T
* ff_get_visited_list
__ARGS((char_u
*, ff_visited_list_hdr_T
**list_headp
));
3895 #ifdef FEAT_PATH_EXTRA
3896 static int ff_wc_equal
__ARGS((char_u
*s1
, char_u
*s2
));
3899 static void ff_push
__ARGS((ff_search_ctx_T
*search_ctx
, ff_stack_T
*stack_ptr
));
3900 static ff_stack_T
*ff_pop
__ARGS((ff_search_ctx_T
*search_ctx
));
3901 static void ff_clear
__ARGS((ff_search_ctx_T
*search_ctx
));
3902 static void ff_free_stack_element
__ARGS((ff_stack_T
*stack_ptr
));
3903 #ifdef FEAT_PATH_EXTRA
3904 static ff_stack_T
*ff_create_stack_element
__ARGS((char_u
*, char_u
*, int, int));
3906 static ff_stack_T
*ff_create_stack_element
__ARGS((char_u
*, int, int));
3908 #ifdef FEAT_PATH_EXTRA
3909 static int ff_path_in_stoplist
__ARGS((char_u
*, int, char_u
**));
3914 * if someone likes findfirst/findnext, here are the functions
3918 static void *ff_fn_search_context
= NULL
;
3921 vim_findfirst(path
, filename
, level
)
3926 ff_fn_search_context
=
3927 vim_findfile_init(path
, filename
, NULL
, level
, TRUE
, FALSE
,
3928 ff_fn_search_context
, rel_fname
);
3929 if (NULL
== ff_fn_search_context
)
3932 return vim_findnext()
3938 char_u
*ret
= vim_findfile(ff_fn_search_context
);
3942 vim_findfile_cleanup(ff_fn_search_context
);
3943 ff_fn_search_context
= NULL
;
3950 * Initialization routine for vim_findfile.
3952 * Returns the newly allocated search context or NULL if an error occured.
3954 * Don't forget to clean up by calling vim_findfile_cleanup() if you are done
3955 * with the search context.
3957 * Find the file 'filename' in the directory 'path'.
3958 * The parameter 'path' may contain wildcards. If so only search 'level'
3959 * directories deep. The parameter 'level' is the absolute maximum and is
3960 * not related to restricts given to the '**' wildcard. If 'level' is 100
3961 * and you use '**200' vim_findfile() will stop after 100 levels.
3963 * 'filename' cannot contain wildcards! It is used as-is, no backslashes to
3964 * escape special characters.
3966 * If 'stopdirs' is not NULL and nothing is found downward, the search is
3967 * restarted on the next higher directory level. This is repeated until the
3968 * start-directory of a search is contained in 'stopdirs'. 'stopdirs' has the
3969 * format ";*<dirname>*\(;<dirname>\)*;\=$".
3971 * If the 'path' is relative, the starting dir for the search is either VIM's
3972 * current dir or if the path starts with "./" the current files dir.
3973 * If the 'path' is absolut, the starting dir is that part of the path before
3974 * the first wildcard.
3976 * Upward search is only done on the starting dir.
3978 * If 'free_visited' is TRUE the list of already visited files/directories is
3979 * cleared. Set this to FALSE if you just want to search from another
3980 * directory, but want to be sure that no directory from a previous search is
3981 * searched again. This is useful if you search for a file at different places.
3982 * The list of visited files/dirs can also be cleared with the function
3983 * vim_findfile_free_visited().
3985 * Set the parameter 'find_what' to FINDFILE_DIR if you want to search for
3986 * directories only, FINDFILE_FILE for files only, FINDFILE_BOTH for both.
3988 * A search context returned by a previous call to vim_findfile_init() can be
3989 * passed in the parameter "search_ctx_arg". This context is reused and
3990 * reinitialized with the new parameters. The list of already visited
3991 * directories from this context is only deleted if the parameter
3992 * "free_visited" is true. Be aware that the passed "search_ctx_arg" is freed
3993 * if the reinitialization fails.
3995 * If you don't have a search context from a previous call "search_ctx_arg"
3998 * This function silently ignores a few errors, vim_findfile() will have
3999 * limited functionality then.
4003 vim_findfile_init(path
, filename
, stopdirs
, level
, free_visited
, find_what
,
4004 search_ctx_arg
, tagfile
, rel_fname
)
4011 void *search_ctx_arg
;
4013 char_u
*rel_fname
; /* file name to use for "." */
4015 #ifdef FEAT_PATH_EXTRA
4019 ff_search_ctx_T
*search_ctx
;
4021 /* If a search context is given by the caller, reuse it, else allocate a
4024 if (search_ctx_arg
!= NULL
)
4025 search_ctx
= search_ctx_arg
;
4028 search_ctx
= (ff_search_ctx_T
*)alloc((unsigned)sizeof(ff_search_ctx_T
));
4029 if (search_ctx
== NULL
)
4031 memset(search_ctx
, 0, sizeof(ff_search_ctx_T
));
4033 search_ctx
->ffsc_find_what
= find_what
;
4035 /* clear the search context, but NOT the visited lists */
4036 ff_clear(search_ctx
);
4038 /* clear visited list if wanted */
4039 if (free_visited
== TRUE
)
4040 vim_findfile_free_visited(search_ctx
);
4043 /* Reuse old visited lists. Get the visited list for the given
4044 * filename. If no list for the current filename exists, creates a new
4046 search_ctx
->ffsc_visited_list
= ff_get_visited_list(filename
,
4047 &search_ctx
->ffsc_visited_lists_list
);
4048 if (search_ctx
->ffsc_visited_list
== NULL
)
4050 search_ctx
->ffsc_dir_visited_list
= ff_get_visited_list(filename
,
4051 &search_ctx
->ffsc_dir_visited_lists_list
);
4052 if (search_ctx
->ffsc_dir_visited_list
== NULL
)
4056 if (ff_expand_buffer
== NULL
)
4058 ff_expand_buffer
= (char_u
*)alloc(MAXPATHL
);
4059 if (ff_expand_buffer
== NULL
)
4063 /* Store information on starting dir now if path is relative.
4064 * If path is absolute, we do that later. */
4066 && (vim_ispathsep(path
[1]) || path
[1] == NUL
)
4067 && (!tagfile
|| vim_strchr(p_cpo
, CPO_DOTTAG
) == NULL
)
4068 && rel_fname
!= NULL
)
4070 int len
= (int)(gettail(rel_fname
) - rel_fname
);
4072 if (!vim_isAbsName(rel_fname
) && len
+ 1 < MAXPATHL
)
4074 /* Make the start dir an absolute path name. */
4075 vim_strncpy(ff_expand_buffer
, rel_fname
, len
);
4076 search_ctx
->ffsc_start_dir
= FullName_save(ff_expand_buffer
, FALSE
);
4079 search_ctx
->ffsc_start_dir
= vim_strnsave(rel_fname
, len
);
4080 if (search_ctx
->ffsc_start_dir
== NULL
)
4085 else if (*path
== NUL
|| !vim_isAbsName(path
))
4087 #ifdef BACKSLASH_IN_FILENAME
4088 /* "c:dir" needs "c:" to be expanded, otherwise use current dir */
4089 if (*path
!= NUL
&& path
[1] == ':')
4096 if (vim_FullName(drive
, ff_expand_buffer
, MAXPATHL
, TRUE
) == FAIL
)
4102 if (mch_dirname(ff_expand_buffer
, MAXPATHL
) == FAIL
)
4105 search_ctx
->ffsc_start_dir
= vim_strsave(ff_expand_buffer
);
4106 if (search_ctx
->ffsc_start_dir
== NULL
)
4109 #ifdef BACKSLASH_IN_FILENAME
4110 /* A path that starts with "/dir" is relative to the drive, not to the
4111 * directory (but not for "//machine/dir"). Only use the drive name. */
4112 if ((*path
== '/' || *path
== '\\')
4113 && path
[1] != path
[0]
4114 && search_ctx
->ffsc_start_dir
[1] == ':')
4115 search_ctx
->ffsc_start_dir
[2] = NUL
;
4119 #ifdef FEAT_PATH_EXTRA
4121 * If stopdirs are given, split them into an array of pointers.
4122 * If this fails (mem allocation), there is no upward search at all or a
4123 * stop directory is not recognized -> continue silently.
4124 * If stopdirs just contains a ";" or is empty,
4125 * search_ctx->ffsc_stopdirs_v will only contain a NULL pointer. This
4126 * is handled as unlimited upward search. See function
4127 * ff_path_in_stoplist() for details.
4129 if (stopdirs
!= NULL
)
4131 char_u
*walker
= stopdirs
;
4134 while (*walker
== ';')
4138 search_ctx
->ffsc_stopdirs_v
=
4139 (char_u
**)alloc((unsigned)sizeof(char_u
*));
4141 if (search_ctx
->ffsc_stopdirs_v
!= NULL
)
4149 ptr
= vim_realloc(search_ctx
->ffsc_stopdirs_v
,
4150 (dircount
+ 1) * sizeof(char_u
*));
4152 search_ctx
->ffsc_stopdirs_v
= ptr
;
4154 /* ignore, keep what we have and continue */
4156 walker
= vim_strchr(walker
, ';');
4159 search_ctx
->ffsc_stopdirs_v
[dircount
-1] =
4160 vim_strnsave(helper
, (int)(walker
- helper
));
4164 /* this might be "", which means ascent till top
4165 * of directory tree.
4167 search_ctx
->ffsc_stopdirs_v
[dircount
-1] =
4168 vim_strsave(helper
);
4172 } while (walker
!= NULL
);
4173 search_ctx
->ffsc_stopdirs_v
[dircount
-1] = NULL
;
4178 #ifdef FEAT_PATH_EXTRA
4179 search_ctx
->ffsc_level
= level
;
4183 * -wildcard_stuff (might be NULL)
4185 wc_part
= vim_strchr(path
, '*');
4186 if (wc_part
!= NULL
)
4192 /* save the fix part of the path */
4193 search_ctx
->ffsc_fix_path
= vim_strnsave(path
, (int)(wc_part
- path
));
4196 * copy wc_path and add restricts to the '**' wildcard.
4197 * The octet after a '**' is used as a (binary) counter.
4198 * So '**3' is transposed to '**^C' ('^C' is ASCII value 3)
4199 * or '**76' is transposed to '**N'( 'N' is ASCII value 76).
4200 * For EBCDIC you get different character values.
4201 * If no restrict is given after '**' the default is used.
4202 * Due to this technic the path looks awful if you print it as a
4206 while (*wc_part
!= NUL
)
4208 if (STRNCMP(wc_part
, "**", 2) == 0)
4210 ff_expand_buffer
[len
++] = *wc_part
++;
4211 ff_expand_buffer
[len
++] = *wc_part
++;
4213 llevel
= strtol((char *)wc_part
, &errpt
, 10);
4214 if ((char_u
*)errpt
!= wc_part
&& llevel
> 0 && llevel
< 255)
4215 ff_expand_buffer
[len
++] = llevel
;
4216 else if ((char_u
*)errpt
!= wc_part
&& llevel
== 0)
4217 /* restrict is 0 -> remove already added '**' */
4220 ff_expand_buffer
[len
++] = FF_MAX_STAR_STAR_EXPAND
;
4221 wc_part
= (char_u
*)errpt
;
4222 if (*wc_part
!= NUL
&& !vim_ispathsep(*wc_part
))
4224 EMSG2(_("E343: Invalid path: '**[number]' must be at the end of the path or be followed by '%s'."), PATHSEPSTR
);
4229 ff_expand_buffer
[len
++] = *wc_part
++;
4231 ff_expand_buffer
[len
] = NUL
;
4232 search_ctx
->ffsc_wc_path
= vim_strsave(ff_expand_buffer
);
4234 if (search_ctx
->ffsc_wc_path
== NULL
)
4239 search_ctx
->ffsc_fix_path
= vim_strsave(path
);
4241 if (search_ctx
->ffsc_start_dir
== NULL
)
4243 /* store the fix part as startdir.
4244 * This is needed if the parameter path is fully qualified.
4246 search_ctx
->ffsc_start_dir
= vim_strsave(search_ctx
->ffsc_fix_path
);
4247 if (search_ctx
->ffsc_start_dir
)
4248 search_ctx
->ffsc_fix_path
[0] = NUL
;
4251 /* create an absolute path */
4252 STRCPY(ff_expand_buffer
, search_ctx
->ffsc_start_dir
);
4253 add_pathsep(ff_expand_buffer
);
4254 STRCAT(ff_expand_buffer
, search_ctx
->ffsc_fix_path
);
4255 add_pathsep(ff_expand_buffer
);
4257 sptr
= ff_create_stack_element(ff_expand_buffer
,
4258 #ifdef FEAT_PATH_EXTRA
4259 search_ctx
->ffsc_wc_path
,
4266 ff_push(search_ctx
, sptr
);
4268 search_ctx
->ffsc_file_to_search
= vim_strsave(filename
);
4269 if (search_ctx
->ffsc_file_to_search
== NULL
)
4276 * We clear the search context now!
4277 * Even when the caller gave us a (perhaps valid) context we free it here,
4278 * as we might have already destroyed it.
4280 vim_findfile_cleanup(search_ctx
);
4284 #if defined(FEAT_PATH_EXTRA) || defined(PROTO)
4286 * Get the stopdir string. Check that ';' is not escaped.
4289 vim_findfile_stopdir(buf
)
4292 char_u
*r_ptr
= buf
;
4294 while (*r_ptr
!= NUL
&& *r_ptr
!= ';')
4296 if (r_ptr
[0] == '\\' && r_ptr
[1] == ';')
4298 /* overwrite the escape char,
4299 * use STRLEN(r_ptr) to move the trailing '\0'
4301 mch_memmove(r_ptr
, r_ptr
+ 1, STRLEN(r_ptr
));
4311 else if (*r_ptr
== NUL
)
4318 * Clean up the given search context. Can handle a NULL pointer.
4321 vim_findfile_cleanup(ctx
)
4327 vim_findfile_free_visited(ctx
);
4333 * Find a file in a search context.
4334 * The search context was created with vim_findfile_init() above.
4335 * Return a pointer to an allocated file name or NULL if nothing found.
4336 * To get all matching files call this function until you get NULL.
4338 * If the passed search_context is NULL, NULL is returned.
4340 * The search algorithm is depth first. To change this replace the
4341 * stack with a list (don't forget to leave partly searched directories on the
4345 vim_findfile(search_ctx_arg
)
4346 void *search_ctx_arg
;
4349 #ifdef FEAT_PATH_EXTRA
4350 char_u
*rest_of_wildcards
;
4351 char_u
*path_end
= NULL
;
4354 #if defined(FEAT_SEARCHPATH) || defined(FEAT_PATH_EXTRA)
4359 #ifdef FEAT_SEARCHPATH
4362 ff_search_ctx_T
*search_ctx
;
4364 if (search_ctx_arg
== NULL
)
4367 search_ctx
= (ff_search_ctx_T
*)search_ctx_arg
;
4370 * filepath is used as buffer for various actions and as the storage to
4371 * return a found filename.
4373 if ((file_path
= alloc((int)MAXPATHL
)) == NULL
)
4376 #ifdef FEAT_PATH_EXTRA
4377 /* store the end of the start dir -- needed for upward search */
4378 if (search_ctx
->ffsc_start_dir
!= NULL
)
4379 path_end
= &search_ctx
->ffsc_start_dir
[
4380 STRLEN(search_ctx
->ffsc_start_dir
)];
4383 #ifdef FEAT_PATH_EXTRA
4384 /* upward search loop */
4388 /* downward search loop */
4391 /* check if user user wants to stop the search*/
4396 /* get directory to work on from stack */
4397 stackp
= ff_pop(search_ctx
);
4402 * TODO: decide if we leave this test in
4404 * GOOD: don't search a directory(-tree) twice.
4405 * BAD: - check linked list for every new directory entered.
4406 * - check for double files also done below
4408 * Here we check if we already searched this directory.
4409 * We already searched a directory if:
4410 * 1) The directory is the same.
4411 * 2) We would use the same wildcard string.
4413 * Good if you have links on same directory via several ways
4414 * or you have selfreferences in directories (e.g. SuSE Linux 6.3:
4415 * /etc/rc.d/init.d is linked to /etc/rc.d -> endless loop)
4417 * This check is only needed for directories we work on for the
4418 * first time (hence stackp->ff_filearray == NULL)
4420 if (stackp
->ffs_filearray
== NULL
4421 && ff_check_visited(&search_ctx
->ffsc_dir_visited_list
4422 ->ffvl_visited_list
,
4423 stackp
->ffs_fix_path
4424 #ifdef FEAT_PATH_EXTRA
4425 , stackp
->ffs_wc_path
4432 verbose_enter_scroll();
4433 smsg((char_u
*)"Already Searched: %s (%s)",
4434 stackp
->ffs_fix_path
, stackp
->ffs_wc_path
);
4435 /* don't overwrite this either */
4436 msg_puts((char_u
*)"\n");
4437 verbose_leave_scroll();
4440 ff_free_stack_element(stackp
);
4444 else if (p_verbose
>= 5)
4446 verbose_enter_scroll();
4447 smsg((char_u
*)"Searching: %s (%s)",
4448 stackp
->ffs_fix_path
, stackp
->ffs_wc_path
);
4449 /* don't overwrite this either */
4450 msg_puts((char_u
*)"\n");
4451 verbose_leave_scroll();
4456 if (stackp
->ffs_level
<= 0)
4458 ff_free_stack_element(stackp
);
4465 * If no filearray till now expand wildcards
4466 * The function expand_wildcards() can handle an array of paths
4467 * and all possible expands are returned in one array. We use this
4468 * to handle the expansion of '**' into an empty string.
4470 if (stackp
->ffs_filearray
== NULL
)
4474 /* we use filepath to build the path expand_wildcards() should
4477 dirptrs
[0] = file_path
;
4480 /* if we have a start dir copy it in */
4481 if (!vim_isAbsName(stackp
->ffs_fix_path
)
4482 && search_ctx
->ffsc_start_dir
)
4484 STRCPY(file_path
, search_ctx
->ffsc_start_dir
);
4485 add_pathsep(file_path
);
4488 /* append the fix part of the search path */
4489 STRCAT(file_path
, stackp
->ffs_fix_path
);
4490 add_pathsep(file_path
);
4492 #ifdef FEAT_PATH_EXTRA
4493 rest_of_wildcards
= stackp
->ffs_wc_path
;
4494 if (*rest_of_wildcards
!= NUL
)
4496 len
= (int)STRLEN(file_path
);
4497 if (STRNCMP(rest_of_wildcards
, "**", 2) == 0)
4499 /* pointer to the restrict byte
4500 * The restrict byte is not a character!
4502 p
= rest_of_wildcards
+ 2;
4507 file_path
[len
++] = '*';
4512 /* remove '**<numb> from wildcards */
4513 mch_memmove(rest_of_wildcards
,
4514 rest_of_wildcards
+ 3,
4515 STRLEN(rest_of_wildcards
+ 3) + 1);
4518 rest_of_wildcards
+= 3;
4520 if (stackp
->ffs_star_star_empty
== 0)
4522 /* if not done before, expand '**' to empty */
4523 stackp
->ffs_star_star_empty
= 1;
4524 dirptrs
[1] = stackp
->ffs_fix_path
;
4529 * Here we copy until the next path separator or the end of
4530 * the path. If we stop at a path separator, there is
4531 * still something else left. This is handled below by
4532 * pushing every directory returned from expand_wildcards()
4533 * on the stack again for further search.
4535 while (*rest_of_wildcards
4536 && !vim_ispathsep(*rest_of_wildcards
))
4537 file_path
[len
++] = *rest_of_wildcards
++;
4539 file_path
[len
] = NUL
;
4540 if (vim_ispathsep(*rest_of_wildcards
))
4541 rest_of_wildcards
++;
4546 * Expand wildcards like "*" and "$VAR".
4547 * If the path is a URL don't try this.
4549 if (path_with_url(dirptrs
[0]))
4551 stackp
->ffs_filearray
= (char_u
**)
4552 alloc((unsigned)sizeof(char *));
4553 if (stackp
->ffs_filearray
!= NULL
4554 && (stackp
->ffs_filearray
[0]
4555 = vim_strsave(dirptrs
[0])) != NULL
)
4556 stackp
->ffs_filearray_size
= 1;
4558 stackp
->ffs_filearray_size
= 0;
4561 expand_wildcards((dirptrs
[1] == NULL
) ? 1 : 2, dirptrs
,
4562 &stackp
->ffs_filearray_size
,
4563 &stackp
->ffs_filearray
,
4564 EW_DIR
|EW_ADDSLASH
|EW_SILENT
);
4566 stackp
->ffs_filearray_cur
= 0;
4567 stackp
->ffs_stage
= 0;
4569 #ifdef FEAT_PATH_EXTRA
4571 rest_of_wildcards
= &stackp
->ffs_wc_path
[
4572 STRLEN(stackp
->ffs_wc_path
)];
4575 if (stackp
->ffs_stage
== 0)
4577 /* this is the first time we work on this directory */
4578 #ifdef FEAT_PATH_EXTRA
4579 if (*rest_of_wildcards
== NUL
)
4583 * we don't have further wildcards to expand, so we have to
4584 * check for the final file now
4586 for (i
= stackp
->ffs_filearray_cur
;
4587 i
< stackp
->ffs_filearray_size
; ++i
)
4589 if (!path_with_url(stackp
->ffs_filearray
[i
])
4590 && !mch_isdir(stackp
->ffs_filearray
[i
]))
4591 continue; /* not a directory */
4593 /* prepare the filename to be checked for existance
4595 STRCPY(file_path
, stackp
->ffs_filearray
[i
]);
4596 add_pathsep(file_path
);
4597 STRCAT(file_path
, search_ctx
->ffsc_file_to_search
);
4600 * Try without extra suffix and then with suffixes
4601 * from 'suffixesadd'.
4603 #ifdef FEAT_SEARCHPATH
4604 len
= (int)STRLEN(file_path
);
4605 suf
= curbuf
->b_p_sua
;
4609 /* if file exists and we didn't already find it */
4610 if ((path_with_url(file_path
)
4611 || (mch_getperm(file_path
) >= 0
4612 && (search_ctx
->ffsc_find_what
4614 || ((search_ctx
->ffsc_find_what
4616 == mch_isdir(file_path
)))))
4618 && (ff_check_visited(
4619 &search_ctx
->ffsc_visited_list
->ffvl_visited_list
,
4621 #ifdef FEAT_PATH_EXTRA
4629 if (ff_check_visited(
4630 &search_ctx
->ffsc_visited_list
->ffvl_visited_list
,
4632 #ifdef FEAT_PATH_EXTRA
4639 verbose_enter_scroll();
4640 smsg((char_u
*)"Already: %s",
4642 /* don't overwrite this either */
4643 msg_puts((char_u
*)"\n");
4644 verbose_leave_scroll();
4650 /* push dir to examine rest of subdirs later */
4651 stackp
->ffs_filearray_cur
= i
+ 1;
4652 ff_push(search_ctx
, stackp
);
4654 simplify_filename(file_path
);
4655 if (mch_dirname(ff_expand_buffer
, MAXPATHL
)
4658 p
= shorten_fname(file_path
,
4661 mch_memmove(file_path
, p
,
4667 verbose_enter_scroll();
4668 smsg((char_u
*)"HIT: %s", file_path
);
4669 /* don't overwrite this either */
4670 msg_puts((char_u
*)"\n");
4671 verbose_leave_scroll();
4677 #ifdef FEAT_SEARCHPATH
4678 /* Not found or found already, try next suffix. */
4681 copy_option_part(&suf
, file_path
+ len
,
4682 MAXPATHL
- len
, ",");
4687 #ifdef FEAT_PATH_EXTRA
4691 * still wildcards left, push the directories for further
4694 for (i
= stackp
->ffs_filearray_cur
;
4695 i
< stackp
->ffs_filearray_size
; ++i
)
4697 if (!mch_isdir(stackp
->ffs_filearray
[i
]))
4698 continue; /* not a directory */
4701 ff_create_stack_element(
4702 stackp
->ffs_filearray
[i
],
4704 stackp
->ffs_level
- 1, 0));
4708 stackp
->ffs_filearray_cur
= 0;
4709 stackp
->ffs_stage
= 1;
4712 #ifdef FEAT_PATH_EXTRA
4714 * if wildcards contains '**' we have to descent till we reach the
4715 * leaves of the directory tree.
4717 if (STRNCMP(stackp
->ffs_wc_path
, "**", 2) == 0)
4719 for (i
= stackp
->ffs_filearray_cur
;
4720 i
< stackp
->ffs_filearray_size
; ++i
)
4722 if (fnamecmp(stackp
->ffs_filearray
[i
],
4723 stackp
->ffs_fix_path
) == 0)
4724 continue; /* don't repush same directory */
4725 if (!mch_isdir(stackp
->ffs_filearray
[i
]))
4726 continue; /* not a directory */
4728 ff_create_stack_element(stackp
->ffs_filearray
[i
],
4729 stackp
->ffs_wc_path
, stackp
->ffs_level
- 1, 1));
4734 /* we are done with the current directory */
4735 ff_free_stack_element(stackp
);
4739 #ifdef FEAT_PATH_EXTRA
4740 /* If we reached this, we didn't find anything downwards.
4741 * Let's check if we should do an upward search.
4743 if (search_ctx
->ffsc_start_dir
4744 && search_ctx
->ffsc_stopdirs_v
!= NULL
&& !got_int
)
4748 /* is the last starting directory in the stop list? */
4749 if (ff_path_in_stoplist(search_ctx
->ffsc_start_dir
,
4750 (int)(path_end
- search_ctx
->ffsc_start_dir
),
4751 search_ctx
->ffsc_stopdirs_v
) == TRUE
)
4754 /* cut of last dir */
4755 while (path_end
> search_ctx
->ffsc_start_dir
4756 && vim_ispathsep(*path_end
))
4758 while (path_end
> search_ctx
->ffsc_start_dir
4759 && !vim_ispathsep(path_end
[-1]))
4764 if (*search_ctx
->ffsc_start_dir
== 0)
4767 STRCPY(file_path
, search_ctx
->ffsc_start_dir
);
4768 add_pathsep(file_path
);
4769 STRCAT(file_path
, search_ctx
->ffsc_fix_path
);
4771 /* create a new stack entry */
4772 sptr
= ff_create_stack_element(file_path
,
4773 search_ctx
->ffsc_wc_path
, search_ctx
->ffsc_level
, 0);
4776 ff_push(search_ctx
, sptr
);
4783 vim_free(file_path
);
4788 * Free the list of lists of visited files and directories
4789 * Can handle it if the passed search_context is NULL;
4792 vim_findfile_free_visited(search_ctx_arg
)
4793 void *search_ctx_arg
;
4795 ff_search_ctx_T
*search_ctx
;
4797 if (search_ctx_arg
== NULL
)
4800 search_ctx
= (ff_search_ctx_T
*)search_ctx_arg
;
4801 vim_findfile_free_visited_list(&search_ctx
->ffsc_visited_lists_list
);
4802 vim_findfile_free_visited_list(&search_ctx
->ffsc_dir_visited_lists_list
);
4806 vim_findfile_free_visited_list(list_headp
)
4807 ff_visited_list_hdr_T
**list_headp
;
4809 ff_visited_list_hdr_T
*vp
;
4811 while (*list_headp
!= NULL
)
4813 vp
= (*list_headp
)->ffvl_next
;
4814 ff_free_visited_list((*list_headp
)->ffvl_visited_list
);
4816 vim_free((*list_headp
)->ffvl_filename
);
4817 vim_free(*list_headp
);
4824 ff_free_visited_list(vl
)
4832 #ifdef FEAT_PATH_EXTRA
4833 vim_free(vl
->ffv_wc_path
);
4842 * Returns the already visited list for the given filename. If none is found it
4843 * allocates a new one.
4845 static ff_visited_list_hdr_T
*
4846 ff_get_visited_list(filename
, list_headp
)
4848 ff_visited_list_hdr_T
**list_headp
;
4850 ff_visited_list_hdr_T
*retptr
= NULL
;
4852 /* check if a visited list for the given filename exists */
4853 if (*list_headp
!= NULL
)
4855 retptr
= *list_headp
;
4856 while (retptr
!= NULL
)
4858 if (fnamecmp(filename
, retptr
->ffvl_filename
) == 0)
4863 verbose_enter_scroll();
4864 smsg((char_u
*)"ff_get_visited_list: FOUND list for %s",
4866 /* don't overwrite this either */
4867 msg_puts((char_u
*)"\n");
4868 verbose_leave_scroll();
4873 retptr
= retptr
->ffvl_next
;
4880 verbose_enter_scroll();
4881 smsg((char_u
*)"ff_get_visited_list: new list for %s", filename
);
4882 /* don't overwrite this either */
4883 msg_puts((char_u
*)"\n");
4884 verbose_leave_scroll();
4889 * if we reach this we didn't find a list and we have to allocate new list
4891 retptr
= (ff_visited_list_hdr_T
*)alloc((unsigned)sizeof(*retptr
));
4895 retptr
->ffvl_visited_list
= NULL
;
4896 retptr
->ffvl_filename
= vim_strsave(filename
);
4897 if (retptr
->ffvl_filename
== NULL
)
4902 retptr
->ffvl_next
= *list_headp
;
4903 *list_headp
= retptr
;
4908 #ifdef FEAT_PATH_EXTRA
4910 * check if two wildcard paths are equal. Returns TRUE or FALSE.
4911 * They are equal if:
4912 * - both paths are NULL
4913 * - they have the same length
4914 * - char by char comparison is OK
4915 * - the only differences are in the counters behind a '**', so
4916 * '**\20' is equal to '**\24'
4928 if (s1
== NULL
|| s2
== NULL
)
4931 if (STRLEN(s1
) != STRLEN(s2
))
4934 for (i
= 0; s1
[i
] != NUL
&& s2
[i
] != NUL
; i
++)
4937 #ifdef CASE_INSENSITIVE_FILENAME
4938 && TOUPPER_LOC(s1
[i
]) != TOUPPER_LOC(s2
[i
])
4943 if (s1
[i
-1] == '*' && s1
[i
-2] == '*')
4956 * maintains the list of already visited files and dirs
4957 * returns FAIL if the given file/dir is already in the list
4958 * returns OK if it is newly added
4960 * TODO: What to do on memory allocation problems?
4961 * -> return TRUE - Better the file is found several times instead of
4965 ff_check_visited(visited_list
, fname
4966 #ifdef FEAT_PATH_EXTRA
4970 ff_visited_T
**visited_list
;
4972 #ifdef FEAT_PATH_EXTRA
4982 /* For an URL we only compare the name, otherwise we compare the
4983 * device/inode (unix) or the full path name (not Unix). */
4984 if (path_with_url(fname
))
4986 vim_strncpy(ff_expand_buffer
, fname
, MAXPATHL
- 1);
4993 ff_expand_buffer
[0] = NUL
;
4995 if (mch_stat((char *)fname
, &st
) < 0)
4997 if (vim_FullName(fname
, ff_expand_buffer
, MAXPATHL
, TRUE
) == FAIL
)
5002 /* check against list of already visited files */
5003 for (vp
= *visited_list
; vp
!= NULL
; vp
= vp
->ffv_next
)
5008 ? (vp
->ffv_dev
== st
.st_dev
5009 && vp
->ffv_ino
== st
.st_ino
)
5012 fnamecmp(vp
->ffv_fname
, ff_expand_buffer
) == 0
5015 #ifdef FEAT_PATH_EXTRA
5016 /* are the wildcard parts equal */
5017 if (ff_wc_equal(vp
->ffv_wc_path
, wc_path
) == TRUE
)
5019 /* already visited */
5025 * New file/dir. Add it to the list of visited files/dirs.
5027 vp
= (ff_visited_T
*)alloc((unsigned)(sizeof(ff_visited_T
)
5028 + STRLEN(ff_expand_buffer
)));
5035 vp
->ffv_ino
= st
.st_ino
;
5036 vp
->ffv_dev
= st
.st_dev
;
5037 vp
->ffv_fname
[0] = NUL
;
5044 STRCPY(vp
->ffv_fname
, ff_expand_buffer
);
5048 #ifdef FEAT_PATH_EXTRA
5049 if (wc_path
!= NULL
)
5050 vp
->ffv_wc_path
= vim_strsave(wc_path
);
5052 vp
->ffv_wc_path
= NULL
;
5055 vp
->ffv_next
= *visited_list
;
5063 * create stack element from given path pieces
5066 ff_create_stack_element(fix_part
,
5067 #ifdef FEAT_PATH_EXTRA
5070 level
, star_star_empty
)
5072 #ifdef FEAT_PATH_EXTRA
5076 int star_star_empty
;
5080 new = (ff_stack_T
*)alloc((unsigned)sizeof(ff_stack_T
));
5084 new->ffs_prev
= NULL
;
5085 new->ffs_filearray
= NULL
;
5086 new->ffs_filearray_size
= 0;
5087 new->ffs_filearray_cur
= 0;
5089 new->ffs_level
= level
;
5090 new->ffs_star_star_empty
= star_star_empty
;;
5092 /* the following saves NULL pointer checks in vim_findfile */
5093 if (fix_part
== NULL
)
5094 fix_part
= (char_u
*)"";
5095 new->ffs_fix_path
= vim_strsave(fix_part
);
5097 #ifdef FEAT_PATH_EXTRA
5098 if (wc_part
== NULL
)
5099 wc_part
= (char_u
*)"";
5100 new->ffs_wc_path
= vim_strsave(wc_part
);
5103 if (new->ffs_fix_path
== NULL
5104 #ifdef FEAT_PATH_EXTRA
5105 || new->ffs_wc_path
== NULL
5109 ff_free_stack_element(new);
5117 * Push a dir on the directory stack.
5120 ff_push(search_ctx
, stack_ptr
)
5121 ff_search_ctx_T
*search_ctx
;
5122 ff_stack_T
*stack_ptr
;
5124 /* check for NULL pointer, not to return an error to the user, but
5125 * to prevent a crash */
5126 if (stack_ptr
!= NULL
)
5128 stack_ptr
->ffs_prev
= search_ctx
->ffsc_stack_ptr
;
5129 search_ctx
->ffsc_stack_ptr
= stack_ptr
;
5134 * Pop a dir from the directory stack.
5135 * Returns NULL if stack is empty.
5139 ff_search_ctx_T
*search_ctx
;
5143 sptr
= search_ctx
->ffsc_stack_ptr
;
5144 if (search_ctx
->ffsc_stack_ptr
!= NULL
)
5145 search_ctx
->ffsc_stack_ptr
= search_ctx
->ffsc_stack_ptr
->ffs_prev
;
5151 * free the given stack element
5154 ff_free_stack_element(stack_ptr
)
5155 ff_stack_T
*stack_ptr
;
5157 /* vim_free handles possible NULL pointers */
5158 vim_free(stack_ptr
->ffs_fix_path
);
5159 #ifdef FEAT_PATH_EXTRA
5160 vim_free(stack_ptr
->ffs_wc_path
);
5163 if (stack_ptr
->ffs_filearray
!= NULL
)
5164 FreeWild(stack_ptr
->ffs_filearray_size
, stack_ptr
->ffs_filearray
);
5166 vim_free(stack_ptr
);
5170 * Clear the search context, but NOT the visited list.
5173 ff_clear(search_ctx
)
5174 ff_search_ctx_T
*search_ctx
;
5178 /* clear up stack */
5179 while ((sptr
= ff_pop(search_ctx
)) != NULL
)
5180 ff_free_stack_element(sptr
);
5182 vim_free(search_ctx
->ffsc_file_to_search
);
5183 vim_free(search_ctx
->ffsc_start_dir
);
5184 vim_free(search_ctx
->ffsc_fix_path
);
5185 #ifdef FEAT_PATH_EXTRA
5186 vim_free(search_ctx
->ffsc_wc_path
);
5189 #ifdef FEAT_PATH_EXTRA
5190 if (search_ctx
->ffsc_stopdirs_v
!= NULL
)
5194 while (search_ctx
->ffsc_stopdirs_v
[i
] != NULL
)
5196 vim_free(search_ctx
->ffsc_stopdirs_v
[i
]);
5199 vim_free(search_ctx
->ffsc_stopdirs_v
);
5201 search_ctx
->ffsc_stopdirs_v
= NULL
;
5204 /* reset everything */
5205 search_ctx
->ffsc_file_to_search
= NULL
;
5206 search_ctx
->ffsc_start_dir
= NULL
;
5207 search_ctx
->ffsc_fix_path
= NULL
;
5208 #ifdef FEAT_PATH_EXTRA
5209 search_ctx
->ffsc_wc_path
= NULL
;
5210 search_ctx
->ffsc_level
= 0;
5214 #ifdef FEAT_PATH_EXTRA
5216 * check if the given path is in the stopdirs
5217 * returns TRUE if yes else FALSE
5220 ff_path_in_stoplist(path
, path_len
, stopdirs_v
)
5223 char_u
**stopdirs_v
;
5227 /* eat up trailing path separators, except the first */
5228 while (path_len
> 1 && vim_ispathsep(path
[path_len
- 1]))
5231 /* if no path consider it as match */
5235 for (i
= 0; stopdirs_v
[i
] != NULL
; i
++)
5237 if ((int)STRLEN(stopdirs_v
[i
]) > path_len
)
5239 /* match for parent directory. So '/home' also matches
5240 * '/home/rks'. Check for PATHSEP in stopdirs_v[i], else
5241 * '/home/r' would also match '/home/rks'
5243 if (fnamencmp(stopdirs_v
[i
], path
, path_len
) == 0
5244 && vim_ispathsep(stopdirs_v
[i
][path_len
]))
5249 if (fnamecmp(stopdirs_v
[i
], path
) == 0)
5257 #if defined(FEAT_SEARCHPATH) || defined(PROTO)
5259 * Find the file name "ptr[len]" in the path. Also finds directory names.
5261 * On the first call set the parameter 'first' to TRUE to initialize
5262 * the search. For repeating calls to FALSE.
5264 * Repeating calls will return other files called 'ptr[len]' from the path.
5266 * Only on the first call 'ptr' and 'len' are used. For repeating calls they
5267 * don't need valid values.
5269 * If nothing found on the first call the option FNAME_MESS will issue the
5271 * 'Can't find file "<file>" in path'
5272 * On repeating calls:
5273 * 'No more file "<file>" found in path'
5276 * FNAME_MESS give error message when not found
5280 * Returns an allocated string for the file name. NULL for error.
5284 find_file_in_path(ptr
, len
, options
, first
, rel_fname
)
5285 char_u
*ptr
; /* file name */
5286 int len
; /* length of file name */
5288 int first
; /* use count'th matching file name */
5289 char_u
*rel_fname
; /* file name searching relative to */
5291 return find_file_in_path_option(ptr
, len
, options
, first
,
5292 *curbuf
->b_p_path
== NUL
? p_path
: curbuf
->b_p_path
,
5293 FINDFILE_BOTH
, rel_fname
, curbuf
->b_p_sua
);
5296 static char_u
*ff_file_to_find
= NULL
;
5297 static void *fdip_search_ctx
= NULL
;
5299 #if defined(EXITFREE)
5303 vim_free(ff_file_to_find
);
5304 vim_findfile_cleanup(fdip_search_ctx
);
5309 * Find the directory name "ptr[len]" in the path.
5312 * FNAME_MESS give error message when not found
5316 * Returns an allocated string for the file name. NULL for error.
5319 find_directory_in_path(ptr
, len
, options
, rel_fname
)
5320 char_u
*ptr
; /* file name */
5321 int len
; /* length of file name */
5323 char_u
*rel_fname
; /* file name searching relative to */
5325 return find_file_in_path_option(ptr
, len
, options
, TRUE
, p_cdpath
,
5326 FINDFILE_DIR
, rel_fname
, (char_u
*)"");
5330 find_file_in_path_option(ptr
, len
, options
, first
, path_option
, find_what
, rel_fname
, suffixes
)
5331 char_u
*ptr
; /* file name */
5332 int len
; /* length of file name */
5334 int first
; /* use count'th matching file name */
5335 char_u
*path_option
; /* p_path or p_cdpath */
5336 int find_what
; /* FINDFILE_FILE, _DIR or _BOTH */
5337 char_u
*rel_fname
; /* file name we are looking relative to. */
5338 char_u
*suffixes
; /* list of suffixes, 'suffixesadd' option */
5341 static int did_findfile_init
= FALSE
;
5343 char_u
*file_name
= NULL
;
5347 struct Process
*proc
= (struct Process
*)FindTask(0L);
5348 APTR save_winptr
= proc
->pr_WindowPtr
;
5350 /* Avoid a requester here for a volume that doesn't exist. */
5351 proc
->pr_WindowPtr
= (APTR
)-1L;
5356 /* copy file name into NameBuff, expanding environment variables */
5357 save_char
= ptr
[len
];
5359 expand_env(ptr
, NameBuff
, MAXPATHL
);
5360 ptr
[len
] = save_char
;
5362 vim_free(ff_file_to_find
);
5363 ff_file_to_find
= vim_strsave(NameBuff
);
5364 if (ff_file_to_find
== NULL
) /* out of memory */
5371 rel_to_curdir
= (ff_file_to_find
[0] == '.'
5372 && (ff_file_to_find
[1] == NUL
5373 || vim_ispathsep(ff_file_to_find
[1])
5374 || (ff_file_to_find
[1] == '.'
5375 && (ff_file_to_find
[2] == NUL
5376 || vim_ispathsep(ff_file_to_find
[2])))));
5377 if (vim_isAbsName(ff_file_to_find
)
5378 /* "..", "../path", "." and "./path": don't use the path_option */
5380 #if defined(MSWIN) || defined(MSDOS) || defined(OS2)
5381 /* handle "\tmp" as absolute path */
5382 || vim_ispathsep(ff_file_to_find
[0])
5383 /* handle "c:name" as absulute path */
5384 || (ff_file_to_find
[0] != NUL
&& ff_file_to_find
[1] == ':')
5387 /* handle ":tmp" as absolute path */
5388 || ff_file_to_find
[0] == ':'
5393 * Absolute path, no need to use "path_option".
5394 * If this is not a first call, return NULL. We already returned a
5395 * filename on the first call.
5402 if (path_with_url(ff_file_to_find
))
5404 file_name
= vim_strsave(ff_file_to_find
);
5408 /* When FNAME_REL flag given first use the directory of the file.
5409 * Otherwise or when this fails use the current directory. */
5410 for (run
= 1; run
<= 2; ++run
)
5412 l
= (int)STRLEN(ff_file_to_find
);
5415 && (options
& FNAME_REL
)
5416 && rel_fname
!= NULL
5417 && STRLEN(rel_fname
) + l
< MAXPATHL
)
5419 STRCPY(NameBuff
, rel_fname
);
5420 STRCPY(gettail(NameBuff
), ff_file_to_find
);
5421 l
= (int)STRLEN(NameBuff
);
5425 STRCPY(NameBuff
, ff_file_to_find
);
5429 /* When the file doesn't exist, try adding parts of
5436 /* "C:" by itself will fail for mch_getperm(),
5437 * assume it's always valid. */
5438 (find_what
!= FINDFILE_FILE
&& NameBuff
[0] != NUL
5439 && NameBuff
[1] == ':'
5440 && NameBuff
[2] == NUL
) ||
5442 (mch_getperm(NameBuff
) >= 0
5443 && (find_what
== FINDFILE_BOTH
5444 || ((find_what
== FINDFILE_DIR
)
5445 == mch_isdir(NameBuff
)))))
5447 file_name
= vim_strsave(NameBuff
);
5452 copy_option_part(&buf
, NameBuff
+ l
, MAXPATHL
- l
, ",");
5460 * Loop over all paths in the 'path' or 'cdpath' option.
5461 * When "first" is set, first setup to the start of the option.
5462 * Otherwise continue to find the next match.
5466 /* vim_findfile_free_visited can handle a possible NULL pointer */
5467 vim_findfile_free_visited(fdip_search_ctx
);
5469 did_findfile_init
= FALSE
;
5474 if (did_findfile_init
)
5476 file_name
= vim_findfile(fdip_search_ctx
);
5477 if (file_name
!= NULL
)
5480 did_findfile_init
= FALSE
;
5486 if (dir
== NULL
|| *dir
== NUL
)
5488 /* We searched all paths of the option, now we can
5489 * free the search context. */
5490 vim_findfile_cleanup(fdip_search_ctx
);
5491 fdip_search_ctx
= NULL
;
5495 if ((buf
= alloc((int)(MAXPATHL
))) == NULL
)
5498 /* copy next path */
5500 copy_option_part(&dir
, buf
, MAXPATHL
, " ,");
5502 #ifdef FEAT_PATH_EXTRA
5503 /* get the stopdir string */
5504 r_ptr
= vim_findfile_stopdir(buf
);
5508 fdip_search_ctx
= vim_findfile_init(buf
, ff_file_to_find
,
5509 r_ptr
, 100, FALSE
, find_what
,
5510 fdip_search_ctx
, FALSE
, rel_fname
);
5511 if (fdip_search_ctx
!= NULL
)
5512 did_findfile_init
= TRUE
;
5517 if (file_name
== NULL
&& (options
& FNAME_MESS
))
5521 if (find_what
== FINDFILE_DIR
)
5522 EMSG2(_("E344: Can't find directory \"%s\" in cdpath"),
5525 EMSG2(_("E345: Can't find file \"%s\" in path"),
5530 if (find_what
== FINDFILE_DIR
)
5531 EMSG2(_("E346: No more directory \"%s\" found in cdpath"),
5534 EMSG2(_("E347: No more file \"%s\" found in path"),
5541 proc
->pr_WindowPtr
= save_winptr
;
5546 #endif /* FEAT_SEARCHPATH */
5549 * Change directory to "new_dir". If FEAT_SEARCHPATH is defined, search
5550 * 'cdpath' for relative directory names, otherwise just mch_chdir().
5556 #ifndef FEAT_SEARCHPATH
5557 return mch_chdir((char *)new_dir
);
5562 dir_name
= find_directory_in_path(new_dir
, (int)STRLEN(new_dir
),
5563 FNAME_MESS
, curbuf
->b_ffname
);
5564 if (dir_name
== NULL
)
5566 r
= mch_chdir((char *)dir_name
);
5573 * Get user name from machine-specific function.
5574 * Returns the user name in "buf[len]".
5575 * Some systems are quite slow in obtaining the user name (Windows NT), thus
5577 * Returns OK or FAIL.
5580 get_user_name(buf
, len
)
5584 if (username
== NULL
)
5586 if (mch_get_user_name(buf
, len
) == FAIL
)
5588 username
= vim_strsave(buf
);
5591 vim_strncpy(buf
, username
, len
- 1);
5597 * Our own qsort(), for systems that don't have it.
5598 * It's simple and slow. From the K&R C book.
5601 qsort(base
, elm_count
, elm_size
, cmp
)
5605 int (*cmp
) __ARGS((const void *, const void *));
5613 buf
= alloc((unsigned)elm_size
);
5617 for (gap
= elm_count
/ 2; gap
> 0; gap
/= 2)
5618 for (i
= gap
; i
< elm_count
; ++i
)
5619 for (j
= i
- gap
; j
>= 0; j
-= gap
)
5621 /* Compare the elements. */
5622 p1
= (char_u
*)base
+ j
* elm_size
;
5623 p2
= (char_u
*)base
+ (j
+ gap
) * elm_size
;
5624 if ((*cmp
)((void *)p1
, (void *)p2
) <= 0)
5626 /* Exchange the elemets. */
5627 mch_memmove(buf
, p1
, elm_size
);
5628 mch_memmove(p1
, p2
, elm_size
);
5629 mch_memmove(p2
, buf
, elm_size
);
5637 * Sort an array of strings.
5643 sort_compare
__ARGS((const void *s1
, const void *s2
));
5649 sort_compare(s1
, s2
)
5653 return STRCMP(*(char **)s1
, *(char **)s2
);
5657 sort_strings(files
, count
)
5661 qsort((void *)files
, (size_t)count
, sizeof(char_u
*), sort_compare
);
5664 #if !defined(NO_EXPANDPATH) || defined(PROTO)
5666 * Compare path "p[]" to "q[]".
5667 * If "maxlen" >= 0 compare "p[maxlen]" to "q[maxlen]"
5668 * Return value like strcmp(p, q), but consider path separators.
5671 pathcmp(p
, q
, maxlen
)
5676 const char *s
= NULL
;
5678 for (i
= 0; maxlen
< 0 || i
< maxlen
; ++i
)
5680 /* End of "p": check if "q" also ends or just has a slash. */
5683 if (q
[i
] == NUL
) /* full match */
5689 /* End of "q": check if "p" just has a slash. */
5697 #ifdef CASE_INSENSITIVE_FILENAME
5698 TOUPPER_LOC(p
[i
]) != TOUPPER_LOC(q
[i
])
5702 #ifdef BACKSLASH_IN_FILENAME
5703 /* consider '/' and '\\' to be equal */
5704 && !((p
[i
] == '/' && q
[i
] == '\\')
5705 || (p
[i
] == '\\' && q
[i
] == '/'))
5709 if (vim_ispathsep(p
[i
]))
5711 if (vim_ispathsep(q
[i
]))
5713 return ((char_u
*)p
)[i
] - ((char_u
*)q
)[i
]; /* no match */
5716 if (s
== NULL
) /* "i" ran into "maxlen" */
5719 /* ignore a trailing slash, but not "//" or ":/" */
5722 && !after_pathsep((char_u
*)s
, (char_u
*)s
+ i
)
5723 #ifdef BACKSLASH_IN_FILENAME
5724 && (s
[i
] == '/' || s
[i
] == '\\')
5729 return 0; /* match with trailing slash */
5731 return -1; /* no match */
5737 * The putenv() implementation below comes from the "screen" program.
5738 * Included with permission from Juergen Weigert.
5739 * See pty.c for the copyright notice.
5743 * putenv -- put value into environment
5745 * Usage: i = putenv (string)
5749 * where string is of the form <name>=<value>.
5750 * Putenv returns 0 normally, -1 on error (not enough core for malloc).
5752 * Putenv may need to add a new name into the environment, or to
5753 * associate a value longer than the current value with a particular
5754 * name. So, to make life simpler, putenv() copies your entire
5755 * environment into the heap (i.e. malloc()) from the stack
5756 * (i.e. where it resides when your process is initiated) the first
5759 * (history removed, not very interesting. See the "screen" sources.)
5762 #if !defined(HAVE_SETENV) && !defined(HAVE_PUTENV)
5764 #define EXTRASIZE 5 /* increment to add to env. size */
5766 static int envsize
= -1; /* current size of environment */
5767 #ifndef MACOS_CLASSIC
5770 char **environ
; /* the global which is your env. */
5772 static int findenv
__ARGS((char *name
)); /* look for a name in the env. */
5773 static int newenv
__ARGS((void)); /* copy env. from stack to heap */
5774 static int moreenv
__ARGS((void)); /* incr. size of env. */
5784 { /* first time putenv called */
5785 if (newenv() < 0) /* copy env. to heap */
5789 i
= findenv((char *)string
); /* look for name in environment */
5792 { /* name must be added */
5793 for (i
= 0; environ
[i
]; i
++);
5794 if (i
>= (envsize
- 1))
5795 { /* need new slot */
5799 p
= (char *)alloc((unsigned)(strlen(string
) + 1));
5800 if (p
== NULL
) /* not enough core */
5802 environ
[i
+ 1] = 0; /* new end of env. */
5805 { /* name already in env. */
5806 p
= vim_realloc(environ
[i
], strlen(string
) + 1);
5810 sprintf(p
, "%s", string
); /* copy into env. */
5820 char *namechar
, *envchar
;
5824 for (i
= 0; environ
[i
] && !found
; i
++)
5826 envchar
= environ
[i
];
5828 while (*namechar
&& *namechar
!= '=' && (*namechar
== *envchar
))
5833 found
= ((*namechar
== '\0' || *namechar
== '=') && *envchar
== '=');
5835 return found
? i
- 1 : -1;
5845 /* for Mac a new, empty environment is created */
5848 for (i
= 0; environ
[i
]; i
++)
5851 esize
= i
+ EXTRASIZE
+ 1;
5852 env
= (char **)alloc((unsigned)(esize
* sizeof (elem
)));
5857 for (i
= 0; environ
[i
]; i
++)
5859 elem
= (char *)alloc((unsigned)(strlen(environ
[i
]) + 1));
5863 strcpy(elem
, environ
[i
]);
5879 esize
= envsize
+ EXTRASIZE
;
5880 env
= (char **)vim_realloc((char *)environ
, esize
* sizeof (*env
));
5888 # ifdef USE_VIMPTY_GETENV
5890 vimpty_getenv(string
)
5891 const char_u
*string
;
5899 i
= findenv((char *)string
);
5904 p
= vim_strchr((char_u
*)environ
[i
], '=');
5909 #endif /* !defined(HAVE_SETENV) && !defined(HAVE_PUTENV) */
5911 #if defined(FEAT_EVAL) || defined(FEAT_SPELL) || defined(PROTO)
5913 * Return 0 for not writable, 1 for writable file, 2 for a dir which we have
5914 * rights to write into.
5921 #if defined(UNIX) || defined(VMS)
5925 #if defined(UNIX) || defined(VMS)
5926 perm
= mch_getperm(fname
);
5928 #ifndef MACOS_CLASSIC /* TODO: get either mch_writable or mch_access */
5931 mch_writable(fname
) &&
5933 # if defined(UNIX) || defined(VMS)
5937 mch_access((char *)fname
, W_OK
) == 0
5942 if (mch_isdir(fname
))
5950 * Print an error message with one or two "%s" and one or two string arguments.
5951 * This is not in message.c to avoid a warning for prototypes.
5955 char_u
*s
, *a1
, *a2
;
5958 return TRUE
; /* no error messages at the moment */
5959 #ifdef HAVE_STDARG_H
5960 vim_snprintf((char *)IObuff
, IOSIZE
, (char *)s
, a1
, a2
);
5962 vim_snprintf((char *)IObuff
, IOSIZE
, (char *)s
, (long_u
)a1
, (long_u
)a2
);
5964 return emsg(IObuff
);
5968 * Print an error message with one "%ld" and one long int argument.
5969 * This is not in message.c to avoid a warning for prototypes.
5977 return TRUE
; /* no error messages at the moment */
5978 vim_snprintf((char *)IObuff
, IOSIZE
, (char *)s
, n
);
5979 return emsg(IObuff
);