/usr/share/perl5/Dpkg/Deps.pm is in libdpkg-perl 1.18.25.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 | # Copyright © 2007-2009 Raphaël Hertzog <hertzog@debian.org>
# Copyright © 2008-2009,2012-2014 Guillem Jover <guillem@debian.org>
#
# This program is free software; you may redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
#
# This is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <https://www.gnu.org/licenses/>.
#########################################################################
# Several parts are inspired by lib/Dep.pm from lintian (same license)
#
# Copyright © 1998 Richard Braakman
# Portions Copyright © 1999 Darren Benham
# Portions Copyright © 2000 Sean 'Shaleh' Perry
# Portions Copyright © 2004 Frank Lichtenheld
# Portions Copyright © 2006 Russ Allbery
package Dpkg::Deps;
=encoding utf8
=head1 NAME
Dpkg::Deps - parse and manipulate dependencies of Debian packages
=head1 DESCRIPTION
The Dpkg::Deps module provides objects implementing various types of
dependencies.
The most important function is deps_parse(), it turns a dependency line in
a set of Dpkg::Deps::{Simple,AND,OR,Union} objects depending on the case.
=head1 FUNCTIONS
All the deps_* functions are exported by default.
=over 4
=cut
use strict;
use warnings;
our $VERSION = '1.06';
our @EXPORT = qw(
deps_concat
deps_parse
deps_eval_implication
deps_iterate
deps_compare
);
use Carp;
use Exporter qw(import);
use Dpkg::Version;
use Dpkg::Arch qw(get_host_arch get_build_arch debarch_to_debtuple);
use Dpkg::BuildProfiles qw(get_build_profiles);
use Dpkg::ErrorHandling;
use Dpkg::Gettext;
=item deps_eval_implication($rel_p, $v_p, $rel_q, $v_q)
($rel_p, $v_p) and ($rel_q, $v_q) express two dependencies as (relation,
version). The relation variable can have the following values that are
exported by Dpkg::Version: REL_EQ, REL_LT, REL_LE, REL_GT, REL_GT.
This functions returns 1 if the "p" dependency implies the "q"
dependency. It returns 0 if the "p" dependency implies that "q" is
not satisfied. It returns undef when there's no implication.
The $v_p and $v_q parameter should be Dpkg::Version objects.
=cut
sub deps_eval_implication {
my ($rel_p, $v_p, $rel_q, $v_q) = @_;
# If versions are not valid, we can't decide of any implication
return unless defined($v_p) and $v_p->is_valid();
return unless defined($v_q) and $v_q->is_valid();
# q wants an exact version, so p must provide that exact version. p
# disproves q if q's version is outside the range enforced by p.
if ($rel_q eq REL_EQ) {
if ($rel_p eq REL_LT) {
return ($v_p <= $v_q) ? 0 : undef;
} elsif ($rel_p eq REL_LE) {
return ($v_p < $v_q) ? 0 : undef;
} elsif ($rel_p eq REL_GT) {
return ($v_p >= $v_q) ? 0 : undef;
} elsif ($rel_p eq REL_GE) {
return ($v_p > $v_q) ? 0 : undef;
} elsif ($rel_p eq REL_EQ) {
return ($v_p == $v_q);
}
}
# A greater than clause may disprove a less than clause. An equal
# cause might as well. Otherwise, if
# p's clause is <<, <=, or =, the version must be <= q's to imply q.
if ($rel_q eq REL_LE) {
if ($rel_p eq REL_GT) {
return ($v_p >= $v_q) ? 0 : undef;
} elsif ($rel_p eq REL_GE) {
return ($v_p > $v_q) ? 0 : undef;
} elsif ($rel_p eq REL_EQ) {
return ($v_p <= $v_q) ? 1 : 0;
} else { # <<, <=
return ($v_p <= $v_q) ? 1 : undef;
}
}
# Similar, but << is stronger than <= so p's version must be << q's
# version if the p relation is <= or =.
if ($rel_q eq REL_LT) {
if ($rel_p eq REL_GT or $rel_p eq REL_GE) {
return ($v_p >= $v_p) ? 0 : undef;
} elsif ($rel_p eq REL_LT) {
return ($v_p <= $v_q) ? 1 : undef;
} elsif ($rel_p eq REL_EQ) {
return ($v_p < $v_q) ? 1 : 0;
} else { # <<, <=
return ($v_p < $v_q) ? 1 : undef;
}
}
# Same logic as above, only inverted.
if ($rel_q eq REL_GE) {
if ($rel_p eq REL_LT) {
return ($v_p <= $v_q) ? 0 : undef;
} elsif ($rel_p eq REL_LE) {
return ($v_p < $v_q) ? 0 : undef;
} elsif ($rel_p eq REL_EQ) {
return ($v_p >= $v_q) ? 1 : 0;
} else { # >>, >=
return ($v_p >= $v_q) ? 1 : undef;
}
}
if ($rel_q eq REL_GT) {
if ($rel_p eq REL_LT or $rel_p eq REL_LE) {
return ($v_p <= $v_q) ? 0 : undef;
} elsif ($rel_p eq REL_GT) {
return ($v_p >= $v_q) ? 1 : undef;
} elsif ($rel_p eq REL_EQ) {
return ($v_p > $v_q) ? 1 : 0;
} else {
return ($v_p > $v_q) ? 1 : undef;
}
}
return;
}
=item $dep = deps_concat(@dep_list)
This function concatenates multiple dependency lines into a single line,
joining them with ", " if appropriate, and always returning a valid string.
=cut
sub deps_concat {
my (@dep_list) = @_;
return join ', ', grep { defined } @dep_list;
}
=item $dep = deps_parse($line, %options)
This function parses the dependency line and returns an object, either a
Dpkg::Deps::AND or a Dpkg::Deps::Union. Various options can alter the
behaviour of that function.
=over 4
=item use_arch (defaults to 1)
Take into account the architecture restriction part of the dependencies.
Set to 0 to completely ignore that information.
=item host_arch (defaults to the current architecture)
Define the host architecture. By default it uses
Dpkg::Arch::get_host_arch() to identify the proper architecture.
=item build_arch (defaults to the current architecture)
Define the build architecture. By default it uses
Dpkg::Arch::get_build_arch() to identify the proper architecture.
=item reduce_arch (defaults to 0)
If set to 1, ignore dependencies that do not concern the current host
architecture. This implicitly strips off the architecture restriction
list so that the resulting dependencies are directly applicable to the
current architecture.
=item use_profiles (defaults to 1)
Take into account the profile restriction part of the dependencies. Set
to 0 to completely ignore that information.
=item build_profiles (defaults to no profile)
Define the active build profiles. By default no profile is defined.
=item reduce_profiles (defaults to 0)
If set to 1, ignore dependencies that do not concern the current build
profile. This implicitly strips off the profile restriction formula so
that the resulting dependencies are directly applicable to the current
profiles.
=item reduce_restrictions (defaults to 0)
If set to 1, ignore dependencies that do not concern the current set of
restrictions. This implicitly strips off any architecture restriction list
or restriction formula so that the resulting dependencies are directly
applicable to the current restriction.
This currently implies C<reduce_arch> and C<reduce_profiles>, and overrides
them if set.
=item union (defaults to 0)
If set to 1, returns a Dpkg::Deps::Union instead of a Dpkg::Deps::AND. Use
this when parsing non-dependency fields like Conflicts.
=item build_dep (defaults to 0)
If set to 1, allow build-dep only arch qualifiers, that is “:native”.
This should be set whenever working with build-deps.
=item tests_dep (defaults to 0)
If set to 1, allow tests-specific package names in dependencies, that is
"@" and "@builddeps@" (since dpkg 1.18.7). This should be set whenever
working with dependency fields from F<debian/tests/control>.
=back
=cut
sub deps_parse {
my ($dep_line, %options) = @_;
# Validate arguments.
croak "invalid host_arch $options{host_arch}"
if defined $options{host_arch} and not defined debarch_to_debtuple($options{host_arch});
croak "invalid build_arch $options{build_arch}"
if defined $options{build_arch} and not defined debarch_to_debtuple($options{build_arch});
$options{use_arch} //= 1;
$options{reduce_arch} //= 0;
$options{host_arch} //= get_host_arch();
$options{build_arch} //= get_build_arch();
$options{use_profiles} //= 1;
$options{reduce_profiles} //= 0;
$options{build_profiles} //= [ get_build_profiles() ];
$options{reduce_restrictions} //= 0;
$options{union} //= 0;
$options{build_dep} //= 0;
$options{tests_dep} //= 0;
if ($options{reduce_restrictions}) {
$options{reduce_arch} = 1;
$options{reduce_profiles} = 1;
}
# Options for Dpkg::Deps::Simple.
my %deps_options = (
host_arch => $options{host_arch},
build_arch => $options{build_arch},
build_dep => $options{build_dep},
tests_dep => $options{tests_dep},
);
# Strip trailing/leading spaces
$dep_line =~ s/^\s+//;
$dep_line =~ s/\s+$//;
my @dep_list;
foreach my $dep_and (split(/\s*,\s*/m, $dep_line)) {
my @or_list = ();
foreach my $dep_or (split(/\s*\|\s*/m, $dep_and)) {
my $dep_simple = Dpkg::Deps::Simple->new($dep_or, %deps_options);
if (not defined $dep_simple->{package}) {
warning(g_("can't parse dependency %s"), $dep_or);
return;
}
$dep_simple->{arches} = undef if not $options{use_arch};
if ($options{reduce_arch}) {
$dep_simple->reduce_arch($options{host_arch});
next if not $dep_simple->arch_is_concerned($options{host_arch});
}
$dep_simple->{restrictions} = undef if not $options{use_profiles};
if ($options{reduce_profiles}) {
$dep_simple->reduce_profiles($options{build_profiles});
next if not $dep_simple->profile_is_concerned($options{build_profiles});
}
push @or_list, $dep_simple;
}
next if not @or_list;
if (scalar @or_list == 1) {
push @dep_list, $or_list[0];
} else {
my $dep_or = Dpkg::Deps::OR->new();
$dep_or->add($_) foreach (@or_list);
push @dep_list, $dep_or;
}
}
my $dep_and;
if ($options{union}) {
$dep_and = Dpkg::Deps::Union->new();
} else {
$dep_and = Dpkg::Deps::AND->new();
}
foreach my $dep (@dep_list) {
if ($options{union} and not $dep->isa('Dpkg::Deps::Simple')) {
warning(g_('an union dependency can only contain simple dependencies'));
return;
}
$dep_and->add($dep);
}
return $dep_and;
}
=item $bool = deps_iterate($deps, $callback_func)
This function visits all elements of the dependency object, calling the
callback function for each element.
The callback function is expected to return true when everything is fine,
or false if something went wrong, in which case the iteration will stop.
Return the same value as the callback function.
=cut
sub deps_iterate {
my ($deps, $callback_func) = @_;
my $visitor_func;
$visitor_func = sub {
foreach my $dep (@_) {
return unless defined $dep;
if ($dep->isa('Dpkg::Deps::Simple')) {
return unless &{$callback_func}($dep);
} else {
return unless &{$visitor_func}($dep->get_deps());
}
}
return 1;
};
return &{$visitor_func}($deps);
}
=item deps_compare($a, $b)
Implements a comparison operator between two dependency objects.
This function is mainly used to implement the sort() method.
=back
=cut
my %relation_ordering = (
undef => 0,
REL_GE() => 1,
REL_GT() => 2,
REL_EQ() => 3,
REL_LT() => 4,
REL_LE() => 5,
);
sub deps_compare {
my ($aref, $bref) = @_;
my (@as, @bs);
deps_iterate($aref, sub { push @as, @_ });
deps_iterate($bref, sub { push @bs, @_ });
while (1) {
my ($a, $b) = (shift @as, shift @bs);
my $aundef = not defined $a or $a->is_empty();
my $bundef = not defined $b or $b->is_empty();
return 0 if $aundef and $bundef;
return -1 if $aundef;
return 1 if $bundef;
my $ar = $a->{relation} // 'undef';
my $br = $b->{relation} // 'undef';
my $av = $a->{version} // '';
my $bv = $b->{version} // '';
my $res = (($a->{package} cmp $b->{package}) ||
($relation_ordering{$ar} <=> $relation_ordering{$br}) ||
($av cmp $bv));
return $res if $res != 0;
}
}
package Dpkg::Deps::Simple;
=head1 OBJECTS - Dpkg::Deps::*
There are several kind of dependencies. A Dpkg::Deps::Simple dependency
represents a single dependency statement (it relates to one package only).
Dpkg::Deps::Multiple dependencies are built on top of this object
and combine several dependencies in a different manners. Dpkg::Deps::AND
represents the logical "AND" between dependencies while Dpkg::Deps::OR
represents the logical "OR". Dpkg::Deps::Multiple objects can contain
Dpkg::Deps::Simple object as well as other Dpkg::Deps::Multiple objects.
In practice, the code is only meant to handle the realistic cases which,
given Debian's dependencies structure, imply those restrictions: AND can
contain Simple or OR objects, OR can only contain Simple objects.
Dpkg::Deps::KnownFacts is a special object that is used while evaluating
dependencies and while trying to simplify them. It represents a set of
installed packages along with the virtual packages that they might
provide.
=head2 COMMON METHODS
=over 4
=item $dep->is_empty()
Returns true if the dependency is empty and doesn't contain any useful
information. This is true when a Dpkg::Deps::Simple object has not yet
been initialized or when a (descendant of) Dpkg::Deps::Multiple contains
an empty list of dependencies.
=item $dep->get_deps()
Returns a list of sub-dependencies. For Dpkg::Deps::Simple it returns
itself.
=item $dep->output([$fh])
=item "$dep"
Returns a string representing the dependency. If $fh is set, it prints
the string to the filehandle.
=item $dep->implies($other_dep)
Returns 1 when $dep implies $other_dep. Returns 0 when $dep implies
NOT($other_dep). Returns undef when there's no implication. $dep and
$other_dep do not need to be of the same type.
=item $dep->sort()
Sorts alphabetically the internal list of dependencies. It's a no-op for
Dpkg::Deps::Simple objects.
=item $dep->arch_is_concerned($arch)
Returns true if the dependency applies to the indicated architecture. For
multiple dependencies, it returns true if at least one of the
sub-dependencies apply to this architecture.
=item $dep->reduce_arch($arch)
Simplifies the dependency to contain only information relevant to the given
architecture. A Dpkg::Deps::Simple object can be left empty after this
operation. For Dpkg::Deps::Multiple objects, the non-relevant
sub-dependencies are simply removed.
This trims off the architecture restriction list of Dpkg::Deps::Simple
objects.
=item $dep->get_evaluation($facts)
Evaluates the dependency given a list of installed packages and a list of
virtual packages provided. Those lists are part of the
Dpkg::Deps::KnownFacts object given as parameters.
Returns 1 when it's true, 0 when it's false, undef when some information
is lacking to conclude.
=item $dep->simplify_deps($facts, @assumed_deps)
Simplifies the dependency as much as possible given the list of facts (see
object Dpkg::Deps::KnownFacts) and a list of other dependencies that are
known to be true.
=item $dep->has_arch_restriction()
For a simple dependency, returns the package name if the dependency
applies only to a subset of architectures. For multiple dependencies, it
returns the list of package names that have such a restriction.
=item $dep->reset()
Clears any dependency information stored in $dep so that $dep->is_empty()
returns true.
=back
=head2 Dpkg::Deps::Simple
Such an object has four interesting properties:
=over 4
=item package
The package name (can be undef if the dependency has not been initialized
or if the simplification of the dependency lead to its removal).
=item relation
The relational operator: "=", "<<", "<=", ">=" or ">>". It can be
undefined if the dependency had no version restriction. In that case the
following field is also undefined.
=item version
The version.
=item arches
The list of architectures where this dependency is applicable. It's
undefined when there's no restriction, otherwise it's an
array ref. It can contain an exclusion list, in that case each
architecture is prefixed with an exclamation mark.
=item archqual
The arch qualifier of the dependency (can be undef if there's none).
In the dependency "python:any (>= 2.6)", the arch qualifier is "any".
=back
=head3 METHODS
=over 4
=item $simple_dep->parse_string('dpkg-dev (>= 1.14.8) [!hurd-i386]')
Parses the dependency and modifies internal properties to match the parsed
dependency.
=item $simple_dep->merge_union($other_dep)
Returns true if $simple_dep could be modified to represent the union of
both dependencies. Otherwise returns false.
=back
=cut
use strict;
use warnings;
use Carp;
use Dpkg::Arch qw(debarch_is_concerned debarch_list_parse);
use Dpkg::BuildProfiles qw(parse_build_profiles evaluate_restriction_formula);
use Dpkg::Version;
use Dpkg::ErrorHandling;
use Dpkg::Gettext;
use Dpkg::Util qw(:list);
use parent qw(Dpkg::Interface::Storable);
sub new {
my ($this, $arg, %opts) = @_;
my $class = ref($this) || $this;
my $self = {};
bless $self, $class;
$self->reset();
$self->{host_arch} = $opts{host_arch} || Dpkg::Arch::get_host_arch();
$self->{build_arch} = $opts{build_arch} || Dpkg::Arch::get_build_arch();
$self->{build_dep} = $opts{build_dep} // 0;
$self->{tests_dep} = $opts{tests_dep} // 0;
$self->parse_string($arg) if defined($arg);
return $self;
}
sub reset {
my $self = shift;
$self->{package} = undef;
$self->{relation} = undef;
$self->{version} = undef;
$self->{arches} = undef;
$self->{archqual} = undef;
$self->{restrictions} = undef;
}
sub parse {
my ($self, $fh, $desc) = @_;
my $line = <$fh>;
chomp($line);
return $self->parse_string($line);
}
sub parse_string {
my ($self, $dep) = @_;
my $pkgname_re;
if ($self->{tests_dep}) {
$pkgname_re = qr/[\@a-zA-Z0-9][\@a-zA-Z0-9+.-]*/;
} else {
$pkgname_re = qr/[a-zA-Z0-9][a-zA-Z0-9+.-]*/;
}
return if not $dep =~
m{^\s* # skip leading whitespace
($pkgname_re) # package name
(?: # start of optional part
: # colon for architecture
([a-zA-Z0-9][a-zA-Z0-9-]*) # architecture name
)? # end of optional part
(?: # start of optional part
\s* \( # open parenthesis for version part
\s* (<<|<=|=|>=|>>|[<>]) # relation part
\s* ([^\)\s]+) # do not attempt to parse version
\s* \) # closing parenthesis
)? # end of optional part
(?: # start of optional architecture
\s* \[ # open bracket for architecture
\s* ([^\]]+) # don't parse architectures now
\s* \] # closing bracket
)? # end of optional architecture
(
(?: # start of optional restriction
\s* < # open bracket for restriction
\s* [^>]+ # do not parse restrictions now
\s* > # closing bracket
)+
)? # end of optional restriction
\s*$ # trailing spaces at end
}x;
if (defined($2)) {
return if $2 eq 'native' and not $self->{build_dep};
$self->{archqual} = $2;
}
$self->{package} = $1;
$self->{relation} = version_normalize_relation($3) if defined($3);
if (defined($4)) {
$self->{version} = Dpkg::Version->new($4);
}
if (defined($5)) {
$self->{arches} = [ debarch_list_parse($5) ];
}
if (defined($6)) {
$self->{restrictions} = [ parse_build_profiles($6) ];
}
}
sub output {
my ($self, $fh) = @_;
my $res = $self->{package};
if (defined($self->{archqual})) {
$res .= ':' . $self->{archqual};
}
if (defined($self->{relation})) {
$res .= ' (' . $self->{relation} . ' ' . $self->{version} . ')';
}
if (defined($self->{arches})) {
$res .= ' [' . join(' ', @{$self->{arches}}) . ']';
}
if (defined($self->{restrictions})) {
for my $restrlist (@{$self->{restrictions}}) {
$res .= ' <' . join(' ', @{$restrlist}) . '>';
}
}
if (defined($fh)) {
print { $fh } $res;
}
return $res;
}
# _arch_is_superset(\@p, \@q)
#
# Returns true if the arch list @p is a superset of arch list @q.
# The arguments can also be undef in case there's no explicit architecture
# restriction.
sub _arch_is_superset {
my ($p, $q) = @_;
my $p_arch_neg = defined($p) && $p->[0] =~ /^!/;
my $q_arch_neg = defined($q) && $q->[0] =~ /^!/;
# If "p" has no arches, it is a superset of q and we should fall through
# to the version check.
if (not defined $p) {
return 1;
}
# If q has no arches, it is a superset of p and there are no useful
# implications.
elsif (not defined $q) {
return 0;
}
# Both have arches. If neither are negated, we know nothing useful
# unless q is a subset of p.
elsif (not $p_arch_neg and not $q_arch_neg) {
my %p_arches = map { $_ => 1 } @{$p};
my $subset = 1;
for my $arch (@{$q}) {
$subset = 0 unless $p_arches{$arch};
}
return 0 unless $subset;
}
# If both are negated, we know nothing useful unless p is a subset of
# q (and therefore has fewer things excluded, and therefore is more
# general).
elsif ($p_arch_neg and $q_arch_neg) {
my %q_arches = map { $_ => 1 } @{$q};
my $subset = 1;
for my $arch (@{$p}) {
$subset = 0 unless $q_arches{$arch};
}
return 0 unless $subset;
}
# If q is negated and p isn't, we'd need to know the full list of
# arches to know if there's any relationship, so bail.
elsif (not $p_arch_neg and $q_arch_neg) {
return 0;
}
# If p is negated and q isn't, q is a subset of p if none of the
# negated arches in p are present in q.
elsif ($p_arch_neg and not $q_arch_neg) {
my %q_arches = map { $_ => 1 } @{$q};
my $subset = 1;
for my $arch (@{$p}) {
$subset = 0 if $q_arches{substr($arch, 1)};
}
return 0 unless $subset;
}
return 1;
}
# _arch_qualifier_implies($p, $q)
#
# Returns true if the arch qualifier $p and $q are compatible with the
# implication $p -> $q, false otherwise. $p/$q can be undef/"any"/"native"
# or an architecture string.
#
# Because we are handling dependencies in isolation, and the full context
# of the implications are only known when doing dependency resolution at
# run-time, we can only assert that they are implied if they are equal.
sub _arch_qualifier_implies {
my ($p, $q) = @_;
return $p eq $q if defined $p and defined $q;
return 1 if not defined $p and not defined $q;
return 0;
}
# _restrictions_imply($p, $q)
#
# Returns true if the restrictions $p and $q are compatible with the
# implication $p -> $q, false otherwise.
# NOTE: We don't try to be very clever here, so we may conservatively
# return false when there is an implication.
sub _restrictions_imply {
my ($p, $q) = @_;
if (not defined $p) {
return 1;
} elsif (not defined $q) {
return 0;
} else {
# Check whether set difference is empty.
my %restr;
for my $restrlist (@{$q}) {
my $reststr = join ' ', sort @{$restrlist};
$restr{$reststr} = 1;
}
for my $restrlist (@{$p}) {
my $reststr = join ' ', sort @{$restrlist};
delete $restr{$reststr};
}
return keys %restr == 0;
}
}
# Returns true if the dependency in parameter can deduced from the current
# dependency. Returns false if it can be negated. Returns undef if nothing
# can be concluded.
sub implies {
my ($self, $o) = @_;
if ($o->isa('Dpkg::Deps::Simple')) {
# An implication is only possible on the same package
return if $self->{package} ne $o->{package};
# Our architecture set must be a superset of the architectures for
# o, otherwise we can't conclude anything.
return unless _arch_is_superset($self->{arches}, $o->{arches});
# The arch qualifier must not forbid an implication
return unless _arch_qualifier_implies($self->{archqual},
$o->{archqual});
# Our restrictions must imply the restrictions for o
return unless _restrictions_imply($self->{restrictions},
$o->{restrictions});
# If o has no version clause, then our dependency is stronger
return 1 if not defined $o->{relation};
# If o has a version clause, we must also have one, otherwise there
# can't be an implication
return if not defined $self->{relation};
return Dpkg::Deps::deps_eval_implication($self->{relation},
$self->{version}, $o->{relation}, $o->{version});
} elsif ($o->isa('Dpkg::Deps::AND')) {
# TRUE: Need to imply all individual elements
# FALSE: Need to NOT imply at least one individual element
my $res = 1;
foreach my $dep ($o->get_deps()) {
my $implication = $self->implies($dep);
unless (defined($implication) && $implication == 1) {
$res = $implication;
last if defined $res;
}
}
return $res;
} elsif ($o->isa('Dpkg::Deps::OR')) {
# TRUE: Need to imply at least one individual element
# FALSE: Need to not apply all individual elements
# UNDEF: The rest
my $res = undef;
foreach my $dep ($o->get_deps()) {
my $implication = $self->implies($dep);
if (defined($implication)) {
if (not defined $res) {
$res = $implication;
} else {
if ($implication) {
$res = 1;
} else {
$res = 0;
}
}
last if defined($res) && $res == 1;
}
}
return $res;
} else {
croak 'Dpkg::Deps::Simple cannot evaluate implication with a ' .
ref($o);
}
}
sub get_deps {
my $self = shift;
return $self;
}
sub sort {
# Nothing to sort
}
sub arch_is_concerned {
my ($self, $host_arch) = @_;
return 0 if not defined $self->{package}; # Empty dep
return 1 if not defined $self->{arches}; # Dep without arch spec
return debarch_is_concerned($host_arch, @{$self->{arches}});
}
sub reduce_arch {
my ($self, $host_arch) = @_;
if (not $self->arch_is_concerned($host_arch)) {
$self->reset();
} else {
$self->{arches} = undef;
}
}
sub has_arch_restriction {
my $self = shift;
if (defined $self->{arches}) {
return $self->{package};
} else {
return ();
}
}
sub profile_is_concerned {
my ($self, $build_profiles) = @_;
return 0 if not defined $self->{package}; # Empty dep
return 1 if not defined $self->{restrictions}; # Dep without restrictions
return evaluate_restriction_formula($self->{restrictions}, $build_profiles);
}
sub reduce_profiles {
my ($self, $build_profiles) = @_;
if (not $self->profile_is_concerned($build_profiles)) {
$self->reset();
} else {
$self->{restrictions} = undef;
}
}
sub get_evaluation {
my ($self, $facts) = @_;
return if not defined $self->{package};
return $facts->_evaluate_simple_dep($self);
}
sub simplify_deps {
my ($self, $facts) = @_;
my $eval = $self->get_evaluation($facts);
$self->reset() if defined $eval and $eval == 1;
}
sub is_empty {
my $self = shift;
return not defined $self->{package};
}
sub merge_union {
my ($self, $o) = @_;
return 0 if not $o->isa('Dpkg::Deps::Simple');
return 0 if $self->is_empty() or $o->is_empty();
return 0 if $self->{package} ne $o->{package};
return 0 if defined $self->{arches} or defined $o->{arches};
if (not defined $o->{relation} and defined $self->{relation}) {
# Union is the non-versioned dependency
$self->{relation} = undef;
$self->{version} = undef;
return 1;
}
my $implication = $self->implies($o);
my $rev_implication = $o->implies($self);
if (defined($implication)) {
if ($implication) {
$self->{relation} = $o->{relation};
$self->{version} = $o->{version};
return 1;
} else {
return 0;
}
}
if (defined($rev_implication)) {
if ($rev_implication) {
# Already merged...
return 1;
} else {
return 0;
}
}
return 0;
}
package Dpkg::Deps::Multiple;
=head2 Dpkg::Deps::Multiple
This is the base class for Dpkg::Deps::{AND,OR,Union}. It implements
the following methods:
=over 4
=item $mul->add($dep)
Adds a new dependency object at the end of the list.
=back
=cut
use strict;
use warnings;
use Carp;
use Dpkg::ErrorHandling;
use parent qw(Dpkg::Interface::Storable);
sub new {
my $this = shift;
my $class = ref($this) || $this;
my $self = { list => [ @_ ] };
bless $self, $class;
return $self;
}
sub reset {
my $self = shift;
$self->{list} = [];
}
sub add {
my $self = shift;
push @{$self->{list}}, @_;
}
sub get_deps {
my $self = shift;
return grep { not $_->is_empty() } @{$self->{list}};
}
sub sort {
my $self = shift;
my @res = ();
@res = sort { Dpkg::Deps::deps_compare($a, $b) } @{$self->{list}};
$self->{list} = [ @res ];
}
sub arch_is_concerned {
my ($self, $host_arch) = @_;
my $res = 0;
foreach my $dep (@{$self->{list}}) {
$res = 1 if $dep->arch_is_concerned($host_arch);
}
return $res;
}
sub reduce_arch {
my ($self, $host_arch) = @_;
my @new;
foreach my $dep (@{$self->{list}}) {
$dep->reduce_arch($host_arch);
push @new, $dep if $dep->arch_is_concerned($host_arch);
}
$self->{list} = [ @new ];
}
sub has_arch_restriction {
my $self = shift;
my @res;
foreach my $dep (@{$self->{list}}) {
push @res, $dep->has_arch_restriction();
}
return @res;
}
sub profile_is_concerned {
my ($self, $build_profiles) = @_;
my $res = 0;
foreach my $dep (@{$self->{list}}) {
$res = 1 if $dep->profile_is_concerned($build_profiles);
}
return $res;
}
sub reduce_profiles {
my ($self, $build_profiles) = @_;
my @new;
foreach my $dep (@{$self->{list}}) {
$dep->reduce_profiles($build_profiles);
push @new, $dep if $dep->profile_is_concerned($build_profiles);
}
$self->{list} = [ @new ];
}
sub is_empty {
my $self = shift;
return scalar @{$self->{list}} == 0;
}
sub merge_union {
croak 'method merge_union() is only valid for Dpkg::Deps::Simple';
}
package Dpkg::Deps::AND;
=head2 Dpkg::Deps::AND
This object represents a list of dependencies who must be met at the same
time.
=over 4
=item $and->output([$fh])
The output method uses ", " to join the list of sub-dependencies.
=back
=cut
use strict;
use warnings;
use parent -norequire, qw(Dpkg::Deps::Multiple);
sub output {
my ($self, $fh) = @_;
my $res = join(', ', map { $_->output() } grep { not $_->is_empty() } $self->get_deps());
if (defined($fh)) {
print { $fh } $res;
}
return $res;
}
sub implies {
my ($self, $o) = @_;
# If any individual member can imply $o or NOT $o, we're fine
foreach my $dep ($self->get_deps()) {
my $implication = $dep->implies($o);
return 1 if defined($implication) && $implication == 1;
return 0 if defined($implication) && $implication == 0;
}
# If o is an AND, we might have an implication, if we find an
# implication within us for each predicate in o
if ($o->isa('Dpkg::Deps::AND')) {
my $subset = 1;
foreach my $odep ($o->get_deps()) {
my $found = 0;
foreach my $dep ($self->get_deps()) {
$found = 1 if $dep->implies($odep);
}
$subset = 0 if not $found;
}
return 1 if $subset;
}
return;
}
sub get_evaluation {
my ($self, $facts) = @_;
# Return 1 only if all members evaluates to true
# Return 0 if at least one member evaluates to false
# Return undef otherwise
my $result = 1;
foreach my $dep ($self->get_deps()) {
my $eval = $dep->get_evaluation($facts);
if (not defined $eval) {
$result = undef;
} elsif ($eval == 0) {
$result = 0;
last;
} elsif ($eval == 1) {
# Still possible
}
}
return $result;
}
sub simplify_deps {
my ($self, $facts, @knowndeps) = @_;
my @new;
WHILELOOP:
while (@{$self->{list}}) {
my $dep = shift @{$self->{list}};
my $eval = $dep->get_evaluation($facts);
next if defined($eval) and $eval == 1;
foreach my $odep (@knowndeps, @new) {
next WHILELOOP if $odep->implies($dep);
}
# When a dependency is implied by another dependency that
# follows, then invert them
# "a | b, c, a" becomes "a, c" and not "c, a"
my $i = 0;
foreach my $odep (@{$self->{list}}) {
if (defined $odep and $odep->implies($dep)) {
splice @{$self->{list}}, $i, 1;
unshift @{$self->{list}}, $odep;
next WHILELOOP;
}
$i++;
}
push @new, $dep;
}
$self->{list} = [ @new ];
}
package Dpkg::Deps::OR;
=head2 Dpkg::Deps::OR
This object represents a list of dependencies of which only one must be met
for the dependency to be true.
=over 4
=item $or->output([$fh])
The output method uses " | " to join the list of sub-dependencies.
=back
=cut
use strict;
use warnings;
use parent -norequire, qw(Dpkg::Deps::Multiple);
sub output {
my ($self, $fh) = @_;
my $res = join(' | ', map { $_->output() } grep { not $_->is_empty() } $self->get_deps());
if (defined($fh)) {
print { $fh } $res;
}
return $res;
}
sub implies {
my ($self, $o) = @_;
# Special case for AND with a single member, replace it by its member
if ($o->isa('Dpkg::Deps::AND')) {
my @subdeps = $o->get_deps();
if (scalar(@subdeps) == 1) {
$o = $subdeps[0];
}
}
# In general, an OR dependency can't imply anything except if each
# of its member implies a member in the other OR dependency
if ($o->isa('Dpkg::Deps::OR')) {
my $subset = 1;
foreach my $dep ($self->get_deps()) {
my $found = 0;
foreach my $odep ($o->get_deps()) {
$found = 1 if $dep->implies($odep);
}
$subset = 0 if not $found;
}
return 1 if $subset;
}
return;
}
sub get_evaluation {
my ($self, $facts) = @_;
# Returns false if all members evaluates to 0
# Returns true if at least one member evaluates to true
# Returns undef otherwise
my $result = 0;
foreach my $dep ($self->get_deps()) {
my $eval = $dep->get_evaluation($facts);
if (not defined $eval) {
$result = undef;
} elsif ($eval == 1) {
$result = 1;
last;
} elsif ($eval == 0) {
# Still possible to have a false evaluation
}
}
return $result;
}
sub simplify_deps {
my ($self, $facts) = @_;
my @new;
WHILELOOP:
while (@{$self->{list}}) {
my $dep = shift @{$self->{list}};
my $eval = $dep->get_evaluation($facts);
if (defined($eval) and $eval == 1) {
$self->{list} = [];
return;
}
foreach my $odep (@new, @{$self->{list}}) {
next WHILELOOP if $odep->implies($dep);
}
push @new, $dep;
}
$self->{list} = [ @new ];
}
package Dpkg::Deps::Union;
=head2 Dpkg::Deps::Union
This object represents a list of relationships.
=over 4
=item $union->output([$fh])
The output method uses ", " to join the list of relationships.
=item $union->implies($other_dep)
=item $union->get_evaluation($other_dep)
Those methods are not meaningful for this object and always return undef.
=item $union->simplify_deps($facts)
The simplification is done to generate an union of all the relationships.
It uses $simple_dep->merge_union($other_dep) to get its job done.
=back
=cut
use strict;
use warnings;
use parent -norequire, qw(Dpkg::Deps::Multiple);
sub output {
my ($self, $fh) = @_;
my $res = join(', ', map { $_->output() } grep { not $_->is_empty() } $self->get_deps());
if (defined($fh)) {
print { $fh } $res;
}
return $res;
}
sub implies {
# Implication test are not useful on Union
return;
}
sub get_evaluation {
# Evaluation are not useful on Union
return;
}
sub simplify_deps {
my ($self, $facts) = @_;
my @new;
WHILELOOP:
while (@{$self->{list}}) {
my $odep = shift @{$self->{list}};
foreach my $dep (@new) {
next WHILELOOP if $dep->merge_union($odep);
}
push @new, $odep;
}
$self->{list} = [ @new ];
}
package Dpkg::Deps::KnownFacts;
=head2 Dpkg::Deps::KnownFacts
This object represents a list of installed packages and a list of virtual
packages provided (by the set of installed packages).
=over 4
=item $facts = Dpkg::Deps::KnownFacts->new();
Creates a new object.
=cut
use strict;
use warnings;
use Dpkg::Version;
sub new {
my $this = shift;
my $class = ref($this) || $this;
my $self = {
pkg => {},
virtualpkg => {},
};
bless $self, $class;
return $self;
}
=item $facts->add_installed_package($package, $version, $arch, $multiarch)
Records that the given version of the package is installed. If
$version/$arch is undefined we know that the package is installed but we
don't know which version/architecture it is. $multiarch is the Multi-Arch
field of the package. If $multiarch is undef, it will be equivalent to
"Multi-Arch: no".
Note that $multiarch is only used if $arch is provided.
=cut
sub add_installed_package {
my ($self, $pkg, $ver, $arch, $multiarch) = @_;
my $p = {
package => $pkg,
version => $ver,
architecture => $arch,
multiarch => $multiarch // 'no',
};
$self->{pkg}{"$pkg:$arch"} = $p if defined $arch;
push @{$self->{pkg}{$pkg}}, $p;
}
=item $facts->add_provided_package($virtual, $relation, $version, $by)
Records that the "$by" package provides the $virtual package. $relation
and $version correspond to the associated relation given in the Provides
field (if present).
=cut
sub add_provided_package {
my ($self, $pkg, $rel, $ver, $by) = @_;
$self->{virtualpkg}{$pkg} //= [];
push @{$self->{virtualpkg}{$pkg}}, [ $by, $rel, $ver ];
}
=item ($check, $param) = $facts->check_package($package)
$check is one when the package is found. For a real package, $param
contains the version. For a virtual package, $param contains an array
reference containing the list of packages that provide it (each package is
listed as [ $provider, $relation, $version ]).
This function is obsolete and should not be used. Dpkg::Deps::KnownFacts
is only meant to be filled with data and then passed to Dpkg::Deps
methods where appropriate, but it should not be directly queried.
=back
=cut
sub check_package {
my ($self, $pkg) = @_;
warnings::warnif('deprecated', 'obsolete function, pass ' .
'Dpkg::Deps::KnownFacts to Dpkg::Deps methods instead');
if (exists $self->{pkg}{$pkg}) {
return (1, $self->{pkg}{$pkg}[0]{version});
}
if (exists $self->{virtualpkg}{$pkg}) {
return (1, $self->{virtualpkg}{$pkg});
}
return (0, undef);
}
## The functions below are private to Dpkg::Deps
sub _find_package {
my ($self, $dep, $lackinfos) = @_;
my ($pkg, $archqual) = ($dep->{package}, $dep->{archqual});
return if not exists $self->{pkg}{$pkg};
my $host_arch = $dep->{host_arch};
my $build_arch = $dep->{build_arch};
foreach my $p (@{$self->{pkg}{$pkg}}) {
my $a = $p->{architecture};
my $ma = $p->{multiarch};
if (not defined $a) {
$$lackinfos = 1;
next;
}
if (not defined $archqual) {
return $p if $ma eq 'foreign';
return $p if $a eq $host_arch or $a eq 'all';
} elsif ($archqual eq 'any') {
return $p if $ma eq 'allowed';
} elsif ($archqual eq 'native') {
return $p if $a eq $build_arch and $ma ne 'foreign';
} else {
return $p if $a eq $archqual;
}
}
return;
}
sub _find_virtual_packages {
my ($self, $pkg) = @_;
return () if not exists $self->{virtualpkg}{$pkg};
return @{$self->{virtualpkg}{$pkg}};
}
sub _evaluate_simple_dep {
my ($self, $dep) = @_;
my ($lackinfos, $pkg) = (0, $dep->{package});
my $p = $self->_find_package($dep, \$lackinfos);
if ($p) {
if (defined $dep->{relation}) {
if (defined $p->{version}) {
return 1 if version_compare_relation($p->{version},
$dep->{relation}, $dep->{version});
} else {
$lackinfos = 1;
}
} else {
return 1;
}
}
foreach my $virtpkg ($self->_find_virtual_packages($pkg)) {
next if defined $virtpkg->[1] and $virtpkg->[1] ne REL_EQ;
if (defined $dep->{relation}) {
next if not defined $virtpkg->[2];
return 1 if version_compare_relation($virtpkg->[2],
$dep->{relation},
$dep->{version});
} else {
return 1;
}
}
return if $lackinfos;
return 0;
}
=head1 CHANGES
=head2 Version 1.06 (dpkg 1.18.7; module version bumped on dpkg 1.18.24)
New option: Add tests_dep option to Dpkg::Deps::deps_parse().
=head2 Version 1.05 (dpkg 1.17.14)
New function: Dpkg::Deps::deps_iterate().
=head2 Version 1.04 (dpkg 1.17.10)
New options: Add use_profiles, build_profiles, reduce_profiles and
reduce_restrictions to Dpkg::Deps::deps_parse().
New methods: Add $dep->profile_is_concerned() and $dep->reduce_profiles()
for all dependency objects.
=head2 Version 1.03 (dpkg 1.17.0)
New option: Add build_arch option to Dpkg::Deps::deps_parse().
=head2 Version 1.02 (dpkg 1.17.0)
New function: Dpkg::Deps::deps_concat()
=head2 Version 1.01 (dpkg 1.16.1)
New method: Add $dep->reset() for all dependency objects.
New property: Dpkg::Deps::Simple now recognizes the arch qualifier "any"
and stores it in the "archqual" property when present.
New option: Dpkg::Deps::KnownFacts->add_installed_package() now accepts 2
supplementary parameters ($arch and $multiarch).
Deprecated method: Dpkg::Deps::KnownFacts->check_package() is obsolete,
it should not have been part of the public API.
=head2 Version 1.00 (dpkg 1.15.6)
Mark the module as public.
=cut
1;
|