forked from fish-shell/fish-shell
-
Notifications
You must be signed in to change notification settings - Fork 0
/
complete.cpp
2034 lines (1681 loc) · 54 KB
/
complete.cpp
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
/** \file complete.c Functions related to tab-completion.
These functions are used for storing and retrieving tab-completion data, as well as for performing tab-completion.
*/
#include "config.h"
#include <stdlib.h>
#include <stdio.h>
#include <limits.h>
#include <string.h>
#include <wchar.h>
#include <wctype.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <dirent.h>
#include <errno.h>
#include <termios.h>
#include <ctype.h>
#include <pwd.h>
#include <signal.h>
#include <wchar.h>
#include <pthread.h>
#include <algorithm>
#include "fallback.h"
#include "util.h"
#include "tokenizer.h"
#include "wildcard.h"
#include "proc.h"
#include "parser.h"
#include "function.h"
#include "complete.h"
#include "builtin.h"
#include "env.h"
#include "exec.h"
#include "expand.h"
#include "common.h"
#include "reader.h"
#include "history.h"
#include "intern.h"
#include "parse_util.h"
#include "parser_keywords.h"
#include "wutil.h"
#include "path.h"
#include "builtin_scripts.h"
/*
Completion description strings, mostly for different types of files, such as sockets, block devices, etc.
There are a few more completion description strings defined in
expand.c. Maybe all completion description strings should be defined
in the same file?
*/
/**
Description for ~USER completion
*/
#define COMPLETE_USER_DESC _( L"Home for %ls" )
/**
Description for short variables. The value is concatenated to this description
*/
#define COMPLETE_VAR_DESC_VAL _( L"Variable: %ls" )
/**
The maximum number of commands on which to perform description
lookup. The lookup process is quite time consuming, so this should
be set to a pretty low number.
*/
#define MAX_CMD_DESC_LOOKUP 10
/**
Condition cache value returned from hashtable when this condition
has not yet been tested. This value is NULL, so that when the hash
table returns NULL, this wil be seen as an untested condition.
*/
#define CC_NOT_TESTED 0
/**
Condition cache value returned from hashtable when the condition is
met. This can be any value, that is a valid pointer, and that is
different from CC_NOT_TESTED and CC_FALSE.
*/
#define CC_TRUE L"true"
/**
Condition cache value returned from hashtable when the condition is
not met. This can be any value, that is a valid pointer, and that
is different from CC_NOT_TESTED and CC_TRUE.
*/
#define CC_FALSE L"false"
/**
The special cased translation macro for completions. The empty
string needs to be special cased, since it can occur, and should
not be translated. (Gettext returns the version information as the
response)
*/
#ifdef USE_GETTEXT
#define C_(wstr) ((wcscmp(wstr, L"")==0)?L"":wgettext(wstr))
#else
#define C_(string) (string)
#endif
/**
The maximum amount of time that we're willing to spend doing
username tilde completion. This special limit has been coded in
because user lookup can be extremely slow in cases of a humongous
LDAP database. (Google, I'm looking at you)
*/
#define MAX_USER_LOOKUP_TIME 0.2
/**
Struct describing a completion option entry.
If short_opt and long_opt are both zero, the comp field must not be
empty and contains a list of arguments to the command.
If either short_opt or long_opt are non-zero, they specify a switch
for the command. If \c comp is also not empty, it contains a list
of non-switch arguments that may only follow directly after the
specified switch.
*/
typedef struct complete_entry_opt
{
/** Short style option */
wchar_t short_opt;
/** Long style option */
wcstring long_opt;
/** Arguments to the option */
wcstring comp;
/** Description of the completion */
wcstring desc;
/** Condition under which to use the option */
wcstring condition;
/** Must be one of the values SHARED, NO_FILES, NO_COMMON,
EXCLUSIVE, and determines how completions should be performed
on the argument after the switch. */
int result_mode;
/** True if old style long options are used */
int old_mode;
/** Completion flags */
complete_flags_t flags;
const wchar_t *localized_desc() const
{
const wchar_t *tmp = desc.c_str();
return C_(tmp);
}
} complete_entry_opt_t;
/* Last value used in the order field of completion_entry_t */
static unsigned int kCompleteOrder = 0;
/**
Struct describing a command completion
*/
typedef std::list<complete_entry_opt_t> option_list_t;
class completion_entry_t
{
public:
/** List of all options */
option_list_t options;
/** String containing all short option characters */
wcstring short_opt_str;
public:
/** Command string */
const wcstring cmd;
/** True if command is a path */
const bool cmd_is_path;
/** True if no other options than the ones supplied are possible */
bool authoritative;
/** Order for when this completion was created. This aids in outputting completions sorted by time. */
const unsigned int order;
/** Getters for option list. */
const option_list_t &get_options() const;
/** Adds or removes an option. */
void add_option(const complete_entry_opt_t &opt);
bool remove_option(wchar_t short_opt, const wchar_t *long_opt);
/** Getter for short_opt_str. */
wcstring &get_short_opt_str();
const wcstring &get_short_opt_str() const;
completion_entry_t(const wcstring &c, bool type, const wcstring &options, bool author) :
short_opt_str(options),
cmd(c),
cmd_is_path(type),
authoritative(author),
order(++kCompleteOrder)
{
}
};
/** Set of all completion entries */
struct completion_entry_set_comparer {
/** Comparison for std::set */
bool operator()(completion_entry_t *p1, completion_entry_t *p2) const {
/* Paths always come last for no particular reason */
if (p1->cmd_is_path != p2->cmd_is_path) {
return p1->cmd_is_path < p2->cmd_is_path;
} else {
return p1->cmd < p2->cmd;
}
}
};
typedef std::set<completion_entry_t *, completion_entry_set_comparer> completion_entry_set_t;
static completion_entry_set_t completion_set;
// Comparison function to sort completions by their order field
static bool compare_completions_by_order(const completion_entry_t *p1, const completion_entry_t *p2) {
return p1->order < p2->order;
}
/** The lock that guards the list of completion entries */
static pthread_mutex_t completion_lock = PTHREAD_MUTEX_INITIALIZER;
/** The lock that guards the options list of individual completion entries. If both completion_lock and completion_entry_lock are to be taken, completion_lock must be taken first. */
static pthread_mutex_t completion_entry_lock = PTHREAD_MUTEX_INITIALIZER;
void completion_entry_t::add_option(const complete_entry_opt_t &opt) {
ASSERT_IS_LOCKED(completion_entry_lock);
options.push_front(opt);
}
const option_list_t &completion_entry_t::get_options() const {
ASSERT_IS_LOCKED(completion_entry_lock);
return options;
}
wcstring &completion_entry_t::get_short_opt_str() {
ASSERT_IS_LOCKED(completion_entry_lock);
return short_opt_str;
}
const wcstring &completion_entry_t::get_short_opt_str() const {
ASSERT_IS_LOCKED(completion_entry_lock);
return short_opt_str;
}
/* completion_t functions */
completion_t::completion_t(const wcstring &comp, const wcstring &desc, int flags_val) : completion(comp), description(desc), flags(flags_val)
{
if( flags & COMPLETE_AUTO_SPACE )
{
flags = flags & ~COMPLETE_AUTO_SPACE;
size_t len = completion.size();
if (len > 0 && ( wcschr( L"/=@:", comp.at(len-1)) != 0 ))
flags |= COMPLETE_NO_SPACE;
}
}
completion_t::completion_t(const completion_t &him) : completion(him.completion), description(him.description), flags(him.flags)
{
}
completion_t &completion_t::operator=(const completion_t &him)
{
if (this != &him)
{
this->completion = him.completion;
this->description = him.description;
this->flags = him.flags;
}
return *this;
}
bool completion_t::operator < (const completion_t& rhs) const
{
return this->completion < rhs.completion;
}
bool completion_t::operator == (const completion_t& rhs) const
{
return this->completion == rhs.completion;
}
bool completion_t::operator != (const completion_t& rhs) const
{
return ! (*this == rhs);
}
wcstring_list_t completions_to_wcstring_list( const std::vector<completion_t> &list )
{
wcstring_list_t strings;
strings.reserve(list.size());
for (std::vector<completion_t>::const_iterator iter = list.begin(); iter != list.end(); ++iter) {
strings.push_back(iter->completion);
}
return strings;
}
void sort_completions( std::vector<completion_t> &completions)
{
std::sort(completions.begin(), completions.end());
}
/** Class representing an attempt to compute completions */
class completer_t {
const complete_type_t type;
const wcstring initial_cmd;
std::vector<completion_t> completions;
wcstring_list_t commands_to_load;
/** Table of completions conditions that have already been tested and the corresponding test results */
typedef std::map<wcstring, bool> condition_cache_t;
condition_cache_t condition_cache;
public:
completer_t(const wcstring &c, complete_type_t t) :
type(t),
initial_cmd(c)
{
}
bool empty() const { return completions.empty(); }
const std::vector<completion_t> &get_completions(void) { return completions; }
bool try_complete_variable( const wcstring &str );
bool try_complete_user( const wcstring &str );
bool complete_param( const wcstring &cmd_orig,
const wcstring &popt,
const wcstring &str,
bool use_switches);
void complete_param_expand(const wcstring &str, bool do_file);
void debug_print_completions();
void complete_cmd( const wcstring &str,
bool use_function,
bool use_builtin,
bool use_command);
void complete_from_args( const wcstring &str,
const wcstring &args,
const wcstring &desc,
complete_flags_t flags );
void complete_cmd_desc( const wcstring &str );
bool complete_variable(const wcstring &str, size_t start_offset);
bool condition_test( const wcstring &condition );
void complete_strings( const wcstring &wc_escaped,
const wchar_t *desc,
wcstring (*desc_func)(const wcstring &),
std::vector<completion_t> &possible_comp,
complete_flags_t flags );
expand_flags_t expand_flags() const {
/* Never do command substitution in autosuggestions. Sadly, we also can't yet do job expansion because it's not thread safe. */
expand_flags_t result = 0;
if (type == COMPLETE_AUTOSUGGEST)
result |= EXPAND_SKIP_CMDSUBST | EXPAND_SKIP_JOBS;
return result;
}
void get_commands_to_load(wcstring_list_t *lst) {
if (lst)
lst->insert(lst->end(), commands_to_load.begin(), commands_to_load.end());
}
};
/* Autoloader for completions */
class completion_autoload_t : public autoload_t {
public:
completion_autoload_t();
virtual void command_removed(const wcstring &cmd);
};
static completion_autoload_t completion_autoloader;
/** Constructor */
completion_autoload_t::completion_autoload_t() : autoload_t(L"fish_complete_path",
internal_completion_scripts,
sizeof internal_completion_scripts / sizeof *internal_completion_scripts)
{
}
/** Callback when an autoloaded completion is removed */
void completion_autoload_t::command_removed(const wcstring &cmd) {
complete_remove( cmd.c_str(), COMMAND, 0, 0 );
}
/**
Create a new completion entry
*/
void append_completion(std::vector<completion_t> &completions, const wcstring &comp, const wcstring &desc, complete_flags_t flags)
{
completions.push_back(completion_t(comp, desc, flags));
}
/**
Test if the specified script returns zero. The result is cached, so
that if multiple completions use the same condition, it needs only
be evaluated once. condition_cache_clear must be called after a
completion run to make sure that there are no stale completions.
*/
bool completer_t::condition_test( const wcstring &condition )
{
if( condition.empty() )
{
// fwprintf( stderr, L"No condition specified\n" );
return 1;
}
if (this->type == COMPLETE_AUTOSUGGEST)
{
/* Autosuggestion can't support conditions */
return 0;
}
ASSERT_IS_MAIN_THREAD();
bool test_res;
condition_cache_t::iterator cached_entry = condition_cache.find(condition);
if (cached_entry == condition_cache.end()) {
/* Compute new value and reinsert it */
test_res = (0 == exec_subshell( condition));
condition_cache[condition] = test_res;
} else {
/* Use the old value */
test_res = cached_entry->second;
}
return test_res;
}
/** Search for an exactly matching completion entry. Must be called while locked. */
static completion_entry_t *complete_find_exact_entry( const wcstring &cmd, const bool cmd_is_path )
{
ASSERT_IS_LOCKED(completion_lock);
completion_entry_t *result = NULL;
completion_entry_t tmp_entry(cmd, cmd_is_path, L"", false);
completion_entry_set_t::iterator iter = completion_set.find(&tmp_entry);
if (iter != completion_set.end()) {
result = *iter;
}
return result;
}
/** Locate the specified entry. Create it if it doesn't exist. Must be called while locked. */
static completion_entry_t *complete_get_exact_entry( const wcstring &cmd, bool cmd_is_path )
{
ASSERT_IS_LOCKED(completion_lock);
completion_entry_t *c;
c = complete_find_exact_entry( cmd, cmd_is_path );
if( c == NULL )
{
c = new completion_entry_t(cmd, cmd_is_path, L"", false);
completion_set.insert(c);
}
return c;
}
void complete_set_authoritative( const wchar_t *cmd, bool cmd_is_path, bool authoritative )
{
completion_entry_t *c;
CHECK( cmd, );
scoped_lock lock(completion_lock);
c = complete_get_exact_entry( cmd, cmd_is_path );
c->authoritative = authoritative;
}
void complete_add( const wchar_t *cmd,
bool cmd_is_path,
wchar_t short_opt,
const wchar_t *long_opt,
int old_mode,
int result_mode,
const wchar_t *condition,
const wchar_t *comp,
const wchar_t *desc,
complete_flags_t flags )
{
CHECK( cmd, );
/* Lock the lock that allows us to edit the completion entry list */
scoped_lock lock(completion_lock);
/* Lock the lock that allows us to edit individual completion entries */
scoped_lock lock2(completion_entry_lock);
completion_entry_t *c;
c = complete_get_exact_entry( cmd, cmd_is_path );
/* Create our new option */
complete_entry_opt_t opt;
if( short_opt != L'\0' )
{
int len = 1 + ((result_mode & NO_COMMON) != 0);
c->get_short_opt_str().push_back(short_opt);
if( len == 2 )
{
c->get_short_opt_str().push_back(L':');
}
}
opt.short_opt = short_opt;
opt.result_mode = result_mode;
opt.old_mode=old_mode;
if (comp) opt.comp = comp;
if (condition) opt.condition = condition;
if (long_opt) opt.long_opt = long_opt;
if (desc) opt.desc = desc;
opt.flags = flags;
c->add_option(opt);
}
/**
Remove all completion options in the specified entry that match the
specified short / long option strings. Returns true if it is now
empty and should be deleted, false if it's not empty. Must be called while locked.
*/
bool completion_entry_t::remove_option( wchar_t short_opt, const wchar_t *long_opt )
{
ASSERT_IS_LOCKED(completion_lock);
ASSERT_IS_LOCKED(completion_entry_lock);
if(( short_opt == 0 ) && (long_opt == 0 ) )
{
this->options.clear();
}
else
{
for (option_list_t::iterator iter = this->options.begin(); iter != this->options.end(); )
{
complete_entry_opt_t &o = *iter;
if(short_opt==o.short_opt || long_opt == o.long_opt)
{
/* fwprintf( stderr,
L"remove option -%lc --%ls\n",
o->short_opt?o->short_opt:L' ',
o->long_opt );
*/
if( o.short_opt )
{
wcstring &short_opt_str = this->get_short_opt_str();
size_t idx = short_opt_str.find(o.short_opt);
if (idx != wcstring::npos)
{
/* Consume all colons */
size_t first_non_colon = idx + 1;
while (first_non_colon < short_opt_str.size() && short_opt_str.at(first_non_colon) == L':')
first_non_colon++;
short_opt_str.erase(idx, first_non_colon - idx);
}
}
/* Destroy this option and go to the next one */
iter = this->options.erase(iter);
}
else
{
/* Just go to the next one */
++iter;
}
}
}
return this->options.empty();
}
void complete_remove( const wchar_t *cmd,
bool cmd_is_path,
wchar_t short_opt,
const wchar_t *long_opt )
{
CHECK( cmd, );
scoped_lock lock(completion_lock);
scoped_lock lock2(completion_entry_lock);
completion_entry_t tmp_entry(cmd, cmd_is_path, L"", false);
completion_entry_set_t::iterator iter = completion_set.find(&tmp_entry);
if (iter != completion_set.end()) {
completion_entry_t *entry = *iter;
bool delete_it = entry->remove_option(short_opt, long_opt);
if (delete_it) {
/* Delete this entry */
completion_set.erase(iter);
delete entry;
}
}
}
/* Formats an error string by prepending the prefix and then appending the str in single quotes */
static wcstring format_error(const wchar_t *prefix, const wcstring &str) {
wcstring result = prefix;
result.push_back(L'\'');
result.append(str);
result.push_back(L'\'');
return result;
}
/**
Find the full path and commandname from a command string 'str'.
*/
static void parse_cmd_string(const wcstring &str, wcstring &path, wcstring &cmd) {
if (! path_get_path(str, &path)) {
/** Use the empty string as the 'path' for commands that can not be found. */
path = L"";
}
/* Make sure the path is not included in the command */
size_t last_slash = str.find_last_of(L'/');
if (last_slash != wcstring::npos) {
cmd = str.substr(last_slash + 1);
} else {
cmd = str;
}
}
int complete_is_valid_option( const wcstring &str,
const wcstring &opt,
wcstring_list_t *errors,
bool allow_autoload )
{
wcstring cmd, path;
bool found_match = false;
bool authoritative = true;
int opt_found=0;
std::set<wcstring> gnu_match_set;
bool is_gnu_opt=false;
bool is_old_opt=false;
bool is_short_opt=false;
bool is_gnu_exact=false;
size_t gnu_opt_len=0;
if (opt.empty())
return false;
std::vector<bool> short_validated;
/*
Check some generic things like -- and - options.
*/
switch( opt.size() )
{
case 0:
case 1:
{
return true;
}
case 2:
{
if( opt == L"--" )
{
return true;
}
break;
}
}
if( opt.at(0) != L'-' )
{
if( errors )
errors->push_back(L"Option does not begin with a '-'");
return false;
}
short_validated.resize(opt.size(), 0);
is_gnu_opt = opt.at(1) == L'-';
if( is_gnu_opt )
{
size_t opt_end = opt.find(L'=');
if( opt_end != wcstring::npos )
{
gnu_opt_len = opt_end-2;
}
else
{
gnu_opt_len = opt.size() - 2;
}
}
parse_cmd_string( str, path, cmd );
/*
Make sure completions are loaded for the specified command
*/
if (allow_autoload) {
complete_load( cmd, false );
}
scoped_lock lock(completion_lock);
scoped_lock lock2(completion_entry_lock);
for (completion_entry_set_t::const_iterator iter = completion_set.begin(); iter != completion_set.end(); ++iter)
{
const completion_entry_t *i = *iter;
const wcstring &match = i->cmd_is_path ? path : cmd;
if( !wildcard_match( match, i->cmd ) )
{
continue;
}
found_match = true;
if (! i->authoritative)
{
authoritative = false;
break;
}
const option_list_t &options = i->get_options();
if( is_gnu_opt )
{
for (option_list_t::const_iterator iter = options.begin(); iter != options.end(); ++iter)
{
const complete_entry_opt_t &o = *iter;
if (o.old_mode )
{
continue;
}
if (opt.compare(2, gnu_opt_len, o.long_opt) == 0)
{
gnu_match_set.insert(o.long_opt);
if (opt.compare(2, o.long_opt.size(), o.long_opt))
{
is_gnu_exact = true;
}
}
}
}
else
{
/* Check for old style options */
for (option_list_t::const_iterator iter = options.begin(); iter != options.end(); ++iter)
{
const complete_entry_opt_t &o = *iter;
if( !o.old_mode )
continue;
if( opt.compare(1, wcstring::npos, o.long_opt )==0)
{
opt_found = true;
is_old_opt = true;
break;
}
}
if( is_old_opt )
break;
for (size_t opt_idx = 1; opt_idx < opt.size(); opt_idx++)
{
const wcstring &short_opt_str = i->get_short_opt_str();
size_t str_idx = short_opt_str.find(opt.at(opt_idx));
if (str_idx != wcstring::npos )
{
if (str_idx + 1 < short_opt_str.size() && short_opt_str.at(str_idx + 1) == L':' )
{
/*
This is a short option with an embedded argument,
call complete_is_valid_argument on the argument.
*/
const wcstring nopt = L"-" + opt.substr(1, 1);
short_validated.at(opt_idx) =
complete_is_valid_argument( str, nopt, opt.substr(2));
}
else
{
short_validated.at(opt_idx) = true;
}
}
}
}
}
if( authoritative )
{
if( !is_gnu_opt && !is_old_opt )
is_short_opt = 1;
if( is_short_opt )
{
opt_found=1;
for( size_t j=1; j<opt.size(); j++)
{
if ( !short_validated.at(j))
{
if( errors )
{
const wcstring str = opt.substr(j, 1);
errors->push_back(format_error(_(L"Unknown option: "), str.c_str()));
}
opt_found = 0;
break;
}
}
}
if( is_gnu_opt )
{
opt_found = is_gnu_exact || (gnu_match_set.size() == 1);
if( errors && !opt_found )
{
const wchar_t *prefix;
if( gnu_match_set.empty())
{
prefix = _(L"Unknown option: ");
}
else
{
prefix = _(L"Multiple matches for option: ");
}
errors->push_back(format_error(prefix, opt));
}
}
}
return (authoritative && found_match)?opt_found:true;
}
bool complete_is_valid_argument( const wcstring &str, const wcstring &opt, const wcstring &arg )
{
return true;
}
/**
Copy any strings in possible_comp which have the specified prefix
to the completer's completion array. The prefix may contain wildcards.
The output will consist of completion_t structs.
There are three ways to specify descriptions for each
completion. Firstly, if a description has already been added to the
completion, it is _not_ replaced. Secondly, if the desc_func
function is specified, use it to determine a dynamic
completion. Thirdly, if none of the above are available, the desc
string is used as a description.
\param wc_escaped the prefix, possibly containing wildcards. The wildcard should not have been unescaped, i.e. '*' should be used for any string, not the ANY_STRING character.
\param desc the default description, used for completions with no embedded description. The description _may_ contain a COMPLETE_SEP character, if not, one will be prefixed to it
\param desc_func the function that generates a description for those completions witout an embedded description
\param possible_comp the list of possible completions to iterate over
*/
void completer_t::complete_strings( const wcstring &wc_escaped,
const wchar_t *desc,
wcstring (*desc_func)(const wcstring &),
std::vector<completion_t> &possible_comp,
complete_flags_t flags )
{
wcstring tmp = wc_escaped;
if (! expand_one(tmp, EXPAND_SKIP_CMDSUBST | EXPAND_SKIP_WILDCARDS | this->expand_flags()))
return;
const wchar_t *wc = parse_util_unescape_wildcards( tmp.c_str() );
for( size_t i=0; i< possible_comp.size(); i++ )
{
wcstring temp = possible_comp.at( i ).completion;
const wchar_t *next_str = temp.empty()?NULL:temp.c_str();
if( next_str )
{
wildcard_complete( next_str, wc, desc, desc_func, this->completions, flags );
}
}
free( (void *)wc );
}
/**
If command to complete is short enough, substitute
the description with the whatis information for the executable.
*/
void completer_t::complete_cmd_desc( const wcstring &str )
{
ASSERT_IS_MAIN_THREAD();
const wchar_t *cmd_start;
int skip;
const wchar_t * const cmd = str.c_str();
cmd_start=wcsrchr(cmd, L'/');
if( cmd_start )
cmd_start++;
else
cmd_start = cmd;
/*
Using apropos with a single-character search term produces far
to many results - require at least two characters if we don't
know the location of the whatis-database.
*/
if (wcslen(cmd_start) < 2)
return;
if( wildcard_has( cmd_start, 0 ) )
{
return;
}
skip = 1;
for( size_t i=0; i< this->completions.size(); i++ )
{
const completion_t &c = this->completions.at ( i );
if( c.completion.empty() || (c.completion[c.completion.size()-1] != L'/' ))
{
skip = 0;
break;
}
}
if( skip )
{
return;
}
wcstring lookup_cmd(L"__fish_describe_command ");
lookup_cmd.append(escape_string(cmd_start, 1));
std::map<wcstring, wcstring> lookup;
/*
First locate a list of possible descriptions using a single
call to apropos or a direct search if we know the location
of the whatis database. This can take some time on slower
systems with a large set of manuals, but it should be ok
since apropos is only called once.
*/
wcstring_list_t list;
if( exec_subshell( lookup_cmd, list ) != -1 )
{
/*
Then discard anything that is not a possible completion and put
the result into a hashtable with the completion as key and the
description as value.
Should be reasonably fast, since no memory allocations are needed.
*/
for( size_t i=0; i < list.size(); i++ )
{
const wcstring &elstr = list.at(i);
const wcstring fullkey(elstr, wcslen(cmd_start));
size_t tab_idx = fullkey.find(L'\t');
if( tab_idx == wcstring::npos )
continue;
const wcstring key(fullkey, 0, tab_idx);
wcstring val(fullkey, tab_idx + 1);
/*
And once again I make sure the first character is uppercased
because I like it that way, and I get to decide these
things.
*/
if (! val.empty())
val[0]=towupper(val[0]);
lookup[key] = val;