1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318
|
/* complete.c -- filename completion for readline. */
/* Copyright (C) 1987, 1989, 1992 Free Software Foundation, Inc.
This file is part of the GNU Readline Library, a library for
reading lines of text with interactive input and history editing.
The GNU Readline Library is free software; you can redistribute it
and/or modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 1, or
(at your option) any later version.
The GNU Readline Library is distributed in the hope that it will be
useful, but WITHOUT ANY WARRANTY; without even the implied warranty
of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
The GNU General Public License is often shipped with GNU software, and
is generally kept in a file called COPYING or LICENSE. If you do not
have a copy of the license, write to the Free Software Foundation,
675 Mass Ave, Cambridge, MA 02139, USA. */
#include "sysdep.h"
#include <stdio.h>
#include <fcntl.h>
#include <errno.h>
/* Not all systems declare ERRNO in errno.h... and some systems #define it! */
#if !defined (errno)
extern int errno;
#endif /* !errno */
/* These next are for filename completion. Perhaps this belongs
in a different place. */
#if !defined __MSDOS__ && (defined __CYGWIN32__ || ! defined _WIN32)
#include <pwd.h>
#endif /* __MSDOS__ */
#if defined (USG) && !defined (isc386) && !defined (sgi)
extern struct passwd *getpwuid (), *getpwent ();
#endif
#if defined (isc386) && !defined (__STDC__) && defined (_POSIX_SOURCE)
extern struct passwd *getpwent ();
#endif
/* Included by <fcntl.h> on some systems, but not SCO, so include it here. */
#include <sys/stat.h>
/* System-specific feature definitions and include files. */
#include "rldefs.h"
/* Some standard library routines. */
#include "readline.h"
/* Possible values for do_replace in rl_complete_internal. */
#define NO_MATCH 0
#define SINGLE_MATCH 1
#define MULT_MATCH 2
#if !defined (strchr) && !defined (__STDC__)
extern char *strchr (), *strrchr ();
#endif /* !strchr && !__STDC__ */
extern char *tilde_expand ();
extern char *rl_copy_text ();
extern Function *rl_last_func;
extern int rl_editing_mode;
extern int screenwidth;
/* Forward declarations for functions defined and used in this file. */
char *filename_completion_function ();
char **completion_matches ();
static int compare_strings ();
static char *rl_strpbrk ();
#if defined (STATIC_MALLOC)
static char *xmalloc (), *xrealloc ();
#else
extern char *xmalloc (), *xrealloc ();
#endif /* STATIC_MALLOC */
/* If non-zero, then this is the address of a function to call when
completing on a directory name. The function is called with
the address of a string (the current directory name) as an arg. */
Function *rl_symbolic_link_hook = (Function *)NULL;
/* Non-zero means readline completion functions perform tilde expansion. */
int rl_complete_with_tilde_expansion = 0;
#define VISIBLE_STATS
#if defined (VISIBLE_STATS)
# if !defined (X_OK)
# define X_OK 1
# endif
static int stat_char ();
/* Non-zero means add an additional character to each filename displayed
during listing completion iff rl_filename_completion_desired which helps
to indicate the type of file being listed. */
int rl_visible_stats = 0;
#endif /* VISIBLE_STATS */
/* **************************************************************** */
/* */
/* Completion matching, from readline's point of view. */
/* */
/* **************************************************************** */
/* Pointer to the generator function for completion_matches ().
NULL means to use filename_entry_function (), the default filename
completer. */
Function *rl_completion_entry_function = (Function *)NULL;
/* Pointer to alternative function to create matches.
Function is called with TEXT, START, and END.
START and END are indices in RL_LINE_BUFFER saying what the boundaries
of TEXT are.
If this function exists and returns NULL then call the value of
rl_completion_entry_function to try to match, otherwise use the
array of strings returned. */
CPPFunction *rl_attempted_completion_function = (CPPFunction *)NULL;
/* Local variable states what happened during the last completion attempt. */
static int completion_changed_buffer = 0;
/* Complete the word at or before point. You have supplied the function
that does the initial simple matching selection algorithm (see
completion_matches ()). The default is to do filename completion. */
rl_complete (ignore, invoking_key)
int ignore, invoking_key;
{
if (rl_last_func == rl_complete && !completion_changed_buffer)
rl_complete_internal ('?');
else
rl_complete_internal (TAB);
}
/* List the possible completions. See description of rl_complete (). */
rl_possible_completions (ignore, invoking_key)
int ignore, invoking_key;
{
rl_complete_internal ('?');
}
rl_insert_completions (ignore, invoking_key)
int ignore, invoking_key;
{
rl_complete_internal ('*');
}
/* The user must press "y" or "n". Non-zero return means "y" pressed. */
get_y_or_n ()
{
int c;
for (;;)
{
c = rl_read_key ();
if (c == 'y' || c == 'Y')
return (1);
if (c == 'n' || c == 'N')
return (0);
if (c == ABORT_CHAR)
rl_abort ();
ding ();
}
}
/* Up to this many items will be displayed in response to a
possible-completions call. After that, we ask the user if
she is sure she wants to see them all. */
int rl_completion_query_items = 100;
/* The basic list of characters that signal a break between words for the
completer routine. The contents of this variable is what breaks words
in the shell, i.e. " \t\n\"\\'`@$><=" */
char *rl_basic_word_break_characters = " \t\n\"\\'`@$><=;|&{(";
/* The list of characters that signal a break between words for
rl_complete_internal. The default list is the contents of
rl_basic_word_break_characters. */
char *rl_completer_word_break_characters = (char *)NULL;
/* List of characters which can be used to quote a substring of the line.
Completion occurs on the entire substring, and within the substring
rl_completer_word_break_characters are treated as any other character,
unless they also appear within this list. */
char *rl_completer_quote_characters = (char *)NULL;
/* List of characters that are word break characters, but should be left
in TEXT when it is passed to the completion function. The shell uses
this to help determine what kind of completing to do. */
char *rl_special_prefixes = (char *)NULL;
/* If non-zero, then disallow duplicates in the matches. */
int rl_ignore_completion_duplicates = 1;
/* Non-zero means that the results of the matches are to be treated
as filenames. This is ALWAYS zero on entry, and can only be changed
within a completion entry finder function. */
int rl_filename_completion_desired = 0;
/* This function, if defined, is called by the completer when real
filename completion is done, after all the matching names have been
generated. It is passed a (char**) known as matches in the code below.
It consists of a NULL-terminated array of pointers to potential
matching strings. The 1st element (matches[0]) is the maximal
substring that is common to all matches. This function can re-arrange
the list of matches as required, but all elements of the array must be
free()'d if they are deleted. The main intent of this function is
to implement FIGNORE a la SunOS csh. */
Function *rl_ignore_some_completions_function = (Function *)NULL;
#if defined (SHELL)
/* A function to strip quotes that are not protected by backquotes. It
allows single quotes to appear within double quotes, and vice versa.
It should be smarter. It's fairly shell-specific, hence the SHELL
definition wrapper. */
static char *
_delete_quotes (text)
char *text;
{
char *ret, *p, *r;
int l, quoted;
l = strlen (text);
ret = xmalloc (l + 1);
for (quoted = 0, p = text, r = ret; p && *p; p++)
{
/* Allow backslash-quoted characters to pass through unscathed. */
if (*p == '\\')
continue;
/* Close quote. */
if (quoted && *p == quoted)
{
quoted = 0;
continue;
}
/* Open quote. */
if (quoted == 0 && (*p == '\'' || *p == '"'))
{
quoted = *p;
continue;
}
*r++ = *p;
}
*r = '\0';
return ret;
}
#endif /* SHELL */
/* Complete the word at or before point.
WHAT_TO_DO says what to do with the completion.
`?' means list the possible completions.
TAB means do standard completion.
`*' means insert all of the possible completions. */
rl_complete_internal (what_to_do)
int what_to_do;
{
char **matches;
Function *our_func;
int start, scan, end, delimiter = 0, pass_next;
char *text, *saved_line_buffer;
char *replacement;
char quote_char = '\0';
#if defined (SHELL)
int found_quote = 0;
#endif
if (rl_line_buffer)
saved_line_buffer = savestring (rl_line_buffer);
else
saved_line_buffer = (char *)NULL;
if (rl_completion_entry_function)
our_func = rl_completion_entry_function;
else
our_func = (Function *)filename_completion_function;
/* Only the completion entry function can change this. */
rl_filename_completion_desired = 0;
/* We now look backwards for the start of a filename/variable word. */
end = rl_point;
if (rl_point)
{
if (rl_completer_quote_characters)
{
/* We have a list of characters which can be used in pairs to
quote substrings for the completer. Try to find the start
of an unclosed quoted substring. */
/* FOUND_QUOTE is set so we know what kind of quotes we found. */
for (scan = pass_next = 0; scan < end; scan++)
{
if (pass_next)
{
pass_next = 0;
continue;
}
if (rl_line_buffer[scan] == '\\')
{
pass_next = 1;
continue;
}
if (quote_char != '\0')
{
/* Ignore everything until the matching close quote char. */
if (rl_line_buffer[scan] == quote_char)
{
/* Found matching close. Abandon this substring. */
quote_char = '\0';
rl_point = end;
}
}
else if (strchr (rl_completer_quote_characters, rl_line_buffer[scan]))
{
/* Found start of a quoted substring. */
quote_char = rl_line_buffer[scan];
rl_point = scan + 1;
#if defined (SHELL)
if (quote_char == '\'')
found_quote |= 1;
else if (quote_char == '"')
found_quote |= 2;
#endif
}
}
}
if (rl_point == end)
{
int quoted = 0;
/* We didn't find an unclosed quoted substring up which to do
completion, so use the word break characters to find the
substring on which to complete. */
while (--rl_point)
{
#if defined (SHELL)
/* Don't let word break characters in quoted substrings break
words for the completer. */
if (found_quote)
{
if (strchr (rl_completer_quote_characters, rl_line_buffer[rl_point]))
{
quoted = !quoted;
continue;
}
if (quoted)
continue;
}
#endif /* SHELL */
if (strchr (rl_completer_word_break_characters, rl_line_buffer[rl_point]))
break;
}
}
/* If we are at a word break, then advance past it. */
if (strchr (rl_completer_word_break_characters, rl_line_buffer[rl_point]))
{
/* If the character that caused the word break was a quoting
character, then remember it as the delimiter. */
if (strchr ("\"'", rl_line_buffer[rl_point]) && (end - rl_point) > 1)
delimiter = rl_line_buffer[rl_point];
/* If the character isn't needed to determine something special
about what kind of completion to perform, then advance past it. */
if (!rl_special_prefixes ||
!strchr (rl_special_prefixes, rl_line_buffer[rl_point]))
rl_point++;
}
}
/* At this point, we know we have an open quote if quote_char != '\0'. */
start = rl_point;
rl_point = end;
text = rl_copy_text (start, end);
/* If the user wants to TRY to complete, but then wants to give
up and use the default completion function, they set the
variable rl_attempted_completion_function. */
if (rl_attempted_completion_function)
{
matches = (*rl_attempted_completion_function) (text, start, end);
if (matches)
{
/* XXX - This is questionable code. - XXX */
if (matches == (char **)-1)
matches = (char **)NULL;
our_func = (Function *)NULL;
goto after_usual_completion;
}
}
#if defined (SHELL)
/* Beware -- we're stripping the quotes here. Do this only if we know
we are doing filename completion. */
if (found_quote && our_func == (Function *)filename_completion_function)
{
/* delete single and double quotes */
replacement = _delete_quotes (text);
free (text);
text = replacement;
replacement = (char *)0;
}
#endif /* SHELL */
matches = completion_matches (text, our_func);
after_usual_completion:
free (text);
if (!matches)
ding ();
else
{
register int i;
/* It seems to me that in all the cases we handle we would like
to ignore duplicate possiblilities. Scan for the text to
insert being identical to the other completions. */
if (rl_ignore_completion_duplicates)
{
char *lowest_common;
int j, newlen = 0;
char dead_slot;
/* Sort the items. */
/* It is safe to sort this array, because the lowest common
denominator found in matches[0] will remain in place. */
for (i = 0; matches[i]; i++);
qsort (matches, i, sizeof (char *), compare_strings);
/* Remember the lowest common denominator for it may be unique. */
lowest_common = savestring (matches[0]);
for (i = 0; matches[i + 1]; i++)
{
if (strcmp (matches[i], matches[i + 1]) == 0)
{
free (matches[i]);
matches[i] = (char *)&dead_slot;
}
else
newlen++;
}
/* We have marked all the dead slots with (char *)&dead_slot.
Copy all the non-dead entries into a new array. */
{
char **temp_array =
(char **)xmalloc ((3 + newlen) * sizeof (char *));
for (i = 1, j = 1; matches[i]; i++)
{
if (matches[i] != (char *)&dead_slot)
temp_array[j++] = matches[i];
}
temp_array[j] = (char *)NULL;
if (matches[0] != (char *)&dead_slot)
free (matches[0]);
free (matches);
matches = temp_array;
}
/* Place the lowest common denominator back in [0]. */
matches[0] = lowest_common;
/* If there is one string left, and it is identical to the
lowest common denominator, then the LCD is the string to
insert. */
if (j == 2 && strcmp (matches[0], matches[1]) == 0)
{
free (matches[1]);
matches[1] = (char *)NULL;
}
}
switch (what_to_do)
{
case TAB:
/* If we are matching filenames, then here is our chance to
do clever processing by re-examining the list. Call the
ignore function with the array as a parameter. It can
munge the array, deleting matches as it desires. */
if (rl_ignore_some_completions_function &&
our_func == (Function *)filename_completion_function)
(void)(*rl_ignore_some_completions_function)(matches);
/* If we are doing completion on quoted substrings, and any matches
contain any of the completer_word_break_characters, then auto-
matically prepend the substring with a quote character (just pick
the first one from the list of such) if it does not already begin
with a quote string. FIXME: Need to remove any such automatically
inserted quote character when it no longer is necessary, such as
if we change the string we are completing on and the new set of
matches don't require a quoted substring. */
replacement = matches[0];
if (matches[0] && rl_completer_quote_characters && !quote_char &&
rl_filename_completion_desired)
{
int do_replace;
do_replace = NO_MATCH;
/* If there is a single match, see if we need to quote it.
This also checks whether the common prefix of several
matches needs to be quoted. If the common prefix should
not be checked, add !matches[1] to the if clause. */
if (rl_strpbrk (matches[0], rl_completer_word_break_characters))
do_replace = matches[1] ? MULT_MATCH : SINGLE_MATCH;
if (do_replace != NO_MATCH)
{
#if defined (SHELL)
/* XXX - experimental */
/* Quote the replacement, since we found an
embedded word break character in a potential
match. */
char *rtext, *mtext;
int rlen;
extern char *double_quote (); /* in builtins/common.c */
/* If DO_REPLACE == MULT_MATCH, it means that there is
more than one match. In this case, we do not add
the closing quote or attempt to perform tilde
expansion. If DO_REPLACE == SINGLE_MATCH, we try
to perform tilde expansion, because double quotes
inhibit tilde expansion by the shell. */
mtext = matches[0];
if (mtext[0] == '~' && do_replace == SINGLE_MATCH)
mtext = tilde_expand (matches[0]);
rtext = double_quote (mtext);
if (mtext != matches[0])
free (mtext);
rlen = strlen (rtext);
replacement = (char *)alloca (rlen + 1);
strcpy (replacement, rtext);
if (do_replace == MULT_MATCH)
replacement[rlen - 1] = '\0';
free (rtext);
#else /* !SHELL */
/* Found an embedded word break character in a potential
match, so we need to prepend a quote character if we
are replacing the completion string. */
replacement = (char *)alloca (strlen (matches[0]) + 2);
quote_char = *rl_completer_quote_characters;
*replacement = quote_char;
strcpy (replacement + 1, matches[0]);
#endif /* SHELL */
}
}
if (replacement)
{
rl_delete_text (start, rl_point);
rl_point = start;
rl_insert_text (replacement);
}
/* If there are more matches, ring the bell to indicate.
If this was the only match, and we are hacking files,
check the file to see if it was a directory. If so,
add a '/' to the name. If not, and we are at the end
of the line, then add a space. */
if (matches[1])
{
if (rl_editing_mode != vi_mode)
ding (); /* There are other matches remaining. */
}
else
{
char temp_string[4];
int temp_string_index = 0;
if (quote_char)
temp_string[temp_string_index++] = quote_char;
temp_string[temp_string_index++] = delimiter ? delimiter : ' ';
temp_string[temp_string_index++] = '\0';
if (rl_filename_completion_desired)
{
struct stat finfo;
char *filename = tilde_expand (matches[0]);
if ((stat (filename, &finfo) == 0) &&
S_ISDIR (finfo.st_mode))
{
if (rl_line_buffer[rl_point] != '/')
rl_insert_text ("/");
}
else
{
if (rl_point == rl_end)
rl_insert_text (temp_string);
}
free (filename);
}
else
{
if (rl_point == rl_end)
rl_insert_text (temp_string);
}
}
break;
case '*':
{
int i = 1;
rl_delete_text (start, rl_point);
rl_point = start;
rl_begin_undo_group ();
if (matches[1])
{
while (matches[i])
{
rl_insert_text (matches[i++]);
rl_insert_text (" ");
}
}
else
{
rl_insert_text (matches[0]);
rl_insert_text (" ");
}
rl_end_undo_group ();
}
break;
case '?':
{
int len, count, limit, max = 0;
int j, k, l;
/* Handle simple case first. What if there is only one answer? */
if (!matches[1])
{
char *temp = (char *)NULL;
if (rl_filename_completion_desired)
temp = strrchr (matches[0], '/');
if (!temp)
temp = matches[0];
else
temp++;
crlf ();
fprintf (rl_outstream, "%s", temp);
#if defined (VISIBLE_STATS)
if (rl_filename_completion_desired && rl_visible_stats)
{
int extension_char;
extension_char = stat_char (matches[0]);
if (extension_char)
putc (extension_char, rl_outstream);
}
#endif /* VISIBLE_STATS */
crlf ();
goto restart;
}
/* There is more than one answer. Find out how many there are,
and find out what the maximum printed length of a single entry
is. */
for (i = 1; matches[i]; i++)
{
char *temp;
int name_length;
/* If we are hacking filenames, then only count the characters
after the last slash in the pathname. */
if (rl_filename_completion_desired)
temp = strrchr (matches[i], '/');
else
temp = (char *)NULL;
if (!temp)
temp = matches[i];
else
temp++;
name_length = strlen (temp);
if (name_length > max)
max = name_length;
}
len = i - 1;
/* If there are many items, then ask the user if she
really wants to see them all. */
if (len >= rl_completion_query_items)
{
crlf ();
fprintf (rl_outstream,
"There are %d possibilities. Do you really", len);
crlf ();
fprintf (rl_outstream, "wish to see them all? (y or n)");
fflush (rl_outstream);
if (!get_y_or_n ())
{
crlf ();
goto restart;
}
}
/* How many items of MAX length can we fit in the screen window? */
max += 2;
limit = screenwidth / max;
if (limit != 1 && (limit * max == screenwidth))
limit--;
/* Avoid a possible floating exception. If max > screenwidth,
limit will be 0 and a divide-by-zero fault will result. */
if (limit == 0)
limit = 1;
/* How many iterations of the printing loop? */
count = (len + (limit - 1)) / limit;
/* Watch out for special case. If LEN is less than LIMIT, then
just do the inner printing loop. */
if (len < limit)
count = 1;
/* Sort the items if they are not already sorted. */
if (!rl_ignore_completion_duplicates)
qsort (matches, len, sizeof (char *), compare_strings);
/* Print the sorted items, up-and-down alphabetically, like
ls might. */
crlf ();
for (i = 1; i < count + 1; i++)
{
for (j = 0, l = i; j < limit; j++)
{
if (l > len || !matches[l])
{
break;
}
else
{
char *temp = (char *)NULL;
int printed_length;
if (rl_filename_completion_desired)
temp = strrchr (matches[l], '/');
if (!temp)
temp = matches[l];
else
temp++;
printed_length = strlen (temp);
fprintf (rl_outstream, "%s", temp);
#if defined (VISIBLE_STATS)
if (rl_filename_completion_desired &&
rl_visible_stats)
{
int extension_char;
extension_char = stat_char (matches[l]);
if (extension_char)
{
putc (extension_char, rl_outstream);
printed_length++;
}
}
#endif /* VISIBLE_STATS */
if (j + 1 < limit)
{
for (k = 0; k < max - printed_length; k++)
putc (' ', rl_outstream);
}
}
l += count;
}
crlf ();
}
restart:
rl_on_new_line ();
}
break;
default:
fprintf (stderr, "\r\nreadline: bad value for what_to_do in rl_complete\n");
abort ();
}
for (i = 0; matches[i]; i++)
free (matches[i]);
free (matches);
}
/* Check to see if the line has changed through all of this manipulation. */
if (saved_line_buffer)
{
if (strcmp (rl_line_buffer, saved_line_buffer) != 0)
completion_changed_buffer = 1;
else
completion_changed_buffer = 0;
free (saved_line_buffer);
}
}
#if defined (VISIBLE_STATS)
/* Return the character which best describes FILENAME.
`@' for symbolic links
`/' for directories
`*' for executables
`=' for sockets */
static int
stat_char (filename)
char *filename;
{
struct stat finfo;
int character = 0;
if (stat (filename, &finfo) == -1)
return (character);
if (S_ISDIR (finfo.st_mode))
character = '/';
#if defined (S_ISLNK)
else if (S_ISLNK (finfo.st_mode))
character = '@';
#endif /* S_ISLNK */
#if defined (S_ISSOCK)
else if (S_ISSOCK (finfo.st_mode))
character = '=';
#endif /* S_ISSOCK */
else if (S_ISREG (finfo.st_mode))
{
if (access (filename, X_OK) == 0)
character = '*';
}
return (character);
}
#endif /* VISIBLE_STATS */
/* Stupid comparison routine for qsort () ing strings. */
static int
compare_strings (s1, s2)
char **s1, **s2;
{
return (strcmp (*s1, *s2));
}
/* A completion function for usernames.
TEXT contains a partial username preceded by a random
character (usually `~'). */
char *
username_completion_function (text, state)
int state;
char *text;
{
#if defined (MINIMAL)
return (char *)NULL;
#else /* !MINIMAL */
static char *username = (char *)NULL;
static struct passwd *entry;
static int namelen, first_char, first_char_loc;
if (!state)
{
if (username)
free (username);
first_char = *text;
if (first_char == '~')
first_char_loc = 1;
else
first_char_loc = 0;
username = savestring (&text[first_char_loc]);
namelen = strlen (username);
setpwent ();
}
while (entry = getpwent ())
{
if (strncmp (username, entry->pw_name, namelen) == 0)
break;
}
if (!entry)
{
endpwent ();
return ((char *)NULL);
}
else
{
char *value = (char *)xmalloc (2 + strlen (entry->pw_name));
*value = *text;
strcpy (value + first_char_loc, entry->pw_name);
if (first_char == '~')
rl_filename_completion_desired = 1;
return (value);
}
#endif /* !MINIMAL */
}
/* **************************************************************** */
/* */
/* Completion */
/* */
/* **************************************************************** */
/* Non-zero means that case is not significant in completion. */
int completion_case_fold = 0;
/* Return an array of (char *) which is a list of completions for TEXT.
If there are no completions, return a NULL pointer.
The first entry in the returned array is the substitution for TEXT.
The remaining entries are the possible completions.
The array is terminated with a NULL pointer.
ENTRY_FUNCTION is a function of two args, and returns a (char *).
The first argument is TEXT.
The second is a state argument; it should be zero on the first call, and
non-zero on subsequent calls. It returns a NULL pointer to the caller
when there are no more matches.
*/
char **
completion_matches (text, entry_function)
char *text;
CPFunction *entry_function;
{
/* Number of slots in match_list. */
int match_list_size;
/* The list of matches. */
char **match_list =
(char **)xmalloc (((match_list_size = 10) + 1) * sizeof (char *));
/* Number of matches actually found. */
int matches = 0;
/* Temporary string binder. */
char *string;
match_list[1] = (char *)NULL;
while (string = (*entry_function) (text, matches))
{
if (matches + 1 == match_list_size)
match_list = (char **)xrealloc
(match_list, ((match_list_size += 10) + 1) * sizeof (char *));
match_list[++matches] = string;
match_list[matches + 1] = (char *)NULL;
}
/* If there were any matches, then look through them finding out the
lowest common denominator. That then becomes match_list[0]. */
if (matches)
{
register int i = 1;
int low = 100000; /* Count of max-matched characters. */
/* If only one match, just use that. */
if (matches == 1)
{
match_list[0] = match_list[1];
match_list[1] = (char *)NULL;
}
else
{
/* Otherwise, compare each member of the list with
the next, finding out where they stop matching. */
while (i < matches)
{
register int c1, c2, si;
if (completion_case_fold)
{
for (si = 0;
(c1 = to_lower(match_list[i][si])) &&
(c2 = to_lower(match_list[i + 1][si]));
si++)
if (c1 != c2) break;
}
else
{
for (si = 0;
(c1 = match_list[i][si]) &&
(c2 = match_list[i + 1][si]);
si++)
if (c1 != c2) break;
}
if (low > si) low = si;
i++;
}
match_list[0] = (char *)xmalloc (low + 1);
strncpy (match_list[0], match_list[1], low);
match_list[0][low] = '\0';
}
}
else /* There were no matches. */
{
free (match_list);
match_list = (char **)NULL;
}
return (match_list);
}
/* Okay, now we write the entry_function for filename completion. In the
general case. Note that completion in the shell is a little different
because of all the pathnames that must be followed when looking up the
completion for a command. */
char *
filename_completion_function (text, state)
int state;
char *text;
{
#if !defined(_WIN32)
static DIR *directory;
static char *filename = (char *)NULL;
static char *dirname = (char *)NULL;
static char *users_dirname = (char *)NULL;
static int filename_len;
dirent *entry = (dirent *)NULL;
/* If we don't have any state, then do some initialization. */
if (!state)
{
char *temp;
if (dirname) free (dirname);
if (filename) free (filename);
if (users_dirname) free (users_dirname);
filename = savestring (text);
if (!*text) text = ".";
dirname = savestring (text);
temp = strrchr (dirname, '/');
if (temp)
{
strcpy (filename, ++temp);
*temp = '\0';
}
else
strcpy (dirname, ".");
/* We aren't done yet. We also support the "~user" syntax. */
/* Save the version of the directory that the user typed. */
users_dirname = savestring (dirname);
{
char *temp_dirname;
temp_dirname = tilde_expand (dirname);
free (dirname);
dirname = temp_dirname;
if (rl_symbolic_link_hook)
(*rl_symbolic_link_hook) (&dirname);
}
directory = opendir (dirname);
filename_len = strlen (filename);
rl_filename_completion_desired = 1;
}
/* At this point we should entertain the possibility of hacking wildcarded
filenames, like /usr/man/man<WILD>/te<TAB>. If the directory name
contains globbing characters, then build an array of directories, and
then map over that list while completing. */
/* *** UNIMPLEMENTED *** */
/* Now that we have some state, we can read the directory. */
while (directory && (entry = readdir (directory)))
{
/* Special case for no filename.
All entries except "." and ".." match. */
if (!filename_len)
{
if ((strcmp (entry->d_name, ".") != 0) &&
(strcmp (entry->d_name, "..") != 0))
break;
}
else
{
/* Otherwise, if these match upto the length of filename, then
it is a match. */
if (((int)D_NAMLEN (entry)) >= filename_len &&
(entry->d_name[0] == filename[0]) &&
(strncmp (filename, entry->d_name, filename_len) == 0))
{
break;
}
}
}
if (!entry)
{
if (directory)
{
closedir (directory);
directory = (DIR *)NULL;
}
if (dirname)
{
free (dirname);
dirname = (char *)NULL;
}
if (filename)
{
free (filename);
filename = (char *)NULL;
}
if (users_dirname)
{
free (users_dirname);
users_dirname = (char *)NULL;
}
return (char *)NULL;
}
else
{
char *temp;
if (dirname && (strcmp (dirname, ".") != 0))
{
if (rl_complete_with_tilde_expansion && *users_dirname == '~')
{
int dirlen = strlen (dirname);
temp = (char *)xmalloc (2 + dirlen + D_NAMLEN (entry));
strcpy (temp, dirname);
/* Canonicalization cuts off any final slash present. We need
to add it back. */
if (dirname[dirlen - 1] != '/')
{
temp[dirlen] = '/';
temp[dirlen + 1] = '\0';
}
}
else
{
temp = (char *)
xmalloc (1 + strlen (users_dirname) + D_NAMLEN (entry));
strcpy (temp, users_dirname);
}
strcat (temp, entry->d_name);
}
else
{
temp = (savestring (entry->d_name));
}
return (temp);
}
#else
return NULL;
#endif
}
/* A function for simple tilde expansion. */
int
rl_tilde_expand (ignore, key)
int ignore, key;
{
register int start, end;
char *homedir;
end = rl_point;
start = end - 1;
if (rl_point == rl_end && rl_line_buffer[rl_point] == '~')
{
homedir = tilde_expand ("~");
goto insert;
}
else if (rl_line_buffer[start] != '~')
{
for (; !whitespace (rl_line_buffer[start]) && start >= 0; start--);
start++;
}
end = start;
do
{
end++;
}
while (!whitespace (rl_line_buffer[end]) && end < rl_end);
if (whitespace (rl_line_buffer[end]) || end >= rl_end)
end--;
/* If the first character of the current word is a tilde, perform
tilde expansion and insert the result. If not a tilde, do
nothing. */
if (rl_line_buffer[start] == '~')
{
char *temp;
int len;
len = end - start + 1;
temp = (char *)alloca (len + 1);
strncpy (temp, rl_line_buffer + start, len);
temp[len] = '\0';
homedir = tilde_expand (temp);
insert:
rl_begin_undo_group ();
rl_delete_text (start, end + 1);
rl_point = start;
rl_insert_text (homedir);
rl_end_undo_group ();
}
return (0);
}
/* Find the first occurrence in STRING1 of any character from STRING2.
Return a pointer to the character in STRING1. */
static char *
rl_strpbrk (string1, string2)
char *string1, *string2;
{
register char *scan;
for (; *string1; string1++)
{
for (scan = string2; *scan; scan++)
{
if (*string1 == *scan)
{
return (string1);
}
}
}
return ((char *)NULL);
}
#if defined (STATIC_MALLOC)
/* **************************************************************** */
/* */
/* xmalloc and xrealloc () */
/* */
/* **************************************************************** */
static void memory_error_and_abort ();
static char *
xmalloc (bytes)
int bytes;
{
char *temp = (char *)malloc (bytes);
if (!temp)
memory_error_and_abort ();
return (temp);
}
static char *
xrealloc (pointer, bytes)
char *pointer;
int bytes;
{
char *temp;
if (!pointer)
temp = (char *)malloc (bytes);
else
temp = (char *)realloc (pointer, bytes);
if (!temp)
memory_error_and_abort ();
return (temp);
}
static void
memory_error_and_abort ()
{
fprintf (stderr, "readline: Out of virtual memory!\n");
abort ();
}
#endif /* STATIC_MALLOC */
|