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
|
/*
* Copyright 2005-2022 Gentoo Foundation
* Distributed under the terms of the GNU General Public License v2
*
* Copyright 2006 Thomas A. Cort - <tcort@gentoo.org>
* Copyright 2019- Fabian Groffen - <grobian@gentoo.org>
*/
#include "main.h"
#include "applets.h"
#include <stdio.h>
#include <string.h>
#include <strings.h>
#include <xalloc.h>
#include <fcntl.h>
#include <sys/types.h>
#include <sys/stat.h>
#include "atom.h"
#include "rmspace.h"
#include "scandirat.h"
#include "set.h"
#include "tree.h"
#include "xasprintf.h"
/********************************************************************/
/* Required portage-utils stuff */
/********************************************************************/
#define QKEYWORD_FLAGS "p:c:m:AidtsanSTF:" COMMON_FLAGS
static struct option const qkeyword_long_opts[] = {
{"matchpkg", a_argument, NULL, 'p'},
{"matchcat", a_argument, NULL, 'c'},
{"matchmaint", a_argument, NULL, 'm'},
{"showarch", no_argument, NULL, 'A'},
{"imlate", no_argument, NULL, 'i'},
{"dropped", no_argument, NULL, 'd'},
{"needsstable", no_argument, NULL, 't'},
{"stats", no_argument, NULL, 's'},
{"all", no_argument, NULL, 'a'},
{"not", no_argument, NULL, 'n'},
{"stable", no_argument, NULL, 'S'},
{"testing", no_argument, NULL, 'T'},
{"format", a_argument, NULL, 'F'},
COMMON_LONG_OPTS
};
static const char * const qkeyword_opts_help[] = {
"match pkgname",
"match catname",
"match maintainer email from metadata.xml (slow)",
"show selected arch from profile configuration",
"list packages that can be marked stable for <arch>",
"list packages that have dropped keywords for <arch>",
"list packages that have ~arch versions, but no stable versions for <arch>",
"display statistics about the portage tree",
"list packages that have at least one version keyworded for <arch>",
"list packages that aren't keyworded for <arch>",
"list latest stable version per package for <arch>",
"list latest testing version per package for <arch>",
"Print latest atom using given format string",
COMMON_OPTS_HELP
};
#define qkeyword_usage(ret) usage(ret, QKEYWORD_FLAGS, qkeyword_long_opts, qkeyword_opts_help, NULL, lookup_applet_idx("qkeyword"))
typedef struct {
depend_atom *qatom;
depend_atom *lastatom;
char *qmaint;
int *keywordsbuf;
size_t keywordsbuflen;
const char *arch;
tree_pkg_cb *runfunc;
const char *fmt;
} qkeyword_data;
static set *archs = NULL;
static char **archlist = NULL;
static size_t archlist_count;
static size_t arch_longest_len;
static const char status[3] = {'-', '~', '+'};
static int qkeyword_test_arch = 0;
static set *pmasks = NULL;
enum { none = 0, testing, stable, minus };
/*
* int decode_status(char c);
*
* Decode keyword status
*
* IN:
* char c - status to check
* OUT:
* int - one of the following enum { none = 0, testing, stable, minus };
*/
static int
decode_status(char c)
{
switch (c) {
case '-': return minus;
case '~': return testing;
default: return stable;
}
}
/*
* Decode the architecture string
*
* IN:
* const char *arch - name of an arch (alpha, amd64, ...)
* OUT:
* int - position in keywords, or -1 if not found
*/
static int
decode_arch(const char *arch)
{
char **q;
int a;
const char *p;
p = arch;
if (*p == '~' || *p == '-')
p++;
for (q = archlist, a = 0; *q != NULL; q++, a++) {
if (strcmp(*q, p) == 0)
return a;
}
return -1;
}
/*
* Prints the keywords to stdout
*
* IN:
* char *category - current category of the current package
* int *keywords - an array of keywords that coincides with archlist
*/
static void
print_keywords(const char *category, const char *ebuild, int *keywords)
{
char **arch = archlist;
size_t a;
printf("%s%s/%s%s%s ", BOLD, category, BLUE, ebuild, NORM);
for (a = 0; a < archlist_count; a++) {
switch (keywords[a]) {
case stable:
printf("%s%c%s%s ", GREEN, status[keywords[a]], arch[a], NORM);
break;
case testing:
printf("%s%c%s%s ", YELLOW, status[keywords[a]], arch[a], NORM);
break;
}
}
printf("\n");
}
/*
* Read the KEYWORDS string and decode the values
*
* IN:
* char *s - a keywords string (ex: "alpha ~amd64 -x86")
* int *keywords - the output
* ERR:
* int rc - -1 is returned on error (if !s || !keywords)
*/
static int
read_keywords(char *s, int *keywords)
{
char *arch;
char delim[2] = { ' ', '\0' };
char *savep;
size_t slen;
size_t a;
int i;
if (!s)
return -1;
memset(keywords, 0, sizeof(*keywords) * archlist_count);
/* handle -* */
slen = strlen(s);
if (slen >= 2 && s[0] == '-' && s[1] == '*')
for (a = 0; a < archlist_count; ++a)
keywords[a] = minus;
if (!slen)
return 0;
while ((arch = strtok_r(s, delim, &savep)) != NULL) {
s = NULL; /* for strtok_r */
i = decode_arch(arch);
if (i == -1)
continue;
keywords[i] = decode_status(arch[0]);
}
return 0;
}
static int
qkeyword_imlate(tree_pkg_ctx *pkg_ctx, void *priv)
{
size_t a;
qkeyword_data *data = (qkeyword_data *)priv;
switch (data->keywordsbuf[qkeyword_test_arch]) {
case stable:
case none:
case minus:
break;
default:
/* match if any of the other arches have stable keywords */
for (a = 0; a < archlist_count; a++) {
if (data->keywordsbuf[a] != stable)
continue;
print_keywords(pkg_ctx->cat_ctx->name, pkg_ctx->name,
data->keywordsbuf);
return EXIT_SUCCESS;
}
}
return EXIT_FAILURE;
}
static int
qkeyword_kw(tree_pkg_ctx *pkg_ctx, void *priv, int what)
{
qkeyword_data *data = (qkeyword_data *)priv;
depend_atom *atom;
array_t *masks;
if (data->keywordsbuf[qkeyword_test_arch] == what)
{
size_t n;
depend_atom *mask;
atom = tree_get_atom(pkg_ctx, false);
masks = get_set(atom_format("%[CAT]%[PN]", atom), pmasks);
if (masks != NULL) {
array_for_each(masks, n, mask) {
if (atom_compare(atom, mask) == EQUAL) {
if (verbose) {
printf("masked by %s: ", atom_to_string(mask));
printf("%s\n", atom_format(data->fmt,
tree_get_atom(pkg_ctx, true)));
}
return EXIT_FAILURE;
}
}
}
printf("%s\n", atom_format(data->fmt, tree_get_atom(pkg_ctx, true)));
return EXIT_SUCCESS;
}
return EXIT_FAILURE;
}
static int
qkeyword_lstable(tree_pkg_ctx *pkg_ctx, void *priv)
{
return qkeyword_kw(pkg_ctx, priv, stable);
}
static int
qkeyword_ltesting(tree_pkg_ctx *pkg_ctx, void *priv)
{
return qkeyword_kw(pkg_ctx, priv, testing);
}
static int
qkeyword_not(tree_pkg_ctx *pkg_ctx, void *priv)
{
size_t a;
qkeyword_data *data = (qkeyword_data *)priv;
if (data->keywordsbuf[qkeyword_test_arch] != testing &&
data->keywordsbuf[qkeyword_test_arch] != stable)
{
/* match if any of the other arches have keywords */
for (a = 0; a < archlist_count; a++) {
if (data->keywordsbuf[a] == stable ||
data->keywordsbuf[a] == testing)
break;
}
if (a < archlist_count) {
print_keywords(pkg_ctx->cat_ctx->name, pkg_ctx->name,
data->keywordsbuf);
return EXIT_SUCCESS;
}
}
return EXIT_FAILURE;
}
static int
qkeyword_all(tree_pkg_ctx *pkg_ctx, void *priv)
{
qkeyword_data *data = (qkeyword_data *)priv;
if (data->keywordsbuf[qkeyword_test_arch] == stable ||
data->keywordsbuf[qkeyword_test_arch] == testing)
{
print_keywords(pkg_ctx->cat_ctx->name, pkg_ctx->name,
data->keywordsbuf);
return EXIT_SUCCESS;
}
return EXIT_FAILURE;
}
static int
qkeyword_dropped(tree_pkg_ctx *pkg_ctx, void *priv)
{
static bool candidate = false;
static char pkg1[_Q_PATH_MAX];
static char pkg2[_Q_PATH_MAX];
static char *lastpkg = pkg1;
static char *curpkg = pkg2;
static char candpkg[_Q_PATH_MAX];
static int *candkwds = NULL;
static size_t candkwdslen = 0;
qkeyword_data *data = (qkeyword_data *)priv;
size_t i;
char *p;
/* a keyword is "dropped", if:
* - the keyword is present (stable or testing) in earlier ebuilds
* - there are other stable or testing keywords in the ebuild being
* evaluated
* - the keyword is absent, thus not explicitly removed -keyword */
/* mutt-1.10.4: amd64
* mutt-1.11.1: amd64 ppc64
* mutt-1.15.1: amd64 <-- this ebuild for ppc64
* mutt-9999: */
p = lastpkg;
lastpkg = curpkg;
curpkg = p;
if (pkg_ctx != NULL) {
snprintf(curpkg, _Q_PATH_MAX, "%s/%s",
pkg_ctx->cat_ctx->name, pkg_ctx->name);
} else {
curpkg[0] = '\0';
}
if (atom_compare_str(lastpkg, curpkg) == NOT_EQUAL)
{
/* different package, reset */
candidate = false;
}
if (data == NULL) {
if (candkwds != NULL)
free(candkwds);
return EXIT_SUCCESS;
}
if (candkwdslen < data->keywordsbuflen) {
candkwds = xrealloc(candkwds,
data->keywordsbuflen * sizeof(candkwds[0]));
candkwdslen = data->keywordsbuflen;
}
/* explicitly removed? */
if (data->keywordsbuf[qkeyword_test_arch] == minus)
return EXIT_FAILURE;
/* got a keyword? */
if (data->keywordsbuf[qkeyword_test_arch] == testing ||
data->keywordsbuf[qkeyword_test_arch] == stable)
{
if (candidate) {
p = strchr(candpkg, '/');
if (p != NULL) {
*p++ = '\0';
print_keywords(candpkg, p, candkwds);
}
candidate = false;
}
return EXIT_SUCCESS; /* suppress further hits for this package */
}
/* do others have keywords? */
for (i = 0; i < archlist_count; i++) {
if (data->keywordsbuf[i] == stable || data->keywordsbuf[i] == testing) {
/* we don't have a keyword, others do: candidate */
break;
}
}
if (i == archlist_count)
return EXIT_FAILURE;
/* keep the "highest" candidate */
if (!candidate) {
memcpy(candkwds, data->keywordsbuf,
data->keywordsbuflen * sizeof(candkwds[0]));
memcpy(candpkg, curpkg, _Q_PATH_MAX);
candidate = true;
}
return EXIT_FAILURE;
}
static void
print_seconds_for_earthlings(const unsigned long t)
{
unsigned dd, hh, mm, ss;
unsigned long tt = t;
ss = tt % 60; tt /= 60;
mm = tt % 60; tt /= 60;
hh = tt % 24; tt /= 24;
dd = tt;
if (dd)
printf("%s%u%s day%s, ", GREEN, dd, NORM, (dd == 1 ? "" : "s"));
if (hh)
printf("%s%u%s hour%s, ", GREEN, hh, NORM, (hh == 1 ? "" : "s"));
if (mm)
printf("%s%u%s minute%s, ", GREEN, mm, NORM, (mm == 1 ? "" : "s"));
printf("%s%u%s second%s", GREEN, ss, NORM, (ss == 1 ? "" : "s"));
}
static int
qkeyword_stats(tree_pkg_ctx *pkg_ctx, void *priv)
{
static time_t runtime;
static int numpkg = 0;
static int numebld = 0;
static int numcat = 0;
static int *packages_stable;
static int *packages_testing;
static int *current_package_keywords;
static const char *lastcat = NULL;
static char lastpkg[_Q_PATH_MAX];
size_t a;
depend_atom *atom;
qkeyword_data *data = (qkeyword_data *)priv;
/* Is this the last time we'll be called? */
if (!data) {
char **arch;
const char border[] = "------------------------------------------------------------------";
/* no packages, nothing to report */
if (current_package_keywords == NULL) {
printf("no packages found\n");
return EXIT_SUCCESS;
}
/* include stats for last package */
for (a = 0; a < archlist_count; a++) {
switch (current_package_keywords[a]) {
case stable:
packages_stable[a]++;
break;
case testing:
packages_testing[a]++;
default:
break;
}
}
printf("+%.*s+\n", 25, border);
printf("| general statistics |\n");
printf("+%.*s+\n", 25, border);
printf("| %s%13s%s | %s%7zd%s |\n",
GREEN, "architectures", NORM, BLUE, archlist_count, NORM);
printf("| %s%13s%s | %s%7d%s |\n",
GREEN, "categories", NORM, BLUE, numcat, NORM);
printf("| %s%13s%s | %s%7d%s |\n",
GREEN, "packages", NORM, BLUE, numpkg, NORM);
printf("| %s%13s%s | %s%7d%s |\n",
GREEN, "ebuilds", NORM, BLUE, numebld, NORM);
printf("+%.*s+\n\n", 25, border);
printf("+%.*s+\n", (int)(arch_longest_len + 46), border);
printf("|%*skeyword distribution |\n",
(int)arch_longest_len, "");
printf("+%.*s+\n", (int)(arch_longest_len + 46), border);
printf("| %s%*s%s |%s%8s%s |%s%8s%s |%s%8s%s | %s%8s%s |\n",
RED, (int)arch_longest_len, "architecture", NORM,
RED, "stable", NORM,
RED, "~arch", NORM, RED, "total", NORM, RED, "total/#pkgs", NORM);
printf("| %*s | |%s%8s%s | | |\n",
(int)arch_longest_len, "", RED, "only", NORM);
printf("+%.*s+\n", (int)(arch_longest_len + 46), border);
arch = archlist;
for (a = 0; a < archlist_count; a++) {
printf("| %s%*s%s |", GREEN, (int)arch_longest_len, arch[a], NORM);
printf("%s%8d%s |", BLUE, packages_stable[a], NORM);
printf("%s%8d%s |", BLUE, packages_testing[a], NORM);
printf("%s%8d%s |",
BLUE, packages_testing[a] + packages_stable[a], NORM);
printf("%s%11.2f%s%% |\n", BLUE,
(100.0*(packages_testing[a]+packages_stable[a]))/numpkg,
NORM);
}
printf("+%.*s+\n\n", (int)(arch_longest_len + 46), border);
printf("Completed in ");
print_seconds_for_earthlings(time(NULL) - runtime);
printf("\n");
free(packages_stable);
free(packages_testing);
free(current_package_keywords);
return EXIT_SUCCESS;
}
if (numpkg == 0) {
runtime = time(NULL);
packages_stable =
xcalloc(archlist_count, sizeof(*packages_stable));
packages_testing =
xcalloc(archlist_count, sizeof(*packages_testing));
current_package_keywords =
xcalloc(archlist_count, sizeof(*current_package_keywords));
}
if (lastcat != pkg_ctx->cat_ctx->name)
numcat++;
lastcat = pkg_ctx->cat_ctx->name;
atom = tree_get_atom(pkg_ctx, false);
if (atom && strcmp(lastpkg, atom->PN) != 0) {
for (a = 0; a < archlist_count; a++) {
switch (current_package_keywords[a]) {
case stable:
packages_stable[a]++;
break;
case testing:
packages_testing[a]++;
default:
break;
}
}
numpkg++;
snprintf(lastpkg, sizeof(lastpkg), "%s", atom->PN);
memset(current_package_keywords, 0,
archlist_count * sizeof(*current_package_keywords));
}
numebld++;
for (a = 0; a < archlist_count; a++) {
switch (data->keywordsbuf[a]) {
case stable:
current_package_keywords[a] = stable;
break;
case testing:
if (current_package_keywords[a] != stable)
current_package_keywords[a] = testing;
default:
break;
}
}
return EXIT_FAILURE;
}
static int
qkeyword_testing_only(tree_pkg_ctx *pkg_ctx, void *priv)
{
static bool candidate = false;
static char pkg1[_Q_PATH_MAX];
static char pkg2[_Q_PATH_MAX];
static char *lastpkg = pkg1;
static char *curpkg = pkg2;
static char candpkg[_Q_PATH_MAX];
static int *candkwds = NULL;
static size_t candkwdslen = 0;
qkeyword_data *data = (qkeyword_data *)priv;
char *p;
p = lastpkg;
lastpkg = curpkg;
curpkg = p;
if (pkg_ctx != NULL) {
snprintf(curpkg, _Q_PATH_MAX, "%s/%s",
pkg_ctx->cat_ctx->name, pkg_ctx->name);
} else {
curpkg[0] = '\0';
}
if (atom_compare_str(lastpkg, curpkg) == NOT_EQUAL)
{
/* different package, print if candidate */
if (candidate) {
p = strchr(candpkg, '/');
if (p != NULL) {
*p++ = '\0';
print_keywords(candpkg, p, candkwds);
}
candidate = false;
}
}
if (data == NULL) {
if (candkwds != NULL)
free(candkwds);
return EXIT_SUCCESS;
}
if (candkwdslen < data->keywordsbuflen) {
candkwds = xrealloc(candkwds,
data->keywordsbuflen * sizeof(candkwds[0]));
candkwdslen = data->keywordsbuflen;
}
/* explicitly removed or unkeyworded? */
if (data->keywordsbuf[qkeyword_test_arch] == minus ||
data->keywordsbuf[qkeyword_test_arch] == none)
return EXIT_FAILURE;
/* got a stable keyword? */
if (data->keywordsbuf[qkeyword_test_arch] == stable)
return EXIT_SUCCESS; /* suppress further hits for this package */
/* must be testing at this point */
/* keep the "highest" candidate */
if (!candidate) {
memcpy(candkwds, data->keywordsbuf,
data->keywordsbuflen * sizeof(candkwds[0]));
memcpy(candpkg, curpkg, _Q_PATH_MAX);
candidate = true;
}
return EXIT_FAILURE;
}
static int
qkeyword_results_cb(tree_pkg_ctx *pkg_ctx, void *priv)
{
int *keywords;
qkeyword_data *data = (qkeyword_data *)priv;
char buf[_Q_PATH_MAX];
depend_atom *patom = NULL;
tree_metadata_xml *metadata;
struct elist *emailw;
int ret;
patom = tree_get_atom(pkg_ctx, false);
if (patom == NULL)
return EXIT_FAILURE;
if (data->qatom != NULL &&
atom_compare(patom, data->qatom) != EQUAL)
return EXIT_FAILURE;
if (data->lastatom != NULL &&
atom_compare(data->lastatom, patom) != NOT_EQUAL)
return EXIT_SUCCESS;
if (data->qmaint != NULL) {
metadata = tree_pkg_metadata(pkg_ctx);
if (metadata == NULL)
return EXIT_SUCCESS;
for (emailw = metadata->email; emailw != NULL; emailw = emailw->next) {
if (strcmp(emailw->addr, data->qmaint) != 0)
break;
}
if (metadata->email == NULL)
/* arbitrary pointer to trigger exit below */
emailw = (struct elist *)buf;
tree_close_metadata(metadata);
if (emailw != NULL)
return EXIT_SUCCESS;
}
keywords = data->keywordsbuf;
if (read_keywords(tree_pkg_meta_get(pkg_ctx, KEYWORDS), keywords) < 0) {
if (verbose)
warn("Failed to read keywords for %s%s/%s%s%s",
BOLD, pkg_ctx->cat_ctx->name, BLUE, pkg_ctx->name, NORM);
return EXIT_FAILURE;
}
ret = data->runfunc(pkg_ctx, priv);
if (ret == EXIT_SUCCESS) {
/* store CAT/PN in lastatom */
patom->P = patom->PN;
patom->PVR = patom->PN;
patom->PR_int = 0;
data->lastatom = patom;
pkg_ctx->atom = NULL; /* take tree's atom */
}
return EXIT_SUCCESS;
}
static int
keyword_sort(const void *l, const void *r)
{
const char **ls = (const char **)l;
const char **rs = (const char **)r;
char *ld = strchr(*ls, '-');
char *rd = strchr(*rs, '-');
if (ld == NULL && rd != NULL)
return -1;
else if (ld != NULL && rd == NULL)
return 1;
else if (ld == NULL)
return strcmp(*ls, *rs);
else {
int ret = strcmp(ld + 1, rd + 1);
if (ret == 0)
ret = strcmp(*ls, *rs);
return ret;
}
}
static void
qkeyword_load_arches(const char *overlay)
{
FILE *fp;
char *filename, *s;
int linelen;
size_t buflen;
char *buf;
xasprintf(&filename, "%s/%s/profiles/arch.list", portroot, overlay);
fp = fopen(filename, "re");
if (!fp)
goto done;
buf = NULL;
while ((linelen = getline(&buf, &buflen, fp)) >= 0) {
if ((s = strchr(buf, '#')) != NULL) {
*s = '\0';
linelen = s - buf;
}
rmspace_len(buf, (size_t)linelen);
if (buf[0] == '\0')
continue;
bool ok;
archs = add_set_unique(buf, archs, &ok);
if (ok) {
archlist_count++;
buflen = strlen(buf);
if (arch_longest_len < buflen)
arch_longest_len = buflen;
}
}
free(buf);
/* materialise into a list */
if (archlist != NULL)
free(archlist);
list_set(archs, &archlist);
/* sort so the output makes more 'sense' */
qsort(archlist, archlist_count, sizeof(archlist[0]), keyword_sort);
fclose(fp);
done:
free(filename);
}
static int
qkeyword_traverse(tree_pkg_cb func, void *priv)
{
int ret;
size_t n;
const char *overlay;
qkeyword_data *data = (qkeyword_data *)priv;
/* Preload all the arches. Not entirely correct (as arches are bound
* to overlays if set), but oh well. */
array_for_each(overlays, n, overlay)
qkeyword_load_arches(overlay);
if (archlist_count == 0 || archlist == NULL) {
warnf("no arches could be found in your active overlays (see q -o), "
"do you have profiles/arch.list files present?\n");
return EXIT_FAILURE;
}
/* allocate memory (once) for the list used by various funcs */
if (archlist_count > data->keywordsbuflen) {
data->keywordsbuf = xrealloc(data->keywordsbuf,
archlist_count * sizeof(data->keywordsbuf[0]));
data->keywordsbuflen = archlist_count;
}
qkeyword_test_arch = decode_arch(data->arch);
if (qkeyword_test_arch == -1)
return EXIT_FAILURE;
data->runfunc = func;
ret = 0;
array_for_each(overlays, n, overlay) {
tree_ctx *t = tree_open(portroot, overlay);
if (t != NULL) {
ret |= tree_foreach_pkg_sorted(t,
qkeyword_results_cb, priv, data->qatom);
tree_close(t);
}
}
return ret;
}
int qkeyword_main(int argc, char **argv)
{
int i;
char action = '\0';
char *pkg = NULL;
char *cat = NULL;
char *maint = NULL;
bool showarch = false;
qkeyword_data data;
data.fmt = NULL;
while ((i = GETOPT_LONG(QKEYWORD, qkeyword, "")) != -1) {
switch (i) {
case 'p': pkg = optarg; break;
case 'c': cat = optarg; break;
case 'm': maint = optarg; break;
case 'A': showarch = true; break;
case 'F': data.fmt = optarg; break;
case 'i':
case 'd':
case 't':
case 's':
case 'a':
case 'n':
case 'S':
case 'T':
/* trying to use more than 1 action */
if (action != '\0')
qkeyword_usage(EXIT_FAILURE);
action = i;
break;
COMMON_GETOPTS_CASES(qkeyword)
}
}
data.arch = portarch;
if (optind < argc)
data.arch = argv[optind];
if (((data.arch == NULL || *data.arch == '\0') && action != 's') ||
optind + 1 < argc)
qkeyword_usage(EXIT_FAILURE);
if (showarch) {
printf("%s\n", data.arch);
return EXIT_SUCCESS;
}
if (cat != NULL) {
data.qatom = atom_explode_cat(pkg == NULL ? "" : pkg, cat);
if (data.qatom == NULL) {
warnf("invalid cat/pkg: %s/%s\n", cat, pkg == NULL ? "" : pkg);
return EXIT_FAILURE;
}
} else if (pkg != NULL) {
data.qatom = atom_explode(pkg);
if (data.qatom == NULL) {
warnf("invalid pkg: %s\n", pkg);
return EXIT_FAILURE;
}
} else {
data.qatom = NULL;
}
/* set format if none given */
if ((action == 'S' || action == 'T') && data.fmt == NULL)
data.fmt = "%[CATEGORY]%[PF]";
archs = create_set();
archlist_count = 0;
arch_longest_len = 0;
data.lastatom = NULL;
data.keywordsbuf = NULL;
data.keywordsbuflen = 0;
data.qmaint = maint;
/* prepare masks for easy(er) matching by key-ing on CAT/PN */
{
DECLARE_ARRAY(masks);
array_t *bucket;
array_t *ebuck;
size_t n;
char *mask;
depend_atom *atom;
pmasks = create_set();
array_set(package_masks, masks);
array_for_each(masks, n, mask) {
if ((atom = atom_explode(mask)) == NULL)
continue;
bucket = xzalloc(sizeof(array_t));
xarraypush_ptr(bucket, atom);
ebuck = add_set_value(atom_format("%[CAT]%[PN]", atom),
bucket, pmasks);
if (ebuck != NULL) {
xarraypush_ptr(ebuck, atom);
xarrayfree_int(bucket);
}
}
}
switch (action) {
case 'i': i = qkeyword_traverse(qkeyword_imlate, &data); break;
case 'd': i = qkeyword_traverse(qkeyword_dropped, &data);
i = qkeyword_dropped(NULL, NULL); break;
case 't': i = qkeyword_traverse(qkeyword_testing_only, &data);
i = qkeyword_testing_only(NULL, NULL); break;
case 's': i = qkeyword_traverse(qkeyword_stats, &data);
i = qkeyword_stats(NULL, NULL); break;
case 'a': i = qkeyword_traverse(qkeyword_all, &data); break;
case 'n': i = qkeyword_traverse(qkeyword_not, &data); break;
case 'S': i = qkeyword_traverse(qkeyword_lstable, &data); break;
case 'T': i = qkeyword_traverse(qkeyword_ltesting, &data); break;
default: i = -2; break;
}
if (data.qatom != NULL)
atom_implode(data.qatom);
free(archlist);
free_set(archs);
if (i == -2)
qkeyword_usage(EXIT_FAILURE);
return i;
}
|