-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcommands.cpp
executable file
·1484 lines (1343 loc) · 50.7 KB
/
commands.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
/*
Copyright (C) 2013-2015 Roelof Nico du Toit.
@description Commands engine
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
of the Software, and to permit persons to whom the Software is furnished to do
so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
#include "commands.h"
#include "debug.h"
#include <new>
#include <memory>
#include <list>
#include <algorithm>
#include <assert.h>
namespace libchars {
const char *commands::color_str(command_colors_e color_idx) const
{
if (!edit.control())
return "";
switch (color_idx) {
case COLOR_NORMAL: return "\x1b[0m";
case COLOR_UNKNOWN_TOKEN: return "\x1b[0;31m";
case COLOR_VALID_COMMAND: return "\x1b[0;32m";
case COLOR_INVALID_COMMAND: return "\x1b[1;31m";
case COLOR_PARTIAL_COMMAND: return "\x1b[0;33m";
case COLOR_COMPLETION: return "\x1b[0;36m";
case COLOR_QUOTED_STRING: return "\x1b[1;34m";
case COLOR_VALID_ARGUMENT: return "\x1b[1m";
case COLOR_PARTIAL_ARGUMENT: return "\x1b[0m";
case COLOR_INVALID_ARGUMENT: return "\x1b[1;31m";
default: return "";
}
}
command_node::command_node(const std::string &part_) :
part(part_),mask(0),hidden(false),cmd(NULL),
head(NULL),tail(NULL),
next(NULL),start(NULL) {}
command_node::command_node() :
mask(0),hidden(false),cmd(NULL),
head(NULL),tail(NULL),
next(NULL),start(NULL) {}
command_node::~command_node()
{
delete head;
delete start;
delete next;
}
void command_node::add_node(command_node *parent, command_node *n)
{
LC_LOG_VERBOSE("parent[%p/%s] + n[%p/%s]",parent,parent->part.c_str(),n,n->part.c_str());
if (parent != NULL) {
if (parent->head == NULL) {
parent->head = parent->tail = n;
}
else {
parent->tail->next = n;
parent->tail = n;
}
}
}
command_node *command_node::add_node(command_node *parent, const std::string &part, command::filter_t mask_, bool hidden_)
{
if (parent != NULL) {
command_node *n = new (std::nothrow) command_node(part);
if (n != NULL) {
n->mask = mask_;
n->hidden = hidden_;
add_node(parent, n);
}
return n;
}
else {
return NULL;
}
}
void command_node::clear()
{
delete head;
delete start;
delete next;
mask = 0;
hidden = false;
cmd = NULL;
head = NULL;
tail = NULL;
next = NULL;
start = NULL;
}
command_node *command_node::add(const std::string &word, command::filter_t mask_, bool hidden_)
{
LC_LOG_VERBOSE("+word[%s] mask[0x%08x] hidden[%s]",word.c_str(),mask_,hidden_?"true":"false");
mask |= mask_; // always update root mask
if (head == NULL) {
// no need to search; just add whole word
LC_LOG_VERBOSE("add-new-root");
return add_node(this,word,mask_,hidden_);
}
else {
size_t ti = 0; // tree index (cumulative)
size_t wi = 0; // index of first character in partial word (wi <= ti)
size_t si = 0; // index into search word (0..length)
command_node *root = this;
command_node *prev = NULL;
command_node *n = head;
while (n != NULL && si < word.length()) {
LC_LOG_VERBOSE("root[%p] prev[%p] n[%p] ti[%zu] wi[%zu] si[%zu]",root,prev,n,ti,wi,si);
char c = word.at(si);
size_t ri = (ti - wi); // index relative to partial dictionary word
if (ri == 0) {
// check for match in first letter, else go to next command_node
if (n->part.at(ri) == c) {
++si;
++ti;
}
else if (n->next == NULL) {
return add_node(root,word.substr(si),mask_,hidden_);
}
else {
prev = n;
n = n->next;
}
}
else if (ri < n->part.length()) {
// check for match in current part
if (n->part.at(ri) == c) {
++si;
++ti;
}
else {
// mismatch = split + add new part
LC_LOG_VERBOSE("mismatch->split");
std::string part = n->part;
command_node *nn = new command_node;
nn->part.assign(part,0,ri);
nn->mask = n->mask | mask_;
nn->next = n->next;
n->part.assign(part.substr(ri));
n->next = NULL;
// split = move existing command_node down one level
add_node(nn,n);
if (prev == NULL) {
root->head = nn;
}
else {
prev->next = nn;
}
if (nn->next == NULL) {
root->tail = nn;
}
return add_node(nn,word.substr(si),mask_,hidden_);
}
}
else {
// reached end of current part; go down one level if possible
if (n->head == NULL) {
n->mask |= mask_;
return add_node(n,word.substr(si),mask_,hidden_);
}
else {
wi = ti;
root = n;
root->mask |= mask_;
prev = NULL;
n = n->head;
}
}
}
LC_LOG_VERBOSE("END1: root[%p] prev[%p] n[%p] ti[%zu] si[%zu] word.length[%zu]",root,prev,n,ti,si,word.length());
if (n == NULL)
n = root;
LC_LOG_VERBOSE("END2: n[%p] wi[%zu] part.length[%zu]",n,wi,n->part.length());
if (si < word.length()) {
// not found --> add rest of word
n->mask |= mask_;
return add_node(n,word.substr(si),mask_,hidden_);
}
else if (si < (wi + n->part.length())) {
// found, but only partially --> split + add new part
LC_LOG_VERBOSE("found(partially)->split");
size_t ri = (si - wi); // index relative to partial dictionary word
std::string part = n->part;
n->part.assign(part,0,ri);
command_node *head__ = n->head;
command_node *tail__ = n->tail;
// move command node content to new node
n->head = n->tail = NULL;
command_node *nn = add_node(n,part.substr(ri),n->mask,n->hidden);
nn->cmd = n->cmd;
nn->head = head__;
nn->tail = tail__;
nn->start = n->start;
// clean up current node
n->mask |= mask_;
n->cmd = NULL;
n->hidden = hidden_;
n->start = NULL;
}
else {
// duplicate
LC_LOG_VERBOSE("duplicate node");
n->mask |= mask_;
}
return n;
}
}
command_node *command_node::add_root(command::filter_t mask_, bool hidden_)
{
if (start == NULL) {
start = new (std::nothrow) command_node();
if (start != NULL) {
start->mask = mask_;
start->hidden = hidden_;
}
}
return start;
}
void command_node::associate(command *cmd_)
{
assert(cmd == NULL); // to catch duplicate commands
cmd = cmd_;
}
void command_node::dump(size_t level)
{
if (LC_LOG_CHECK_LEVEL(debug::DEBUG)) {
static std::string indent = " ";
LC_LOG_DEBUG("%s%s[%p/0x%08x/%s/%p]%s",
level>0?indent.substr(0,level*2).c_str():"",
part.empty()?"--ROOT--":part.c_str(),
this,mask,hidden?"HIDDEN":"VISIBLE",cmd,
start!=NULL?"==>":"");
++level;
if (start != NULL)
start->dump(level);
command_node *n = head;
while (n != NULL) {
n->dump(level);
n = n->next;
}
}
}
command_cursor::command_cursor(command_node *r, size_t r_idx) :
root(r),root_idx(r_idx),idx(0) {}
command_cursor::command_cursor(const command_cursor &n) :
root(n.current()),idx(0)
{
if (n.S.empty())
root_idx = n.root_idx + n.idx;
else
root_idx = n.idx;
}
bool command_cursor::command(command::filter_t mask, bool ignore_hidden) const
{
return valid() &&
(current()->mask & mask) != 0 &&
(!current()->hidden || ignore_hidden) &&
current()->cmd != NULL &&
(current()->cmd->mask & mask) != 0 &&
(!current()->cmd->hidden || ignore_hidden);
}
bool command_cursor::subword(command::filter_t mask, bool ignore_hidden) const
{
return valid() &&
(current()->mask & mask) != 0 &&
(!current()->hidden || ignore_hidden) &&
current()->start != NULL;
}
size_t command_cursor::current_length() const
{
if (S.empty()) {
if (root != NULL && root_idx < root->part.length())
return (root->part.length() - root_idx);
}
else {
command_node *n = S.top();
if (n != NULL)
return n->part.length();
}
return 0;
}
char command_cursor::current_char() const
{
if (S.empty()) {
if (root != NULL && root_idx < root->part.length())
return root->part.at(root_idx + idx);
}
else {
command_node *n = S.top();
if (n != NULL && idx < n->part.length())
return n->part.at(idx);
}
return 0;
}
void command_cursor::rewind()
{
command_node_stack_t empty;
std::swap(S,empty);
w.clear();
idx = 0;
}
std::string command_cursor::remainder() const
{
if (S.empty()) {
if (root != NULL && (root_idx + idx) < root->part.length())
return root->part.substr(root_idx + idx);
}
else {
command_node *n = S.top();
if (n != NULL && idx < n->part.length())
return n->part.substr(idx);
}
return "";
}
bool command_cursor::next()
{
// depth first search
command_node *n = current();
if (n == NULL)
return false;
/*
if (S.empty())
LC_LOG_VERBOSE("root[%p]@%zu; w[%s]",root,idx,w.c_str());
else
LC_LOG_VERBOSE("n[%p]@%zu; w[%s]",n,idx,w.c_str());
*/
std::string rstr = remainder();
if (!rstr.empty()) {
//LC_LOG_VERBOSE("w + [%s]",rstr.c_str());
w.append(rstr);
idx += rstr.length();
return true;
}
else if (n->head != NULL) {
//LC_LOG_VERBOSE("push[%p;next=%p]",n->head,n->head->next);
S.push(n->head);
idx = 0;
return true;
}
else {
while (!S.empty() && n != NULL && n->next == NULL) {
if (idx > 0 && idx <= w.length())
w.erase(w.length() - idx);
//LC_LOG_VERBOSE("pop[%p;next=%p]",S.top(),S.top()->next);
S.pop();
if (S.empty()) {
if (root != NULL && root_idx < root->part.length())
idx = root->part.length() - root_idx;
else
idx = 0;
}
else {
if ((n = S.top()) != NULL)
idx = n->part.length();
else
idx = 0;
}
}
if (idx > 0 && idx <= w.length())
w.erase(w.length() - idx);
idx = 0;
if (S.empty() || n == NULL) {
w.clear();
return false;
}
n = n->next;
//LC_LOG_VERBOSE("pop[%p;next=%p]",S.top(),S.top()->next);
S.pop();
if (n != NULL) {
//LC_LOG_VERBOSE("push[%p;next=%p]",n,n->next);
S.push(n);
return true;
}
}
return false;
}
bool command_cursor::next_root()
{
if (S.empty()) {
if (root != NULL && root->start != NULL && (root_idx + idx) >= root->part.length()) {
root = root->start;
root_idx = 0;
rewind();
return true;
}
}
else {
command_node *n = S.top();
if (n != NULL && n->start != NULL && idx >= n->part.length()) {
root = n->start;
root_idx = 0;
rewind();
return true;
}
}
return false;
}
bool command_cursor::find(const std::string &search, command::filter_t mask, bool ignore_hidden)
{
if (search.empty())
return false;
size_t si = 0; // index into search (0..length)
while (current() != NULL && si < search.length()) {
char c = search.at(si);
if (idx >= current_length()) {
if (current()->head != NULL && (current()->mask & mask) != 0 && (!current()->hidden || ignore_hidden)) {
S.push(current()->head);
idx = 0;
}
else {
return false;
}
}
else if (c == current_char() && (current()->mask & mask) != 0 && (!current()->hidden || ignore_hidden)) {
++si;
++idx;
w += c;
}
else if (idx == 0) {
if (S.empty()) {
return false;
}
command_node *n = S.top()->next;
if (n != NULL) {
S.pop();
S.push(n);
idx = 0;
}
else {
return false;
}
}
else {
return false;
}
}
return (current() != NULL && si >= search.length() && (current()->mask & mask) != 0 && (!current()->hidden || ignore_hidden));
}
command *command_set::add(const std::string &cmd_str, const char *name, command::filter_t mask_, bool hidden_)
{
return add(cmd_str,name,token::ID_NOT_SET,mask_,hidden_);
}
command *command_set::add(const std::string &cmd_str, token::id_t ID, command::filter_t mask_, bool hidden_)
{
return add(cmd_str,NULL,ID,mask_,hidden_);
}
command* command_set::add(const std::string &cmd_str, const char *name, token::id_t ID, command::filter_t mask_, bool hidden_)
{
if (name != NULL || ID != token::ID_NOT_SET) {
// break command string into tokens
std::unique_ptr<token> Tadd(libchars::lexer(cmd_str));
if (Tadd.get() == NULL)
return NULL;
// make sure none of the tokens are quoted strings nor empty strings
token *T = Tadd.get();
while (T != NULL) {
if (T->status & token::IS_QUOTED)
return NULL;
if (T->value.empty())
return NULL;
T = T->next;
}
// build sanitized version of command string
T = Tadd.get();
std::string cmd_str_sanitized(T->value);
T = T->next;
while (T != NULL) {
cmd_str_sanitized += ' ';
cmd_str_sanitized.append(T->value);
T = T->next;
}
// add command to internal list
dirty = true;
command *c_new = new command(cmd_str_sanitized, name, mask_, ID, hidden_);
LC_LOG_VERBOSE("set[%p] command[%s] = %p",this,cmd_str_sanitized.c_str(),c_new);
if (C_list != NULL)
c_new->next = C_list;
C_list = c_new;
return c_new;
}
return NULL;
}
command::command(const std::string &cmd_str_, const char *name_, filter_t mask_, token::id_t ID_, bool hidden_) :
ID(ID_),cmd_str(cmd_str_),mask(mask_),hidden(hidden_),next(NULL)
{
if (name_ != NULL)
name.assign(name_);
}
void command::set_help(const char *help_)
{
if (help_ != NULL)
help.assign(help_);
}
parameter* command::add(const parameter &par_)
{
par.push_back(par_);
return &par.back();
}
enum lex_inputs {
X_WS = 0, // input: whitespace
X_A0 = 1, // input: printable
X_Q = 2, // input: quote char
X_ESC = 3, // input: escape char: '\'
X_EOL = 4, // input: end of line
};
enum lex_states {
S_WS = 0, // state: whitespace or equals sign
S_TOK = 1, // state: token
S_STR = 2, // state: string
S_E1 = 3, // state: esc 0 (tok)
S_E2 = 4, // state: esc 0 (str)
S_EOL = 5, // end of line
};
enum lex_actions {
A_SOT = 0x10, // action: start of new token + add char to new token
A_PUSH = 0x20, // action: add char to existing token
A_EOT = 0x40, // action: end of existing token
A_EOTP = 0x80, // action: add char to existing token + end of token
};
static uint32_t lex_transitions[][X_EOL+1] =
{
// STATE: X_WS, X_A0, X_Q, X_ESC, X_EOL
/* S_WS */ { S_WS, S_TOK|A_SOT, S_STR|A_SOT, S_E1|A_SOT, S_EOL, },
/* S_TOK */ { S_WS|A_EOT, S_TOK|A_PUSH, S_STR|A_SOT|A_EOT, S_E1|A_PUSH, S_EOL|A_EOT, },
/* S_STR */ { S_STR|A_PUSH, S_STR|A_PUSH, S_WS|A_EOTP, S_E2|A_PUSH, S_EOL|A_EOT, },
/* S_E1 */ { S_TOK|A_PUSH, S_TOK|A_PUSH, S_TOK|A_PUSH, S_TOK|A_PUSH, S_EOL|A_EOT, },
/* S_E2 */ { S_STR|A_PUSH, S_STR|A_PUSH, S_STR|A_PUSH, S_STR|A_PUSH, S_EOL|A_EOT, },
/* S_EOL */ { S_EOL, S_EOL, S_EOL, S_EOL, S_EOL, },
};
token *lexer(const std::string &str)
{
token *t_tail = NULL;
token *t_head = NULL;
size_t offset = 0, offset_start = 0;
uint32_t state = S_WS;
do {
char c = (offset < str.length()) ? str.at(offset) : 0;
lex_inputs x = X_WS;
if (c == 0)
x = X_EOL;
else if (c == '\\')
x = X_ESC;
else if (c == '"')
x = X_Q;
else if (isspace(c) || c == '=')
x = X_WS;
else if (isprint(c))
x = X_A0;
uint32_t tr = lex_transitions[state][x];
if ((tr & (A_PUSH|A_EOTP)) != 0) {
// character part of existing token
}
if ((tr & (A_EOT|A_EOTP)) != 0) {
// end of token (if not empty)
if (offset > offset_start && offset_start < str.length()) {
token *T = new token;
T->status = token::IN_STRING;
if (state == S_STR || state == S_E2)
T->status |= token::IS_QUOTED;
T->offset = offset_start;
T->length = offset - offset_start;
if (tr & A_EOTP) ++T->length;
T->value = str.substr(T->offset,T->length);
if (t_head == NULL) {
t_head = t_tail = T;
}
else {
t_head->next = T;
t_head = T;
}
}
}
if ((tr & A_SOT) != 0) {
// new token
offset_start = offset;
}
state = tr & 0x0f;
} while (offset++ < str.length());
return t_tail;
}
commands::commands(terminal_driver &d) :
edit_object(libchars::MODE_COMMAND),
edit(d),mask(0),
remember(NULL),status(EMPTY),dirty(true),
t_cmd(NULL), t_par(NULL),cmd(NULL),
timeout(0) {}
commands::~commands()
{
delete t_cmd;
}
const std::string commands::value() const
{
std::string str;
if (length() > 0 && data() != NULL)
str.assign(data(),length());
return str;
}
void commands::lexer()
{
delete t_cmd;
t_par = NULL;
t_cmd = libchars::lexer(value());
}
size_t commands::render(size_t buf_idx, size_t limit, std::string &sequence)
{
parse();
size_t idx = buf_idx, displayed = 0, r_offset = 0, r_length = 0;
while (idx < length() && displayed < limit) {
command_char &C = characters[idx++];
if ((displayed + C.display_length) > limit)
break;
if (r_length == 0) {
r_offset = C.render_offset;
r_length = C.render_length;
}
else {
r_length += C.render_length;
}
displayed += C.display_length;
}
if (r_length > 0) {
// add token color if render has to start in the middle of a token
command_char &C = characters[buf_idx];
if (C.T != NULL && buf_idx > C.T->offset)
sequence.append(color_str(C.color));
sequence = rendered_str.substr(r_offset, r_length);
sequence.append(color_str(COLOR_NORMAL)); // just in case the rest of the terminal gets messed up
}
else {
sequence.clear();
}
return displayed;
}
token *commands::find_current_token(size_t &offset) const
{
LC_LOG_VERBOSE("find current token for idx=%zu",insert_idx);
token *T = t_cmd;
while (T != NULL && T->length > 0) {
LC_LOG_VERBOSE("search token [%p/%s@%zu+%zu]",T,T->value.c_str(),T->offset,T->length);
offset = (insert_idx - T->offset);
if (insert_idx == (T->offset + T->length)) {
// just beyond end of token; make sure next token does not start immediately after this one
if (T->next == NULL || !(T->next->status & token::IN_STRING))
return T;
if (T->next->offset > insert_idx)
return T;
}
else if (insert_idx >= T->offset && insert_idx < (T->offset + T->length)) {
// inside token
return T;
}
T = T->next;
}
return NULL;
}
void commands::parse()
{
//PROCESS: tokens(IN) -> match -> sort -> validate -> tokens(OUT)
if (dirty) {
lexer();
dirty = false;
LC_LOG_VERBOSE("t_cmd[%p], cmd[%p]", t_cmd, cmd);
// find longest match on command tokens
status = (t_cmd == NULL) ? EMPTY : NO_COMMAND;
cmd = NULL;
t_par = NULL;
token *T = t_cmd;
token *Tcmd = NULL;
command_cursor ci(&root);
while (T != NULL) {
if (T->status & token::IS_QUOTED || T->value.empty() || !ci.find(T->value,mask,true)) {
if (Tcmd == NULL)
status = NO_COMMAND;
break;
}
T->ttype = token::COMMAND;
status = PARTIAL_COMMAND;
if (!ci.end())
break;
if (ci.command(mask,true)) {
cmd = ci.current()->get();
Tcmd = T;
// continue search in case a longer match is found
}
if (!ci.next_root())
break;
T = T->next;
}
if (cmd != NULL) {
// sort tokens using command parameters
t_par = Tcmd->next;
status = sort();
validate();
}
// tokens -> characters
rendered_str.clear();
characters.clear();
characters.resize(length() + 1);
size_t idx = 0, nchars = 0;
bool command_tokens_seen = false;
T = t_cmd;
while (T != NULL) {
if (T->status & token::IN_STRING) {
//TODO: if only one possible command completion: show completion in grey
command_colors_e t_color = COLOR_NORMAL;
if (T->ttype == token::COMMAND) {
command_tokens_seen = true;
if (cmd != NULL)
t_color = COLOR_VALID_COMMAND;
else
t_color = COLOR_PARTIAL_COMMAND;
}
else if (T->status & token::INVALID) {
t_color = COLOR_INVALID_ARGUMENT;
}
else if (T->ttype == token::UNKNOWN) {
if (command_tokens_seen && cmd == NULL)
t_color = COLOR_INVALID_COMMAND;
else if (!(T->status & token::PARTIAL_ARG) && (status == MISSING_VALUE || status == TOO_FEW_ARGS))
t_color = COLOR_INVALID_ARGUMENT;
else
t_color = COLOR_UNKNOWN_TOKEN;
}
else if (T->status & token::VALIDATED) {
if (T->status & token::IS_QUOTED)
t_color = COLOR_QUOTED_STRING;
else
t_color = COLOR_VALID_ARGUMENT;
}
else if (T->status & token::PARTIAL_ARG) {
t_color = COLOR_PARTIAL_ARGUMENT;
}
else {
t_color = COLOR_INVALID_ARGUMENT;
}
LC_LOG_VERBOSE("token:offset[%zu];length[%zu];str[%s]",T->offset,T->length,T->value.c_str());
// deal with whitespace before token
while (idx < T->offset) {
command_char &C = characters[idx++];
C.T = T;
C.color = COLOR_NORMAL;
C.display_offset = nchars;
C.display_length = 1;
C.cursor_pos = nchars++;
C.render_offset = rendered_str.length();
C.render_length = 1;
rendered_str += ' ';
}
// first character
{
command_char &C = characters[idx];
C.T = T;
C.color = t_color;
C.display_offset = nchars;
C.display_length = 1;
C.cursor_pos = nchars++;
C.render_offset = rendered_str.length();
if (T->length == 1) {
C.render_length = color_length(t_color) + color_length(COLOR_NORMAL) + 1;
rendered_str.append(color_str(t_color));
rendered_str += at(idx++);
rendered_str.append(color_str(COLOR_NORMAL));
}
else {
C.render_length = color_length(t_color) + 1;
rendered_str.append(color_str(t_color));
rendered_str += at(idx++);
}
}
// middle characters
while (idx < (T->offset + T->length - 1)) {
command_char &C = characters[idx];
C.T = T;
C.color = t_color;
C.display_offset = nchars;
C.display_length = 1;
C.cursor_pos = nchars++;
C.render_offset = rendered_str.length();
C.render_length = 1;
rendered_str += at(idx++);
}
// last character
if (T->length > 1) {
command_char &C = characters[idx];
C.T = T;
C.color = t_color;
C.display_offset = nchars;
C.display_length = 1;
C.cursor_pos = nchars++;
C.render_offset = rendered_str.length();
C.render_length = color_length(COLOR_NORMAL) + 1;
rendered_str += at(idx++);
rendered_str.append(color_str(COLOR_NORMAL));
}
}
T = T->next;
}
if (idx < length()) {
// deal with whitespace at the end
while (idx < length()) {
command_char &C = characters[idx++];
C.T = NULL;
C.color = COLOR_NORMAL;
C.display_offset = nchars;
C.display_length = 1;
C.cursor_pos = nchars++;
C.render_offset = rendered_str.length();
C.render_length = 1;
rendered_str += ' ';
}
}
// add dummy character at the end (after whitespace)
{
command_char &C = characters[idx];
C.T = NULL;
C.color = COLOR_NORMAL;
C.display_offset = nchars;
C.display_length = 0;
C.cursor_pos = nchars;
C.render_offset = rendered_str.length();
C.render_length = 0;
}
LC_LOG_VERBOSE("str[%s]",rendered_str.c_str());
}
}
void commands::auto_complete()
{
LC_LOG_VERBOSE("complete@%zu/%zu",insert_idx,length());
// only allowed at end of line + on command tokens (no quotes)
while (insert_idx >= length()) {
// sanity check on position in line + type of token
size_t t_offset = 0;
token *Tcur = find_current_token(t_offset);
if (Tcur != NULL) {
LC_LOG_VERBOSE("current token [%p/%s@%zu+%zu] @ %zu",Tcur,Tcur->value.c_str(),Tcur->offset,Tcur->length,t_offset);
if (t_offset < Tcur->length || (Tcur->status & token::IS_QUOTED))
return;
}
else {
LC_LOG_VERBOSE("** no current token **");
}
std::string available_str;
token *T = t_cmd;
while (T != NULL && T->length > 0) {
if (T == Tcur) {
if (t_offset < Tcur->length) {
available_str.append(T->value, 0, t_offset);
}
else {
available_str.append(T->value);
}
break;
}
else {
available_str.append(T->value);
available_str += ' ';
}
T = T->next;
}
// find current position in command dictionary
command_cursor ci(&root);
T = t_cmd;
bool available = true;
while (T != NULL && ci.valid() && available) {
LC_LOG_VERBOSE("search token [%p/%s@%zu+%zu]",T,T->value.c_str(),T->offset,T->length);
if (T == Tcur) {
if (t_offset > 0) {
std::string v_search = T->value.substr(0,t_offset);
LC_LOG_VERBOSE("offset[%zu]; search for [%s]",t_offset,v_search.c_str());
available = ci.find(v_search,mask);
}
else {
available = false;
}
T = NULL;
}
else {
available = ci.find(T->value,mask);
available = available && ci.next_root();
T = T->next;
}
}
LC_LOG_DEBUG("cursor: %p @ %zu: [%s]", ci.current(), ci.current_idx(), ci.word().c_str());
if (ci.valid())
LC_LOG_VERBOSE("dictionary option: [%s]",ci.current()->part.c_str());
if (!available) {
LC_LOG_DEBUG("** no options available **");
return;
}
// collect combinations (full words + words with sub-words + words with valid commands)
typedef std::list<std::string> string_list_t;