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 int coladvance2(pos_T *pos, int addspaces, int finetune, colnr_T wcol); 18 19 /* 20 * Return TRUE if in the current mode we need to use virtual. 21 */ 22 int 23 virtual_active(void) 24 { 25 // While an operator is being executed we return "virtual_op", because 26 // VIsual_active has already been reset, thus we can't check for "block" 27 // being used. 28 if (virtual_op != MAYBE) 29 return virtual_op; 30 return (ve_flags == VE_ALL 31 || ((ve_flags & VE_BLOCK) && VIsual_active && VIsual_mode == Ctrl_V) 32 || ((ve_flags & VE_INSERT) && (State & INSERT))); 33 } 34 35 /* 36 * Get the screen position of the cursor. 37 */ 38 int 39 getviscol(void) 40 { 41 colnr_T x; 42 43 getvvcol(curwin, &curwin->w_cursor, &x, NULL, NULL); 44 return (int)x; 45 } 46 47 /* 48 * Go to column "wcol", and add/insert white space as necessary to get the 49 * cursor in that column. 50 * The caller must have saved the cursor line for undo! 51 */ 52 int 53 coladvance_force(colnr_T wcol) 54 { 55 int rc = coladvance2(&curwin->w_cursor, TRUE, FALSE, wcol); 56 57 if (wcol == MAXCOL) 58 curwin->w_valid &= ~VALID_VIRTCOL; 59 else 60 { 61 // Virtcol is valid 62 curwin->w_valid |= VALID_VIRTCOL; 63 curwin->w_virtcol = wcol; 64 } 65 return rc; 66 } 67 68 /* 69 * Get the screen position of character col with a coladd in the cursor line. 70 */ 71 int 72 getviscol2(colnr_T col, colnr_T coladd UNUSED) 73 { 74 colnr_T x; 75 pos_T pos; 76 77 pos.lnum = curwin->w_cursor.lnum; 78 pos.col = col; 79 pos.coladd = coladd; 80 getvvcol(curwin, &pos, &x, NULL, NULL); 81 return (int)x; 82 } 83 84 /* 85 * Try to advance the Cursor to the specified screen column. 86 * If virtual editing: fine tune the cursor position. 87 * Note that all virtual positions off the end of a line should share 88 * a curwin->w_cursor.col value (n.b. this is equal to STRLEN(line)), 89 * beginning at coladd 0. 90 * 91 * return OK if desired column is reached, FAIL if not 92 */ 93 int 94 coladvance(colnr_T wcol) 95 { 96 int rc = getvpos(&curwin->w_cursor, wcol); 97 98 if (wcol == MAXCOL || rc == FAIL) 99 curwin->w_valid &= ~VALID_VIRTCOL; 100 else if (*ml_get_cursor() != TAB) 101 { 102 // Virtcol is valid when not on a TAB 103 curwin->w_valid |= VALID_VIRTCOL; 104 curwin->w_virtcol = wcol; 105 } 106 return rc; 107 } 108 109 /* 110 * Return in "pos" the position of the cursor advanced to screen column "wcol". 111 * return OK if desired column is reached, FAIL if not 112 */ 113 int 114 getvpos(pos_T *pos, colnr_T wcol) 115 { 116 return coladvance2(pos, FALSE, virtual_active(), wcol); 117 } 118 119 static int 120 coladvance2( 121 pos_T *pos, 122 int addspaces, // change the text to achieve our goal? 123 int finetune, // change char offset for the exact column 124 colnr_T wcol_arg) // column to move to (can be negative) 125 { 126 colnr_T wcol = wcol_arg; 127 int idx; 128 char_u *ptr; 129 char_u *line; 130 colnr_T col = 0; 131 int csize = 0; 132 int one_more; 133 #ifdef FEAT_LINEBREAK 134 int head = 0; 135 #endif 136 137 one_more = (State & INSERT) 138 || restart_edit != NUL 139 || (VIsual_active && *p_sel != 'o') 140 || ((ve_flags & VE_ONEMORE) && wcol < MAXCOL); 141 line = ml_get_buf(curbuf, pos->lnum, FALSE); 142 143 if (wcol >= MAXCOL) 144 { 145 idx = (int)STRLEN(line) - 1 + one_more; 146 col = wcol; 147 148 if ((addspaces || finetune) && !VIsual_active) 149 { 150 curwin->w_curswant = linetabsize(line) + one_more; 151 if (curwin->w_curswant > 0) 152 --curwin->w_curswant; 153 } 154 } 155 else 156 { 157 int width = curwin->w_width - win_col_off(curwin); 158 159 if (finetune 160 && curwin->w_p_wrap 161 && curwin->w_width != 0 162 && wcol >= (colnr_T)width) 163 { 164 csize = linetabsize(line); 165 if (csize > 0) 166 csize--; 167 168 if (wcol / width > (colnr_T)csize / width 169 && ((State & INSERT) == 0 || (int)wcol > csize + 1)) 170 { 171 // In case of line wrapping don't move the cursor beyond the 172 // right screen edge. In Insert mode allow going just beyond 173 // the last character (like what happens when typing and 174 // reaching the right window edge). 175 wcol = (csize / width + 1) * width - 1; 176 } 177 } 178 179 ptr = line; 180 while (col <= wcol && *ptr != NUL) 181 { 182 // Count a tab for what it's worth (if list mode not on) 183 #ifdef FEAT_LINEBREAK 184 csize = win_lbr_chartabsize(curwin, line, ptr, col, &head); 185 MB_PTR_ADV(ptr); 186 #else 187 csize = lbr_chartabsize_adv(line, &ptr, col); 188 #endif 189 col += csize; 190 } 191 idx = (int)(ptr - line); 192 /* 193 * Handle all the special cases. The virtual_active() check 194 * is needed to ensure that a virtual position off the end of 195 * a line has the correct indexing. The one_more comparison 196 * replaces an explicit add of one_more later on. 197 */ 198 if (col > wcol || (!virtual_active() && one_more == 0)) 199 { 200 idx -= 1; 201 # ifdef FEAT_LINEBREAK 202 // Don't count the chars from 'showbreak'. 203 csize -= head; 204 # endif 205 col -= csize; 206 } 207 208 if (virtual_active() 209 && addspaces 210 && wcol >= 0 211 && ((col != wcol && col != wcol + 1) || csize > 1)) 212 { 213 // 'virtualedit' is set: The difference between wcol and col is 214 // filled with spaces. 215 216 if (line[idx] == NUL) 217 { 218 // Append spaces 219 int correct = wcol - col; 220 char_u *newline = alloc(idx + correct + 1); 221 int t; 222 223 if (newline == NULL) 224 return FAIL; 225 226 for (t = 0; t < idx; ++t) 227 newline[t] = line[t]; 228 229 for (t = 0; t < correct; ++t) 230 newline[t + idx] = ' '; 231 232 newline[idx + correct] = NUL; 233 234 ml_replace(pos->lnum, newline, FALSE); 235 changed_bytes(pos->lnum, (colnr_T)idx); 236 idx += correct; 237 col = wcol; 238 } 239 else 240 { 241 // Break a tab 242 int linelen = (int)STRLEN(line); 243 int correct = wcol - col - csize + 1; // negative!! 244 char_u *newline; 245 int t, s = 0; 246 int v; 247 248 if (-correct > csize) 249 return FAIL; 250 251 newline = alloc(linelen + csize); 252 if (newline == NULL) 253 return FAIL; 254 255 for (t = 0; t < linelen; t++) 256 { 257 if (t != idx) 258 newline[s++] = line[t]; 259 else 260 for (v = 0; v < csize; v++) 261 newline[s++] = ' '; 262 } 263 264 newline[linelen + csize - 1] = NUL; 265 266 ml_replace(pos->lnum, newline, FALSE); 267 changed_bytes(pos->lnum, idx); 268 idx += (csize - 1 + correct); 269 col += correct; 270 } 271 } 272 } 273 274 if (idx < 0) 275 pos->col = 0; 276 else 277 pos->col = idx; 278 279 pos->coladd = 0; 280 281 if (finetune) 282 { 283 if (wcol == MAXCOL) 284 { 285 // The width of the last character is used to set coladd. 286 if (!one_more) 287 { 288 colnr_T scol, ecol; 289 290 getvcol(curwin, pos, &scol, NULL, &ecol); 291 pos->coladd = ecol - scol; 292 } 293 } 294 else 295 { 296 int b = (int)wcol - (int)col; 297 298 // The difference between wcol and col is used to set coladd. 299 if (b > 0 && b < (MAXCOL - 2 * curwin->w_width)) 300 pos->coladd = b; 301 302 col += b; 303 } 304 } 305 306 // prevent from moving onto a trail byte 307 if (has_mbyte) 308 mb_adjustpos(curbuf, pos); 309 310 if (wcol < 0 || col < wcol) 311 return FAIL; 312 return OK; 313 } 314 315 /* 316 * Increment the cursor position. See inc() for return values. 317 */ 318 int 319 inc_cursor(void) 320 { 321 return inc(&curwin->w_cursor); 322 } 323 324 /* 325 * Increment the line pointer "lp" crossing line boundaries as necessary. 326 * Return 1 when going to the next line. 327 * Return 2 when moving forward onto a NUL at the end of the line). 328 * Return -1 when at the end of file. 329 * Return 0 otherwise. 330 */ 331 int 332 inc(pos_T *lp) 333 { 334 char_u *p; 335 336 // when searching position may be set to end of a line 337 if (lp->col != MAXCOL) 338 { 339 p = ml_get_pos(lp); 340 if (*p != NUL) // still within line, move to next char (may be NUL) 341 { 342 if (has_mbyte) 343 { 344 int l = (*mb_ptr2len)(p); 345 346 lp->col += l; 347 return ((p[l] != NUL) ? 0 : 2); 348 } 349 lp->col++; 350 lp->coladd = 0; 351 return ((p[1] != NUL) ? 0 : 2); 352 } 353 } 354 if (lp->lnum != curbuf->b_ml.ml_line_count) // there is a next line 355 { 356 lp->col = 0; 357 lp->lnum++; 358 lp->coladd = 0; 359 return 1; 360 } 361 return -1; 362 } 363 364 /* 365 * incl(lp): same as inc(), but skip the NUL at the end of non-empty lines 366 */ 367 int 368 incl(pos_T *lp) 369 { 370 int r; 371 372 if ((r = inc(lp)) >= 1 && lp->col) 373 r = inc(lp); 374 return r; 375 } 376 377 /* 378 * dec(p) 379 * 380 * Decrement the line pointer 'p' crossing line boundaries as necessary. 381 * Return 1 when crossing a line, -1 when at start of file, 0 otherwise. 382 */ 383 int 384 dec_cursor(void) 385 { 386 return dec(&curwin->w_cursor); 387 } 388 389 int 390 dec(pos_T *lp) 391 { 392 char_u *p; 393 394 lp->coladd = 0; 395 if (lp->col == MAXCOL) 396 { 397 // past end of line 398 p = ml_get(lp->lnum); 399 lp->col = (colnr_T)STRLEN(p); 400 if (has_mbyte) 401 lp->col -= (*mb_head_off)(p, p + lp->col); 402 return 0; 403 } 404 405 if (lp->col > 0) 406 { 407 // still within line 408 lp->col--; 409 if (has_mbyte) 410 { 411 p = ml_get(lp->lnum); 412 lp->col -= (*mb_head_off)(p, p + lp->col); 413 } 414 return 0; 415 } 416 417 if (lp->lnum > 1) 418 { 419 // there is a prior line 420 lp->lnum--; 421 p = ml_get(lp->lnum); 422 lp->col = (colnr_T)STRLEN(p); 423 if (has_mbyte) 424 lp->col -= (*mb_head_off)(p, p + lp->col); 425 return 1; 426 } 427 428 // at start of file 429 return -1; 430 } 431 432 /* 433 * decl(lp): same as dec(), but skip the NUL at the end of non-empty lines 434 */ 435 int 436 decl(pos_T *lp) 437 { 438 int r; 439 440 if ((r = dec(lp)) == 1 && lp->col) 441 r = dec(lp); 442 return r; 443 } 444 445 /* 446 * Get the line number relative to the current cursor position, i.e. the 447 * difference between line number and cursor position. Only look for lines that 448 * can be visible, folded lines don't count. 449 */ 450 linenr_T 451 get_cursor_rel_lnum( 452 win_T *wp, 453 linenr_T lnum) // line number to get the result for 454 { 455 linenr_T cursor = wp->w_cursor.lnum; 456 linenr_T retval = 0; 457 458 #ifdef FEAT_FOLDING 459 if (hasAnyFolding(wp)) 460 { 461 if (lnum > cursor) 462 { 463 while (lnum > cursor) 464 { 465 (void)hasFoldingWin(wp, lnum, &lnum, NULL, TRUE, NULL); 466 // if lnum and cursor are in the same fold, 467 // now lnum <= cursor 468 if (lnum > cursor) 469 retval++; 470 lnum--; 471 } 472 } 473 else if (lnum < cursor) 474 { 475 while (lnum < cursor) 476 { 477 (void)hasFoldingWin(wp, lnum, NULL, &lnum, TRUE, NULL); 478 // if lnum and cursor are in the same fold, 479 // now lnum >= cursor 480 if (lnum < cursor) 481 retval--; 482 lnum++; 483 } 484 } 485 // else if (lnum == cursor) 486 // retval = 0; 487 } 488 else 489 #endif 490 retval = lnum - cursor; 491 492 return retval; 493 } 494 495 /* 496 * Make sure "pos.lnum" and "pos.col" are valid in "buf". 497 * This allows for the col to be on the NUL byte. 498 */ 499 void 500 check_pos(buf_T *buf, pos_T *pos) 501 { 502 char_u *line; 503 colnr_T len; 504 505 if (pos->lnum > buf->b_ml.ml_line_count) 506 pos->lnum = buf->b_ml.ml_line_count; 507 508 if (pos->col > 0) 509 { 510 line = ml_get_buf(buf, pos->lnum, FALSE); 511 len = (colnr_T)STRLEN(line); 512 if (pos->col > len) 513 pos->col = len; 514 } 515 } 516 517 /* 518 * Make sure curwin->w_cursor.lnum is valid. 519 */ 520 void 521 check_cursor_lnum(void) 522 { 523 if (curwin->w_cursor.lnum > curbuf->b_ml.ml_line_count) 524 { 525 #ifdef FEAT_FOLDING 526 // If there is a closed fold at the end of the file, put the cursor in 527 // its first line. Otherwise in the last line. 528 if (!hasFolding(curbuf->b_ml.ml_line_count, 529 &curwin->w_cursor.lnum, NULL)) 530 #endif 531 curwin->w_cursor.lnum = curbuf->b_ml.ml_line_count; 532 } 533 if (curwin->w_cursor.lnum <= 0) 534 curwin->w_cursor.lnum = 1; 535 } 536 537 /* 538 * Make sure curwin->w_cursor.col is valid. 539 */ 540 void 541 check_cursor_col(void) 542 { 543 check_cursor_col_win(curwin); 544 } 545 546 /* 547 * Make sure win->w_cursor.col is valid. 548 */ 549 void 550 check_cursor_col_win(win_T *win) 551 { 552 colnr_T len; 553 colnr_T oldcol = win->w_cursor.col; 554 colnr_T oldcoladd = win->w_cursor.col + win->w_cursor.coladd; 555 556 len = (colnr_T)STRLEN(ml_get_buf(win->w_buffer, win->w_cursor.lnum, FALSE)); 557 if (len == 0) 558 win->w_cursor.col = 0; 559 else if (win->w_cursor.col >= len) 560 { 561 // Allow cursor past end-of-line when: 562 // - in Insert mode or restarting Insert mode 563 // - in Visual mode and 'selection' isn't "old" 564 // - 'virtualedit' is set 565 if ((State & INSERT) || restart_edit 566 || (VIsual_active && *p_sel != 'o') 567 || (ve_flags & VE_ONEMORE) 568 || virtual_active()) 569 win->w_cursor.col = len; 570 else 571 { 572 win->w_cursor.col = len - 1; 573 // Move the cursor to the head byte. 574 if (has_mbyte) 575 mb_adjustpos(win->w_buffer, &win->w_cursor); 576 } 577 } 578 else if (win->w_cursor.col < 0) 579 win->w_cursor.col = 0; 580 581 // If virtual editing is on, we can leave the cursor on the old position, 582 // only we must set it to virtual. But don't do it when at the end of the 583 // line. 584 if (oldcol == MAXCOL) 585 win->w_cursor.coladd = 0; 586 else if (ve_flags == VE_ALL) 587 { 588 if (oldcoladd > win->w_cursor.col) 589 { 590 win->w_cursor.coladd = oldcoladd - win->w_cursor.col; 591 592 // Make sure that coladd is not more than the char width. 593 // Not for the last character, coladd is then used when the cursor 594 // is actually after the last character. 595 if (win->w_cursor.col + 1 < len && win->w_cursor.coladd > 0) 596 { 597 int cs, ce; 598 599 getvcol(win, &win->w_cursor, &cs, NULL, &ce); 600 if (win->w_cursor.coladd > ce - cs) 601 win->w_cursor.coladd = ce - cs; 602 } 603 } 604 else 605 // avoid weird number when there is a miscalculation or overflow 606 win->w_cursor.coladd = 0; 607 } 608 } 609 610 /* 611 * make sure curwin->w_cursor in on a valid character 612 */ 613 void 614 check_cursor(void) 615 { 616 check_cursor_lnum(); 617 check_cursor_col(); 618 } 619 620 #if defined(FEAT_TEXTOBJ) || defined(PROTO) 621 /* 622 * Make sure curwin->w_cursor is not on the NUL at the end of the line. 623 * Allow it when in Visual mode and 'selection' is not "old". 624 */ 625 void 626 adjust_cursor_col(void) 627 { 628 if (curwin->w_cursor.col > 0 629 && (!VIsual_active || *p_sel == 'o') 630 && gchar_cursor() == NUL) 631 --curwin->w_cursor.col; 632 } 633 #endif 634 635 /* 636 * When curwin->w_leftcol has changed, adjust the cursor position. 637 * Return TRUE if the cursor was moved. 638 */ 639 int 640 leftcol_changed(void) 641 { 642 long lastcol; 643 colnr_T s, e; 644 int retval = FALSE; 645 long siso = get_sidescrolloff_value(); 646 647 changed_cline_bef_curs(); 648 lastcol = curwin->w_leftcol + curwin->w_width - curwin_col_off() - 1; 649 validate_virtcol(); 650 651 /* 652 * If the cursor is right or left of the screen, move it to last or first 653 * character. 654 */ 655 if (curwin->w_virtcol > (colnr_T)(lastcol - siso)) 656 { 657 retval = TRUE; 658 coladvance((colnr_T)(lastcol - siso)); 659 } 660 else if (curwin->w_virtcol < curwin->w_leftcol + siso) 661 { 662 retval = TRUE; 663 (void)coladvance((colnr_T)(curwin->w_leftcol + siso)); 664 } 665 666 /* 667 * If the start of the character under the cursor is not on the screen, 668 * advance the cursor one more char. If this fails (last char of the 669 * line) adjust the scrolling. 670 */ 671 getvvcol(curwin, &curwin->w_cursor, &s, NULL, &e); 672 if (e > (colnr_T)lastcol) 673 { 674 retval = TRUE; 675 coladvance(s - 1); 676 } 677 else if (s < curwin->w_leftcol) 678 { 679 retval = TRUE; 680 if (coladvance(e + 1) == FAIL) // there isn't another character 681 { 682 curwin->w_leftcol = s; // adjust w_leftcol instead 683 changed_cline_bef_curs(); 684 } 685 } 686 687 if (retval) 688 curwin->w_set_curswant = TRUE; 689 redraw_later(NOT_VALID); 690 return retval; 691 } 692 693 /********************************************************************** 694 * Various routines dealing with allocation and deallocation of memory. 695 */ 696 697 #if defined(MEM_PROFILE) || defined(PROTO) 698 699 # define MEM_SIZES 8200 700 static long_u mem_allocs[MEM_SIZES]; 701 static long_u mem_frees[MEM_SIZES]; 702 static long_u mem_allocated; 703 static long_u mem_freed; 704 static long_u mem_peak; 705 static long_u num_alloc; 706 static long_u num_freed; 707 708 static void 709 mem_pre_alloc_s(size_t *sizep) 710 { 711 *sizep += sizeof(size_t); 712 } 713 714 static void 715 mem_pre_alloc_l(size_t *sizep) 716 { 717 *sizep += sizeof(size_t); 718 } 719 720 static void 721 mem_post_alloc( 722 void **pp, 723 size_t size) 724 { 725 if (*pp == NULL) 726 return; 727 size -= sizeof(size_t); 728 *(long_u *)*pp = size; 729 if (size <= MEM_SIZES-1) 730 mem_allocs[size-1]++; 731 else 732 mem_allocs[MEM_SIZES-1]++; 733 mem_allocated += size; 734 if (mem_allocated - mem_freed > mem_peak) 735 mem_peak = mem_allocated - mem_freed; 736 num_alloc++; 737 *pp = (void *)((char *)*pp + sizeof(size_t)); 738 } 739 740 static void 741 mem_pre_free(void **pp) 742 { 743 long_u size; 744 745 *pp = (void *)((char *)*pp - sizeof(size_t)); 746 size = *(size_t *)*pp; 747 if (size <= MEM_SIZES-1) 748 mem_frees[size-1]++; 749 else 750 mem_frees[MEM_SIZES-1]++; 751 mem_freed += size; 752 num_freed++; 753 } 754 755 /* 756 * called on exit via atexit() 757 */ 758 void 759 vim_mem_profile_dump(void) 760 { 761 int i, j; 762 763 printf("\r\n"); 764 j = 0; 765 for (i = 0; i < MEM_SIZES - 1; i++) 766 { 767 if (mem_allocs[i] || mem_frees[i]) 768 { 769 if (mem_frees[i] > mem_allocs[i]) 770 printf("\r\n%s", _("ERROR: ")); 771 printf("[%4d / %4lu-%-4lu] ", i + 1, mem_allocs[i], mem_frees[i]); 772 j++; 773 if (j > 3) 774 { 775 j = 0; 776 printf("\r\n"); 777 } 778 } 779 } 780 781 i = MEM_SIZES - 1; 782 if (mem_allocs[i]) 783 { 784 printf("\r\n"); 785 if (mem_frees[i] > mem_allocs[i]) 786 puts(_("ERROR: ")); 787 printf("[>%d / %4lu-%-4lu]", i, mem_allocs[i], mem_frees[i]); 788 } 789 790 printf(_("\n[bytes] total alloc-freed %lu-%lu, in use %lu, peak use %lu\n"), 791 mem_allocated, mem_freed, mem_allocated - mem_freed, mem_peak); 792 printf(_("[calls] total re/malloc()'s %lu, total free()'s %lu\n\n"), 793 num_alloc, num_freed); 794 } 795 796 #endif // MEM_PROFILE 797 798 #ifdef FEAT_EVAL 799 int 800 alloc_does_fail(size_t size) 801 { 802 if (alloc_fail_countdown == 0) 803 { 804 if (--alloc_fail_repeat <= 0) 805 alloc_fail_id = 0; 806 do_outofmem_msg(size); 807 return TRUE; 808 } 809 --alloc_fail_countdown; 810 return FALSE; 811 } 812 #endif 813 814 /* 815 * Some memory is reserved for error messages and for being able to 816 * call mf_release_all(), which needs some memory for mf_trans_add(). 817 */ 818 #define KEEP_ROOM (2 * 8192L) 819 #define KEEP_ROOM_KB (KEEP_ROOM / 1024L) 820 821 /* 822 * The normal way to allocate memory. This handles an out-of-memory situation 823 * as well as possible, still returns NULL when we're completely out. 824 */ 825 void * 826 alloc(size_t size) 827 { 828 return lalloc(size, TRUE); 829 } 830 831 /* 832 * alloc() with an ID for alloc_fail(). 833 */ 834 void * 835 alloc_id(size_t size, alloc_id_T id UNUSED) 836 { 837 #ifdef FEAT_EVAL 838 if (alloc_fail_id == id && alloc_does_fail(size)) 839 return NULL; 840 #endif 841 return lalloc(size, TRUE); 842 } 843 844 /* 845 * Allocate memory and set all bytes to zero. 846 */ 847 void * 848 alloc_clear(size_t size) 849 { 850 void *p; 851 852 p = lalloc(size, TRUE); 853 if (p != NULL) 854 (void)vim_memset(p, 0, size); 855 return p; 856 } 857 858 /* 859 * Same as alloc_clear() but with allocation id for testing 860 */ 861 void * 862 alloc_clear_id(size_t size, alloc_id_T id UNUSED) 863 { 864 #ifdef FEAT_EVAL 865 if (alloc_fail_id == id && alloc_does_fail(size)) 866 return NULL; 867 #endif 868 return alloc_clear(size); 869 } 870 871 /* 872 * Allocate memory like lalloc() and set all bytes to zero. 873 */ 874 void * 875 lalloc_clear(size_t size, int message) 876 { 877 void *p; 878 879 p = lalloc(size, message); 880 if (p != NULL) 881 (void)vim_memset(p, 0, size); 882 return p; 883 } 884 885 /* 886 * Low level memory allocation function. 887 * This is used often, KEEP IT FAST! 888 */ 889 void * 890 lalloc(size_t size, int message) 891 { 892 void *p; // pointer to new storage space 893 static int releasing = FALSE; // don't do mf_release_all() recursive 894 int try_again; 895 #if defined(HAVE_AVAIL_MEM) 896 static size_t allocated = 0; // allocated since last avail check 897 #endif 898 899 // Safety check for allocating zero bytes 900 if (size == 0) 901 { 902 // Don't hide this message 903 emsg_silent = 0; 904 iemsg(_("E341: Internal error: lalloc(0, )")); 905 return NULL; 906 } 907 908 #ifdef MEM_PROFILE 909 mem_pre_alloc_l(&size); 910 #endif 911 912 /* 913 * Loop when out of memory: Try to release some memfile blocks and 914 * if some blocks are released call malloc again. 915 */ 916 for (;;) 917 { 918 /* 919 * Handle three kind of systems: 920 * 1. No check for available memory: Just return. 921 * 2. Slow check for available memory: call mch_avail_mem() after 922 * allocating KEEP_ROOM amount of memory. 923 * 3. Strict check for available memory: call mch_avail_mem() 924 */ 925 if ((p = malloc(size)) != NULL) 926 { 927 #ifndef HAVE_AVAIL_MEM 928 // 1. No check for available memory: Just return. 929 goto theend; 930 #else 931 // 2. Slow check for available memory: call mch_avail_mem() after 932 // allocating (KEEP_ROOM / 2) amount of memory. 933 allocated += size; 934 if (allocated < KEEP_ROOM / 2) 935 goto theend; 936 allocated = 0; 937 938 // 3. check for available memory: call mch_avail_mem() 939 if (mch_avail_mem(TRUE) < KEEP_ROOM_KB && !releasing) 940 { 941 free(p); // System is low... no go! 942 p = NULL; 943 } 944 else 945 goto theend; 946 #endif 947 } 948 /* 949 * Remember that mf_release_all() is being called to avoid an endless 950 * loop, because mf_release_all() may call alloc() recursively. 951 */ 952 if (releasing) 953 break; 954 releasing = TRUE; 955 956 clear_sb_text(TRUE); // free any scrollback text 957 try_again = mf_release_all(); // release as many blocks as possible 958 959 releasing = FALSE; 960 if (!try_again) 961 break; 962 } 963 964 if (message && p == NULL) 965 do_outofmem_msg(size); 966 967 theend: 968 #ifdef MEM_PROFILE 969 mem_post_alloc(&p, size); 970 #endif 971 return p; 972 } 973 974 /* 975 * lalloc() with an ID for alloc_fail(). 976 */ 977 #if defined(FEAT_SIGNS) || defined(PROTO) 978 void * 979 lalloc_id(size_t size, int message, alloc_id_T id UNUSED) 980 { 981 #ifdef FEAT_EVAL 982 if (alloc_fail_id == id && alloc_does_fail(size)) 983 return NULL; 984 #endif 985 return (lalloc(size, message)); 986 } 987 #endif 988 989 #if defined(MEM_PROFILE) || defined(PROTO) 990 /* 991 * realloc() with memory profiling. 992 */ 993 void * 994 mem_realloc(void *ptr, size_t size) 995 { 996 void *p; 997 998 mem_pre_free(&ptr); 999 mem_pre_alloc_s(&size); 1000 1001 p = realloc(ptr, size); 1002 1003 mem_post_alloc(&p, size); 1004 1005 return p; 1006 } 1007 #endif 1008 1009 /* 1010 * Avoid repeating the error message many times (they take 1 second each). 1011 * Did_outofmem_msg is reset when a character is read. 1012 */ 1013 void 1014 do_outofmem_msg(size_t size) 1015 { 1016 if (!did_outofmem_msg) 1017 { 1018 // Don't hide this message 1019 emsg_silent = 0; 1020 1021 // Must come first to avoid coming back here when printing the error 1022 // message fails, e.g. when setting v:errmsg. 1023 did_outofmem_msg = TRUE; 1024 1025 semsg(_("E342: Out of memory! (allocating %lu bytes)"), (long_u)size); 1026 1027 if (starting == NO_SCREEN) 1028 // Not even finished with initializations and already out of 1029 // memory? Then nothing is going to work, exit. 1030 mch_exit(123); 1031 } 1032 } 1033 1034 #if defined(EXITFREE) || defined(PROTO) 1035 1036 /* 1037 * Free everything that we allocated. 1038 * Can be used to detect memory leaks, e.g., with ccmalloc. 1039 * NOTE: This is tricky! Things are freed that functions depend on. Don't be 1040 * surprised if Vim crashes... 1041 * Some things can't be freed, esp. things local to a library function. 1042 */ 1043 void 1044 free_all_mem(void) 1045 { 1046 buf_T *buf, *nextbuf; 1047 1048 // When we cause a crash here it is caught and Vim tries to exit cleanly. 1049 // Don't try freeing everything again. 1050 if (entered_free_all_mem) 1051 return; 1052 entered_free_all_mem = TRUE; 1053 1054 // Don't want to trigger autocommands from here on. 1055 block_autocmds(); 1056 1057 // Close all tabs and windows. Reset 'equalalways' to avoid redraws. 1058 p_ea = FALSE; 1059 if (first_tabpage != NULL && first_tabpage->tp_next != NULL) 1060 do_cmdline_cmd((char_u *)"tabonly!"); 1061 if (!ONE_WINDOW) 1062 do_cmdline_cmd((char_u *)"only!"); 1063 1064 # if defined(FEAT_SPELL) 1065 // Free all spell info. 1066 spell_free_all(); 1067 # endif 1068 1069 # if defined(FEAT_BEVAL_TERM) 1070 ui_remove_balloon(); 1071 # endif 1072 # ifdef FEAT_PROP_POPUP 1073 if (curwin != NULL) 1074 close_all_popups(TRUE); 1075 # endif 1076 1077 // Clear user commands (before deleting buffers). 1078 ex_comclear(NULL); 1079 1080 // When exiting from mainerr_arg_missing curbuf has not been initialized, 1081 // and not much else. 1082 if (curbuf != NULL) 1083 { 1084 # ifdef FEAT_MENU 1085 // Clear menus. 1086 do_cmdline_cmd((char_u *)"aunmenu *"); 1087 # ifdef FEAT_MULTI_LANG 1088 do_cmdline_cmd((char_u *)"menutranslate clear"); 1089 # endif 1090 # endif 1091 // Clear mappings, abbreviations, breakpoints. 1092 do_cmdline_cmd((char_u *)"lmapclear"); 1093 do_cmdline_cmd((char_u *)"xmapclear"); 1094 do_cmdline_cmd((char_u *)"mapclear"); 1095 do_cmdline_cmd((char_u *)"mapclear!"); 1096 do_cmdline_cmd((char_u *)"abclear"); 1097 # if defined(FEAT_EVAL) 1098 do_cmdline_cmd((char_u *)"breakdel *"); 1099 # endif 1100 # if defined(FEAT_PROFILE) 1101 do_cmdline_cmd((char_u *)"profdel *"); 1102 # endif 1103 # if defined(FEAT_KEYMAP) 1104 do_cmdline_cmd((char_u *)"set keymap="); 1105 # endif 1106 } 1107 1108 # ifdef FEAT_TITLE 1109 free_titles(); 1110 # endif 1111 # if defined(FEAT_SEARCHPATH) 1112 free_findfile(); 1113 # endif 1114 1115 // Obviously named calls. 1116 free_all_autocmds(); 1117 clear_termcodes(); 1118 free_all_marks(); 1119 alist_clear(&global_alist); 1120 free_homedir(); 1121 free_users(); 1122 free_search_patterns(); 1123 free_old_sub(); 1124 free_last_insert(); 1125 free_insexpand_stuff(); 1126 free_prev_shellcmd(); 1127 free_regexp_stuff(); 1128 free_tag_stuff(); 1129 free_cd_dir(); 1130 # ifdef FEAT_SIGNS 1131 free_signs(); 1132 # endif 1133 # ifdef FEAT_EVAL 1134 set_expr_line(NULL, NULL); 1135 # endif 1136 # ifdef FEAT_DIFF 1137 if (curtab != NULL) 1138 diff_clear(curtab); 1139 # endif 1140 clear_sb_text(TRUE); // free any scrollback text 1141 1142 // Free some global vars. 1143 vim_free(username); 1144 # ifdef FEAT_CLIPBOARD 1145 vim_regfree(clip_exclude_prog); 1146 # endif 1147 vim_free(last_cmdline); 1148 vim_free(new_last_cmdline); 1149 set_keep_msg(NULL, 0); 1150 1151 // Clear cmdline history. 1152 p_hi = 0; 1153 init_history(); 1154 # ifdef FEAT_PROP_POPUP 1155 clear_global_prop_types(); 1156 # endif 1157 1158 # ifdef FEAT_QUICKFIX 1159 { 1160 win_T *win; 1161 tabpage_T *tab; 1162 1163 qf_free_all(NULL); 1164 // Free all location lists 1165 FOR_ALL_TAB_WINDOWS(tab, win) 1166 qf_free_all(win); 1167 } 1168 # endif 1169 1170 // Close all script inputs. 1171 close_all_scripts(); 1172 1173 if (curwin != NULL) 1174 // Destroy all windows. Must come before freeing buffers. 1175 win_free_all(); 1176 1177 // Free all option values. Must come after closing windows. 1178 free_all_options(); 1179 1180 // Free all buffers. Reset 'autochdir' to avoid accessing things that 1181 // were freed already. 1182 # ifdef FEAT_AUTOCHDIR 1183 p_acd = FALSE; 1184 # endif 1185 for (buf = firstbuf; buf != NULL; ) 1186 { 1187 bufref_T bufref; 1188 1189 set_bufref(&bufref, buf); 1190 nextbuf = buf->b_next; 1191 close_buffer(NULL, buf, DOBUF_WIPE, FALSE, FALSE); 1192 if (bufref_valid(&bufref)) 1193 buf = nextbuf; // didn't work, try next one 1194 else 1195 buf = firstbuf; 1196 } 1197 1198 # ifdef FEAT_ARABIC 1199 free_arshape_buf(); 1200 # endif 1201 1202 // Clear registers. 1203 clear_registers(); 1204 ResetRedobuff(); 1205 ResetRedobuff(); 1206 1207 # if defined(FEAT_CLIENTSERVER) && defined(FEAT_X11) 1208 vim_free(serverDelayedStartName); 1209 # endif 1210 1211 // highlight info 1212 free_highlight(); 1213 1214 reset_last_sourcing(); 1215 1216 if (first_tabpage != NULL) 1217 { 1218 free_tabpage(first_tabpage); 1219 first_tabpage = NULL; 1220 } 1221 1222 # ifdef UNIX 1223 // Machine-specific free. 1224 mch_free_mem(); 1225 # endif 1226 1227 // message history 1228 for (;;) 1229 if (delete_first_msg() == FAIL) 1230 break; 1231 1232 # ifdef FEAT_JOB_CHANNEL 1233 channel_free_all(); 1234 # endif 1235 # ifdef FEAT_TIMERS 1236 timer_free_all(); 1237 # endif 1238 # ifdef FEAT_EVAL 1239 // must be after channel_free_all() with unrefs partials 1240 eval_clear(); 1241 # endif 1242 # ifdef FEAT_JOB_CHANNEL 1243 // must be after eval_clear() with unrefs jobs 1244 job_free_all(); 1245 # endif 1246 1247 free_termoptions(); 1248 1249 // screenlines (can't display anything now!) 1250 free_screenlines(); 1251 1252 # if defined(FEAT_SOUND) 1253 sound_free(); 1254 # endif 1255 # if defined(USE_XSMP) 1256 xsmp_close(); 1257 # endif 1258 # ifdef FEAT_GUI_GTK 1259 gui_mch_free_all(); 1260 # endif 1261 clear_hl_tables(); 1262 1263 vim_free(IObuff); 1264 vim_free(NameBuff); 1265 # ifdef FEAT_QUICKFIX 1266 check_quickfix_busy(); 1267 # endif 1268 } 1269 #endif 1270 1271 /* 1272 * Copy "string" into newly allocated memory. 1273 */ 1274 char_u * 1275 vim_strsave(char_u *string) 1276 { 1277 char_u *p; 1278 size_t len; 1279 1280 len = STRLEN(string) + 1; 1281 p = alloc(len); 1282 if (p != NULL) 1283 mch_memmove(p, string, len); 1284 return p; 1285 } 1286 1287 /* 1288 * Copy up to "len" bytes of "string" into newly allocated memory and 1289 * terminate with a NUL. 1290 * The allocated memory always has size "len + 1", also when "string" is 1291 * shorter. 1292 */ 1293 char_u * 1294 vim_strnsave(char_u *string, size_t len) 1295 { 1296 char_u *p; 1297 1298 p = alloc(len + 1); 1299 if (p != NULL) 1300 { 1301 STRNCPY(p, string, len); 1302 p[len] = NUL; 1303 } 1304 return p; 1305 } 1306 1307 /* 1308 * Copy "p[len]" into allocated memory, ignoring NUL characters. 1309 * Returns NULL when out of memory. 1310 */ 1311 char_u * 1312 vim_memsave(char_u *p, size_t len) 1313 { 1314 char_u *ret = alloc(len); 1315 1316 if (ret != NULL) 1317 mch_memmove(ret, p, len); 1318 return ret; 1319 } 1320 1321 /* 1322 * Same as vim_strsave(), but any characters found in esc_chars are preceded 1323 * by a backslash. 1324 */ 1325 char_u * 1326 vim_strsave_escaped(char_u *string, char_u *esc_chars) 1327 { 1328 return vim_strsave_escaped_ext(string, esc_chars, '\\', FALSE); 1329 } 1330 1331 /* 1332 * Same as vim_strsave_escaped(), but when "bsl" is TRUE also escape 1333 * characters where rem_backslash() would remove the backslash. 1334 * Escape the characters with "cc". 1335 */ 1336 char_u * 1337 vim_strsave_escaped_ext( 1338 char_u *string, 1339 char_u *esc_chars, 1340 int cc, 1341 int bsl) 1342 { 1343 char_u *p; 1344 char_u *p2; 1345 char_u *escaped_string; 1346 unsigned length; 1347 int l; 1348 1349 /* 1350 * First count the number of backslashes required. 1351 * Then allocate the memory and insert them. 1352 */ 1353 length = 1; // count the trailing NUL 1354 for (p = string; *p; p++) 1355 { 1356 if (has_mbyte && (l = (*mb_ptr2len)(p)) > 1) 1357 { 1358 length += l; // count a multibyte char 1359 p += l - 1; 1360 continue; 1361 } 1362 if (vim_strchr(esc_chars, *p) != NULL || (bsl && rem_backslash(p))) 1363 ++length; // count a backslash 1364 ++length; // count an ordinary char 1365 } 1366 escaped_string = alloc(length); 1367 if (escaped_string != NULL) 1368 { 1369 p2 = escaped_string; 1370 for (p = string; *p; p++) 1371 { 1372 if (has_mbyte && (l = (*mb_ptr2len)(p)) > 1) 1373 { 1374 mch_memmove(p2, p, (size_t)l); 1375 p2 += l; 1376 p += l - 1; // skip multibyte char 1377 continue; 1378 } 1379 if (vim_strchr(esc_chars, *p) != NULL || (bsl && rem_backslash(p))) 1380 *p2++ = cc; 1381 *p2++ = *p; 1382 } 1383 *p2 = NUL; 1384 } 1385 return escaped_string; 1386 } 1387 1388 /* 1389 * Return TRUE when 'shell' has "csh" in the tail. 1390 */ 1391 int 1392 csh_like_shell(void) 1393 { 1394 return (strstr((char *)gettail(p_sh), "csh") != NULL); 1395 } 1396 1397 /* 1398 * Escape "string" for use as a shell argument with system(). 1399 * This uses single quotes, except when we know we need to use double quotes 1400 * (MS-DOS and MS-Windows without 'shellslash' set). 1401 * Escape a newline, depending on the 'shell' option. 1402 * When "do_special" is TRUE also replace "!", "%", "#" and things starting 1403 * with "<" like "<cfile>". 1404 * When "do_newline" is FALSE do not escape newline unless it is csh shell. 1405 * Returns the result in allocated memory, NULL if we have run out. 1406 */ 1407 char_u * 1408 vim_strsave_shellescape(char_u *string, int do_special, int do_newline) 1409 { 1410 unsigned length; 1411 char_u *p; 1412 char_u *d; 1413 char_u *escaped_string; 1414 int l; 1415 int csh_like; 1416 1417 // Only csh and similar shells expand '!' within single quotes. For sh and 1418 // the like we must not put a backslash before it, it will be taken 1419 // literally. If do_special is set the '!' will be escaped twice. 1420 // Csh also needs to have "\n" escaped twice when do_special is set. 1421 csh_like = csh_like_shell(); 1422 1423 // First count the number of extra bytes required. 1424 length = (unsigned)STRLEN(string) + 3; // two quotes and a trailing NUL 1425 for (p = string; *p != NUL; MB_PTR_ADV(p)) 1426 { 1427 # ifdef MSWIN 1428 if (!p_ssl) 1429 { 1430 if (*p == '"') 1431 ++length; // " -> "" 1432 } 1433 else 1434 # endif 1435 if (*p == '\'') 1436 length += 3; // ' => '\'' 1437 if ((*p == '\n' && (csh_like || do_newline)) 1438 || (*p == '!' && (csh_like || do_special))) 1439 { 1440 ++length; // insert backslash 1441 if (csh_like && do_special) 1442 ++length; // insert backslash 1443 } 1444 if (do_special && find_cmdline_var(p, &l) >= 0) 1445 { 1446 ++length; // insert backslash 1447 p += l - 1; 1448 } 1449 } 1450 1451 // Allocate memory for the result and fill it. 1452 escaped_string = alloc(length); 1453 if (escaped_string != NULL) 1454 { 1455 d = escaped_string; 1456 1457 // add opening quote 1458 # ifdef MSWIN 1459 if (!p_ssl) 1460 *d++ = '"'; 1461 else 1462 # endif 1463 *d++ = '\''; 1464 1465 for (p = string; *p != NUL; ) 1466 { 1467 # ifdef MSWIN 1468 if (!p_ssl) 1469 { 1470 if (*p == '"') 1471 { 1472 *d++ = '"'; 1473 *d++ = '"'; 1474 ++p; 1475 continue; 1476 } 1477 } 1478 else 1479 # endif 1480 if (*p == '\'') 1481 { 1482 *d++ = '\''; 1483 *d++ = '\\'; 1484 *d++ = '\''; 1485 *d++ = '\''; 1486 ++p; 1487 continue; 1488 } 1489 if ((*p == '\n' && (csh_like || do_newline)) 1490 || (*p == '!' && (csh_like || do_special))) 1491 { 1492 *d++ = '\\'; 1493 if (csh_like && do_special) 1494 *d++ = '\\'; 1495 *d++ = *p++; 1496 continue; 1497 } 1498 if (do_special && find_cmdline_var(p, &l) >= 0) 1499 { 1500 *d++ = '\\'; // insert backslash 1501 while (--l >= 0) // copy the var 1502 *d++ = *p++; 1503 continue; 1504 } 1505 1506 MB_COPY_CHAR(p, d); 1507 } 1508 1509 // add terminating quote and finish with a NUL 1510 # ifdef MSWIN 1511 if (!p_ssl) 1512 *d++ = '"'; 1513 else 1514 # endif 1515 *d++ = '\''; 1516 *d = NUL; 1517 } 1518 1519 return escaped_string; 1520 } 1521 1522 /* 1523 * Like vim_strsave(), but make all characters uppercase. 1524 * This uses ASCII lower-to-upper case translation, language independent. 1525 */ 1526 char_u * 1527 vim_strsave_up(char_u *string) 1528 { 1529 char_u *p1; 1530 1531 p1 = vim_strsave(string); 1532 vim_strup(p1); 1533 return p1; 1534 } 1535 1536 /* 1537 * Like vim_strnsave(), but make all characters uppercase. 1538 * This uses ASCII lower-to-upper case translation, language independent. 1539 */ 1540 char_u * 1541 vim_strnsave_up(char_u *string, size_t len) 1542 { 1543 char_u *p1; 1544 1545 p1 = vim_strnsave(string, len); 1546 vim_strup(p1); 1547 return p1; 1548 } 1549 1550 /* 1551 * ASCII lower-to-upper case translation, language independent. 1552 */ 1553 void 1554 vim_strup( 1555 char_u *p) 1556 { 1557 char_u *p2; 1558 int c; 1559 1560 if (p != NULL) 1561 { 1562 p2 = p; 1563 while ((c = *p2) != NUL) 1564 #ifdef EBCDIC 1565 *p2++ = isalpha(c) ? toupper(c) : c; 1566 #else 1567 *p2++ = (c < 'a' || c > 'z') ? c : (c - 0x20); 1568 #endif 1569 } 1570 } 1571 1572 #if defined(FEAT_EVAL) || defined(FEAT_SPELL) || defined(PROTO) 1573 /* 1574 * Make string "s" all upper-case and return it in allocated memory. 1575 * Handles multi-byte characters as well as possible. 1576 * Returns NULL when out of memory. 1577 */ 1578 char_u * 1579 strup_save(char_u *orig) 1580 { 1581 char_u *p; 1582 char_u *res; 1583 1584 res = p = vim_strsave(orig); 1585 1586 if (res != NULL) 1587 while (*p != NUL) 1588 { 1589 int l; 1590 1591 if (enc_utf8) 1592 { 1593 int c, uc; 1594 int newl; 1595 char_u *s; 1596 1597 c = utf_ptr2char(p); 1598 l = utf_ptr2len(p); 1599 if (c == 0) 1600 { 1601 // overlong sequence, use only the first byte 1602 c = *p; 1603 l = 1; 1604 } 1605 uc = utf_toupper(c); 1606 1607 // Reallocate string when byte count changes. This is rare, 1608 // thus it's OK to do another malloc()/free(). 1609 newl = utf_char2len(uc); 1610 if (newl != l) 1611 { 1612 s = alloc(STRLEN(res) + 1 + newl - l); 1613 if (s == NULL) 1614 { 1615 vim_free(res); 1616 return NULL; 1617 } 1618 mch_memmove(s, res, p - res); 1619 STRCPY(s + (p - res) + newl, p + l); 1620 p = s + (p - res); 1621 vim_free(res); 1622 res = s; 1623 } 1624 1625 utf_char2bytes(uc, p); 1626 p += newl; 1627 } 1628 else if (has_mbyte && (l = (*mb_ptr2len)(p)) > 1) 1629 p += l; // skip multi-byte character 1630 else 1631 { 1632 *p = TOUPPER_LOC(*p); // note that toupper() can be a macro 1633 p++; 1634 } 1635 } 1636 1637 return res; 1638 } 1639 1640 /* 1641 * Make string "s" all lower-case and return it in allocated memory. 1642 * Handles multi-byte characters as well as possible. 1643 * Returns NULL when out of memory. 1644 */ 1645 char_u * 1646 strlow_save(char_u *orig) 1647 { 1648 char_u *p; 1649 char_u *res; 1650 1651 res = p = vim_strsave(orig); 1652 1653 if (res != NULL) 1654 while (*p != NUL) 1655 { 1656 int l; 1657 1658 if (enc_utf8) 1659 { 1660 int c, lc; 1661 int newl; 1662 char_u *s; 1663 1664 c = utf_ptr2char(p); 1665 l = utf_ptr2len(p); 1666 if (c == 0) 1667 { 1668 // overlong sequence, use only the first byte 1669 c = *p; 1670 l = 1; 1671 } 1672 lc = utf_tolower(c); 1673 1674 // Reallocate string when byte count changes. This is rare, 1675 // thus it's OK to do another malloc()/free(). 1676 newl = utf_char2len(lc); 1677 if (newl != l) 1678 { 1679 s = alloc(STRLEN(res) + 1 + newl - l); 1680 if (s == NULL) 1681 { 1682 vim_free(res); 1683 return NULL; 1684 } 1685 mch_memmove(s, res, p - res); 1686 STRCPY(s + (p - res) + newl, p + l); 1687 p = s + (p - res); 1688 vim_free(res); 1689 res = s; 1690 } 1691 1692 utf_char2bytes(lc, p); 1693 p += newl; 1694 } 1695 else if (has_mbyte && (l = (*mb_ptr2len)(p)) > 1) 1696 p += l; // skip multi-byte character 1697 else 1698 { 1699 *p = TOLOWER_LOC(*p); // note that tolower() can be a macro 1700 p++; 1701 } 1702 } 1703 1704 return res; 1705 } 1706 #endif 1707 1708 /* 1709 * delete spaces at the end of a string 1710 */ 1711 void 1712 del_trailing_spaces(char_u *ptr) 1713 { 1714 char_u *q; 1715 1716 q = ptr + STRLEN(ptr); 1717 while (--q > ptr && VIM_ISWHITE(q[0]) && q[-1] != '\\' && q[-1] != Ctrl_V) 1718 *q = NUL; 1719 } 1720 1721 /* 1722 * Like strncpy(), but always terminate the result with one NUL. 1723 * "to" must be "len + 1" long! 1724 */ 1725 void 1726 vim_strncpy(char_u *to, char_u *from, size_t len) 1727 { 1728 STRNCPY(to, from, len); 1729 to[len] = NUL; 1730 } 1731 1732 /* 1733 * Like strcat(), but make sure the result fits in "tosize" bytes and is 1734 * always NUL terminated. "from" and "to" may overlap. 1735 */ 1736 void 1737 vim_strcat(char_u *to, char_u *from, size_t tosize) 1738 { 1739 size_t tolen = STRLEN(to); 1740 size_t fromlen = STRLEN(from); 1741 1742 if (tolen + fromlen + 1 > tosize) 1743 { 1744 mch_memmove(to + tolen, from, tosize - tolen - 1); 1745 to[tosize - 1] = NUL; 1746 } 1747 else 1748 mch_memmove(to + tolen, from, fromlen + 1); 1749 } 1750 1751 /* 1752 * Isolate one part of a string option where parts are separated with 1753 * "sep_chars". 1754 * The part is copied into "buf[maxlen]". 1755 * "*option" is advanced to the next part. 1756 * The length is returned. 1757 */ 1758 int 1759 copy_option_part( 1760 char_u **option, 1761 char_u *buf, 1762 int maxlen, 1763 char *sep_chars) 1764 { 1765 int len = 0; 1766 char_u *p = *option; 1767 1768 // skip '.' at start of option part, for 'suffixes' 1769 if (*p == '.') 1770 buf[len++] = *p++; 1771 while (*p != NUL && vim_strchr((char_u *)sep_chars, *p) == NULL) 1772 { 1773 /* 1774 * Skip backslash before a separator character and space. 1775 */ 1776 if (p[0] == '\\' && vim_strchr((char_u *)sep_chars, p[1]) != NULL) 1777 ++p; 1778 if (len < maxlen - 1) 1779 buf[len++] = *p; 1780 ++p; 1781 } 1782 buf[len] = NUL; 1783 1784 if (*p != NUL && *p != ',') // skip non-standard separator 1785 ++p; 1786 p = skip_to_option_part(p); // p points to next file name 1787 1788 *option = p; 1789 return len; 1790 } 1791 1792 /* 1793 * Replacement for free() that ignores NULL pointers. 1794 * Also skip free() when exiting for sure, this helps when we caught a deadly 1795 * signal that was caused by a crash in free(). 1796 * If you want to set NULL after calling this function, you should use 1797 * VIM_CLEAR() instead. 1798 */ 1799 void 1800 vim_free(void *x) 1801 { 1802 if (x != NULL && !really_exiting) 1803 { 1804 #ifdef MEM_PROFILE 1805 mem_pre_free(&x); 1806 #endif 1807 free(x); 1808 } 1809 } 1810 1811 #ifndef HAVE_MEMSET 1812 void * 1813 vim_memset(void *ptr, int c, size_t size) 1814 { 1815 char *p = ptr; 1816 1817 while (size-- > 0) 1818 *p++ = c; 1819 return ptr; 1820 } 1821 #endif 1822 1823 #if (!defined(HAVE_STRCASECMP) && !defined(HAVE_STRICMP)) || defined(PROTO) 1824 /* 1825 * Compare two strings, ignoring case, using current locale. 1826 * Doesn't work for multi-byte characters. 1827 * return 0 for match, < 0 for smaller, > 0 for bigger 1828 */ 1829 int 1830 vim_stricmp(char *s1, char *s2) 1831 { 1832 int i; 1833 1834 for (;;) 1835 { 1836 i = (int)TOLOWER_LOC(*s1) - (int)TOLOWER_LOC(*s2); 1837 if (i != 0) 1838 return i; // this character different 1839 if (*s1 == NUL) 1840 break; // strings match until NUL 1841 ++s1; 1842 ++s2; 1843 } 1844 return 0; // strings match 1845 } 1846 #endif 1847 1848 #if (!defined(HAVE_STRNCASECMP) && !defined(HAVE_STRNICMP)) || defined(PROTO) 1849 /* 1850 * Compare two strings, for length "len", ignoring case, using current locale. 1851 * Doesn't work for multi-byte characters. 1852 * return 0 for match, < 0 for smaller, > 0 for bigger 1853 */ 1854 int 1855 vim_strnicmp(char *s1, char *s2, size_t len) 1856 { 1857 int i; 1858 1859 while (len > 0) 1860 { 1861 i = (int)TOLOWER_LOC(*s1) - (int)TOLOWER_LOC(*s2); 1862 if (i != 0) 1863 return i; // this character different 1864 if (*s1 == NUL) 1865 break; // strings match until NUL 1866 ++s1; 1867 ++s2; 1868 --len; 1869 } 1870 return 0; // strings match 1871 } 1872 #endif 1873 1874 /* 1875 * Search for first occurrence of "c" in "string". 1876 * Version of strchr() that handles unsigned char strings with characters from 1877 * 128 to 255 correctly. It also doesn't return a pointer to the NUL at the 1878 * end of the string. 1879 */ 1880 char_u * 1881 vim_strchr(char_u *string, int c) 1882 { 1883 char_u *p; 1884 int b; 1885 1886 p = string; 1887 if (enc_utf8 && c >= 0x80) 1888 { 1889 while (*p != NUL) 1890 { 1891 int l = utfc_ptr2len(p); 1892 1893 // Avoid matching an illegal byte here. 1894 if (utf_ptr2char(p) == c && l > 1) 1895 return p; 1896 p += l; 1897 } 1898 return NULL; 1899 } 1900 if (enc_dbcs != 0 && c > 255) 1901 { 1902 int n2 = c & 0xff; 1903 1904 c = ((unsigned)c >> 8) & 0xff; 1905 while ((b = *p) != NUL) 1906 { 1907 if (b == c && p[1] == n2) 1908 return p; 1909 p += (*mb_ptr2len)(p); 1910 } 1911 return NULL; 1912 } 1913 if (has_mbyte) 1914 { 1915 while ((b = *p) != NUL) 1916 { 1917 if (b == c) 1918 return p; 1919 p += (*mb_ptr2len)(p); 1920 } 1921 return NULL; 1922 } 1923 while ((b = *p) != NUL) 1924 { 1925 if (b == c) 1926 return p; 1927 ++p; 1928 } 1929 return NULL; 1930 } 1931 1932 /* 1933 * Version of strchr() that only works for bytes and handles unsigned char 1934 * strings with characters above 128 correctly. It also doesn't return a 1935 * pointer to the NUL at the end of the string. 1936 */ 1937 char_u * 1938 vim_strbyte(char_u *string, int c) 1939 { 1940 char_u *p = string; 1941 1942 while (*p != NUL) 1943 { 1944 if (*p == c) 1945 return p; 1946 ++p; 1947 } 1948 return NULL; 1949 } 1950 1951 /* 1952 * Search for last occurrence of "c" in "string". 1953 * Version of strrchr() that handles unsigned char strings with characters from 1954 * 128 to 255 correctly. It also doesn't return a pointer to the NUL at the 1955 * end of the string. 1956 * Return NULL if not found. 1957 * Does not handle multi-byte char for "c"! 1958 */ 1959 char_u * 1960 vim_strrchr(char_u *string, int c) 1961 { 1962 char_u *retval = NULL; 1963 char_u *p = string; 1964 1965 while (*p) 1966 { 1967 if (*p == c) 1968 retval = p; 1969 MB_PTR_ADV(p); 1970 } 1971 return retval; 1972 } 1973 1974 /* 1975 * Vim's version of strpbrk(), in case it's missing. 1976 * Don't generate a prototype for this, causes problems when it's not used. 1977 */ 1978 #ifndef PROTO 1979 # ifndef HAVE_STRPBRK 1980 # ifdef vim_strpbrk 1981 # undef vim_strpbrk 1982 # endif 1983 char_u * 1984 vim_strpbrk(char_u *s, char_u *charset) 1985 { 1986 while (*s) 1987 { 1988 if (vim_strchr(charset, *s) != NULL) 1989 return s; 1990 MB_PTR_ADV(s); 1991 } 1992 return NULL; 1993 } 1994 # endif 1995 #endif 1996 1997 /* 1998 * Vim has its own isspace() function, because on some machines isspace() 1999 * can't handle characters above 128. 2000 */ 2001 int 2002 vim_isspace(int x) 2003 { 2004 return ((x >= 9 && x <= 13) || x == ' '); 2005 } 2006 2007 /************************************************************************ 2008 * Functions for handling growing arrays. 2009 */ 2010 2011 /* 2012 * Clear an allocated growing array. 2013 */ 2014 void 2015 ga_clear(garray_T *gap) 2016 { 2017 vim_free(gap->ga_data); 2018 ga_init(gap); 2019 } 2020 2021 /* 2022 * Clear a growing array that contains a list of strings. 2023 */ 2024 void 2025 ga_clear_strings(garray_T *gap) 2026 { 2027 int i; 2028 2029 if (gap->ga_data != NULL) 2030 for (i = 0; i < gap->ga_len; ++i) 2031 vim_free(((char_u **)(gap->ga_data))[i]); 2032 ga_clear(gap); 2033 } 2034 2035 /* 2036 * Copy a growing array that contains a list of strings. 2037 */ 2038 int 2039 ga_copy_strings(garray_T *from, garray_T *to) 2040 { 2041 int i; 2042 2043 ga_init2(to, sizeof(char_u *), 1); 2044 if (ga_grow(to, from->ga_len) == FAIL) 2045 return FAIL; 2046 2047 for (i = 0; i < from->ga_len; ++i) 2048 { 2049 char_u *orig = ((char_u **)from->ga_data)[i]; 2050 char_u *copy; 2051 2052 if (orig == NULL) 2053 copy = NULL; 2054 else 2055 { 2056 copy = vim_strsave(orig); 2057 if (copy == NULL) 2058 { 2059 to->ga_len = i; 2060 ga_clear_strings(to); 2061 return FAIL; 2062 } 2063 } 2064 ((char_u **)to->ga_data)[i] = copy; 2065 } 2066 to->ga_len = from->ga_len; 2067 return OK; 2068 } 2069 2070 /* 2071 * Initialize a growing array. Don't forget to set ga_itemsize and 2072 * ga_growsize! Or use ga_init2(). 2073 */ 2074 void 2075 ga_init(garray_T *gap) 2076 { 2077 gap->ga_data = NULL; 2078 gap->ga_maxlen = 0; 2079 gap->ga_len = 0; 2080 } 2081 2082 void 2083 ga_init2(garray_T *gap, int itemsize, int growsize) 2084 { 2085 ga_init(gap); 2086 gap->ga_itemsize = itemsize; 2087 gap->ga_growsize = growsize; 2088 } 2089 2090 /* 2091 * Make room in growing array "gap" for at least "n" items. 2092 * Return FAIL for failure, OK otherwise. 2093 */ 2094 int 2095 ga_grow(garray_T *gap, int n) 2096 { 2097 if (gap->ga_maxlen - gap->ga_len < n) 2098 return ga_grow_inner(gap, n); 2099 return OK; 2100 } 2101 2102 int 2103 ga_grow_inner(garray_T *gap, int n) 2104 { 2105 size_t old_len; 2106 size_t new_len; 2107 char_u *pp; 2108 2109 if (n < gap->ga_growsize) 2110 n = gap->ga_growsize; 2111 2112 // A linear growth is very inefficient when the array grows big. This 2113 // is a compromise between allocating memory that won't be used and too 2114 // many copy operations. A factor of 1.5 seems reasonable. 2115 if (n < gap->ga_len / 2) 2116 n = gap->ga_len / 2; 2117 2118 new_len = gap->ga_itemsize * (gap->ga_len + n); 2119 pp = vim_realloc(gap->ga_data, new_len); 2120 if (pp == NULL) 2121 return FAIL; 2122 old_len = gap->ga_itemsize * gap->ga_maxlen; 2123 vim_memset(pp + old_len, 0, new_len - old_len); 2124 gap->ga_maxlen = gap->ga_len + n; 2125 gap->ga_data = pp; 2126 return OK; 2127 } 2128 2129 #if defined(FEAT_EVAL) || defined(FEAT_SEARCHPATH) || defined(PROTO) 2130 /* 2131 * For a growing array that contains a list of strings: concatenate all the 2132 * strings with a separating "sep". 2133 * Returns NULL when out of memory. 2134 */ 2135 char_u * 2136 ga_concat_strings(garray_T *gap, char *sep) 2137 { 2138 int i; 2139 int len = 0; 2140 int sep_len = (int)STRLEN(sep); 2141 char_u *s; 2142 char_u *p; 2143 2144 for (i = 0; i < gap->ga_len; ++i) 2145 len += (int)STRLEN(((char_u **)(gap->ga_data))[i]) + sep_len; 2146 2147 s = alloc(len + 1); 2148 if (s != NULL) 2149 { 2150 *s = NUL; 2151 p = s; 2152 for (i = 0; i < gap->ga_len; ++i) 2153 { 2154 if (p != s) 2155 { 2156 STRCPY(p, sep); 2157 p += sep_len; 2158 } 2159 STRCPY(p, ((char_u **)(gap->ga_data))[i]); 2160 p += STRLEN(p); 2161 } 2162 } 2163 return s; 2164 } 2165 #endif 2166 2167 #if defined(FEAT_VIMINFO) || defined(FEAT_EVAL) || defined(PROTO) 2168 /* 2169 * Make a copy of string "p" and add it to "gap". 2170 * When out of memory nothing changes. 2171 */ 2172 void 2173 ga_add_string(garray_T *gap, char_u *p) 2174 { 2175 char_u *cp = vim_strsave(p); 2176 2177 if (cp != NULL) 2178 { 2179 if (ga_grow(gap, 1) == OK) 2180 ((char_u **)(gap->ga_data))[gap->ga_len++] = cp; 2181 else 2182 vim_free(cp); 2183 } 2184 } 2185 #endif 2186 2187 /* 2188 * Concatenate a string to a growarray which contains bytes. 2189 * When "s" is NULL does not do anything. 2190 * Note: Does NOT copy the NUL at the end! 2191 */ 2192 void 2193 ga_concat(garray_T *gap, char_u *s) 2194 { 2195 int len; 2196 2197 if (s == NULL || *s == NUL) 2198 return; 2199 len = (int)STRLEN(s); 2200 if (ga_grow(gap, len) == OK) 2201 { 2202 mch_memmove((char *)gap->ga_data + gap->ga_len, s, (size_t)len); 2203 gap->ga_len += len; 2204 } 2205 } 2206 2207 /* 2208 * Append one byte to a growarray which contains bytes. 2209 */ 2210 void 2211 ga_append(garray_T *gap, int c) 2212 { 2213 if (ga_grow(gap, 1) == OK) 2214 { 2215 *((char *)gap->ga_data + gap->ga_len) = c; 2216 ++gap->ga_len; 2217 } 2218 } 2219 2220 #if (defined(UNIX) && !defined(USE_SYSTEM)) || defined(MSWIN) \ 2221 || defined(PROTO) 2222 /* 2223 * Append the text in "gap" below the cursor line and clear "gap". 2224 */ 2225 void 2226 append_ga_line(garray_T *gap) 2227 { 2228 // Remove trailing CR. 2229 if (gap->ga_len > 0 2230 && !curbuf->b_p_bin 2231 && ((char_u *)gap->ga_data)[gap->ga_len - 1] == CAR) 2232 --gap->ga_len; 2233 ga_append(gap, NUL); 2234 ml_append(curwin->w_cursor.lnum++, gap->ga_data, 0, FALSE); 2235 gap->ga_len = 0; 2236 } 2237 #endif 2238 2239 /************************************************************************ 2240 * functions that use lookup tables for various things, generally to do with 2241 * special key codes. 2242 */ 2243 2244 /* 2245 * Some useful tables. 2246 */ 2247 2248 static struct modmasktable 2249 { 2250 short mod_mask; // Bit-mask for particular key modifier 2251 short mod_flag; // Bit(s) for particular key modifier 2252 char_u name; // Single letter name of modifier 2253 } mod_mask_table[] = 2254 { 2255 {MOD_MASK_ALT, MOD_MASK_ALT, (char_u)'M'}, 2256 {MOD_MASK_META, MOD_MASK_META, (char_u)'T'}, 2257 {MOD_MASK_CTRL, MOD_MASK_CTRL, (char_u)'C'}, 2258 {MOD_MASK_SHIFT, MOD_MASK_SHIFT, (char_u)'S'}, 2259 {MOD_MASK_MULTI_CLICK, MOD_MASK_2CLICK, (char_u)'2'}, 2260 {MOD_MASK_MULTI_CLICK, MOD_MASK_3CLICK, (char_u)'3'}, 2261 {MOD_MASK_MULTI_CLICK, MOD_MASK_4CLICK, (char_u)'4'}, 2262 #ifdef MACOS_X 2263 {MOD_MASK_CMD, MOD_MASK_CMD, (char_u)'D'}, 2264 #endif 2265 // 'A' must be the last one 2266 {MOD_MASK_ALT, MOD_MASK_ALT, (char_u)'A'}, 2267 {0, 0, NUL} 2268 // NOTE: when adding an entry, update MAX_KEY_NAME_LEN! 2269 }; 2270 2271 /* 2272 * Shifted key terminal codes and their unshifted equivalent. 2273 * Don't add mouse codes here, they are handled separately! 2274 */ 2275 #define MOD_KEYS_ENTRY_SIZE 5 2276 2277 static char_u modifier_keys_table[] = 2278 { 2279 // mod mask with modifier without modifier 2280 MOD_MASK_SHIFT, '&', '9', '@', '1', // begin 2281 MOD_MASK_SHIFT, '&', '0', '@', '2', // cancel 2282 MOD_MASK_SHIFT, '*', '1', '@', '4', // command 2283 MOD_MASK_SHIFT, '*', '2', '@', '5', // copy 2284 MOD_MASK_SHIFT, '*', '3', '@', '6', // create 2285 MOD_MASK_SHIFT, '*', '4', 'k', 'D', // delete char 2286 MOD_MASK_SHIFT, '*', '5', 'k', 'L', // delete line 2287 MOD_MASK_SHIFT, '*', '7', '@', '7', // end 2288 MOD_MASK_CTRL, KS_EXTRA, (int)KE_C_END, '@', '7', // end 2289 MOD_MASK_SHIFT, '*', '9', '@', '9', // exit 2290 MOD_MASK_SHIFT, '*', '0', '@', '0', // find 2291 MOD_MASK_SHIFT, '#', '1', '%', '1', // help 2292 MOD_MASK_SHIFT, '#', '2', 'k', 'h', // home 2293 MOD_MASK_CTRL, KS_EXTRA, (int)KE_C_HOME, 'k', 'h', // home 2294 MOD_MASK_SHIFT, '#', '3', 'k', 'I', // insert 2295 MOD_MASK_SHIFT, '#', '4', 'k', 'l', // left arrow 2296 MOD_MASK_CTRL, KS_EXTRA, (int)KE_C_LEFT, 'k', 'l', // left arrow 2297 MOD_MASK_SHIFT, '%', 'a', '%', '3', // message 2298 MOD_MASK_SHIFT, '%', 'b', '%', '4', // move 2299 MOD_MASK_SHIFT, '%', 'c', '%', '5', // next 2300 MOD_MASK_SHIFT, '%', 'd', '%', '7', // options 2301 MOD_MASK_SHIFT, '%', 'e', '%', '8', // previous 2302 MOD_MASK_SHIFT, '%', 'f', '%', '9', // print 2303 MOD_MASK_SHIFT, '%', 'g', '%', '0', // redo 2304 MOD_MASK_SHIFT, '%', 'h', '&', '3', // replace 2305 MOD_MASK_SHIFT, '%', 'i', 'k', 'r', // right arr. 2306 MOD_MASK_CTRL, KS_EXTRA, (int)KE_C_RIGHT, 'k', 'r', // right arr. 2307 MOD_MASK_SHIFT, '%', 'j', '&', '5', // resume 2308 MOD_MASK_SHIFT, '!', '1', '&', '6', // save 2309 MOD_MASK_SHIFT, '!', '2', '&', '7', // suspend 2310 MOD_MASK_SHIFT, '!', '3', '&', '8', // undo 2311 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_UP, 'k', 'u', // up arrow 2312 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_DOWN, 'k', 'd', // down arrow 2313 2314 // vt100 F1 2315 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_XF1, KS_EXTRA, (int)KE_XF1, 2316 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_XF2, KS_EXTRA, (int)KE_XF2, 2317 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_XF3, KS_EXTRA, (int)KE_XF3, 2318 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_XF4, KS_EXTRA, (int)KE_XF4, 2319 2320 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F1, 'k', '1', // F1 2321 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F2, 'k', '2', 2322 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F3, 'k', '3', 2323 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F4, 'k', '4', 2324 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F5, 'k', '5', 2325 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F6, 'k', '6', 2326 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F7, 'k', '7', 2327 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F8, 'k', '8', 2328 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F9, 'k', '9', 2329 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F10, 'k', ';', // F10 2330 2331 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F11, 'F', '1', 2332 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F12, 'F', '2', 2333 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F13, 'F', '3', 2334 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F14, 'F', '4', 2335 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F15, 'F', '5', 2336 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F16, 'F', '6', 2337 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F17, 'F', '7', 2338 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F18, 'F', '8', 2339 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F19, 'F', '9', 2340 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F20, 'F', 'A', 2341 2342 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F21, 'F', 'B', 2343 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F22, 'F', 'C', 2344 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F23, 'F', 'D', 2345 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F24, 'F', 'E', 2346 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F25, 'F', 'F', 2347 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F26, 'F', 'G', 2348 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F27, 'F', 'H', 2349 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F28, 'F', 'I', 2350 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F29, 'F', 'J', 2351 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F30, 'F', 'K', 2352 2353 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F31, 'F', 'L', 2354 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F32, 'F', 'M', 2355 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F33, 'F', 'N', 2356 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F34, 'F', 'O', 2357 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F35, 'F', 'P', 2358 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F36, 'F', 'Q', 2359 MOD_MASK_SHIFT, KS_EXTRA, (int)KE_S_F37, 'F', 'R', 2360 2361 // TAB pseudo code 2362 MOD_MASK_SHIFT, 'k', 'B', KS_EXTRA, (int)KE_TAB, 2363 2364 NUL 2365 }; 2366 2367 static struct key_name_entry 2368 { 2369 int key; // Special key code or ascii value 2370 char_u *name; // Name of key 2371 } key_names_table[] = 2372 { 2373 {' ', (char_u *)"Space"}, 2374 {TAB, (char_u *)"Tab"}, 2375 {K_TAB, (char_u *)"Tab"}, 2376 {NL, (char_u *)"NL"}, 2377 {NL, (char_u *)"NewLine"}, // Alternative name 2378 {NL, (char_u *)"LineFeed"}, // Alternative name 2379 {NL, (char_u *)"LF"}, // Alternative name 2380 {CAR, (char_u *)"CR"}, 2381 {CAR, (char_u *)"Return"}, // Alternative name 2382 {CAR, (char_u *)"Enter"}, // Alternative name 2383 {K_BS, (char_u *)"BS"}, 2384 {K_BS, (char_u *)"BackSpace"}, // Alternative name 2385 {ESC, (char_u *)"Esc"}, 2386 {CSI, (char_u *)"CSI"}, 2387 {K_CSI, (char_u *)"xCSI"}, 2388 {'|', (char_u *)"Bar"}, 2389 {'\\', (char_u *)"Bslash"}, 2390 {K_DEL, (char_u *)"Del"}, 2391 {K_DEL, (char_u *)"Delete"}, // Alternative name 2392 {K_KDEL, (char_u *)"kDel"}, 2393 {K_UP, (char_u *)"Up"}, 2394 {K_DOWN, (char_u *)"Down"}, 2395 {K_LEFT, (char_u *)"Left"}, 2396 {K_RIGHT, (char_u *)"Right"}, 2397 {K_XUP, (char_u *)"xUp"}, 2398 {K_XDOWN, (char_u *)"xDown"}, 2399 {K_XLEFT, (char_u *)"xLeft"}, 2400 {K_XRIGHT, (char_u *)"xRight"}, 2401 {K_PS, (char_u *)"PasteStart"}, 2402 {K_PE, (char_u *)"PasteEnd"}, 2403 2404 {K_F1, (char_u *)"F1"}, 2405 {K_F2, (char_u *)"F2"}, 2406 {K_F3, (char_u *)"F3"}, 2407 {K_F4, (char_u *)"F4"}, 2408 {K_F5, (char_u *)"F5"}, 2409 {K_F6, (char_u *)"F6"}, 2410 {K_F7, (char_u *)"F7"}, 2411 {K_F8, (char_u *)"F8"}, 2412 {K_F9, (char_u *)"F9"}, 2413 {K_F10, (char_u *)"F10"}, 2414 2415 {K_F11, (char_u *)"F11"}, 2416 {K_F12, (char_u *)"F12"}, 2417 {K_F13, (char_u *)"F13"}, 2418 {K_F14, (char_u *)"F14"}, 2419 {K_F15, (char_u *)"F15"}, 2420 {K_F16, (char_u *)"F16"}, 2421 {K_F17, (char_u *)"F17"}, 2422 {K_F18, (char_u *)"F18"}, 2423 {K_F19, (char_u *)"F19"}, 2424 {K_F20, (char_u *)"F20"}, 2425 2426 {K_F21, (char_u *)"F21"}, 2427 {K_F22, (char_u *)"F22"}, 2428 {K_F23, (char_u *)"F23"}, 2429 {K_F24, (char_u *)"F24"}, 2430 {K_F25, (char_u *)"F25"}, 2431 {K_F26, (char_u *)"F26"}, 2432 {K_F27, (char_u *)"F27"}, 2433 {K_F28, (char_u *)"F28"}, 2434 {K_F29, (char_u *)"F29"}, 2435 {K_F30, (char_u *)"F30"}, 2436 2437 {K_F31, (char_u *)"F31"}, 2438 {K_F32, (char_u *)"F32"}, 2439 {K_F33, (char_u *)"F33"}, 2440 {K_F34, (char_u *)"F34"}, 2441 {K_F35, (char_u *)"F35"}, 2442 {K_F36, (char_u *)"F36"}, 2443 {K_F37, (char_u *)"F37"}, 2444 2445 {K_XF1, (char_u *)"xF1"}, 2446 {K_XF2, (char_u *)"xF2"}, 2447 {K_XF3, (char_u *)"xF3"}, 2448 {K_XF4, (char_u *)"xF4"}, 2449 2450 {K_HELP, (char_u *)"Help"}, 2451 {K_UNDO, (char_u *)"Undo"}, 2452 {K_INS, (char_u *)"Insert"}, 2453 {K_INS, (char_u *)"Ins"}, // Alternative name 2454 {K_KINS, (char_u *)"kInsert"}, 2455 {K_HOME, (char_u *)"Home"}, 2456 {K_KHOME, (char_u *)"kHome"}, 2457 {K_XHOME, (char_u *)"xHome"}, 2458 {K_ZHOME, (char_u *)"zHome"}, 2459 {K_END, (char_u *)"End"}, 2460 {K_KEND, (char_u *)"kEnd"}, 2461 {K_XEND, (char_u *)"xEnd"}, 2462 {K_ZEND, (char_u *)"zEnd"}, 2463 {K_PAGEUP, (char_u *)"PageUp"}, 2464 {K_PAGEDOWN, (char_u *)"PageDown"}, 2465 {K_KPAGEUP, (char_u *)"kPageUp"}, 2466 {K_KPAGEDOWN, (char_u *)"kPageDown"}, 2467 2468 {K_KPLUS, (char_u *)"kPlus"}, 2469 {K_KMINUS, (char_u *)"kMinus"}, 2470 {K_KDIVIDE, (char_u *)"kDivide"}, 2471 {K_KMULTIPLY, (char_u *)"kMultiply"}, 2472 {K_KENTER, (char_u *)"kEnter"}, 2473 {K_KPOINT, (char_u *)"kPoint"}, 2474 2475 {K_K0, (char_u *)"k0"}, 2476 {K_K1, (char_u *)"k1"}, 2477 {K_K2, (char_u *)"k2"}, 2478 {K_K3, (char_u *)"k3"}, 2479 {K_K4, (char_u *)"k4"}, 2480 {K_K5, (char_u *)"k5"}, 2481 {K_K6, (char_u *)"k6"}, 2482 {K_K7, (char_u *)"k7"}, 2483 {K_K8, (char_u *)"k8"}, 2484 {K_K9, (char_u *)"k9"}, 2485 2486 {'<', (char_u *)"lt"}, 2487 2488 {K_MOUSE, (char_u *)"Mouse"}, 2489 #ifdef FEAT_MOUSE_NET 2490 {K_NETTERM_MOUSE, (char_u *)"NetMouse"}, 2491 #endif 2492 #ifdef FEAT_MOUSE_DEC 2493 {K_DEC_MOUSE, (char_u *)"DecMouse"}, 2494 #endif 2495 #ifdef FEAT_MOUSE_JSB 2496 {K_JSBTERM_MOUSE, (char_u *)"JsbMouse"}, 2497 #endif 2498 #ifdef FEAT_MOUSE_PTERM 2499 {K_PTERM_MOUSE, (char_u *)"PtermMouse"}, 2500 #endif 2501 #ifdef FEAT_MOUSE_URXVT 2502 {K_URXVT_MOUSE, (char_u *)"UrxvtMouse"}, 2503 #endif 2504 {K_SGR_MOUSE, (char_u *)"SgrMouse"}, 2505 {K_SGR_MOUSERELEASE, (char_u *)"SgrMouseRelease"}, 2506 {K_LEFTMOUSE, (char_u *)"LeftMouse"}, 2507 {K_LEFTMOUSE_NM, (char_u *)"LeftMouseNM"}, 2508 {K_LEFTDRAG, (char_u *)"LeftDrag"}, 2509 {K_LEFTRELEASE, (char_u *)"LeftRelease"}, 2510 {K_LEFTRELEASE_NM, (char_u *)"LeftReleaseNM"}, 2511 {K_MOUSEMOVE, (char_u *)"MouseMove"}, 2512 {K_MIDDLEMOUSE, (char_u *)"MiddleMouse"}, 2513 {K_MIDDLEDRAG, (char_u *)"MiddleDrag"}, 2514 {K_MIDDLERELEASE, (char_u *)"MiddleRelease"}, 2515 {K_RIGHTMOUSE, (char_u *)"RightMouse"}, 2516 {K_RIGHTDRAG, (char_u *)"RightDrag"}, 2517 {K_RIGHTRELEASE, (char_u *)"RightRelease"}, 2518 {K_MOUSEDOWN, (char_u *)"ScrollWheelUp"}, 2519 {K_MOUSEUP, (char_u *)"ScrollWheelDown"}, 2520 {K_MOUSELEFT, (char_u *)"ScrollWheelRight"}, 2521 {K_MOUSERIGHT, (char_u *)"ScrollWheelLeft"}, 2522 {K_MOUSEDOWN, (char_u *)"MouseDown"}, // OBSOLETE: Use 2523 {K_MOUSEUP, (char_u *)"MouseUp"}, // ScrollWheelXXX instead 2524 {K_X1MOUSE, (char_u *)"X1Mouse"}, 2525 {K_X1DRAG, (char_u *)"X1Drag"}, 2526 {K_X1RELEASE, (char_u *)"X1Release"}, 2527 {K_X2MOUSE, (char_u *)"X2Mouse"}, 2528 {K_X2DRAG, (char_u *)"X2Drag"}, 2529 {K_X2RELEASE, (char_u *)"X2Release"}, 2530 {K_DROP, (char_u *)"Drop"}, 2531 {K_ZERO, (char_u *)"Nul"}, 2532 #ifdef FEAT_EVAL 2533 {K_SNR, (char_u *)"SNR"}, 2534 #endif 2535 {K_PLUG, (char_u *)"Plug"}, 2536 {K_CURSORHOLD, (char_u *)"CursorHold"}, 2537 {K_IGNORE, (char_u *)"Ignore"}, 2538 {K_COMMAND, (char_u *)"Cmd"}, 2539 {K_FOCUSGAINED, (char_u *)"FocusGained"}, 2540 {K_FOCUSLOST, (char_u *)"FocusLost"}, 2541 {0, NULL} 2542 // NOTE: When adding a long name update MAX_KEY_NAME_LEN. 2543 }; 2544 2545 #define KEY_NAMES_TABLE_LEN (sizeof(key_names_table) / sizeof(struct key_name_entry)) 2546 2547 /* 2548 * Return the modifier mask bit (MOD_MASK_*) which corresponds to the given 2549 * modifier name ('S' for Shift, 'C' for Ctrl etc). 2550 */ 2551 static int 2552 name_to_mod_mask(int c) 2553 { 2554 int i; 2555 2556 c = TOUPPER_ASC(c); 2557 for (i = 0; mod_mask_table[i].mod_mask != 0; i++) 2558 if (c == mod_mask_table[i].name) 2559 return mod_mask_table[i].mod_flag; 2560 return 0; 2561 } 2562 2563 /* 2564 * Check if if there is a special key code for "key" that includes the 2565 * modifiers specified. 2566 */ 2567 int 2568 simplify_key(int key, int *modifiers) 2569 { 2570 int i; 2571 int key0; 2572 int key1; 2573 2574 if (*modifiers & (MOD_MASK_SHIFT | MOD_MASK_CTRL | MOD_MASK_ALT)) 2575 { 2576 // TAB is a special case 2577 if (key == TAB && (*modifiers & MOD_MASK_SHIFT)) 2578 { 2579 *modifiers &= ~MOD_MASK_SHIFT; 2580 return K_S_TAB; 2581 } 2582 key0 = KEY2TERMCAP0(key); 2583 key1 = KEY2TERMCAP1(key); 2584 for (i = 0; modifier_keys_table[i] != NUL; i += MOD_KEYS_ENTRY_SIZE) 2585 if (key0 == modifier_keys_table[i + 3] 2586 && key1 == modifier_keys_table[i + 4] 2587 && (*modifiers & modifier_keys_table[i])) 2588 { 2589 *modifiers &= ~modifier_keys_table[i]; 2590 return TERMCAP2KEY(modifier_keys_table[i + 1], 2591 modifier_keys_table[i + 2]); 2592 } 2593 } 2594 return key; 2595 } 2596 2597 /* 2598 * Change <xHome> to <Home>, <xUp> to <Up>, etc. 2599 */ 2600 int 2601 handle_x_keys(int key) 2602 { 2603 switch (key) 2604 { 2605 case K_XUP: return K_UP; 2606 case K_XDOWN: return K_DOWN; 2607 case K_XLEFT: return K_LEFT; 2608 case K_XRIGHT: return K_RIGHT; 2609 case K_XHOME: return K_HOME; 2610 case K_ZHOME: return K_HOME; 2611 case K_XEND: return K_END; 2612 case K_ZEND: return K_END; 2613 case K_XF1: return K_F1; 2614 case K_XF2: return K_F2; 2615 case K_XF3: return K_F3; 2616 case K_XF4: return K_F4; 2617 case K_S_XF1: return K_S_F1; 2618 case K_S_XF2: return K_S_F2; 2619 case K_S_XF3: return K_S_F3; 2620 case K_S_XF4: return K_S_F4; 2621 } 2622 return key; 2623 } 2624 2625 /* 2626 * Return a string which contains the name of the given key when the given 2627 * modifiers are down. 2628 */ 2629 char_u * 2630 get_special_key_name(int c, int modifiers) 2631 { 2632 static char_u string[MAX_KEY_NAME_LEN + 1]; 2633 2634 int i, idx; 2635 int table_idx; 2636 char_u *s; 2637 2638 string[0] = '<'; 2639 idx = 1; 2640 2641 // Key that stands for a normal character. 2642 if (IS_SPECIAL(c) && KEY2TERMCAP0(c) == KS_KEY) 2643 c = KEY2TERMCAP1(c); 2644 2645 /* 2646 * Translate shifted special keys into unshifted keys and set modifier. 2647 * Same for CTRL and ALT modifiers. 2648 */ 2649 if (IS_SPECIAL(c)) 2650 { 2651 for (i = 0; modifier_keys_table[i] != 0; i += MOD_KEYS_ENTRY_SIZE) 2652 if ( KEY2TERMCAP0(c) == (int)modifier_keys_table[i + 1] 2653 && (int)KEY2TERMCAP1(c) == (int)modifier_keys_table[i + 2]) 2654 { 2655 modifiers |= modifier_keys_table[i]; 2656 c = TERMCAP2KEY(modifier_keys_table[i + 3], 2657 modifier_keys_table[i + 4]); 2658 break; 2659 } 2660 } 2661 2662 // try to find the key in the special key table 2663 table_idx = find_special_key_in_table(c); 2664 2665 /* 2666 * When not a known special key, and not a printable character, try to 2667 * extract modifiers. 2668 */ 2669 if (c > 0 && (*mb_char2len)(c) == 1) 2670 { 2671 if (table_idx < 0 2672 && (!vim_isprintc(c) || (c & 0x7f) == ' ') 2673 && (c & 0x80)) 2674 { 2675 c &= 0x7f; 2676 modifiers |= MOD_MASK_ALT; 2677 // try again, to find the un-alted key in the special key table 2678 table_idx = find_special_key_in_table(c); 2679 } 2680 if (table_idx < 0 && !vim_isprintc(c) && c < ' ') 2681 { 2682 #ifdef EBCDIC 2683 c = CtrlChar(c); 2684 #else 2685 c += '@'; 2686 #endif 2687 modifiers |= MOD_MASK_CTRL; 2688 } 2689 } 2690 2691 // translate the modifier into a string 2692 for (i = 0; mod_mask_table[i].name != 'A'; i++) 2693 if ((modifiers & mod_mask_table[i].mod_mask) 2694 == mod_mask_table[i].mod_flag) 2695 { 2696 string[idx++] = mod_mask_table[i].name; 2697 string[idx++] = (char_u)'-'; 2698 } 2699 2700 if (table_idx < 0) // unknown special key, may output t_xx 2701 { 2702 if (IS_SPECIAL(c)) 2703 { 2704 string[idx++] = 't'; 2705 string[idx++] = '_'; 2706 string[idx++] = KEY2TERMCAP0(c); 2707 string[idx++] = KEY2TERMCAP1(c); 2708 } 2709 // Not a special key, only modifiers, output directly 2710 else 2711 { 2712 if (has_mbyte && (*mb_char2len)(c) > 1) 2713 idx += (*mb_char2bytes)(c, string + idx); 2714 else if (vim_isprintc(c)) 2715 string[idx++] = c; 2716 else 2717 { 2718 s = transchar(c); 2719 while (*s) 2720 string[idx++] = *s++; 2721 } 2722 } 2723 } 2724 else // use name of special key 2725 { 2726 size_t len = STRLEN(key_names_table[table_idx].name); 2727 2728 if (len + idx + 2 <= MAX_KEY_NAME_LEN) 2729 { 2730 STRCPY(string + idx, key_names_table[table_idx].name); 2731 idx += (int)len; 2732 } 2733 } 2734 string[idx++] = '>'; 2735 string[idx] = NUL; 2736 return string; 2737 } 2738 2739 /* 2740 * Try translating a <> name at (*srcp)[] to dst[]. 2741 * Return the number of characters added to dst[], zero for no match. 2742 * If there is a match, srcp is advanced to after the <> name. 2743 * dst[] must be big enough to hold the result (up to six characters)! 2744 */ 2745 int 2746 trans_special( 2747 char_u **srcp, 2748 char_u *dst, 2749 int flags, // FSK_ values 2750 int *did_simplify) // FSK_SIMPLIFY and found <C-H> or <A-x> 2751 { 2752 int modifiers = 0; 2753 int key; 2754 2755 key = find_special_key(srcp, &modifiers, flags, did_simplify); 2756 if (key == 0) 2757 return 0; 2758 2759 return special_to_buf(key, modifiers, flags & FSK_KEYCODE, dst); 2760 } 2761 2762 /* 2763 * Put the character sequence for "key" with "modifiers" into "dst" and return 2764 * the resulting length. 2765 * When "keycode" is TRUE prefer key code, e.g. K_DEL instead of DEL. 2766 * The sequence is not NUL terminated. 2767 * This is how characters in a string are encoded. 2768 */ 2769 int 2770 special_to_buf(int key, int modifiers, int keycode, char_u *dst) 2771 { 2772 int dlen = 0; 2773 2774 // Put the appropriate modifier in a string 2775 if (modifiers != 0) 2776 { 2777 dst[dlen++] = K_SPECIAL; 2778 dst[dlen++] = KS_MODIFIER; 2779 dst[dlen++] = modifiers; 2780 } 2781 2782 if (IS_SPECIAL(key)) 2783 { 2784 dst[dlen++] = K_SPECIAL; 2785 dst[dlen++] = KEY2TERMCAP0(key); 2786 dst[dlen++] = KEY2TERMCAP1(key); 2787 } 2788 else if (has_mbyte && !keycode) 2789 dlen += (*mb_char2bytes)(key, dst + dlen); 2790 else if (keycode) 2791 dlen = (int)(add_char2buf(key, dst + dlen) - dst); 2792 else 2793 dst[dlen++] = key; 2794 2795 return dlen; 2796 } 2797 2798 /* 2799 * Try translating a <> name at (*srcp)[], return the key and modifiers. 2800 * srcp is advanced to after the <> name. 2801 * returns 0 if there is no match. 2802 */ 2803 int 2804 find_special_key( 2805 char_u **srcp, 2806 int *modp, 2807 int flags, // FSK_ values 2808 int *did_simplify) // found <C-H> or <A-x> 2809 { 2810 char_u *last_dash; 2811 char_u *end_of_name; 2812 char_u *src; 2813 char_u *bp; 2814 int in_string = flags & FSK_IN_STRING; 2815 int modifiers; 2816 int bit; 2817 int key; 2818 uvarnumber_T n; 2819 int l; 2820 2821 src = *srcp; 2822 if (src[0] != '<') 2823 return 0; 2824 if (src[1] == '*') // <*xxx>: do not simplify 2825 ++src; 2826 2827 // Find end of modifier list 2828 last_dash = src; 2829 for (bp = src + 1; *bp == '-' || vim_isNormalIDc(*bp); bp++) 2830 { 2831 if (*bp == '-') 2832 { 2833 last_dash = bp; 2834 if (bp[1] != NUL) 2835 { 2836 if (has_mbyte) 2837 l = mb_ptr2len(bp + 1); 2838 else 2839 l = 1; 2840 // Anything accepted, like <C-?>. 2841 // <C-"> or <M-"> are not special in strings as " is 2842 // the string delimiter. With a backslash it works: <M-\"> 2843 if (!(in_string && bp[1] == '"') && bp[l + 1] == '>') 2844 bp += l; 2845 else if (in_string && bp[1] == '\\' && bp[2] == '"' 2846 && bp[3] == '>') 2847 bp += 2; 2848 } 2849 } 2850 if (bp[0] == 't' && bp[1] == '_' && bp[2] && bp[3]) 2851 bp += 3; // skip t_xx, xx may be '-' or '>' 2852 else if (STRNICMP(bp, "char-", 5) == 0) 2853 { 2854 vim_str2nr(bp + 5, NULL, &l, STR2NR_ALL, NULL, NULL, 0, TRUE); 2855 if (l == 0) 2856 { 2857 emsg(_(e_invarg)); 2858 return 0; 2859 } 2860 bp += l + 5; 2861 break; 2862 } 2863 } 2864 2865 if (*bp == '>') // found matching '>' 2866 { 2867 end_of_name = bp + 1; 2868 2869 // Which modifiers are given? 2870 modifiers = 0x0; 2871 for (bp = src + 1; bp < last_dash; bp++) 2872 { 2873 if (*bp != '-') 2874 { 2875 bit = name_to_mod_mask(*bp); 2876 if (bit == 0x0) 2877 break; // Illegal modifier name 2878 modifiers |= bit; 2879 } 2880 } 2881 2882 /* 2883 * Legal modifier name. 2884 */ 2885 if (bp >= last_dash) 2886 { 2887 if (STRNICMP(last_dash + 1, "char-", 5) == 0 2888 && VIM_ISDIGIT(last_dash[6])) 2889 { 2890 // <Char-123> or <Char-033> or <Char-0x33> 2891 vim_str2nr(last_dash + 6, NULL, &l, STR2NR_ALL, NULL, 2892 &n, 0, TRUE); 2893 if (l == 0) 2894 { 2895 emsg(_(e_invarg)); 2896 return 0; 2897 } 2898 key = (int)n; 2899 } 2900 else 2901 { 2902 int off = 1; 2903 2904 // Modifier with single letter, or special key name. 2905 if (in_string && last_dash[1] == '\\' && last_dash[2] == '"') 2906 off = 2; 2907 if (has_mbyte) 2908 l = mb_ptr2len(last_dash + off); 2909 else 2910 l = 1; 2911 if (modifiers != 0 && last_dash[l + off] == '>') 2912 key = PTR2CHAR(last_dash + off); 2913 else 2914 { 2915 key = get_special_key_code(last_dash + off); 2916 if (!(flags & FSK_KEEP_X_KEY)) 2917 key = handle_x_keys(key); 2918 } 2919 } 2920 2921 /* 2922 * get_special_key_code() may return NUL for invalid 2923 * special key name. 2924 */ 2925 if (key != NUL) 2926 { 2927 /* 2928 * Only use a modifier when there is no special key code that 2929 * includes the modifier. 2930 */ 2931 key = simplify_key(key, &modifiers); 2932 2933 if (!(flags & FSK_KEYCODE)) 2934 { 2935 // don't want keycode, use single byte code 2936 if (key == K_BS) 2937 key = BS; 2938 else if (key == K_DEL || key == K_KDEL) 2939 key = DEL; 2940 } 2941 2942 // Normal Key with modifier: Try to make a single byte code. 2943 if (!IS_SPECIAL(key)) 2944 key = extract_modifiers(key, &modifiers, 2945 flags & FSK_SIMPLIFY, did_simplify); 2946 2947 *modp = modifiers; 2948 *srcp = end_of_name; 2949 return key; 2950 } 2951 } 2952 } 2953 return 0; 2954 } 2955 2956 2957 /* 2958 * Some keys are used with Ctrl without Shift and are still expected to be 2959 * mapped as if Shift was pressed: 2960 * CTRL-2 is CTRL-@ 2961 * CTRL-6 is CTRL-^ 2962 * CTRL-- is CTRL-_ 2963 * Also, <C-H> and <C-h> mean the same thing, always use "H". 2964 * Returns the possibly adjusted key. 2965 */ 2966 int 2967 may_adjust_key_for_ctrl(int modifiers, int key) 2968 { 2969 if (modifiers & MOD_MASK_CTRL) 2970 { 2971 if (ASCII_ISALPHA(key)) 2972 return TOUPPER_ASC(key); 2973 if (key == '2') 2974 return '@'; 2975 if (key == '6') 2976 return '^'; 2977 if (key == '-') 2978 return '_'; 2979 } 2980 return key; 2981 } 2982 2983 /* 2984 * Some keys already have Shift included, pass them as normal keys. 2985 * When Ctrl is also used <C-H> and <C-S-H> are different, but <C-S-{> should 2986 * be <C-{>. Same for <C-S-}> and <C-S-|>. 2987 * Also for <A-S-a> and <M-S-a>. 2988 * This includes all printable ASCII characters except numbers and a-z. 2989 */ 2990 int 2991 may_remove_shift_modifier(int modifiers, int key) 2992 { 2993 if ((modifiers == MOD_MASK_SHIFT 2994 || modifiers == (MOD_MASK_SHIFT | MOD_MASK_ALT) 2995 || modifiers == (MOD_MASK_SHIFT | MOD_MASK_META)) 2996 && ((key >= '!' && key <= '/') 2997 || (key >= ':' && key <= 'Z') 2998 || (key >= '[' && key <= '`') 2999 || (key >= '{' && key <= '~'))) 3000 return modifiers & ~MOD_MASK_SHIFT; 3001 3002 if (modifiers == (MOD_MASK_SHIFT | MOD_MASK_CTRL) 3003 && (key == '{' || key == '}' || key == '|')) 3004 return modifiers & ~MOD_MASK_SHIFT; 3005 3006 return modifiers; 3007 } 3008 3009 /* 3010 * Try to include modifiers in the key. 3011 * Changes "Shift-a" to 'A', "Alt-A" to 0xc0, etc. 3012 * When "simplify" is FALSE don't do Ctrl and Alt. 3013 * When "simplify" is TRUE and Ctrl or Alt is removed from modifiers set 3014 * "did_simplify" when it's not NULL. 3015 */ 3016 int 3017 extract_modifiers(int key, int *modp, int simplify, int *did_simplify) 3018 { 3019 int modifiers = *modp; 3020 3021 #ifdef MACOS_X 3022 // Command-key really special, no fancynest 3023 if (!(modifiers & MOD_MASK_CMD)) 3024 #endif 3025 if ((modifiers & MOD_MASK_SHIFT) && ASCII_ISALPHA(key)) 3026 { 3027 key = TOUPPER_ASC(key); 3028 // With <C-S-a> we keep the shift modifier. 3029 // With <S-a>, <A-S-a> and <S-A> we don't keep the shift modifier. 3030 if (simplify || modifiers == MOD_MASK_SHIFT 3031 || modifiers == (MOD_MASK_SHIFT | MOD_MASK_ALT) 3032 || modifiers == (MOD_MASK_SHIFT | MOD_MASK_META)) 3033 modifiers &= ~MOD_MASK_SHIFT; 3034 } 3035 3036 // <C-H> and <C-h> mean the same thing, always use "H" 3037 if ((modifiers & MOD_MASK_CTRL) && ASCII_ISALPHA(key)) 3038 key = TOUPPER_ASC(key); 3039 3040 if (simplify && (modifiers & MOD_MASK_CTRL) 3041 #ifdef EBCDIC 3042 // TODO: EBCDIC Better use: 3043 // && (Ctrl_chr(key) || key == '?') 3044 // ??? 3045 && strchr("?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_", key) 3046 != NULL 3047 #else 3048 && ((key >= '?' && key <= '_') || ASCII_ISALPHA(key)) 3049 #endif 3050 ) 3051 { 3052 key = Ctrl_chr(key); 3053 modifiers &= ~MOD_MASK_CTRL; 3054 // <C-@> is <Nul> 3055 if (key == 0) 3056 key = K_ZERO; 3057 if (did_simplify != NULL) 3058 *did_simplify = TRUE; 3059 } 3060 3061 #ifdef MACOS_X 3062 // Command-key really special, no fancynest 3063 if (!(modifiers & MOD_MASK_CMD)) 3064 #endif 3065 if (simplify && (modifiers & MOD_MASK_ALT) && key < 0x80 3066 && !enc_dbcs) // avoid creating a lead byte 3067 { 3068 key |= 0x80; 3069 modifiers &= ~MOD_MASK_ALT; // remove the META modifier 3070 if (did_simplify != NULL) 3071 *did_simplify = TRUE; 3072 } 3073 3074 *modp = modifiers; 3075 return key; 3076 } 3077 3078 /* 3079 * Try to find key "c" in the special key table. 3080 * Return the index when found, -1 when not found. 3081 */ 3082 int 3083 find_special_key_in_table(int c) 3084 { 3085 int i; 3086 3087 for (i = 0; key_names_table[i].name != NULL; i++) 3088 if (c == key_names_table[i].key) 3089 break; 3090 if (key_names_table[i].name == NULL) 3091 i = -1; 3092 return i; 3093 } 3094 3095 /* 3096 * Find the special key with the given name (the given string does not have to 3097 * end with NUL, the name is assumed to end before the first non-idchar). 3098 * If the name starts with "t_" the next two characters are interpreted as a 3099 * termcap name. 3100 * Return the key code, or 0 if not found. 3101 */ 3102 int 3103 get_special_key_code(char_u *name) 3104 { 3105 char_u *table_name; 3106 char_u string[3]; 3107 int i, j; 3108 3109 /* 3110 * If it's <t_xx> we get the code for xx from the termcap 3111 */ 3112 if (name[0] == 't' && name[1] == '_' && name[2] != NUL && name[3] != NUL) 3113 { 3114 string[0] = name[2]; 3115 string[1] = name[3]; 3116 string[2] = NUL; 3117 if (add_termcap_entry(string, FALSE) == OK) 3118 return TERMCAP2KEY(name[2], name[3]); 3119 } 3120 else 3121 for (i = 0; key_names_table[i].name != NULL; i++) 3122 { 3123 table_name = key_names_table[i].name; 3124 for (j = 0; vim_isNormalIDc(name[j]) && table_name[j] != NUL; j++) 3125 if (TOLOWER_ASC(table_name[j]) != TOLOWER_ASC(name[j])) 3126 break; 3127 if (!vim_isNormalIDc(name[j]) && table_name[j] == NUL) 3128 return key_names_table[i].key; 3129 } 3130 return 0; 3131 } 3132 3133 char_u * 3134 get_key_name(int i) 3135 { 3136 if (i >= (int)KEY_NAMES_TABLE_LEN) 3137 return NULL; 3138 return key_names_table[i].name; 3139 } 3140 3141 /* 3142 * Return the current end-of-line type: EOL_DOS, EOL_UNIX or EOL_MAC. 3143 */ 3144 int 3145 get_fileformat(buf_T *buf) 3146 { 3147 int c = *buf->b_p_ff; 3148 3149 if (buf->b_p_bin || c == 'u') 3150 return EOL_UNIX; 3151 if (c == 'm') 3152 return EOL_MAC; 3153 return EOL_DOS; 3154 } 3155 3156 /* 3157 * Like get_fileformat(), but override 'fileformat' with "p" for "++opt=val" 3158 * argument. 3159 */ 3160 int 3161 get_fileformat_force( 3162 buf_T *buf, 3163 exarg_T *eap) // can be NULL! 3164 { 3165 int c; 3166 3167 if (eap != NULL && eap->force_ff != 0) 3168 c = eap->force_ff; 3169 else 3170 { 3171 if ((eap != NULL && eap->force_bin != 0) 3172 ? (eap->force_bin == FORCE_BIN) : buf->b_p_bin) 3173 return EOL_UNIX; 3174 c = *buf->b_p_ff; 3175 } 3176 if (c == 'u') 3177 return EOL_UNIX; 3178 if (c == 'm') 3179 return EOL_MAC; 3180 return EOL_DOS; 3181 } 3182 3183 /* 3184 * Set the current end-of-line type to EOL_DOS, EOL_UNIX or EOL_MAC. 3185 * Sets both 'textmode' and 'fileformat'. 3186 * Note: Does _not_ set global value of 'textmode'! 3187 */ 3188 void 3189 set_fileformat( 3190 int t, 3191 int opt_flags) // OPT_LOCAL and/or OPT_GLOBAL 3192 { 3193 char *p = NULL; 3194 3195 switch (t) 3196 { 3197 case EOL_DOS: 3198 p = FF_DOS; 3199 curbuf->b_p_tx = TRUE; 3200 break; 3201 case EOL_UNIX: 3202 p = FF_UNIX; 3203 curbuf->b_p_tx = FALSE; 3204 break; 3205 case EOL_MAC: 3206 p = FF_MAC; 3207 curbuf->b_p_tx = FALSE; 3208 break; 3209 } 3210 if (p != NULL) 3211 set_string_option_direct((char_u *)"ff", -1, (char_u *)p, 3212 OPT_FREE | opt_flags, 0); 3213 3214 // This may cause the buffer to become (un)modified. 3215 check_status(curbuf); 3216 redraw_tabline = TRUE; 3217 #ifdef FEAT_TITLE 3218 need_maketitle = TRUE; // set window title later 3219 #endif 3220 } 3221 3222 /* 3223 * Return the default fileformat from 'fileformats'. 3224 */ 3225 int 3226 default_fileformat(void) 3227 { 3228 switch (*p_ffs) 3229 { 3230 case 'm': return EOL_MAC; 3231 case 'd': return EOL_DOS; 3232 } 3233 return EOL_UNIX; 3234 } 3235 3236 /* 3237 * Call shell. Calls mch_call_shell, with 'shellxquote' added. 3238 */ 3239 int 3240 call_shell(char_u *cmd, int opt) 3241 { 3242 char_u *ncmd; 3243 int retval; 3244 #ifdef FEAT_PROFILE 3245 proftime_T wait_time; 3246 #endif 3247 3248 if (p_verbose > 3) 3249 { 3250 verbose_enter(); 3251 smsg(_("Calling shell to execute: \"%s\""), cmd == NULL ? p_sh : cmd); 3252 out_char('\n'); 3253 cursor_on(); 3254 verbose_leave(); 3255 } 3256 3257 #ifdef FEAT_PROFILE 3258 if (do_profiling == PROF_YES) 3259 prof_child_enter(&wait_time); 3260 #endif 3261 3262 if (*p_sh == NUL) 3263 { 3264 emsg(_(e_shellempty)); 3265 retval = -1; 3266 } 3267 else 3268 { 3269 #ifdef FEAT_GUI_MSWIN 3270 // Don't hide the pointer while executing a shell command. 3271 gui_mch_mousehide(FALSE); 3272 #endif 3273 #ifdef FEAT_GUI 3274 ++hold_gui_events; 3275 #endif 3276 // The external command may update a tags file, clear cached tags. 3277 tag_freematch(); 3278 3279 if (cmd == NULL || *p_sxq == NUL) 3280 retval = mch_call_shell(cmd, opt); 3281 else 3282 { 3283 char_u *ecmd = cmd; 3284 3285 if (*p_sxe != NUL && *p_sxq == '(') 3286 { 3287 ecmd = vim_strsave_escaped_ext(cmd, p_sxe, '^', FALSE); 3288 if (ecmd == NULL) 3289 ecmd = cmd; 3290 } 3291 ncmd = alloc(STRLEN(ecmd) + STRLEN(p_sxq) * 2 + 1); 3292 if (ncmd != NULL) 3293 { 3294 STRCPY(ncmd, p_sxq); 3295 STRCAT(ncmd, ecmd); 3296 // When 'shellxquote' is ( append ). 3297 // When 'shellxquote' is "( append )". 3298 STRCAT(ncmd, *p_sxq == '(' ? (char_u *)")" 3299 : *p_sxq == '"' && *(p_sxq+1) == '(' ? (char_u *)")\"" 3300 : p_sxq); 3301 retval = mch_call_shell(ncmd, opt); 3302 vim_free(ncmd); 3303 } 3304 else 3305 retval = -1; 3306 if (ecmd != cmd) 3307 vim_free(ecmd); 3308 } 3309 #ifdef FEAT_GUI 3310 --hold_gui_events; 3311 #endif 3312 /* 3313 * Check the window size, in case it changed while executing the 3314 * external command. 3315 */ 3316 shell_resized_check(); 3317 } 3318 3319 #ifdef FEAT_EVAL 3320 set_vim_var_nr(VV_SHELL_ERROR, (long)retval); 3321 # ifdef FEAT_PROFILE 3322 if (do_profiling == PROF_YES) 3323 prof_child_exit(&wait_time); 3324 # endif 3325 #endif 3326 3327 return retval; 3328 } 3329 3330 /* 3331 * VISUAL, SELECTMODE and OP_PENDING State are never set, they are equal to 3332 * NORMAL State with a condition. This function returns the real State. 3333 */ 3334 int 3335 get_real_state(void) 3336 { 3337 if (State & NORMAL) 3338 { 3339 if (VIsual_active) 3340 { 3341 if (VIsual_select) 3342 return SELECTMODE; 3343 return VISUAL; 3344 } 3345 else if (finish_op) 3346 return OP_PENDING; 3347 } 3348 return State; 3349 } 3350 3351 /* 3352 * Return TRUE if "p" points to just after a path separator. 3353 * Takes care of multi-byte characters. 3354 * "b" must point to the start of the file name 3355 */ 3356 int 3357 after_pathsep(char_u *b, char_u *p) 3358 { 3359 return p > b && vim_ispathsep(p[-1]) 3360 && (!has_mbyte || (*mb_head_off)(b, p - 1) == 0); 3361 } 3362 3363 /* 3364 * Return TRUE if file names "f1" and "f2" are in the same directory. 3365 * "f1" may be a short name, "f2" must be a full path. 3366 */ 3367 int 3368 same_directory(char_u *f1, char_u *f2) 3369 { 3370 char_u ffname[MAXPATHL]; 3371 char_u *t1; 3372 char_u *t2; 3373 3374 // safety check 3375 if (f1 == NULL || f2 == NULL) 3376 return FALSE; 3377 3378 (void)vim_FullName(f1, ffname, MAXPATHL, FALSE); 3379 t1 = gettail_sep(ffname); 3380 t2 = gettail_sep(f2); 3381 return (t1 - ffname == t2 - f2 3382 && pathcmp((char *)ffname, (char *)f2, (int)(t1 - ffname)) == 0); 3383 } 3384 3385 #if defined(FEAT_SESSION) || defined(FEAT_AUTOCHDIR) \ 3386 || defined(MSWIN) || defined(FEAT_GUI_GTK) \ 3387 || defined(FEAT_NETBEANS_INTG) \ 3388 || defined(PROTO) 3389 /* 3390 * Change to a file's directory. 3391 * Caller must call shorten_fnames()! 3392 * Return OK or FAIL. 3393 */ 3394 int 3395 vim_chdirfile(char_u *fname, char *trigger_autocmd) 3396 { 3397 char_u old_dir[MAXPATHL]; 3398 char_u new_dir[MAXPATHL]; 3399 int res; 3400 3401 if (mch_dirname(old_dir, MAXPATHL) != OK) 3402 *old_dir = NUL; 3403 3404 vim_strncpy(new_dir, fname, MAXPATHL - 1); 3405 *gettail_sep(new_dir) = NUL; 3406 3407 if (pathcmp((char *)old_dir, (char *)new_dir, -1) == 0) 3408 // nothing to do 3409 res = OK; 3410 else 3411 { 3412 res = mch_chdir((char *)new_dir) == 0 ? OK : FAIL; 3413 3414 if (res == OK && trigger_autocmd != NULL) 3415 apply_autocmds(EVENT_DIRCHANGED, (char_u *)trigger_autocmd, 3416 new_dir, FALSE, curbuf); 3417 } 3418 return res; 3419 } 3420 #endif 3421 3422 #if defined(STAT_IGNORES_SLASH) || defined(PROTO) 3423 /* 3424 * Check if "name" ends in a slash and is not a directory. 3425 * Used for systems where stat() ignores a trailing slash on a file name. 3426 * The Vim code assumes a trailing slash is only ignored for a directory. 3427 */ 3428 static int 3429 illegal_slash(const char *name) 3430 { 3431 if (name[0] == NUL) 3432 return FALSE; // no file name is not illegal 3433 if (name[strlen(name) - 1] != '/') 3434 return FALSE; // no trailing slash 3435 if (mch_isdir((char_u *)name)) 3436 return FALSE; // trailing slash for a directory 3437 return TRUE; 3438 } 3439 3440 /* 3441 * Special implementation of mch_stat() for Solaris. 3442 */ 3443 int 3444 vim_stat(const char *name, stat_T *stp) 3445 { 3446 // On Solaris stat() accepts "file/" as if it was "file". Return -1 if 3447 // the name ends in "/" and it's not a directory. 3448 return illegal_slash(name) ? -1 : stat(name, stp); 3449 } 3450 #endif 3451 3452 #if defined(CURSOR_SHAPE) || defined(PROTO) 3453 3454 /* 3455 * Handling of cursor and mouse pointer shapes in various modes. 3456 */ 3457 3458 cursorentry_T shape_table[SHAPE_IDX_COUNT] = 3459 { 3460 // The values will be filled in from the 'guicursor' and 'mouseshape' 3461 // defaults when Vim starts. 3462 // Adjust the SHAPE_IDX_ defines when making changes! 3463 {0, 0, 0, 700L, 400L, 250L, 0, 0, "n", SHAPE_CURSOR+SHAPE_MOUSE}, 3464 {0, 0, 0, 700L, 400L, 250L, 0, 0, "v", SHAPE_CURSOR+SHAPE_MOUSE}, 3465 {0, 0, 0, 700L, 400L, 250L, 0, 0, "i", SHAPE_CURSOR+SHAPE_MOUSE}, 3466 {0, 0, 0, 700L, 400L, 250L, 0, 0, "r", SHAPE_CURSOR+SHAPE_MOUSE}, 3467 {0, 0, 0, 700L, 400L, 250L, 0, 0, "c", SHAPE_CURSOR+SHAPE_MOUSE}, 3468 {0, 0, 0, 700L, 400L, 250L, 0, 0, "ci", SHAPE_CURSOR+SHAPE_MOUSE}, 3469 {0, 0, 0, 700L, 400L, 250L, 0, 0, "cr", SHAPE_CURSOR+SHAPE_MOUSE}, 3470 {0, 0, 0, 700L, 400L, 250L, 0, 0, "o", SHAPE_CURSOR+SHAPE_MOUSE}, 3471 {0, 0, 0, 700L, 400L, 250L, 0, 0, "ve", SHAPE_CURSOR+SHAPE_MOUSE}, 3472 {0, 0, 0, 0L, 0L, 0L, 0, 0, "e", SHAPE_MOUSE}, 3473 {0, 0, 0, 0L, 0L, 0L, 0, 0, "s", SHAPE_MOUSE}, 3474 {0, 0, 0, 0L, 0L, 0L, 0, 0, "sd", SHAPE_MOUSE}, 3475 {0, 0, 0, 0L, 0L, 0L, 0, 0, "vs", SHAPE_MOUSE}, 3476 {0, 0, 0, 0L, 0L, 0L, 0, 0, "vd", SHAPE_MOUSE}, 3477 {0, 0, 0, 0L, 0L, 0L, 0, 0, "m", SHAPE_MOUSE}, 3478 {0, 0, 0, 0L, 0L, 0L, 0, 0, "ml", SHAPE_MOUSE}, 3479 {0, 0, 0, 100L, 100L, 100L, 0, 0, "sm", SHAPE_CURSOR}, 3480 }; 3481 3482 #ifdef FEAT_MOUSESHAPE 3483 /* 3484 * Table with names for mouse shapes. Keep in sync with all the tables for 3485 * mch_set_mouse_shape()!. 3486 */ 3487 static char * mshape_names[] = 3488 { 3489 "arrow", // default, must be the first one 3490 "blank", // hidden 3491 "beam", 3492 "updown", 3493 "udsizing", 3494 "leftright", 3495 "lrsizing", 3496 "busy", 3497 "no", 3498 "crosshair", 3499 "hand1", 3500 "hand2", 3501 "pencil", 3502 "question", 3503 "rightup-arrow", 3504 "up-arrow", 3505 NULL 3506 }; 3507 #endif 3508 3509 /* 3510 * Parse the 'guicursor' option ("what" is SHAPE_CURSOR) or 'mouseshape' 3511 * ("what" is SHAPE_MOUSE). 3512 * Returns error message for an illegal option, NULL otherwise. 3513 */ 3514 char * 3515 parse_shape_opt(int what) 3516 { 3517 char_u *modep; 3518 char_u *colonp; 3519 char_u *commap; 3520 char_u *slashp; 3521 char_u *p, *endp; 3522 int idx = 0; // init for GCC 3523 int all_idx; 3524 int len; 3525 int i; 3526 long n; 3527 int found_ve = FALSE; // found "ve" flag 3528 int round; 3529 3530 /* 3531 * First round: check for errors; second round: do it for real. 3532 */ 3533 for (round = 1; round <= 2; ++round) 3534 { 3535 /* 3536 * Repeat for all comma separated parts. 3537 */ 3538 #ifdef FEAT_MOUSESHAPE 3539 if (what == SHAPE_MOUSE) 3540 modep = p_mouseshape; 3541 else 3542 #endif 3543 modep = p_guicursor; 3544 while (*modep != NUL) 3545 { 3546 colonp = vim_strchr(modep, ':'); 3547 commap = vim_strchr(modep, ','); 3548 3549 if (colonp == NULL || (commap != NULL && commap < colonp)) 3550 return N_("E545: Missing colon"); 3551 if (colonp == modep) 3552 return N_("E546: Illegal mode"); 3553 3554 /* 3555 * Repeat for all mode's before the colon. 3556 * For the 'a' mode, we loop to handle all the modes. 3557 */ 3558 all_idx = -1; 3559 while (modep < colonp || all_idx >= 0) 3560 { 3561 if (all_idx < 0) 3562 { 3563 // Find the mode. 3564 if (modep[1] == '-' || modep[1] == ':') 3565 len = 1; 3566 else 3567 len = 2; 3568 if (len == 1 && TOLOWER_ASC(modep[0]) == 'a') 3569 all_idx = SHAPE_IDX_COUNT - 1; 3570 else 3571 { 3572 for (idx = 0; idx < SHAPE_IDX_COUNT; ++idx) 3573 if (STRNICMP(modep, shape_table[idx].name, len) 3574 == 0) 3575 break; 3576 if (idx == SHAPE_IDX_COUNT 3577 || (shape_table[idx].used_for & what) == 0) 3578 return N_("E546: Illegal mode"); 3579 if (len == 2 && modep[0] == 'v' && modep[1] == 'e') 3580 found_ve = TRUE; 3581 } 3582 modep += len + 1; 3583 } 3584 3585 if (all_idx >= 0) 3586 idx = all_idx--; 3587 else if (round == 2) 3588 { 3589 #ifdef FEAT_MOUSESHAPE 3590 if (what == SHAPE_MOUSE) 3591 { 3592 // Set the default, for the missing parts 3593 shape_table[idx].mshape = 0; 3594 } 3595 else 3596 #endif 3597 { 3598 // Set the defaults, for the missing parts 3599 shape_table[idx].shape = SHAPE_BLOCK; 3600 shape_table[idx].blinkwait = 700L; 3601 shape_table[idx].blinkon = 400L; 3602 shape_table[idx].blinkoff = 250L; 3603 } 3604 } 3605 3606 // Parse the part after the colon 3607 for (p = colonp + 1; *p && *p != ','; ) 3608 { 3609 #ifdef FEAT_MOUSESHAPE 3610 if (what == SHAPE_MOUSE) 3611 { 3612 for (i = 0; ; ++i) 3613 { 3614 if (mshape_names[i] == NULL) 3615 { 3616 if (!VIM_ISDIGIT(*p)) 3617 return N_("E547: Illegal mouseshape"); 3618 if (round == 2) 3619 shape_table[idx].mshape = 3620 getdigits(&p) + MSHAPE_NUMBERED; 3621 else 3622 (void)getdigits(&p); 3623 break; 3624 } 3625 len = (int)STRLEN(mshape_names[i]); 3626 if (STRNICMP(p, mshape_names[i], len) == 0) 3627 { 3628 if (round == 2) 3629 shape_table[idx].mshape = i; 3630 p += len; 3631 break; 3632 } 3633 } 3634 } 3635 else // if (what == SHAPE_MOUSE) 3636 #endif 3637 { 3638 /* 3639 * First handle the ones with a number argument. 3640 */ 3641 i = *p; 3642 len = 0; 3643 if (STRNICMP(p, "ver", 3) == 0) 3644 len = 3; 3645 else if (STRNICMP(p, "hor", 3) == 0) 3646 len = 3; 3647 else if (STRNICMP(p, "blinkwait", 9) == 0) 3648 len = 9; 3649 else if (STRNICMP(p, "blinkon", 7) == 0) 3650 len = 7; 3651 else if (STRNICMP(p, "blinkoff", 8) == 0) 3652 len = 8; 3653 if (len != 0) 3654 { 3655 p += len; 3656 if (!VIM_ISDIGIT(*p)) 3657 return N_("E548: digit expected"); 3658 n = getdigits(&p); 3659 if (len == 3) // "ver" or "hor" 3660 { 3661 if (n == 0) 3662 return N_("E549: Illegal percentage"); 3663 if (round == 2) 3664 { 3665 if (TOLOWER_ASC(i) == 'v') 3666 shape_table[idx].shape = SHAPE_VER; 3667 else 3668 shape_table[idx].shape = SHAPE_HOR; 3669 shape_table[idx].percentage = n; 3670 } 3671 } 3672 else if (round == 2) 3673 { 3674 if (len == 9) 3675 shape_table[idx].blinkwait = n; 3676 else if (len == 7) 3677 shape_table[idx].blinkon = n; 3678 else 3679 shape_table[idx].blinkoff = n; 3680 } 3681 } 3682 else if (STRNICMP(p, "block", 5) == 0) 3683 { 3684 if (round == 2) 3685 shape_table[idx].shape = SHAPE_BLOCK; 3686 p += 5; 3687 } 3688 else // must be a highlight group name then 3689 { 3690 endp = vim_strchr(p, '-'); 3691 if (commap == NULL) // last part 3692 { 3693 if (endp == NULL) 3694 endp = p + STRLEN(p); // find end of part 3695 } 3696 else if (endp > commap || endp == NULL) 3697 endp = commap; 3698 slashp = vim_strchr(p, '/'); 3699 if (slashp != NULL && slashp < endp) 3700 { 3701 // "group/langmap_group" 3702 i = syn_check_group(p, (int)(slashp - p)); 3703 p = slashp + 1; 3704 } 3705 if (round == 2) 3706 { 3707 shape_table[idx].id = syn_check_group(p, 3708 (int)(endp - p)); 3709 shape_table[idx].id_lm = shape_table[idx].id; 3710 if (slashp != NULL && slashp < endp) 3711 shape_table[idx].id = i; 3712 } 3713 p = endp; 3714 } 3715 } // if (what != SHAPE_MOUSE) 3716 3717 if (*p == '-') 3718 ++p; 3719 } 3720 } 3721 modep = p; 3722 if (*modep == ',') 3723 ++modep; 3724 } 3725 } 3726 3727 // If the 's' flag is not given, use the 'v' cursor for 's' 3728 if (!found_ve) 3729 { 3730 #ifdef FEAT_MOUSESHAPE 3731 if (what == SHAPE_MOUSE) 3732 { 3733 shape_table[SHAPE_IDX_VE].mshape = shape_table[SHAPE_IDX_V].mshape; 3734 } 3735 else 3736 #endif 3737 { 3738 shape_table[SHAPE_IDX_VE].shape = shape_table[SHAPE_IDX_V].shape; 3739 shape_table[SHAPE_IDX_VE].percentage = 3740 shape_table[SHAPE_IDX_V].percentage; 3741 shape_table[SHAPE_IDX_VE].blinkwait = 3742 shape_table[SHAPE_IDX_V].blinkwait; 3743 shape_table[SHAPE_IDX_VE].blinkon = 3744 shape_table[SHAPE_IDX_V].blinkon; 3745 shape_table[SHAPE_IDX_VE].blinkoff = 3746 shape_table[SHAPE_IDX_V].blinkoff; 3747 shape_table[SHAPE_IDX_VE].id = shape_table[SHAPE_IDX_V].id; 3748 shape_table[SHAPE_IDX_VE].id_lm = shape_table[SHAPE_IDX_V].id_lm; 3749 } 3750 } 3751 3752 return NULL; 3753 } 3754 3755 # if defined(MCH_CURSOR_SHAPE) || defined(FEAT_GUI) \ 3756 || defined(FEAT_MOUSESHAPE) || defined(PROTO) 3757 /* 3758 * Return the index into shape_table[] for the current mode. 3759 * When "mouse" is TRUE, consider indexes valid for the mouse pointer. 3760 */ 3761 int 3762 get_shape_idx(int mouse) 3763 { 3764 #ifdef FEAT_MOUSESHAPE 3765 if (mouse && (State == HITRETURN || State == ASKMORE)) 3766 { 3767 # ifdef FEAT_GUI 3768 int x, y; 3769 gui_mch_getmouse(&x, &y); 3770 if (Y_2_ROW(y) == Rows - 1) 3771 return SHAPE_IDX_MOREL; 3772 # endif 3773 return SHAPE_IDX_MORE; 3774 } 3775 if (mouse && drag_status_line) 3776 return SHAPE_IDX_SDRAG; 3777 if (mouse && drag_sep_line) 3778 return SHAPE_IDX_VDRAG; 3779 #endif 3780 if (!mouse && State == SHOWMATCH) 3781 return SHAPE_IDX_SM; 3782 if (State & VREPLACE_FLAG) 3783 return SHAPE_IDX_R; 3784 if (State & REPLACE_FLAG) 3785 return SHAPE_IDX_R; 3786 if (State & INSERT) 3787 return SHAPE_IDX_I; 3788 if (State & CMDLINE) 3789 { 3790 if (cmdline_at_end()) 3791 return SHAPE_IDX_C; 3792 if (cmdline_overstrike()) 3793 return SHAPE_IDX_CR; 3794 return SHAPE_IDX_CI; 3795 } 3796 if (finish_op) 3797 return SHAPE_IDX_O; 3798 if (VIsual_active) 3799 { 3800 if (*p_sel == 'e') 3801 return SHAPE_IDX_VE; 3802 else 3803 return SHAPE_IDX_V; 3804 } 3805 return SHAPE_IDX_N; 3806 } 3807 #endif 3808 3809 # if defined(FEAT_MOUSESHAPE) || defined(PROTO) 3810 static int old_mouse_shape = 0; 3811 3812 /* 3813 * Set the mouse shape: 3814 * If "shape" is -1, use shape depending on the current mode, 3815 * depending on the current state. 3816 * If "shape" is -2, only update the shape when it's CLINE or STATUS (used 3817 * when the mouse moves off the status or command line). 3818 */ 3819 void 3820 update_mouseshape(int shape_idx) 3821 { 3822 int new_mouse_shape; 3823 3824 // Only works in GUI mode. 3825 if (!gui.in_use || gui.starting) 3826 return; 3827 3828 // Postpone the updating when more is to come. Speeds up executing of 3829 // mappings. 3830 if (shape_idx == -1 && char_avail()) 3831 { 3832 postponed_mouseshape = TRUE; 3833 return; 3834 } 3835 3836 // When ignoring the mouse don't change shape on the statusline. 3837 if (*p_mouse == NUL 3838 && (shape_idx == SHAPE_IDX_CLINE 3839 || shape_idx == SHAPE_IDX_STATUS 3840 || shape_idx == SHAPE_IDX_VSEP)) 3841 shape_idx = -2; 3842 3843 if (shape_idx == -2 3844 && old_mouse_shape != shape_table[SHAPE_IDX_CLINE].mshape 3845 && old_mouse_shape != shape_table[SHAPE_IDX_STATUS].mshape 3846 && old_mouse_shape != shape_table[SHAPE_IDX_VSEP].mshape) 3847 return; 3848 if (shape_idx < 0) 3849 new_mouse_shape = shape_table[get_shape_idx(TRUE)].mshape; 3850 else 3851 new_mouse_shape = shape_table[shape_idx].mshape; 3852 if (new_mouse_shape != old_mouse_shape) 3853 { 3854 mch_set_mouse_shape(new_mouse_shape); 3855 old_mouse_shape = new_mouse_shape; 3856 } 3857 postponed_mouseshape = FALSE; 3858 } 3859 # endif 3860 3861 #endif // CURSOR_SHAPE 3862 3863 3864 /* 3865 * Change directory to "new_dir". If FEAT_SEARCHPATH is defined, search 3866 * 'cdpath' for relative directory names, otherwise just mch_chdir(). 3867 */ 3868 int 3869 vim_chdir(char_u *new_dir) 3870 { 3871 #ifndef FEAT_SEARCHPATH 3872 return mch_chdir((char *)new_dir); 3873 #else 3874 char_u *dir_name; 3875 int r; 3876 3877 dir_name = find_directory_in_path(new_dir, (int)STRLEN(new_dir), 3878 FNAME_MESS, curbuf->b_ffname); 3879 if (dir_name == NULL) 3880 return -1; 3881 r = mch_chdir((char *)dir_name); 3882 vim_free(dir_name); 3883 return r; 3884 #endif 3885 } 3886 3887 /* 3888 * Get user name from machine-specific function. 3889 * Returns the user name in "buf[len]". 3890 * Some systems are quite slow in obtaining the user name (Windows NT), thus 3891 * cache the result. 3892 * Returns OK or FAIL. 3893 */ 3894 int 3895 get_user_name(char_u *buf, int len) 3896 { 3897 if (username == NULL) 3898 { 3899 if (mch_get_user_name(buf, len) == FAIL) 3900 return FAIL; 3901 username = vim_strsave(buf); 3902 } 3903 else 3904 vim_strncpy(buf, username, len - 1); 3905 return OK; 3906 } 3907 3908 #ifndef HAVE_QSORT 3909 /* 3910 * Our own qsort(), for systems that don't have it. 3911 * It's simple and slow. From the K&R C book. 3912 */ 3913 void 3914 qsort( 3915 void *base, 3916 size_t elm_count, 3917 size_t elm_size, 3918 int (*cmp)(const void *, const void *)) 3919 { 3920 char_u *buf; 3921 char_u *p1; 3922 char_u *p2; 3923 int i, j; 3924 int gap; 3925 3926 buf = alloc(elm_size); 3927 if (buf == NULL) 3928 return; 3929 3930 for (gap = elm_count / 2; gap > 0; gap /= 2) 3931 for (i = gap; i < elm_count; ++i) 3932 for (j = i - gap; j >= 0; j -= gap) 3933 { 3934 // Compare the elements. 3935 p1 = (char_u *)base + j * elm_size; 3936 p2 = (char_u *)base + (j + gap) * elm_size; 3937 if ((*cmp)((void *)p1, (void *)p2) <= 0) 3938 break; 3939 // Exchange the elements. 3940 mch_memmove(buf, p1, elm_size); 3941 mch_memmove(p1, p2, elm_size); 3942 mch_memmove(p2, buf, elm_size); 3943 } 3944 3945 vim_free(buf); 3946 } 3947 #endif 3948 3949 /* 3950 * Sort an array of strings. 3951 */ 3952 static int sort_compare(const void *s1, const void *s2); 3953 3954 static int 3955 sort_compare(const void *s1, const void *s2) 3956 { 3957 return STRCMP(*(char **)s1, *(char **)s2); 3958 } 3959 3960 void 3961 sort_strings( 3962 char_u **files, 3963 int count) 3964 { 3965 qsort((void *)files, (size_t)count, sizeof(char_u *), sort_compare); 3966 } 3967 3968 /* 3969 * The putenv() implementation below comes from the "screen" program. 3970 * Included with permission from Juergen Weigert. 3971 * See pty.c for the copyright notice. 3972 */ 3973 3974 /* 3975 * putenv -- put value into environment 3976 * 3977 * Usage: i = putenv (string) 3978 * int i; 3979 * char *string; 3980 * 3981 * where string is of the form <name>=<value>. 3982 * Putenv returns 0 normally, -1 on error (not enough core for malloc). 3983 * 3984 * Putenv may need to add a new name into the environment, or to 3985 * associate a value longer than the current value with a particular 3986 * name. So, to make life simpler, putenv() copies your entire 3987 * environment into the heap (i.e. malloc()) from the stack 3988 * (i.e. where it resides when your process is initiated) the first 3989 * time you call it. 3990 * 3991 * (history removed, not very interesting. See the "screen" sources.) 3992 */ 3993 3994 #if !defined(HAVE_SETENV) && !defined(HAVE_PUTENV) 3995 3996 #define EXTRASIZE 5 // increment to add to env. size 3997 3998 static int envsize = -1; // current size of environment 3999 extern char **environ; // the global which is your env. 4000 4001 static int findenv(char *name); // look for a name in the env. 4002 static int newenv(void); // copy env. from stack to heap 4003 static int moreenv(void); // incr. size of env. 4004 4005 int 4006 putenv(const char *string) 4007 { 4008 int i; 4009 char *p; 4010 4011 if (envsize < 0) 4012 { // first time putenv called 4013 if (newenv() < 0) // copy env. to heap 4014 return -1; 4015 } 4016 4017 i = findenv((char *)string); // look for name in environment 4018 4019 if (i < 0) 4020 { // name must be added 4021 for (i = 0; environ[i]; i++); 4022 if (i >= (envsize - 1)) 4023 { // need new slot 4024 if (moreenv() < 0) 4025 return -1; 4026 } 4027 p = alloc(strlen(string) + 1); 4028 if (p == NULL) // not enough core 4029 return -1; 4030 environ[i + 1] = 0; // new end of env. 4031 } 4032 else 4033 { // name already in env. 4034 p = vim_realloc(environ[i], strlen(string) + 1); 4035 if (p == NULL) 4036 return -1; 4037 } 4038 sprintf(p, "%s", string); // copy into env. 4039 environ[i] = p; 4040 4041 return 0; 4042 } 4043 4044 static int 4045 findenv(char *name) 4046 { 4047 char *namechar, *envchar; 4048 int i, found; 4049 4050 found = 0; 4051 for (i = 0; environ[i] && !found; i++) 4052 { 4053 envchar = environ[i]; 4054 namechar = name; 4055 while (*namechar && *namechar != '=' && (*namechar == *envchar)) 4056 { 4057 namechar++; 4058 envchar++; 4059 } 4060 found = ((*namechar == '\0' || *namechar == '=') && *envchar == '='); 4061 } 4062 return found ? i - 1 : -1; 4063 } 4064 4065 static int 4066 newenv(void) 4067 { 4068 char **env, *elem; 4069 int i, esize; 4070 4071 for (i = 0; environ[i]; i++) 4072 ; 4073 4074 esize = i + EXTRASIZE + 1; 4075 env = ALLOC_MULT(char *, esize); 4076 if (env == NULL) 4077 return -1; 4078 4079 for (i = 0; environ[i]; i++) 4080 { 4081 elem = alloc(strlen(environ[i]) + 1); 4082 if (elem == NULL) 4083 return -1; 4084 env[i] = elem; 4085 strcpy(elem, environ[i]); 4086 } 4087 4088 env[i] = 0; 4089 environ = env; 4090 envsize = esize; 4091 return 0; 4092 } 4093 4094 static int 4095 moreenv(void) 4096 { 4097 int esize; 4098 char **env; 4099 4100 esize = envsize + EXTRASIZE; 4101 env = vim_realloc((char *)environ, esize * sizeof (*env)); 4102 if (env == 0) 4103 return -1; 4104 environ = env; 4105 envsize = esize; 4106 return 0; 4107 } 4108 4109 # ifdef USE_VIMPTY_GETENV 4110 /* 4111 * Used for mch_getenv() for Mac. 4112 */ 4113 char_u * 4114 vimpty_getenv(const char_u *string) 4115 { 4116 int i; 4117 char_u *p; 4118 4119 if (envsize < 0) 4120 return NULL; 4121 4122 i = findenv((char *)string); 4123 4124 if (i < 0) 4125 return NULL; 4126 4127 p = vim_strchr((char_u *)environ[i], '='); 4128 return (p + 1); 4129 } 4130 # endif 4131 4132 #endif // !defined(HAVE_SETENV) && !defined(HAVE_PUTENV) 4133 4134 #if defined(FEAT_EVAL) || defined(FEAT_SPELL) || defined(PROTO) 4135 /* 4136 * Return 0 for not writable, 1 for writable file, 2 for a dir which we have 4137 * rights to write into. 4138 */ 4139 int 4140 filewritable(char_u *fname) 4141 { 4142 int retval = 0; 4143 #if defined(UNIX) || defined(VMS) 4144 int perm = 0; 4145 #endif 4146 4147 #if defined(UNIX) || defined(VMS) 4148 perm = mch_getperm(fname); 4149 #endif 4150 if ( 4151 # ifdef MSWIN 4152 mch_writable(fname) && 4153 # else 4154 # if defined(UNIX) || defined(VMS) 4155 (perm & 0222) && 4156 # endif 4157 # endif 4158 mch_access((char *)fname, W_OK) == 0 4159 ) 4160 { 4161 ++retval; 4162 if (mch_isdir(fname)) 4163 ++retval; 4164 } 4165 return retval; 4166 } 4167 #endif 4168 4169 #if defined(FEAT_SPELL) || defined(FEAT_PERSISTENT_UNDO) || defined(PROTO) 4170 /* 4171 * Read 2 bytes from "fd" and turn them into an int, MSB first. 4172 * Returns -1 when encountering EOF. 4173 */ 4174 int 4175 get2c(FILE *fd) 4176 { 4177 int c, n; 4178 4179 n = getc(fd); 4180 if (n == EOF) return -1; 4181 c = getc(fd); 4182 if (c == EOF) return -1; 4183 return (n << 8) + c; 4184 } 4185 4186 /* 4187 * Read 3 bytes from "fd" and turn them into an int, MSB first. 4188 * Returns -1 when encountering EOF. 4189 */ 4190 int 4191 get3c(FILE *fd) 4192 { 4193 int c, n; 4194 4195 n = getc(fd); 4196 if (n == EOF) return -1; 4197 c = getc(fd); 4198 if (c == EOF) return -1; 4199 n = (n << 8) + c; 4200 c = getc(fd); 4201 if (c == EOF) return -1; 4202 return (n << 8) + c; 4203 } 4204 4205 /* 4206 * Read 4 bytes from "fd" and turn them into an int, MSB first. 4207 * Returns -1 when encountering EOF. 4208 */ 4209 int 4210 get4c(FILE *fd) 4211 { 4212 int c; 4213 // Use unsigned rather than int otherwise result is undefined 4214 // when left-shift sets the MSB. 4215 unsigned n; 4216 4217 c = getc(fd); 4218 if (c == EOF) return -1; 4219 n = (unsigned)c; 4220 c = getc(fd); 4221 if (c == EOF) return -1; 4222 n = (n << 8) + (unsigned)c; 4223 c = getc(fd); 4224 if (c == EOF) return -1; 4225 n = (n << 8) + (unsigned)c; 4226 c = getc(fd); 4227 if (c == EOF) return -1; 4228 n = (n << 8) + (unsigned)c; 4229 return (int)n; 4230 } 4231 4232 /* 4233 * Read a string of length "cnt" from "fd" into allocated memory. 4234 * Returns NULL when out of memory or unable to read that many bytes. 4235 */ 4236 char_u * 4237 read_string(FILE *fd, int cnt) 4238 { 4239 char_u *str; 4240 int i; 4241 int c; 4242 4243 // allocate memory 4244 str = alloc(cnt + 1); 4245 if (str != NULL) 4246 { 4247 // Read the string. Quit when running into the EOF. 4248 for (i = 0; i < cnt; ++i) 4249 { 4250 c = getc(fd); 4251 if (c == EOF) 4252 { 4253 vim_free(str); 4254 return NULL; 4255 } 4256 str[i] = c; 4257 } 4258 str[i] = NUL; 4259 } 4260 return str; 4261 } 4262 4263 /* 4264 * Write a number to file "fd", MSB first, in "len" bytes. 4265 */ 4266 int 4267 put_bytes(FILE *fd, long_u nr, int len) 4268 { 4269 int i; 4270 4271 for (i = len - 1; i >= 0; --i) 4272 if (putc((int)(nr >> (i * 8)), fd) == EOF) 4273 return FAIL; 4274 return OK; 4275 } 4276 4277 #endif 4278 4279 #if defined(FEAT_QUICKFIX) || defined(FEAT_SPELL) || defined(PROTO) 4280 /* 4281 * Return TRUE if string "s" contains a non-ASCII character (128 or higher). 4282 * When "s" is NULL FALSE is returned. 4283 */ 4284 int 4285 has_non_ascii(char_u *s) 4286 { 4287 char_u *p; 4288 4289 if (s != NULL) 4290 for (p = s; *p != NUL; ++p) 4291 if (*p >= 128) 4292 return TRUE; 4293 return FALSE; 4294 } 4295 #endif 4296 4297 #ifndef PROTO // proto is defined in vim.h 4298 # ifdef ELAPSED_TIMEVAL 4299 /* 4300 * Return time in msec since "start_tv". 4301 */ 4302 long 4303 elapsed(struct timeval *start_tv) 4304 { 4305 struct timeval now_tv; 4306 4307 gettimeofday(&now_tv, NULL); 4308 return (now_tv.tv_sec - start_tv->tv_sec) * 1000L 4309 + (now_tv.tv_usec - start_tv->tv_usec) / 1000L; 4310 } 4311 # endif 4312 4313 # ifdef ELAPSED_TICKCOUNT 4314 /* 4315 * Return time in msec since "start_tick". 4316 */ 4317 long 4318 elapsed(DWORD start_tick) 4319 { 4320 DWORD now = GetTickCount(); 4321 4322 return (long)now - (long)start_tick; 4323 } 4324 # endif 4325 #endif 4326 4327 #if defined(FEAT_JOB_CHANNEL) \ 4328 || (defined(UNIX) && (!defined(USE_SYSTEM) \ 4329 || (defined(FEAT_GUI) && defined(FEAT_TERMINAL)))) \ 4330 || defined(PROTO) 4331 /* 4332 * Parse "cmd" and put the white-separated parts in "argv". 4333 * "argv" is an allocated array with "argc" entries and room for 4 more. 4334 * Returns FAIL when out of memory. 4335 */ 4336 int 4337 mch_parse_cmd(char_u *cmd, int use_shcf, char ***argv, int *argc) 4338 { 4339 int i; 4340 char_u *p, *d; 4341 int inquote; 4342 4343 /* 4344 * Do this loop twice: 4345 * 1: find number of arguments 4346 * 2: separate them and build argv[] 4347 */ 4348 for (i = 1; i <= 2; ++i) 4349 { 4350 p = skipwhite(cmd); 4351 inquote = FALSE; 4352 *argc = 0; 4353 while (*p != NUL) 4354 { 4355 if (i == 2) 4356 (*argv)[*argc] = (char *)p; 4357 ++*argc; 4358 d = p; 4359 while (*p != NUL && (inquote || (*p != ' ' && *p != TAB))) 4360 { 4361 if (p[0] == '"') 4362 // quotes surrounding an argument and are dropped 4363 inquote = !inquote; 4364 else 4365 { 4366 if (rem_backslash(p)) 4367 { 4368 // First pass: skip over "\ " and "\"". 4369 // Second pass: Remove the backslash. 4370 ++p; 4371 } 4372 if (i == 2) 4373 *d++ = *p; 4374 } 4375 ++p; 4376 } 4377 if (*p == NUL) 4378 { 4379 if (i == 2) 4380 *d++ = NUL; 4381 break; 4382 } 4383 if (i == 2) 4384 *d++ = NUL; 4385 p = skipwhite(p + 1); 4386 } 4387 if (*argv == NULL) 4388 { 4389 if (use_shcf) 4390 { 4391 // Account for possible multiple args in p_shcf. 4392 p = p_shcf; 4393 for (;;) 4394 { 4395 p = skiptowhite(p); 4396 if (*p == NUL) 4397 break; 4398 ++*argc; 4399 p = skipwhite(p); 4400 } 4401 } 4402 4403 *argv = ALLOC_MULT(char *, *argc + 4); 4404 if (*argv == NULL) // out of memory 4405 return FAIL; 4406 } 4407 } 4408 return OK; 4409 } 4410 4411 # if defined(FEAT_JOB_CHANNEL) || defined(PROTO) 4412 /* 4413 * Build "argv[argc]" from the string "cmd". 4414 * "argv[argc]" is set to NULL; 4415 * Return FAIL when out of memory. 4416 */ 4417 int 4418 build_argv_from_string(char_u *cmd, char ***argv, int *argc) 4419 { 4420 char_u *cmd_copy; 4421 int i; 4422 4423 // Make a copy, parsing will modify "cmd". 4424 cmd_copy = vim_strsave(cmd); 4425 if (cmd_copy == NULL 4426 || mch_parse_cmd(cmd_copy, FALSE, argv, argc) == FAIL) 4427 { 4428 vim_free(cmd_copy); 4429 return FAIL; 4430 } 4431 for (i = 0; i < *argc; i++) 4432 (*argv)[i] = (char *)vim_strsave((char_u *)(*argv)[i]); 4433 (*argv)[*argc] = NULL; 4434 vim_free(cmd_copy); 4435 return OK; 4436 } 4437 4438 /* 4439 * Build "argv[argc]" from the list "l". 4440 * "argv[argc]" is set to NULL; 4441 * Return FAIL when out of memory. 4442 */ 4443 int 4444 build_argv_from_list(list_T *l, char ***argv, int *argc) 4445 { 4446 listitem_T *li; 4447 char_u *s; 4448 4449 // Pass argv[] to mch_call_shell(). 4450 *argv = ALLOC_MULT(char *, l->lv_len + 1); 4451 if (*argv == NULL) 4452 return FAIL; 4453 *argc = 0; 4454 FOR_ALL_LIST_ITEMS(l, li) 4455 { 4456 s = tv_get_string_chk(&li->li_tv); 4457 if (s == NULL) 4458 { 4459 int i; 4460 4461 for (i = 0; i < *argc; ++i) 4462 VIM_CLEAR((*argv)[i]); 4463 return FAIL; 4464 } 4465 (*argv)[*argc] = (char *)vim_strsave(s); 4466 *argc += 1; 4467 } 4468 (*argv)[*argc] = NULL; 4469 return OK; 4470 } 4471 # endif 4472 #endif 4473 4474 /* 4475 * Change the behavior of vterm. 4476 * 0: As usual. 4477 * 1: Windows 10 version 1809 4478 * The bug causes unstable handling of ambiguous width character. 4479 * 2: Windows 10 version 1903 & 1909 4480 * Use the wrong result because each result is different. 4481 * 3: Windows 10 insider preview (current latest logic) 4482 */ 4483 int 4484 get_special_pty_type(void) 4485 { 4486 #ifdef MSWIN 4487 return get_conpty_type(); 4488 #else 4489 return 0; 4490 #endif 4491 } 4492