Changelog.pm 18 KB

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