Changelog.pm 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690
  1. # Copyright © 2005, 2007 Frank Lichtenheld <frank@lichtenheld.de>
  2. # Copyright © 2009 Raphaël Hertzog <hertzog@debian.org>
  3. #
  4. # This program is free software; you can redistribute it and/or modify
  5. # it under the terms of the GNU General Public License as published by
  6. # the Free Software Foundation; either version 2 of the License, or
  7. # (at your option) any later version.
  8. #
  9. # This program is distributed in the hope that it will be useful,
  10. # but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. # GNU General Public License for more details.
  13. #
  14. # You should have received a copy of the GNU General Public License
  15. # along with this program. If not, see <http://www.gnu.org/licenses/>.
  16. =head1 NAME
  17. Dpkg::Changelog - base class to implement a changelog parser
  18. =head1 DESCRIPTION
  19. Dpkg::Changelog is a class representing a changelog file
  20. as an array of changelog entries (Dpkg::Changelog::Entry).
  21. By deriving this object and implementing its parse method, you
  22. add the ability to fill this object with changelog entries.
  23. =head2 FUNCTIONS
  24. =cut
  25. package Dpkg::Changelog;
  26. use strict;
  27. use warnings;
  28. use Dpkg;
  29. use Dpkg::Gettext;
  30. use Dpkg::ErrorHandling qw(:DEFAULT report);
  31. use Dpkg::Control;
  32. use Dpkg::Control::Changelog;
  33. use Dpkg::Control::Fields;
  34. use Dpkg::Index;
  35. use Dpkg::Version;
  36. use Dpkg::Vendor qw(run_vendor_hook);
  37. use base qw(Dpkg::Interface::Storable);
  38. use overload
  39. '@{}' => sub { return $_[0]->{data} };
  40. =over 4
  41. =item my $c = Dpkg::Changelog->new(%options)
  42. Creates a new changelog object.
  43. =cut
  44. sub new {
  45. my ($this, %opts) = @_;
  46. my $class = ref($this) || $this;
  47. my $self = {
  48. verbose => 1,
  49. parse_errors => []
  50. };
  51. bless $self, $class;
  52. $self->set_options(%opts);
  53. return $self;
  54. }
  55. =item $c->load($filename)
  56. Parse $filename as a changelog.
  57. =cut
  58. =item $c->set_options(%opts)
  59. Change the value of some options. "verbose" (defaults to 1) defines
  60. whether parse errors are displayed as warnings by default. "reportfile"
  61. is a string to use instead of the name of the file parsed, in particular
  62. in error messages. "range" defines the range of entries that we want to
  63. parse, the parser will stop as soon as it has parsed enough data to
  64. satisfy $c->get_range($opts{'range'}).
  65. =cut
  66. sub set_options {
  67. my ($self, %opts) = @_;
  68. $self->{$_} = $opts{$_} foreach keys %opts;
  69. }
  70. =item $c->reset_parse_errors()
  71. Can be used to delete all information about errors ocurred during
  72. previous L<parse> runs.
  73. =cut
  74. sub reset_parse_errors {
  75. my ($self) = @_;
  76. $self->{parse_errors} = [];
  77. }
  78. =item $c->parse_error($line_nr, $error, [$line])
  79. Record a new parse error at line $line_nr. The error message is specified
  80. with $error and a copy of the line can be recorded in $line.
  81. =cut
  82. sub parse_error {
  83. my ($self, $file, $line_nr, $error, $line) = @_;
  84. shift;
  85. push @{$self->{parse_errors}}, [ @_ ];
  86. if ($self->{verbose}) {
  87. if ($line) {
  88. warning("%20s(l$line_nr): $error\nLINE: $line", $file);
  89. } else {
  90. warning("%20s(l$line_nr): $error", $file);
  91. }
  92. }
  93. }
  94. =item $c->get_parse_errors()
  95. Returns all error messages from the last L<parse> run.
  96. If called in scalar context returns a human readable
  97. string representation. If called in list context returns
  98. an array of arrays. Each of these arrays contains
  99. =over 4
  100. =item 1.
  101. a string describing the origin of the data (a filename usually). If the
  102. reportfile configuration option was given, its value will be used instead.
  103. =item 2.
  104. the line number where the error occurred
  105. =item 3.
  106. an error description
  107. =item 4.
  108. the original line
  109. =back
  110. =cut
  111. sub get_parse_errors {
  112. my ($self) = @_;
  113. if (wantarray) {
  114. return @{$self->{parse_errors}};
  115. } else {
  116. my $res = "";
  117. foreach my $e (@{$self->{parse_errors}}) {
  118. if ($e->[3]) {
  119. $res .= report(_g('warning'),_g("%s(l%s): %s\nLINE: %s"), @$e );
  120. } else {
  121. $res .= report(_g('warning'),_g("%s(l%s): %s"), @$e );
  122. }
  123. }
  124. return $res;
  125. }
  126. }
  127. =item $c->set_unparsed_tail($tail)
  128. Add a string representing unparsed lines after the changelog entries.
  129. Use undef as $tail to remove the unparsed lines currently set.
  130. =item $c->get_unparsed_tail()
  131. Return a string representing the unparsed lines after the changelog
  132. entries. Returns undef if there's no such thing.
  133. =cut
  134. sub set_unparsed_tail {
  135. my ($self, $tail) = @_;
  136. $self->{'unparsed_tail'} = $tail;
  137. }
  138. sub get_unparsed_tail {
  139. my ($self) = @_;
  140. return $self->{'unparsed_tail'};
  141. }
  142. =item @{$c}
  143. Returns all the Dpkg::Changelog::Entry objects contained in this changelog
  144. in the order in which they have been parsed.
  145. =item $c->get_range($range)
  146. Returns an array (if called in list context) or a reference to an array of
  147. Dpkg::Changelog::Entry objects which each represent one entry of the
  148. changelog. $range is a hash reference describing the range of entries
  149. to return. See section L<"RANGE SELECTION">.
  150. =cut
  151. sub __sanity_check_range {
  152. my ($self, $r) = @_;
  153. my $data = $self->{data};
  154. if (defined($r->{offset}) and not defined($r->{count})) {
  155. warning(_g("'offset' without 'count' has no effect")) if $self->{verbose};
  156. delete $r->{offset};
  157. }
  158. if ((defined($r->{count}) || defined($r->{offset})) &&
  159. (defined($r->{from}) || defined($r->{since}) ||
  160. defined($r->{to}) || defined($r->{'until'})))
  161. {
  162. warning(_g("you can't combine 'count' or 'offset' with any other " .
  163. "range option")) if $self->{verbose};
  164. delete $r->{from};
  165. delete $r->{since};
  166. delete $r->{to};
  167. delete $r->{'until'};
  168. }
  169. if (defined($r->{from}) && defined($r->{since})) {
  170. warning(_g("you can only specify one of 'from' and 'since', using " .
  171. "'since'")) if $self->{verbose};
  172. delete $r->{from};
  173. }
  174. if (defined($r->{to}) && defined($r->{'until'})) {
  175. warning(_g("you can only specify one of 'to' and 'until', using " .
  176. "'until'")) if $self->{verbose};
  177. delete $r->{to};
  178. }
  179. # Handle non-existing versions
  180. my (%versions, @versions);
  181. foreach my $entry (@{$data}) {
  182. $versions{$entry->get_version()->as_string()} = 1;
  183. push @versions, $entry->get_version()->as_string();
  184. }
  185. if ((defined($r->{since}) and not exists $versions{$r->{since}})) {
  186. warning(_g("'%s' option specifies non-existing version"), "since");
  187. warning(_g("use newest entry that is smaller than the one specified"));
  188. foreach my $v (@versions) {
  189. if (version_compare_relation($v, REL_LT, $r->{since})) {
  190. $r->{since} = $v;
  191. last;
  192. }
  193. }
  194. if (not exists $versions{$r->{since}}) {
  195. # No version was smaller, include all
  196. warning(_g("none found, starting from the oldest entry"));
  197. delete $r->{since};
  198. $r->{from} = $versions[-1];
  199. }
  200. }
  201. if ((defined($r->{from}) and not exists $versions{$r->{from}})) {
  202. warning(_g("'%s' option specifies non-existing version"), "from");
  203. warning(_g("use oldest entry that is bigger than the one specified"));
  204. my $oldest;
  205. foreach my $v (@versions) {
  206. if (version_compare_relation($v, REL_GT, $r->{from})) {
  207. $oldest = $v;
  208. }
  209. }
  210. if (defined($oldest)) {
  211. $r->{from} = $oldest;
  212. } else {
  213. warning(_g("no such entry found, ignoring '%s' parameter"), "from");
  214. delete $r->{from}; # No version was bigger
  215. }
  216. }
  217. if (defined($r->{'until'}) and not exists $versions{$r->{'until'}}) {
  218. warning(_g("'%s' option specifies non-existing version"), "until");
  219. warning(_g("use oldest entry that is bigger than the one specified"));
  220. my $oldest;
  221. foreach my $v (@versions) {
  222. if (version_compare_relation($v, REL_GT, $r->{'until'})) {
  223. $oldest = $v;
  224. }
  225. }
  226. if (defined($oldest)) {
  227. $r->{'until'} = $oldest;
  228. } else {
  229. warning(_g("no such entry found, ignoring '%s' parameter"), "until");
  230. delete $r->{'until'}; # No version was bigger
  231. }
  232. }
  233. if (defined($r->{to}) and not exists $versions{$r->{to}}) {
  234. warning(_g("'%s' option specifies non-existing version"), "to");
  235. warning(_g("use newest entry that is smaller than the one specified"));
  236. foreach my $v (@versions) {
  237. if (version_compare_relation($v, REL_LT, $r->{to})) {
  238. $r->{to} = $v;
  239. last;
  240. }
  241. }
  242. if (not exists $versions{$r->{to}}) {
  243. # No version was smaller
  244. warning(_g("no such entry found, ignoring '%s' parameter"), "to");
  245. delete $r->{to};
  246. }
  247. }
  248. if (defined($r->{since}) and $data->[0]->get_version() eq $r->{since}) {
  249. warning(_g("'since' option specifies most recent version, ignoring"));
  250. delete $r->{since};
  251. }
  252. if (defined($r->{'until'}) and $data->[-1]->get_version() eq $r->{'until'}) {
  253. warning(_g("'until' option specifies oldest version, ignoring"));
  254. delete $r->{'until'};
  255. }
  256. }
  257. sub get_range {
  258. my ($self, $range) = @_;
  259. $range = {} unless defined $range;
  260. my $res = $self->_data_range($range);
  261. if (defined $res) {
  262. return @$res if wantarray;
  263. return $res;
  264. } else {
  265. return () if wantarray;
  266. return undef;
  267. }
  268. }
  269. sub _data_range {
  270. my ($self, $range) = @_;
  271. my $data = $self->{data} or return undef;
  272. return [ @$data ] if $range->{all};
  273. unless (grep { m/^(since|until|from|to|count|offset)$/ } keys %$range) {
  274. return [ @$data ];
  275. }
  276. $self->__sanity_check_range($range);
  277. my ($start, $end);
  278. if (defined($range->{count})) {
  279. my $offset = $range->{offset} || 0;
  280. my $count = $range->{count};
  281. # Convert count/offset in start/end
  282. if ($offset > 0) {
  283. $offset -= ($count < 0);
  284. } elsif ($offset < 0) {
  285. $offset = $#$data + ($count > 0) + $offset;
  286. } else {
  287. $offset = $#$data if $count < 0;
  288. }
  289. $start = $end = $offset;
  290. $start += $count+1 if $count < 0;
  291. $end += $count-1 if $count > 0;
  292. # Check limits
  293. $start = 0 if $start < 0;
  294. return if $start > $#$data;
  295. $end = $#$data if $end > $#$data;
  296. return if $end < 0;
  297. $end = $start if $end < $start;
  298. return [ @{$data}[$start .. $end] ];
  299. }
  300. my @result;
  301. my $include = 1;
  302. $include = 0 if defined($range->{to}) or defined($range->{'until'});
  303. foreach (@$data) {
  304. my $v = $_->get_version();
  305. $include = 1 if defined($range->{to}) and $v eq $range->{to};
  306. last if defined($range->{since}) and $v eq $range->{since};
  307. push @result, $_ if $include;
  308. $include = 1 if defined($range->{'until'}) and $v eq $range->{'until'};
  309. last if defined($range->{from}) and $v eq $range->{from};
  310. }
  311. return \@result if scalar(@result);
  312. return undef;
  313. }
  314. =item $c->abort_early()
  315. Returns true if enough data have been parsed to be able to return all
  316. entries selected by the range set at creation (or with set_options).
  317. =cut
  318. sub abort_early {
  319. my ($self) = @_;
  320. my $data = $self->{data} or return;
  321. my $r = $self->{range} or return;
  322. my $count = $r->{count} || 0;
  323. my $offset = $r->{offset} || 0;
  324. return if $r->{all};
  325. return unless grep { m/^(since|until|from|to|count|offset)$/ } keys %$r;
  326. return if $offset < 0 or $count < 0;
  327. if (defined($r->{count})) {
  328. if ($offset > 0) {
  329. $offset -= ($count < 0);
  330. }
  331. my $start = my $end = $offset;
  332. $end += $count-1 if $count > 0;
  333. return ($start < @$data and $end < @$data);
  334. }
  335. return unless defined($r->{since}) or defined($r->{from});
  336. foreach (@$data) {
  337. my $v = $_->get_version();
  338. return 1 if defined($r->{since}) and $v eq $r->{since};
  339. return 1 if defined($r->{from}) and $v eq $r->{from};
  340. }
  341. return;
  342. }
  343. =item $c->save($filename)
  344. Save the changelog in the given file.
  345. =item $c->output()
  346. =item "$c"
  347. Returns a string representation of the changelog (it's a concatenation of
  348. the string representation of the individual changelog entries).
  349. =item $c->output($fh)
  350. Output the changelog to the given filehandle.
  351. =cut
  352. sub output {
  353. my ($self, $fh) = @_;
  354. my $str = "";
  355. foreach my $entry (@{$self}) {
  356. my $text = $entry->output();
  357. print $fh $text if defined $fh;
  358. $str .= $text if defined wantarray;
  359. }
  360. my $text = $self->get_unparsed_tail();
  361. if (defined $text) {
  362. print $fh $text if defined $fh;
  363. $str .= $text if defined wantarray;
  364. }
  365. return $str;
  366. }
  367. =item my $control = $c->dpkg($range)
  368. Returns a Dpkg::Control::Changelog object representing the entries selected
  369. by the optional range specifier (see L<"RANGE SELECTION"> for details).
  370. Returns undef in no entries are matched.
  371. The following fields are contained in the object:
  372. =over 4
  373. =item Source
  374. package name (in the first entry)
  375. =item Version
  376. packages' version (from first entry)
  377. =item Distribution
  378. target distribution (from first entry)
  379. =item Urgency
  380. urgency (highest of all printed entries)
  381. =item Maintainer
  382. person that created the (first) entry
  383. =item Date
  384. date of the (first) entry
  385. =item Closes
  386. bugs closed by the entry/entries, sorted by bug number
  387. =item Changes
  388. content of the the entry/entries
  389. =back
  390. =cut
  391. our ( @URGENCIES, %URGENCIES );
  392. BEGIN {
  393. @URGENCIES = qw(low medium high critical emergency);
  394. my $i = 1;
  395. %URGENCIES = map { $_ => $i++ } @URGENCIES;
  396. }
  397. sub dpkg {
  398. my ($self, $range) = @_;
  399. my @data = $self->get_range($range) or return undef;
  400. my $entry = shift @data;
  401. my $f = Dpkg::Control::Changelog->new();
  402. $f->{Urgency} = $entry->get_urgency() || "unknown";
  403. $f->{Source} = $entry->get_source() || "unknown";
  404. $f->{Version} = $entry->get_version() || "unknown";
  405. $f->{Distribution} = join(" ", $entry->get_distributions());
  406. $f->{Maintainer} = $entry->get_maintainer() || '';
  407. $f->{Date} = $entry->get_timestamp() || '';
  408. $f->{Changes} = $entry->get_dpkg_changes();
  409. # handle optional fields
  410. my $opts = $entry->get_optional_fields();
  411. my %closes;
  412. foreach (keys %$opts) {
  413. if (/^Urgency$/i) { # Already dealt
  414. } elsif (/^Closes$/i) {
  415. $closes{$_} = 1 foreach (split(/\s+/, $opts->{Closes}));
  416. } else {
  417. field_transfer_single($opts, $f);
  418. }
  419. }
  420. foreach $entry (@data) {
  421. my $oldurg = $f->{Urgency} || '';
  422. my $oldurgn = $URGENCIES{$f->{Urgency}} || -1;
  423. my $newurg = $entry->get_urgency() || '';
  424. my $newurgn = $URGENCIES{$newurg} || -1;
  425. $f->{Urgency} = ($newurgn > $oldurgn) ? $newurg : $oldurg;
  426. $f->{Changes} .= "\n" . $entry->get_dpkg_changes();
  427. # handle optional fields
  428. $opts = $entry->get_optional_fields();
  429. foreach (keys %$opts) {
  430. if (/^Closes$/i) {
  431. $closes{$_} = 1 foreach (split(/\s+/, $opts->{Closes}));
  432. } elsif (not exists $f->{$_}) { # Don't overwrite an existing field
  433. field_transfer_single($opts, $f);
  434. }
  435. }
  436. }
  437. if (scalar keys %closes) {
  438. $f->{Closes} = join " ", sort { $a <=> $b } keys %closes;
  439. }
  440. run_vendor_hook("post-process-changelog-entry", $f);
  441. return $f;
  442. }
  443. =item my @controls = $c->rfc822($range)
  444. Returns a Dpkg::Index containing Dpkg::Control::Changelog objects where
  445. each object represents one entry in the changelog that is part of the
  446. range requested (see L<"RANGE SELECTION"> for details). For the format of
  447. such an object see the description of the L<"dpkg"> method (while ignoring
  448. the remarks about which values are taken from the first entry).
  449. =cut
  450. sub rfc822 {
  451. my ($self, $range) = @_;
  452. my @data = $self->get_range($range) or return undef;
  453. my $index = Dpkg::Index->new(type => CTRL_CHANGELOG);
  454. foreach my $entry (@data) {
  455. my $f = Dpkg::Control::Changelog->new();
  456. $f->{Urgency} = $entry->get_urgency() || "unknown";
  457. $f->{Source} = $entry->get_source() || "unknown";
  458. $f->{Version} = $entry->get_version() || "unknown";
  459. $f->{Distribution} = join(" ", $entry->get_distributions());
  460. $f->{Maintainer} = $entry->get_maintainer() || "";
  461. $f->{Date} = $entry->get_timestamp() || "";
  462. $f->{Changes} = $entry->get_dpkg_changes();
  463. # handle optional fields
  464. my $opts = $entry->get_optional_fields();
  465. foreach (keys %$opts) {
  466. field_transfer_single($opts, $f) unless exists $f->{$_};
  467. }
  468. run_vendor_hook("post-process-changelog-entry", $f);
  469. $index->add($f);
  470. }
  471. return $index;
  472. }
  473. =back
  474. =head1 RANGE SELECTION
  475. A range selection is described by a hash reference where
  476. the allowed keys and values are described below.
  477. The following options take a version number as value.
  478. =over 4
  479. =item since
  480. Causes changelog information from all versions strictly
  481. later than B<version> to be used.
  482. =item until
  483. Causes changelog information from all versions strictly
  484. earlier than B<version> to be used.
  485. =item from
  486. Similar to C<since> but also includes the information for the
  487. specified B<version> itself.
  488. =item to
  489. Similar to C<until> but also includes the information for the
  490. specified B<version> itself.
  491. =back
  492. The following options don't take version numbers as values:
  493. =over 4
  494. =item all
  495. If set to a true value, all entries of the changelog are returned,
  496. this overrides all other options.
  497. =item count
  498. Expects a signed integer as value. Returns C<value> entries from the
  499. top of the changelog if set to a positive integer, and C<abs(value)>
  500. entries from the tail if set to a negative integer.
  501. =item offset
  502. Expects a signed integer as value. Changes the starting point for
  503. C<count>, either counted from the top (positive integer) or from
  504. the tail (negative integer). C<offset> has no effect if C<count>
  505. wasn't given as well.
  506. =back
  507. Some examples for the above options. Imagine an example changelog with
  508. entries for the versions 1.2, 1.3, 2.0, 2.1, 2.2, 3.0 and 3.1.
  509. Range Included entries
  510. C<{ since =E<gt> '2.0' }> 3.1, 3.0, 2.2
  511. C<{ until =E<gt> '2.0' }> 1.3, 1.2
  512. C<{ from =E<gt> '2.0' }> 3.1, 3.0, 2.2, 2.1, 2.0
  513. C<{ to =E<gt> '2.0' }> 2.0, 1.3, 1.2
  514. C<{ count =E<gt> 2 }> 3.1, 3.0
  515. C<{ count =E<gt> -2 }> 1.3, 1.2
  516. C<{ count =E<gt> 3, offset=E<gt> 2 }> 2.2, 2.1, 2.0
  517. C<{ count =E<gt> 2, offset=E<gt> -3 }> 2.0, 1.3
  518. C<{ count =E<gt> -2, offset=E<gt> 3 }> 3.0, 2.2
  519. C<{ count =E<gt> -2, offset=E<gt> -3 }> 2.2, 2.1
  520. Any combination of one option of C<since> and C<from> and one of
  521. C<until> and C<to> returns the intersection of the two results
  522. with only one of the options specified.
  523. =head1 AUTHOR
  524. Frank Lichtenheld, E<lt>frank@lichtenheld.deE<gt>
  525. Raphael Hertzog, E<lt>hertzog@debian.orgE<gt>
  526. =cut
  527. 1;