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 in Insert mode, restarting Insert
511 * mode or when in Visual mode and 'selection' isn't "old" */
512 if ((State
& INSERT
) || restart_edit
514 || (VIsual_active
&& *p_sel
!= 'o')
517 curwin
->w_cursor
.col
= len
;
520 curwin
->w_cursor
.col
= len
- 1;
522 /* prevent cursor from moving on the trail byte */
529 #ifdef FEAT_VIRTUALEDIT
530 /* If virtual editing is on, we can leave the cursor on the old position,
531 * only we must set it to virtual. But don't do it when at the end of the
533 if (oldcol
== MAXCOL
)
534 curwin
->w_cursor
.coladd
= 0;
535 else if (ve_flags
== VE_ALL
)
536 curwin
->w_cursor
.coladd
= oldcol
- curwin
->w_cursor
.col
;
541 * make sure curwin->w_cursor in on a valid character
550 #if defined(FEAT_TEXTOBJ) || defined(PROTO)
552 * Make sure curwin->w_cursor is not on the NUL at the end of the line.
553 * Allow it when in Visual mode and 'selection' is not "old".
558 if (curwin
->w_cursor
.col
> 0
560 && (!VIsual_active
|| *p_sel
== 'o')
562 && gchar_cursor() == NUL
)
563 --curwin
->w_cursor
.col
;
568 * When curwin->w_leftcol has changed, adjust the cursor position.
569 * Return TRUE if the cursor was moved.
578 changed_cline_bef_curs();
579 lastcol
= curwin
->w_leftcol
+ W_WIDTH(curwin
) - curwin_col_off() - 1;
583 * If the cursor is right or left of the screen, move it to last or first
586 if (curwin
->w_virtcol
> (colnr_T
)(lastcol
- p_siso
))
589 coladvance((colnr_T
)(lastcol
- p_siso
));
591 else if (curwin
->w_virtcol
< curwin
->w_leftcol
+ p_siso
)
594 (void)coladvance((colnr_T
)(curwin
->w_leftcol
+ p_siso
));
598 * If the start of the character under the cursor is not on the screen,
599 * advance the cursor one more char. If this fails (last char of the
600 * line) adjust the scrolling.
602 getvvcol(curwin
, &curwin
->w_cursor
, &s
, NULL
, &e
);
603 if (e
> (colnr_T
)lastcol
)
608 else if (s
< curwin
->w_leftcol
)
611 if (coladvance(e
+ 1) == FAIL
) /* there isn't another character */
613 curwin
->w_leftcol
= s
; /* adjust w_leftcol instead */
614 changed_cline_bef_curs();
619 curwin
->w_set_curswant
= TRUE
;
620 redraw_later(NOT_VALID
);
624 /**********************************************************************
625 * Various routines dealing with allocation and deallocation of memory.
628 #if defined(MEM_PROFILE) || defined(PROTO)
630 # define MEM_SIZES 8200
631 static long_u mem_allocs
[MEM_SIZES
];
632 static long_u mem_frees
[MEM_SIZES
];
633 static long_u mem_allocated
;
634 static long_u mem_freed
;
635 static long_u mem_peak
;
636 static long_u num_alloc
;
637 static long_u num_freed
;
639 static void mem_pre_alloc_s
__ARGS((size_t *sizep
));
640 static void mem_pre_alloc_l
__ARGS((long_u
*sizep
));
641 static void mem_post_alloc
__ARGS((void **pp
, size_t size
));
642 static void mem_pre_free
__ARGS((void **pp
));
645 mem_pre_alloc_s(sizep
)
648 *sizep
+= sizeof(size_t);
652 mem_pre_alloc_l(sizep
)
655 *sizep
+= sizeof(size_t);
659 mem_post_alloc(pp
, size
)
665 size
-= sizeof(size_t);
666 *(long_u
*)*pp
= size
;
667 if (size
<= MEM_SIZES
-1)
668 mem_allocs
[size
-1]++;
670 mem_allocs
[MEM_SIZES
-1]++;
671 mem_allocated
+= size
;
672 if (mem_allocated
- mem_freed
> mem_peak
)
673 mem_peak
= mem_allocated
- mem_freed
;
675 *pp
= (void *)((char *)*pp
+ sizeof(size_t));
684 *pp
= (void *)((char *)*pp
- sizeof(size_t));
685 size
= *(size_t *)*pp
;
686 if (size
<= MEM_SIZES
-1)
689 mem_frees
[MEM_SIZES
-1]++;
695 * called on exit via atexit()
698 vim_mem_profile_dump()
704 for (i
= 0; i
< MEM_SIZES
- 1; i
++)
706 if (mem_allocs
[i
] || mem_frees
[i
])
708 if (mem_frees
[i
] > mem_allocs
[i
])
709 printf("\r\n%s", _("ERROR: "));
710 printf("[%4d / %4lu-%-4lu] ", i
+ 1, mem_allocs
[i
], mem_frees
[i
]);
724 if (mem_frees
[i
] > mem_allocs
[i
])
725 printf(_("ERROR: "));
726 printf("[>%d / %4lu-%-4lu]", i
, mem_allocs
[i
], mem_frees
[i
]);
729 printf(_("\n[bytes] total alloc-freed %lu-%lu, in use %lu, peak use %lu\n"),
730 mem_allocated
, mem_freed
, mem_allocated
- mem_freed
, mem_peak
);
731 printf(_("[calls] total re/malloc()'s %lu, total free()'s %lu\n\n"),
732 num_alloc
, num_freed
);
735 #endif /* MEM_PROFILE */
738 * Some memory is reserved for error messages and for being able to
739 * call mf_release_all(), which needs some memory for mf_trans_add().
741 #if defined(MSDOS) && !defined(DJGPP)
743 # define KEEP_ROOM 8192L
745 # define KEEP_ROOM (2 * 8192L)
749 * Note: if unsinged is 16 bits we can only allocate up to 64K with alloc().
750 * Use lalloc for larger blocks.
756 return (lalloc((long_u
)size
, TRUE
));
760 * Allocate memory and set all bytes to zero.
768 p
= (lalloc((long_u
)size
, TRUE
));
770 (void)vim_memset(p
, 0, (size_t)size
);
775 * alloc() with check for maximum line length
781 #if !defined(UNIX) && !defined(__EMX__)
782 if (sizeof(int) == 2 && size
> 0x7fff)
784 /* Don't hide this message */
786 EMSG(_("E340: Line is becoming too long"));
790 return (lalloc((long_u
)size
, TRUE
));
794 * Allocate memory like lalloc() and set all bytes to zero.
797 lalloc_clear(size
, message
)
803 p
= (lalloc(size
, message
));
805 (void)vim_memset(p
, 0, (size_t)size
);
810 * Low level memory allocation function.
811 * This is used often, KEEP IT FAST!
814 lalloc(size
, message
)
818 char_u
*p
; /* pointer to new storage space */
819 static int releasing
= FALSE
; /* don't do mf_release_all() recursive */
821 #if defined(HAVE_AVAIL_MEM) && !defined(SMALL_MEM)
822 static long_u allocated
= 0; /* allocated since last avail check */
825 /* Safety check for allocating zero bytes */
828 /* Don't hide this message */
830 EMSGN(_("E341: Internal error: lalloc(%ld, )"), size
);
835 mem_pre_alloc_l(&size
);
838 #if defined(MSDOS) && !defined(DJGPP)
839 if (size
>= 0xfff0) /* in MSDOS we can't deal with >64K blocks */
845 * Loop when out of memory: Try to release some memfile blocks and
846 * if some blocks are released call malloc again.
851 * Handle three kind of systems:
852 * 1. No check for available memory: Just return.
853 * 2. Slow check for available memory: call mch_avail_mem() after
854 * allocating KEEP_ROOM amount of memory.
855 * 3. Strict check for available memory: call mch_avail_mem()
857 if ((p
= (char_u
*)malloc((size_t)size
)) != NULL
)
859 #ifndef HAVE_AVAIL_MEM
860 /* 1. No check for available memory: Just return. */
864 /* 2. Slow check for available memory: call mch_avail_mem() after
865 * allocating (KEEP_ROOM / 2) amount of memory. */
867 if (allocated
< KEEP_ROOM
/ 2)
871 /* 3. check for available memory: call mch_avail_mem() */
872 if (mch_avail_mem(TRUE
) < KEEP_ROOM
&& !releasing
)
874 vim_free((char *)p
); /* System is low... no go! */
882 * Remember that mf_release_all() is being called to avoid an endless
883 * loop, because mf_release_all() may call alloc() recursively.
889 clear_sb_text(); /* free any scrollback text */
890 try_again
= mf_release_all(); /* release as many blocks as possible */
892 try_again
|= garbage_collect(); /* cleanup recursive lists/dicts */
900 if (message
&& p
== NULL
)
901 do_outofmem_msg(size
);
905 mem_post_alloc((void **)&p
, (size_t)size
);
910 #if defined(MEM_PROFILE) || defined(PROTO)
912 * realloc() with memory profiling.
915 mem_realloc(ptr
, size
)
922 mem_pre_alloc_s(&size
);
924 p
= realloc(ptr
, size
);
926 mem_post_alloc(&p
, size
);
933 * Avoid repeating the error message many times (they take 1 second each).
934 * Did_outofmem_msg is reset when a character is read.
937 do_outofmem_msg(size
)
940 if (!did_outofmem_msg
)
942 /* Don't hide this message */
944 EMSGN(_("E342: Out of memory! (allocating %lu bytes)"), size
);
945 did_outofmem_msg
= TRUE
;
949 #if defined(EXITFREE) || defined(PROTO)
951 # if defined(FEAT_SEARCHPATH)
952 static void free_findfile
__ARGS((void));
956 * Free everything that we allocated.
957 * Can be used to detect memory leaks, e.g., with ccmalloc.
958 * NOTE: This is tricky! Things are freed that functions depend on. Don't be
959 * surprised if Vim crashes...
960 * Some things can't be freed, esp. things local to a library function.
965 buf_T
*buf
, *nextbuf
;
966 static int entered
= FALSE
;
969 /* When we cause a crash here it is caught and Vim tries to exit cleanly.
970 * Don't try freeing everything again. */
975 ++autocmd_block
; /* don't want to trigger autocommands here */
978 /* close all tabs and windows */
979 if (first_tabpage
->tp_next
!= NULL
)
980 do_cmdline_cmd((char_u
*)"tabonly!");
981 if (firstwin
!= lastwin
)
982 do_cmdline_cmd((char_u
*)"only!");
985 # if defined(FEAT_SPELL)
986 /* Free all spell info. */
990 # if defined(FEAT_USR_CMDS)
991 /* Clear user commands (before deleting buffers). */
997 do_cmdline_cmd((char_u
*)"aunmenu *");
1000 /* Clear mappings, abbreviations, breakpoints. */
1001 do_cmdline_cmd((char_u
*)"mapclear");
1002 do_cmdline_cmd((char_u
*)"mapclear!");
1003 do_cmdline_cmd((char_u
*)"abclear");
1004 # if defined(FEAT_EVAL)
1005 do_cmdline_cmd((char_u
*)"breakdel *");
1007 # if defined(FEAT_PROFILE)
1008 do_cmdline_cmd((char_u
*)"profdel *");
1014 # if defined(FEAT_SEARCHPATH)
1018 /* Obviously named calls. */
1019 # if defined(FEAT_AUTOCMD)
1020 free_all_autocmds();
1025 alist_clear(&global_alist
);
1027 free_search_patterns();
1030 free_prev_shellcmd();
1031 free_regexp_stuff();
1034 set_expr_line(NULL
);
1036 clear_sb_text(); /* free any scrollback text */
1038 /* Free some global vars. */
1040 vim_free(clip_exclude_prog
);
1041 vim_free(last_cmdline
);
1042 vim_free(new_last_cmdline
);
1043 set_keep_msg(NULL
, 0);
1044 vim_free(ff_expand_buffer
);
1046 /* Clear cmdline history. */
1050 #ifdef FEAT_QUICKFIX
1052 /* Free all location lists */
1053 FOR_ALL_WINDOWS(win
)
1057 /* Close all script inputs. */
1058 close_all_scripts();
1060 #if defined(FEAT_WINDOWS)
1061 /* Destroy all windows. Must come before freeing buffers. */
1065 /* Free all buffers. */
1066 for (buf
= firstbuf
; buf
!= NULL
; )
1068 nextbuf
= buf
->b_next
;
1069 close_buffer(NULL
, buf
, DOBUF_WIPE
);
1071 buf
= nextbuf
; /* didn't work, try next one */
1080 /* Clear registers. */
1085 #if defined(FEAT_CLIENTSERVER) && defined(FEAT_X11)
1086 vim_free(serverDelayedStartName
);
1089 /* highlight info */
1092 reset_last_sourcing();
1095 free_tabpage(first_tabpage
);
1096 first_tabpage
= NULL
;
1100 /* Machine-specific free. */
1104 /* message history */
1106 if (delete_first_msg() == FAIL
)
1115 /* screenlines (can't display anything now!) */
1118 #if defined(USE_XSMP)
1132 * copy a string into newly allocated memory
1141 len
= (unsigned)STRLEN(string
) + 1;
1144 mch_memmove(p
, string
, (size_t)len
);
1149 vim_strnsave(string
, len
)
1155 p
= alloc((unsigned)(len
+ 1));
1158 STRNCPY(p
, string
, len
);
1165 * Same as vim_strsave(), but any characters found in esc_chars are preceded
1169 vim_strsave_escaped(string
, esc_chars
)
1173 return vim_strsave_escaped_ext(string
, esc_chars
, '\\', FALSE
);
1177 * Same as vim_strsave_escaped(), but when "bsl" is TRUE also escape
1178 * characters where rem_backslash() would remove the backslash.
1179 * Escape the characters with "cc".
1182 vim_strsave_escaped_ext(string
, esc_chars
, cc
, bsl
)
1190 char_u
*escaped_string
;
1197 * First count the number of backslashes required.
1198 * Then allocate the memory and insert them.
1200 length
= 1; /* count the trailing NUL */
1201 for (p
= string
; *p
; p
++)
1204 if (has_mbyte
&& (l
= (*mb_ptr2len
)(p
)) > 1)
1206 length
+= l
; /* count a multibyte char */
1211 if (vim_strchr(esc_chars
, *p
) != NULL
|| (bsl
&& rem_backslash(p
)))
1212 ++length
; /* count a backslash */
1213 ++length
; /* count an ordinary char */
1215 escaped_string
= alloc(length
);
1216 if (escaped_string
!= NULL
)
1218 p2
= escaped_string
;
1219 for (p
= string
; *p
; p
++)
1222 if (has_mbyte
&& (l
= (*mb_ptr2len
)(p
)) > 1)
1224 mch_memmove(p2
, p
, (size_t)l
);
1226 p
+= l
- 1; /* skip multibyte char */
1230 if (vim_strchr(esc_chars
, *p
) != NULL
|| (bsl
&& rem_backslash(p
)))
1236 return escaped_string
;
1239 #if defined(FEAT_EVAL) || defined(PROTO)
1241 * Escape "string" for use as a shell argument with system().
1242 * This uses single quotes, except when we know we need to use double qoutes
1243 * (MS-DOS and MS-Windows without 'shellslash' set).
1244 * Returns the result in allocated memory, NULL if we have run out.
1247 vim_strsave_shellescape(string
)
1253 char_u
*escaped_string
;
1255 /* First count the number of extra bytes required. */
1256 length
= (unsigned)STRLEN(string
) + 3; /* two quotes and a trailing NUL */
1257 for (p
= string
; *p
!= NUL
; mb_ptr_adv(p
))
1259 # if defined(WIN32) || defined(WIN16) || defined(DOS)
1263 ++length
; /* " -> "" */
1268 length
+= 3; /* ' => '\'' */
1271 /* Allocate memory for the result and fill it. */
1272 escaped_string
= alloc(length
);
1273 if (escaped_string
!= NULL
)
1277 /* add opening quote */
1278 # if defined(WIN32) || defined(WIN16) || defined(DOS)
1285 for (p
= string
; *p
!= NUL
; )
1287 # if defined(WIN32) || defined(WIN16) || defined(DOS)
1313 /* add terminating quote and finish with a NUL */
1314 # if defined(WIN32) || defined(WIN16) || defined(DOS)
1323 return escaped_string
;
1328 * Like vim_strsave(), but make all characters uppercase.
1329 * This uses ASCII lower-to-upper case translation, language independent.
1332 vim_strsave_up(string
)
1337 p1
= vim_strsave(string
);
1343 * Like vim_strnsave(), but make all characters uppercase.
1344 * This uses ASCII lower-to-upper case translation, language independent.
1347 vim_strnsave_up(string
, len
)
1353 p1
= vim_strnsave(string
, len
);
1359 * ASCII lower-to-upper case translation, language independent.
1371 while ((c
= *p2
) != NUL
)
1373 *p2
++ = isalpha(c
) ? toupper(c
) : c
;
1375 *p2
++ = (c
< 'a' || c
> 'z') ? c
: (c
- 0x20);
1380 #if defined(FEAT_EVAL) || defined(FEAT_SPELL) || defined(PROTO)
1382 * Make string "s" all upper-case and return it in allocated memory.
1383 * Handles multi-byte characters as well as possible.
1384 * Returns NULL when out of memory.
1393 res
= p
= vim_strsave(orig
);
1407 c
= utf_ptr2char(p
);
1408 uc
= utf_toupper(c
);
1410 /* Reallocate string when byte count changes. This is rare,
1411 * thus it's OK to do another malloc()/free(). */
1413 nl
= utf_char2len(uc
);
1416 s
= alloc((unsigned)STRLEN(res
) + 1 + nl
- l
);
1419 mch_memmove(s
, res
, p
- res
);
1420 STRCPY(s
+ (p
- res
) + nl
, p
+ l
);
1426 utf_char2bytes(uc
, p
);
1429 else if (has_mbyte
&& (l
= (*mb_ptr2len
)(p
)) > 1)
1430 p
+= l
; /* skip multi-byte character */
1434 *p
= TOUPPER_LOC(*p
); /* note that toupper() can be a macro */
1444 * copy a space a number of times
1447 copy_spaces(ptr
, count
)
1458 #if defined(FEAT_VISUALEXTRA) || defined(PROTO)
1460 * Copy a character a number of times.
1461 * Does not work for multi-byte charactes!
1464 copy_chars(ptr
, count
, c
)
1478 * delete spaces at the end of a string
1481 del_trailing_spaces(ptr
)
1486 q
= ptr
+ STRLEN(ptr
);
1487 while (--q
> ptr
&& vim_iswhite(q
[0]) && q
[-1] != '\\' && q
[-1] != Ctrl_V
)
1492 * Like strncpy(), but always terminate the result with one NUL.
1493 * "to" must be "len + 1" long!
1496 vim_strncpy(to
, from
, len
)
1501 STRNCPY(to
, from
, len
);
1506 * Isolate one part of a string option where parts are separated with
1508 * The part is copied into "buf[maxlen]".
1509 * "*option" is advanced to the next part.
1510 * The length is returned.
1513 copy_option_part(option
, buf
, maxlen
, sep_chars
)
1520 char_u
*p
= *option
;
1522 /* skip '.' at start of option part, for 'suffixes' */
1525 while (*p
!= NUL
&& vim_strchr((char_u
*)sep_chars
, *p
) == NULL
)
1528 * Skip backslash before a separator character and space.
1530 if (p
[0] == '\\' && vim_strchr((char_u
*)sep_chars
, p
[1]) != NULL
)
1532 if (len
< maxlen
- 1)
1538 if (*p
!= NUL
&& *p
!= ',') /* skip non-standard separator */
1540 p
= skip_to_option_part(p
); /* p points to next file name */
1547 * Replacement for free() that ignores NULL pointers.
1548 * Also skip free() when exiting for sure, this helps when we caught a deadly
1549 * signal that was caused by a crash in free().
1555 if (x
!= NULL
&& !really_exiting
)
1566 vim_memset(ptr
, c
, size
)
1581 * Return zero when "b1" and "b2" are the same for "len" bytes.
1582 * Return non-zero otherwise.
1585 vim_memcmp(b1
, b2
, len
)
1590 char_u
*p1
= (char_u
*)b1
, *p2
= (char_u
*)b2
;
1592 for ( ; len
> 0; --len
)
1605 * Version of memmove() that handles overlapping source and destination.
1606 * For systems that don't have a function that is guaranteed to do that (SYSV).
1609 mch_memmove(dst_arg
, src_arg
, len
)
1610 void *src_arg
, *dst_arg
;
1614 * A void doesn't have a size, we use char pointers.
1616 char *dst
= dst_arg
, *src
= src_arg
;
1618 /* overlap, copy backwards */
1619 if (dst
> src
&& dst
< src
+ len
)
1626 else /* copy forwards */
1632 #if (!defined(HAVE_STRCASECMP) && !defined(HAVE_STRICMP)) || defined(PROTO)
1634 * Compare two strings, ignoring case, using current locale.
1635 * Doesn't work for multi-byte characters.
1636 * return 0 for match, < 0 for smaller, > 0 for bigger
1647 i
= (int)TOLOWER_LOC(*s1
) - (int)TOLOWER_LOC(*s2
);
1649 return i
; /* this character different */
1651 break; /* strings match until NUL */
1655 return 0; /* strings match */
1659 #if (!defined(HAVE_STRNCASECMP) && !defined(HAVE_STRNICMP)) || defined(PROTO)
1661 * Compare two strings, for length "len", ignoring case, using current locale.
1662 * Doesn't work for multi-byte characters.
1663 * return 0 for match, < 0 for smaller, > 0 for bigger
1666 vim_strnicmp(s1
, s2
, len
)
1675 i
= (int)TOLOWER_LOC(*s1
) - (int)TOLOWER_LOC(*s2
);
1677 return i
; /* this character different */
1679 break; /* strings match until NUL */
1684 return 0; /* strings match */
1688 #if 0 /* currently not used */
1690 * Check if string "s2" appears somewhere in "s1" while ignoring case.
1691 * Return NULL if not, a pointer to the first occurrence if it does.
1699 int len
= STRLEN(s2
);
1700 char_u
*end
= s1
+ STRLEN(s1
) - len
;
1702 for (p
= s1
; p
<= end
; ++p
)
1703 if (STRNICMP(p
, s2
, len
) == 0)
1710 * Version of strchr() and strrchr() that handle unsigned char strings
1711 * with characters from 128 to 255 correctly. It also doesn't return a
1712 * pointer to the NUL at the end of the string.
1715 vim_strchr(string
, c
)
1724 if (enc_utf8
&& c
>= 0x80)
1728 if (utf_ptr2char(p
) == c
)
1730 p
+= (*mb_ptr2len
)(p
);
1734 if (enc_dbcs
!= 0 && c
> 255)
1738 c
= ((unsigned)c
>> 8) & 0xff;
1739 while ((b
= *p
) != NUL
)
1741 if (b
== c
&& p
[1] == n2
)
1743 p
+= (*mb_ptr2len
)(p
);
1749 while ((b
= *p
) != NUL
)
1753 p
+= (*mb_ptr2len
)(p
);
1758 while ((b
= *p
) != NUL
)
1768 * Version of strchr() that only works for bytes and handles unsigned char
1769 * strings with characters above 128 correctly. It also doesn't return a
1770 * pointer to the NUL at the end of the string.
1773 vim_strbyte(string
, c
)
1789 * Search for last occurrence of "c" in "string".
1790 * Return NULL if not found.
1791 * Does not handle multi-byte char for "c"!
1794 vim_strrchr(string
, c
)
1798 char_u
*retval
= NULL
;
1811 * Vim's version of strpbrk(), in case it's missing.
1812 * Don't generate a prototype for this, causes problems when it's not used.
1815 # ifndef HAVE_STRPBRK
1820 vim_strpbrk(s
, charset
)
1826 if (vim_strchr(charset
, *s
) != NULL
)
1836 * Vim has its own isspace() function, because on some machines isspace()
1837 * can't handle characters above 128.
1843 return ((x
>= 9 && x
<= 13) || x
== ' ');
1846 /************************************************************************
1847 * Functions for handling growing arrays.
1851 * Clear an allocated growing array.
1857 vim_free(gap
->ga_data
);
1862 * Clear a growing array that contains a list of strings.
1865 ga_clear_strings(gap
)
1870 for (i
= 0; i
< gap
->ga_len
; ++i
)
1871 vim_free(((char_u
**)(gap
->ga_data
))[i
]);
1876 * Initialize a growing array. Don't forget to set ga_itemsize and
1877 * ga_growsize! Or use ga_init2().
1883 gap
->ga_data
= NULL
;
1889 ga_init2(gap
, itemsize
, growsize
)
1895 gap
->ga_itemsize
= itemsize
;
1896 gap
->ga_growsize
= growsize
;
1900 * Make room in growing array "gap" for at least "n" items.
1901 * Return FAIL for failure, OK otherwise.
1911 if (gap
->ga_maxlen
- gap
->ga_len
< n
)
1913 if (n
< gap
->ga_growsize
)
1914 n
= gap
->ga_growsize
;
1915 len
= gap
->ga_itemsize
* (gap
->ga_len
+ n
);
1916 pp
= alloc_clear((unsigned)len
);
1919 gap
->ga_maxlen
= gap
->ga_len
+ n
;
1920 if (gap
->ga_data
!= NULL
)
1922 mch_memmove(pp
, gap
->ga_data
,
1923 (size_t)(gap
->ga_itemsize
* gap
->ga_len
));
1924 vim_free(gap
->ga_data
);
1932 * Concatenate a string to a growarray which contains characters.
1933 * Note: Does NOT copy the NUL at the end!
1940 int len
= (int)STRLEN(s
);
1942 if (ga_grow(gap
, len
) == OK
)
1944 mch_memmove((char *)gap
->ga_data
+ gap
->ga_len
, s
, (size_t)len
);
1950 * Append one byte to a growarray which contains bytes.
1957 if (ga_grow(gap
, 1) == OK
)
1959 *((char *)gap
->ga_data
+ gap
->ga_len
) = c
;
1964 /************************************************************************
1965 * functions that use lookup tables for various things, generally to do with
1966 * special key codes.
1970 * Some useful tables.
1973 static struct modmasktable
1975 short mod_mask
; /* Bit-mask for particular key modifier */
1976 short mod_flag
; /* Bit(s) for particular key modifier */
1977 char_u name
; /* Single letter name of modifier */
1978 } mod_mask_table
[] =
1980 {MOD_MASK_ALT
, MOD_MASK_ALT
, (char_u
)'M'},
1981 {MOD_MASK_META
, MOD_MASK_META
, (char_u
)'T'},
1982 {MOD_MASK_CTRL
, MOD_MASK_CTRL
, (char_u
)'C'},
1983 {MOD_MASK_SHIFT
, MOD_MASK_SHIFT
, (char_u
)'S'},
1984 {MOD_MASK_MULTI_CLICK
, MOD_MASK_2CLICK
, (char_u
)'2'},
1985 {MOD_MASK_MULTI_CLICK
, MOD_MASK_3CLICK
, (char_u
)'3'},
1986 {MOD_MASK_MULTI_CLICK
, MOD_MASK_4CLICK
, (char_u
)'4'},
1988 {MOD_MASK_CMD
, MOD_MASK_CMD
, (char_u
)'D'},
1990 /* 'A' must be the last one */
1991 {MOD_MASK_ALT
, MOD_MASK_ALT
, (char_u
)'A'},
1996 * Shifted key terminal codes and their unshifted equivalent.
1997 * Don't add mouse codes here, they are handled separately!
1999 #define MOD_KEYS_ENTRY_SIZE 5
2001 static char_u modifier_keys_table
[] =
2003 /* mod mask with modifier without modifier */
2004 MOD_MASK_SHIFT
, '&', '9', '@', '1', /* begin */
2005 MOD_MASK_SHIFT
, '&', '0', '@', '2', /* cancel */
2006 MOD_MASK_SHIFT
, '*', '1', '@', '4', /* command */
2007 MOD_MASK_SHIFT
, '*', '2', '@', '5', /* copy */
2008 MOD_MASK_SHIFT
, '*', '3', '@', '6', /* create */
2009 MOD_MASK_SHIFT
, '*', '4', 'k', 'D', /* delete char */
2010 MOD_MASK_SHIFT
, '*', '5', 'k', 'L', /* delete line */
2011 MOD_MASK_SHIFT
, '*', '7', '@', '7', /* end */
2012 MOD_MASK_CTRL
, KS_EXTRA
, (int)KE_C_END
, '@', '7', /* end */
2013 MOD_MASK_SHIFT
, '*', '9', '@', '9', /* exit */
2014 MOD_MASK_SHIFT
, '*', '0', '@', '0', /* find */
2015 MOD_MASK_SHIFT
, '#', '1', '%', '1', /* help */
2016 MOD_MASK_SHIFT
, '#', '2', 'k', 'h', /* home */
2017 MOD_MASK_CTRL
, KS_EXTRA
, (int)KE_C_HOME
, 'k', 'h', /* home */
2018 MOD_MASK_SHIFT
, '#', '3', 'k', 'I', /* insert */
2019 MOD_MASK_SHIFT
, '#', '4', 'k', 'l', /* left arrow */
2020 MOD_MASK_CTRL
, KS_EXTRA
, (int)KE_C_LEFT
, 'k', 'l', /* left arrow */
2021 MOD_MASK_SHIFT
, '%', 'a', '%', '3', /* message */
2022 MOD_MASK_SHIFT
, '%', 'b', '%', '4', /* move */
2023 MOD_MASK_SHIFT
, '%', 'c', '%', '5', /* next */
2024 MOD_MASK_SHIFT
, '%', 'd', '%', '7', /* options */
2025 MOD_MASK_SHIFT
, '%', 'e', '%', '8', /* previous */
2026 MOD_MASK_SHIFT
, '%', 'f', '%', '9', /* print */
2027 MOD_MASK_SHIFT
, '%', 'g', '%', '0', /* redo */
2028 MOD_MASK_SHIFT
, '%', 'h', '&', '3', /* replace */
2029 MOD_MASK_SHIFT
, '%', 'i', 'k', 'r', /* right arr. */
2030 MOD_MASK_CTRL
, KS_EXTRA
, (int)KE_C_RIGHT
, 'k', 'r', /* right arr. */
2031 MOD_MASK_SHIFT
, '%', 'j', '&', '5', /* resume */
2032 MOD_MASK_SHIFT
, '!', '1', '&', '6', /* save */
2033 MOD_MASK_SHIFT
, '!', '2', '&', '7', /* suspend */
2034 MOD_MASK_SHIFT
, '!', '3', '&', '8', /* undo */
2035 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_UP
, 'k', 'u', /* up arrow */
2036 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_DOWN
, 'k', 'd', /* down arrow */
2039 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_XF1
, KS_EXTRA
, (int)KE_XF1
,
2040 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_XF2
, KS_EXTRA
, (int)KE_XF2
,
2041 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_XF3
, KS_EXTRA
, (int)KE_XF3
,
2042 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_XF4
, KS_EXTRA
, (int)KE_XF4
,
2044 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F1
, 'k', '1', /* F1 */
2045 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F2
, 'k', '2',
2046 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F3
, 'k', '3',
2047 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F4
, 'k', '4',
2048 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F5
, 'k', '5',
2049 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F6
, 'k', '6',
2050 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F7
, 'k', '7',
2051 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F8
, 'k', '8',
2052 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F9
, 'k', '9',
2053 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F10
, 'k', ';', /* F10 */
2055 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F11
, 'F', '1',
2056 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F12
, 'F', '2',
2057 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F13
, 'F', '3',
2058 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F14
, 'F', '4',
2059 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F15
, 'F', '5',
2060 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F16
, 'F', '6',
2061 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F17
, 'F', '7',
2062 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F18
, 'F', '8',
2063 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F19
, 'F', '9',
2064 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F20
, 'F', 'A',
2066 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F21
, 'F', 'B',
2067 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F22
, 'F', 'C',
2068 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F23
, 'F', 'D',
2069 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F24
, 'F', 'E',
2070 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F25
, 'F', 'F',
2071 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F26
, 'F', 'G',
2072 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F27
, 'F', 'H',
2073 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F28
, 'F', 'I',
2074 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F29
, 'F', 'J',
2075 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F30
, 'F', 'K',
2077 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F31
, 'F', 'L',
2078 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F32
, 'F', 'M',
2079 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F33
, 'F', 'N',
2080 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F34
, 'F', 'O',
2081 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F35
, 'F', 'P',
2082 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F36
, 'F', 'Q',
2083 MOD_MASK_SHIFT
, KS_EXTRA
, (int)KE_S_F37
, 'F', 'R',
2085 /* TAB pseudo code*/
2086 MOD_MASK_SHIFT
, 'k', 'B', KS_EXTRA
, (int)KE_TAB
,
2091 static struct key_name_entry
2093 int key
; /* Special key code or ascii value */
2094 char_u
*name
; /* Name of key */
2095 } key_names_table
[] =
2097 {' ', (char_u
*)"Space"},
2098 {TAB
, (char_u
*)"Tab"},
2099 {K_TAB
, (char_u
*)"Tab"},
2100 {NL
, (char_u
*)"NL"},
2101 {NL
, (char_u
*)"NewLine"}, /* Alternative name */
2102 {NL
, (char_u
*)"LineFeed"}, /* Alternative name */
2103 {NL
, (char_u
*)"LF"}, /* Alternative name */
2104 {CAR
, (char_u
*)"CR"},
2105 {CAR
, (char_u
*)"Return"}, /* Alternative name */
2106 {CAR
, (char_u
*)"Enter"}, /* Alternative name */
2107 {K_BS
, (char_u
*)"BS"},
2108 {K_BS
, (char_u
*)"BackSpace"}, /* Alternative name */
2109 {ESC
, (char_u
*)"Esc"},
2110 {CSI
, (char_u
*)"CSI"},
2111 {K_CSI
, (char_u
*)"xCSI"},
2112 {'|', (char_u
*)"Bar"},
2113 {'\\', (char_u
*)"Bslash"},
2114 {K_DEL
, (char_u
*)"Del"},
2115 {K_DEL
, (char_u
*)"Delete"}, /* Alternative name */
2116 {K_KDEL
, (char_u
*)"kDel"},
2117 {K_UP
, (char_u
*)"Up"},
2118 {K_DOWN
, (char_u
*)"Down"},
2119 {K_LEFT
, (char_u
*)"Left"},
2120 {K_RIGHT
, (char_u
*)"Right"},
2121 {K_XUP
, (char_u
*)"xUp"},
2122 {K_XDOWN
, (char_u
*)"xDown"},
2123 {K_XLEFT
, (char_u
*)"xLeft"},
2124 {K_XRIGHT
, (char_u
*)"xRight"},
2126 {K_F1
, (char_u
*)"F1"},
2127 {K_F2
, (char_u
*)"F2"},
2128 {K_F3
, (char_u
*)"F3"},
2129 {K_F4
, (char_u
*)"F4"},
2130 {K_F5
, (char_u
*)"F5"},
2131 {K_F6
, (char_u
*)"F6"},
2132 {K_F7
, (char_u
*)"F7"},
2133 {K_F8
, (char_u
*)"F8"},
2134 {K_F9
, (char_u
*)"F9"},
2135 {K_F10
, (char_u
*)"F10"},
2137 {K_F11
, (char_u
*)"F11"},
2138 {K_F12
, (char_u
*)"F12"},
2139 {K_F13
, (char_u
*)"F13"},
2140 {K_F14
, (char_u
*)"F14"},
2141 {K_F15
, (char_u
*)"F15"},
2142 {K_F16
, (char_u
*)"F16"},
2143 {K_F17
, (char_u
*)"F17"},
2144 {K_F18
, (char_u
*)"F18"},
2145 {K_F19
, (char_u
*)"F19"},
2146 {K_F20
, (char_u
*)"F20"},
2148 {K_F21
, (char_u
*)"F21"},
2149 {K_F22
, (char_u
*)"F22"},
2150 {K_F23
, (char_u
*)"F23"},
2151 {K_F24
, (char_u
*)"F24"},
2152 {K_F25
, (char_u
*)"F25"},
2153 {K_F26
, (char_u
*)"F26"},
2154 {K_F27
, (char_u
*)"F27"},
2155 {K_F28
, (char_u
*)"F28"},
2156 {K_F29
, (char_u
*)"F29"},
2157 {K_F30
, (char_u
*)"F30"},
2159 {K_F31
, (char_u
*)"F31"},
2160 {K_F32
, (char_u
*)"F32"},
2161 {K_F33
, (char_u
*)"F33"},
2162 {K_F34
, (char_u
*)"F34"},
2163 {K_F35
, (char_u
*)"F35"},
2164 {K_F36
, (char_u
*)"F36"},
2165 {K_F37
, (char_u
*)"F37"},
2167 {K_XF1
, (char_u
*)"xF1"},
2168 {K_XF2
, (char_u
*)"xF2"},
2169 {K_XF3
, (char_u
*)"xF3"},
2170 {K_XF4
, (char_u
*)"xF4"},
2172 {K_HELP
, (char_u
*)"Help"},
2173 {K_UNDO
, (char_u
*)"Undo"},
2174 {K_INS
, (char_u
*)"Insert"},
2175 {K_INS
, (char_u
*)"Ins"}, /* Alternative name */
2176 {K_KINS
, (char_u
*)"kInsert"},
2177 {K_HOME
, (char_u
*)"Home"},
2178 {K_KHOME
, (char_u
*)"kHome"},
2179 {K_XHOME
, (char_u
*)"xHome"},
2180 {K_ZHOME
, (char_u
*)"zHome"},
2181 {K_END
, (char_u
*)"End"},
2182 {K_KEND
, (char_u
*)"kEnd"},
2183 {K_XEND
, (char_u
*)"xEnd"},
2184 {K_ZEND
, (char_u
*)"zEnd"},
2185 {K_PAGEUP
, (char_u
*)"PageUp"},
2186 {K_PAGEDOWN
, (char_u
*)"PageDown"},
2187 {K_KPAGEUP
, (char_u
*)"kPageUp"},
2188 {K_KPAGEDOWN
, (char_u
*)"kPageDown"},
2190 {K_KPLUS
, (char_u
*)"kPlus"},
2191 {K_KMINUS
, (char_u
*)"kMinus"},
2192 {K_KDIVIDE
, (char_u
*)"kDivide"},
2193 {K_KMULTIPLY
, (char_u
*)"kMultiply"},
2194 {K_KENTER
, (char_u
*)"kEnter"},
2195 {K_KPOINT
, (char_u
*)"kPoint"},
2197 {K_K0
, (char_u
*)"k0"},
2198 {K_K1
, (char_u
*)"k1"},
2199 {K_K2
, (char_u
*)"k2"},
2200 {K_K3
, (char_u
*)"k3"},
2201 {K_K4
, (char_u
*)"k4"},
2202 {K_K5
, (char_u
*)"k5"},
2203 {K_K6
, (char_u
*)"k6"},
2204 {K_K7
, (char_u
*)"k7"},
2205 {K_K8
, (char_u
*)"k8"},
2206 {K_K9
, (char_u
*)"k9"},
2208 {'<', (char_u
*)"lt"},
2210 {K_MOUSE
, (char_u
*)"Mouse"},
2211 {K_NETTERM_MOUSE
, (char_u
*)"NetMouse"},
2212 {K_DEC_MOUSE
, (char_u
*)"DecMouse"},
2213 {K_JSBTERM_MOUSE
, (char_u
*)"JsbMouse"},
2214 {K_PTERM_MOUSE
, (char_u
*)"PtermMouse"},
2215 {K_LEFTMOUSE
, (char_u
*)"LeftMouse"},
2216 {K_LEFTMOUSE_NM
, (char_u
*)"LeftMouseNM"},
2217 {K_LEFTDRAG
, (char_u
*)"LeftDrag"},
2218 {K_LEFTRELEASE
, (char_u
*)"LeftRelease"},
2219 {K_LEFTRELEASE_NM
, (char_u
*)"LeftReleaseNM"},
2220 {K_MIDDLEMOUSE
, (char_u
*)"MiddleMouse"},
2221 {K_MIDDLEDRAG
, (char_u
*)"MiddleDrag"},
2222 {K_MIDDLERELEASE
, (char_u
*)"MiddleRelease"},
2223 {K_RIGHTMOUSE
, (char_u
*)"RightMouse"},
2224 {K_RIGHTDRAG
, (char_u
*)"RightDrag"},
2225 {K_RIGHTRELEASE
, (char_u
*)"RightRelease"},
2226 {K_MOUSEDOWN
, (char_u
*)"MouseDown"},
2227 {K_MOUSEUP
, (char_u
*)"MouseUp"},
2228 {K_X1MOUSE
, (char_u
*)"X1Mouse"},
2229 {K_X1DRAG
, (char_u
*)"X1Drag"},
2230 {K_X1RELEASE
, (char_u
*)"X1Release"},
2231 {K_X2MOUSE
, (char_u
*)"X2Mouse"},
2232 {K_X2DRAG
, (char_u
*)"X2Drag"},
2233 {K_X2RELEASE
, (char_u
*)"X2Release"},
2234 {K_DROP
, (char_u
*)"Drop"},
2235 {K_ZERO
, (char_u
*)"Nul"},
2237 {K_SNR
, (char_u
*)"SNR"},
2239 {K_PLUG
, (char_u
*)"Plug"},
2243 #define KEY_NAMES_TABLE_LEN (sizeof(key_names_table) / sizeof(struct key_name_entry))
2246 static struct mousetable
2248 int pseudo_code
; /* Code for pseudo mouse event */
2249 int button
; /* Which mouse button is it? */
2250 int is_click
; /* Is it a mouse button click event? */
2251 int is_drag
; /* Is it a mouse drag event? */
2254 {(int)KE_LEFTMOUSE
, MOUSE_LEFT
, TRUE
, FALSE
},
2256 {(int)KE_LEFTMOUSE_NM
, MOUSE_LEFT
, TRUE
, FALSE
},
2258 {(int)KE_LEFTDRAG
, MOUSE_LEFT
, FALSE
, TRUE
},
2259 {(int)KE_LEFTRELEASE
, MOUSE_LEFT
, FALSE
, FALSE
},
2261 {(int)KE_LEFTRELEASE_NM
, MOUSE_LEFT
, FALSE
, FALSE
},
2263 {(int)KE_MIDDLEMOUSE
, MOUSE_MIDDLE
, TRUE
, FALSE
},
2264 {(int)KE_MIDDLEDRAG
, MOUSE_MIDDLE
, FALSE
, TRUE
},
2265 {(int)KE_MIDDLERELEASE
, MOUSE_MIDDLE
, FALSE
, FALSE
},
2266 {(int)KE_RIGHTMOUSE
, MOUSE_RIGHT
, TRUE
, FALSE
},
2267 {(int)KE_RIGHTDRAG
, MOUSE_RIGHT
, FALSE
, TRUE
},
2268 {(int)KE_RIGHTRELEASE
, MOUSE_RIGHT
, FALSE
, FALSE
},
2269 {(int)KE_X1MOUSE
, MOUSE_X1
, TRUE
, FALSE
},
2270 {(int)KE_X1DRAG
, MOUSE_X1
, FALSE
, TRUE
},
2271 {(int)KE_X1RELEASE
, MOUSE_X1
, FALSE
, FALSE
},
2272 {(int)KE_X2MOUSE
, MOUSE_X2
, TRUE
, FALSE
},
2273 {(int)KE_X2DRAG
, MOUSE_X2
, FALSE
, TRUE
},
2274 {(int)KE_X2RELEASE
, MOUSE_X2
, FALSE
, FALSE
},
2275 /* DRAG without CLICK */
2276 {(int)KE_IGNORE
, MOUSE_RELEASE
, FALSE
, TRUE
},
2277 /* RELEASE without CLICK */
2278 {(int)KE_IGNORE
, MOUSE_RELEASE
, FALSE
, FALSE
},
2281 #endif /* FEAT_MOUSE */
2284 * Return the modifier mask bit (MOD_MASK_*) which corresponds to the given
2285 * modifier name ('S' for Shift, 'C' for Ctrl etc).
2294 for (i
= 0; mod_mask_table
[i
].mod_mask
!= 0; i
++)
2295 if (c
== mod_mask_table
[i
].name
)
2296 return mod_mask_table
[i
].mod_flag
;
2301 * Check if if there is a special key code for "key" that includes the
2302 * modifiers specified.
2305 simplify_key(key
, modifiers
)
2313 if (*modifiers
& (MOD_MASK_SHIFT
| MOD_MASK_CTRL
| MOD_MASK_ALT
))
2315 /* TAB is a special case */
2316 if (key
== TAB
&& (*modifiers
& MOD_MASK_SHIFT
))
2318 *modifiers
&= ~MOD_MASK_SHIFT
;
2321 key0
= KEY2TERMCAP0(key
);
2322 key1
= KEY2TERMCAP1(key
);
2323 for (i
= 0; modifier_keys_table
[i
] != NUL
; i
+= MOD_KEYS_ENTRY_SIZE
)
2324 if (key0
== modifier_keys_table
[i
+ 3]
2325 && key1
== modifier_keys_table
[i
+ 4]
2326 && (*modifiers
& modifier_keys_table
[i
]))
2328 *modifiers
&= ~modifier_keys_table
[i
];
2329 return TERMCAP2KEY(modifier_keys_table
[i
+ 1],
2330 modifier_keys_table
[i
+ 2]);
2337 * Change <xHome> to <Home>, <xUp> to <Up>, etc.
2345 case K_XUP
: return K_UP
;
2346 case K_XDOWN
: return K_DOWN
;
2347 case K_XLEFT
: return K_LEFT
;
2348 case K_XRIGHT
: return K_RIGHT
;
2349 case K_XHOME
: return K_HOME
;
2350 case K_ZHOME
: return K_HOME
;
2351 case K_XEND
: return K_END
;
2352 case K_ZEND
: return K_END
;
2353 case K_XF1
: return K_F1
;
2354 case K_XF2
: return K_F2
;
2355 case K_XF3
: return K_F3
;
2356 case K_XF4
: return K_F4
;
2357 case K_S_XF1
: return K_S_F1
;
2358 case K_S_XF2
: return K_S_F2
;
2359 case K_S_XF3
: return K_S_F3
;
2360 case K_S_XF4
: return K_S_F4
;
2366 * Return a string which contains the name of the given key when the given
2367 * modifiers are down.
2370 get_special_key_name(c
, modifiers
)
2374 static char_u string
[MAX_KEY_NAME_LEN
+ 1];
2383 /* Key that stands for a normal character. */
2384 if (IS_SPECIAL(c
) && KEY2TERMCAP0(c
) == KS_KEY
)
2385 c
= KEY2TERMCAP1(c
);
2388 * Translate shifted special keys into unshifted keys and set modifier.
2389 * Same for CTRL and ALT modifiers.
2393 for (i
= 0; modifier_keys_table
[i
] != 0; i
+= MOD_KEYS_ENTRY_SIZE
)
2394 if ( KEY2TERMCAP0(c
) == (int)modifier_keys_table
[i
+ 1]
2395 && (int)KEY2TERMCAP1(c
) == (int)modifier_keys_table
[i
+ 2])
2397 modifiers
|= modifier_keys_table
[i
];
2398 c
= TERMCAP2KEY(modifier_keys_table
[i
+ 3],
2399 modifier_keys_table
[i
+ 4]);
2404 /* try to find the key in the special key table */
2405 table_idx
= find_special_key_in_table(c
);
2408 * When not a known special key, and not a printable character, try to
2409 * extract modifiers.
2413 && (*mb_char2len
)(c
) == 1
2418 && (!vim_isprintc(c
) || (c
& 0x7f) == ' ')
2422 modifiers
|= MOD_MASK_ALT
;
2423 /* try again, to find the un-alted key in the special key table */
2424 table_idx
= find_special_key_in_table(c
);
2426 if (table_idx
< 0 && !vim_isprintc(c
) && c
< ' ')
2433 modifiers
|= MOD_MASK_CTRL
;
2437 /* translate the modifier into a string */
2438 for (i
= 0; mod_mask_table
[i
].name
!= 'A'; i
++)
2439 if ((modifiers
& mod_mask_table
[i
].mod_mask
)
2440 == mod_mask_table
[i
].mod_flag
)
2442 string
[idx
++] = mod_mask_table
[i
].name
;
2443 string
[idx
++] = (char_u
)'-';
2446 if (table_idx
< 0) /* unknown special key, may output t_xx */
2450 string
[idx
++] = 't';
2451 string
[idx
++] = '_';
2452 string
[idx
++] = KEY2TERMCAP0(c
);
2453 string
[idx
++] = KEY2TERMCAP1(c
);
2455 /* Not a special key, only modifiers, output directly */
2459 if (has_mbyte
&& (*mb_char2len
)(c
) > 1)
2460 idx
+= (*mb_char2bytes
)(c
, string
+ idx
);
2463 if (vim_isprintc(c
))
2469 string
[idx
++] = *s
++;
2473 else /* use name of special key */
2475 STRCPY(string
+ idx
, key_names_table
[table_idx
].name
);
2476 idx
= (int)STRLEN(string
);
2478 string
[idx
++] = '>';
2484 * Try translating a <> name at (*srcp)[] to dst[].
2485 * Return the number of characters added to dst[], zero for no match.
2486 * If there is a match, srcp is advanced to after the <> name.
2487 * dst[] must be big enough to hold the result (up to six characters)!
2490 trans_special(srcp
, dst
, keycode
)
2493 int keycode
; /* prefer key code, e.g. K_DEL instead of DEL */
2499 key
= find_special_key(srcp
, &modifiers
, keycode
);
2503 /* Put the appropriate modifier in a string */
2506 dst
[dlen
++] = K_SPECIAL
;
2507 dst
[dlen
++] = KS_MODIFIER
;
2508 dst
[dlen
++] = modifiers
;
2511 if (IS_SPECIAL(key
))
2513 dst
[dlen
++] = K_SPECIAL
;
2514 dst
[dlen
++] = KEY2TERMCAP0(key
);
2515 dst
[dlen
++] = KEY2TERMCAP1(key
);
2518 else if (has_mbyte
&& !keycode
)
2519 dlen
+= (*mb_char2bytes
)(key
, dst
+ dlen
);
2522 dlen
= (int)(add_char2buf(key
, dst
+ dlen
) - dst
);
2530 * Try translating a <> name at (*srcp)[], return the key and modifiers.
2531 * srcp is advanced to after the <> name.
2532 * returns 0 if there is no match.
2535 find_special_key(srcp
, modp
, keycode
)
2538 int keycode
; /* prefer key code, e.g. K_DEL instead of DEL */
2541 char_u
*end_of_name
;
2553 /* Find end of modifier list */
2555 for (bp
= src
+ 1; *bp
== '-' || vim_isIDc(*bp
); bp
++)
2560 if (bp
[1] != NUL
&& bp
[2] == '>')
2561 ++bp
; /* anything accepted, like <C-?> */
2563 if (bp
[0] == 't' && bp
[1] == '_' && bp
[2] && bp
[3])
2564 bp
+= 3; /* skip t_xx, xx may be '-' or '>' */
2567 if (*bp
== '>') /* found matching '>' */
2569 end_of_name
= bp
+ 1;
2571 if (STRNICMP(src
+ 1, "char-", 5) == 0 && VIM_ISDIGIT(src
[6]))
2573 /* <Char-123> or <Char-033> or <Char-0x33> */
2574 vim_str2nr(src
+ 6, NULL
, NULL
, TRUE
, TRUE
, NULL
, &n
);
2576 *srcp
= end_of_name
;
2580 /* Which modifiers are given? */
2582 for (bp
= src
+ 1; bp
< last_dash
; bp
++)
2586 bit
= name_to_mod_mask(*bp
);
2588 break; /* Illegal modifier name */
2594 * Legal modifier name.
2596 if (bp
>= last_dash
)
2599 * Modifier with single letter, or special key name.
2601 if (modifiers
!= 0 && last_dash
[2] == '>')
2605 key
= get_special_key_code(last_dash
+ 1);
2606 key
= handle_x_keys(key
);
2610 * get_special_key_code() may return NUL for invalid
2616 * Only use a modifier when there is no special key code that
2617 * includes the modifier.
2619 key
= simplify_key(key
, &modifiers
);
2623 /* don't want keycode, use single byte code */
2626 else if (key
== K_DEL
|| key
== K_KDEL
)
2631 * Normal Key with modifier: Try to make a single byte code.
2633 if (!IS_SPECIAL(key
))
2634 key
= extract_modifiers(key
, &modifiers
);
2637 *srcp
= end_of_name
;
2646 * Try to include modifiers in the key.
2647 * Changes "Shift-a" to 'A', "Alt-A" to 0xc0, etc.
2650 extract_modifiers(key
, modp
)
2654 int modifiers
= *modp
;
2657 /* Command-key really special, No fancynest */
2658 if (!(modifiers
& MOD_MASK_CMD
))
2660 if ((modifiers
& MOD_MASK_SHIFT
) && ASCII_ISALPHA(key
))
2662 key
= TOUPPER_ASC(key
);
2663 modifiers
&= ~MOD_MASK_SHIFT
;
2665 if ((modifiers
& MOD_MASK_CTRL
)
2667 /* * TODO: EBCDIC Better use:
2668 * && (Ctrl_chr(key) || key == '?')
2670 && strchr("?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_", key
)
2673 && ((key
>= '?' && key
<= '_') || ASCII_ISALPHA(key
))
2677 key
= Ctrl_chr(key
);
2678 modifiers
&= ~MOD_MASK_CTRL
;
2679 /* <C-@> is <Nul> */
2684 /* Command-key really special, No fancynest */
2685 if (!(modifiers
& MOD_MASK_CMD
))
2687 if ((modifiers
& MOD_MASK_ALT
) && key
< 0x80
2689 && !enc_dbcs
/* avoid creating a lead byte */
2694 modifiers
&= ~MOD_MASK_ALT
; /* remove the META modifier */
2702 * Try to find key "c" in the special key table.
2703 * Return the index when found, -1 when not found.
2706 find_special_key_in_table(c
)
2711 for (i
= 0; key_names_table
[i
].name
!= NULL
; i
++)
2712 if (c
== key_names_table
[i
].key
)
2714 if (key_names_table
[i
].name
== NULL
)
2720 * Find the special key with the given name (the given string does not have to
2721 * end with NUL, the name is assumed to end before the first non-idchar).
2722 * If the name starts with "t_" the next two characters are interpreted as a
2724 * Return the key code, or 0 if not found.
2727 get_special_key_code(name
)
2735 * If it's <t_xx> we get the code for xx from the termcap
2737 if (name
[0] == 't' && name
[1] == '_' && name
[2] != NUL
&& name
[3] != NUL
)
2739 string
[0] = name
[2];
2740 string
[1] = name
[3];
2742 if (add_termcap_entry(string
, FALSE
) == OK
)
2743 return TERMCAP2KEY(name
[2], name
[3]);
2746 for (i
= 0; key_names_table
[i
].name
!= NULL
; i
++)
2748 table_name
= key_names_table
[i
].name
;
2749 for (j
= 0; vim_isIDc(name
[j
]) && table_name
[j
] != NUL
; j
++)
2750 if (TOLOWER_ASC(table_name
[j
]) != TOLOWER_ASC(name
[j
]))
2752 if (!vim_isIDc(name
[j
]) && table_name
[j
] == NUL
)
2753 return key_names_table
[i
].key
;
2758 #ifdef FEAT_CMDL_COMPL
2763 if (i
>= KEY_NAMES_TABLE_LEN
)
2765 return key_names_table
[i
].name
;
2771 * Look up the given mouse code to return the relevant information in the other
2772 * arguments. Return which button is down or was released.
2775 get_mouse_button(code
, is_click
, is_drag
)
2782 for (i
= 0; mouse_table
[i
].pseudo_code
; i
++)
2783 if (code
== mouse_table
[i
].pseudo_code
)
2785 *is_click
= mouse_table
[i
].is_click
;
2786 *is_drag
= mouse_table
[i
].is_drag
;
2787 return mouse_table
[i
].button
;
2789 return 0; /* Shouldn't get here */
2793 * Return the appropriate pseudo mouse event token (KE_LEFTMOUSE etc) based on
2794 * the given information about which mouse button is down, and whether the
2795 * mouse was clicked, dragged or released.
2798 get_pseudo_mouse_code(button
, is_click
, is_drag
)
2799 int button
; /* eg MOUSE_LEFT */
2805 for (i
= 0; mouse_table
[i
].pseudo_code
; i
++)
2806 if (button
== mouse_table
[i
].button
2807 && is_click
== mouse_table
[i
].is_click
2808 && is_drag
== mouse_table
[i
].is_drag
)
2811 /* Trick: a non mappable left click and release has mouse_col -1
2812 * or added MOUSE_COLOFF. Used for 'mousefocus' in
2813 * gui_mouse_moved() */
2814 if (mouse_col
< 0 || mouse_col
> MOUSE_COLOFF
)
2819 mouse_col
-= MOUSE_COLOFF
;
2820 if (mouse_table
[i
].pseudo_code
== (int)KE_LEFTMOUSE
)
2821 return (int)KE_LEFTMOUSE_NM
;
2822 if (mouse_table
[i
].pseudo_code
== (int)KE_LEFTRELEASE
)
2823 return (int)KE_LEFTRELEASE_NM
;
2826 return mouse_table
[i
].pseudo_code
;
2828 return (int)KE_IGNORE
; /* not recognized, ignore it */
2830 #endif /* FEAT_MOUSE */
2833 * Return the current end-of-line type: EOL_DOS, EOL_UNIX or EOL_MAC.
2839 int c
= *buf
->b_p_ff
;
2841 if (buf
->b_p_bin
|| c
== 'u')
2849 * Like get_fileformat(), but override 'fileformat' with "p" for "++opt=val"
2853 get_fileformat_force(buf
, eap
)
2855 exarg_T
*eap
; /* can be NULL! */
2859 if (eap
!= NULL
&& eap
->force_ff
!= 0)
2860 c
= eap
->cmd
[eap
->force_ff
];
2863 if ((eap
!= NULL
&& eap
->force_bin
!= 0)
2864 ? (eap
->force_bin
== FORCE_BIN
) : buf
->b_p_bin
)
2876 * Set the current end-of-line type to EOL_DOS, EOL_UNIX or EOL_MAC.
2877 * Sets both 'textmode' and 'fileformat'.
2878 * Note: Does _not_ set global value of 'textmode'!
2881 set_fileformat(t
, opt_flags
)
2883 int opt_flags
; /* OPT_LOCAL and/or OPT_GLOBAL */
2891 curbuf
->b_p_tx
= TRUE
;
2895 curbuf
->b_p_tx
= FALSE
;
2899 curbuf
->b_p_tx
= FALSE
;
2903 set_string_option_direct((char_u
*)"ff", -1, (char_u
*)p
,
2904 OPT_FREE
| opt_flags
, 0);
2907 /* This may cause the buffer to become (un)modified. */
2908 check_status(curbuf
);
2909 redraw_tabline
= TRUE
;
2912 need_maketitle
= TRUE
; /* set window title later */
2917 * Return the default fileformat from 'fileformats'.
2920 default_fileformat()
2924 case 'm': return EOL_MAC
;
2925 case 'd': return EOL_DOS
;
2931 * Call shell. Calls mch_call_shell, with 'shellxquote' added.
2934 call_shell(cmd
, opt
)
2941 proftime_T wait_time
;
2947 smsg((char_u
*)_("Calling shell to execute: \"%s\""),
2948 cmd
== NULL
? p_sh
: cmd
);
2955 if (do_profiling
== PROF_YES
)
2956 prof_child_enter(&wait_time
);
2961 EMSG(_(e_shellempty
));
2966 #ifdef FEAT_GUI_MSWIN
2967 /* Don't hide the pointer while executing a shell command. */
2968 gui_mch_mousehide(FALSE
);
2973 /* The external command may update a tags file, clear cached tags. */
2976 if (cmd
== NULL
|| *p_sxq
== NUL
)
2977 retval
= mch_call_shell(cmd
, opt
);
2980 ncmd
= alloc((unsigned)(STRLEN(cmd
) + STRLEN(p_sxq
) * 2 + 1));
2983 STRCPY(ncmd
, p_sxq
);
2985 STRCAT(ncmd
, p_sxq
);
2986 retval
= mch_call_shell(ncmd
, opt
);
2996 * Check the window size, in case it changed while executing the
2999 shell_resized_check();
3003 set_vim_var_nr(VV_SHELL_ERROR
, (long)retval
);
3004 # ifdef FEAT_PROFILE
3005 if (do_profiling
== PROF_YES
)
3006 prof_child_exit(&wait_time
);
3014 * VISUAL, SELECTMODE and OP_PENDING State are never set, they are equal to
3015 * NORMAL State with a condition. This function returns the real State.
3037 #if defined(FEAT_MBYTE) || defined(PROTO)
3039 * Return TRUE if "p" points to just after a path separator.
3040 * Take care of multi-byte characters.
3041 * "b" must point to the start of the file name
3048 return vim_ispathsep(p
[-1])
3049 && (!has_mbyte
|| (*mb_head_off
)(b
, p
- 1) == 0);
3054 * Return TRUE if file names "f1" and "f2" are in the same directory.
3055 * "f1" may be a short name, "f2" must be a full path.
3058 same_directory(f1
, f2
)
3062 char_u ffname
[MAXPATHL
];
3067 if (f1
== NULL
|| f2
== NULL
)
3070 (void)vim_FullName(f1
, ffname
, MAXPATHL
, FALSE
);
3071 t1
= gettail_sep(ffname
);
3072 t2
= gettail_sep(f2
);
3073 return (t1
- ffname
== t2
- f2
3074 && pathcmp((char *)ffname
, (char *)f2
, (int)(t1
- ffname
)) == 0);
3077 #if defined(FEAT_SESSION) || defined(MSWIN) || defined(FEAT_GUI_MAC) \
3078 || ((defined(FEAT_GUI_GTK)) \
3079 && ( defined(FEAT_WINDOWS) || defined(FEAT_DND)) ) \
3080 || defined(FEAT_SUN_WORKSHOP) || defined(FEAT_NETBEANS_INTG) \
3083 * Change to a file's directory.
3084 * Caller must call shorten_fnames()!
3085 * Return OK or FAIL.
3088 vim_chdirfile(fname
)
3091 char_u dir
[MAXPATHL
];
3093 vim_strncpy(dir
, fname
, MAXPATHL
- 1);
3094 *gettail_sep(dir
) = NUL
;
3095 return mch_chdir((char *)dir
) == 0 ? OK
: FAIL
;
3099 #if defined(STAT_IGNORES_SLASH) || defined(PROTO)
3101 * Check if "name" ends in a slash and is not a directory.
3102 * Used for systems where stat() ignores a trailing slash on a file name.
3103 * The Vim code assumes a trailing slash is only ignored for a directory.
3110 return FALSE
; /* no file name is not illegal */
3111 if (name
[strlen(name
) - 1] != '/')
3112 return FALSE
; /* no trailing slash */
3113 if (mch_isdir((char_u
*)name
))
3114 return FALSE
; /* trailing slash for a directory */
3119 #if defined(CURSOR_SHAPE) || defined(PROTO)
3122 * Handling of cursor and mouse pointer shapes in various modes.
3125 cursorentry_T shape_table
[SHAPE_IDX_COUNT
] =
3127 /* The values will be filled in from the 'guicursor' and 'mouseshape'
3128 * defaults when Vim starts.
3129 * Adjust the SHAPE_IDX_ defines when making changes! */
3130 {0, 0, 0, 700L, 400L, 250L, 0, 0, "n", SHAPE_CURSOR
+SHAPE_MOUSE
},
3131 {0, 0, 0, 700L, 400L, 250L, 0, 0, "v", SHAPE_CURSOR
+SHAPE_MOUSE
},
3132 {0, 0, 0, 700L, 400L, 250L, 0, 0, "i", SHAPE_CURSOR
+SHAPE_MOUSE
},
3133 {0, 0, 0, 700L, 400L, 250L, 0, 0, "r", SHAPE_CURSOR
+SHAPE_MOUSE
},
3134 {0, 0, 0, 700L, 400L, 250L, 0, 0, "c", SHAPE_CURSOR
+SHAPE_MOUSE
},
3135 {0, 0, 0, 700L, 400L, 250L, 0, 0, "ci", SHAPE_CURSOR
+SHAPE_MOUSE
},
3136 {0, 0, 0, 700L, 400L, 250L, 0, 0, "cr", SHAPE_CURSOR
+SHAPE_MOUSE
},
3137 {0, 0, 0, 700L, 400L, 250L, 0, 0, "o", SHAPE_CURSOR
+SHAPE_MOUSE
},
3138 {0, 0, 0, 700L, 400L, 250L, 0, 0, "ve", SHAPE_CURSOR
+SHAPE_MOUSE
},
3139 {0, 0, 0, 0L, 0L, 0L, 0, 0, "e", SHAPE_MOUSE
},
3140 {0, 0, 0, 0L, 0L, 0L, 0, 0, "s", SHAPE_MOUSE
},
3141 {0, 0, 0, 0L, 0L, 0L, 0, 0, "sd", SHAPE_MOUSE
},
3142 {0, 0, 0, 0L, 0L, 0L, 0, 0, "vs", SHAPE_MOUSE
},
3143 {0, 0, 0, 0L, 0L, 0L, 0, 0, "vd", SHAPE_MOUSE
},
3144 {0, 0, 0, 0L, 0L, 0L, 0, 0, "m", SHAPE_MOUSE
},
3145 {0, 0, 0, 0L, 0L, 0L, 0, 0, "ml", SHAPE_MOUSE
},
3146 {0, 0, 0, 100L, 100L, 100L, 0, 0, "sm", SHAPE_CURSOR
},
3149 #ifdef FEAT_MOUSESHAPE
3151 * Table with names for mouse shapes. Keep in sync with all the tables for
3152 * mch_set_mouse_shape()!.
3154 static char * mshape_names
[] =
3156 "arrow", /* default, must be the first one */
3157 "blank", /* hidden */
3177 * Parse the 'guicursor' option ("what" is SHAPE_CURSOR) or 'mouseshape'
3178 * ("what" is SHAPE_MOUSE).
3179 * Returns error message for an illegal option, NULL otherwise.
3182 parse_shape_opt(what
)
3190 int idx
= 0; /* init for GCC */
3195 int found_ve
= FALSE
; /* found "ve" flag */
3199 * First round: check for errors; second round: do it for real.
3201 for (round
= 1; round
<= 2; ++round
)
3204 * Repeat for all comma separated parts.
3206 #ifdef FEAT_MOUSESHAPE
3207 if (what
== SHAPE_MOUSE
)
3208 modep
= p_mouseshape
;
3211 modep
= p_guicursor
;
3212 while (*modep
!= NUL
)
3214 colonp
= vim_strchr(modep
, ':');
3216 return (char_u
*)N_("E545: Missing colon");
3217 if (colonp
== modep
)
3218 return (char_u
*)N_("E546: Illegal mode");
3219 commap
= vim_strchr(modep
, ',');
3222 * Repeat for all mode's before the colon.
3223 * For the 'a' mode, we loop to handle all the modes.
3226 while (modep
< colonp
|| all_idx
>= 0)
3230 /* Find the mode. */
3231 if (modep
[1] == '-' || modep
[1] == ':')
3235 if (len
== 1 && TOLOWER_ASC(modep
[0]) == 'a')
3236 all_idx
= SHAPE_IDX_COUNT
- 1;
3239 for (idx
= 0; idx
< SHAPE_IDX_COUNT
; ++idx
)
3240 if (STRNICMP(modep
, shape_table
[idx
].name
, len
)
3243 if (idx
== SHAPE_IDX_COUNT
3244 || (shape_table
[idx
].used_for
& what
) == 0)
3245 return (char_u
*)N_("E546: Illegal mode");
3246 if (len
== 2 && modep
[0] == 'v' && modep
[1] == 'e')
3254 else if (round
== 2)
3256 #ifdef FEAT_MOUSESHAPE
3257 if (what
== SHAPE_MOUSE
)
3259 /* Set the default, for the missing parts */
3260 shape_table
[idx
].mshape
= 0;
3265 /* Set the defaults, for the missing parts */
3266 shape_table
[idx
].shape
= SHAPE_BLOCK
;
3267 shape_table
[idx
].blinkwait
= 700L;
3268 shape_table
[idx
].blinkon
= 400L;
3269 shape_table
[idx
].blinkoff
= 250L;
3273 /* Parse the part after the colon */
3274 for (p
= colonp
+ 1; *p
&& *p
!= ','; )
3276 #ifdef FEAT_MOUSESHAPE
3277 if (what
== SHAPE_MOUSE
)
3281 if (mshape_names
[i
] == NULL
)
3283 if (!VIM_ISDIGIT(*p
))
3284 return (char_u
*)N_("E547: Illegal mouseshape");
3286 shape_table
[idx
].mshape
=
3287 getdigits(&p
) + MSHAPE_NUMBERED
;
3289 (void)getdigits(&p
);
3292 len
= (int)STRLEN(mshape_names
[i
]);
3293 if (STRNICMP(p
, mshape_names
[i
], len
) == 0)
3296 shape_table
[idx
].mshape
= i
;
3302 else /* if (what == SHAPE_MOUSE) */
3306 * First handle the ones with a number argument.
3310 if (STRNICMP(p
, "ver", 3) == 0)
3312 else if (STRNICMP(p
, "hor", 3) == 0)
3314 else if (STRNICMP(p
, "blinkwait", 9) == 0)
3316 else if (STRNICMP(p
, "blinkon", 7) == 0)
3318 else if (STRNICMP(p
, "blinkoff", 8) == 0)
3323 if (!VIM_ISDIGIT(*p
))
3324 return (char_u
*)N_("E548: digit expected");
3326 if (len
== 3) /* "ver" or "hor" */
3329 return (char_u
*)N_("E549: Illegal percentage");
3332 if (TOLOWER_ASC(i
) == 'v')
3333 shape_table
[idx
].shape
= SHAPE_VER
;
3335 shape_table
[idx
].shape
= SHAPE_HOR
;
3336 shape_table
[idx
].percentage
= n
;
3339 else if (round
== 2)
3342 shape_table
[idx
].blinkwait
= n
;
3344 shape_table
[idx
].blinkon
= n
;
3346 shape_table
[idx
].blinkoff
= n
;
3349 else if (STRNICMP(p
, "block", 5) == 0)
3352 shape_table
[idx
].shape
= SHAPE_BLOCK
;
3355 else /* must be a highlight group name then */
3357 endp
= vim_strchr(p
, '-');
3358 if (commap
== NULL
) /* last part */
3361 endp
= p
+ STRLEN(p
); /* find end of part */
3363 else if (endp
> commap
|| endp
== NULL
)
3365 slashp
= vim_strchr(p
, '/');
3366 if (slashp
!= NULL
&& slashp
< endp
)
3368 /* "group/langmap_group" */
3369 i
= syn_check_group(p
, (int)(slashp
- p
));
3374 shape_table
[idx
].id
= syn_check_group(p
,
3376 shape_table
[idx
].id_lm
= shape_table
[idx
].id
;
3377 if (slashp
!= NULL
&& slashp
< endp
)
3378 shape_table
[idx
].id
= i
;
3382 } /* if (what != SHAPE_MOUSE) */
3394 /* If the 's' flag is not given, use the 'v' cursor for 's' */
3397 #ifdef FEAT_MOUSESHAPE
3398 if (what
== SHAPE_MOUSE
)
3400 shape_table
[SHAPE_IDX_VE
].mshape
= shape_table
[SHAPE_IDX_V
].mshape
;
3405 shape_table
[SHAPE_IDX_VE
].shape
= shape_table
[SHAPE_IDX_V
].shape
;
3406 shape_table
[SHAPE_IDX_VE
].percentage
=
3407 shape_table
[SHAPE_IDX_V
].percentage
;
3408 shape_table
[SHAPE_IDX_VE
].blinkwait
=
3409 shape_table
[SHAPE_IDX_V
].blinkwait
;
3410 shape_table
[SHAPE_IDX_VE
].blinkon
=
3411 shape_table
[SHAPE_IDX_V
].blinkon
;
3412 shape_table
[SHAPE_IDX_VE
].blinkoff
=
3413 shape_table
[SHAPE_IDX_V
].blinkoff
;
3414 shape_table
[SHAPE_IDX_VE
].id
= shape_table
[SHAPE_IDX_V
].id
;
3415 shape_table
[SHAPE_IDX_VE
].id_lm
= shape_table
[SHAPE_IDX_V
].id_lm
;
3422 # if defined(MCH_CURSOR_SHAPE) || defined(FEAT_GUI) \
3423 || defined(FEAT_MOUSESHAPE) || defined(PROTO)
3425 * Return the index into shape_table[] for the current mode.
3426 * When "mouse" is TRUE, consider indexes valid for the mouse pointer.
3429 get_shape_idx(mouse
)
3432 #ifdef FEAT_MOUSESHAPE
3433 if (mouse
&& (State
== HITRETURN
|| State
== ASKMORE
))
3437 gui_mch_getmouse(&x
, &y
);
3438 if (Y_2_ROW(y
) == Rows
- 1)
3439 return SHAPE_IDX_MOREL
;
3441 return SHAPE_IDX_MORE
;
3443 if (mouse
&& drag_status_line
)
3444 return SHAPE_IDX_SDRAG
;
3445 # ifdef FEAT_VERTSPLIT
3446 if (mouse
&& drag_sep_line
)
3447 return SHAPE_IDX_VDRAG
;
3450 if (!mouse
&& State
== SHOWMATCH
)
3451 return SHAPE_IDX_SM
;
3452 #ifdef FEAT_VREPLACE
3453 if (State
& VREPLACE_FLAG
)
3456 if (State
& REPLACE_FLAG
)
3460 if (State
& CMDLINE
)
3462 if (cmdline_at_end())
3464 if (cmdline_overstrike())
3465 return SHAPE_IDX_CR
;
3466 return SHAPE_IDX_CI
;
3474 return SHAPE_IDX_VE
;
3483 # if defined(FEAT_MOUSESHAPE) || defined(PROTO)
3484 static int old_mouse_shape
= 0;
3487 * Set the mouse shape:
3488 * If "shape" is -1, use shape depending on the current mode,
3489 * depending on the current state.
3490 * If "shape" is -2, only update the shape when it's CLINE or STATUS (used
3491 * when the mouse moves off the status or command line).
3494 update_mouseshape(shape_idx
)
3497 int new_mouse_shape
;
3499 /* Only works in GUI mode. */
3500 if (!gui
.in_use
|| gui
.starting
)
3503 /* Postpone the updating when more is to come. Speeds up executing of
3505 if (shape_idx
== -1 && char_avail())
3507 postponed_mouseshape
= TRUE
;
3511 /* When ignoring the mouse don't change shape on the statusline. */
3513 && (shape_idx
== SHAPE_IDX_CLINE
3514 || shape_idx
== SHAPE_IDX_STATUS
3515 || shape_idx
== SHAPE_IDX_VSEP
))
3519 && old_mouse_shape
!= shape_table
[SHAPE_IDX_CLINE
].mshape
3520 && old_mouse_shape
!= shape_table
[SHAPE_IDX_STATUS
].mshape
3521 && old_mouse_shape
!= shape_table
[SHAPE_IDX_VSEP
].mshape
)
3524 new_mouse_shape
= shape_table
[get_shape_idx(TRUE
)].mshape
;
3526 new_mouse_shape
= shape_table
[shape_idx
].mshape
;
3527 if (new_mouse_shape
!= old_mouse_shape
)
3529 mch_set_mouse_shape(new_mouse_shape
);
3530 old_mouse_shape
= new_mouse_shape
;
3532 postponed_mouseshape
= FALSE
;
3536 #endif /* CURSOR_SHAPE */
3541 * Optional encryption support.
3542 * Mohsin Ahmed, mosh@sasi.com, 98-09-24
3543 * Based on zip/crypt sources.
3545 * NOTE FOR USA: Since 2000 exporting this code from the USA is allowed to
3546 * most countries. There are a few exceptions, but that still should not be a
3547 * problem since this code was originally created in Europe and India.
3552 typedef unsigned short ush
; /* unsigned 16-bit value */
3553 typedef unsigned long ulg
; /* unsigned 32-bit value */
3555 static void make_crc_tab
__ARGS((void));
3557 static ulg crc_32_tab
[256];
3560 * Fill the CRC table.
3566 static int done
= FALSE
;
3570 for (t
= 0; t
< 256; t
++)
3573 for (s
= 0; s
< 8; s
++)
3574 v
= (v
>> 1) ^ ((v
& 1) * (ulg
)0xedb88320L
);
3580 #define CRC32(c, b) (crc_32_tab[((int)(c) ^ (b)) & 0xff] ^ ((c) >> 8))
3583 static ulg keys
[3]; /* keys defining the pseudo-random sequence */
3586 * Return the next byte in the pseudo-random sequence
3593 temp
= (ush
)keys
[2] | 2;
3594 return (int)(((unsigned)(temp
* (temp
^ 1)) >> 8) & 0xff);
3598 * Update the encryption keys with the next byte of plain text
3602 int c
; /* byte of plain text */
3604 keys
[0] = CRC32(keys
[0], c
);
3605 keys
[1] += keys
[0] & 0xff;
3606 keys
[1] = keys
[1] * 134775813L + 1;
3607 keys
[2] = CRC32(keys
[2], (int)(keys
[1] >> 24));
3612 * Initialize the encryption keys and the random header according to
3613 * the given password.
3614 * If "passwd" is NULL or empty, don't do anything.
3617 crypt_init_keys(passwd
)
3618 char_u
*passwd
; /* password string with which to modify keys */
3620 if (passwd
!= NULL
&& *passwd
!= NUL
)
3623 keys
[0] = 305419896L;
3624 keys
[1] = 591751049L;
3625 keys
[2] = 878082192L;
3626 while (*passwd
!= '\0')
3627 update_keys((int)*passwd
++);
3632 * Ask the user for a crypt key.
3633 * When "store" is TRUE, the new key in stored in the 'key' option, and the
3634 * 'key' option value is returned: Don't free it.
3635 * When "store" is FALSE, the typed key is returned in allocated memory.
3636 * Returns NULL on failure.
3639 get_crypt_key(store
, twice
)
3641 int twice
; /* Ask for the key twice. */
3643 char_u
*p1
, *p2
= NULL
;
3646 for (round
= 0; ; ++round
)
3648 cmdline_star
= TRUE
;
3649 cmdline_row
= msg_row
;
3650 p1
= getcmdline_prompt(NUL
, round
== 0
3651 ? (char_u
*)_("Enter encryption key: ")
3652 : (char_u
*)_("Enter same key again: "), 0, EXPAND_NOTHING
,
3654 cmdline_star
= FALSE
;
3661 if (p2
!= NULL
&& STRCMP(p1
, p2
) != 0)
3663 MSG(_("Keys don't match!"));
3667 round
= -1; /* do it again */
3672 set_option_value((char_u
*)"key", 0L, p1
, OPT_LOCAL
);
3674 p1
= curbuf
->b_p_key
;
3681 /* since the user typed this, no need to wait for return */
3682 need_wait_return
= FALSE
;
3689 #endif /* FEAT_CRYPT */
3691 /* TODO: make some #ifdef for this */
3692 /*--------[ file searching ]-------------------------------------------------*/
3694 * File searching functions for 'path', 'tags' and 'cdpath' options.
3695 * External visible functions:
3696 * vim_findfile_init() creates/initialises the search context
3697 * vim_findfile_free_visited() free list of visited files/dirs of search
3699 * vim_findfile() find a file in the search context
3700 * vim_findfile_cleanup() cleanup/free search context created by
3701 * vim_findfile_init()
3703 * All static functions and variables start with 'ff_'
3705 * In general it works like this:
3706 * First you create yourself a search context by calling vim_findfile_init().
3707 * It is possible to give a search context from a previous call to
3708 * vim_findfile_init(), so it can be reused. After this you call vim_findfile()
3709 * until you are satisfied with the result or it returns NULL. On every call it
3710 * returns the next file which matches the conditions given to
3711 * vim_findfile_init(). If it doesn't find a next file it returns NULL.
3713 * It is possible to call vim_findfile_init() again to reinitialise your search
3714 * with some new parameters. Don't forget to pass your old search context to
3715 * it, so it can reuse it and especially reuse the list of already visited
3716 * directories. If you want to delete the list of already visited directories
3717 * simply call vim_findfile_free_visited().
3719 * When you are done call vim_findfile_cleanup() to free the search context.
3721 * The function vim_findfile_init() has a long comment, which describes the
3722 * needed parameters.
3728 * Also we use an allocated search context here, this functions are NOT
3731 * To minimize parameter passing (or because I'm to lazy), only the
3732 * external visible functions get a search context as a parameter. This is
3733 * then assigned to a static global, which is used throughout the local
3738 * type for the directory search stack
3740 typedef struct ff_stack
3742 struct ff_stack
*ffs_prev
;
3744 /* the fix part (no wildcards) and the part containing the wildcards
3745 * of the search path
3747 char_u
*ffs_fix_path
;
3748 #ifdef FEAT_PATH_EXTRA
3749 char_u
*ffs_wc_path
;
3752 /* files/dirs found in the above directory, matched by the first wildcard
3755 char_u
**ffs_filearray
;
3756 int ffs_filearray_size
;
3757 char_u ffs_filearray_cur
; /* needed for partly handled dirs */
3759 /* to store status of partly handled directories
3760 * 0: we work the on this directory for the first time
3761 * 1: this directory was partly searched in an earlier step
3765 /* How deep are we in the directory tree?
3766 * Counts backward from value of level parameter to vim_findfile_init
3770 /* Did we already expand '**' to an empty string? */
3771 int ffs_star_star_empty
;
3775 * type for already visited directories or files.
3777 typedef struct ff_visited
3779 struct ff_visited
*ffv_next
;
3781 #ifdef FEAT_PATH_EXTRA
3782 /* Visited directories are different if the wildcard string are
3783 * different. So we have to save it.
3785 char_u
*ffv_wc_path
;
3787 /* for unix use inode etc for comparison (needed because of links), else
3791 int ffv_dev
; /* device number (-1 if not set) */
3792 ino_t ffv_ino
; /* inode number */
3794 /* The memory for this struct is allocated according to the length of
3797 char_u ffv_fname
[1]; /* actually longer */
3801 * We might have to manage several visited lists during a search.
3802 * This is especially needed for the tags option. If tags is set to:
3803 * "./++/tags,./++/TAGS,++/tags" (replace + with *)
3804 * So we have to do 3 searches:
3805 * 1) search from the current files directory downward for the file "tags"
3806 * 2) search from the current files directory downward for the file "TAGS"
3807 * 3) search from Vims current directory downwards for the file "tags"
3808 * As you can see, the first and the third search are for the same file, so for
3809 * the third search we can use the visited list of the first search. For the
3810 * second search we must start from a empty visited list.
3811 * The struct ff_visited_list_hdr is used to manage a linked list of already
3814 typedef struct ff_visited_list_hdr
3816 struct ff_visited_list_hdr
*ffvl_next
;
3818 /* the filename the attached visited list is for */
3819 char_u
*ffvl_filename
;
3821 ff_visited_T
*ffvl_visited_list
;
3823 } ff_visited_list_hdr_T
;
3827 * '**' can be expanded to several directory levels.
3828 * Set the default maximum depth.
3830 #define FF_MAX_STAR_STAR_EXPAND ((char_u)30)
3832 * The search context:
3833 * ffsc_stack_ptr: the stack for the dirs to search
3834 * ffsc_visited_list: the currently active visited list
3835 * ffsc_dir_visited_list: the currently active visited list for search dirs
3836 * ffsc_visited_lists_list: the list of all visited lists
3837 * ffsc_dir_visited_lists_list: the list of all visited lists for search dirs
3838 * ffsc_file_to_search: the file to search for
3839 * ffsc_start_dir: the starting directory, if search path was relative
3840 * ffsc_fix_path: the fix part of the given path (without wildcards)
3841 * Needed for upward search.
3842 * ffsc_wc_path: the part of the given path containing wildcards
3843 * ffsc_level: how many levels of dirs to search downwards
3844 * ffsc_stopdirs_v: array of stop directories for upward search
3845 * ffsc_need_dir: TRUE if we search for a directory
3847 typedef struct ff_search_ctx_T
3849 ff_stack_T
*ffsc_stack_ptr
;
3850 ff_visited_list_hdr_T
*ffsc_visited_list
;
3851 ff_visited_list_hdr_T
*ffsc_dir_visited_list
;
3852 ff_visited_list_hdr_T
*ffsc_visited_lists_list
;
3853 ff_visited_list_hdr_T
*ffsc_dir_visited_lists_list
;
3854 char_u
*ffsc_file_to_search
;
3855 char_u
*ffsc_start_dir
;
3856 char_u
*ffsc_fix_path
;
3857 #ifdef FEAT_PATH_EXTRA
3858 char_u
*ffsc_wc_path
;
3860 char_u
**ffsc_stopdirs_v
;
3865 static ff_search_ctx_T
*ff_search_ctx
= NULL
;
3867 /* locally needed functions */
3868 #ifdef FEAT_PATH_EXTRA
3869 static int ff_check_visited
__ARGS((ff_visited_T
**, char_u
*, char_u
*));
3871 static int ff_check_visited
__ARGS((ff_visited_T
**, char_u
*));
3873 static void vim_findfile_free_visited_list
__ARGS((ff_visited_list_hdr_T
**list_headp
));
3874 static void ff_free_visited_list
__ARGS((ff_visited_T
*vl
));
3875 static ff_visited_list_hdr_T
* ff_get_visited_list
__ARGS((char_u
*, ff_visited_list_hdr_T
**list_headp
));
3876 #ifdef FEAT_PATH_EXTRA
3877 static int ff_wc_equal
__ARGS((char_u
*s1
, char_u
*s2
));
3880 static void ff_push
__ARGS((ff_stack_T
*));
3881 static ff_stack_T
* ff_pop
__ARGS((void));
3882 static void ff_clear
__ARGS((void));
3883 static void ff_free_stack_element
__ARGS((ff_stack_T
*));
3884 #ifdef FEAT_PATH_EXTRA
3885 static ff_stack_T
*ff_create_stack_element
__ARGS((char_u
*, char_u
*, int, int));
3887 static ff_stack_T
*ff_create_stack_element
__ARGS((char_u
*, int, int));
3889 #ifdef FEAT_PATH_EXTRA
3890 static int ff_path_in_stoplist
__ARGS((char_u
*, int, char_u
**));
3895 * if someone likes findfirst/findnext, here are the functions
3899 static void *ff_fn_search_context
= NULL
;
3902 vim_findfirst(path
, filename
, level
)
3907 ff_fn_search_context
=
3908 vim_findfile_init(path
, filename
, NULL
, level
, TRUE
, FALSE
,
3909 ff_fn_search_context
, rel_fname
);
3910 if (NULL
== ff_fn_search_context
)
3913 return vim_findnext()
3919 char_u
*ret
= vim_findfile(ff_fn_search_context
);
3923 vim_findfile_cleanup(ff_fn_search_context
);
3924 ff_fn_search_context
= NULL
;
3931 * Initialization routine for vim_findfile.
3933 * Returns the newly allocated search context or NULL if an error occured.
3935 * Don't forget to clean up by calling vim_findfile_cleanup() if you are done
3936 * with the search context.
3938 * Find the file 'filename' in the directory 'path'.
3939 * The parameter 'path' may contain wildcards. If so only search 'level'
3940 * directories deep. The parameter 'level' is the absolute maximum and is
3941 * not related to restricts given to the '**' wildcard. If 'level' is 100
3942 * and you use '**200' vim_findfile() will stop after 100 levels.
3944 * If 'stopdirs' is not NULL and nothing is found downward, the search is
3945 * restarted on the next higher directory level. This is repeated until the
3946 * start-directory of a search is contained in 'stopdirs'. 'stopdirs' has the
3947 * format ";*<dirname>*\(;<dirname>\)*;\=$".
3949 * If the 'path' is relative, the starting dir for the search is either VIM's
3950 * current dir or if the path starts with "./" the current files dir.
3951 * If the 'path' is absolut, the starting dir is that part of the path before
3952 * the first wildcard.
3954 * Upward search is only done on the starting dir.
3956 * If 'free_visited' is TRUE the list of already visited files/directories is
3957 * cleared. Set this to FALSE if you just want to search from another
3958 * directory, but want to be sure that no directory from a previous search is
3959 * searched again. This is useful if you search for a file at different places.
3960 * The list of visited files/dirs can also be cleared with the function
3961 * vim_findfile_free_visited().
3963 * Set the parameter 'need_dir' to TRUE if you want to search for a directory
3964 * instead of a file.
3966 * A search context returned by a previous call to vim_findfile_init() can be
3967 * passed in the parameter 'search_ctx'. This context is than reused and
3968 * reinitialized with the new parameters. The list of already viseted
3969 * directories from this context is only deleted if the parameter
3970 * 'free_visited' is true. Be aware that the passed search_context is freed if
3971 * the reinitialization fails.
3973 * If you don't have a search context from a previous call 'search_ctx' must be
3976 * This function silently ignores a few errors, vim_findfile() will have
3977 * limited functionality then.
3981 vim_findfile_init(path
, filename
, stopdirs
, level
, free_visited
, need_dir
,
3982 search_ctx
, tagfile
, rel_fname
)
3991 char_u
*rel_fname
; /* file name to use for "." */
3993 #ifdef FEAT_PATH_EXTRA
3998 /* If a search context is given by the caller, reuse it, else allocate a
4001 if (search_ctx
!= NULL
)
4002 ff_search_ctx
= search_ctx
;
4005 ff_search_ctx
= (ff_search_ctx_T
*)alloc(
4006 (unsigned)sizeof(ff_search_ctx_T
));
4007 if (ff_search_ctx
== NULL
)
4009 memset(ff_search_ctx
, 0, sizeof(ff_search_ctx_T
));
4012 /* clear the search context, but NOT the visited lists */
4015 /* clear visited list if wanted */
4016 if (free_visited
== TRUE
)
4017 vim_findfile_free_visited(ff_search_ctx
);
4020 /* Reuse old visited lists. Get the visited list for the given
4021 * filename. If no list for the current filename exists, creates a new
4024 ff_search_ctx
->ffsc_visited_list
= ff_get_visited_list(filename
,
4025 &ff_search_ctx
->ffsc_visited_lists_list
);
4026 if (ff_search_ctx
->ffsc_visited_list
== NULL
)
4028 ff_search_ctx
->ffsc_dir_visited_list
= ff_get_visited_list(filename
,
4029 &ff_search_ctx
->ffsc_dir_visited_lists_list
);
4030 if (ff_search_ctx
->ffsc_dir_visited_list
== NULL
)
4034 if (ff_expand_buffer
== NULL
)
4036 ff_expand_buffer
= (char_u
*)alloc(MAXPATHL
);
4037 if (ff_expand_buffer
== NULL
)
4041 /* Store information on starting dir now if path is relative.
4042 * If path is absolute, we do that later. */
4044 && (vim_ispathsep(path
[1]) || path
[1] == NUL
)
4045 && (!tagfile
|| vim_strchr(p_cpo
, CPO_DOTTAG
) == NULL
)
4046 && rel_fname
!= NULL
)
4048 int len
= (int)(gettail(rel_fname
) - rel_fname
);
4050 if (!vim_isAbsName(rel_fname
) && len
+ 1 < MAXPATHL
)
4052 /* Make the start dir an absolute path name. */
4053 vim_strncpy(ff_expand_buffer
, rel_fname
, len
);
4054 ff_search_ctx
->ffsc_start_dir
= FullName_save(ff_expand_buffer
,
4058 ff_search_ctx
->ffsc_start_dir
= vim_strnsave(rel_fname
, len
);
4059 if (ff_search_ctx
->ffsc_start_dir
== NULL
)
4064 else if (*path
== NUL
|| !vim_isAbsName(path
))
4066 #ifdef BACKSLASH_IN_FILENAME
4067 /* "c:dir" needs "c:" to be expanded, otherwise use current dir */
4068 if (*path
!= NUL
&& path
[1] == ':')
4075 if (vim_FullName(drive
, ff_expand_buffer
, MAXPATHL
, TRUE
) == FAIL
)
4081 if (mch_dirname(ff_expand_buffer
, MAXPATHL
) == FAIL
)
4084 ff_search_ctx
->ffsc_start_dir
= vim_strsave(ff_expand_buffer
);
4085 if (ff_search_ctx
->ffsc_start_dir
== NULL
)
4088 #ifdef BACKSLASH_IN_FILENAME
4089 /* A path that starts with "/dir" is relative to the drive, not to the
4090 * directory (but not for "//machine/dir"). Only use the drive name. */
4091 if ((*path
== '/' || *path
== '\\')
4092 && path
[1] != path
[0]
4093 && ff_search_ctx
->ffsc_start_dir
[1] == ':')
4094 ff_search_ctx
->ffsc_start_dir
[2] = NUL
;
4098 #ifdef FEAT_PATH_EXTRA
4100 * If stopdirs are given, split them into an array of pointers.
4101 * If this fails (mem allocation), there is no upward search at all or a
4102 * stop directory is not recognized -> continue silently.
4103 * If stopdirs just contains a ";" or is empty,
4104 * ff_search_ctx->ffsc_stopdirs_v will only contain a NULL pointer. This
4105 * is handled as unlimited upward search. See function
4106 * ff_path_in_stoplist() for details.
4108 if (stopdirs
!= NULL
)
4110 char_u
*walker
= stopdirs
;
4113 while (*walker
== ';')
4117 ff_search_ctx
->ffsc_stopdirs_v
=
4118 (char_u
**)alloc((unsigned)sizeof(char_u
*));
4120 if (ff_search_ctx
->ffsc_stopdirs_v
!= NULL
)
4128 ptr
= vim_realloc(ff_search_ctx
->ffsc_stopdirs_v
,
4129 (dircount
+ 1) * sizeof(char_u
*));
4131 ff_search_ctx
->ffsc_stopdirs_v
= ptr
;
4133 /* ignore, keep what we have and continue */
4135 walker
= vim_strchr(walker
, ';');
4138 ff_search_ctx
->ffsc_stopdirs_v
[dircount
-1] =
4139 vim_strnsave(helper
, (int)(walker
- helper
));
4143 /* this might be "", which means ascent till top
4144 * of directory tree.
4146 ff_search_ctx
->ffsc_stopdirs_v
[dircount
-1] =
4147 vim_strsave(helper
);
4151 } while (walker
!= NULL
);
4152 ff_search_ctx
->ffsc_stopdirs_v
[dircount
-1] = NULL
;
4157 #ifdef FEAT_PATH_EXTRA
4158 ff_search_ctx
->ffsc_level
= level
;
4162 * -wildcard_stuff (might be NULL)
4164 wc_part
= vim_strchr(path
, '*');
4165 if (wc_part
!= NULL
)
4171 /* save the fix part of the path */
4172 ff_search_ctx
->ffsc_fix_path
= vim_strnsave(path
,
4173 (int)(wc_part
- path
));
4176 * copy wc_path and add restricts to the '**' wildcard.
4177 * The octet after a '**' is used as a (binary) counter.
4178 * So '**3' is transposed to '**^C' ('^C' is ASCII value 3)
4179 * or '**76' is transposed to '**N'( 'N' is ASCII value 76).
4180 * For EBCDIC you get different character values.
4181 * If no restrict is given after '**' the default is used.
4182 * Due to this technic the path looks awful if you print it as a
4186 while (*wc_part
!= NUL
)
4188 if (STRNCMP(wc_part
, "**", 2) == 0)
4190 ff_expand_buffer
[len
++] = *wc_part
++;
4191 ff_expand_buffer
[len
++] = *wc_part
++;
4193 llevel
= strtol((char *)wc_part
, &errpt
, 10);
4194 if ((char_u
*)errpt
!= wc_part
&& llevel
> 0 && llevel
< 255)
4195 ff_expand_buffer
[len
++] = llevel
;
4196 else if ((char_u
*)errpt
!= wc_part
&& llevel
== 0)
4197 /* restrict is 0 -> remove already added '**' */
4200 ff_expand_buffer
[len
++] = FF_MAX_STAR_STAR_EXPAND
;
4201 wc_part
= (char_u
*)errpt
;
4202 if (*wc_part
!= NUL
&& !vim_ispathsep(*wc_part
))
4204 EMSG2(_("E343: Invalid path: '**[number]' must be at the end of the path or be followed by '%s'."), PATHSEPSTR
);
4209 ff_expand_buffer
[len
++] = *wc_part
++;
4211 ff_expand_buffer
[len
] = NUL
;
4212 ff_search_ctx
->ffsc_wc_path
= vim_strsave(ff_expand_buffer
);
4214 if (ff_search_ctx
->ffsc_wc_path
== NULL
)
4219 ff_search_ctx
->ffsc_fix_path
= vim_strsave(path
);
4221 if (ff_search_ctx
->ffsc_start_dir
== NULL
)
4223 /* store the fix part as startdir.
4224 * This is needed if the parameter path is fully qualified.
4226 ff_search_ctx
->ffsc_start_dir
= vim_strsave(ff_search_ctx
->ffsc_fix_path
);
4227 if (ff_search_ctx
->ffsc_start_dir
)
4228 ff_search_ctx
->ffsc_fix_path
[0] = NUL
;
4231 /* create an absolute path */
4232 STRCPY(ff_expand_buffer
, ff_search_ctx
->ffsc_start_dir
);
4233 add_pathsep(ff_expand_buffer
);
4234 STRCAT(ff_expand_buffer
, ff_search_ctx
->ffsc_fix_path
);
4235 add_pathsep(ff_expand_buffer
);
4237 sptr
= ff_create_stack_element(ff_expand_buffer
,
4238 #ifdef FEAT_PATH_EXTRA
4239 ff_search_ctx
->ffsc_wc_path
,
4248 ff_search_ctx
->ffsc_file_to_search
= vim_strsave(filename
);
4249 if (ff_search_ctx
->ffsc_file_to_search
== NULL
)
4252 return ff_search_ctx
;
4256 * We clear the search context now!
4257 * Even when the caller gave us a (perhaps valid) context we free it here,
4258 * as we might have already destroyed it.
4260 vim_findfile_cleanup(ff_search_ctx
);
4264 #if defined(FEAT_PATH_EXTRA) || defined(PROTO)
4266 * Get the stopdir string. Check that ';' is not escaped.
4269 vim_findfile_stopdir(buf
)
4272 char_u
*r_ptr
= buf
;
4274 while (*r_ptr
!= NUL
&& *r_ptr
!= ';')
4276 if (r_ptr
[0] == '\\' && r_ptr
[1] == ';')
4278 /* overwrite the escape char,
4279 * use STRLEN(r_ptr) to move the trailing '\0'
4281 mch_memmove(r_ptr
, r_ptr
+ 1, STRLEN(r_ptr
));
4291 else if (*r_ptr
== NUL
)
4297 /* Clean up the given search context. Can handle a NULL pointer */
4299 vim_findfile_cleanup(ctx
)
4305 ff_search_ctx
= ctx
;
4307 vim_findfile_free_visited(ctx
);
4310 ff_search_ctx
= NULL
;
4314 * Find a file in a search context.
4315 * The search context was created with vim_findfile_init() above.
4316 * Return a pointer to an allocated file name or NULL if nothing found.
4317 * To get all matching files call this function until you get NULL.
4319 * If the passed search_context is NULL, NULL is returned.
4321 * The search algorithm is depth first. To change this replace the
4322 * stack with a list (don't forget to leave partly searched directories on the
4326 vim_findfile(search_ctx
)
4330 #ifdef FEAT_PATH_EXTRA
4331 char_u
*rest_of_wildcards
;
4332 char_u
*path_end
= NULL
;
4335 #if defined(FEAT_SEARCHPATH) || defined(FEAT_PATH_EXTRA)
4340 #ifdef FEAT_SEARCHPATH
4344 if (search_ctx
== NULL
)
4347 ff_search_ctx
= (ff_search_ctx_T
*)search_ctx
;
4350 * filepath is used as buffer for various actions and as the storage to
4351 * return a found filename.
4353 if ((file_path
= alloc((int)MAXPATHL
)) == NULL
)
4356 #ifdef FEAT_PATH_EXTRA
4357 /* store the end of the start dir -- needed for upward search */
4358 if (ff_search_ctx
->ffsc_start_dir
!= NULL
)
4359 path_end
= &ff_search_ctx
->ffsc_start_dir
[STRLEN(ff_search_ctx
->ffsc_start_dir
)];
4362 #ifdef FEAT_PATH_EXTRA
4363 /* upward search loop */
4367 /* downward search loop */
4370 /* check if user user wants to stop the search*/
4375 /* get directory to work on from stack */
4381 * TODO: decide if we leave this test in
4383 * GOOD: don't search a directory(-tree) twice.
4384 * BAD: - check linked list for every new directory entered.
4385 * - check for double files also done below
4387 * Here we check if we already searched this directory.
4388 * We already searched a directory if:
4389 * 1) The directory is the same.
4390 * 2) We would use the same wildcard string.
4392 * Good if you have links on same directory via several ways
4393 * or you have selfreferences in directories (e.g. SuSE Linux 6.3:
4394 * /etc/rc.d/init.d is linked to /etc/rc.d -> endless loop)
4396 * This check is only needed for directories we work on for the
4397 * first time (hence ctx->ff_filearray == NULL)
4399 if (ctx
->ffs_filearray
== NULL
4400 && ff_check_visited(&ff_search_ctx
->ffsc_dir_visited_list
4401 ->ffvl_visited_list
,
4403 #ifdef FEAT_PATH_EXTRA
4411 verbose_enter_scroll();
4412 smsg((char_u
*)"Already Searched: %s (%s)",
4413 ctx
->ffs_fix_path
, ctx
->ffs_wc_path
);
4414 /* don't overwrite this either */
4415 msg_puts((char_u
*)"\n");
4416 verbose_leave_scroll();
4419 ff_free_stack_element(ctx
);
4423 else if (p_verbose
>= 5)
4425 verbose_enter_scroll();
4426 smsg((char_u
*)"Searching: %s (%s)",
4427 ctx
->ffs_fix_path
, ctx
->ffs_wc_path
);
4428 /* don't overwrite this either */
4429 msg_puts((char_u
*)"\n");
4430 verbose_leave_scroll();
4435 if (ctx
->ffs_level
<= 0)
4437 ff_free_stack_element(ctx
);
4444 * If no filearray till now expand wildcards
4445 * The function expand_wildcards() can handle an array of paths
4446 * and all possible expands are returned in one array. We use this
4447 * to handle the expansion of '**' into an empty string.
4449 if (ctx
->ffs_filearray
== NULL
)
4453 /* we use filepath to build the path expand_wildcards() should
4456 dirptrs
[0] = file_path
;
4459 /* if we have a start dir copy it in */
4460 if (!vim_isAbsName(ctx
->ffs_fix_path
)
4461 && ff_search_ctx
->ffsc_start_dir
)
4463 STRCPY(file_path
, ff_search_ctx
->ffsc_start_dir
);
4464 add_pathsep(file_path
);
4467 /* append the fix part of the search path */
4468 STRCAT(file_path
, ctx
->ffs_fix_path
);
4469 add_pathsep(file_path
);
4471 #ifdef FEAT_PATH_EXTRA
4472 rest_of_wildcards
= ctx
->ffs_wc_path
;
4473 if (*rest_of_wildcards
!= NUL
)
4475 len
= (int)STRLEN(file_path
);
4476 if (STRNCMP(rest_of_wildcards
, "**", 2) == 0)
4478 /* pointer to the restrict byte
4479 * The restrict byte is not a character!
4481 p
= rest_of_wildcards
+ 2;
4486 file_path
[len
++] = '*';
4491 /* remove '**<numb> from wildcards */
4492 mch_memmove(rest_of_wildcards
,
4493 rest_of_wildcards
+ 3,
4494 STRLEN(rest_of_wildcards
+ 3) + 1);
4497 rest_of_wildcards
+= 3;
4499 if (ctx
->ffs_star_star_empty
== 0)
4501 /* if not done before, expand '**' to empty */
4502 ctx
->ffs_star_star_empty
= 1;
4503 dirptrs
[1] = ctx
->ffs_fix_path
;
4508 * Here we copy until the next path separator or the end of
4509 * the path. If we stop at a path separator, there is
4510 * still something else left. This is handled below by
4511 * pushing every directory returned from expand_wildcards()
4512 * on the stack again for further search.
4514 while (*rest_of_wildcards
4515 && !vim_ispathsep(*rest_of_wildcards
))
4516 file_path
[len
++] = *rest_of_wildcards
++;
4518 file_path
[len
] = NUL
;
4519 if (vim_ispathsep(*rest_of_wildcards
))
4520 rest_of_wildcards
++;
4525 * Expand wildcards like "*" and "$VAR".
4526 * If the path is a URL don't try this.
4528 if (path_with_url(dirptrs
[0]))
4530 ctx
->ffs_filearray
= (char_u
**)
4531 alloc((unsigned)sizeof(char *));
4532 if (ctx
->ffs_filearray
!= NULL
4533 && (ctx
->ffs_filearray
[0]
4534 = vim_strsave(dirptrs
[0])) != NULL
)
4535 ctx
->ffs_filearray_size
= 1;
4537 ctx
->ffs_filearray_size
= 0;
4540 expand_wildcards((dirptrs
[1] == NULL
) ? 1 : 2, dirptrs
,
4541 &ctx
->ffs_filearray_size
,
4542 &ctx
->ffs_filearray
,
4543 EW_DIR
|EW_ADDSLASH
|EW_SILENT
);
4545 ctx
->ffs_filearray_cur
= 0;
4548 #ifdef FEAT_PATH_EXTRA
4550 rest_of_wildcards
= &ctx
->ffs_wc_path
[STRLEN(ctx
->ffs_wc_path
)];
4553 if (ctx
->ffs_stage
== 0)
4555 /* this is the first time we work on this directory */
4556 #ifdef FEAT_PATH_EXTRA
4557 if (*rest_of_wildcards
== NUL
)
4561 * we don't have further wildcards to expand, so we have to
4562 * check for the final file now
4564 for (i
= ctx
->ffs_filearray_cur
;
4565 i
< ctx
->ffs_filearray_size
; ++i
)
4567 if (!path_with_url(ctx
->ffs_filearray
[i
])
4568 && !mch_isdir(ctx
->ffs_filearray
[i
]))
4569 continue; /* not a directory */
4571 /* prepare the filename to be checked for existance
4573 STRCPY(file_path
, ctx
->ffs_filearray
[i
]);
4574 add_pathsep(file_path
);
4575 STRCAT(file_path
, ff_search_ctx
->ffsc_file_to_search
);
4578 * Try without extra suffix and then with suffixes
4579 * from 'suffixesadd'.
4581 #ifdef FEAT_SEARCHPATH
4582 len
= (int)STRLEN(file_path
);
4583 suf
= curbuf
->b_p_sua
;
4587 /* if file exists and we didn't already find it */
4588 if ((path_with_url(file_path
)
4589 || (mch_getperm(file_path
) >= 0
4590 && (!ff_search_ctx
->ffsc_need_dir
4591 || mch_isdir(file_path
))))
4593 && (ff_check_visited(
4594 &ff_search_ctx
->ffsc_visited_list
->ffvl_visited_list
,
4596 #ifdef FEAT_PATH_EXTRA
4604 if (ff_check_visited(
4605 &ff_search_ctx
->ffsc_visited_list
->ffvl_visited_list
,
4607 #ifdef FEAT_PATH_EXTRA
4614 verbose_enter_scroll();
4615 smsg((char_u
*)"Already: %s",
4617 /* don't overwrite this either */
4618 msg_puts((char_u
*)"\n");
4619 verbose_leave_scroll();
4625 /* push dir to examine rest of subdirs later */
4626 ctx
->ffs_filearray_cur
= i
+ 1;
4629 simplify_filename(file_path
);
4630 if (mch_dirname(ff_expand_buffer
, MAXPATHL
)
4633 p
= shorten_fname(file_path
,
4636 mch_memmove(file_path
, p
,
4642 verbose_enter_scroll();
4643 smsg((char_u
*)"HIT: %s", file_path
);
4644 /* don't overwrite this either */
4645 msg_puts((char_u
*)"\n");
4646 verbose_leave_scroll();
4652 #ifdef FEAT_SEARCHPATH
4653 /* Not found or found already, try next suffix. */
4656 copy_option_part(&suf
, file_path
+ len
,
4657 MAXPATHL
- len
, ",");
4662 #ifdef FEAT_PATH_EXTRA
4666 * still wildcards left, push the directories for further
4669 for (i
= ctx
->ffs_filearray_cur
;
4670 i
< ctx
->ffs_filearray_size
; ++i
)
4672 if (!mch_isdir(ctx
->ffs_filearray
[i
]))
4673 continue; /* not a directory */
4675 ff_push(ff_create_stack_element(ctx
->ffs_filearray
[i
],
4676 rest_of_wildcards
, ctx
->ffs_level
- 1, 0));
4680 ctx
->ffs_filearray_cur
= 0;
4684 #ifdef FEAT_PATH_EXTRA
4686 * if wildcards contains '**' we have to descent till we reach the
4687 * leaves of the directory tree.
4689 if (STRNCMP(ctx
->ffs_wc_path
, "**", 2) == 0)
4691 for (i
= ctx
->ffs_filearray_cur
;
4692 i
< ctx
->ffs_filearray_size
; ++i
)
4694 if (fnamecmp(ctx
->ffs_filearray
[i
], ctx
->ffs_fix_path
) == 0)
4695 continue; /* don't repush same directory */
4696 if (!mch_isdir(ctx
->ffs_filearray
[i
]))
4697 continue; /* not a directory */
4698 ff_push(ff_create_stack_element(ctx
->ffs_filearray
[i
],
4699 ctx
->ffs_wc_path
, ctx
->ffs_level
- 1, 1));
4704 /* we are done with the current directory */
4705 ff_free_stack_element(ctx
);
4709 #ifdef FEAT_PATH_EXTRA
4710 /* If we reached this, we didn't find anything downwards.
4711 * Let's check if we should do an upward search.
4713 if (ff_search_ctx
->ffsc_start_dir
4714 && ff_search_ctx
->ffsc_stopdirs_v
!= NULL
&& !got_int
)
4718 /* is the last starting directory in the stop list? */
4719 if (ff_path_in_stoplist(ff_search_ctx
->ffsc_start_dir
,
4720 (int)(path_end
- ff_search_ctx
->ffsc_start_dir
),
4721 ff_search_ctx
->ffsc_stopdirs_v
) == TRUE
)
4724 /* cut of last dir */
4725 while (path_end
> ff_search_ctx
->ffsc_start_dir
4726 && vim_ispathsep(*path_end
))
4728 while (path_end
> ff_search_ctx
->ffsc_start_dir
4729 && !vim_ispathsep(path_end
[-1]))
4734 if (*ff_search_ctx
->ffsc_start_dir
== 0)
4737 STRCPY(file_path
, ff_search_ctx
->ffsc_start_dir
);
4738 add_pathsep(file_path
);
4739 STRCAT(file_path
, ff_search_ctx
->ffsc_fix_path
);
4741 /* create a new stack entry */
4742 sptr
= ff_create_stack_element(file_path
,
4743 ff_search_ctx
->ffsc_wc_path
, ff_search_ctx
->ffsc_level
, 0);
4753 vim_free(file_path
);
4758 * Free the list of lists of visited files and directories
4759 * Can handle it if the passed search_context is NULL;
4762 vim_findfile_free_visited(search_ctx
)
4765 if (search_ctx
== NULL
)
4768 ff_search_ctx
= (ff_search_ctx_T
*)search_ctx
;
4770 vim_findfile_free_visited_list(&ff_search_ctx
->ffsc_visited_lists_list
);
4771 vim_findfile_free_visited_list(&ff_search_ctx
->ffsc_dir_visited_lists_list
);
4775 vim_findfile_free_visited_list(list_headp
)
4776 ff_visited_list_hdr_T
**list_headp
;
4778 ff_visited_list_hdr_T
*vp
;
4780 while (*list_headp
!= NULL
)
4782 vp
= (*list_headp
)->ffvl_next
;
4783 ff_free_visited_list((*list_headp
)->ffvl_visited_list
);
4785 vim_free((*list_headp
)->ffvl_filename
);
4786 vim_free(*list_headp
);
4793 ff_free_visited_list(vl
)
4801 #ifdef FEAT_PATH_EXTRA
4802 vim_free(vl
->ffv_wc_path
);
4811 * Returns the already visited list for the given filename. If none is found it
4812 * allocates a new one.
4814 static ff_visited_list_hdr_T
*
4815 ff_get_visited_list(filename
, list_headp
)
4817 ff_visited_list_hdr_T
**list_headp
;
4819 ff_visited_list_hdr_T
*retptr
= NULL
;
4821 /* check if a visited list for the given filename exists */
4822 if (*list_headp
!= NULL
)
4824 retptr
= *list_headp
;
4825 while (retptr
!= NULL
)
4827 if (fnamecmp(filename
, retptr
->ffvl_filename
) == 0)
4832 verbose_enter_scroll();
4833 smsg((char_u
*)"ff_get_visited_list: FOUND list for %s",
4835 /* don't overwrite this either */
4836 msg_puts((char_u
*)"\n");
4837 verbose_leave_scroll();
4842 retptr
= retptr
->ffvl_next
;
4849 verbose_enter_scroll();
4850 smsg((char_u
*)"ff_get_visited_list: new list for %s", filename
);
4851 /* don't overwrite this either */
4852 msg_puts((char_u
*)"\n");
4853 verbose_leave_scroll();
4858 * if we reach this we didn't find a list and we have to allocate new list
4860 retptr
= (ff_visited_list_hdr_T
*)alloc((unsigned)sizeof(*retptr
));
4864 retptr
->ffvl_visited_list
= NULL
;
4865 retptr
->ffvl_filename
= vim_strsave(filename
);
4866 if (retptr
->ffvl_filename
== NULL
)
4871 retptr
->ffvl_next
= *list_headp
;
4872 *list_headp
= retptr
;
4877 #ifdef FEAT_PATH_EXTRA
4879 * check if two wildcard paths are equal. Returns TRUE or FALSE.
4880 * They are equal if:
4881 * - both paths are NULL
4882 * - they have the same length
4883 * - char by char comparison is OK
4884 * - the only differences are in the counters behind a '**', so
4885 * '**\20' is equal to '**\24'
4897 if (s1
== NULL
|| s2
== NULL
)
4900 if (STRLEN(s1
) != STRLEN(s2
))
4903 for (i
= 0; s1
[i
] != NUL
&& s2
[i
] != NUL
; i
++)
4906 #ifdef CASE_INSENSITIVE_FILENAME
4907 && TOUPPER_LOC(s1
[i
]) != TOUPPER_LOC(s2
[i
])
4912 if (s1
[i
-1] == '*' && s1
[i
-2] == '*')
4925 * maintains the list of already visited files and dirs
4926 * returns FAIL if the given file/dir is already in the list
4927 * returns OK if it is newly added
4929 * TODO: What to do on memory allocation problems?
4930 * -> return TRUE - Better the file is found several times instead of
4934 ff_check_visited(visited_list
, fname
4935 #ifdef FEAT_PATH_EXTRA
4939 ff_visited_T
**visited_list
;
4941 #ifdef FEAT_PATH_EXTRA
4951 /* For an URL we only compare the name, otherwise we compare the
4952 * device/inode (unix) or the full path name (not Unix). */
4953 if (path_with_url(fname
))
4955 vim_strncpy(ff_expand_buffer
, fname
, MAXPATHL
- 1);
4962 ff_expand_buffer
[0] = NUL
;
4964 if (mch_stat((char *)fname
, &st
) < 0)
4966 if (vim_FullName(fname
, ff_expand_buffer
, MAXPATHL
, TRUE
) == FAIL
)
4971 /* check against list of already visited files */
4972 for (vp
= *visited_list
; vp
!= NULL
; vp
= vp
->ffv_next
)
4977 ? (vp
->ffv_dev
== st
.st_dev
4978 && vp
->ffv_ino
== st
.st_ino
)
4981 fnamecmp(vp
->ffv_fname
, ff_expand_buffer
) == 0
4984 #ifdef FEAT_PATH_EXTRA
4985 /* are the wildcard parts equal */
4986 if (ff_wc_equal(vp
->ffv_wc_path
, wc_path
) == TRUE
)
4988 /* already visited */
4994 * New file/dir. Add it to the list of visited files/dirs.
4996 vp
= (ff_visited_T
*)alloc((unsigned)(sizeof(ff_visited_T
)
4997 + STRLEN(ff_expand_buffer
)));
5004 vp
->ffv_ino
= st
.st_ino
;
5005 vp
->ffv_dev
= st
.st_dev
;
5006 vp
->ffv_fname
[0] = NUL
;
5013 STRCPY(vp
->ffv_fname
, ff_expand_buffer
);
5017 #ifdef FEAT_PATH_EXTRA
5018 if (wc_path
!= NULL
)
5019 vp
->ffv_wc_path
= vim_strsave(wc_path
);
5021 vp
->ffv_wc_path
= NULL
;
5024 vp
->ffv_next
= *visited_list
;
5032 * create stack element from given path pieces
5035 ff_create_stack_element(fix_part
,
5036 #ifdef FEAT_PATH_EXTRA
5039 level
, star_star_empty
)
5041 #ifdef FEAT_PATH_EXTRA
5045 int star_star_empty
;
5049 new = (ff_stack_T
*)alloc((unsigned)sizeof(ff_stack_T
));
5053 new->ffs_prev
= NULL
;
5054 new->ffs_filearray
= NULL
;
5055 new->ffs_filearray_size
= 0;
5056 new->ffs_filearray_cur
= 0;
5058 new->ffs_level
= level
;
5059 new->ffs_star_star_empty
= star_star_empty
;;
5061 /* the following saves NULL pointer checks in vim_findfile */
5062 if (fix_part
== NULL
)
5063 fix_part
= (char_u
*)"";
5064 new->ffs_fix_path
= vim_strsave(fix_part
);
5066 #ifdef FEAT_PATH_EXTRA
5067 if (wc_part
== NULL
)
5068 wc_part
= (char_u
*)"";
5069 new->ffs_wc_path
= vim_strsave(wc_part
);
5072 if (new->ffs_fix_path
== NULL
5073 #ifdef FEAT_PATH_EXTRA
5074 || new->ffs_wc_path
== NULL
5078 ff_free_stack_element(new);
5086 * push a dir on the directory stack
5092 /* check for NULL pointer, not to return an error to the user, but
5093 * to prevent a crash */
5096 ctx
->ffs_prev
= ff_search_ctx
->ffsc_stack_ptr
;
5097 ff_search_ctx
->ffsc_stack_ptr
= ctx
;
5102 * pop a dir from the directory stack
5103 * returns NULL if stack is empty
5110 sptr
= ff_search_ctx
->ffsc_stack_ptr
;
5111 if (ff_search_ctx
->ffsc_stack_ptr
!= NULL
)
5112 ff_search_ctx
->ffsc_stack_ptr
= ff_search_ctx
->ffsc_stack_ptr
->ffs_prev
;
5118 * free the given stack element
5121 ff_free_stack_element(ctx
)
5124 /* vim_free handles possible NULL pointers */
5125 vim_free(ctx
->ffs_fix_path
);
5126 #ifdef FEAT_PATH_EXTRA
5127 vim_free(ctx
->ffs_wc_path
);
5130 if (ctx
->ffs_filearray
!= NULL
)
5131 FreeWild(ctx
->ffs_filearray_size
, ctx
->ffs_filearray
);
5137 * clear the search context
5144 /* clear up stack */
5145 while ((sptr
= ff_pop()) != NULL
)
5146 ff_free_stack_element(sptr
);
5148 vim_free(ff_search_ctx
->ffsc_file_to_search
);
5149 vim_free(ff_search_ctx
->ffsc_start_dir
);
5150 vim_free(ff_search_ctx
->ffsc_fix_path
);
5151 #ifdef FEAT_PATH_EXTRA
5152 vim_free(ff_search_ctx
->ffsc_wc_path
);
5155 #ifdef FEAT_PATH_EXTRA
5156 if (ff_search_ctx
->ffsc_stopdirs_v
!= NULL
)
5160 while (ff_search_ctx
->ffsc_stopdirs_v
[i
] != NULL
)
5162 vim_free(ff_search_ctx
->ffsc_stopdirs_v
[i
]);
5165 vim_free(ff_search_ctx
->ffsc_stopdirs_v
);
5167 ff_search_ctx
->ffsc_stopdirs_v
= NULL
;
5170 /* reset everything */
5171 ff_search_ctx
->ffsc_file_to_search
= NULL
;
5172 ff_search_ctx
->ffsc_start_dir
= NULL
;
5173 ff_search_ctx
->ffsc_fix_path
= NULL
;
5174 #ifdef FEAT_PATH_EXTRA
5175 ff_search_ctx
->ffsc_wc_path
= NULL
;
5176 ff_search_ctx
->ffsc_level
= 0;
5180 #ifdef FEAT_PATH_EXTRA
5182 * check if the given path is in the stopdirs
5183 * returns TRUE if yes else FALSE
5186 ff_path_in_stoplist(path
, path_len
, stopdirs_v
)
5189 char_u
**stopdirs_v
;
5193 /* eat up trailing path separators, except the first */
5194 while (path_len
> 1 && vim_ispathsep(path
[path_len
- 1]))
5197 /* if no path consider it as match */
5201 for (i
= 0; stopdirs_v
[i
] != NULL
; i
++)
5203 if ((int)STRLEN(stopdirs_v
[i
]) > path_len
)
5205 /* match for parent directory. So '/home' also matches
5206 * '/home/rks'. Check for PATHSEP in stopdirs_v[i], else
5207 * '/home/r' would also match '/home/rks'
5209 if (fnamencmp(stopdirs_v
[i
], path
, path_len
) == 0
5210 && vim_ispathsep(stopdirs_v
[i
][path_len
]))
5215 if (fnamecmp(stopdirs_v
[i
], path
) == 0)
5223 #if defined(FEAT_SEARCHPATH) || defined(PROTO)
5225 * Find the file name "ptr[len]" in the path.
5227 * On the first call set the parameter 'first' to TRUE to initialize
5228 * the search. For repeating calls to FALSE.
5230 * Repeating calls will return other files called 'ptr[len]' from the path.
5232 * Only on the first call 'ptr' and 'len' are used. For repeating calls they
5233 * don't need valid values.
5235 * If nothing found on the first call the option FNAME_MESS will issue the
5237 * 'Can't find file "<file>" in path'
5238 * On repeating calls:
5239 * 'No more file "<file>" found in path'
5242 * FNAME_MESS give error message when not found
5246 * Returns an allocated string for the file name. NULL for error.
5250 find_file_in_path(ptr
, len
, options
, first
, rel_fname
)
5251 char_u
*ptr
; /* file name */
5252 int len
; /* length of file name */
5254 int first
; /* use count'th matching file name */
5255 char_u
*rel_fname
; /* file name searching relative to */
5257 return find_file_in_path_option(ptr
, len
, options
, first
,
5258 *curbuf
->b_p_path
== NUL
? p_path
: curbuf
->b_p_path
,
5259 FALSE
, rel_fname
, curbuf
->b_p_sua
);
5262 static char_u
*ff_file_to_find
= NULL
;
5263 static void *fdip_search_ctx
= NULL
;
5265 #if defined(EXITFREE)
5269 vim_free(ff_file_to_find
);
5270 vim_findfile_cleanup(fdip_search_ctx
);
5275 * Find the directory name "ptr[len]" in the path.
5278 * FNAME_MESS give error message when not found
5282 * Returns an allocated string for the file name. NULL for error.
5285 find_directory_in_path(ptr
, len
, options
, rel_fname
)
5286 char_u
*ptr
; /* file name */
5287 int len
; /* length of file name */
5289 char_u
*rel_fname
; /* file name searching relative to */
5291 return find_file_in_path_option(ptr
, len
, options
, TRUE
, p_cdpath
,
5292 TRUE
, rel_fname
, (char_u
*)"");
5296 find_file_in_path_option(ptr
, len
, options
, first
, path_option
, need_dir
, rel_fname
, suffixes
)
5297 char_u
*ptr
; /* file name */
5298 int len
; /* length of file name */
5300 int first
; /* use count'th matching file name */
5301 char_u
*path_option
; /* p_path or p_cdpath */
5302 int need_dir
; /* looking for directory name */
5303 char_u
*rel_fname
; /* file name we are looking relative to. */
5304 char_u
*suffixes
; /* list of suffixes, 'suffixesadd' option */
5307 static int did_findfile_init
= FALSE
;
5309 char_u
*file_name
= NULL
;
5313 struct Process
*proc
= (struct Process
*)FindTask(0L);
5314 APTR save_winptr
= proc
->pr_WindowPtr
;
5316 /* Avoid a requester here for a volume that doesn't exist. */
5317 proc
->pr_WindowPtr
= (APTR
)-1L;
5322 /* copy file name into NameBuff, expanding environment variables */
5323 save_char
= ptr
[len
];
5325 expand_env(ptr
, NameBuff
, MAXPATHL
);
5326 ptr
[len
] = save_char
;
5328 vim_free(ff_file_to_find
);
5329 ff_file_to_find
= vim_strsave(NameBuff
);
5330 if (ff_file_to_find
== NULL
) /* out of memory */
5337 rel_to_curdir
= (ff_file_to_find
[0] == '.'
5338 && (ff_file_to_find
[1] == NUL
5339 || vim_ispathsep(ff_file_to_find
[1])
5340 || (ff_file_to_find
[1] == '.'
5341 && (ff_file_to_find
[2] == NUL
5342 || vim_ispathsep(ff_file_to_find
[2])))));
5343 if (vim_isAbsName(ff_file_to_find
)
5344 /* "..", "../path", "." and "./path": don't use the path_option */
5346 #if defined(MSWIN) || defined(MSDOS) || defined(OS2)
5347 /* handle "\tmp" as absolute path */
5348 || vim_ispathsep(ff_file_to_find
[0])
5349 /* handle "c:name" as absulute path */
5350 || (ff_file_to_find
[0] != NUL
&& ff_file_to_find
[1] == ':')
5353 /* handle ":tmp" as absolute path */
5354 || ff_file_to_find
[0] == ':'
5359 * Absolute path, no need to use "path_option".
5360 * If this is not a first call, return NULL. We already returned a
5361 * filename on the first call.
5368 if (path_with_url(ff_file_to_find
))
5370 file_name
= vim_strsave(ff_file_to_find
);
5374 /* When FNAME_REL flag given first use the directory of the file.
5375 * Otherwise or when this fails use the current directory. */
5376 for (run
= 1; run
<= 2; ++run
)
5378 l
= (int)STRLEN(ff_file_to_find
);
5381 && (options
& FNAME_REL
)
5382 && rel_fname
!= NULL
5383 && STRLEN(rel_fname
) + l
< MAXPATHL
)
5385 STRCPY(NameBuff
, rel_fname
);
5386 STRCPY(gettail(NameBuff
), ff_file_to_find
);
5387 l
= (int)STRLEN(NameBuff
);
5391 STRCPY(NameBuff
, ff_file_to_find
);
5395 /* When the file doesn't exist, try adding parts of
5402 /* "C:" by itself will fail for mch_getperm(),
5403 * assume it's always valid. */
5404 (need_dir
&& NameBuff
[0] != NUL
5405 && NameBuff
[1] == ':'
5406 && NameBuff
[2] == NUL
) ||
5408 (mch_getperm(NameBuff
) >= 0
5409 && (!need_dir
|| mch_isdir(NameBuff
))))
5411 file_name
= vim_strsave(NameBuff
);
5416 copy_option_part(&buf
, NameBuff
+ l
, MAXPATHL
- l
, ",");
5424 * Loop over all paths in the 'path' or 'cdpath' option.
5425 * When "first" is set, first setup to the start of the option.
5426 * Otherwise continue to find the next match.
5430 /* vim_findfile_free_visited can handle a possible NULL pointer */
5431 vim_findfile_free_visited(fdip_search_ctx
);
5433 did_findfile_init
= FALSE
;
5438 if (did_findfile_init
)
5440 ff_search_ctx
->ffsc_need_dir
= need_dir
;
5441 file_name
= vim_findfile(fdip_search_ctx
);
5442 ff_search_ctx
->ffsc_need_dir
= FALSE
;
5443 if (file_name
!= NULL
)
5446 did_findfile_init
= FALSE
;
5452 if (dir
== NULL
|| *dir
== NUL
)
5454 /* We searched all paths of the option, now we can
5455 * free the search context. */
5456 vim_findfile_cleanup(fdip_search_ctx
);
5457 fdip_search_ctx
= NULL
;
5461 if ((buf
= alloc((int)(MAXPATHL
))) == NULL
)
5464 /* copy next path */
5466 copy_option_part(&dir
, buf
, MAXPATHL
, " ,");
5468 #ifdef FEAT_PATH_EXTRA
5469 /* get the stopdir string */
5470 r_ptr
= vim_findfile_stopdir(buf
);
5474 fdip_search_ctx
= vim_findfile_init(buf
, ff_file_to_find
,
5475 r_ptr
, 100, FALSE
, TRUE
,
5476 fdip_search_ctx
, FALSE
, rel_fname
);
5477 if (fdip_search_ctx
!= NULL
)
5478 did_findfile_init
= TRUE
;
5483 if (file_name
== NULL
&& (options
& FNAME_MESS
))
5488 EMSG2(_("E344: Can't find directory \"%s\" in cdpath"),
5491 EMSG2(_("E345: Can't find file \"%s\" in path"),
5497 EMSG2(_("E346: No more directory \"%s\" found in cdpath"),
5500 EMSG2(_("E347: No more file \"%s\" found in path"),
5507 proc
->pr_WindowPtr
= save_winptr
;
5512 #endif /* FEAT_SEARCHPATH */
5515 * Change directory to "new_dir". If FEAT_SEARCHPATH is defined, search
5516 * 'cdpath' for relative directory names, otherwise just mch_chdir().
5522 #ifndef FEAT_SEARCHPATH
5523 return mch_chdir((char *)new_dir
);
5528 dir_name
= find_directory_in_path(new_dir
, (int)STRLEN(new_dir
),
5529 FNAME_MESS
, curbuf
->b_ffname
);
5530 if (dir_name
== NULL
)
5532 r
= mch_chdir((char *)dir_name
);
5539 * Get user name from machine-specific function.
5540 * Returns the user name in "buf[len]".
5541 * Some systems are quite slow in obtaining the user name (Windows NT), thus
5543 * Returns OK or FAIL.
5546 get_user_name(buf
, len
)
5550 if (username
== NULL
)
5552 if (mch_get_user_name(buf
, len
) == FAIL
)
5554 username
= vim_strsave(buf
);
5557 vim_strncpy(buf
, username
, len
- 1);
5563 * Our own qsort(), for systems that don't have it.
5564 * It's simple and slow. From the K&R C book.
5567 qsort(base
, elm_count
, elm_size
, cmp
)
5571 int (*cmp
) __ARGS((const void *, const void *));
5579 buf
= alloc((unsigned)elm_size
);
5583 for (gap
= elm_count
/ 2; gap
> 0; gap
/= 2)
5584 for (i
= gap
; i
< elm_count
; ++i
)
5585 for (j
= i
- gap
; j
>= 0; j
-= gap
)
5587 /* Compare the elements. */
5588 p1
= (char_u
*)base
+ j
* elm_size
;
5589 p2
= (char_u
*)base
+ (j
+ gap
) * elm_size
;
5590 if ((*cmp
)((void *)p1
, (void *)p2
) <= 0)
5592 /* Exchange the elemets. */
5593 mch_memmove(buf
, p1
, elm_size
);
5594 mch_memmove(p1
, p2
, elm_size
);
5595 mch_memmove(p2
, buf
, elm_size
);
5603 * Sort an array of strings.
5609 sort_compare
__ARGS((const void *s1
, const void *s2
));
5615 sort_compare(s1
, s2
)
5619 return STRCMP(*(char **)s1
, *(char **)s2
);
5623 sort_strings(files
, count
)
5627 qsort((void *)files
, (size_t)count
, sizeof(char_u
*), sort_compare
);
5630 #if !defined(NO_EXPANDPATH) || defined(PROTO)
5632 * Compare path "p[]" to "q[]".
5633 * If "maxlen" >= 0 compare "p[maxlen]" to "q[maxlen]"
5634 * Return value like strcmp(p, q), but consider path separators.
5637 pathcmp(p
, q
, maxlen
)
5642 const char *s
= NULL
;
5644 for (i
= 0; maxlen
< 0 || i
< maxlen
; ++i
)
5646 /* End of "p": check if "q" also ends or just has a slash. */
5649 if (q
[i
] == NUL
) /* full match */
5655 /* End of "q": check if "p" just has a slash. */
5663 #ifdef CASE_INSENSITIVE_FILENAME
5664 TOUPPER_LOC(p
[i
]) != TOUPPER_LOC(q
[i
])
5668 #ifdef BACKSLASH_IN_FILENAME
5669 /* consider '/' and '\\' to be equal */
5670 && !((p
[i
] == '/' && q
[i
] == '\\')
5671 || (p
[i
] == '\\' && q
[i
] == '/'))
5675 if (vim_ispathsep(p
[i
]))
5677 if (vim_ispathsep(q
[i
]))
5679 return ((char_u
*)p
)[i
] - ((char_u
*)q
)[i
]; /* no match */
5682 if (s
== NULL
) /* "i" ran into "maxlen" */
5685 /* ignore a trailing slash, but not "//" or ":/" */
5688 && !after_pathsep((char_u
*)s
, (char_u
*)s
+ i
)
5689 #ifdef BACKSLASH_IN_FILENAME
5690 && (s
[i
] == '/' || s
[i
] == '\\')
5695 return 0; /* match with trailing slash */
5697 return -1; /* no match */
5703 * The putenv() implementation below comes from the "screen" program.
5704 * Included with permission from Juergen Weigert.
5705 * See pty.c for the copyright notice.
5709 * putenv -- put value into environment
5711 * Usage: i = putenv (string)
5715 * where string is of the form <name>=<value>.
5716 * Putenv returns 0 normally, -1 on error (not enough core for malloc).
5718 * Putenv may need to add a new name into the environment, or to
5719 * associate a value longer than the current value with a particular
5720 * name. So, to make life simpler, putenv() copies your entire
5721 * environment into the heap (i.e. malloc()) from the stack
5722 * (i.e. where it resides when your process is initiated) the first
5725 * (history removed, not very interesting. See the "screen" sources.)
5728 #if !defined(HAVE_SETENV) && !defined(HAVE_PUTENV)
5730 #define EXTRASIZE 5 /* increment to add to env. size */
5732 static int envsize
= -1; /* current size of environment */
5733 #ifndef MACOS_CLASSIC
5736 char **environ
; /* the global which is your env. */
5738 static int findenv
__ARGS((char *name
)); /* look for a name in the env. */
5739 static int newenv
__ARGS((void)); /* copy env. from stack to heap */
5740 static int moreenv
__ARGS((void)); /* incr. size of env. */
5750 { /* first time putenv called */
5751 if (newenv() < 0) /* copy env. to heap */
5755 i
= findenv((char *)string
); /* look for name in environment */
5758 { /* name must be added */
5759 for (i
= 0; environ
[i
]; i
++);
5760 if (i
>= (envsize
- 1))
5761 { /* need new slot */
5765 p
= (char *)alloc((unsigned)(strlen(string
) + 1));
5766 if (p
== NULL
) /* not enough core */
5768 environ
[i
+ 1] = 0; /* new end of env. */
5771 { /* name already in env. */
5772 p
= vim_realloc(environ
[i
], strlen(string
) + 1);
5776 sprintf(p
, "%s", string
); /* copy into env. */
5786 char *namechar
, *envchar
;
5790 for (i
= 0; environ
[i
] && !found
; i
++)
5792 envchar
= environ
[i
];
5794 while (*namechar
&& *namechar
!= '=' && (*namechar
== *envchar
))
5799 found
= ((*namechar
== '\0' || *namechar
== '=') && *envchar
== '=');
5801 return found
? i
- 1 : -1;
5811 /* for Mac a new, empty environment is created */
5814 for (i
= 0; environ
[i
]; i
++)
5817 esize
= i
+ EXTRASIZE
+ 1;
5818 env
= (char **)alloc((unsigned)(esize
* sizeof (elem
)));
5823 for (i
= 0; environ
[i
]; i
++)
5825 elem
= (char *)alloc((unsigned)(strlen(environ
[i
]) + 1));
5829 strcpy(elem
, environ
[i
]);
5845 esize
= envsize
+ EXTRASIZE
;
5846 env
= (char **)vim_realloc((char *)environ
, esize
* sizeof (*env
));
5854 # ifdef USE_VIMPTY_GETENV
5856 vimpty_getenv(string
)
5857 const char_u
*string
;
5865 i
= findenv((char *)string
);
5870 p
= vim_strchr((char_u
*)environ
[i
], '=');
5875 #endif /* !defined(HAVE_SETENV) && !defined(HAVE_PUTENV) */
5877 #if defined(FEAT_EVAL) || defined(FEAT_SPELL) || defined(PROTO)
5879 * Return 0 for not writable, 1 for writable file, 2 for a dir which we have
5880 * rights to write into.
5887 #if defined(UNIX) || defined(VMS)
5891 #if defined(UNIX) || defined(VMS)
5892 perm
= mch_getperm(fname
);
5894 #ifndef MACOS_CLASSIC /* TODO: get either mch_writable or mch_access */
5897 mch_writable(fname
) &&
5899 # if defined(UNIX) || defined(VMS)
5903 mch_access((char *)fname
, W_OK
) == 0
5908 if (mch_isdir(fname
))
5916 * Print an error message with one or two "%s" and one or two string arguments.
5917 * This is not in message.c to avoid a warning for prototypes.
5921 char_u
*s
, *a1
, *a2
;
5924 return TRUE
; /* no error messages at the moment */
5925 vim_snprintf((char *)IObuff
, IOSIZE
, (char *)s
, (long_u
)a1
, (long_u
)a2
);
5926 return emsg(IObuff
);
5930 * Print an error message with one "%ld" and one long int argument.
5931 * This is not in message.c to avoid a warning for prototypes.
5939 return TRUE
; /* no error messages at the moment */
5940 vim_snprintf((char *)IObuff
, IOSIZE
, (char *)s
, n
);
5941 return emsg(IObuff
);