dpkg-mergechangelogs.pl 8.1 KB

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