-
Notifications
You must be signed in to change notification settings - Fork 1
/
computil.c
4973 lines (4361 loc) · 120 KB
/
computil.c
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
/*
* computil.c - completion utilities
*
* This file is part of zsh, the Z shell.
*
* Copyright (c) 1999 Sven Wischnowsky
* All rights reserved.
*
* Permission is hereby granted, without written agreement and without
* license or royalty fees, to use, copy, modify, and distribute this
* software and to distribute modified versions of this software for any
* purpose, provided that the above copyright notice and the following
* two paragraphs appear in all copies of this software.
*
* In no event shall Sven Wischnowsky or the Zsh Development Group be liable
* to any party for direct, indirect, special, incidental, or consequential
* damages arising out of the use of this software and its documentation,
* even if Sven Wischnowsky and the Zsh Development Group have been advised of
* the possibility of such damage.
*
* Sven Wischnowsky and the Zsh Development Group specifically disclaim any
* warranties, including, but not limited to, the implied warranties of
* merchantability and fitness for a particular purpose. The software
* provided hereunder is on an "as is" basis, and Sven Wischnowsky and the
* Zsh Development Group have no obligation to provide maintenance,
* support, updates, enhancements, or modifications.
*
*/
#include "computil.mdh"
#include "computil.pro"
/* Help for `_describe'. */
typedef struct cdset *Cdset;
typedef struct cdstr *Cdstr;
typedef struct cdrun *Cdrun;
struct cdstate {
int showd; /* != 0 if descriptions should be shown */
char *sep; /* the separator string */
int slen; /* its metafied length */
int swidth; /* its screen width */
int maxmlen; /* maximum length to allow for the matches */
Cdset sets; /* the sets of matches */
int pre; /* longest prefix length (before description) */
int premaxw; /* ... and its screen width */
int suf; /* longest suffix (description) */
int maxg; /* size of largest group */
int maxglen; /* columns for matches of largest group */
int groups; /* number of groups */
int descs; /* number of non-group matches with desc */
int gprew; /* prefix screen width for group display */
Cdrun runs; /* runs to report to shell code */
};
struct cdstr {
Cdstr next; /* the next one in this set */
char *str; /* the string to display */
char *desc; /* the description or NULL */
char *match; /* the match to add */
char *sortstr; /* unmetafied string used to sort matches */
int len; /* length of str or match */
int width; /* ... and its screen width */
Cdstr other; /* next string with the same description */
int kind; /* 0: not in a group, 1: the first, 2: other */
Cdset set; /* the set this string is in */
Cdstr run; /* next in this run */
};
struct cdrun {
Cdrun next; /* ... */
int type; /* see CRT_* below */
Cdstr strs; /* strings in this run */
int count; /* number of strings in this run */
};
#define CRT_SIMPLE 0
#define CRT_DESC 1
#define CRT_SPEC 2
#define CRT_DUMMY 3
#define CRT_EXPL 4
struct cdset {
Cdset next; /* guess what */
char **opts; /* the compadd-options */
Cdstr strs; /* the strings/matches */
int count; /* number of matches in this set */
int desc; /* number of matches with description */
};
static struct cdstate cd_state;
static int cd_parsed = 0;
static void
freecdsets(Cdset p)
{
Cdset n;
Cdstr s, sn;
Cdrun r, rn;
for (; p; p = n) {
n = p->next;
if (p->opts)
freearray(p->opts);
for (s = p->strs; s; s = sn) {
sn = s->next;
zfree(s->sortstr, strlen(s->str) + 1);
zsfree(s->str);
zsfree(s->desc);
if (s->match != s->str)
zsfree(s->match);
zfree(s, sizeof(*s));
}
for (r = cd_state.runs; r; r = rn) {
rn = r->next;
zfree(r, sizeof(*r));
}
zfree(p, sizeof(*p));
}
}
/* Find matches with same descriptions and group them. */
static void
cd_group(int maxg)
{
Cdset set1, set2;
Cdstr str1, str2, *strp;
int num, width;
cd_state.groups = cd_state.descs = cd_state.maxglen = 0;
cd_state.maxg = 0;
for (set1 = cd_state.sets; set1; set1 = set1->next)
for (str1 = set1->strs; str1; str1 = str1->next) {
str1->kind = 0;
str1->other = NULL;
}
for (set1 = cd_state.sets; set1; set1 = set1->next) {
for (str1 = set1->strs; str1; str1 = str1->next) {
if (!str1->desc || str1->kind != 0)
continue;
num = 1;
width = str1->width + cd_state.swidth;
if (width > cd_state.maxglen)
cd_state.maxglen = width;
strp = &(str1->other);
for (set2 = set1; set2; set2 = set2->next) {
for (str2 = (set2 == set1 ? str1->next : set2->strs);
str2; str2 = str2->next)
if (str2->desc && !strcmp(str1->desc, str2->desc)) {
width += CM_SPACE + str2->width;
if (width > cd_state.maxmlen || num == maxg)
break;
if (width > cd_state.maxglen)
cd_state.maxglen = width;
str1->kind = 1;
str2->kind = 2;
num++;
*strp = str2;
strp = &(str2->other);
}
if (str2)
break;
}
*strp = NULL;
if (num > 1)
cd_state.groups++;
else
cd_state.descs++;
if (num > cd_state.maxg)
cd_state.maxg = num;
}
}
}
/* Calculate longest prefix and suffix and count the strings with
* descriptions. */
static void
cd_calc()
{
Cdset set;
Cdstr str;
int l;
cd_state.pre = cd_state.suf = 0;
for (set = cd_state.sets; set; set = set->next) {
set->count = set->desc = 0;
for (str = set->strs; str; str = str->next) {
set->count++;
if ((l = strlen(str->str)) > cd_state.pre)
cd_state.pre = l;
if ((l = MB_METASTRWIDTH(str->str)) > cd_state.premaxw)
cd_state.premaxw = l;
if (str->desc) {
set->desc++;
if ((l = strlen(str->desc)) > cd_state.suf)
cd_state.suf = l;
}
}
}
}
static int
cd_sort(const void *a, const void *b)
{
return zstrcmp((*((Cdstr *) a))->sortstr, (*((Cdstr *) b))->sortstr, 0);
}
static int
cd_prep()
{
Cdrun run, *runp;
Cdset set;
Cdstr str, *strp;
runp = &(cd_state.runs);
if (cd_state.groups) {
int preplines = cd_state.groups + cd_state.descs;
VARARR(Cdstr, grps, preplines);
VARARR(int, wids, cd_state.maxg);
Cdstr gs, gp, gn, *gpp;
int i, j, d;
Cdrun expl;
Cdstr *strp2;
memset(wids, 0, cd_state.maxg * sizeof(int));
strp = grps;
for (set = cd_state.sets; set; set = set->next)
for (str = set->strs; str; str = str->next) {
if (str->kind != 1) {
if (!str->kind && str->desc) {
if (str->width > wids[0])
wids[0] = str->width;
str->other = NULL;
*strp++ = str;
}
continue;
}
gs = str;
gs->kind = 2;
gp = str->other;
gs->other = NULL;
for (; gp; gp = gn) {
gn = gp->other;
gp->other = NULL;
for (gpp = &gs; *gpp && (*gpp)->width > gp->width;
gpp = &((*gpp)->other));
gp->other = *gpp;
*gpp = gp;
}
for (gp = gs, i = 0; gp; gp = gp->other, i++)
if (gp->width > wids[i])
wids[i] = gp->width;
*strp++ = gs;
}
cd_state.gprew = 0;
for (i = 0; i < cd_state.maxg; i++) {
cd_state.gprew += wids[i] + CM_SPACE;
}
if (cd_state.gprew > cd_state.maxmlen && cd_state.maxglen > 1)
return 1;
for (i = 0; i < preplines; i++) {
Cdstr s = grps[i];
int dummy;
s->sortstr = ztrdup(s->str);
unmetafy(s->sortstr, &dummy);
}
qsort(grps, preplines, sizeof(Cdstr), cd_sort);
for (i = preplines, strp = grps; i > 1; i--, strp++) {
strp2 = strp + 1;
if (!strcmp((*strp)->desc, (*strp2)->desc))
continue;
for (j = i - 2, strp2++; j > 0; j--, strp2++)
if (!strcmp((*strp)->desc, (*strp2)->desc)) {
Cdstr tmp = *strp2;
memmove(strp + 2, strp + 1,
(strp2 - strp - 1) * sizeof(Cdstr));
*++strp = tmp;
i--;
}
}
expl = (Cdrun) zalloc(sizeof(*run));
expl->type = CRT_EXPL;
expl->strs = grps[0];
expl->count = preplines;
for (i = preplines, strp = grps, strp2 = NULL; i; i--, strp++) {
str = *strp;
*strp = str->other;
if (strp2)
*strp2 = str;
strp2 = &(str->run);
*runp = run = (Cdrun) zalloc(sizeof(*run));
runp = &(run->next);
run->type = CRT_SPEC;
run->strs = str;
run->count = 1;
}
*strp2 = NULL;
for (i = cd_state.maxg - 1; i; i--) {
for (d = 0, j = preplines, strp = grps; j; j--, strp++) {
if ((str = *strp)) {
if (d) {
*runp = run = (Cdrun) zalloc(sizeof(*run));
runp = &(run->next);
run->type = CRT_DUMMY;
run->strs = expl->strs;
run->count = d;
d = 0;
}
*runp = run = (Cdrun) zalloc(sizeof(*run));
runp = &(run->next);
run->type = CRT_SPEC;
run->strs = str;
run->strs->run = NULL;
run->count = 1;
*strp = str->other;
} else
d++;
}
if (d) {
*runp = run = (Cdrun) zalloc(sizeof(*run));
runp = &(run->next);
run->type = CRT_DUMMY;
run->strs = expl->strs;
run->count = d;
}
}
*runp = expl;
runp = &(expl->next);
for (set = cd_state.sets; set; set = set->next) {
for (i = 0, gs = NULL, gpp = &gs, str = set->strs;
str; str = str->next) {
if (str->kind || str->desc)
continue;
i++;
*gpp = str;
gpp = &(str->run);
}
*gpp = NULL;
if (i) {
*runp = run = (Cdrun) zalloc(sizeof(*run));
runp = &(run->next);
run->type = CRT_SIMPLE;
run->strs = gs;
run->count = i;
}
}
} else if (cd_state.showd) {
for (set = cd_state.sets; set; set = set->next) {
if (set->desc) {
*runp = run = (Cdrun) zalloc(sizeof(*run));
runp = &(run->next);
run->type = CRT_DESC;
strp = &(run->strs);
for (str = set->strs; str; str = str->next)
if (str->desc) {
*strp = str;
strp = &(str->run);
}
*strp = NULL;
run->count = set->desc;
}
if (set->desc != set->count) {
*runp = run = (Cdrun) zalloc(sizeof(*run));
runp = &(run->next);
run->type = CRT_SIMPLE;
strp = &(run->strs);
for (str = set->strs; str; str = str->next)
if (!str->desc) {
*strp = str;
strp = &(str->run);
}
*strp = NULL;
run->count = set->count - set->desc;
}
}
} else {
for (set = cd_state.sets; set; set = set->next)
if (set->count) {
*runp = run = (Cdrun) zalloc(sizeof(*run));
runp = &(run->next);
run->type = CRT_SIMPLE;
run->strs = set->strs;
for (str = set->strs; str; str = str->next)
str->run = str->next;
run->count = set->count;
}
}
*runp = NULL;
return 0;
}
/* Duplicate and concatenate two arrays. Return the result. */
static char **
cd_arrcat(char **a, char **b)
{
if (!b)
return zarrdup(a);
else {
char **r = (char **) zalloc((arrlen(a) + arrlen(b) + 1) *
sizeof(char *));
char **p = r;
for (; *a; a++)
*p++ = ztrdup(*a);
for (; *b; b++)
*p++ = ztrdup(*b);
*p = NULL;
return r;
}
}
/* Initialisation. Store and calculate the string and matches and so on. */
static int
cd_init(char *nam, char *hide, char *mlen, char *sep,
char **opts, char **args, int disp)
{
Cdset *setp, set;
Cdstr *strp, str;
char **ap, *tmp;
int grp = 0, itmp;
if (cd_parsed) {
zsfree(cd_state.sep);
freecdsets(cd_state.sets);
cd_parsed = 0;
}
setp = &(cd_state.sets);
cd_state.sep = ztrdup(sep);
cd_state.slen = strlen(sep);
cd_state.swidth = MB_METASTRWIDTH(sep);
cd_state.sets = NULL;
cd_state.showd = disp;
cd_state.maxg = cd_state.groups = cd_state.descs = 0;
cd_state.maxmlen = atoi(mlen);
itmp = zterm_columns - cd_state.swidth - 4;
if (cd_state.maxmlen > itmp)
cd_state.maxmlen = itmp;
if (cd_state.maxmlen < 4)
cd_state.maxmlen = 4;
if (*args && !strcmp(*args, "-g")) {
args++;
grp = 1;
}
while (*args) {
*setp = set = (Cdset) zshcalloc(sizeof(*set));
setp = &(set->next);
*setp = NULL;
set->opts = NULL;
set->strs = NULL;
if (!(ap = get_user_var(*args))) {
zwarnnam(nam, "invalid argument: %s", *args);
zsfree(cd_state.sep);
freecdsets(cd_state.sets);
return 1;
}
for (str = NULL, strp = &(set->strs); *ap; ap++) {
*strp = str = (Cdstr) zalloc(sizeof(*str));
strp = &(str->next);
str->kind = 0;
str->other = NULL;
str->set = set;
for (tmp = *ap; *tmp && *tmp != ':'; tmp++)
if (*tmp == '\\' && tmp[1])
tmp++;
if (*tmp)
str->desc = ztrdup(rembslash(tmp + 1));
else
str->desc = NULL;
*tmp = '\0';
str->str = str->match = ztrdup(rembslash(*ap));
str->len = strlen(str->str);
str->width = MB_METASTRWIDTH(str->str);
str->sortstr = NULL;
}
if (str)
str->next = NULL;
if (*++args && **args != '-') {
if (!(ap = get_user_var(*args))) {
zwarnnam(nam, "invalid argument: %s", *args);
zsfree(cd_state.sep);
freecdsets(cd_state.sets);
return 1;
}
for (str = set->strs; str && *ap; str = str->next, ap++)
str->match = ztrdup(*ap);
args++;
}
if (hide && *hide) {
for (str = set->strs; str; str = str->next) {
if (str->str == str->match)
str->str = ztrdup(str->str);
if (hide[1] && str->str[0] == '-' && str->str[1] == '-')
strcpy(str->str, str->str + 2);
else if (str->str[0] == '-' || str->str[0] == '+')
strcpy(str->str, str->str + 1);
}
}
for (ap = args; *args &&
(args[0][0] != '-' || args[0][1] != '-' || args[0][2]);
args++);
tmp = *args;
*args = NULL;
set->opts = cd_arrcat(ap, opts);
if ((*args = tmp))
args++;
}
if (disp && grp) {
int mg = zterm_columns;
do {
cd_group(mg);
mg = cd_state.maxg - 1;
cd_calc();
} while (cd_prep());
} else {
cd_calc();
cd_prep();
}
cd_parsed = 1;
return 0;
}
/* Copy an array with one element in reserve (at the beginning). */
static char **
cd_arrdup(char **a)
{
char **r = (char **) zalloc((arrlen(a) + 2) * sizeof(char *));
char **p = r + 1;
while (*a)
*p++ = ztrdup(*a++);
*p = NULL;
return r;
}
/* Get the next set. */
static int
cd_get(char **params)
{
Cdrun run;
if ((run = cd_state.runs)) {
Cdstr str;
char **mats, **mp, **dpys, **dp, **opts, *csl = "";
cd_state.runs = run->next;
switch (run->type) {
case CRT_SIMPLE:
mats = mp = (char **) zalloc((run->count + 1) * sizeof(char *));
dpys = dp = (char **) zalloc((run->count + 1) * sizeof(char *));
for (str = run->strs; str; str = str->run) {
*mp++ = ztrdup(str->match);
*dp++ = ztrdup(str->str ? str->str : str->match);
}
*mp = *dp = NULL;
opts = zarrdup(run->strs->set->opts);
if (cd_state.groups) {
/* We are building a columnised list with dummy matches
* but there are also matches without descriptions.
* Those end up in a different group, so make sure that
* group doesn't have an explanation. */
for (mp = dp = opts; *mp; mp++) {
if (dp[0][0] == '-' && dp[0][1] == 'X') {
if (!dp[0][2] && dp[1])
mp++;
} else
*dp++ = *mp;
}
*dp = NULL;
}
break;
case CRT_DESC:
{
/*
* The buffer size:
* max prefix length (cd_state.pre) +
* max padding (cd_state.premaxw generously :) +
* separator length (cd_state.slen) +
* inter matches gap (CM_SPACE) +
* max description length (cd_state.suf) +
* trailing \0
*/
VARARR(char, buf,
cd_state.pre + cd_state.suf +
cd_state.premaxw + cd_state.slen + 3);
mats = mp = (char **) zalloc((run->count + 1) * sizeof(char *));
dpys = dp = (char **) zalloc((run->count + 1) * sizeof(char *));
for (str = run->strs; str; str = str->run) {
char *p = buf, *pp, *d;
int l, remw, w;
*mp++ = ztrdup(str->match);
strcpy(p, str->str);
p += str->len;
memset(p, ' ', (l = (cd_state.premaxw - str->width + CM_SPACE)));
p += l;
strcpy(p, cd_state.sep);
p += cd_state.slen;
/*
* copy a character at once until no more screen width
* is available. Leave 1 character at the end of screen
* as safety margin
*/
remw = zterm_columns - cd_state.premaxw -
cd_state.swidth - 3;
d = str->desc;
w = MB_METASTRWIDTH(d);
if (w <= remw)
strcpy(p, d);
else {
pp = p;
while (remw > 0 && *d) {
l = MB_METACHARLEN(d);
memcpy(pp, d, l);
pp[l] = '\0';
w = MB_METASTRWIDTH(pp);
if (w > remw) {
*pp = '\0';
break;
}
pp += l;
d += l;
remw -= w;
}
}
*dp++ = ztrdup(buf);
}
*mp = *dp = NULL;
opts = cd_arrdup(run->strs->set->opts);
opts[0] = ztrdup("-l");
break;
}
case CRT_SPEC:
mats = (char **) zalloc(2 * sizeof(char *));
dpys = (char **) zalloc(2 * sizeof(char *));
mats[0] = ztrdup(run->strs->match);
dpys[0] = ztrdup(run->strs->str);
mats[1] = dpys[1] = NULL;
opts = cd_arrdup(run->strs->set->opts);
for (dp = opts + 1; *dp; dp++)
if (dp[0][0] == '-' && dp[0][1] == 'J')
break;
if (*dp) {
char *s = tricat("-2V", "", dp[0] + 2);
zsfree(*dp);
*dp = s;
memmove(opts, opts + 1,
(arrlen(opts + 1) + 1) * sizeof(char *));
} else
opts[0] = ztrdup("-2V-default-");
csl = "packed";
break;
case CRT_DUMMY:
{
char buf[20];
sprintf(buf, "-E%d", run->count);
mats = (char **) zalloc(sizeof(char *));
dpys = (char **) zalloc(sizeof(char *));
mats[0] = dpys[0] = NULL;
opts = cd_arrdup(run->strs->set->opts);
opts[0] = ztrdup(buf);
csl = "packed";
}
break;
default: /* This silences the "might be used uninitialized" warnings */
case CRT_EXPL:
{
/* add columns as safety margin */
VARARR(char, dbuf, cd_state.suf + cd_state.slen +
zterm_columns);
char buf[20], *p, *pp, *d;
int i = run->count, remw, w, l;
sprintf(buf, "-E%d", i);
mats = (char **) zalloc(sizeof(char *));
dpys = (char **) zalloc((i + 1) * sizeof(char *));
for (dp = dpys, str = run->strs; str; str = str->run) {
if (str->run && !strcmp(str->desc, str->run->desc)) {
*dp++ = ztrdup("");
continue;
}
strcpy(dbuf, cd_state.sep);
remw = zterm_columns - cd_state.gprew -
cd_state.swidth - CM_SPACE;
p = pp = dbuf + cd_state.slen;
d = str->desc;
w = MB_METASTRWIDTH(d);
if (w <= remw) {
strcpy(p, d);
remw -= w;
pp += strlen(d);
} else
while (remw > 0 && *d) {
l = MB_METACHARLEN(d);
memcpy(pp, d, l);
pp[l] = '\0';
w = MB_METASTRWIDTH(pp);
if (w > remw) {
*pp = '\0';
break;
}
pp += l;
d += l;
remw -= w;
}
while (remw-- > 0)
*pp++ = ' ';
*pp = '\0';
*dp++ = ztrdup(dbuf);
}
mats[0] = *dp = NULL;
opts = cd_arrdup(run->strs->set->opts);
opts[0] = ztrdup(buf);
csl = "packed";
}
break;
}
setsparam(params[0], ztrdup(csl));
setaparam(params[1], opts);
setaparam(params[2], mats);
setaparam(params[3], dpys);
zfree(run, sizeof(*run));
return 0;
}
return 1;
}
/**/
static int
bin_compdescribe(char *nam, char **args, UNUSED(Options ops), UNUSED(int func))
{
int n = arrlen(args);
if (incompfunc != 1) {
zwarnnam(nam, "can only be called from completion function");
return 1;
}
if (!args[0][0] || !args[0][1] || args[0][2]) {
zwarnnam(nam, "invalid argument: %s", args[0]);
return 1;
}
switch (args[0][1]) {
case 'i':
if (n < 3) {
zwarnnam(nam, "not enough arguments");
return 1;
}
return cd_init(nam, args[1], args[2], "", NULL, args + 3, 0);
case 'I':
if (n < 6) {
zwarnnam(nam, "not enough arguments");
return 1;
} else {
char **opts;
if (!(opts = getaparam(args[4]))) {
zwarnnam(nam, "unknown parameter: %s", args[4]);
return 1;
}
return cd_init(nam, args[1], args[2], args[3], opts, args + 5, 1);
}
case 'g':
if (cd_parsed) {
if (n != 5) {
zwarnnam(nam, (n < 5 ? "not enough arguments" :
"too many arguments"));
return 1;
}
return cd_get(args + 1);
} else {
zwarnnam(nam, "no parsed state");
return 1;
}
}
zwarnnam(nam, "invalid option: %s", args[0]);
return 1;
}
/* Help for `_arguments'. */
typedef struct cadef *Cadef;
typedef struct caopt *Caopt;
typedef struct caarg *Caarg;
/* Cache for a set of _arguments-definitions. */
struct cadef {
Cadef next; /* next in cache */
Cadef snext; /* next set */
Caopt opts; /* the options */
int nopts, ndopts, nodopts; /* number of options/direct/optional direct */
Caarg args; /* the normal arguments */
Caarg rest; /* the rest-argument */
char **defs; /* the original strings */
int ndefs; /* number of ... */
int lastt; /* last time this was used */
Caopt *single; /* array of single-letter options */
char *match; /* -M spec to use */
int argsactive; /* if arguments are still allowed */
/* used while parsing a command line */
char *set; /* set name prefix (<name>-), shared */
char *sname; /* set name */
int flags; /* see CDF_* below */
char *nonarg; /* pattern for non-args (-A argument) */
};
#define CDF_SEP 1
/* Description for an option. */
struct caopt {
Caopt next;
char *name; /* option name */
char *descr; /* the description */
char **xor; /* if this, then not ... */
int type; /* type, CAO_* */
Caarg args; /* option arguments */
int active; /* still allowed on command line */
int num; /* it's the num'th option */
char *set; /* set name, shared */
int not; /* don't complete this option (`!...') */
};
#define CAO_NEXT 1
#define CAO_DIRECT 2
#define CAO_ODIRECT 3
#define CAO_EQUAL 4
#define CAO_OEQUAL 5
/* Description for an argument */
struct caarg {
Caarg next;
char *descr; /* description */
char **xor; /* if this, then not ... */
char *action; /* what to do for it */
int type; /* CAA_* below */
char *end; /* end-pattern for ::<pat>:... */
char *opt; /* option name if for an option */
int num; /* it's the num'th argument */
int min; /* it's also this argument, using opt. args */
int direct; /* number was given directly */
int active; /* still allowed on command line */
char *set; /* set name, shared */
};
#define CAA_NORMAL 1
#define CAA_OPT 2
#define CAA_REST 3
#define CAA_RARGS 4
#define CAA_RREST 5
/* The cache of parsed descriptons. */
#define MAX_CACACHE 8
static Cadef cadef_cache[MAX_CACACHE];
/* Compare two arrays of strings for equality. */
static int
arrcmp(char **a, char **b)
{
if (!a && !b)
return 1;
else if (!a || !b)
return 0;
else {
while (*a && *b)
if (strcmp(*a++, *b++))
return 0;
return (!*a && !*b);
}
}
/* Memory stuff. Obviously. */
static void
freecaargs(Caarg a)
{
Caarg n;
for (; a; a = n) {
n = a->next;
zsfree(a->descr);
if (a->xor)
freearray(a->xor);
zsfree(a->action);
zsfree(a->end);
zsfree(a->opt);
zfree(a, sizeof(*a));
}
}
static void
freecadef(Cadef d)
{
Cadef s;
Caopt p, n;
while (d) {
s = d->snext;
zsfree(d->match);
zsfree(d->set);
zsfree(d->sname);
if (d->defs)
freearray(d->defs);
for (p = d->opts; p; p = n) {
n = p->next;
zsfree(p->name);
zsfree(p->descr);
if (p->xor)
freearray(p->xor);
freecaargs(p->args);
zfree(p, sizeof(*p));
}
freecaargs(d->args);
freecaargs(d->rest);
zsfree(d->nonarg);
if (d->single)
zfree(d->single, 256 * sizeof(Caopt));
zfree(d, sizeof(*d));
d = s;
}
}