quiltify_trees_differ($userhead,$applied,1);
}
-sub quiltify ($$$) {
- my ($clogp,$target,$unapplied) = @_;
+sub quiltify ($$$$) {
+ my ($clogp,$target,$unapplied,$oldtiptree) = @_;
# Quilt patchification algorithm
#
# After traversing PT, we git commit the changes which
# should be contained within debian/patches.
- changedir '../fake';
- rmtree '.pc';
- runcmd @git, qw(add -Af .);
- my $oldtiptree=git_write_tree();
- changedir '../work';
-
# The search for the path S..T is breadth-first. We maintain a
# todo list containing search nodes. A search node identifies a
# commit, and looks something like this:
if (quilt_could_gbp($target,$unapplied,$oldtiptree)) {
print STDERR <<END;
$us: Tree looks like a patches-unapplied git branch.
-$us: Maybe you forgot --quilt=gbp (aka --quilt=apply) ?
+$us: Maybe you forgot --quilt=gbp (or --quilt=apply) ?
END
}
fail "quilt fixup naive history linearisation failed.\n".
my @files=qw(debian/source/format debian/rules
debian/control debian/changelog);
- foreach my $maybe (qw(debian/patches debian/source/options)) {
+ foreach my $maybe (qw(debian/patches debian/source/options
+ debian/tests/control)) {
next unless stat_exists "../../../$maybe";
push @files, $maybe;
}
rename '../fake/.pc','.pc' or die $!;
}
- quiltify($clogp,$headref,$unapplied);
+ changedir '../fake';
+ rmtree '.pc';
+ runcmd @git, qw(add -Af .);
+ my $oldtiptree=git_write_tree();
+ changedir '../work';
+
+ quiltify($clogp,$headref,$unapplied,$oldtiptree);
if (!open P, '>>', ".pc/applied-patches") {
$!==&ENOENT or die $!;