dpkg-mergechangelogs.pl 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300
  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"), $Dpkg::PROGNAME, $Dpkg::PROGVERSION;
  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. "), $Dpkg::PROGNAME);
  61. }
  62. my $merge_prereleases;
  63. my @options_spec = (
  64. 'help|?' => sub { usage(); exit(0) },
  65. 'version' => sub { version(); exit(0) },
  66. 'merge-prereleases|m' => \$merge_prereleases,
  67. );
  68. {
  69. local $SIG{__WARN__} = sub { usageerr($_[0]) };
  70. GetOptions(@options_spec);
  71. }
  72. my ($old, $new_a, $new_b, $out_file) = @ARGV;
  73. unless (defined $old and defined $new_a and defined $new_b)
  74. {
  75. usageerr(_g('needs at least three arguments'));
  76. }
  77. unless (-e $old and -e $new_a and -e $new_b)
  78. {
  79. usageerr(_g('file arguments need to exist'));
  80. }
  81. my ($cho, $cha, $chb);
  82. $cho = Dpkg::Changelog::Debian->new();
  83. $cho->load($old);
  84. $cha = Dpkg::Changelog::Debian->new();
  85. $cha->load($new_a);
  86. $chb = Dpkg::Changelog::Debian->new();
  87. $chb->load($new_b);
  88. my @o = reverse @$cho;
  89. my @a = reverse @$cha;
  90. my @b = reverse @$chb;
  91. my @result; # Lines to output
  92. my $exitcode = 0; # 1 if conflict encountered
  93. unless (merge_block($cho, $cha, $chb, sub {
  94. my $tail = $_[0]->get_unparsed_tail();
  95. chomp $tail if defined $tail;
  96. return $tail;
  97. }))
  98. {
  99. merge_conflict($cha->get_unparsed_tail(), $chb->get_unparsed_tail());
  100. }
  101. while (1) {
  102. my ($o, $a, $b) = get_items_to_merge();
  103. last unless defined $o or defined $a or defined $b;
  104. next if merge_block($o, $a, $b);
  105. # We only have the usually conflicting cases left
  106. if (defined $a and defined $b) {
  107. # Same entry, merge sub-items separately for a nicer result
  108. merge_entries($o, $a, $b);
  109. } else {
  110. # Non-existing on one side, changed on the other side
  111. merge_conflict($a, $b);
  112. }
  113. }
  114. if (defined($out_file) and $out_file ne '-') {
  115. open(my $out_fh, '>', $out_file) || syserr(_g('cannot write %s'), $out_file);
  116. print $out_fh ((blessed $_) ? "$_" : "$_\n") foreach @result;
  117. close($out_fh) || syserr(_g('cannot write %s'), $out_file);
  118. } else {
  119. print ((blessed $_) ? "$_" : "$_\n") foreach @result;
  120. }
  121. exit $exitcode;
  122. # Returns the next items to merge, all items returned correspond to the
  123. # same minimal version among the 3 possible next items (undef is returned
  124. # if the next item on the given changelog is skipped)
  125. sub get_items_to_merge {
  126. my @items = (shift @o, shift @a, shift @b);
  127. my @arrays = (\@o, \@a, \@b);
  128. my $minver;
  129. foreach my $i (0 .. 2) {
  130. if (defined $minver and defined $items[$i]) {
  131. my $cmp = compare_versions($minver, $items[$i]->get_version());
  132. if ($cmp > 0) {
  133. $minver = $items[$i]->get_version();
  134. foreach my $j (0 .. $i - 1) {
  135. unshift @{$arrays[$j]}, $items[$j];
  136. $items[$j] = undef;
  137. }
  138. } elsif ($cmp < 0) {
  139. unshift @{$arrays[$i]}, $items[$i];
  140. $items[$i] = undef;
  141. }
  142. } else {
  143. $minver = $items[$i]->get_version() if defined $items[$i];
  144. }
  145. }
  146. return @items;
  147. }
  148. # Compares the versions taking into account some oddities like the fact
  149. # that we want backport/volatile versions to sort higher than the version
  150. # on which they are based.
  151. sub compare_versions {
  152. my ($a, $b) = @_;
  153. return 0 if not defined $a and not defined $b;
  154. return 1 if not defined $b;
  155. return -1 if not defined $a;
  156. $a = $a->get_version() if ref($a) and $a->isa('Dpkg::Changelog::Entry');
  157. $b = $b->get_version() if ref($b) and $b->isa('Dpkg::Changelog::Entry');
  158. # Backport and volatile are not real prereleases
  159. $a =~ s/~(bpo|vola)/+$1/;
  160. $b =~ s/~(bpo|vola)/+$1/;
  161. if ($merge_prereleases) {
  162. $a =~ s/~[^~]*$//;
  163. $b =~ s/~[^~]*$//;
  164. }
  165. $a = Dpkg::Version->new($a);
  166. $b = Dpkg::Version->new($b);
  167. return $a <=> $b;
  168. }
  169. # Merge changelog entries smartly by merging individually the different
  170. # parts constituting an entry
  171. sub merge_entries($$$) {
  172. my ($o, $a, $b) = @_;
  173. # NOTE: Only $o can be undef
  174. # Merge the trailer line
  175. unless (merge_entry_item('blank_after_trailer', $o, $a, $b)) {
  176. unshift @result, '';
  177. }
  178. unless (merge_entry_item('trailer', $o, $a, $b)) {
  179. merge_conflict($a->get_part('trailer'), $b->get_part('trailer'));
  180. }
  181. # Merge the changes
  182. unless (merge_entry_item('blank_after_changes', $o, $a, $b)) {
  183. unshift @result, '';
  184. }
  185. my @merged = merge(defined $o ? $o->get_part('changes') : [],
  186. $a->get_part('changes'), $b->get_part('changes'),
  187. {
  188. CONFLICT => sub {
  189. $exitcode = 1;
  190. return get_conflict_block($_[0], $_[1]);
  191. }
  192. });
  193. unshift @result, @merged;
  194. # Merge the header line
  195. unless (merge_entry_item('blank_after_header', $o, $a, $b)) {
  196. unshift @result, '';
  197. }
  198. unless (merge_entry_item('header', $o, $a, $b)) {
  199. merge_conflict($a->get_part('header'), $b->get_part('header'));
  200. }
  201. }
  202. sub join_lines($) {
  203. my $array = shift;
  204. return join("\n", @$array) if ref($array) eq 'ARRAY';
  205. return $array;
  206. }
  207. # Try to merge the obvious cases, return 1 on success and 0 on failure
  208. # O A B
  209. # - x x => x
  210. # o o b => b
  211. # - - b => b
  212. # o a o => a
  213. # - a - => a
  214. sub merge_block($$$;&) {
  215. my ($o, $a, $b, $preprocess) = @_;
  216. $preprocess //= \&join_lines;
  217. $o = &$preprocess($o) if defined($o);
  218. $a = &$preprocess($a) if defined($a);
  219. $b = &$preprocess($b) if defined($b);
  220. return 1 if not defined($a) and not defined($b);
  221. if (defined($a) and defined($b) and ($a eq $b)) {
  222. unshift @result, $a;
  223. } elsif ((defined($a) and defined($o) and ($a eq $o)) or
  224. (not defined($a) and not defined($o))) {
  225. unshift @result, $b if defined $b;
  226. } elsif ((defined($b) and defined($o) and ($b eq $o)) or
  227. (not defined($b) and not defined($o))) {
  228. unshift @result, $a if defined $a;
  229. } else {
  230. return 0;
  231. }
  232. return 1;
  233. }
  234. sub merge_entry_item($$$$) {
  235. my ($item, $o, $a, $b) = @_;
  236. if (blessed($o) and $o->isa('Dpkg::Changelog::Entry')) {
  237. $o = $o->get_part($item);
  238. } elsif (ref $o) {
  239. $o = $o->{$item};
  240. }
  241. if (blessed($a) and $a->isa('Dpkg::Changelog::Entry')) {
  242. $a = $a->get_part($item);
  243. } elsif (ref $a) {
  244. $a = $a->{$item};
  245. }
  246. if (blessed($b) and $b->isa('Dpkg::Changelog::Entry')) {
  247. $b = $b->get_part($item);
  248. } elsif (ref $b) {
  249. $b = $b->{$item};
  250. }
  251. return merge_block($o, $a, $b);
  252. }
  253. sub merge_conflict($$) {
  254. my ($a, $b) = @_;
  255. unshift @result, get_conflict_block($a, $b);
  256. $exitcode = 1;
  257. }
  258. sub get_conflict_block($$) {
  259. my ($a, $b) = @_;
  260. my (@a, @b);
  261. push @a, $a if defined $a;
  262. push @b, $b if defined $b;
  263. @a = @{$a} if ref($a) eq 'ARRAY';
  264. @b = @{$b} if ref($b) eq 'ARRAY';
  265. return ('<<<<<<<', @a, '=======', @b, '>>>>>>>');
  266. }