dpkg-mergechangelogs.pl 8.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292
  1. #!/usr/bin/perl
  2. # Copyright © 2009-2010 Raphaël Hertzog <hertzog@debian.org>
  3. # Copyright © 2012 Guillem Jover <guillem@debian.org>
  4. #
  5. # This program is free software; you can redistribute it and/or modify
  6. # it under the terms of the GNU General Public License as published by
  7. # the Free Software Foundation; either version 2 of the License, or
  8. # (at your option) any later version.
  9. #
  10. # This program is distributed in the hope that it will be useful,
  11. # but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. # GNU General Public License for more details.
  14. #
  15. # You should have received a copy of the GNU General Public License
  16. # along with this program. If not, see <http://www.gnu.org/licenses/>.
  17. use warnings;
  18. use strict;
  19. use Dpkg;
  20. use Dpkg::Changelog::Debian;
  21. use Dpkg::ErrorHandling;
  22. use Dpkg::Gettext;
  23. use Dpkg::Version;
  24. use Getopt::Long qw(:config posix_default bundling no_ignorecase);
  25. use Scalar::Util qw(blessed);
  26. textdomain("dpkg-dev");
  27. sub merge_entries($$$);
  28. sub merge_block($$$;&);
  29. sub merge_entry_item($$$$);
  30. sub merge_conflict($$);
  31. sub get_conflict_block($$);
  32. sub join_lines($);
  33. BEGIN {
  34. eval 'use Algorithm::Merge qw(merge);';
  35. if ($@) {
  36. eval q{
  37. sub merge {
  38. my ($o, $a, $b) = @_;
  39. return @$a if join("\n", @$a) eq join("\n", @$b);
  40. return get_conflict_block($a, $b);
  41. }
  42. };
  43. }
  44. }
  45. sub version {
  46. printf _g("Debian %s version %s.\n"), $progname, $version;
  47. printf "\n" . _g(
  48. "This is free software; see the GNU General Public License version 2 or
  49. later for copying conditions. There is NO warranty.
  50. ");
  51. }
  52. sub usage {
  53. printf(_g(
  54. "Usage: %s [<option>...] <old> <new-a> <new-b> [<out>]
  55. Options:
  56. -m, --merge-prereleases merge pre-releases together, ignores everything
  57. after the last '~' in the version.
  58. -?, --help show this help message.
  59. --version show the version.
  60. "), $progname);
  61. }
  62. my $merge_prereleases;
  63. unless (GetOptions('help|?' => sub { usage(); exit(0) },
  64. 'merge-prereleases|m' => \$merge_prereleases,
  65. 'version' => sub { version(); exit(0) })) {
  66. usage();
  67. exit(2);
  68. }
  69. my ($old, $new_a, $new_b, $out_file) = @ARGV;
  70. unless (defined $old and defined $new_a and defined $new_b and
  71. -e $old and -e $new_a and -e $new_b)
  72. {
  73. usage();
  74. exit(2);
  75. }
  76. my ($cho, $cha, $chb, $res);
  77. $cho = Dpkg::Changelog::Debian->new();
  78. $cho->load($old);
  79. $cha = Dpkg::Changelog::Debian->new();
  80. $cha->load($new_a);
  81. $chb = Dpkg::Changelog::Debian->new();
  82. $chb->load($new_b);
  83. my @o = reverse @$cho;
  84. my @a = reverse @$cha;
  85. my @b = reverse @$chb;
  86. my @result; # Lines to output
  87. my $exitcode = 0; # 1 if conflict encountered
  88. unless (merge_block($cho, $cha, $chb, sub {
  89. my $tail = $_[0]->get_unparsed_tail();
  90. chomp $tail if defined $tail;
  91. return $tail;
  92. }))
  93. {
  94. merge_conflict($cha->get_unparsed_tail(), $chb->get_unparsed_tail());
  95. }
  96. while (1) {
  97. my ($o, $a, $b) = get_items_to_merge();
  98. last unless defined $o or defined $a or defined $b;
  99. next if merge_block($o, $a, $b);
  100. # We only have the usually conflicting cases left
  101. if (defined $a and defined $b) {
  102. # Same entry, merge sub-items separately for a nicer result
  103. merge_entries($o, $a, $b);
  104. } else {
  105. # Non-existing on one side, changed on the other side
  106. merge_conflict($a, $b);
  107. }
  108. }
  109. if (defined($out_file) and $out_file ne "-") {
  110. open(my $out_fh, ">", $out_file) || syserr(_g("cannot write %s"), $out_file);
  111. print $out_fh ((blessed $_) ? "$_" : "$_\n") foreach @result;
  112. close($out_fh) || syserr(_g("cannot write %s"), $out_file);
  113. } else {
  114. print ((blessed $_) ? "$_" : "$_\n") foreach @result;
  115. }
  116. exit $exitcode;
  117. # Returns the next items to merge, all items returned correspond to the
  118. # same minimal version among the 3 possible next items (undef is returned
  119. # if the next item on the given changelog is skipped)
  120. sub get_items_to_merge {
  121. my @items = (shift @o, shift @a, shift @b);
  122. my @arrays = (\@o, \@a, \@b);
  123. my $minver;
  124. foreach my $i (0 .. 2) {
  125. if (defined $minver and defined $items[$i]) {
  126. my $cmp = compare_versions($minver, $items[$i]->get_version());
  127. if ($cmp > 0) {
  128. $minver = $items[$i]->get_version();
  129. foreach my $j (0 .. $i - 1) {
  130. unshift @{$arrays[$j]}, $items[$j];
  131. $items[$j] = undef;
  132. }
  133. } elsif ($cmp < 0) {
  134. unshift @{$arrays[$i]}, $items[$i];
  135. $items[$i] = undef;
  136. }
  137. } else {
  138. $minver = $items[$i]->get_version() if defined $items[$i];
  139. }
  140. }
  141. return @items;
  142. }
  143. # Compares the versions taking into account some oddities like the fact
  144. # that we want backport/volatile versions to sort higher than the version
  145. # on which they are based.
  146. sub compare_versions {
  147. my ($a, $b) = @_;
  148. return 0 if not defined $a and not defined $b;
  149. return 1 if not defined $b;
  150. return -1 if not defined $a;
  151. $a = $a->get_version() if ref($a) and $a->isa("Dpkg::Changelog::Entry");
  152. $b = $b->get_version() if ref($b) and $b->isa("Dpkg::Changelog::Entry");
  153. # Backport and volatile are not real prereleases
  154. $a =~ s/~(bpo|vola)/+$1/;
  155. $b =~ s/~(bpo|vola)/+$1/;
  156. if ($merge_prereleases) {
  157. $a =~ s/~[^~]*$//;
  158. $b =~ s/~[^~]*$//;
  159. }
  160. $a = Dpkg::Version->new($a);
  161. $b = Dpkg::Version->new($b);
  162. return $a <=> $b;
  163. }
  164. # Merge changelog entries smartly by merging individually the different
  165. # parts constituting an entry
  166. sub merge_entries($$$) {
  167. my ($o, $a, $b) = @_;
  168. # NOTE: Only $o can be undef
  169. # Merge the trailer line
  170. unless (merge_entry_item("blank_after_trailer", $o, $a, $b)) {
  171. unshift @result, "";
  172. }
  173. unless (merge_entry_item("trailer", $o, $a, $b)) {
  174. merge_conflict($a->get_part('trailer'), $b->get_part('trailer'));
  175. }
  176. # Merge the changes
  177. unless (merge_entry_item("blank_after_changes", $o, $a, $b)) {
  178. unshift @result, "";
  179. }
  180. my @merged = merge(defined $o ? $o->get_part('changes') : [],
  181. $a->get_part('changes'), $b->get_part('changes'),
  182. {
  183. CONFLICT => sub {
  184. $exitcode = 1;
  185. return get_conflict_block($_[0], $_[1]);
  186. }
  187. });
  188. unshift @result, @merged;
  189. # Merge the header line
  190. unless (merge_entry_item("blank_after_header", $o, $a, $b)) {
  191. unshift @result, "";
  192. }
  193. unless (merge_entry_item("header", $o, $a, $b)) {
  194. merge_conflict($a->get_part('header'), $b->get_part('header'));
  195. }
  196. }
  197. sub join_lines($) {
  198. my $array = shift;
  199. return join("\n", @$array) if ref($array) eq "ARRAY";
  200. return $array;
  201. }
  202. # Try to merge the obvious cases, return 1 on success and 0 on failure
  203. # O A B
  204. # - x x => x
  205. # o o b => b
  206. # - - b => b
  207. # o a o => a
  208. # - a - => a
  209. sub merge_block($$$;&) {
  210. my ($o, $a, $b, $preprocess) = @_;
  211. $preprocess = \&join_lines unless defined $preprocess;
  212. $o = &$preprocess($o) if defined($o);
  213. $a = &$preprocess($a) if defined($a);
  214. $b = &$preprocess($b) if defined($b);
  215. return 1 if not defined($a) and not defined($b);
  216. if (defined($a) and defined($b) and ($a eq $b)) {
  217. unshift @result, $a;
  218. } elsif ((defined($a) and defined($o) and ($a eq $o)) or
  219. (not defined($a) and not defined($o))) {
  220. unshift @result, $b if defined $b;
  221. } elsif ((defined($b) and defined($o) and ($b eq $o)) or
  222. (not defined($b) and not defined($o))) {
  223. unshift @result, $a if defined $a;
  224. } else {
  225. return 0;
  226. }
  227. return 1;
  228. }
  229. sub merge_entry_item($$$$) {
  230. my ($item, $o, $a, $b) = @_;
  231. if (blessed($o) and $o->isa('Dpkg::Changelog::Entry')) {
  232. $o = $o->get_part($item);
  233. } elsif (ref $o) {
  234. $o = $o->{$item};
  235. }
  236. if (blessed($a) and $a->isa('Dpkg::Changelog::Entry')) {
  237. $a = $a->get_part($item);
  238. } elsif (ref $a) {
  239. $a = $a->{$item};
  240. }
  241. if (blessed($b) and $b->isa('Dpkg::Changelog::Entry')) {
  242. $b = $b->get_part($item);
  243. } elsif (ref $b) {
  244. $b = $b->{$item};
  245. }
  246. return merge_block($o, $a, $b);
  247. }
  248. sub merge_conflict($$) {
  249. my ($a, $b) = @_;
  250. unshift @result, get_conflict_block($a, $b);
  251. $exitcode = 1;
  252. }
  253. sub get_conflict_block($$) {
  254. my ($a, $b) = @_;
  255. my (@a, @b);
  256. push @a, $a if defined $a;
  257. push @b, $b if defined $b;
  258. @a = @{$a} if ref($a) eq "ARRAY";
  259. @b = @{$b} if ref($b) eq "ARRAY";
  260. return ("<<<<<<<", @a, "=======", @b, ">>>>>>>");
  261. }