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