<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>briteny: britney.py Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.4.7 -->
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Packages</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li id="current"><a href="files.html"><span>Files</span></a></li>
</ul></div>
<h1>britney.py</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a><a class="code" href="namespacebritney.html">00001</a> <span class="comment">#!/usr/bin/env python2.4 # -*- coding: utf-8 -*-</span>
<a name="l00002"></a>00002
<a name="l00003"></a>00003 <span class="comment"># Copyright (C) 2001-2004 Anthony Towns <ajt@debian.org></span>
<a name="l00004"></a>00004 <span class="comment"># Andreas Barth <aba@debian.org></span>
<a name="l00005"></a>00005 <span class="comment"># Fabio Tranchitella <kobold@debian.org></span>
<a name="l00006"></a>00006
<a name="l00007"></a>00007 <span class="comment"># This program is free software; you can redistribute it and/or modify</span>
<a name="l00008"></a>00008 <span class="comment"># it under the terms of the GNU General Public License as published by</span>
<a name="l00009"></a>00009 <span class="comment"># the Free Software Foundation; either version 2 of the License, or</span>
<a name="l00010"></a>00010 <span class="comment"># (at your option) any later version.</span>
<a name="l00011"></a>00011
<a name="l00012"></a>00012 <span class="comment"># This program is distributed in the hope that it will be useful,</span>
<a name="l00013"></a>00013 <span class="comment"># but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00014"></a>00014 <span class="comment"># MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00015"></a>00015 <span class="comment"># GNU General Public License for more details.</span>
<a name="l00016"></a>00016
<a name="l00017"></a>00017 <span class="stringliteral">"""</span>
<a name="l00018"></a>00018 <span class="stringliteral">= Introdution =</span>
<a name="l00019"></a>00019 <span class="stringliteral"></span>
<a name="l00020"></a>00020 <span class="stringliteral">This is the Debian testing updater script, also known as "Britney".</span>
<a name="l00021"></a>00021 <span class="stringliteral"></span>
<a name="l00022"></a>00022 <span class="stringliteral">Packages are usually installed into the `testing' distribution after</span>
<a name="l00023"></a>00023 <span class="stringliteral">they have undergone some degree of testing in unstable. The goal of</span>
<a name="l00024"></a>00024 <span class="stringliteral">this software is to do this task in a smart way, allowing testing</span>
<a name="l00025"></a>00025 <span class="stringliteral">to be always fully installable and close to being a release candidate.</span>
<a name="l00026"></a>00026 <span class="stringliteral"></span>
<a name="l00027"></a>00027 <span class="stringliteral">Britney source code is splitted in two different but related tasks:</span>
<a name="l00028"></a>00028 <span class="stringliteral">the first one is the generation of the update excuses, while the</span>
<a name="l00029"></a>00029 <span class="stringliteral">second tries to update testing with the valid candidates; first </span>
<a name="l00030"></a>00030 <span class="stringliteral">each package alone, then larger and even larger sets of packages</span>
<a name="l00031"></a>00031 <span class="stringliteral">together. Each try is accepted if testing is not more uninstallable</span>
<a name="l00032"></a>00032 <span class="stringliteral">after the update than before.</span>
<a name="l00033"></a>00033 <span class="stringliteral"></span>
<a name="l00034"></a>00034 <span class="stringliteral">= Data Loading =</span>
<a name="l00035"></a>00035 <span class="stringliteral"></span>
<a name="l00036"></a>00036 <span class="stringliteral">In order to analyze the entire Debian distribution, Britney needs to</span>
<a name="l00037"></a>00037 <span class="stringliteral">load in memory the whole archive: this means more than 10.000 packages</span>
<a name="l00038"></a>00038 <span class="stringliteral">for twelve architectures, as well as the dependency interconnection</span>
<a name="l00039"></a>00039 <span class="stringliteral">between them. For this reason, the memory requirement for running this</span>
<a name="l00040"></a>00040 <span class="stringliteral">software are quite high and at least 1 gigabyte of RAM should be available.</span>
<a name="l00041"></a>00041 <span class="stringliteral"></span>
<a name="l00042"></a>00042 <span class="stringliteral">Britney loads the source packages from the `Sources' file and the binary</span>
<a name="l00043"></a>00043 <span class="stringliteral">packages from the `Packages_${arch}' files, where ${arch} is substituted</span>
<a name="l00044"></a>00044 <span class="stringliteral">with the supported architectures. While loading the data, the software</span>
<a name="l00045"></a>00045 <span class="stringliteral">analyze the dependencies and build a directed weighted graph in memory</span>
<a name="l00046"></a>00046 <span class="stringliteral">with all the interconnections between the packages (see Britney.read_sources</span>
<a name="l00047"></a>00047 <span class="stringliteral">and Britney.read_binaries).</span>
<a name="l00048"></a>00048 <span class="stringliteral"></span>
<a name="l00049"></a>00049 <span class="stringliteral">Other than source and binary packages, Britney loads the following data:</span>
<a name="l00050"></a>00050 <span class="stringliteral"></span>
<a name="l00051"></a>00051 <span class="stringliteral"> * Bugs, which contains the count of release-critical bugs for a given</span>
<a name="l00052"></a>00052 <span class="stringliteral"> version of a source package (see Britney.read_bugs).</span>
<a name="l00053"></a>00053 <span class="stringliteral"></span>
<a name="l00054"></a>00054 <span class="stringliteral"> * Dates, which contains the date of the upload of a given version </span>
<a name="l00055"></a>00055 <span class="stringliteral"> of a source package (see Britney.read_dates).</span>
<a name="l00056"></a>00056 <span class="stringliteral"></span>
<a name="l00057"></a>00057 <span class="stringliteral"> * Urgencies, which contains the urgency of the upload of a given</span>
<a name="l00058"></a>00058 <span class="stringliteral"> version of a source package (see Britney.read_urgencies).</span>
<a name="l00059"></a>00059 <span class="stringliteral"></span>
<a name="l00060"></a>00060 <span class="stringliteral"> * Approvals, which contains the list of approved testing-proposed-updates</span>
<a name="l00061"></a>00061 <span class="stringliteral"> packages (see Britney.read_approvals).</span>
<a name="l00062"></a>00062 <span class="stringliteral"></span>
<a name="l00063"></a>00063 <span class="stringliteral"> * Hints, which contains lists of commands which modify the standard behaviour</span>
<a name="l00064"></a>00064 <span class="stringliteral"> of Britney (see Britney.read_hints).</span>
<a name="l00065"></a>00065 <span class="stringliteral"></span>
<a name="l00066"></a>00066 <span class="stringliteral">For a more detailed explanation about the format of these files, please read</span>
<a name="l00067"></a>00067 <span class="stringliteral">the documentation of the related methods. The exact meaning of them will be</span>
<a name="l00068"></a>00068 <span class="stringliteral">instead explained in the chapter "Excuses Generation".</span>
<a name="l00069"></a>00069 <span class="stringliteral"></span>
<a name="l00070"></a>00070 <span class="stringliteral">= Excuses =</span>
<a name="l00071"></a>00071 <span class="stringliteral"></span>
<a name="l00072"></a>00072 <span class="stringliteral">An excuse is a detailed explanation of why a package can or cannot</span>
<a name="l00073"></a>00073 <span class="stringliteral">be updated in the testing distribution from a newer package in </span>
<a name="l00074"></a>00074 <span class="stringliteral">another distribution (like for example unstable). The main purpose</span>
<a name="l00075"></a>00075 <span class="stringliteral">of the excuses is to be written in an HTML file which will be </span>
<a name="l00076"></a>00076 <span class="stringliteral">published over HTTP. The maintainers will be able to parse it manually</span>
<a name="l00077"></a>00077 <span class="stringliteral">or automatically to find the explanation of why their packages have</span>
<a name="l00078"></a>00078 <span class="stringliteral">been updated or not.</span>
<a name="l00079"></a>00079 <span class="stringliteral"></span>
<a name="l00080"></a>00080 <span class="stringliteral">== Excuses generation ==</span>
<a name="l00081"></a>00081 <span class="stringliteral"></span>
<a name="l00082"></a>00082 <span class="stringliteral">These are the steps (with references to method names) that Britney</span>
<a name="l00083"></a>00083 <span class="stringliteral">does for the generation of the update excuses.</span>
<a name="l00084"></a>00084 <span class="stringliteral"></span>
<a name="l00085"></a>00085 <span class="stringliteral"> * If a source package is available in testing but it is not</span>
<a name="l00086"></a>00086 <span class="stringliteral"> present in unstable and no binary packages in unstable are</span>
<a name="l00087"></a>00087 <span class="stringliteral"> built from it, then it is marked for removal.</span>
<a name="l00088"></a>00088 <span class="stringliteral"></span>
<a name="l00089"></a>00089 <span class="stringliteral"> * Every source package in unstable and testing-proposed-updates,</span>
<a name="l00090"></a>00090 <span class="stringliteral"> if already present in testing, is checked for binary-NMUs, new</span>
<a name="l00091"></a>00091 <span class="stringliteral"> or dropped binary packages in all the supported architectures</span>
<a name="l00092"></a>00092 <span class="stringliteral"> (see Britney.should_upgrade_srcarch). The steps to detect if an</span>
<a name="l00093"></a>00093 <span class="stringliteral"> upgrade is needed are:</span>
<a name="l00094"></a>00094 <span class="stringliteral"></span>
<a name="l00095"></a>00095 <span class="stringliteral"> 1. If there is a `remove' hint for the source package, the package</span>
<a name="l00096"></a>00096 <span class="stringliteral"> is ignored: it will be removed and not updated.</span>
<a name="l00097"></a>00097 <span class="stringliteral"></span>
<a name="l00098"></a>00098 <span class="stringliteral"> 2. For every binary package build from the new source, it checks</span>
<a name="l00099"></a>00099 <span class="stringliteral"> for unsatisfied dependencies, new binary package and updated</span>
<a name="l00100"></a>00100 <span class="stringliteral"> binary package (binNMU) excluding the architecture-independent</span>
<a name="l00101"></a>00101 <span class="stringliteral"> ones and the packages not built from the same source.</span>
<a name="l00102"></a>00102 <span class="stringliteral"></span>
<a name="l00103"></a>00103 <span class="stringliteral"> 3. For every binary package build from the old source, it checks</span>
<a name="l00104"></a>00104 <span class="stringliteral"> if it is still built from the new source; if this is not true</span>
<a name="l00105"></a>00105 <span class="stringliteral"> and the package is not architecture-independent, the script</span>
<a name="l00106"></a>00106 <span class="stringliteral"> removes it from testing.</span>
<a name="l00107"></a>00107 <span class="stringliteral"></span>
<a name="l00108"></a>00108 <span class="stringliteral"> 4. Finally, if there is something worth doing (eg. a new or updated</span>
<a name="l00109"></a>00109 <span class="stringliteral"> binary package) and nothing wrong it marks the source package</span>
<a name="l00110"></a>00110 <span class="stringliteral"> as "Valid candidate", or "Not considered" if there is something</span>
<a name="l00111"></a>00111 <span class="stringliteral"> wrong which prevented the update.</span>
<a name="l00112"></a>00112 <span class="stringliteral"></span>
<a name="l00113"></a>00113 <span class="stringliteral"> * Every source package in unstable and testing-proposed-updates is</span>
<a name="l00114"></a>00114 <span class="stringliteral"> checked for upgrade (see Britney.should_upgrade_src). The steps</span>
<a name="l00115"></a>00115 <span class="stringliteral"> to detect if an upgrade is needed are:</span>
<a name="l00116"></a>00116 <span class="stringliteral"></span>
<a name="l00117"></a>00117 <span class="stringliteral"> 1. If the source package in testing is more recent the new one</span>
<a name="l00118"></a>00118 <span class="stringliteral"> is ignored.</span>
<a name="l00119"></a>00119 <span class="stringliteral"></span>
<a name="l00120"></a>00120 <span class="stringliteral"> 2. If the source package doesn't exist (is fake), which means that</span>
<a name="l00121"></a>00121 <span class="stringliteral"> a binary package refers to it but it is not present in the</span>
<a name="l00122"></a>00122 <span class="stringliteral"> `Sources' file, the new one is ignored.</span>
<a name="l00123"></a>00123 <span class="stringliteral"></span>
<a name="l00124"></a>00124 <span class="stringliteral"> 3. If the package doesn't exist in testing, the urgency of the</span>
<a name="l00125"></a>00125 <span class="stringliteral"> upload is ignored and set to the default (actually `low').</span>
<a name="l00126"></a>00126 <span class="stringliteral"></span>
<a name="l00127"></a>00127 <span class="stringliteral"> 4. If there is a `remove' hint for the source package, the package</span>
<a name="l00128"></a>00128 <span class="stringliteral"> is ignored: it will be removed and not updated.</span>
<a name="l00129"></a>00129 <span class="stringliteral"></span>
<a name="l00130"></a>00130 <span class="stringliteral"> 5. If there is a `block' hint for the source package without an</span>
<a name="l00131"></a>00131 <span class="stringliteral"> `unblock` hint or a `block-all source`, the package is ignored.</span>
<a name="l00132"></a>00132 <span class="stringliteral"></span>
<a name="l00133"></a>00133 <span class="stringliteral"> 7. If the suite is unstable, the update can go ahead only if the</span>
<a name="l00134"></a>00134 <span class="stringliteral"> upload happend more then the minimum days specified by the</span>
<a name="l00135"></a>00135 <span class="stringliteral"> urgency of the upload; if this is not true, the package is</span>
<a name="l00136"></a>00136 <span class="stringliteral"> ignored as `too-young'. Note that the urgency is sticky, meaning</span>
<a name="l00137"></a>00137 <span class="stringliteral"> that the highest urgency uploaded since the previous testing</span>
<a name="l00138"></a>00138 <span class="stringliteral"> transition is taken into account.</span>
<a name="l00139"></a>00139 <span class="stringliteral"></span>
<a name="l00140"></a>00140 <span class="stringliteral"> 8. All the architecture-dependent binary packages and the</span>
<a name="l00141"></a>00141 <span class="stringliteral"> architecture-independent ones for the `nobreakall' architectures</span>
<a name="l00142"></a>00142 <span class="stringliteral"> have to be built from the source we are considering. If this is</span>
<a name="l00143"></a>00143 <span class="stringliteral"> not true, then these are called `out-of-date' architectures and</span>
<a name="l00144"></a>00144 <span class="stringliteral"> the package is ignored.</span>
<a name="l00145"></a>00145 <span class="stringliteral"></span>
<a name="l00146"></a>00146 <span class="stringliteral"> 9. The source package must have at least a binary package, otherwise</span>
<a name="l00147"></a>00147 <span class="stringliteral"> it is ignored.</span>
<a name="l00148"></a>00148 <span class="stringliteral"></span>
<a name="l00149"></a>00149 <span class="stringliteral"> 10. If the suite is unstable, the count of release critical bugs for</span>
<a name="l00150"></a>00150 <span class="stringliteral"> the new source package must be less then the count for the testing</span>
<a name="l00151"></a>00151 <span class="stringliteral"> one. If this is not true, the package is ignored as `buggy'.</span>
<a name="l00152"></a>00152 <span class="stringliteral"></span>
<a name="l00153"></a>00153 <span class="stringliteral"> 11. If there is a `force' hint for the source package, then it is</span>
<a name="l00154"></a>00154 <span class="stringliteral"> updated even if it is marked as ignored from the previous steps.</span>
<a name="l00155"></a>00155 <span class="stringliteral"></span>
<a name="l00156"></a>00156 <span class="stringliteral"> 12. If the suite is testing-proposed-updates, the source package can</span>
<a name="l00157"></a>00157 <span class="stringliteral"> be updated only if there is an explicit approval for it.</span>
<a name="l00158"></a>00158 <span class="stringliteral"></span>
<a name="l00159"></a>00159 <span class="stringliteral"> 13. If the package will be ignored, mark it as "Valid candidate",</span>
<a name="l00160"></a>00160 <span class="stringliteral"> otherwise mark it as "Not considered".</span>
<a name="l00161"></a>00161 <span class="stringliteral"></span>
<a name="l00162"></a>00162 <span class="stringliteral"> * The list of `remove' hints is processed: if the requested source</span>
<a name="l00163"></a>00163 <span class="stringliteral"> package is not already being updated or removed and the version</span>
<a name="l00164"></a>00164 <span class="stringliteral"> actually in testing is the same specified with the `remove' hint,</span>
<a name="l00165"></a>00165 <span class="stringliteral"> it is marked for removal.</span>
<a name="l00166"></a>00166 <span class="stringliteral"></span>
<a name="l00167"></a>00167 <span class="stringliteral"> * The excuses are sorted by the number of days from the last upload</span>
<a name="l00168"></a>00168 <span class="stringliteral"> (days-old) and by name.</span>
<a name="l00169"></a>00169 <span class="stringliteral"></span>
<a name="l00170"></a>00170 <span class="stringliteral"> * A list of unconsidered excuses (for which the package is not upgraded)</span>
<a name="l00171"></a>00171 <span class="stringliteral"> is built. Using this list, all the excuses depending on them is marked</span>
<a name="l00172"></a>00172 <span class="stringliteral"> as invalid for "unpossible dependency".</span>
<a name="l00173"></a>00173 <span class="stringliteral"></span>
<a name="l00174"></a>00174 <span class="stringliteral"> * The excuses are written in an HTML file.</span>
<a name="l00175"></a>00175 <span class="stringliteral">"""</span>
<a name="l00176"></a>00176
<a name="l00177"></a>00177 <span class="keyword">import</span> os
<a name="l00178"></a>00178 <span class="keyword">import</span> re
<a name="l00179"></a>00179 <span class="keyword">import</span> sys
<a name="l00180"></a>00180 <span class="keyword">import</span> string
<a name="l00181"></a>00181 <span class="keyword">import</span> time
<a name="l00182"></a>00182 <span class="keyword">import</span> copy
<a name="l00183"></a>00183 <span class="keyword">import</span> optparse
<a name="l00184"></a>00184 <span class="keyword">import</span> operator
<a name="l00185"></a>00185
<a name="l00186"></a>00186 <span class="keyword">import</span> apt_pkg
<a name="l00187"></a>00187
<a name="l00188"></a>00188 <span class="keyword">from</span> excuse <span class="keyword">import</span> Excuse
<a name="l00189"></a>00189
<a name="l00190"></a>00190 __author__ = <span class="stringliteral">'Fabio Tranchitella'</span>
<a name="l00191"></a>00191 __version__ = <span class="stringliteral">'2.0.alpha1'</span>
<a name="l00192"></a>00192
<a name="l00193"></a>00193 <span class="comment"># source package</span>
<a name="l00194"></a>00194 VERSION = 0
<a name="l00195"></a>00195 SECTION = 1
<a name="l00196"></a>00196 BINARIES = 2
<a name="l00197"></a>00197 MAINTAINER = 3
<a name="l00198"></a>00198 FAKESRC = 4
<a name="l00199"></a>00199
<a name="l00200"></a>00200 <span class="comment"># binary package</span>
<a name="l00201"></a>00201 SOURCE = 2
<a name="l00202"></a>00202 SOURCEVER = 3
<a name="l00203"></a>00203 ARCHITECTURE = 4
<a name="l00204"></a>00204 PREDEPENDS = 5
<a name="l00205"></a>00205 DEPENDS = 6
<a name="l00206"></a>00206 CONFLICTS = 7
<a name="l00207"></a>00207 PROVIDES = 8
<a name="l00208"></a>00208 RDEPENDS = 9
<a name="l00209"></a>00209 RCONFLICTS = 10
<a name="l00210"></a>00210
<a name="l00211"></a>00211
<a name="l00212"></a><a class="code" href="classbritney_1_1Britney.html">00212</a> <span class="keyword">class </span><a class="code" href="classbritney_1_1Britney.html">Britney</a>:
<a name="l00213"></a>00213 <span class="stringliteral">"""Britney, the debian testing updater script</span>
<a name="l00214"></a>00214 <span class="stringliteral"> </span>
<a name="l00215"></a><a class="code" href="classbritney_1_1Britney.html#ebbe3f40cca59e2de275b0558556ee63">00215</a> <span class="stringliteral"> This is the script that updates the testing_ distribution. It is executed</span>
<a name="l00216"></a><a class="code" href="classbritney_1_1Britney.html#a088d6fd96963f87f88c9c40cda10bfa">00216</a> <span class="stringliteral"> each day after the installation of the updated packages. It generates the </span>
<a name="l00217"></a>00217 <span class="stringliteral"> `Packages' files for the testing distribution, but it does so in an</span>
<a name="l00218"></a><a class="code" href="classbritney_1_1Britney.html#5846d81eace24f479292c47e30fd1851">00218</a> <span class="stringliteral"> intelligent manner; it try to avoid any inconsistency and to use only</span>
<a name="l00219"></a>00219 <span class="stringliteral"> non-buggy packages.</span>
<a name="l00220"></a>00220 <span class="stringliteral"></span>
<a name="l00221"></a>00221 <span class="stringliteral"> For more documentation on this script, please read the Developers Reference.</span>
<a name="l00222"></a>00222 <span class="stringliteral"> """</span>
<a name="l00223"></a>00223
<a name="l00224"></a>00224 HINTS_STANDARD = (<span class="stringliteral">"easy"</span>, <span class="stringliteral">"hint"</span>, <span class="stringliteral">"remove"</span>, <span class="stringliteral">"block"</span>, <span class="stringliteral">"unblock"</span>, <span class="stringliteral">"urgent"</span>, <span class="stringliteral">"approve"</span>)
<a name="l00225"></a>00225 HINTS_ALL = (<span class="stringliteral">"force"</span>, <span class="stringliteral">"force-hint"</span>, <span class="stringliteral">"block-all"</span>) + HINTS_STANDARD
<a name="l00226"></a>00226
<a name="l00227"></a>00227 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#5846d81eace24f479292c47e30fd1851">__init__</a>(self):
<a name="l00228"></a>00228 <span class="stringliteral">"""Class constructor</span>
<a name="l00229"></a>00229 <span class="stringliteral"></span>
<a name="l00230"></a>00230 <span class="stringliteral"> This method initializes and populates the data lists, which contain all</span>
<a name="l00231"></a>00231 <span class="stringliteral"> the information needed by the other methods of the class.</span>
<a name="l00232"></a>00232 <span class="stringliteral"> """</span>
<a name="l00233"></a>00233 self.date_now = int(((time.time() / (60*60)) - 15) / 24)
<a name="l00234"></a>00234
<a name="l00235"></a>00235 <span class="comment"># parse the command line arguments</span>
<a name="l00236"></a>00236 self.<a class="code" href="classbritney_1_1Britney.html#506f9800068902cf7cac6236b78d1dc4">__parse_arguments</a>()
<a name="l00237"></a>00237
<a name="l00238"></a>00238 <span class="comment"># initialize the apt_pkg back-end</span>
<a name="l00239"></a>00239 apt_pkg.init()
<a name="l00240"></a>00240
<a name="l00241"></a>00241 <span class="comment"># if requested, build the non-installable status and save it</span>
<a name="l00242"></a>00242 <span class="keywordflow">if</span> <span class="keywordflow">not</span> self.options.nuninst_cache:
<a name="l00243"></a>00243 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Building the list of not installable packages for the full archive"</span>, type=<span class="stringliteral">"I"</span>)
<a name="l00244"></a>00244 self.sources = {<span class="stringliteral">'testing'</span>: self.<a class="code" href="classbritney_1_1Britney.html#054f44c47f17c0c4f5a069e821b7f868">read_sources</a>(self.options.testing)}
<a name="l00245"></a>00245 nuninst = {}
<a name="l00246"></a>00246 <span class="keywordflow">for</span> arch <span class="keywordflow">in</span> self.options.architectures:
<a name="l00247"></a>00247 self.binaries = {<span class="stringliteral">'testing'</span>: {arch: self.<a class="code" href="classbritney_1_1Britney.html#1b2b0f42e4af1cee472f93e955b30421">read_binaries</a>(self.options.testing, <span class="stringliteral">"testing"</span>, arch)}}
<a name="l00248"></a>00248 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"> Checking for non-installable packages for architecture %s"</span> % arch, type=<span class="stringliteral">"I"</span>)
<a name="l00249"></a>00249 result = self.<a class="code" href="classbritney_1_1Britney.html#41c5ee0b9d64b2e76a0c1a1c2b28c73e">get_nuninst</a>(arch, build=<span class="keyword">True</span>)
<a name="l00250"></a>00250 nuninst.update(result)
<a name="l00251"></a>00251 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"> Found %d non-installable packages"</span> % len(nuninst[arch]), type=<span class="stringliteral">"I"</span>)
<a name="l00252"></a>00252 self.<a class="code" href="classbritney_1_1Britney.html#1dd8c704e1dab571e4bb62ae15f6ee52">write_nuninst</a>(nuninst)
<a name="l00253"></a>00253 <span class="keywordflow">else</span>:
<a name="l00254"></a>00254 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Not building the list of not installable packages, as requested"</span>, type=<span class="stringliteral">"I"</span>)
<a name="l00255"></a>00255
<a name="l00256"></a>00256 <span class="comment"># read the source and binary packages for the involved distributions</span>
<a name="l00257"></a>00257 self.sources = {<span class="stringliteral">'testing'</span>: self.<a class="code" href="classbritney_1_1Britney.html#054f44c47f17c0c4f5a069e821b7f868">read_sources</a>(self.options.testing),
<a name="l00258"></a>00258 <span class="stringliteral">'unstable'</span>: self.<a class="code" href="classbritney_1_1Britney.html#054f44c47f17c0c4f5a069e821b7f868">read_sources</a>(self.options.unstable),
<a name="l00259"></a>00259 <span class="stringliteral">'tpu'</span>: self.<a class="code" href="classbritney_1_1Britney.html#054f44c47f17c0c4f5a069e821b7f868">read_sources</a>(self.options.tpu),}
<a name="l00260"></a>00260 self.binaries = {<span class="stringliteral">'testing'</span>: {}, <span class="stringliteral">'unstable'</span>: {}, <span class="stringliteral">'tpu'</span>: {}}
<a name="l00261"></a>00261 <span class="keywordflow">for</span> arch <span class="keywordflow">in</span> self.options.architectures:
<a name="l00262"></a>00262 self.binaries[<span class="stringliteral">'testing'</span>][arch] = self.<a class="code" href="classbritney_1_1Britney.html#1b2b0f42e4af1cee472f93e955b30421">read_binaries</a>(self.options.testing, <span class="stringliteral">"testing"</span>, arch)
<a name="l00263"></a>00263 self.binaries[<span class="stringliteral">'unstable'</span>][arch] = self.<a class="code" href="classbritney_1_1Britney.html#1b2b0f42e4af1cee472f93e955b30421">read_binaries</a>(self.options.unstable, <span class="stringliteral">"unstable"</span>, arch)
<a name="l00264"></a>00264 self.binaries[<span class="stringliteral">'tpu'</span>][arch] = self.<a class="code" href="classbritney_1_1Britney.html#1b2b0f42e4af1cee472f93e955b30421">read_binaries</a>(self.options.tpu, <span class="stringliteral">"tpu"</span>, arch)
<a name="l00265"></a>00265
<a name="l00266"></a>00266 <span class="comment"># read the release-critical bug summaries for testing and unstable</span>
<a name="l00267"></a>00267 self.bugs = {<span class="stringliteral">'unstable'</span>: self.<a class="code" href="classbritney_1_1Britney.html#6c777aae69e7bec2efebaf23ddd4a86c">read_bugs</a>(self.options.unstable),
<a name="l00268"></a>00268 <span class="stringliteral">'testing'</span>: self.<a class="code" href="classbritney_1_1Britney.html#6c777aae69e7bec2efebaf23ddd4a86c">read_bugs</a>(self.options.testing),}
<a name="l00269"></a>00269 self.<a class="code" href="classbritney_1_1Britney.html#5a6af4a100cfd54e872a27fa7f48ac3c">normalize_bugs</a>()
<a name="l00270"></a>00270
<a name="l00271"></a>00271 <span class="comment"># read additional data</span>
<a name="l00272"></a>00272 self.dates = self.<a class="code" href="classbritney_1_1Britney.html#085af5ac906813ea40fc2e623748f517">read_dates</a>(self.options.testing)
<a name="l00273"></a>00273 self.urgencies = self.<a class="code" href="classbritney_1_1Britney.html#09fc27899506b4830b1961f125a7b6a4">read_urgencies</a>(self.options.testing)
<a name="l00274"></a>00274 self.approvals = self.<a class="code" href="classbritney_1_1Britney.html#39248f0cfea1c8798b2ca5a97d37eaf8">read_approvals</a>(self.options.tpu)
<a name="l00275"></a>00275 self.hints = self.<a class="code" href="classbritney_1_1Britney.html#46d535f617fcf1faaaf5d841ea23c184">read_hints</a>(self.options.unstable)
<a name="l00276"></a>00276 self.excuses = []
<a name="l00277"></a>00277 self.dependencies = {}
<a name="l00278"></a>00278
<a name="l00279"></a>00279 <span class="keyword">def </span>__parse_arguments(self):
<a name="l00280"></a>00280 <span class="stringliteral">"""Parse the command line arguments</span>
<a name="l00281"></a>00281 <span class="stringliteral"></span>
<a name="l00282"></a>00282 <span class="stringliteral"> This method parses and initializes the command line arguments.</span>
<a name="l00283"></a>00283 <span class="stringliteral"> While doing so, it preprocesses some of the options to be converted</span>
<a name="l00284"></a>00284 <span class="stringliteral"> in a suitable form for the other methods of the class.</span>
<a name="l00285"></a>00285 <span class="stringliteral"> """</span>
<a name="l00286"></a>00286 <span class="comment"># initialize the parser</span>
<a name="l00287"></a>00287 self.parser = optparse.OptionParser(version=<span class="stringliteral">"%prog"</span>)
<a name="l00288"></a>00288 self.parser.add_option(<span class="stringliteral">"-v"</span>, <span class="stringliteral">""</span>, action=<span class="stringliteral">"count"</span>, dest=<span class="stringliteral">"verbose"</span>, help=<span class="stringliteral">"enable verbose output"</span>)
<a name="l00289"></a>00289 self.parser.add_option(<span class="stringliteral">"-c"</span>, <span class="stringliteral">"--config"</span>, action=<span class="stringliteral">"store"</span>, dest=<span class="stringliteral">"config"</span>, default=<span class="stringliteral">"/etc/britney.conf"</span>,
<a name="l00290"></a>00290 help=<span class="stringliteral">"path for the configuration file"</span>)
<a name="l00291"></a>00291 self.parser.add_option(<span class="stringliteral">""</span>, <span class="stringliteral">"--architectures"</span>, action=<span class="stringliteral">"store"</span>, dest=<span class="stringliteral">"architectures"</span>, default=<span class="keywordtype">None</span>,
<a name="l00292"></a>00292 help=<span class="stringliteral">"override architectures from configuration file"</span>)
<a name="l00293"></a>00293 self.parser.add_option(<span class="stringliteral">""</span>, <span class="stringliteral">"--actions"</span>, action=<span class="stringliteral">"store"</span>, dest=<span class="stringliteral">"actions"</span>, default=<span class="keywordtype">None</span>,
<a name="l00294"></a>00294 help=<span class="stringliteral">"override the list of actions to be performed"</span>)
<a name="l00295"></a>00295 self.parser.add_option(<span class="stringliteral">""</span>, <span class="stringliteral">"--dry-run"</span>, action=<span class="stringliteral">"store_true"</span>, dest=<span class="stringliteral">"dry_run"</span>, default=<span class="keyword">False</span>,
<a name="l00296"></a>00296 help=<span class="stringliteral">"disable all outputs to the testing directory"</span>)
<a name="l00297"></a>00297 self.parser.add_option(<span class="stringliteral">""</span>, <span class="stringliteral">"--compatible"</span>, action=<span class="stringliteral">"store_true"</span>, dest=<span class="stringliteral">"compatible"</span>, default=<span class="keyword">False</span>,
<a name="l00298"></a>00298 help=<span class="stringliteral">"enable full compatibility with old britney's output"</span>)
<a name="l00299"></a>00299 self.parser.add_option(<span class="stringliteral">""</span>, <span class="stringliteral">"--control-files"</span>, action=<span class="stringliteral">"store_true"</span>, dest=<span class="stringliteral">"control_files"</span>, default=<span class="keyword">False</span>,
<a name="l00300"></a>00300 help=<span class="stringliteral">"enable control files generation"</span>)
<a name="l00301"></a>00301 self.parser.add_option(<span class="stringliteral">""</span>, <span class="stringliteral">"--nuninst-cache"</span>, action=<span class="stringliteral">"store_true"</span>, dest=<span class="stringliteral">"nuninst_cache"</span>, default=<span class="keyword">False</span>,
<a name="l00302"></a>00302 help=<span class="stringliteral">"do not build the non-installability status, use the cache from file"</span>)
<a name="l00303"></a>00303 (self.options, self.args) = self.parser.parse_args()
<a name="l00304"></a>00304
<a name="l00305"></a>00305 <span class="comment"># if the configuration file exists, than read it and set the additional options</span>
<a name="l00306"></a>00306 <span class="keywordflow">if</span> <span class="keywordflow">not</span> os.path.isfile(self.options.config):
<a name="l00307"></a>00307 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Unable to read the configuration file (%s), exiting!"</span> % self.options.config, type=<span class="stringliteral">"E"</span>)
<a name="l00308"></a>00308 sys.exit(1)
<a name="l00309"></a>00309
<a name="l00310"></a>00310 <span class="comment"># minimum days for unstable-testing transition and the list of hints</span>
<a name="l00311"></a>00311 <span class="comment"># are handled as an ad-hoc case</span>
<a name="l00312"></a>00312 self.MINDAYS = {}
<a name="l00313"></a>00313 self.HINTS = {}
<a name="l00314"></a>00314 <span class="keywordflow">for</span> k, v <span class="keywordflow">in</span> [map(string.strip,r.split(<span class="stringliteral">'='</span>, 1)) <span class="keywordflow">for</span> r <span class="keywordflow">in</span> file(self.options.config) <span class="keywordflow">if</span> <span class="stringliteral">'='</span> <span class="keywordflow">in</span> r <span class="keywordflow">and</span> <span class="keywordflow">not</span> r.strip().startswith(<span class="stringliteral">'#'</span>)]:
<a name="l00315"></a>00315 <span class="keywordflow">if</span> k.startswith(<span class="stringliteral">"MINDAYS_"</span>):
<a name="l00316"></a>00316 self.MINDAYS[k.split(<span class="stringliteral">"_"</span>)[1].lower()] = int(v)
<a name="l00317"></a>00317 <span class="keywordflow">elif</span> k.startswith(<span class="stringliteral">"HINTS_"</span>):
<a name="l00318"></a>00318 self.HINTS[k.split(<span class="stringliteral">"_"</span>)[1].lower()] = \
<a name="l00319"></a>00319 reduce(<span class="keyword">lambda</span> x,y: x+y, [hasattr(self, <span class="stringliteral">"HINTS_"</span> + i) <span class="keywordflow">and</span> getattr(self, <span class="stringliteral">"HINTS_"</span> + i) <span class="keywordflow">or</span> (i,) <span class="keywordflow">for</span> i <span class="keywordflow">in</span> v.split()])
<a name="l00320"></a>00320 <span class="keywordflow">elif</span> <span class="keywordflow">not</span> hasattr(self.options, k.lower()) <span class="keywordflow">or</span> \
<a name="l00321"></a>00321 <span class="keywordflow">not</span> getattr(self.options, k.lower()):
<a name="l00322"></a>00322 setattr(self.options, k.lower(), v)
<a name="l00323"></a>00323
<a name="l00324"></a>00324 <span class="comment"># Sort the architecture list</span>
<a name="l00325"></a>00325 allarches = sorted(self.options.architectures.split())
<a name="l00326"></a>00326 arches = [x <span class="keywordflow">for</span> x <span class="keywordflow">in</span> allarches <span class="keywordflow">if</span> x <span class="keywordflow">in</span> self.options.nobreakall_arches]
<a name="l00327"></a>00327 arches += [x <span class="keywordflow">for</span> x <span class="keywordflow">in</span> allarches <span class="keywordflow">if</span> x <span class="keywordflow">not</span> <span class="keywordflow">in</span> arches <span class="keywordflow">and</span> x <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.options.fucked_arches.split()]
<a name="l00328"></a>00328 arches += [x <span class="keywordflow">for</span> x <span class="keywordflow">in</span> allarches <span class="keywordflow">if</span> x <span class="keywordflow">not</span> <span class="keywordflow">in</span> arches <span class="keywordflow">and</span> x <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.options.break_arches.split()]
<a name="l00329"></a>00329 arches += [x <span class="keywordflow">for</span> x <span class="keywordflow">in</span> allarches <span class="keywordflow">if</span> x <span class="keywordflow">not</span> <span class="keywordflow">in</span> arches <span class="keywordflow">and</span> x <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.options.new_arches.split()]
<a name="l00330"></a>00330 arches += [x <span class="keywordflow">for</span> x <span class="keywordflow">in</span> allarches <span class="keywordflow">if</span> x <span class="keywordflow">not</span> <span class="keywordflow">in</span> arches]
<a name="l00331"></a>00331 self.options.architectures = arches
<a name="l00332"></a>00332 self.options.smooth_updates = self.options.smooth_updates.split()
<a name="l00333"></a>00333
<a name="l00334"></a>00334 <span class="keyword">def </span>__log(self, msg, type="I"):
<a name="l00335"></a>00335 <span class="stringliteral">"""Print info messages according to verbosity level</span>
<a name="l00336"></a>00336 <span class="stringliteral"> </span>
<a name="l00337"></a>00337 <span class="stringliteral"> An easy-and-simple log method which prints messages to the standard</span>
<a name="l00338"></a>00338 <span class="stringliteral"> output. The type parameter controls the urgency of the message, and</span>
<a name="l00339"></a>00339 <span class="stringliteral"> can be equal to `I' for `Information', `W' for `Warning' and `E' for</span>
<a name="l00340"></a><a class="code" href="classbritney_1_1Britney.html#054f44c47f17c0c4f5a069e821b7f868">00340</a> <span class="stringliteral"> `Error'. Warnings and errors are always printed, and information are</span>
<a name="l00341"></a>00341 <span class="stringliteral"> printed only if the verbose logging is enabled.</span>
<a name="l00342"></a>00342 <span class="stringliteral"> """</span>
<a name="l00343"></a>00343 <span class="keywordflow">if</span> self.options.verbose <span class="keywordflow">or</span> type <span class="keywordflow">in</span> (<span class="stringliteral">"E"</span>, <span class="stringliteral">"W"</span>):
<a name="l00344"></a>00344 <span class="keywordflow">print</span> <span class="stringliteral">"%s: [%s] - %s"</span> % (type, time.asctime(), msg)
<a name="l00345"></a>00345
<a name="l00346"></a>00346 <span class="comment"># Data reading/writing methods</span>
<a name="l00347"></a>00347 <span class="comment"># ----------------------------</span>
<a name="l00348"></a>00348
<a name="l00349"></a>00349 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#054f44c47f17c0c4f5a069e821b7f868">read_sources</a>(self, basedir):
<a name="l00350"></a>00350 <span class="stringliteral">"""Read the list of source packages from the specified directory</span>
<a name="l00351"></a>00351 <span class="stringliteral"> </span>
<a name="l00352"></a>00352 <span class="stringliteral"> The source packages are read from the `Sources' file within the</span>
<a name="l00353"></a>00353 <span class="stringliteral"> directory specified as `basedir' parameter. Considering the</span>
<a name="l00354"></a>00354 <span class="stringliteral"> large amount of memory needed, not all the fields are loaded</span>
<a name="l00355"></a>00355 <span class="stringliteral"> in memory. The available fields are Version, Maintainer and Section.</span>
<a name="l00356"></a>00356 <span class="stringliteral"></span>
<a name="l00357"></a>00357 <span class="stringliteral"> The method returns a list where every item represents a source</span>
<a name="l00358"></a>00358 <span class="stringliteral"> package as a dictionary.</span>
<a name="l00359"></a>00359 <span class="stringliteral"> """</span>
<a name="l00360"></a>00360 sources = {}
<a name="l00361"></a>00361 package = <span class="keywordtype">None</span>
<a name="l00362"></a>00362 filename = os.path.join(basedir, <span class="stringliteral">"Sources"</span>)
<a name="l00363"></a>00363 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Loading source packages from %s"</span> % filename)
<a name="l00364"></a>00364 Packages = apt_pkg.ParseTagFile(open(filename))
<a name="l00365"></a>00365 get_field = Packages.Section.get
<a name="l00366"></a>00366 <span class="keywordflow">while</span> Packages.Step():
<a name="l00367"></a><a class="code" href="classbritney_1_1Britney.html#1b2b0f42e4af1cee472f93e955b30421">00367</a> pkg = get_field(<span class="stringliteral">'Package'</span>)
<a name="l00368"></a>00368 sources[pkg] = [get_field(<span class="stringliteral">'Version'</span>),
<a name="l00369"></a>00369 get_field(<span class="stringliteral">'Section'</span>),
<a name="l00370"></a>00370 [],
<a name="l00371"></a>00371 get_field(<span class="stringliteral">'Maintainer'</span>),
<a name="l00372"></a>00372 <span class="keyword">False</span>,
<a name="l00373"></a>00373 ]
<a name="l00374"></a>00374 <span class="keywordflow">return</span> sources
<a name="l00375"></a>00375
<a name="l00376"></a>00376 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#1b2b0f42e4af1cee472f93e955b30421">read_binaries</a>(self, basedir, distribution, arch):
<a name="l00377"></a>00377 <span class="stringliteral">"""Read the list of binary packages from the specified directory</span>
<a name="l00378"></a>00378 <span class="stringliteral"> </span>
<a name="l00379"></a>00379 <span class="stringliteral"> The binary packages are read from the `Packages_${arch}' files</span>
<a name="l00380"></a>00380 <span class="stringliteral"> within the directory specified as `basedir' parameter, replacing</span>
<a name="l00381"></a>00381 <span class="stringliteral"> ${arch} with the value of the arch parameter. Considering the</span>
<a name="l00382"></a>00382 <span class="stringliteral"> large amount of memory needed, not all the fields are loaded</span>
<a name="l00383"></a>00383 <span class="stringliteral"> in memory. The available fields are Version, Source, Pre-Depends,</span>
<a name="l00384"></a>00384 <span class="stringliteral"> Depends, Conflicts, Provides and Architecture.</span>
<a name="l00385"></a>00385 <span class="stringliteral"> </span>
<a name="l00386"></a>00386 <span class="stringliteral"> After reading the packages, reverse dependencies are computed</span>
<a name="l00387"></a>00387 <span class="stringliteral"> and saved in the `rdepends' keys, and the `Provides' field is</span>
<a name="l00388"></a>00388 <span class="stringliteral"> used to populate the virtual packages list.</span>
<a name="l00389"></a>00389 <span class="stringliteral"></span>
<a name="l00390"></a>00390 <span class="stringliteral"> The dependencies are parsed with the apt.pkg.ParseDepends method,</span>
<a name="l00391"></a>00391 <span class="stringliteral"> and they are stored both as the format of its return value and</span>
<a name="l00392"></a>00392 <span class="stringliteral"> text.</span>
<a name="l00393"></a>00393 <span class="stringliteral"></span>
<a name="l00394"></a>00394 <span class="stringliteral"> The method returns a tuple. The first element is a list where</span>
<a name="l00395"></a>00395 <span class="stringliteral"> every item represents a binary package as a dictionary; the second</span>
<a name="l00396"></a>00396 <span class="stringliteral"> element is a dictionary which maps virtual packages to real</span>
<a name="l00397"></a>00397 <span class="stringliteral"> packages that provide it.</span>
<a name="l00398"></a>00398 <span class="stringliteral"> """</span>
<a name="l00399"></a>00399
<a name="l00400"></a>00400 packages = {}
<a name="l00401"></a>00401 provides = {}
<a name="l00402"></a>00402 sources = self.sources
<a name="l00403"></a>00403 package = <span class="keywordtype">None</span>
<a name="l00404"></a>00404
<a name="l00405"></a>00405 filename = os.path.join(basedir, <span class="stringliteral">"Packages_%s"</span> % arch)
<a name="l00406"></a>00406 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Loading binary packages from %s"</span> % filename)
<a name="l00407"></a>00407 Packages = apt_pkg.ParseTagFile(open(filename))
<a name="l00408"></a>00408 get_field = Packages.Section.get
<a name="l00409"></a>00409 <span class="keywordflow">while</span> Packages.Step():
<a name="l00410"></a>00410 pkg = get_field(<span class="stringliteral">'Package'</span>)
<a name="l00411"></a>00411 version = get_field(<span class="stringliteral">'Version'</span>)
<a name="l00412"></a>00412 dpkg = [version,
<a name="l00413"></a>00413 get_field(<span class="stringliteral">'Section'</span>),
<a name="l00414"></a>00414 pkg,
<a name="l00415"></a>00415 version,
<a name="l00416"></a>00416 get_field(<span class="stringliteral">'Architecture'</span>),
<a name="l00417"></a>00417 get_field(<span class="stringliteral">'Pre-Depends'</span>),
<a name="l00418"></a>00418 get_field(<span class="stringliteral">'Depends'</span>),
<a name="l00419"></a>00419 get_field(<span class="stringliteral">'Conflicts'</span>),
<a name="l00420"></a>00420 get_field(<span class="stringliteral">'Provides'</span>),
<a name="l00421"></a>00421 [],
<a name="l00422"></a>00422 [],
<a name="l00423"></a>00423 ]
<a name="l00424"></a>00424
<a name="l00425"></a>00425 <span class="comment"># retrieve the name and the version of the source package</span>
<a name="l00426"></a>00426 source = get_field(<span class="stringliteral">'Source'</span>)
<a name="l00427"></a>00427 <span class="keywordflow">if</span> source:
<a name="l00428"></a>00428 dpkg[SOURCE] = source.split(<span class="stringliteral">" "</span>)[0]
<a name="l00429"></a>00429 <span class="keywordflow">if</span> <span class="stringliteral">"("</span> <span class="keywordflow">in</span> source:
<a name="l00430"></a>00430 dpkg[SOURCEVER] = source[source.find(<span class="stringliteral">"("</span>)+1:source.find(<span class="stringliteral">")"</span>)]
<a name="l00431"></a>00431
<a name="l00432"></a>00432 <span class="comment"># if the source package is available in the distribution, then register this binary package</span>
<a name="l00433"></a>00433 <span class="keywordflow">if</span> dpkg[SOURCE] <span class="keywordflow">in</span> sources[distribution]:
<a name="l00434"></a>00434 sources[distribution][dpkg[SOURCE]][BINARIES].append(pkg + <span class="stringliteral">"/"</span> + arch)
<a name="l00435"></a>00435 <span class="comment"># if the source package doesn't exist, create a fake one</span>
<a name="l00436"></a>00436 <span class="keywordflow">else</span>:
<a name="l00437"></a>00437 sources[distribution][dpkg[SOURCE]] = [dpkg[SOURCEVER], <span class="keywordtype">None</span>, [pkg + <span class="stringliteral">"/"</span> + arch], <span class="keywordtype">None</span>, <span class="keyword">True</span>]
<a name="l00438"></a>00438
<a name="l00439"></a>00439 <span class="comment"># register virtual packages and real packages that provide them</span>
<a name="l00440"></a>00440 <span class="keywordflow">if</span> dpkg[PROVIDES]:
<a name="l00441"></a>00441 parts = map(string.strip, dpkg[PROVIDES].split(<span class="stringliteral">","</span>))
<a name="l00442"></a>00442 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> parts:
<a name="l00443"></a>00443 <span class="keywordflow">if</span> p <span class="keywordflow">not</span> <span class="keywordflow">in</span> provides:
<a name="l00444"></a>00444 provides[p] = []
<a name="l00445"></a>00445 provides[p].append(pkg)
<a name="l00446"></a>00446 dpkg[PROVIDES] = parts
<a name="l00447"></a>00447 <span class="keywordflow">else</span>: dpkg[PROVIDES] = []
<a name="l00448"></a>00448
<a name="l00449"></a>00449 <span class="comment"># add the resulting dictionary to the package list</span>
<a name="l00450"></a>00450 packages[pkg] = dpkg
<a name="l00451"></a><a class="code" href="classbritney_1_1Britney.html#f86b93b64ac43c1d04fe88a6a8b1777e">00451</a>
<a name="l00452"></a>00452 <span class="comment"># loop again on the list of packages to register reverse dependencies and conflicts</span>
<a name="l00453"></a>00453 register_reverses = self.<a class="code" href="classbritney_1_1Britney.html#f86b93b64ac43c1d04fe88a6a8b1777e">register_reverses</a>
<a name="l00454"></a>00454 <span class="keywordflow">for</span> pkg <span class="keywordflow">in</span> packages:
<a name="l00455"></a>00455 register_reverses(pkg, packages, provides, check_doubles=<span class="keyword">False</span>)
<a name="l00456"></a>00456
<a name="l00457"></a>00457 <span class="comment"># return a tuple with the list of real and virtual packages</span>
<a name="l00458"></a>00458 <span class="keywordflow">return</span> (packages, provides)
<a name="l00459"></a>00459
<a name="l00460"></a>00460 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#f86b93b64ac43c1d04fe88a6a8b1777e">register_reverses</a>(self, pkg, packages, provides, check_doubles=True, parse_depends=apt_pkg.ParseDepends):
<a name="l00461"></a>00461 <span class="stringliteral">"""Register reverse dependencies and conflicts for the specified package</span>
<a name="l00462"></a>00462 <span class="stringliteral"></span>
<a name="l00463"></a>00463 <span class="stringliteral"> This method register the reverse dependencies and conflicts for</span>
<a name="l00464"></a>00464 <span class="stringliteral"> a give package using `packages` as list of packages and `provides`</span>
<a name="l00465"></a>00465 <span class="stringliteral"> as list of virtual packages.</span>
<a name="l00466"></a>00466 <span class="stringliteral"></span>
<a name="l00467"></a>00467 <span class="stringliteral"> The method has an optional parameter parse_depends which is there</span>
<a name="l00468"></a>00468 <span class="stringliteral"> just for performance reasons and is not meant to be overwritten.</span>
<a name="l00469"></a>00469 <span class="stringliteral"> """</span>
<a name="l00470"></a>00470 <span class="comment"># register the list of the dependencies for the depending packages</span>
<a name="l00471"></a>00471 dependencies = []
<a name="l00472"></a>00472 <span class="keywordflow">if</span> packages[pkg][DEPENDS]:
<a name="l00473"></a>00473 dependencies.extend(parse_depends(packages[pkg][DEPENDS]))
<a name="l00474"></a>00474 <span class="keywordflow">if</span> packages[pkg][PREDEPENDS]:
<a name="l00475"></a>00475 dependencies.extend(parse_depends(packages[pkg][PREDEPENDS]))
<a name="l00476"></a>00476 <span class="comment"># go through the list</span>
<a name="l00477"></a>00477 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> dependencies:
<a name="l00478"></a>00478 <span class="keywordflow">for</span> a <span class="keywordflow">in</span> p:
<a name="l00479"></a>00479 <span class="comment"># register real packages</span>
<a name="l00480"></a>00480 <span class="keywordflow">if</span> a[0] <span class="keywordflow">in</span> packages <span class="keywordflow">and</span> (<span class="keywordflow">not</span> check_doubles <span class="keywordflow">or</span> pkg <span class="keywordflow">not</span> <span class="keywordflow">in</span> packages[a[0]][RDEPENDS]):
<a name="l00481"></a>00481 packages[a[0]][RDEPENDS].append(pkg)
<a name="l00482"></a>00482 <span class="comment"># register packages which provides a virtual package</span>
<a name="l00483"></a>00483 <span class="keywordflow">elif</span> a[0] <span class="keywordflow">in</span> provides:
<a name="l00484"></a>00484 <span class="keywordflow">for</span> i <span class="keywordflow">in</span> provides.get(a[0]):
<a name="l00485"></a>00485 <span class="keywordflow">if</span> i <span class="keywordflow">not</span> <span class="keywordflow">in</span> packages: <span class="keywordflow">continue</span>
<a name="l00486"></a>00486 <span class="keywordflow">if</span> <span class="keywordflow">not</span> check_doubles <span class="keywordflow">or</span> pkg <span class="keywordflow">not</span> <span class="keywordflow">in</span> packages[i][RDEPENDS]:
<a name="l00487"></a>00487 packages[i][RDEPENDS].append(pkg)
<a name="l00488"></a>00488 <span class="comment"># register the list of the conflicts for the conflicting packages</span>
<a name="l00489"></a>00489 <span class="keywordflow">if</span> packages[pkg][CONFLICTS]:
<a name="l00490"></a>00490 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> parse_depends(packages[pkg][CONFLICTS]):
<a name="l00491"></a>00491 <span class="keywordflow">for</span> a <span class="keywordflow">in</span> p:
<a name="l00492"></a>00492 <span class="comment"># register real packages</span>
<a name="l00493"></a><a class="code" href="classbritney_1_1Britney.html#6c777aae69e7bec2efebaf23ddd4a86c">00493</a> <span class="keywordflow">if</span> a[0] <span class="keywordflow">in</span> packages <span class="keywordflow">and</span> (<span class="keywordflow">not</span> check_doubles <span class="keywordflow">or</span> pkg <span class="keywordflow">not</span> <span class="keywordflow">in</span> packages[a[0]][RCONFLICTS]):
<a name="l00494"></a>00494 packages[a[0]][RCONFLICTS].append(pkg)
<a name="l00495"></a>00495 <span class="comment"># register packages which provides a virtual package</span>
<a name="l00496"></a>00496 <span class="keywordflow">elif</span> a[0] <span class="keywordflow">in</span> provides:
<a name="l00497"></a>00497 <span class="keywordflow">for</span> i <span class="keywordflow">in</span> provides[a[0]]:
<a name="l00498"></a>00498 <span class="keywordflow">if</span> i <span class="keywordflow">not</span> <span class="keywordflow">in</span> packages: <span class="keywordflow">continue</span>
<a name="l00499"></a>00499 <span class="keywordflow">if</span> <span class="keywordflow">not</span> check_doubles <span class="keywordflow">or</span> pkg <span class="keywordflow">not</span> <span class="keywordflow">in</span> packages[i][RCONFLICTS]:
<a name="l00500"></a>00500 packages[i][RCONFLICTS].append(pkg)
<a name="l00501"></a>00501
<a name="l00502"></a>00502 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#6c777aae69e7bec2efebaf23ddd4a86c">read_bugs</a>(self, basedir):
<a name="l00503"></a>00503 <span class="stringliteral">"""Read the release critial bug summary from the specified directory</span>
<a name="l00504"></a>00504 <span class="stringliteral"> </span>
<a name="l00505"></a>00505 <span class="stringliteral"> The RC bug summaries are read from the `Bugs' file within the</span>
<a name="l00506"></a>00506 <span class="stringliteral"> directory specified as `basedir' parameter. The file contains</span>
<a name="l00507"></a>00507 <span class="stringliteral"> rows with the format:</span>
<a name="l00508"></a>00508 <span class="stringliteral"></span>
<a name="l00509"></a>00509 <span class="stringliteral"> <package-name> <count-of-rc-bugs></span>
<a name="l00510"></a>00510 <span class="stringliteral"></span>
<a name="l00511"></a>00511 <span class="stringliteral"> The method returns a dictionary where the key is the binary package</span>
<a name="l00512"></a>00512 <span class="stringliteral"> name and the value is the number of open RC bugs for it.</span>
<a name="l00513"></a>00513 <span class="stringliteral"> """</span>
<a name="l00514"></a>00514 bugs = {}
<a name="l00515"></a>00515 filename = os.path.join(basedir, <span class="stringliteral">"Bugs"</span>)
<a name="l00516"></a>00516 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Loading RC bugs count from %s"</span> % filename)
<a name="l00517"></a><a class="code" href="classbritney_1_1Britney.html#0a5591fc94b89d53d12cbb8f27d100a7">00517</a> <span class="keywordflow">for</span> line <span class="keywordflow">in</span> open(filename):
<a name="l00518"></a>00518 l = line.split()
<a name="l00519"></a>00519 <span class="keywordflow">if</span> len(l) != 2: <span class="keywordflow">continue</span>
<a name="l00520"></a>00520 <span class="keywordflow">try</span>:
<a name="l00521"></a>00521 bugs[l[0]] = int(l[1])
<a name="l00522"></a>00522 <span class="keywordflow">except</span> ValueError:
<a name="l00523"></a>00523 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Bugs, unable to parse \"%s\""</span> % line, type=<span class="stringliteral">"E"</span>)
<a name="l00524"></a>00524 <span class="keywordflow">return</span> bugs
<a name="l00525"></a>00525
<a name="l00526"></a>00526 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#0a5591fc94b89d53d12cbb8f27d100a7">write_bugs</a>(self, basedir, bugs):
<a name="l00527"></a>00527 <span class="stringliteral">"""Write the release critical bug summary to the specified directory</span>
<a name="l00528"></a>00528 <span class="stringliteral"></span>
<a name="l00529"></a>00529 <span class="stringliteral"> For a more detailed explanation of the format, please check the method</span>
<a name="l00530"></a>00530 <span class="stringliteral"> read_bugs.</span>
<a name="l00531"></a>00531 <span class="stringliteral"> """</span>
<a name="l00532"></a>00532 filename = os.path.join(basedir, <span class="stringliteral">"Bugs"</span>)
<a name="l00533"></a>00533 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Writing RC bugs count to %s"</span> % filename)
<a name="l00534"></a>00534 f = open(filename, <span class="stringliteral">'w'</span>)
<a name="l00535"></a>00535 <span class="keywordflow">for</span> pkg <span class="keywordflow">in</span> sorted(bugs.keys()):
<a name="l00536"></a>00536 <span class="keywordflow">if</span> bugs[pkg] == 0: <span class="keywordflow">continue</span>
<a name="l00537"></a>00537 f.write(<span class="stringliteral">"%s %d\n"</span> % (pkg, bugs[pkg]))
<a name="l00538"></a>00538 f.close()
<a name="l00539"></a>00539
<a name="l00540"></a>00540 <span class="keyword">def </span>__maxver(self, pkg, dist):
<a name="l00541"></a>00541 <span class="stringliteral">"""Return the maximum version for a given package name</span>
<a name="l00542"></a>00542 <span class="stringliteral"> </span>
<a name="l00543"></a>00543 <span class="stringliteral"> This method returns None if the specified source package</span>
<a name="l00544"></a>00544 <span class="stringliteral"> is not available in the `dist' distribution. If the package</span>
<a name="l00545"></a>00545 <span class="stringliteral"> exists, then it returns the maximum version between the</span>
<a name="l00546"></a>00546 <span class="stringliteral"> source package and its binary packages.</span>
<a name="l00547"></a>00547 <span class="stringliteral"> """</span>
<a name="l00548"></a>00548 maxver = <span class="keywordtype">None</span>
<a name="l00549"></a><a class="code" href="classbritney_1_1Britney.html#5a6af4a100cfd54e872a27fa7f48ac3c">00549</a> <span class="keywordflow">if</span> pkg <span class="keywordflow">in</span> self.sources[dist]:
<a name="l00550"></a>00550 maxver = self.sources[dist][pkg][VERSION]
<a name="l00551"></a>00551 <span class="keywordflow">for</span> arch <span class="keywordflow">in</span> self.options.architectures:
<a name="l00552"></a>00552 <span class="keywordflow">if</span> pkg <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.binaries[dist][arch][0]: <span class="keywordflow">continue</span>
<a name="l00553"></a>00553 pkgv = self.binaries[dist][arch][0][pkg][VERSION]
<a name="l00554"></a>00554 <span class="keywordflow">if</span> maxver == <span class="keywordtype">None</span> <span class="keywordflow">or</span> apt_pkg.VersionCompare(pkgv, maxver) > 0:
<a name="l00555"></a>00555 maxver = pkgv
<a name="l00556"></a>00556 <span class="keywordflow">return</span> maxver
<a name="l00557"></a>00557
<a name="l00558"></a>00558 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#5a6af4a100cfd54e872a27fa7f48ac3c">normalize_bugs</a>(self):
<a name="l00559"></a>00559 <span class="stringliteral">"""Normalize the release critical bug summaries for testing and unstable</span>
<a name="l00560"></a>00560 <span class="stringliteral"> </span>
<a name="l00561"></a>00561 <span class="stringliteral"> The method doesn't return any value: it directly modifies the</span>
<a name="l00562"></a>00562 <span class="stringliteral"> object attribute `bugs'.</span>
<a name="l00563"></a>00563 <span class="stringliteral"> """</span>
<a name="l00564"></a>00564 <span class="comment"># loop on all the package names from testing and unstable bug summaries</span>
<a name="l00565"></a>00565 <span class="keywordflow">for</span> pkg <span class="keywordflow">in</span> set(self.bugs[<span class="stringliteral">'testing'</span>].keys() + self.bugs[<span class="stringliteral">'unstable'</span>].keys()):
<a name="l00566"></a>00566
<a name="l00567"></a>00567 <span class="comment"># make sure that the key is present in both dictionaries</span>
<a name="l00568"></a>00568 <span class="keywordflow">if</span> pkg <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.bugs[<span class="stringliteral">'testing'</span>]:
<a name="l00569"></a>00569 self.bugs[<span class="stringliteral">'testing'</span>][pkg] = 0
<a name="l00570"></a>00570 <span class="keywordflow">elif</span> pkg <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.bugs[<span class="stringliteral">'unstable'</span>]:
<a name="l00571"></a>00571 self.bugs[<span class="stringliteral">'unstable'</span>][pkg] = 0
<a name="l00572"></a>00572
<a name="l00573"></a>00573 <span class="comment"># retrieve the maximum version of the package in testing:</span>
<a name="l00574"></a>00574 maxvert = self.<a class="code" href="classbritney_1_1Britney.html#0affb1945986a52c61a4492c9732968e">__maxver</a>(pkg, <span class="stringliteral">'testing'</span>)
<a name="l00575"></a>00575
<a name="l00576"></a>00576 <span class="comment"># if the package is not available in testing or it has the</span>
<a name="l00577"></a>00577 <span class="comment"># same RC bug count, then do nothing</span>
<a name="l00578"></a>00578 <span class="keywordflow">if</span> maxvert == <span class="keywordtype">None</span> <span class="keywordflow">or</span> \
<a name="l00579"></a>00579 self.bugs[<span class="stringliteral">'testing'</span>][pkg] == self.bugs[<span class="stringliteral">'unstable'</span>][pkg]:
<a name="l00580"></a>00580 <span class="keywordflow">continue</span>
<a name="l00581"></a>00581
<a name="l00582"></a>00582 <span class="comment"># retrieve the maximum version of the package in testing:</span>
<a name="l00583"></a>00583 maxveru = self.<a class="code" href="classbritney_1_1Britney.html#0affb1945986a52c61a4492c9732968e">__maxver</a>(pkg, <span class="stringliteral">'unstable'</span>)
<a name="l00584"></a><a class="code" href="classbritney_1_1Britney.html#085af5ac906813ea40fc2e623748f517">00584</a>
<a name="l00585"></a>00585 <span class="comment"># if the package is not available in unstable, then do nothing</span>
<a name="l00586"></a>00586 <span class="keywordflow">if</span> maxveru == <span class="keywordtype">None</span>:
<a name="l00587"></a>00587 <span class="keywordflow">continue</span>
<a name="l00588"></a>00588 <span class="comment"># else if the testing package is more recent, then use the</span>
<a name="l00589"></a>00589 <span class="comment"># unstable RC bug count for testing, too</span>
<a name="l00590"></a>00590 <span class="keywordflow">elif</span> apt_pkg.VersionCompare(maxvert, maxveru) >= 0:
<a name="l00591"></a>00591 self.bugs[<span class="stringliteral">'testing'</span>][pkg] = self.bugs[<span class="stringliteral">'unstable'</span>][pkg]
<a name="l00592"></a>00592
<a name="l00593"></a>00593 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#085af5ac906813ea40fc2e623748f517">read_dates</a>(self, basedir):
<a name="l00594"></a>00594 <span class="stringliteral">"""Read the upload date for the packages from the specified directory</span>
<a name="l00595"></a>00595 <span class="stringliteral"> </span>
<a name="l00596"></a>00596 <span class="stringliteral"> The upload dates are read from the `Date' file within the directory</span>
<a name="l00597"></a>00597 <span class="stringliteral"> specified as `basedir' parameter. The file contains rows with the</span>
<a name="l00598"></a>00598 <span class="stringliteral"> format:</span>
<a name="l00599"></a>00599 <span class="stringliteral"></span>
<a name="l00600"></a>00600 <span class="stringliteral"> <package-name> <version> <date-of-upload></span>
<a name="l00601"></a>00601 <span class="stringliteral"></span>
<a name="l00602"></a>00602 <span class="stringliteral"> The dates are expressed as days starting from the 1970-01-01.</span>
<a name="l00603"></a>00603 <span class="stringliteral"></span>
<a name="l00604"></a>00604 <span class="stringliteral"> The method returns a dictionary where the key is the binary package</span>
<a name="l00605"></a>00605 <span class="stringliteral"> name and the value is tuple with two items, the version and the date.</span>
<a name="l00606"></a>00606 <span class="stringliteral"> """</span>
<a name="l00607"></a>00607 dates = {}
<a name="l00608"></a>00608 filename = os.path.join(basedir, <span class="stringliteral">"Dates"</span>)
<a name="l00609"></a>00609 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Loading upload data from %s"</span> % filename)
<a name="l00610"></a><a class="code" href="classbritney_1_1Britney.html#83e0bd993e7a099e6bf89d760183a76b">00610</a> <span class="keywordflow">for</span> line <span class="keywordflow">in</span> open(filename):
<a name="l00611"></a>00611 l = line.split()
<a name="l00612"></a>00612 <span class="keywordflow">if</span> len(l) != 3: <span class="keywordflow">continue</span>
<a name="l00613"></a>00613 <span class="keywordflow">try</span>:
<a name="l00614"></a>00614 dates[l[0]] = (l[1], int(l[2]))
<a name="l00615"></a>00615 <span class="keywordflow">except</span> ValueError:
<a name="l00616"></a>00616 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Dates, unable to parse \"%s\""</span> % line, type=<span class="stringliteral">"E"</span>)
<a name="l00617"></a>00617 <span class="keywordflow">return</span> dates
<a name="l00618"></a>00618
<a name="l00619"></a>00619 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#83e0bd993e7a099e6bf89d760183a76b">write_dates</a>(self, basedir, dates):
<a name="l00620"></a>00620 <span class="stringliteral">"""Write the upload date for the packages to the specified directory</span>
<a name="l00621"></a>00621 <span class="stringliteral"></span>
<a name="l00622"></a>00622 <span class="stringliteral"> For a more detailed explanation of the format, please check the method</span>
<a name="l00623"></a>00623 <span class="stringliteral"> read_dates.</span>
<a name="l00624"></a><a class="code" href="classbritney_1_1Britney.html#09fc27899506b4830b1961f125a7b6a4">00624</a> <span class="stringliteral"> """</span>
<a name="l00625"></a>00625 filename = os.path.join(basedir, <span class="stringliteral">"Dates"</span>)
<a name="l00626"></a>00626 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Writing upload data to %s"</span> % filename)
<a name="l00627"></a>00627 f = open(filename, <span class="stringliteral">'w'</span>)
<a name="l00628"></a>00628 <span class="keywordflow">for</span> pkg <span class="keywordflow">in</span> sorted(dates.keys()):
<a name="l00629"></a>00629 f.write(<span class="stringliteral">"%s %s %d\n"</span> % ((pkg,) + dates[pkg]))
<a name="l00630"></a>00630 f.close()
<a name="l00631"></a>00631
<a name="l00632"></a>00632
<a name="l00633"></a>00633 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#09fc27899506b4830b1961f125a7b6a4">read_urgencies</a>(self, basedir):
<a name="l00634"></a>00634 <span class="stringliteral">"""Read the upload urgency of the packages from the specified directory</span>
<a name="l00635"></a>00635 <span class="stringliteral"> </span>
<a name="l00636"></a>00636 <span class="stringliteral"> The upload urgencies are read from the `Urgency' file within the</span>
<a name="l00637"></a>00637 <span class="stringliteral"> directory specified as `basedir' parameter. The file contains rows</span>
<a name="l00638"></a>00638 <span class="stringliteral"> with the format:</span>
<a name="l00639"></a>00639 <span class="stringliteral"></span>
<a name="l00640"></a>00640 <span class="stringliteral"> <package-name> <version> <urgency></span>
<a name="l00641"></a>00641 <span class="stringliteral"></span>
<a name="l00642"></a>00642 <span class="stringliteral"> The method returns a dictionary where the key is the binary package</span>
<a name="l00643"></a>00643 <span class="stringliteral"> name and the value is the greatest urgency from the versions of the</span>
<a name="l00644"></a>00644 <span class="stringliteral"> package that are higher then the testing one.</span>
<a name="l00645"></a>00645 <span class="stringliteral"> """</span>
<a name="l00646"></a>00646
<a name="l00647"></a>00647 urgencies = {}
<a name="l00648"></a>00648 filename = os.path.join(basedir, <span class="stringliteral">"Urgency"</span>)
<a name="l00649"></a>00649 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Loading upload urgencies from %s"</span> % filename)
<a name="l00650"></a>00650 <span class="keywordflow">for</span> line <span class="keywordflow">in</span> open(filename):
<a name="l00651"></a>00651 l = line.split()
<a name="l00652"></a>00652 <span class="keywordflow">if</span> len(l) != 3: <span class="keywordflow">continue</span>
<a name="l00653"></a>00653
<a name="l00654"></a>00654 <span class="comment"># read the minimum days associated to the urgencies</span>
<a name="l00655"></a>00655 urgency_old = urgencies.get(l[0], self.options.default_urgency)
<a name="l00656"></a>00656 mindays_old = self.MINDAYS.get(urgency_old, self.MINDAYS[self.options.default_urgency])
<a name="l00657"></a>00657 mindays_new = self.MINDAYS.get(l[2], self.MINDAYS[self.options.default_urgency])
<a name="l00658"></a>00658
<a name="l00659"></a>00659 <span class="comment"># if the new urgency is lower (so the min days are higher), do nothing</span>
<a name="l00660"></a>00660 <span class="keywordflow">if</span> mindays_old <= mindays_new:
<a name="l00661"></a>00661 <span class="keywordflow">continue</span>
<a name="l00662"></a>00662
<a name="l00663"></a>00663 <span class="comment"># if the package exists in testing and it is more recent, do nothing</span>
<a name="l00664"></a>00664 tsrcv = self.sources[<span class="stringliteral">'testing'</span>].get(l[0], <span class="keywordtype">None</span>)
<a name="l00665"></a>00665 <span class="keywordflow">if</span> tsrcv <span class="keywordflow">and</span> apt_pkg.VersionCompare(tsrcv[VERSION], l[1]) >= 0:
<a name="l00666"></a>00666 <span class="keywordflow">continue</span>
<a name="l00667"></a>00667
<a name="l00668"></a>00668 <span class="comment"># if the package doesn't exist in unstable or it is older, do nothing</span>
<a name="l00669"></a><a class="code" href="classbritney_1_1Britney.html#39248f0cfea1c8798b2ca5a97d37eaf8">00669</a> usrcv = self.sources[<span class="stringliteral">'unstable'</span>].get(l[0], <span class="keywordtype">None</span>)
<a name="l00670"></a>00670 <span class="keywordflow">if</span> <span class="keywordflow">not</span> usrcv <span class="keywordflow">or</span> apt_pkg.VersionCompare(usrcv[VERSION], l[1]) < 0:
<a name="l00671"></a>00671 <span class="keywordflow">continue</span>
<a name="l00672"></a>00672
<a name="l00673"></a>00673 <span class="comment"># update the urgency for the package</span>
<a name="l00674"></a>00674 urgencies[l[0]] = l[2]
<a name="l00675"></a>00675
<a name="l00676"></a>00676 <span class="keywordflow">return</span> urgencies
<a name="l00677"></a>00677
<a name="l00678"></a>00678 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#39248f0cfea1c8798b2ca5a97d37eaf8">read_approvals</a>(self, basedir):
<a name="l00679"></a>00679 <span class="stringliteral">"""Read the approval commands from the specified directory</span>
<a name="l00680"></a>00680 <span class="stringliteral"> </span>
<a name="l00681"></a>00681 <span class="stringliteral"> The approval commands are read from the files contained by the </span>
<a name="l00682"></a>00682 <span class="stringliteral"> `Approved' directory within the directory specified as `basedir'</span>
<a name="l00683"></a>00683 <span class="stringliteral"> parameter. The name of the files has to be the same of the</span>
<a name="l00684"></a>00684 <span class="stringliteral"> authorized users for the approvals.</span>
<a name="l00685"></a>00685 <span class="stringliteral"> </span>
<a name="l00686"></a>00686 <span class="stringliteral"> The file contains rows with the format:</span>
<a name="l00687"></a>00687 <span class="stringliteral"></span>
<a name="l00688"></a>00688 <span class="stringliteral"> <package-name> <version></span>
<a name="l00689"></a>00689 <span class="stringliteral"></span>
<a name="l00690"></a>00690 <span class="stringliteral"> The method returns a dictionary where the key is the binary package</span>
<a name="l00691"></a>00691 <span class="stringliteral"> name followed by an underscore and the version number, and the value</span>
<a name="l00692"></a>00692 <span class="stringliteral"> is the user who submitted the command.</span>
<a name="l00693"></a>00693 <span class="stringliteral"> """</span>
<a name="l00694"></a>00694 approvals = {}
<a name="l00695"></a><a class="code" href="classbritney_1_1Britney.html#46d535f617fcf1faaaf5d841ea23c184">00695</a> <span class="keywordflow">for</span> approver <span class="keywordflow">in</span> self.options.approvers.split():
<a name="l00696"></a>00696 filename = os.path.join(basedir, <span class="stringliteral">"Approved"</span>, approver)
<a name="l00697"></a>00697 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Loading approvals list from %s"</span> % filename)
<a name="l00698"></a>00698 <span class="keywordflow">for</span> line <span class="keywordflow">in</span> open(filename):
<a name="l00699"></a>00699 l = line.split()
<a name="l00700"></a>00700 <span class="keywordflow">if</span> len(l) != 2: <span class="keywordflow">continue</span>
<a name="l00701"></a>00701 approvals[<span class="stringliteral">"%s_%s"</span> % (l[0], l[1])] = approver
<a name="l00702"></a>00702 <span class="keywordflow">return</span> approvals
<a name="l00703"></a>00703
<a name="l00704"></a>00704 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#46d535f617fcf1faaaf5d841ea23c184">read_hints</a>(self, basedir):
<a name="l00705"></a>00705 <span class="stringliteral">"""Read the hint commands from the specified directory</span>
<a name="l00706"></a>00706 <span class="stringliteral"> </span>
<a name="l00707"></a>00707 <span class="stringliteral"> The hint commands are read from the files contained by the `Hints'</span>
<a name="l00708"></a>00708 <span class="stringliteral"> directory within the directory specified as `basedir' parameter. </span>
<a name="l00709"></a>00709 <span class="stringliteral"> The name of the files has to be the same of the authorized users</span>
<a name="l00710"></a>00710 <span class="stringliteral"> for the hints.</span>
<a name="l00711"></a>00711 <span class="stringliteral"> </span>
<a name="l00712"></a>00712 <span class="stringliteral"> The file contains rows with the format:</span>
<a name="l00713"></a>00713 <span class="stringliteral"></span>
<a name="l00714"></a>00714 <span class="stringliteral"> <command> <package-name>[/<version>]</span>
<a name="l00715"></a>00715 <span class="stringliteral"></span>
<a name="l00716"></a>00716 <span class="stringliteral"> The method returns a dictionary where the key is the command, and</span>
<a name="l00717"></a>00717 <span class="stringliteral"> the value is the list of affected packages.</span>
<a name="l00718"></a>00718 <span class="stringliteral"> """</span>
<a name="l00719"></a>00719 hints = dict([(k,[]) <span class="keywordflow">for</span> k <span class="keywordflow">in</span> self.<a class="code" href="classbritney_1_1Britney.html#a088d6fd96963f87f88c9c40cda10bfa">HINTS_ALL</a>])
<a name="l00720"></a>00720
<a name="l00721"></a>00721 <span class="keywordflow">for</span> who <span class="keywordflow">in</span> self.HINTS.keys():
<a name="l00722"></a>00722 filename = os.path.join(basedir, <span class="stringliteral">"Hints"</span>, who)
<a name="l00723"></a>00723 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Loading hints list from %s"</span> % filename)
<a name="l00724"></a>00724 <span class="keywordflow">for</span> line <span class="keywordflow">in</span> open(filename):
<a name="l00725"></a>00725 line = line.strip()
<a name="l00726"></a>00726 <span class="keywordflow">if</span> line == <span class="stringliteral">""</span>: <span class="keywordflow">continue</span>
<a name="l00727"></a>00727 l = line.split()
<a name="l00728"></a>00728 <span class="keywordflow">if</span> l[0] == <span class="stringliteral">'finished'</span>:
<a name="l00729"></a>00729 <span class="keywordflow">break</span>
<a name="l00730"></a>00730 <span class="keywordflow">elif</span> l[0] <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.HINTS[who]:
<a name="l00731"></a>00731 <span class="keywordflow">continue</span>
<a name="l00732"></a>00732 <span class="keywordflow">elif</span> l[0] <span class="keywordflow">in</span> [<span class="stringliteral">"easy"</span>, <span class="stringliteral">"hint"</span>, <span class="stringliteral">"force-hint"</span>]:
<a name="l00733"></a>00733 hints[l[0]].append((who, [k.split(<span class="stringliteral">"/"</span>) <span class="keywordflow">for</span> k <span class="keywordflow">in</span> l <span class="keywordflow">if</span> <span class="stringliteral">"/"</span> <span class="keywordflow">in</span> k]))
<a name="l00734"></a>00734 <span class="keywordflow">elif</span> l[0] <span class="keywordflow">in</span> [<span class="stringliteral">"block-all"</span>]:
<a name="l00735"></a>00735 hints[l[0]].extend([(y, who) <span class="keywordflow">for</span> y <span class="keywordflow">in</span> l[1:]])
<a name="l00736"></a>00736 <span class="keywordflow">elif</span> l[0] <span class="keywordflow">in</span> [<span class="stringliteral">"block"</span>]:
<a name="l00737"></a>00737 hints[l[0]].extend([(y, who) <span class="keywordflow">for</span> y <span class="keywordflow">in</span> l[1:]])
<a name="l00738"></a>00738 <span class="keywordflow">elif</span> l[0] <span class="keywordflow">in</span> [<span class="stringliteral">"remove"</span>, <span class="stringliteral">"approve"</span>, <span class="stringliteral">"unblock"</span>, <span class="stringliteral">"force"</span>, <span class="stringliteral">"urgent"</span>]:
<a name="l00739"></a>00739 hints[l[0]].extend([(k.split(<span class="stringliteral">"/"</span>)[0], (k.split(<span class="stringliteral">"/"</span>)[1],who) ) <span class="keywordflow">for</span> k <span class="keywordflow">in</span> l <span class="keywordflow">if</span> <span class="stringliteral">"/"</span> <span class="keywordflow">in</span> k])
<a name="l00740"></a>00740
<a name="l00741"></a>00741 <span class="keywordflow">for</span> x <span class="keywordflow">in</span> [<span class="stringliteral">"block"</span>, <span class="stringliteral">"block-all"</span>, <span class="stringliteral">"unblock"</span>, <span class="stringliteral">"force"</span>, <span class="stringliteral">"urgent"</span>, <span class="stringliteral">"remove"</span>]:
<a name="l00742"></a><a class="code" href="classbritney_1_1Britney.html#20f846da79d595d36628c8da3195ac7a">00742</a> z = {}
<a name="l00743"></a>00743 <span class="keywordflow">for</span> a, b <span class="keywordflow">in</span> hints[x]:
<a name="l00744"></a>00744 <span class="keywordflow">if</span> a <span class="keywordflow">in</span> z:
<a name="l00745"></a>00745 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Overriding %s[%s] = %s with %s"</span> % (x, a, z[a], b), type=<span class="stringliteral">"W"</span>)
<a name="l00746"></a>00746 z[a] = b
<a name="l00747"></a>00747 hints[x] = z
<a name="l00748"></a>00748
<a name="l00749"></a>00749 <span class="keywordflow">return</span> hints
<a name="l00750"></a>00750
<a name="l00751"></a>00751 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#20f846da79d595d36628c8da3195ac7a">write_heidi</a>(self, basedir, filename):
<a name="l00752"></a>00752 <span class="stringliteral">"""Write the output HeidiResult</span>
<a name="l00753"></a>00753 <span class="stringliteral"></span>
<a name="l00754"></a>00754 <span class="stringliteral"> This method write the output for Heidi, which contains all the</span>
<a name="l00755"></a>00755 <span class="stringliteral"> binary packages and the source packages in the form:</span>
<a name="l00756"></a>00756 <span class="stringliteral"> </span>
<a name="l00757"></a>00757 <span class="stringliteral"> <pkg-name> <pkg-version> <pkg-architecture> <pkg-section></span>
<a name="l00758"></a>00758 <span class="stringliteral"> <src-name> <src-version> <src-section></span>
<a name="l00759"></a>00759 <span class="stringliteral"> """</span>
<a name="l00760"></a>00760 filename = os.path.join(basedir, filename)
<a name="l00761"></a>00761 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Writing Heidi results to %s"</span> % filename)
<a name="l00762"></a>00762 f = open(filename, <span class="stringliteral">'w'</span>)
<a name="l00763"></a>00763
<a name="l00764"></a>00764 <span class="comment"># local copies</span>
<a name="l00765"></a>00765 sources = self.sources[<span class="stringliteral">'testing'</span>]
<a name="l00766"></a>00766
<a name="l00767"></a>00767 <span class="comment"># write binary packages</span>
<a name="l00768"></a>00768 <span class="keywordflow">for</span> arch <span class="keywordflow">in</span> sorted(self.options.architectures):
<a name="l00769"></a>00769 binaries = self.binaries[<span class="stringliteral">'testing'</span>][arch][0]
<a name="l00770"></a>00770 <span class="keywordflow">for</span> pkg_name <span class="keywordflow">in</span> sorted(binaries):
<a name="l00771"></a>00771 pkg = binaries[pkg_name]
<a name="l00772"></a>00772 pkgv = pkg[VERSION]
<a name="l00773"></a>00773 pkgarch = pkg[ARCHITECTURE]
<a name="l00774"></a>00774 pkgsec = pkg[SECTION] <span class="keywordflow">or</span> <span class="stringliteral">'unknown'</span>
<a name="l00775"></a>00775 f.write(<span class="stringliteral">'%s %s %s %s\n'</span> % (pkg_name, pkgv, pkgarch, pkgsec))
<a name="l00776"></a>00776
<a name="l00777"></a><a class="code" href="classbritney_1_1Britney.html#1a3695a37b15ebd7e81cc33683fde461">00777</a> <span class="comment"># write sources</span>
<a name="l00778"></a>00778 <span class="keywordflow">for</span> src_name <span class="keywordflow">in</span> sorted(sources):
<a name="l00779"></a>00779 src = sources[src_name]
<a name="l00780"></a>00780 srcv = src[VERSION]
<a name="l00781"></a>00781 srcsec = src[FAKESRC] <span class="keywordflow">and</span> <span class="stringliteral">'faux'</span> <span class="keywordflow">or</span> src[SECTION] <span class="keywordflow">or</span> <span class="stringliteral">'unknown'</span>
<a name="l00782"></a>00782 f.write(<span class="stringliteral">'%s %s source %s\n'</span> % (src_name, srcv, srcsec))
<a name="l00783"></a>00783
<a name="l00784"></a>00784 f.close()
<a name="l00785"></a>00785
<a name="l00786"></a>00786 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#1a3695a37b15ebd7e81cc33683fde461">write_controlfiles</a>(self, basedir, suite):
<a name="l00787"></a>00787 <span class="stringliteral">"""Write the control files</span>
<a name="l00788"></a>00788 <span class="stringliteral"></span>
<a name="l00789"></a>00789 <span class="stringliteral"> This method write the control files for the binary packages of all</span>
<a name="l00790"></a>00790 <span class="stringliteral"> the architectures and for the source packages.</span>
<a name="l00791"></a>00791 <span class="stringliteral"> """</span>
<a name="l00792"></a>00792 sources = self.sources[suite]
<a name="l00793"></a>00793
<a name="l00794"></a>00794 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Writing new %s control files to %s"</span> % (suite, basedir))
<a name="l00795"></a>00795 <span class="keywordflow">for</span> arch <span class="keywordflow">in</span> self.options.architectures:
<a name="l00796"></a>00796 filename = os.path.join(basedir, <span class="stringliteral">'Packages_%s'</span> % arch)
<a name="l00797"></a>00797 f = open(filename, <span class="stringliteral">'w'</span>)
<a name="l00798"></a>00798 binaries = self.binaries[suite][arch][0]
<a name="l00799"></a>00799 <span class="keywordflow">for</span> pkg <span class="keywordflow">in</span> binaries:
<a name="l00800"></a>00800 output = <span class="stringliteral">"Package: %s\n"</span> % pkg
<a name="l00801"></a>00801 <span class="keywordflow">for</span> key, k <span class="keywordflow">in</span> ((SECTION, <span class="stringliteral">'Section'</span>), (ARCHITECTURE, <span class="stringliteral">'Architecture'</span>), (SOURCE, <span class="stringliteral">'Source'</span>), (VERSION, <span class="stringliteral">'Version'</span>),
<a name="l00802"></a>00802 (PREDEPENDS, <span class="stringliteral">'Pre-Depends'</span>), (DEPENDS, <span class="stringliteral">'Depends'</span>), (PROVIDES, <span class="stringliteral">'Provides'</span>), (CONFLICTS, <span class="stringliteral">'Conflicts'</span>)):
<a name="l00803"></a>00803 <span class="keywordflow">if</span> <span class="keywordflow">not</span> binaries[pkg][key]: <span class="keywordflow">continue</span>
<a name="l00804"></a>00804 <span class="keywordflow">if</span> key == SOURCE:
<a name="l00805"></a>00805 <span class="keywordflow">if</span> binaries[pkg][SOURCE] == pkg:
<a name="l00806"></a>00806 <span class="keywordflow">if</span> binaries[pkg][SOURCEVER] != binaries[pkg][VERSION]:
<a name="l00807"></a>00807 source = binaries[pkg][SOURCE] + <span class="stringliteral">" ("</span> + binaries[pkg][SOURCEVER] + <span class="stringliteral">")"</span>
<a name="l00808"></a>00808 <span class="keywordflow">else</span>: <span class="keywordflow">continue</span>
<a name="l00809"></a>00809 <span class="keywordflow">else</span>:
<a name="l00810"></a>00810 <span class="keywordflow">if</span> binaries[pkg][SOURCEVER] != binaries[pkg][VERSION]:
<a name="l00811"></a>00811 source = binaries[pkg][SOURCE] + <span class="stringliteral">" ("</span> + binaries[pkg][SOURCEVER] + <span class="stringliteral">")"</span>
<a name="l00812"></a>00812 <span class="keywordflow">else</span>:
<a name="l00813"></a>00813 source = binaries[pkg][SOURCE]
<a name="l00814"></a>00814 output += (k + <span class="stringliteral">": "</span> + source + <span class="stringliteral">"\n"</span>)
<a name="l00815"></a>00815 <span class="keywordflow">if</span> sources[binaries[pkg][SOURCE]][MAINTAINER]:
<a name="l00816"></a>00816 output += (k + <span class="stringliteral">": "</span> + sources[binaries[pkg][SOURCE]][MAINTAINER] + <span class="stringliteral">"\n"</span>)
<a name="l00817"></a>00817 <span class="keywordflow">elif</span> key == PROVIDES:
<a name="l00818"></a>00818 <span class="keywordflow">if</span> len(binaries[pkg][key]) > 0:
<a name="l00819"></a>00819 output += (k + <span class="stringliteral">": "</span> + <span class="stringliteral">", "</span>.join(binaries[pkg][key]) + <span class="stringliteral">"\n"</span>)
<a name="l00820"></a>00820 <span class="keywordflow">else</span>:
<a name="l00821"></a>00821 output += (k + <span class="stringliteral">": "</span> + binaries[pkg][key] + <span class="stringliteral">"\n"</span>)
<a name="l00822"></a>00822 f.write(output + <span class="stringliteral">"\n"</span>)
<a name="l00823"></a>00823 f.close()
<a name="l00824"></a>00824
<a name="l00825"></a>00825 filename = os.path.join(basedir, <span class="stringliteral">'Sources'</span>)
<a name="l00826"></a>00826 f = open(filename, <span class="stringliteral">'w'</span>)
<a name="l00827"></a><a class="code" href="classbritney_1_1Britney.html#1dd8c704e1dab571e4bb62ae15f6ee52">00827</a> <span class="keywordflow">for</span> src <span class="keywordflow">in</span> sources:
<a name="l00828"></a>00828 output = <span class="stringliteral">"Package: %s\n"</span> % src
<a name="l00829"></a>00829 <span class="keywordflow">for</span> k <span class="keywordflow">in</span> (<span class="stringliteral">'Version'</span>, <span class="stringliteral">'Section'</span>, <span class="stringliteral">'Maintainer'</span>):
<a name="l00830"></a>00830 key = k.lower()
<a name="l00831"></a>00831 <span class="keywordflow">if</span> key <span class="keywordflow">not</span> <span class="keywordflow">in</span> sources[src] <span class="keywordflow">or</span> <span class="keywordflow">not</span> sources[src][key]: <span class="keywordflow">continue</span>
<a name="l00832"></a>00832 output += (k + <span class="stringliteral">": "</span> + sources[src][key] + <span class="stringliteral">"\n"</span>)
<a name="l00833"></a>00833 f.write(output + <span class="stringliteral">"\n"</span>)
<a name="l00834"></a>00834 f.close()
<a name="l00835"></a><a class="code" href="classbritney_1_1Britney.html#24fe2c117eadac8eb783e3cb86300265">00835</a>
<a name="l00836"></a>00836 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#1dd8c704e1dab571e4bb62ae15f6ee52">write_nuninst</a>(self, nuninst):
<a name="l00837"></a>00837 <span class="stringliteral">"""Write the non-installable report"""</span>
<a name="l00838"></a>00838 f = open(self.options.noninst_status, <span class="stringliteral">'w'</span>)
<a name="l00839"></a>00839 f.write(<span class="stringliteral">"Built on: "</span> + time.strftime(<span class="stringliteral">"%Y.%m.%d %H:%M:%S %z"</span>, time.gmtime(time.time())) + <span class="stringliteral">"\n"</span>)
<a name="l00840"></a>00840 f.write(<span class="stringliteral">"Last update: "</span> + time.strftime(<span class="stringliteral">"%Y.%m.%d %H:%M:%S %z"</span>, time.gmtime(time.time())) + <span class="stringliteral">"\n\n"</span>)
<a name="l00841"></a>00841 f.write(<span class="stringliteral">""</span>.join([k + <span class="stringliteral">": "</span> + <span class="stringliteral">" "</span>.join(nuninst[k]) + <span class="stringliteral">"\n"</span> <span class="keywordflow">for</span> k <span class="keywordflow">in</span> nuninst]))
<a name="l00842"></a>00842 f.close()
<a name="l00843"></a>00843
<a name="l00844"></a>00844 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#24fe2c117eadac8eb783e3cb86300265">read_nuninst</a>(self):
<a name="l00845"></a>00845 <span class="stringliteral">"""Read the non-installable report"""</span>
<a name="l00846"></a>00846 f = open(self.options.noninst_status)
<a name="l00847"></a>00847 nuninst = {}
<a name="l00848"></a>00848 <span class="keywordflow">for</span> r <span class="keywordflow">in</span> f:
<a name="l00849"></a>00849 <span class="keywordflow">if</span> <span class="stringliteral">":"</span> <span class="keywordflow">not</span> <span class="keywordflow">in</span> r: <span class="keywordflow">continue</span>
<a name="l00850"></a><a class="code" href="classbritney_1_1Britney.html#85d2e45e8431779b62f398c34972ddf1">00850</a> arch, packages = r.strip().split(<span class="stringliteral">":"</span>, 1)
<a name="l00851"></a>00851 <span class="keywordflow">if</span> arch.split(<span class="stringliteral">"+"</span>, 1)[0] <span class="keywordflow">in</span> self.options.architectures:
<a name="l00852"></a>00852 nuninst[arch] = packages.split()
<a name="l00853"></a>00853 <span class="keywordflow">return</span> nuninst
<a name="l00854"></a>00854
<a name="l00855"></a>00855
<a name="l00856"></a>00856 <span class="comment"># Utility methods for package analysis</span>
<a name="l00857"></a>00857 <span class="comment"># ------------------------------------</span>
<a name="l00858"></a>00858
<a name="l00859"></a>00859 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#85d2e45e8431779b62f398c34972ddf1">same_source</a>(self, sv1, sv2):
<a name="l00860"></a>00860 <span class="stringliteral">"""Check if two version numbers are built from the same source</span>
<a name="l00861"></a>00861 <span class="stringliteral"></span>
<a name="l00862"></a>00862 <span class="stringliteral"> This method returns a boolean value which is true if the two</span>
<a name="l00863"></a>00863 <span class="stringliteral"> version numbers specified as parameters are built from the same</span>
<a name="l00864"></a>00864 <span class="stringliteral"> source. The main use of this code is to detect binary-NMU.</span>
<a name="l00865"></a>00865 <span class="stringliteral"> """</span>
<a name="l00866"></a>00866 <span class="keywordflow">if</span> sv1 == sv2:
<a name="l00867"></a>00867 <span class="keywordflow">return</span> 1
<a name="l00868"></a>00868
<a name="l00869"></a>00869 m = re.match(<span class="stringliteral">r'^(.*)\+b\d+$'</span>, sv1)
<a name="l00870"></a>00870 <span class="keywordflow">if</span> m: sv1 = m.group(1)
<a name="l00871"></a>00871 m = re.match(<span class="stringliteral">r'^(.*)\+b\d+$'</span>, sv2)
<a name="l00872"></a>00872 <span class="keywordflow">if</span> m: sv2 = m.group(1)
<a name="l00873"></a>00873
<a name="l00874"></a>00874 <span class="keywordflow">if</span> sv1 == sv2:
<a name="l00875"></a>00875 <span class="keywordflow">return</span> 1
<a name="l00876"></a>00876
<a name="l00877"></a>00877 <span class="keywordflow">if</span> re.search(<span class="stringliteral">"-"</span>, sv1) <span class="keywordflow">or</span> re.search(<span class="stringliteral">"-"</span>, sv2):
<a name="l00878"></a>00878 m = re.match(<span class="stringliteral">r'^(.*-[^.]+)\.0\.\d+$'</span>, sv1)
<a name="l00879"></a>00879 <span class="keywordflow">if</span> m: sv1 = m.group(1)
<a name="l00880"></a>00880 m = re.match(<span class="stringliteral">r'^(.*-[^.]+\.[^.]+)\.\d+$'</span>, sv1)
<a name="l00881"></a>00881 <span class="keywordflow">if</span> m: sv1 = m.group(1)
<a name="l00882"></a>00882
<a name="l00883"></a>00883 m = re.match(<span class="stringliteral">r'^(.*-[^.]+)\.0\.\d+$'</span>, sv2)
<a name="l00884"></a>00884 <span class="keywordflow">if</span> m: sv2 = m.group(1)
<a name="l00885"></a>00885 m = re.match(<span class="stringliteral">r'^(.*-[^.]+\.[^.]+)\.\d+$'</span>, sv2)
<a name="l00886"></a>00886 <span class="keywordflow">if</span> m: sv2 = m.group(1)
<a name="l00887"></a>00887
<a name="l00888"></a>00888 <span class="keywordflow">return</span> (sv1 == sv2)
<a name="l00889"></a><a class="code" href="classbritney_1_1Britney.html#5461f49e3e75a251ebedfd37d2a5ff0c">00889</a> <span class="keywordflow">else</span>:
<a name="l00890"></a>00890 m = re.match(<span class="stringliteral">r'^([^-]+)\.0\.\d+$'</span>, sv1)
<a name="l00891"></a>00891 <span class="keywordflow">if</span> m <span class="keywordflow">and</span> sv2 == m.group(1): <span class="keywordflow">return</span> 1
<a name="l00892"></a>00892
<a name="l00893"></a>00893 m = re.match(<span class="stringliteral">r'^([^-]+)\.0\.\d+$'</span>, sv2)
<a name="l00894"></a>00894 <span class="keywordflow">if</span> m <span class="keywordflow">and</span> sv1 == m.group(1): <span class="keywordflow">return</span> 1
<a name="l00895"></a>00895
<a name="l00896"></a>00896 <span class="keywordflow">return</span> 0
<a name="l00897"></a>00897
<a name="l00898"></a>00898 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#5461f49e3e75a251ebedfd37d2a5ff0c">get_dependency_solvers</a>(self, block, arch, distribution, excluded=[], strict=False):
<a name="l00899"></a>00899 <span class="stringliteral">"""Find the packages which satisfy a dependency block</span>
<a name="l00900"></a>00900 <span class="stringliteral"></span>
<a name="l00901"></a>00901 <span class="stringliteral"> This method returns the list of packages which satisfy a dependency</span>
<a name="l00902"></a>00902 <span class="stringliteral"> block (as returned by apt_pkg.ParseDepends) for the given architecture</span>
<a name="l00903"></a>00903 <span class="stringliteral"> and distribution.</span>
<a name="l00904"></a>00904 <span class="stringliteral"></span>
<a name="l00905"></a>00905 <span class="stringliteral"> It returns a tuple with two items: the first is a boolean which is</span>
<a name="l00906"></a>00906 <span class="stringliteral"> True if the dependency is satisfied, the second is the list of the</span>
<a name="l00907"></a>00907 <span class="stringliteral"> solving packages.</span>
<a name="l00908"></a>00908 <span class="stringliteral"> """</span>
<a name="l00909"></a>00909
<a name="l00910"></a>00910 packages = []
<a name="l00911"></a>00911
<a name="l00912"></a>00912 <span class="comment"># local copies for better performances</span>
<a name="l00913"></a>00913 binaries = self.binaries[distribution][arch]
<a name="l00914"></a>00914
<a name="l00915"></a>00915 <span class="comment"># for every package, version and operation in the block</span>
<a name="l00916"></a>00916 <span class="keywordflow">for</span> name, version, op <span class="keywordflow">in</span> block:
<a name="l00917"></a>00917 <span class="comment"># look for the package in unstable</span>
<a name="l00918"></a>00918 <span class="keywordflow">if</span> name <span class="keywordflow">not</span> <span class="keywordflow">in</span> excluded <span class="keywordflow">and</span> name <span class="keywordflow">in</span> binaries[0]:
<a name="l00919"></a>00919 package = binaries[0][name]
<a name="l00920"></a>00920 <span class="comment"># check the versioned dependency (if present)</span>
<a name="l00921"></a>00921 <span class="keywordflow">if</span> op == <span class="stringliteral">''</span> <span class="keywordflow">and</span> version == <span class="stringliteral">''</span> <span class="keywordflow">or</span> apt_pkg.CheckDep(package[VERSION], op, version):
<a name="l00922"></a>00922 packages.append(name)
<a name="l00923"></a>00923
<a name="l00924"></a>00924 <span class="comment"># look for the package in the virtual packages list and loop on them</span>
<a name="l00925"></a>00925 <span class="keywordflow">for</span> prov <span class="keywordflow">in</span> binaries[1].get(name, []):
<a name="l00926"></a>00926 <span class="keywordflow">if</span> prov <span class="keywordflow">in</span> excluded <span class="keywordflow">or</span> \
<a name="l00927"></a>00927 prov <span class="keywordflow">not</span> <span class="keywordflow">in</span> binaries[0]: <span class="keywordflow">continue</span>
<a name="l00928"></a>00928 package = binaries[0][prov]
<a name="l00929"></a>00929 <span class="comment"># check the versioned dependency (if present)</span>
<a name="l00930"></a><a class="code" href="classbritney_1_1Britney.html#f51c60a69f3a9dc2bc5afdb2ffaf3990">00930</a> <span class="comment"># TODO: this is forbidden by the debian policy, which says that versioned</span>
<a name="l00931"></a>00931 <span class="comment"># dependencies on virtual packages are never satisfied. The old britney</span>
<a name="l00932"></a>00932 <span class="comment"># does it and we have to go with it, but at least a warning should be raised.</span>
<a name="l00933"></a>00933 <span class="keywordflow">if</span> op == <span class="stringliteral">''</span> <span class="keywordflow">and</span> version == <span class="stringliteral">''</span> <span class="keywordflow">or</span> <span class="keywordflow">not</span> strict <span class="keywordflow">and</span> apt_pkg.CheckDep(package[VERSION], op, version):
<a name="l00934"></a>00934 packages.append(prov)
<a name="l00935"></a>00935 <span class="keywordflow">break</span>
<a name="l00936"></a>00936
<a name="l00937"></a>00937 <span class="keywordflow">return</span> (len(packages) > 0, packages)
<a name="l00938"></a>00938
<a name="l00939"></a>00939 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#f51c60a69f3a9dc2bc5afdb2ffaf3990">excuse_unsat_deps</a>(self, pkg, src, arch, suite, excuse, excluded=[], conflicts=False):
<a name="l00940"></a>00940 <span class="stringliteral">"""Find unsatisfied dependencies for a binary package</span>
<a name="l00941"></a>00941 <span class="stringliteral"></span>
<a name="l00942"></a>00942 <span class="stringliteral"> This method analyzes the dependencies of the binary package specified</span>
<a name="l00943"></a>00943 <span class="stringliteral"> by the parameter `pkg', built from the source package `src', for the</span>
<a name="l00944"></a>00944 <span class="stringliteral"> architecture `arch' within the suite `suite'. If the dependency can't</span>
<a name="l00945"></a>00945 <span class="stringliteral"> be satisfied in testing and/or unstable, it updates the excuse passed</span>
<a name="l00946"></a>00946 <span class="stringliteral"> as parameter.</span>
<a name="l00947"></a>00947 <span class="stringliteral"></span>
<a name="l00948"></a>00948 <span class="stringliteral"> The dependency fields checked are Pre-Depends and Depends.</span>
<a name="l00949"></a>00949 <span class="stringliteral"> """</span>
<a name="l00950"></a>00950 <span class="comment"># retrieve the binary package from the specified suite and arch</span>
<a name="l00951"></a>00951 binary_u = self.binaries[suite][arch][0][pkg]
<a name="l00952"></a>00952
<a name="l00953"></a>00953 <span class="comment"># local copies for better performances</span>
<a name="l00954"></a>00954 parse_depends = apt_pkg.ParseDepends
<a name="l00955"></a>00955 get_dependency_solvers = self.<a class="code" href="classbritney_1_1Britney.html#5461f49e3e75a251ebedfd37d2a5ff0c">get_dependency_solvers</a>
<a name="l00956"></a>00956 strict = <span class="keyword">True</span> <span class="comment"># not self.options.compatible</span>
<a name="l00957"></a>00957
<a name="l00958"></a>00958 <span class="comment"># analyze the dependency fields (if present)</span>
<a name="l00959"></a>00959 <span class="keywordflow">for</span> type_key, type <span class="keywordflow">in</span> ((PREDEPENDS, <span class="stringliteral">'Pre-Depends'</span>), (DEPENDS, <span class="stringliteral">'Depends'</span>)):
<a name="l00960"></a>00960 <span class="keywordflow">if</span> <span class="keywordflow">not</span> binary_u[type_key]:
<a name="l00961"></a>00961 <span class="keywordflow">continue</span>
<a name="l00962"></a>00962
<a name="l00963"></a>00963 <span class="comment"># for every block of dependency (which is formed as conjunction of disconjunction)</span>
<a name="l00964"></a>00964 <span class="keywordflow">for</span> block, block_txt <span class="keywordflow">in</span> zip(parse_depends(binary_u[type_key]), binary_u[type_key].split(<span class="stringliteral">','</span>)):
<a name="l00965"></a>00965 <span class="comment"># if the block is satisfied in testing, then skip the block</span>
<a name="l00966"></a>00966 solved, packages = get_dependency_solvers(block, arch, <span class="stringliteral">'testing'</span>, excluded, strict=strict)
<a name="l00967"></a>00967 <span class="keywordflow">if</span> solved:
<a name="l00968"></a>00968 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> packages:
<a name="l00969"></a>00969 <span class="keywordflow">if</span> p <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.binaries[suite][arch][0]: <span class="keywordflow">continue</span>
<a name="l00970"></a>00970 excuse.add_sane_dep(self.binaries[suite][arch][0][p][SOURCE])
<a name="l00971"></a>00971 <span class="keywordflow">continue</span>
<a name="l00972"></a>00972
<a name="l00973"></a>00973 <span class="comment"># check if the block can be satisfied in unstable, and list the solving packages</span>
<a name="l00974"></a>00974 solved, packages = get_dependency_solvers(block, arch, suite, [], strict=strict)
<a name="l00975"></a>00975 packages = [self.binaries[suite][arch][0][p][SOURCE] <span class="keywordflow">for</span> p <span class="keywordflow">in</span> packages]
<a name="l00976"></a>00976
<a name="l00977"></a>00977 <span class="comment"># if the dependency can be satisfied by the same source package, skip the block:</span>
<a name="l00978"></a>00978 <span class="comment"># obviously both binary packages will enter testing togheter</span>
<a name="l00979"></a>00979 <span class="keywordflow">if</span> src <span class="keywordflow">in</span> packages: <span class="keywordflow">continue</span>
<a name="l00980"></a>00980
<a name="l00981"></a>00981 <span class="comment"># if no package can satisfy the dependency, add this information to the excuse</span>
<a name="l00982"></a>00982 <span class="keywordflow">if</span> len(packages) == 0:
<a name="l00983"></a>00983 excuse.addhtml(<span class="stringliteral">"%s/%s unsatisfiable %s: %s"</span> % (pkg, arch, type, block_txt.strip()))
<a name="l00984"></a>00984 <span class="keywordflow">if</span> arch <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.options.break_arches: excuse.add_unsat_dep(arch)
<a name="l00985"></a>00985 <span class="keywordflow">continue</span>
<a name="l00986"></a>00986
<a name="l00987"></a>00987 <span class="comment"># for the solving packages, update the excuse to add the dependencies</span>
<a name="l00988"></a>00988 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> packages:
<a name="l00989"></a>00989 <span class="keywordflow">if</span> arch <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.options.break_arches.split():
<a name="l00990"></a><a class="code" href="classbritney_1_1Britney.html#f8a6c9adbdec7a5a982dd2b74febcc08">00990</a> excuse.add_dep(p)
<a name="l00991"></a>00991 <span class="keywordflow">else</span>:
<a name="l00992"></a>00992 excuse.add_break_dep(p, arch)
<a name="l00993"></a>00993
<a name="l00994"></a>00994 <span class="keywordflow">return</span> <span class="keyword">True</span>
<a name="l00995"></a>00995
<a name="l00996"></a>00996 <span class="comment"># Package analysis methods</span>
<a name="l00997"></a>00997 <span class="comment"># ------------------------</span>
<a name="l00998"></a>00998
<a name="l00999"></a>00999 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#f8a6c9adbdec7a5a982dd2b74febcc08">should_remove_source</a>(self, pkg):
<a name="l01000"></a>01000 <span class="stringliteral">"""Check if a source package should be removed from testing</span>
<a name="l01001"></a>01001 <span class="stringliteral"> </span>
<a name="l01002"></a>01002 <span class="stringliteral"> This method checks if a source package should be removed from the</span>
<a name="l01003"></a>01003 <span class="stringliteral"> testing distribution; this happen if the source package is not</span>
<a name="l01004"></a>01004 <span class="stringliteral"> present in the unstable distribution anymore.</span>
<a name="l01005"></a>01005 <span class="stringliteral"></span>
<a name="l01006"></a>01006 <span class="stringliteral"> It returns True if the package can be removed, False otherwise.</span>
<a name="l01007"></a>01007 <span class="stringliteral"> In the former case, a new excuse is appended to the the object</span>
<a name="l01008"></a>01008 <span class="stringliteral"> attribute excuses.</span>
<a name="l01009"></a>01009 <span class="stringliteral"> """</span>
<a name="l01010"></a>01010 <span class="comment"># if the soruce package is available in unstable, then do nothing</span>
<a name="l01011"></a>01011 <span class="keywordflow">if</span> pkg <span class="keywordflow">in</span> self.sources[<span class="stringliteral">'unstable'</span>]:
<a name="l01012"></a>01012 <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l01013"></a>01013 <span class="comment"># otherwise, add a new excuse for its removal and return True</span>
<a name="l01014"></a>01014 src = self.sources[<span class="stringliteral">'testing'</span>][pkg]
<a name="l01015"></a>01015 excuse = Excuse(<span class="stringliteral">"-"</span> + pkg)
<a name="l01016"></a>01016 excuse.set_vers(src[VERSION], <span class="keywordtype">None</span>)
<a name="l01017"></a>01017 src[MAINTAINER] <span class="keywordflow">and</span> excuse.set_maint(src[MAINTAINER].strip())
<a name="l01018"></a>01018 src[SECTION] <span class="keywordflow">and</span> excuse.set_section(src[SECTION].strip())
<a name="l01019"></a>01019
<a name="l01020"></a><a class="code" href="classbritney_1_1Britney.html#bd18d7acde434387e94344a39db5b0e5">01020</a> <span class="comment"># if the package is blocked, skip it</span>
<a name="l01021"></a>01021 <span class="keywordflow">if</span> self.hints[<span class="stringliteral">'block'</span>].has_key(<span class="stringliteral">'-'</span> + pkg):
<a name="l01022"></a>01022 exc.addhtml(<span class="stringliteral">"Not touching package, as requested by %s (contact debian-release if update is needed)"</span> % hints[<span class="stringliteral">'block'</span>][<span class="stringliteral">'-'</span> + pkg])
<a name="l01023"></a>01023 <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l01024"></a>01024
<a name="l01025"></a>01025 excuse.addhtml(<span class="stringliteral">"Valid candidate"</span>)
<a name="l01026"></a>01026 self.excuses.append(excuse)
<a name="l01027"></a>01027 <span class="keywordflow">return</span> <span class="keyword">True</span>
<a name="l01028"></a>01028
<a name="l01029"></a>01029 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#bd18d7acde434387e94344a39db5b0e5">should_upgrade_srcarch</a>(self, src, arch, suite):
<a name="l01030"></a>01030 <span class="stringliteral">"""Check if binary package should be upgraded</span>
<a name="l01031"></a>01031 <span class="stringliteral"></span>
<a name="l01032"></a>01032 <span class="stringliteral"> This method checks if a binary package should be upgraded; this can</span>
<a name="l01033"></a>01033 <span class="stringliteral"> happen also if the binary package is a binary-NMU for the given arch.</span>
<a name="l01034"></a>01034 <span class="stringliteral"> The analysis is performed for the source package specified by the</span>
<a name="l01035"></a>01035 <span class="stringliteral"> `src' parameter, checking the architecture `arch' for the distribution</span>
<a name="l01036"></a>01036 <span class="stringliteral"> `suite'.</span>
<a name="l01037"></a>01037 <span class="stringliteral"> </span>
<a name="l01038"></a>01038 <span class="stringliteral"> It returns False if the given package doesn't need to be upgraded,</span>
<a name="l01039"></a>01039 <span class="stringliteral"> True otherwise. In the former case, a new excuse is appended to</span>
<a name="l01040"></a>01040 <span class="stringliteral"> the the object attribute excuses.</span>
<a name="l01041"></a>01041 <span class="stringliteral"> """</span>
<a name="l01042"></a>01042 <span class="comment"># retrieve the source packages for testing and suite</span>
<a name="l01043"></a>01043 source_t = self.sources[<span class="stringliteral">'testing'</span>][src]
<a name="l01044"></a>01044 source_u = self.sources[suite][src]
<a name="l01045"></a>01045
<a name="l01046"></a>01046 <span class="comment"># build the common part of the excuse, which will be filled by the code below</span>
<a name="l01047"></a>01047 ref = <span class="stringliteral">"%s/%s%s"</span> % (src, arch, suite != <span class="stringliteral">'unstable'</span> <span class="keywordflow">and</span> <span class="stringliteral">"_"</span> + suite <span class="keywordflow">or</span> <span class="stringliteral">""</span>)
<a name="l01048"></a>01048 excuse = Excuse(ref)
<a name="l01049"></a>01049 excuse.set_vers(source_t[VERSION], source_t[VERSION])
<a name="l01050"></a>01050 source_u[MAINTAINER] <span class="keywordflow">and</span> excuse.set_maint(source_u[MAINTAINER].strip())
<a name="l01051"></a>01051 source_u[SECTION] <span class="keywordflow">and</span> excuse.set_section(source_u[SECTION].strip())
<a name="l01052"></a>01052
<a name="l01053"></a>01053 <span class="comment"># if there is a `remove' hint and the requested version is the same of the</span>
<a name="l01054"></a>01054 <span class="comment"># version in testing, then stop here and return False</span>
<a name="l01055"></a>01055 <span class="keywordflow">if</span> src <span class="keywordflow">in</span> self.hints[<span class="stringliteral">"remove"</span>] <span class="keywordflow">and</span> \
<a name="l01056"></a>01056 self.<a class="code" href="classbritney_1_1Britney.html#85d2e45e8431779b62f398c34972ddf1">same_source</a>(source_t[VERSION], self.hints[<span class="stringliteral">"remove"</span>][src][0]):
<a name="l01057"></a>01057 excuse.addhtml(<span class="stringliteral">"Removal request by %s"</span> % (self.hints[<span class="stringliteral">"remove"</span>][src][1]))
<a name="l01058"></a>01058 excuse.addhtml(<span class="stringliteral">"Trying to remove package, not update it"</span>)
<a name="l01059"></a>01059 excuse.addhtml(<span class="stringliteral">"Not considered"</span>)
<a name="l01060"></a>01060 self.excuses.append(excuse)
<a name="l01061"></a>01061 <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l01062"></a>01062
<a name="l01063"></a>01063 <span class="comment"># the starting point is that there is nothing wrong and nothing worth doing</span>
<a name="l01064"></a>01064 anywrongver = <span class="keyword">False</span>
<a name="l01065"></a>01065 anyworthdoing = <span class="keyword">False</span>
<a name="l01066"></a>01066
<a name="l01067"></a>01067 <span class="comment"># for every binary package produced by this source in unstable for this architecture</span>
<a name="l01068"></a>01068 <span class="keywordflow">for</span> pkg <span class="keywordflow">in</span> sorted(filter(<span class="keyword">lambda</span> x: x.endswith(<span class="stringliteral">"/"</span> + arch), source_u[BINARIES]), key=<span class="keyword">lambda</span> x: x.split(<span class="stringliteral">"/"</span>)[0]):
<a name="l01069"></a>01069 pkg_name = pkg.split(<span class="stringliteral">"/"</span>)[0]
<a name="l01070"></a>01070
<a name="l01071"></a>01071 <span class="comment"># retrieve the testing (if present) and unstable corresponding binary packages</span>
<a name="l01072"></a>01072 binary_t = pkg <span class="keywordflow">in</span> source_t[BINARIES] <span class="keywordflow">and</span> self.binaries[<span class="stringliteral">'testing'</span>][arch][0][pkg_name] <span class="keywordflow">or</span> <span class="keywordtype">None</span>
<a name="l01073"></a>01073 binary_u = self.binaries[suite][arch][0][pkg_name]
<a name="l01074"></a>01074
<a name="l01075"></a>01075 <span class="comment"># this is the source version for the new binary package</span>
<a name="l01076"></a>01076 pkgsv = self.binaries[suite][arch][0][pkg_name][SOURCEVER]
<a name="l01077"></a>01077
<a name="l01078"></a>01078 <span class="comment"># if the new binary package is architecture-independent, then skip it</span>
<a name="l01079"></a>01079 <span class="keywordflow">if</span> binary_u[ARCHITECTURE] == <span class="stringliteral">'all'</span>:
<a name="l01080"></a>01080 excuse.addhtml(<span class="stringliteral">"Ignoring %s %s (from %s) as it is arch: all"</span> % (pkg_name, binary_u[VERSION], pkgsv))
<a name="l01081"></a>01081 <span class="keywordflow">continue</span>
<a name="l01082"></a>01082
<a name="l01083"></a>01083 <span class="comment"># if the new binary package is not from the same source as the testing one, then skip it</span>
<a name="l01084"></a>01084 <span class="keywordflow">if</span> <span class="keywordflow">not</span> self.<a class="code" href="classbritney_1_1Britney.html#85d2e45e8431779b62f398c34972ddf1">same_source</a>(source_t[VERSION], pkgsv):
<a name="l01085"></a>01085 anywrongver = <span class="keyword">True</span>
<a name="l01086"></a>01086 excuse.addhtml(<span class="stringliteral">"From wrong source: %s %s (%s not %s)"</span> % (pkg_name, binary_u[VERSION], pkgsv, source_t[VERSION]))
<a name="l01087"></a>01087 <span class="keywordflow">break</span>
<a name="l01088"></a>01088
<a name="l01089"></a>01089 <span class="comment"># find unsatisfied dependencies for the new binary package</span>
<a name="l01090"></a>01090 self.<a class="code" href="classbritney_1_1Britney.html#f51c60a69f3a9dc2bc5afdb2ffaf3990">excuse_unsat_deps</a>(pkg_name, src, arch, suite, excuse)
<a name="l01091"></a>01091
<a name="l01092"></a>01092 <span class="comment"># if the binary is not present in testing, then it is a new binary;</span>
<a name="l01093"></a>01093 <span class="comment"># in this case, there is something worth doing</span>
<a name="l01094"></a>01094 <span class="keywordflow">if</span> <span class="keywordflow">not</span> binary_t:
<a name="l01095"></a>01095 excuse.addhtml(<span class="stringliteral">"New binary: %s (%s)"</span> % (pkg_name, binary_u[VERSION]))
<a name="l01096"></a>01096 anyworthdoing = <span class="keyword">True</span>
<a name="l01097"></a>01097 <span class="keywordflow">continue</span>
<a name="l01098"></a>01098
<a name="l01099"></a>01099 <span class="comment"># at this point, the binary package is present in testing, so we can compare</span>
<a name="l01100"></a>01100 <span class="comment"># the versions of the packages ...</span>
<a name="l01101"></a>01101 vcompare = apt_pkg.VersionCompare(binary_t[VERSION], binary_u[VERSION])
<a name="l01102"></a>01102
<a name="l01103"></a>01103 <span class="comment"># ... if updating would mean downgrading, then stop here: there is something wrong</span>
<a name="l01104"></a>01104 <span class="keywordflow">if</span> vcompare > 0:
<a name="l01105"></a>01105 anywrongver = <span class="keyword">True</span>
<a name="l01106"></a>01106 excuse.addhtml(<span class="stringliteral">"Not downgrading: %s (%s to %s)"</span> % (pkg_name, binary_t[VERSION], binary_u[VERSION]))
<a name="l01107"></a>01107 <span class="keywordflow">break</span>
<a name="l01108"></a>01108 <span class="comment"># ... if updating would mean upgrading, then there is something worth doing</span>
<a name="l01109"></a>01109 <span class="keywordflow">elif</span> vcompare < 0:
<a name="l01110"></a>01110 excuse.addhtml(<span class="stringliteral">"Updated binary: %s (%s to %s)"</span> % (pkg_name, binary_t[VERSION], binary_u[VERSION]))
<a name="l01111"></a>01111 anyworthdoing = <span class="keyword">True</span>
<a name="l01112"></a>01112
<a name="l01113"></a>01113 <span class="comment"># if there is nothing wrong and there is something worth doing or the source</span>
<a name="l01114"></a>01114 <span class="comment"># package is not fake, then check what packages shuold be removed</span>
<a name="l01115"></a>01115 <span class="keywordflow">if</span> <span class="keywordflow">not</span> anywrongver <span class="keywordflow">and</span> (anyworthdoing <span class="keywordflow">or</span> self.sources[suite][src][FAKESRC]):
<a name="l01116"></a>01116 srcv = self.sources[suite][src][VERSION]
<a name="l01117"></a>01117 ssrc = self.<a class="code" href="classbritney_1_1Britney.html#85d2e45e8431779b62f398c34972ddf1">same_source</a>(source_t[VERSION], srcv)
<a name="l01118"></a>01118 <span class="comment"># for every binary package produced by this source in testing for this architecture</span>
<a name="l01119"></a>01119 <span class="keywordflow">for</span> pkg <span class="keywordflow">in</span> sorted([x.split(<span class="stringliteral">"/"</span>)[0] <span class="keywordflow">for</span> x <span class="keywordflow">in</span> self.sources[<span class="stringliteral">'testing'</span>][src][BINARIES] <span class="keywordflow">if</span> x.endswith(<span class="stringliteral">"/"</span>+arch)]):
<a name="l01120"></a>01120 <span class="comment"># if the package is architecture-independent, then ignore it</span>
<a name="l01121"></a>01121 <span class="keywordflow">if</span> self.binaries[<span class="stringliteral">'testing'</span>][arch][0][pkg][ARCHITECTURE] == <span class="stringliteral">'all'</span>:
<a name="l01122"></a>01122 excuse.addhtml(<span class="stringliteral">"Ignoring removal of %s as it is arch: all"</span> % (pkg))
<a name="l01123"></a>01123 <span class="keywordflow">continue</span>
<a name="l01124"></a>01124 <span class="comment"># if the package is not produced by the new source package, then remove it from testing</span>
<a name="l01125"></a>01125 <span class="keywordflow">if</span> pkg <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.binaries[suite][arch][0]:
<a name="l01126"></a>01126 tpkgv = self.binaries[<span class="stringliteral">'testing'</span>][arch][0][pkg][VERSION]
<a name="l01127"></a>01127 excuse.addhtml(<span class="stringliteral">"Removed binary: %s %s"</span> % (pkg, tpkgv))
<a name="l01128"></a>01128 <span class="keywordflow">if</span> ssrc: anyworthdoing = <span class="keyword">True</span>
<a name="l01129"></a>01129
<a name="l01130"></a>01130 <span class="comment"># if there is nothing wrong and there is something worth doing, this is valid candidate</span>
<a name="l01131"></a>01131 <span class="keywordflow">if</span> <span class="keywordflow">not</span> anywrongver <span class="keywordflow">and</span> anyworthdoing:
<a name="l01132"></a>01132 excuse.addhtml(<span class="stringliteral">"Valid candidate"</span>)
<a name="l01133"></a>01133 self.excuses.append(excuse)
<a name="l01134"></a><a class="code" href="classbritney_1_1Britney.html#94785175a85f44b1afaf3add167a211f">01134</a> <span class="keywordflow">return</span> <span class="keyword">True</span>
<a name="l01135"></a>01135 <span class="comment"># else if there is something worth doing (but something wrong, too) this package won't be considered</span>
<a name="l01136"></a>01136 <span class="keywordflow">elif</span> anyworthdoing:
<a name="l01137"></a>01137 excuse.addhtml(<span class="stringliteral">"Not considered"</span>)
<a name="l01138"></a>01138 self.excuses.append(excuse)
<a name="l01139"></a>01139
<a name="l01140"></a>01140 <span class="comment"># otherwise, return False</span>
<a name="l01141"></a>01141 <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l01142"></a>01142
<a name="l01143"></a>01143 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#94785175a85f44b1afaf3add167a211f">should_upgrade_src</a>(self, src, suite):
<a name="l01144"></a>01144 <span class="stringliteral">"""Check if source package should be upgraded</span>
<a name="l01145"></a>01145 <span class="stringliteral"></span>
<a name="l01146"></a>01146 <span class="stringliteral"> This method checks if a source package should be upgraded. The analysis</span>
<a name="l01147"></a>01147 <span class="stringliteral"> is performed for the source package specified by the `src' parameter, </span>
<a name="l01148"></a>01148 <span class="stringliteral"> checking the architecture `arch' for the distribution `suite'.</span>
<a name="l01149"></a>01149 <span class="stringliteral"> </span>
<a name="l01150"></a>01150 <span class="stringliteral"> It returns False if the given package doesn't need to be upgraded,</span>
<a name="l01151"></a>01151 <span class="stringliteral"> True otherwise. In the former case, a new excuse is appended to</span>
<a name="l01152"></a>01152 <span class="stringliteral"> the the object attribute excuses.</span>
<a name="l01153"></a>01153 <span class="stringliteral"> """</span>
<a name="l01154"></a>01154
<a name="l01155"></a>01155 <span class="comment"># retrieve the source packages for testing (if available) and suite</span>
<a name="l01156"></a>01156 source_u = self.sources[suite][src]
<a name="l01157"></a>01157 <span class="keywordflow">if</span> src <span class="keywordflow">in</span> self.sources[<span class="stringliteral">'testing'</span>]:
<a name="l01158"></a>01158 source_t = self.sources[<span class="stringliteral">'testing'</span>][src]
<a name="l01159"></a>01159 <span class="comment"># if testing and unstable have the same version, then this is a candidate for binary-NMUs only</span>
<a name="l01160"></a>01160 <span class="keywordflow">if</span> apt_pkg.VersionCompare(source_t[VERSION], source_u[VERSION]) == 0:
<a name="l01161"></a>01161 <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l01162"></a>01162 <span class="keywordflow">else</span>:
<a name="l01163"></a>01163 source_t = <span class="keywordtype">None</span>
<a name="l01164"></a>01164
<a name="l01165"></a>01165 <span class="comment"># build the common part of the excuse, which will be filled by the code below</span>
<a name="l01166"></a>01166 ref = <span class="stringliteral">"%s%s"</span> % (src, suite != <span class="stringliteral">'unstable'</span> <span class="keywordflow">and</span> <span class="stringliteral">"_"</span> + suite <span class="keywordflow">or</span> <span class="stringliteral">""</span>)
<a name="l01167"></a>01167 excuse = Excuse(ref)
<a name="l01168"></a>01168 excuse.set_vers(source_t <span class="keywordflow">and</span> source_t[VERSION] <span class="keywordflow">or</span> <span class="keywordtype">None</span>, source_u[VERSION])
<a name="l01169"></a>01169 source_u[MAINTAINER] <span class="keywordflow">and</span> excuse.set_maint(source_u[MAINTAINER].strip())
<a name="l01170"></a>01170 source_u[SECTION] <span class="keywordflow">and</span> excuse.set_section(source_u[SECTION].strip())
<a name="l01171"></a>01171
<a name="l01172"></a>01172 <span class="comment"># the starting point is that we will update the candidate</span>
<a name="l01173"></a>01173 update_candidate = <span class="keyword">True</span>
<a name="l01174"></a>01174
<a name="l01175"></a>01175 <span class="comment"># if the version in unstable is older, then stop here with a warning in the excuse and return False</span>
<a name="l01176"></a>01176 <span class="keywordflow">if</span> source_t <span class="keywordflow">and</span> apt_pkg.VersionCompare(source_u[VERSION], source_t[VERSION]) < 0:
<a name="l01177"></a>01177 excuse.addhtml(<span class="stringliteral">"ALERT: %s is newer in testing (%s %s)"</span> % (src, source_t[VERSION], source_u[VERSION]))
<a name="l01178"></a>01178 self.excuses.append(excuse)
<a name="l01179"></a>01179 <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l01180"></a>01180
<a name="l01181"></a>01181 <span class="comment"># check if the source package really exists or if it is a fake one</span>
<a name="l01182"></a>01182 <span class="keywordflow">if</span> source_u[FAKESRC]:
<a name="l01183"></a>01183 excuse.addhtml(<span class="stringliteral">"%s source package doesn't exist"</span> % (src))
<a name="l01184"></a>01184 update_candidate = <span class="keyword">False</span>
<a name="l01185"></a>01185
<a name="l01186"></a>01186 <span class="comment"># retrieve the urgency for the upload, ignoring it if this is a NEW package (not present in testing)</span>
<a name="l01187"></a>01187 urgency = self.urgencies.get(src, self.options.default_urgency)
<a name="l01188"></a>01188 <span class="keywordflow">if</span> <span class="keywordflow">not</span> source_t <span class="keywordflow">and</span> urgency != self.options.default_urgency:
<a name="l01189"></a>01189 excuse.addhtml(<span class="stringliteral">"Ignoring %s urgency setting for NEW package"</span> % (urgency))
<a name="l01190"></a>01190 urgency = self.options.default_urgency
<a name="l01191"></a>01191
<a name="l01192"></a>01192 <span class="comment"># if there is a `remove' hint and the requested version is the same of the</span>
<a name="l01193"></a>01193 <span class="comment"># version in testing, then stop here and return False</span>
<a name="l01194"></a>01194 <span class="keywordflow">if</span> src <span class="keywordflow">in</span> self.hints[<span class="stringliteral">"remove"</span>]:
<a name="l01195"></a>01195 <span class="keywordflow">if</span> source_t <span class="keywordflow">and</span> self.<a class="code" href="classbritney_1_1Britney.html#85d2e45e8431779b62f398c34972ddf1">same_source</a>(source_t[VERSION], self.hints[<span class="stringliteral">'remove'</span>][src][0]) <span class="keywordflow">or</span> \
<a name="l01196"></a>01196 self.<a class="code" href="classbritney_1_1Britney.html#85d2e45e8431779b62f398c34972ddf1">same_source</a>(source_u[VERSION], self.hints[<span class="stringliteral">'remove'</span>][src][0]):
<a name="l01197"></a>01197 excuse.addhtml(<span class="stringliteral">"Removal request by %s"</span> % (self.hints[<span class="stringliteral">"remove"</span>][src][1]))
<a name="l01198"></a>01198 excuse.addhtml(<span class="stringliteral">"Trying to remove package, not update it"</span>)
<a name="l01199"></a>01199 update_candidate = <span class="keyword">False</span>
<a name="l01200"></a>01200
<a name="l01201"></a>01201 <span class="comment"># check if there is a `block' hint for this package or a `block-all source' hint</span>
<a name="l01202"></a>01202 blocked = <span class="keywordtype">None</span>
<a name="l01203"></a>01203 <span class="keywordflow">if</span> src <span class="keywordflow">in</span> self.hints[<span class="stringliteral">"block"</span>]:
<a name="l01204"></a>01204 blocked = self.hints[<span class="stringliteral">"block"</span>][src]
<a name="l01205"></a>01205 <span class="keywordflow">elif</span> <span class="stringliteral">'source'</span> <span class="keywordflow">in</span> self.hints[<span class="stringliteral">"block-all"</span>]:
<a name="l01206"></a>01206 blocked = self.hints[<span class="stringliteral">"block-all"</span>][<span class="stringliteral">"source"</span>]
<a name="l01207"></a>01207
<a name="l01208"></a>01208 <span class="comment"># if the source is blocked, then look for an `unblock' hint; the unblock request</span>
<a name="l01209"></a>01209 <span class="comment"># is processed only if the specified version is correct</span>
<a name="l01210"></a>01210 <span class="keywordflow">if</span> blocked:
<a name="l01211"></a>01211 unblock = self.hints[<span class="stringliteral">"unblock"</span>].get(src,(<span class="keywordtype">None</span>,<span class="keywordtype">None</span>))
<a name="l01212"></a>01212 <span class="keywordflow">if</span> unblock[0] != <span class="keywordtype">None</span>:
<a name="l01213"></a>01213 <span class="keywordflow">if</span> self.<a class="code" href="classbritney_1_1Britney.html#85d2e45e8431779b62f398c34972ddf1">same_source</a>(unblock[0], source_u[VERSION]):
<a name="l01214"></a>01214 excuse.addhtml(<span class="stringliteral">"Ignoring request to block package by %s, due to unblock request by %s"</span> % (blocked, unblock[1]))
<a name="l01215"></a>01215 <span class="keywordflow">else</span>:
<a name="l01216"></a>01216 excuse.addhtml(<span class="stringliteral">"Unblock request by %s ignored due to version mismatch: %s"</span> % (unblock[1], unblock[0]))
<a name="l01217"></a>01217 <span class="keywordflow">else</span>:
<a name="l01218"></a>01218 excuse.addhtml(<span class="stringliteral">"Not touching package, as requested by %s (contact debian-release if update is needed)"</span> % (blocked))
<a name="l01219"></a>01219 update_candidate = <span class="keyword">False</span>
<a name="l01220"></a>01220
<a name="l01221"></a>01221 <span class="comment"># if the suite is unstable, then we have to check the urgency and the minimum days of</span>
<a name="l01222"></a>01222 <span class="comment"># permanence in unstable before updating testing; if the source package is too young,</span>
<a name="l01223"></a>01223 <span class="comment"># the check fails and we set update_candidate to False to block the update</span>
<a name="l01224"></a>01224 <span class="keywordflow">if</span> suite == <span class="stringliteral">'unstable'</span>:
<a name="l01225"></a>01225 <span class="keywordflow">if</span> src <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.dates:
<a name="l01226"></a>01226 self.dates[src] = (source_u[VERSION], self.date_now)
<a name="l01227"></a>01227 <span class="keywordflow">elif</span> <span class="keywordflow">not</span> self.<a class="code" href="classbritney_1_1Britney.html#85d2e45e8431779b62f398c34972ddf1">same_source</a>(self.dates[src][0], source_u[VERSION]):
<a name="l01228"></a>01228 self.dates[src] = (source_u[VERSION], self.date_now)
<a name="l01229"></a>01229
<a name="l01230"></a>01230 days_old = self.date_now - self.dates[src][1]
<a name="l01231"></a>01231 min_days = self.MINDAYS[urgency]
<a name="l01232"></a>01232 excuse.setdaysold(days_old, min_days)
<a name="l01233"></a>01233 <span class="keywordflow">if</span> days_old < min_days:
<a name="l01234"></a>01234 <span class="keywordflow">if</span> src <span class="keywordflow">in</span> self.hints[<span class="stringliteral">"urgent"</span>] <span class="keywordflow">and</span> self.<a class="code" href="classbritney_1_1Britney.html#85d2e45e8431779b62f398c34972ddf1">same_source</a>(source_u[VERSION], self.hints[<span class="stringliteral">"urgent"</span>][src][0]):
<a name="l01235"></a>01235 excuse.addhtml(<span class="stringliteral">"Too young, but urgency pushed by %s"</span> % (self.hints[<span class="stringliteral">"urgent"</span>][src][1]))
<a name="l01236"></a>01236 <span class="keywordflow">else</span>:
<a name="l01237"></a>01237 update_candidate = <span class="keyword">False</span>
<a name="l01238"></a>01238
<a name="l01239"></a>01239 <span class="comment"># at this point, we check what is the status of the builds on all the supported architectures</span>
<a name="l01240"></a>01240 <span class="comment"># to catch the out-of-date ones</span>
<a name="l01241"></a>01241 pkgs = {src: [<span class="stringliteral">"source"</span>]}
<a name="l01242"></a>01242 <span class="keywordflow">for</span> arch <span class="keywordflow">in</span> self.options.architectures:
<a name="l01243"></a>01243 oodbins = {}
<a name="l01244"></a>01244 <span class="comment"># for every binary package produced by this source in the suite for this architecture</span>
<a name="l01245"></a>01245 <span class="keywordflow">for</span> pkg <span class="keywordflow">in</span> sorted([x.split(<span class="stringliteral">"/"</span>)[0] <span class="keywordflow">for</span> x <span class="keywordflow">in</span> self.sources[suite][src][BINARIES] <span class="keywordflow">if</span> x.endswith(<span class="stringliteral">"/"</span>+arch)]):
<a name="l01246"></a>01246 <span class="keywordflow">if</span> pkg <span class="keywordflow">not</span> <span class="keywordflow">in</span> pkgs: pkgs[pkg] = []
<a name="l01247"></a>01247 pkgs[pkg].append(arch)
<a name="l01248"></a>01248
<a name="l01249"></a>01249 <span class="comment"># retrieve the binary package and its source version</span>
<a name="l01250"></a>01250 binary_u = self.binaries[suite][arch][0][pkg]
<a name="l01251"></a>01251 pkgsv = binary_u[SOURCEVER]
<a name="l01252"></a>01252
<a name="l01253"></a>01253 <span class="comment"># if it wasn't builded by the same source, it is out-of-date</span>
<a name="l01254"></a>01254 <span class="keywordflow">if</span> <span class="keywordflow">not</span> self.<a class="code" href="classbritney_1_1Britney.html#85d2e45e8431779b62f398c34972ddf1">same_source</a>(source_u[VERSION], pkgsv):
<a name="l01255"></a>01255 <span class="keywordflow">if</span> pkgsv <span class="keywordflow">not</span> <span class="keywordflow">in</span> oodbins:
<a name="l01256"></a>01256 oodbins[pkgsv] = []
<a name="l01257"></a>01257 oodbins[pkgsv].append(pkg)
<a name="l01258"></a>01258 <span class="keywordflow">continue</span>
<a name="l01259"></a>01259
<a name="l01260"></a>01260 <span class="comment"># if the package is architecture-dependent or the current arch is `nobreakall'</span>
<a name="l01261"></a>01261 <span class="comment"># find unsatisfied dependencies for the binary package</span>
<a name="l01262"></a>01262 <span class="keywordflow">if</span> binary_u[ARCHITECTURE] != <span class="stringliteral">'all'</span> <span class="keywordflow">or</span> arch <span class="keywordflow">in</span> self.options.nobreakall_arches:
<a name="l01263"></a>01263 self.<a class="code" href="classbritney_1_1Britney.html#f51c60a69f3a9dc2bc5afdb2ffaf3990">excuse_unsat_deps</a>(pkg, src, arch, suite, excuse)
<a name="l01264"></a>01264
<a name="l01265"></a>01265 <span class="comment"># if there are out-of-date packages, warn about them in the excuse and set update_candidate</span>
<a name="l01266"></a>01266 <span class="comment"># to False to block the update; if the architecture where the package is out-of-date is</span>
<a name="l01267"></a>01267 <span class="comment"># in the `fucked_arches' list, then do not block the update</span>
<a name="l01268"></a>01268 <span class="keywordflow">if</span> oodbins:
<a name="l01269"></a>01269 oodtxt = <span class="stringliteral">""</span>
<a name="l01270"></a>01270 <span class="keywordflow">for</span> v <span class="keywordflow">in</span> oodbins.keys():
<a name="l01271"></a>01271 <span class="keywordflow">if</span> oodtxt: oodtxt = oodtxt + <span class="stringliteral">"; "</span>
<a name="l01272"></a>01272 oodtxt = oodtxt + <span class="stringliteral">"%s (from <a href=\"http://buildd.debian.org/build.php?"</span> \
<a name="l01273"></a>01273 <span class="stringliteral">"arch=%s&pkg=%s&ver=%s\" target=\"_blank\">%s</a>)"</span> % \
<a name="l01274"></a>01274 (<span class="stringliteral">", "</span>.join(sorted(oodbins[v])), arch, src, v, v)
<a name="l01275"></a>01275 text = <span class="stringliteral">"out of date on <a href=\"http://buildd.debian.org/build.php?"</span> \
<a name="l01276"></a>01276 <span class="stringliteral">"arch=%s&pkg=%s&ver=%s\" target=\"_blank\">%s</a>: %s"</span> % \
<a name="l01277"></a>01277 (arch, src, source_u[VERSION], arch, oodtxt)
<a name="l01278"></a>01278
<a name="l01279"></a>01279 <span class="keywordflow">if</span> arch <span class="keywordflow">in</span> self.options.fucked_arches:
<a name="l01280"></a>01280 text = text + <span class="stringliteral">" (but %s isn't keeping up, so nevermind)"</span> % (arch)
<a name="l01281"></a>01281 <span class="keywordflow">else</span>:
<a name="l01282"></a>01282 update_candidate = <span class="keyword">False</span>
<a name="l01283"></a>01283
<a name="l01284"></a>01284 <span class="keywordflow">if</span> self.date_now != self.dates[src][1]:
<a name="l01285"></a>01285 excuse.addhtml(text)
<a name="l01286"></a>01286
<a name="l01287"></a>01287 <span class="comment"># if the source package has no binaries, set update_candidate to False to block the update</span>
<a name="l01288"></a>01288 <span class="keywordflow">if</span> len(self.sources[suite][src][BINARIES]) == 0:
<a name="l01289"></a>01289 excuse.addhtml(<span class="stringliteral">"%s has no binaries on any arch"</span> % src)
<a name="l01290"></a>01290 update_candidate = <span class="keyword">False</span>
<a name="l01291"></a>01291
<a name="l01292"></a>01292 <span class="comment"># if the suite is unstable, then we have to check the release-critical bug counts before</span>
<a name="l01293"></a>01293 <span class="comment"># updating testing; if the unstable package have a RC bug count greater than the testing</span>
<a name="l01294"></a>01294 <span class="comment"># one, the check fails and we set update_candidate to False to block the update</span>
<a name="l01295"></a>01295 <span class="keywordflow">if</span> suite == <span class="stringliteral">'unstable'</span>:
<a name="l01296"></a>01296 <span class="keywordflow">for</span> pkg <span class="keywordflow">in</span> pkgs.keys():
<a name="l01297"></a>01297 <span class="keywordflow">if</span> pkg <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.bugs[<span class="stringliteral">'testing'</span>]:
<a name="l01298"></a>01298 self.bugs[<span class="stringliteral">'testing'</span>][pkg] = 0
<a name="l01299"></a>01299 <span class="keywordflow">if</span> pkg <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.bugs[<span class="stringliteral">'unstable'</span>]:
<a name="l01300"></a>01300 self.bugs[<span class="stringliteral">'unstable'</span>][pkg] = 0
<a name="l01301"></a>01301
<a name="l01302"></a>01302 <span class="keywordflow">if</span> self.bugs[<span class="stringliteral">'unstable'</span>][pkg] > self.bugs[<span class="stringliteral">'testing'</span>][pkg]:
<a name="l01303"></a>01303 excuse.addhtml(<span class="stringliteral">"%s (%s) is <a href=\"http://bugs.debian.org/cgi-bin/pkgreport.cgi?"</span> \
<a name="l01304"></a>01304 <span class="stringliteral">"which=pkg&data=%s&sev-inc=critical&sev-inc=grave&sev-inc=serious\" "</span> \
<a name="l01305"></a>01305 <span class="stringliteral">"target=\"_blank\">buggy</a>! (%d > %d)"</span> % \
<a name="l01306"></a>01306 (pkg, <span class="stringliteral">", "</span>.join(pkgs[pkg]), pkg, self.bugs[<span class="stringliteral">'unstable'</span>][pkg], self.bugs[<span class="stringliteral">'testing'</span>][pkg]))
<a name="l01307"></a>01307 update_candidate = <span class="keyword">False</span>
<a name="l01308"></a>01308 <span class="keywordflow">elif</span> self.bugs[<span class="stringliteral">'unstable'</span>][pkg] > 0:
<a name="l01309"></a>01309 excuse.addhtml(<span class="stringliteral">"%s (%s) is (less) <a href=\"http://bugs.debian.org/cgi-bin/pkgreport.cgi?"</span> \
<a name="l01310"></a>01310 <span class="stringliteral">"which=pkg&data=%s&sev-inc=critical&sev-inc=grave&sev-inc=serious\" "</span> \
<a name="l01311"></a>01311 <span class="stringliteral">"target=\"_blank\">buggy</a>! (%d <= %d)"</span> % \
<a name="l01312"></a>01312 (pkg, <span class="stringliteral">", "</span>.join(pkgs[pkg]), pkg, self.bugs[<span class="stringliteral">'unstable'</span>][pkg], self.bugs[<span class="stringliteral">'testing'</span>][pkg]))
<a name="l01313"></a>01313
<a name="l01314"></a>01314 <span class="comment"># check if there is a `force' hint for this package, which allows it to go in even if it is not updateable</span>
<a name="l01315"></a>01315 <span class="keywordflow">if</span> <span class="keywordflow">not</span> update_candidate <span class="keywordflow">and</span> src <span class="keywordflow">in</span> self.hints[<span class="stringliteral">"force"</span>] <span class="keywordflow">and</span> \
<a name="l01316"></a>01316 self.<a class="code" href="classbritney_1_1Britney.html#85d2e45e8431779b62f398c34972ddf1">same_source</a>(source_u[VERSION], self.hints[<span class="stringliteral">"force"</span>][src][0]):
<a name="l01317"></a>01317 excuse.dontinvalidate = 1
<a name="l01318"></a>01318 excuse.addhtml(<span class="stringliteral">"Should ignore, but forced by %s"</span> % (self.hints[<span class="stringliteral">"force"</span>][src][1]))
<a name="l01319"></a>01319 update_candidate = <span class="keyword">True</span>
<a name="l01320"></a>01320
<a name="l01321"></a>01321 <span class="comment"># if the suite is testing-proposed-updates, the package needs an explicit approval in order to go in</span>
<a name="l01322"></a>01322 <span class="keywordflow">if</span> suite == <span class="stringliteral">"tpu"</span>:
<a name="l01323"></a>01323 key = <span class="stringliteral">"%s_%s"</span> % (src, source_u[VERSION])
<a name="l01324"></a>01324 <span class="keywordflow">if</span> key <span class="keywordflow">in</span> self.approvals:
<a name="l01325"></a>01325 excuse.addhtml(<span class="stringliteral">"Approved by %s"</span> % approvals[key])
<a name="l01326"></a>01326 <span class="keywordflow">else</span>:
<a name="l01327"></a>01327 excuse.addhtml(<span class="stringliteral">"NEEDS APPROVAL BY RM"</span>)
<a name="l01328"></a>01328 update_candidate = <span class="keyword">False</span>
<a name="l01329"></a>01329
<a name="l01330"></a>01330 <span class="comment"># if the package can be updated, it is a valid candidate</span>
<a name="l01331"></a><a class="code" href="classbritney_1_1Britney.html#be1b4af9d6c6650c70b24267412bc1a8">01331</a> <span class="keywordflow">if</span> update_candidate:
<a name="l01332"></a>01332 excuse.addhtml(<span class="stringliteral">"Valid candidate"</span>)
<a name="l01333"></a>01333 <span class="comment"># else it won't be considered</span>
<a name="l01334"></a>01334 <span class="keywordflow">else</span>:
<a name="l01335"></a>01335 excuse.addhtml(<span class="stringliteral">"Not considered"</span>)
<a name="l01336"></a>01336
<a name="l01337"></a>01337 self.excuses.append(excuse)
<a name="l01338"></a>01338 <span class="keywordflow">return</span> update_candidate
<a name="l01339"></a>01339
<a name="l01340"></a>01340 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#be1b4af9d6c6650c70b24267412bc1a8">reversed_exc_deps</a>(self):
<a name="l01341"></a>01341 <span class="stringliteral">"""Reverse the excuses dependencies</span>
<a name="l01342"></a>01342 <span class="stringliteral"></span>
<a name="l01343"></a>01343 <span class="stringliteral"> This method returns a dictionary where the keys are the package names</span>
<a name="l01344"></a><a class="code" href="classbritney_1_1Britney.html#171969785db449d7a06c3f762774e0cd">01344</a> <span class="stringliteral"> and the values are the excuse names which depend on it.</span>
<a name="l01345"></a>01345 <span class="stringliteral"> """</span>
<a name="l01346"></a>01346 res = {}
<a name="l01347"></a>01347 <span class="keywordflow">for</span> exc <span class="keywordflow">in</span> self.excuses:
<a name="l01348"></a>01348 <span class="keywordflow">for</span> d <span class="keywordflow">in</span> exc.deps:
<a name="l01349"></a>01349 <span class="keywordflow">if</span> d <span class="keywordflow">not</span> <span class="keywordflow">in</span> res: res[d] = []
<a name="l01350"></a>01350 res[d].append(exc.name)
<a name="l01351"></a>01351 <span class="keywordflow">return</span> res
<a name="l01352"></a>01352
<a name="l01353"></a>01353 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#171969785db449d7a06c3f762774e0cd">invalidate_excuses</a>(self, valid, invalid):
<a name="l01354"></a>01354 <span class="stringliteral">"""Invalidate impossible excuses</span>
<a name="l01355"></a>01355 <span class="stringliteral"></span>
<a name="l01356"></a>01356 <span class="stringliteral"> This method invalidates the impossible excuses, which depend</span>
<a name="l01357"></a>01357 <span class="stringliteral"> on invalid excuses. The two parameters contains the list of</span>
<a name="l01358"></a>01358 <span class="stringliteral"> `valid' and `invalid' excuses.</span>
<a name="l01359"></a>01359 <span class="stringliteral"> """</span>
<a name="l01360"></a>01360 <span class="comment"># build a lookup-by-name map</span>
<a name="l01361"></a>01361 exclookup = {}
<a name="l01362"></a>01362 <span class="keywordflow">for</span> e <span class="keywordflow">in</span> self.excuses:
<a name="l01363"></a>01363 exclookup[e.name] = e
<a name="l01364"></a>01364
<a name="l01365"></a>01365 <span class="comment"># build the reverse dependencies</span>
<a name="l01366"></a>01366 revdeps = self.<a class="code" href="classbritney_1_1Britney.html#be1b4af9d6c6650c70b24267412bc1a8">reversed_exc_deps</a>()
<a name="l01367"></a>01367
<a name="l01368"></a>01368 <span class="comment"># loop on the invalid excuses</span>
<a name="l01369"></a>01369 i = 0
<a name="l01370"></a>01370 <span class="keywordflow">while</span> i < len(invalid):
<a name="l01371"></a>01371 <span class="comment"># if there is no reverse dependency, skip the item</span>
<a name="l01372"></a>01372 <span class="keywordflow">if</span> invalid[i] <span class="keywordflow">not</span> <span class="keywordflow">in</span> revdeps:
<a name="l01373"></a>01373 i += 1
<a name="l01374"></a>01374 <span class="keywordflow">continue</span>
<a name="l01375"></a>01375 <span class="comment"># if there dependency can be satisfied by a testing-proposed-updates excuse, skip the item</span>
<a name="l01376"></a>01376 <span class="keywordflow">if</span> (invalid[i] + <span class="stringliteral">"_tpu"</span>) <span class="keywordflow">in</span> valid:
<a name="l01377"></a>01377 i += 1
<a name="l01378"></a>01378 <span class="keywordflow">continue</span>
<a name="l01379"></a>01379 <span class="comment"># loop on the reverse dependencies</span>
<a name="l01380"></a>01380 <span class="keywordflow">for</span> x <span class="keywordflow">in</span> revdeps[invalid[i]]:
<a name="l01381"></a>01381 <span class="comment"># if the item is valid and it is marked as `dontinvalidate', skip the item</span>
<a name="l01382"></a>01382 <span class="keywordflow">if</span> x <span class="keywordflow">in</span> valid <span class="keywordflow">and</span> exclookup[x].dontinvalidate:
<a name="l01383"></a>01383 <span class="keywordflow">continue</span>
<a name="l01384"></a>01384
<a name="l01385"></a>01385 <span class="comment"># otherwise, invalidate the dependency and mark as invalidated and</span>
<a name="l01386"></a><a class="code" href="classbritney_1_1Britney.html#010f6deffca32f7f71ecf1f5c1bb4985">01386</a> <span class="comment"># remove the depending excuses</span>
<a name="l01387"></a>01387 exclookup[x].invalidate_dep(invalid[i])
<a name="l01388"></a>01388 <span class="keywordflow">if</span> x <span class="keywordflow">in</span> valid:
<a name="l01389"></a>01389 p = valid.index(x)
<a name="l01390"></a>01390 invalid.append(valid.pop(p))
<a name="l01391"></a>01391 exclookup[x].addhtml(<span class="stringliteral">"Invalidated by dependency"</span>)
<a name="l01392"></a>01392 exclookup[x].addhtml(<span class="stringliteral">"Not considered"</span>)
<a name="l01393"></a>01393 i = i + 1
<a name="l01394"></a>01394
<a name="l01395"></a>01395 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#010f6deffca32f7f71ecf1f5c1bb4985">write_excuses</a>(self):
<a name="l01396"></a>01396 <span class="stringliteral">"""Produce and write the update excuses</span>
<a name="l01397"></a>01397 <span class="stringliteral"></span>
<a name="l01398"></a>01398 <span class="stringliteral"> This method handles the update excuses generation: the packages are</span>
<a name="l01399"></a>01399 <span class="stringliteral"> looked to determine whether they are valid candidates. For the details</span>
<a name="l01400"></a>01400 <span class="stringliteral"> of this procedure, please refer to the module docstring.</span>
<a name="l01401"></a>01401 <span class="stringliteral"> """</span>
<a name="l01402"></a>01402
<a name="l01403"></a>01403 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Update Excuses generation started"</span>, type=<span class="stringliteral">"I"</span>)
<a name="l01404"></a>01404
<a name="l01405"></a>01405 <span class="comment"># list of local methods and variables (for better performance)</span>
<a name="l01406"></a>01406 sources = self.sources
<a name="l01407"></a>01407 architectures = self.options.architectures
<a name="l01408"></a>01408 should_remove_source = self.<a class="code" href="classbritney_1_1Britney.html#f8a6c9adbdec7a5a982dd2b74febcc08">should_remove_source</a>
<a name="l01409"></a>01409 should_upgrade_srcarch = self.<a class="code" href="classbritney_1_1Britney.html#bd18d7acde434387e94344a39db5b0e5">should_upgrade_srcarch</a>
<a name="l01410"></a>01410 should_upgrade_src = self.<a class="code" href="classbritney_1_1Britney.html#94785175a85f44b1afaf3add167a211f">should_upgrade_src</a>
<a name="l01411"></a>01411
<a name="l01412"></a>01412 <span class="comment"># this list will contain the packages which are valid candidates;</span>
<a name="l01413"></a>01413 <span class="comment"># if a package is going to be removed, it will have a "-" prefix</span>
<a name="l01414"></a>01414 upgrade_me = []
<a name="l01415"></a>01415
<a name="l01416"></a>01416 <span class="comment"># for every source package in testing, check if it should be removed</span>
<a name="l01417"></a>01417 <span class="keywordflow">for</span> pkg <span class="keywordflow">in</span> sources[<span class="stringliteral">'testing'</span>]:
<a name="l01418"></a>01418 <span class="keywordflow">if</span> should_remove_source(pkg):
<a name="l01419"></a>01419 upgrade_me.append(<span class="stringliteral">"-"</span> + pkg)
<a name="l01420"></a>01420
<a name="l01421"></a>01421 <span class="comment"># for every source package in unstable check if it should be upgraded</span>
<a name="l01422"></a>01422 <span class="keywordflow">for</span> pkg <span class="keywordflow">in</span> sources[<span class="stringliteral">'unstable'</span>]:
<a name="l01423"></a>01423 <span class="keywordflow">if</span> sources[<span class="stringliteral">'unstable'</span>][pkg][FAKESRC]: <span class="keywordflow">continue</span>
<a name="l01424"></a>01424 <span class="comment"># if the source package is already present in testing,</span>
<a name="l01425"></a>01425 <span class="comment"># check if it should be upgraded for every binary package</span>
<a name="l01426"></a>01426 <span class="keywordflow">if</span> pkg <span class="keywordflow">in</span> sources[<span class="stringliteral">'testing'</span>] <span class="keywordflow">and</span> <span class="keywordflow">not</span> sources[<span class="stringliteral">'testing'</span>][pkg][FAKESRC]:
<a name="l01427"></a>01427 <span class="keywordflow">for</span> arch <span class="keywordflow">in</span> architectures:
<a name="l01428"></a>01428 <span class="keywordflow">if</span> should_upgrade_srcarch(pkg, arch, <span class="stringliteral">'unstable'</span>):
<a name="l01429"></a>01429 upgrade_me.append(<span class="stringliteral">"%s/%s"</span> % (pkg, arch))
<a name="l01430"></a>01430
<a name="l01431"></a>01431 <span class="comment"># check if the source package should be upgraded</span>
<a name="l01432"></a>01432 <span class="keywordflow">if</span> should_upgrade_src(pkg, <span class="stringliteral">'unstable'</span>):
<a name="l01433"></a>01433 upgrade_me.append(pkg)
<a name="l01434"></a>01434
<a name="l01435"></a>01435 <span class="comment"># for every source package in testing-proposed-updates, check if it should be upgraded</span>
<a name="l01436"></a>01436 <span class="keywordflow">for</span> pkg <span class="keywordflow">in</span> sources[<span class="stringliteral">'tpu'</span>]:
<a name="l01437"></a>01437 <span class="keywordflow">if</span> sources[<span class="stringliteral">'tpu'</span>][pkg][FAKESRC]: <span class="keywordflow">continue</span>
<a name="l01438"></a>01438 <span class="comment"># if the source package is already present in testing,</span>
<a name="l01439"></a>01439 <span class="comment"># check if it should be upgraded for every binary package</span>
<a name="l01440"></a>01440 <span class="keywordflow">if</span> pkg <span class="keywordflow">in</span> sources[<span class="stringliteral">'testing'</span>]:
<a name="l01441"></a>01441 <span class="keywordflow">for</span> arch <span class="keywordflow">in</span> architectures:
<a name="l01442"></a>01442 <span class="keywordflow">if</span> should_upgrade_srcarch(pkg, arch, <span class="stringliteral">'tpu'</span>):
<a name="l01443"></a>01443 upgrade_me.append(<span class="stringliteral">"%s/%s_tpu"</span> % (pkg, arch))
<a name="l01444"></a>01444
<a name="l01445"></a>01445 <span class="comment"># check if the source package should be upgraded</span>
<a name="l01446"></a>01446 <span class="keywordflow">if</span> should_upgrade_src(pkg, <span class="stringliteral">'tpu'</span>):
<a name="l01447"></a>01447 upgrade_me.append(<span class="stringliteral">"%s_tpu"</span> % pkg)
<a name="l01448"></a>01448
<a name="l01449"></a>01449 <span class="comment"># process the `remove' hints, if the given package is not yet in upgrade_me</span>
<a name="l01450"></a>01450 <span class="keywordflow">for</span> src <span class="keywordflow">in</span> self.hints[<span class="stringliteral">"remove"</span>].keys():
<a name="l01451"></a>01451 <span class="keywordflow">if</span> src <span class="keywordflow">in</span> upgrade_me: <span class="keywordflow">continue</span>
<a name="l01452"></a>01452 <span class="keywordflow">if</span> (<span class="stringliteral">"-"</span>+src) <span class="keywordflow">in</span> upgrade_me: <span class="keywordflow">continue</span>
<a name="l01453"></a>01453 <span class="keywordflow">if</span> src <span class="keywordflow">not</span> <span class="keywordflow">in</span> sources[<span class="stringliteral">'testing'</span>]: <span class="keywordflow">continue</span>
<a name="l01454"></a>01454
<a name="l01455"></a>01455 <span class="comment"># check if the version specified in the hint is the same of the considered package</span>
<a name="l01456"></a>01456 tsrcv = sources[<span class="stringliteral">'testing'</span>][src][VERSION]
<a name="l01457"></a>01457 <span class="keywordflow">if</span> <span class="keywordflow">not</span> self.<a class="code" href="classbritney_1_1Britney.html#85d2e45e8431779b62f398c34972ddf1">same_source</a>(tsrcv, self.hints[<span class="stringliteral">"remove"</span>][src][0]): <span class="keywordflow">continue</span>
<a name="l01458"></a>01458
<a name="l01459"></a>01459 <span class="comment"># add the removal of the package to upgrade_me and build a new excuse</span>
<a name="l01460"></a>01460 upgrade_me.append(<span class="stringliteral">"-%s"</span> % (src))
<a name="l01461"></a>01461 excuse = Excuse(<span class="stringliteral">"-%s"</span> % (src))
<a name="l01462"></a>01462 excuse.set_vers(tsrcv, <span class="keywordtype">None</span>)
<a name="l01463"></a>01463 excuse.addhtml(<span class="stringliteral">"Removal request by %s"</span> % (self.hints[<span class="stringliteral">"remove"</span>][src][1]))
<a name="l01464"></a>01464 excuse.addhtml(<span class="stringliteral">"Package is broken, will try to remove"</span>)
<a name="l01465"></a>01465 self.excuses.append(excuse)
<a name="l01466"></a>01466
<a name="l01467"></a>01467 <span class="comment"># sort the excuses by daysold and name</span>
<a name="l01468"></a>01468 self.excuses.sort(<span class="keyword">lambda</span> x, y: cmp(x.daysold, y.daysold) <span class="keywordflow">or</span> cmp(x.name, y.name))
<a name="l01469"></a>01469
<a name="l01470"></a>01470 <span class="comment"># extract the not considered packages, which are in the excuses but not in upgrade_me</span>
<a name="l01471"></a>01471 unconsidered = [e.name <span class="keywordflow">for</span> e <span class="keywordflow">in</span> self.excuses <span class="keywordflow">if</span> e.name <span class="keywordflow">not</span> <span class="keywordflow">in</span> upgrade_me]
<a name="l01472"></a>01472
<a name="l01473"></a>01473 <span class="comment"># invalidate impossible excuses</span>
<a name="l01474"></a>01474 <span class="keywordflow">for</span> e <span class="keywordflow">in</span> self.excuses:
<a name="l01475"></a>01475 <span class="keywordflow">for</span> d <span class="keywordflow">in</span> e.deps:
<a name="l01476"></a>01476 <span class="keywordflow">if</span> d <span class="keywordflow">not</span> <span class="keywordflow">in</span> upgrade_me <span class="keywordflow">and</span> d <span class="keywordflow">not</span> <span class="keywordflow">in</span> unconsidered:
<a name="l01477"></a>01477 e.addhtml(<span class="stringliteral">"Unpossible dep: %s -> %s"</span> % (e.name, d))
<a name="l01478"></a>01478 self.<a class="code" href="classbritney_1_1Britney.html#171969785db449d7a06c3f762774e0cd">invalidate_excuses</a>(upgrade_me, unconsidered)
<a name="l01479"></a>01479
<a name="l01480"></a>01480 <span class="comment"># sort the list of candidates</span>
<a name="l01481"></a>01481 self.upgrade_me = sorted(upgrade_me)
<a name="l01482"></a>01482
<a name="l01483"></a>01483 <span class="comment"># write excuses to the output file</span>
<a name="l01484"></a>01484 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"> Writing Excuses to %s"</span> % self.options.excuses_output, type=<span class="stringliteral">"I"</span>)
<a name="l01485"></a>01485
<a name="l01486"></a>01486 f = open(self.options.excuses_output, <span class="stringliteral">'w'</span>)
<a name="l01487"></a>01487 f.write(<span class="stringliteral">"<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/REC-html40/strict.dtd\">\n"</span>)
<a name="l01488"></a>01488 f.write(<span class="stringliteral">"<html><head><title>excuses...</title>"</span>)
<a name="l01489"></a>01489 f.write(<span class="stringliteral">"<meta http-equiv=\"Content-Type\" content=\"text/html;charset=utf-8\"></head><body>\n"</span>)
<a name="l01490"></a>01490 f.write(<span class="stringliteral">"<p>Generated: "</span> + time.strftime(<span class="stringliteral">"%Y.%m.%d %H:%M:%S %z"</span>, time.gmtime(time.time())) + <span class="stringliteral">"</p>\n"</span>)
<a name="l01491"></a>01491 f.write(<span class="stringliteral">"<ul>\n"</span>)
<a name="l01492"></a>01492 <span class="keywordflow">for</span> e <span class="keywordflow">in</span> self.excuses:
<a name="l01493"></a><a class="code" href="classbritney_1_1Britney.html#60ccd1851bcea5659fed15010541e244">01493</a> f.write(<span class="stringliteral">"<li>%s"</span> % e.html())
<a name="l01494"></a>01494 f.write(<span class="stringliteral">"</ul></body></html>\n"</span>)
<a name="l01495"></a>01495 f.close()
<a name="l01496"></a>01496
<a name="l01497"></a>01497 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Update Excuses generation completed"</span>, type=<span class="stringliteral">"I"</span>)
<a name="l01498"></a>01498
<a name="l01499"></a>01499 <span class="comment"># Upgrade run</span>
<a name="l01500"></a>01500 <span class="comment"># -----------</span>
<a name="l01501"></a>01501
<a name="l01502"></a>01502 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#60ccd1851bcea5659fed15010541e244">newlyuninst</a>(self, nuold, nunew):
<a name="l01503"></a>01503 <span class="stringliteral">"""Return a nuninst statstic with only new uninstallable packages</span>
<a name="l01504"></a>01504 <span class="stringliteral"></span>
<a name="l01505"></a>01505 <span class="stringliteral"> This method subtract the uninstallabla packages of the statistic</span>
<a name="l01506"></a>01506 <span class="stringliteral"> `nunew` from the statistic `nuold`.</span>
<a name="l01507"></a>01507 <span class="stringliteral"></span>
<a name="l01508"></a><a class="code" href="classbritney_1_1Britney.html#41c5ee0b9d64b2e76a0c1a1c2b28c73e">01508</a> <span class="stringliteral"> It returns a dictionary with the architectures as keys and the list</span>
<a name="l01509"></a>01509 <span class="stringliteral"> of uninstallable packages as values.</span>
<a name="l01510"></a>01510 <span class="stringliteral"> """</span>
<a name="l01511"></a>01511 res = {}
<a name="l01512"></a>01512 <span class="keywordflow">for</span> arch <span class="keywordflow">in</span> nuold:
<a name="l01513"></a>01513 <span class="keywordflow">if</span> arch <span class="keywordflow">not</span> <span class="keywordflow">in</span> nunew: <span class="keywordflow">continue</span>
<a name="l01514"></a>01514 res[arch] = [x <span class="keywordflow">for</span> x <span class="keywordflow">in</span> nunew[arch] <span class="keywordflow">if</span> x <span class="keywordflow">not</span> <span class="keywordflow">in</span> nuold[arch]]
<a name="l01515"></a>01515 <span class="keywordflow">return</span> res
<a name="l01516"></a>01516
<a name="l01517"></a>01517 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#41c5ee0b9d64b2e76a0c1a1c2b28c73e">get_nuninst</a>(self, requested_arch=None, build=False):
<a name="l01518"></a>01518 <span class="stringliteral">"""Return the uninstallability statistic for all the architectures</span>
<a name="l01519"></a>01519 <span class="stringliteral"></span>
<a name="l01520"></a>01520 <span class="stringliteral"> To calculate the uninstallability counters, the method checks the</span>
<a name="l01521"></a>01521 <span class="stringliteral"> installability of all the packages for all the architectures, and</span>
<a name="l01522"></a>01522 <span class="stringliteral"> tracking dependencies in a recursive way. The architecture</span>
<a name="l01523"></a>01523 <span class="stringliteral"> indipendent packages are checked only for the `nobreakall`</span>
<a name="l01524"></a>01524 <span class="stringliteral"> architectures.</span>
<a name="l01525"></a>01525 <span class="stringliteral"></span>
<a name="l01526"></a>01526 <span class="stringliteral"> It returns a dictionary with the architectures as keys and the list</span>
<a name="l01527"></a>01527 <span class="stringliteral"> of uninstallable packages as values.</span>
<a name="l01528"></a>01528 <span class="stringliteral"> """</span>
<a name="l01529"></a>01529 <span class="comment"># if we are not asked to build the nuninst, read it from the cache</span>
<a name="l01530"></a>01530 <span class="keywordflow">if</span> <span class="keywordflow">not</span> build:
<a name="l01531"></a>01531 <span class="keywordflow">return</span> self.<a class="code" href="classbritney_1_1Britney.html#24fe2c117eadac8eb783e3cb86300265">read_nuninst</a>()
<a name="l01532"></a>01532
<a name="l01533"></a>01533 nuninst = {}
<a name="l01534"></a>01534
<a name="l01535"></a>01535 <span class="comment"># local copies for better performances</span>
<a name="l01536"></a>01536 binaries = self.binaries[<span class="stringliteral">'testing'</span>]
<a name="l01537"></a>01537 check_installable = self.<a class="code" href="classbritney_1_1Britney.html#4c06ddd116a40752c62d4395e92a97df">check_installable</a>
<a name="l01538"></a>01538
<a name="l01539"></a>01539 <span class="comment"># when a new uninstallable package is discovered, check again all the</span>
<a name="l01540"></a>01540 <span class="comment"># reverse dependencies and if they are uninstallable, too, call itself</span>
<a name="l01541"></a>01541 <span class="comment"># recursively</span>
<a name="l01542"></a>01542 <span class="keyword">def </span>add_nuninst(pkg, arch):
<a name="l01543"></a>01543 <span class="keywordflow">if</span> pkg <span class="keywordflow">not</span> <span class="keywordflow">in</span> nuninst[arch]:
<a name="l01544"></a>01544 nuninst[arch].append(pkg)
<a name="l01545"></a>01545 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> binaries[arch][0][pkg][RDEPENDS]:
<a name="l01546"></a>01546 r = check_installable(p, arch, <span class="stringliteral">'testing'</span>, excluded=nuninst[arch], conflicts=<span class="keyword">True</span>)
<a name="l01547"></a>01547 <span class="keywordflow">if</span> <span class="keywordflow">not</span> r:
<a name="l01548"></a>01548 add_nuninst(p, arch)
<a name="l01549"></a>01549
<a name="l01550"></a>01550 <span class="comment"># for all the architectures</span>
<a name="l01551"></a>01551 <span class="keywordflow">for</span> arch <span class="keywordflow">in</span> self.options.architectures:
<a name="l01552"></a>01552 <span class="keywordflow">if</span> requested_arch <span class="keywordflow">and</span> arch != requested_arch: <span class="keywordflow">continue</span>
<a name="l01553"></a>01553 <span class="comment"># if it is in the nobreakall ones, check arch-indipendent packages too</span>
<a name="l01554"></a>01554 <span class="keywordflow">if</span> arch <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.options.nobreakall_arches:
<a name="l01555"></a>01555 skip_archall = <span class="keyword">True</span>
<a name="l01556"></a>01556 <span class="keywordflow">else</span>: skip_archall = <span class="keyword">False</span>
<a name="l01557"></a>01557
<a name="l01558"></a>01558 <span class="comment"># check all the packages for this architecture, calling add_nuninst if a new</span>
<a name="l01559"></a>01559 <span class="comment"># uninstallable package is found</span>
<a name="l01560"></a>01560 nuninst[arch] = []
<a name="l01561"></a>01561 <span class="keywordflow">for</span> pkg_name <span class="keywordflow">in</span> binaries[arch][0]:
<a name="l01562"></a>01562 r = check_installable(pkg_name, arch, <span class="stringliteral">'testing'</span>, excluded=nuninst[arch], conflicts=<span class="keyword">True</span>)
<a name="l01563"></a>01563 <span class="keywordflow">if</span> <span class="keywordflow">not</span> r:
<a name="l01564"></a>01564 add_nuninst(pkg_name, arch)
<a name="l01565"></a>01565
<a name="l01566"></a>01566 <span class="comment"># if they are not required, removed architecture-indipendent packages</span>
<a name="l01567"></a>01567 nuninst[arch + <span class="stringliteral">"+all"</span>] = nuninst[arch][:]
<a name="l01568"></a><a class="code" href="classbritney_1_1Britney.html#e5c18b706e6598474435b1996313cf27">01568</a> <span class="keywordflow">if</span> skip_archall:
<a name="l01569"></a>01569 <span class="keywordflow">for</span> pkg <span class="keywordflow">in</span> nuninst[arch + <span class="stringliteral">"+all"</span>]:
<a name="l01570"></a>01570 bpkg = binaries[arch][0][pkg]
<a name="l01571"></a>01571 <span class="keywordflow">if</span> bpkg[ARCHITECTURE] == <span class="stringliteral">'all'</span>:
<a name="l01572"></a>01572 nuninst[arch].remove(pkg)
<a name="l01573"></a>01573
<a name="l01574"></a>01574 <span class="comment"># return the dictionary with the results</span>
<a name="l01575"></a>01575 <span class="keywordflow">return</span> nuninst
<a name="l01576"></a>01576
<a name="l01577"></a>01577 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#e5c18b706e6598474435b1996313cf27">eval_nuninst</a>(self, nuninst, original=None):
<a name="l01578"></a>01578 <span class="stringliteral">"""Return a string which represents the uninstallability counters</span>
<a name="l01579"></a>01579 <span class="stringliteral"></span>
<a name="l01580"></a>01580 <span class="stringliteral"> This method returns a string which represents the uninstallability</span>
<a name="l01581"></a>01581 <span class="stringliteral"> counters reading the uninstallability statistics `nuninst` and, if</span>
<a name="l01582"></a>01582 <span class="stringliteral"> present, merging the results with the `original` one.</span>
<a name="l01583"></a>01583 <span class="stringliteral"></span>
<a name="l01584"></a>01584 <span class="stringliteral"> An example of the output string is:</span>
<a name="l01585"></a>01585 <span class="stringliteral"> 1+2: i-0:a-0:a-0:h-0:i-1:m-0:m-0:p-0:a-0:m-0:s-2:s-0</span>
<a name="l01586"></a>01586 <span class="stringliteral"></span>
<a name="l01587"></a>01587 <span class="stringliteral"> where the first part is the number of broken packages in non-break</span>
<a name="l01588"></a>01588 <span class="stringliteral"> architectures + the total number of broken packages for all the</span>
<a name="l01589"></a>01589 <span class="stringliteral"> architectures.</span>
<a name="l01590"></a>01590 <span class="stringliteral"> """</span>
<a name="l01591"></a>01591 res = []
<a name="l01592"></a>01592 total = 0
<a name="l01593"></a>01593 totalbreak = 0
<a name="l01594"></a>01594 <span class="keywordflow">for</span> arch <span class="keywordflow">in</span> self.options.architectures:
<a name="l01595"></a>01595 <span class="keywordflow">if</span> arch <span class="keywordflow">in</span> nuninst:
<a name="l01596"></a>01596 n = len(nuninst[arch])
<a name="l01597"></a>01597 <span class="keywordflow">elif</span> original <span class="keywordflow">and</span> arch <span class="keywordflow">in</span> original:
<a name="l01598"></a><a class="code" href="classbritney_1_1Britney.html#b8dd18ead23b6e1126bb4c2a5c3cd8ba">01598</a> n = len(original[arch])
<a name="l01599"></a>01599 <span class="keywordflow">else</span>: <span class="keywordflow">continue</span>
<a name="l01600"></a>01600 <span class="keywordflow">if</span> arch <span class="keywordflow">in</span> self.options.break_arches:
<a name="l01601"></a>01601 totalbreak = totalbreak + n
<a name="l01602"></a>01602 <span class="keywordflow">else</span>:
<a name="l01603"></a>01603 total = total + n
<a name="l01604"></a>01604 res.append(<span class="stringliteral">"%s-%d"</span> % (arch[0], n))
<a name="l01605"></a>01605 <span class="keywordflow">return</span> <span class="stringliteral">"%d+%d: %s"</span> % (total, totalbreak, <span class="stringliteral">":"</span>.join(res))
<a name="l01606"></a>01606
<a name="l01607"></a>01607 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#b8dd18ead23b6e1126bb4c2a5c3cd8ba">eval_uninst</a>(self, nuninst):
<a name="l01608"></a>01608 <span class="stringliteral">"""Return a string which represents the uninstallable packages</span>
<a name="l01609"></a>01609 <span class="stringliteral"></span>
<a name="l01610"></a>01610 <span class="stringliteral"> This method returns a string which represents the uninstallable</span>
<a name="l01611"></a>01611 <span class="stringliteral"> packages reading the uninstallability statistics `nuninst`.</span>
<a name="l01612"></a>01612 <span class="stringliteral"></span>
<a name="l01613"></a><a class="code" href="classbritney_1_1Britney.html#2f7401c8e41b8095bd99bd656bb41546">01613</a> <span class="stringliteral"> An example of the output string is:</span>
<a name="l01614"></a>01614 <span class="stringliteral"> * i386: broken-pkg1, broken-pkg2</span>
<a name="l01615"></a>01615 <span class="stringliteral"> """</span>
<a name="l01616"></a>01616 parts = []
<a name="l01617"></a>01617 <span class="keywordflow">for</span> arch <span class="keywordflow">in</span> self.options.architectures:
<a name="l01618"></a>01618 <span class="keywordflow">if</span> arch <span class="keywordflow">in</span> nuninst <span class="keywordflow">and</span> len(nuninst[arch]) > 0:
<a name="l01619"></a>01619 parts.append(<span class="stringliteral">" * %s: %s\n"</span> % (arch,<span class="stringliteral">", "</span>.join(sorted(nuninst[arch]))))
<a name="l01620"></a><a class="code" href="classbritney_1_1Britney.html#4c06ddd116a40752c62d4395e92a97df">01620</a> <span class="keywordflow">return</span> <span class="stringliteral">""</span>.join(parts)
<a name="l01621"></a>01621
<a name="l01622"></a>01622 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#2f7401c8e41b8095bd99bd656bb41546">is_nuninst_asgood_generous</a>(self, old, new):
<a name="l01623"></a>01623 diff = 0
<a name="l01624"></a>01624 <span class="keywordflow">for</span> arch <span class="keywordflow">in</span> self.options.architectures:
<a name="l01625"></a>01625 <span class="keywordflow">if</span> arch <span class="keywordflow">in</span> self.options.break_arches: <span class="keywordflow">continue</span>
<a name="l01626"></a>01626 diff = diff + (len(new[arch]) - len(old[arch]))
<a name="l01627"></a>01627 <span class="keywordflow">return</span> diff <= 0
<a name="l01628"></a>01628
<a name="l01629"></a>01629 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#4c06ddd116a40752c62d4395e92a97df">check_installable</a>(self, pkg, arch, suite, excluded=[], conflicts=False):
<a name="l01630"></a>01630 <span class="stringliteral">"""Check if a package is installable</span>
<a name="l01631"></a>01631 <span class="stringliteral"></span>
<a name="l01632"></a>01632 <span class="stringliteral"> This method analyzes the dependencies of the binary package specified</span>
<a name="l01633"></a>01633 <span class="stringliteral"> by the parameter `pkg' for the architecture `arch' within the suite</span>
<a name="l01634"></a>01634 <span class="stringliteral"> `suite'. If the dependency can be satisfied in the given `suite` and</span>
<a name="l01635"></a>01635 <span class="stringliteral"> `conflicts` parameter is True, then the co-installability with </span>
<a name="l01636"></a>01636 <span class="stringliteral"> conflicts handling is checked.</span>
<a name="l01637"></a>01637 <span class="stringliteral"></span>
<a name="l01638"></a>01638 <span class="stringliteral"> The dependency fields checked are Pre-Depends and Depends.</span>
<a name="l01639"></a>01639 <span class="stringliteral"></span>
<a name="l01640"></a>01640 <span class="stringliteral"> The method returns a boolean which is True if the given package is</span>
<a name="l01641"></a>01641 <span class="stringliteral"> installable.</span>
<a name="l01642"></a>01642 <span class="stringliteral"> """</span>
<a name="l01643"></a>01643 <span class="comment"># retrieve the binary package from the specified suite and arch</span>
<a name="l01644"></a>01644 binary_u = self.binaries[suite][arch][0][pkg]
<a name="l01645"></a>01645
<a name="l01646"></a>01646 <span class="comment"># local copies for better performances</span>
<a name="l01647"></a>01647 parse_depends = apt_pkg.ParseDepends
<a name="l01648"></a>01648 get_dependency_solvers = self.<a class="code" href="classbritney_1_1Britney.html#5461f49e3e75a251ebedfd37d2a5ff0c">get_dependency_solvers</a>
<a name="l01649"></a>01649
<a name="l01650"></a>01650 <span class="comment"># analyze the dependency fields (if present)</span>
<a name="l01651"></a>01651 <span class="keywordflow">for</span> type <span class="keywordflow">in</span> (PREDEPENDS, DEPENDS):
<a name="l01652"></a>01652 <span class="keywordflow">if</span> <span class="keywordflow">not</span> binary_u[type]:
<a name="l01653"></a>01653 <span class="keywordflow">continue</span>
<a name="l01654"></a>01654
<a name="l01655"></a>01655 <span class="comment"># for every block of dependency (which is formed as conjunction of disconjunction)</span>
<a name="l01656"></a>01656 <span class="keywordflow">for</span> block <span class="keywordflow">in</span> parse_depends(binary_u[type]):
<a name="l01657"></a>01657 <span class="comment"># if the block is not satisfied, return False</span>
<a name="l01658"></a>01658 solved, packages = get_dependency_solvers(block, arch, <span class="stringliteral">'testing'</span>, excluded, strict=<span class="keyword">True</span>)
<a name="l01659"></a>01659 <span class="keywordflow">if</span> <span class="keywordflow">not</span> solved:
<a name="l01660"></a>01660 <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l01661"></a><a class="code" href="classbritney_1_1Britney.html#998b3ddbaedbb6cdb732b2307477e96f">01661</a>
<a name="l01662"></a>01662 <span class="comment"># otherwise, the package is installable (not considering conflicts)</span>
<a name="l01663"></a>01663 <span class="comment"># if the conflicts handling is enabled, then check conflicts before</span>
<a name="l01664"></a>01664 <span class="comment"># saying that the package is really installable</span>
<a name="l01665"></a>01665 <span class="keywordflow">if</span> conflicts:
<a name="l01666"></a>01666 <span class="keywordflow">return</span> self.<a class="code" href="classbritney_1_1Britney.html#998b3ddbaedbb6cdb732b2307477e96f">check_conflicts</a>(pkg, arch, excluded, {}, {})
<a name="l01667"></a>01667
<a name="l01668"></a>01668 <span class="keywordflow">return</span> <span class="keyword">True</span>
<a name="l01669"></a>01669
<a name="l01670"></a>01670 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#998b3ddbaedbb6cdb732b2307477e96f">check_conflicts</a>(self, pkg, arch, broken, system, conflicts):
<a name="l01671"></a>01671 <span class="stringliteral">"""Check if a package can be installed satisfying the conflicts</span>
<a name="l01672"></a>01672 <span class="stringliteral"></span>
<a name="l01673"></a>01673 <span class="stringliteral"> This method checks if the `pkg` package from the `arch` architecture</span>
<a name="l01674"></a>01674 <span class="stringliteral"> can be installed (excluding `broken` packages) within the system</span>
<a name="l01675"></a>01675 <span class="stringliteral"> `system` along with all its dependencies. This means that all the</span>
<a name="l01676"></a>01676 <span class="stringliteral"> conflicts relationships are checked in order to achieve the test</span>
<a name="l01677"></a>01677 <span class="stringliteral"> co-installability of the package.</span>
<a name="l01678"></a>01678 <span class="stringliteral"></span>
<a name="l01679"></a>01679 <span class="stringliteral"> The method returns a boolean which is True if the given package is</span>
<a name="l01680"></a>01680 <span class="stringliteral"> co-installable in the given system.</span>
<a name="l01681"></a>01681 <span class="stringliteral"> """</span>
<a name="l01682"></a>01682
<a name="l01683"></a>01683 <span class="comment"># local copies for better performances</span>
<a name="l01684"></a>01684 binaries = self.binaries[<span class="stringliteral">'testing'</span>][arch]
<a name="l01685"></a>01685 parse_depends = apt_pkg.ParseDepends
<a name="l01686"></a>01686 check_depends = apt_pkg.CheckDep
<a name="l01687"></a>01687
<a name="l01688"></a>01688 <span class="comment"># unregister conflicts, local method to remove conflicts</span>
<a name="l01689"></a>01689 <span class="comment"># registered from a given package.</span>
<a name="l01690"></a>01690 <span class="keyword">def </span>unregister_conflicts(pkg, conflicts):
<a name="l01691"></a>01691 <span class="keywordflow">for</span> c <span class="keywordflow">in</span> conflicts.keys():
<a name="l01692"></a>01692 i = 0
<a name="l01693"></a>01693 <span class="keywordflow">while</span> i < len(conflicts[c]):
<a name="l01694"></a>01694 <span class="keywordflow">if</span> conflicts[c][i][3] == pkg:
<a name="l01695"></a>01695 del conflicts[c][i]
<a name="l01696"></a>01696 <span class="keywordflow">else</span>: i = i + 1
<a name="l01697"></a>01697 <span class="keywordflow">if</span> len(conflicts[c]) == 0:
<a name="l01698"></a>01698 del conflicts[c]
<a name="l01699"></a>01699
<a name="l01700"></a>01700 <span class="keyword">def </span>remove_package(pkg, system, conflicts):
<a name="l01701"></a>01701 <span class="keywordflow">for</span> k <span class="keywordflow">in</span> system:
<a name="l01702"></a>01702 <span class="keywordflow">if</span> pkg <span class="keywordflow">in</span> system[k][1]:
<a name="l01703"></a>01703 system[k][1].remove(pkg)
<a name="l01704"></a>01704 unregister_conflicts(pkg, conflicts)
<a name="l01705"></a>01705
<a name="l01706"></a>01706 <span class="comment"># handle a conflict, local method to solve a conflict which happened</span>
<a name="l01707"></a>01707 <span class="comment"># in the system; the behaviour of the conflict-solver is:</span>
<a name="l01708"></a>01708 <span class="comment"># 1. If there are alternatives for the package which must be removed,</span>
<a name="l01709"></a>01709 <span class="comment"># try them, and if one of them resolves the system return True;</span>
<a name="l01710"></a>01710 <span class="comment"># 2. If none of the alternatives can solve the conflict, then call</span>
<a name="l01711"></a>01711 <span class="comment"># itself for the package which depends on the conflicting package.</span>
<a name="l01712"></a>01712 <span class="comment"># 3. If the top of the dependency tree is reached, then the conflict</span>
<a name="l01713"></a>01713 <span class="comment"># can't be solved, so return False.</span>
<a name="l01714"></a>01714 <span class="keyword">def </span>handle_conflict(pkg, source, system, conflicts):
<a name="l01715"></a>01715 <span class="comment"># skip packages which don't have reverse dependencies</span>
<a name="l01716"></a>01716 <span class="keywordflow">if</span> source <span class="keywordflow">not</span> <span class="keywordflow">in</span> system <span class="keywordflow">or</span> system[source][1] == []:
<a name="l01717"></a>01717 remove_package(source, system, conflicts)
<a name="l01718"></a>01718 <span class="keywordflow">return</span> (system, conflicts)
<a name="l01719"></a>01719 <span class="comment"># reached the top of the tree</span>
<a name="l01720"></a>01720 <span class="keywordflow">if</span> <span class="keywordflow">not</span> system[source][1][0]:
<a name="l01721"></a>01721 <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l01722"></a>01722 <span class="comment"># remove its conflicts</span>
<a name="l01723"></a>01723 unregister_conflicts(source, conflicts)
<a name="l01724"></a>01724 <span class="comment"># if there are alternatives, try them</span>
<a name="l01725"></a>01725 alternatives = system[source][0]
<a name="l01726"></a>01726 <span class="keywordflow">for</span> alt <span class="keywordflow">in</span> alternatives:
<a name="l01727"></a>01727 <span class="keywordflow">if</span> satisfy(alt, [x <span class="keywordflow">for</span> x <span class="keywordflow">in</span> alternatives <span class="keywordflow">if</span> x != alt], pkg_from=system[source][1],
<a name="l01728"></a>01728 system=system, conflicts=conflicts, excluded=[source]):
<a name="l01729"></a>01729 remove_package(source, system, conflicts)
<a name="l01730"></a>01730 <span class="keywordflow">return</span> (system, conflicts)
<a name="l01731"></a>01731 <span class="comment"># there are no good alternatives, so remove the package which depends on it</span>
<a name="l01732"></a>01732 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> system[source][1]:
<a name="l01733"></a>01733 <span class="comment"># the package does not exist, we reached the top of the tree</span>
<a name="l01734"></a>01734 <span class="keywordflow">if</span> <span class="keywordflow">not</span> p: <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l01735"></a>01735 <span class="comment"># we are providing the package we conflict on (eg. exim4 and mail-transfer-agent), skip it</span>
<a name="l01736"></a>01736 <span class="keywordflow">if</span> p == pkg: <span class="keywordflow">continue</span>
<a name="l01737"></a>01737 output = handle_conflict(pkg, p, system, conflicts)
<a name="l01738"></a>01738 <span class="keywordflow">if</span> output:
<a name="l01739"></a>01739 system, conflicts = output
<a name="l01740"></a>01740 <span class="keywordflow">else</span>: <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l01741"></a>01741 remove_package(source, system, conflicts)
<a name="l01742"></a>01742 <span class="keywordflow">return</span> (system, conflicts)
<a name="l01743"></a>01743
<a name="l01744"></a>01744 <span class="comment"># dependency tree satisfier, local method which tries to satisfy the dependency</span>
<a name="l01745"></a>01745 <span class="comment"># tree for a given package. It calls itself recursively in order to check the</span>
<a name="l01746"></a>01746 <span class="comment"># co-installability of the full tree of dependency of the starting package.</span>
<a name="l01747"></a>01747 <span class="comment"># If a conflict is detected, it tries to handle it calling the handle_conflict</span>
<a name="l01748"></a>01748 <span class="comment"># method; if it can't be resolved, then it returns False.</span>
<a name="l01749"></a>01749 <span class="keyword">def </span>satisfy(pkg, pkg_alt=None, pkg_from=None, system=system, conflicts=conflicts, excluded=[]):
<a name="l01750"></a>01750 <span class="comment"># if it is real package and it is already installed, skip it and return True</span>
<a name="l01751"></a>01751 <span class="keywordflow">if</span> pkg <span class="keywordflow">in</span> binaries[0]:
<a name="l01752"></a>01752 <span class="keywordflow">if</span> pkg <span class="keywordflow">in</span> system:
<a name="l01753"></a>01753 <span class="keywordflow">if</span> type(pkg_from) == list:
<a name="l01754"></a>01754 system[pkg][1].extend(pkg_from)
<a name="l01755"></a>01755 <span class="keywordflow">else</span>:
<a name="l01756"></a>01756 system[pkg][1].append(pkg_from)
<a name="l01757"></a>01757 system[pkg] = (system[pkg][1], filter(<span class="keyword">lambda</span> x: x <span class="keywordflow">in</span> pkg_alt, system[pkg][0]))
<a name="l01758"></a>01758 <span class="keywordflow">return</span> <span class="keyword">True</span>
<a name="l01759"></a>01759 binary_u = binaries[0][pkg]
<a name="l01760"></a>01760 <span class="keywordflow">else</span>: binary_u = <span class="keywordtype">None</span>
<a name="l01761"></a>01761
<a name="l01762"></a>01762 <span class="comment"># if it is a virtual package</span>
<a name="l01763"></a>01763 providers = []
<a name="l01764"></a>01764 <span class="keywordflow">if</span> pkg_from <span class="keywordflow">and</span> pkg <span class="keywordflow">in</span> binaries[1]:
<a name="l01765"></a>01765 providers = binaries[1][pkg]
<a name="l01766"></a>01766 <span class="comment"># it is both real and virtual, so the providers are alternatives</span>
<a name="l01767"></a>01767 <span class="keywordflow">if</span> binary_u:
<a name="l01768"></a>01768 providers = filter(<span class="keyword">lambda</span> x: (<span class="keywordflow">not</span> pkg_alt <span class="keywordflow">or</span> x <span class="keywordflow">not</span> <span class="keywordflow">in</span> pkg_alt) <span class="keywordflow">and</span> x != pkg, providers)
<a name="l01769"></a>01769 <span class="keywordflow">if</span> <span class="keywordflow">not</span> pkg_alt:
<a name="l01770"></a>01770 pkg_alt = []
<a name="l01771"></a>01771 pkg_alt.extend(providers)
<a name="l01772"></a>01772 <span class="comment"># try all the alternatives and if none of them suits, give up and return False</span>
<a name="l01773"></a>01773 <span class="keywordflow">else</span>:
<a name="l01774"></a>01774 <span class="comment"># if we already have a provider in the system, everything is ok and return True</span>
<a name="l01775"></a>01775 <span class="keywordflow">if</span> len(filter(<span class="keyword">lambda</span> x: x <span class="keywordflow">in</span> providers <span class="keywordflow">and</span> x <span class="keywordflow">not</span> <span class="keywordflow">in</span> excluded, system)) > 0:
<a name="l01776"></a>01776 <span class="keywordflow">return</span> <span class="keyword">True</span>
<a name="l01777"></a>01777 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> providers:
<a name="l01778"></a>01778 <span class="comment"># try to install the providers skipping excluded packages,</span>
<a name="l01779"></a>01779 <span class="comment"># which we already tried but do not work</span>
<a name="l01780"></a>01780 <span class="keywordflow">if</span> p <span class="keywordflow">in</span> excluded: <span class="keywordflow">continue</span>
<a name="l01781"></a>01781 <span class="keywordflow">elif</span> satisfy(p, [a <span class="keywordflow">for</span> a <span class="keywordflow">in</span> providers <span class="keywordflow">if</span> a != p], pkg_from):
<a name="l01782"></a>01782 <span class="keywordflow">return</span> <span class="keyword">True</span>
<a name="l01783"></a>01783 <span class="comment"># if none of them suits, return False</span>
<a name="l01784"></a>01784 <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l01785"></a>01785
<a name="l01786"></a>01786 <span class="comment"># if the package doesn't exist, return False</span>
<a name="l01787"></a>01787 <span class="keywordflow">if</span> <span class="keywordflow">not</span> binary_u: <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l01788"></a>01788
<a name="l01789"></a>01789 <span class="comment"># it is broken, but we have providers</span>
<a name="l01790"></a>01790 <span class="keywordflow">if</span> pkg <span class="keywordflow">in</span> broken <span class="keywordflow">and</span> pkg_from:
<a name="l01791"></a>01791 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> providers:
<a name="l01792"></a>01792 <span class="comment"># try to install the providers skipping excluded packages,</span>
<a name="l01793"></a>01793 <span class="comment"># which we already tried but do not work</span>
<a name="l01794"></a>01794 <span class="keywordflow">if</span> p <span class="keywordflow">in</span> excluded: <span class="keywordflow">continue</span>
<a name="l01795"></a>01795 <span class="keywordflow">elif</span> satisfy(p, [a <span class="keywordflow">for</span> a <span class="keywordflow">in</span> providers <span class="keywordflow">if</span> a != p], pkg_from):
<a name="l01796"></a>01796 <span class="keywordflow">return</span> <span class="keyword">True</span>
<a name="l01797"></a>01797 <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l01798"></a>01798
<a name="l01799"></a>01799 <span class="comment"># install the package into the system, recording which package required it</span>
<a name="l01800"></a>01800 <span class="keywordflow">if</span> type(pkg_from) != list:
<a name="l01801"></a>01801 pkg_from = [pkg_from]
<a name="l01802"></a>01802 system[pkg] = (pkg_alt <span class="keywordflow">or</span> [], pkg_from)
<a name="l01803"></a>01803
<a name="l01804"></a>01804 <span class="comment"># register provided packages</span>
<a name="l01805"></a>01805 <span class="keywordflow">if</span> binary_u[PROVIDES]:
<a name="l01806"></a>01806 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> binary_u[PROVIDES]:
<a name="l01807"></a>01807 <span class="keywordflow">if</span> p <span class="keywordflow">in</span> system:
<a name="l01808"></a>01808 <span class="comment"># do not consider packages providing the one which we are checking</span>
<a name="l01809"></a>01809 <span class="keywordflow">if</span> len(system[p][1]) == 1 <span class="keywordflow">and</span> system[p][1][0] == <span class="keywordtype">None</span>: <span class="keywordflow">continue</span>
<a name="l01810"></a>01810 system[p][1].append(pkg)
<a name="l01811"></a>01811 <span class="keywordflow">else</span>:
<a name="l01812"></a>01812 system[p] = ([], [pkg])
<a name="l01813"></a>01813
<a name="l01814"></a>01814 <span class="comment"># check the conflicts</span>
<a name="l01815"></a>01815 <span class="keywordflow">if</span> pkg <span class="keywordflow">in</span> conflicts:
<a name="l01816"></a>01816 <span class="keywordflow">for</span> name, version, op, conflicting <span class="keywordflow">in</span> conflicts[pkg]:
<a name="l01817"></a>01817 <span class="keywordflow">if</span> conflicting <span class="keywordflow">in</span> binary_u[PROVIDES] <span class="keywordflow">and</span> system[conflicting][1] == [pkg]: <span class="keywordflow">continue</span>
<a name="l01818"></a>01818 <span class="keywordflow">if</span> op == <span class="stringliteral">''</span> <span class="keywordflow">and</span> version == <span class="stringliteral">''</span> <span class="keywordflow">or</span> check_depends(binary_u[VERSION], op, version):
<a name="l01819"></a>01819 <span class="comment"># if conflict is found, check if it can be solved removing</span>
<a name="l01820"></a>01820 <span class="comment"># already-installed packages without broking the system; if</span>
<a name="l01821"></a>01821 <span class="comment"># this is not possible, give up and return False</span>
<a name="l01822"></a>01822 output = handle_conflict(pkg, conflicting, system.copy(), conflicts.copy())
<a name="l01823"></a>01823 <span class="keywordflow">if</span> output:
<a name="l01824"></a>01824 system, conflicts = output
<a name="l01825"></a>01825 <span class="keywordflow">else</span>:
<a name="l01826"></a>01826 del system[pkg]
<a name="l01827"></a>01827 <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l01828"></a>01828
<a name="l01829"></a>01829 <span class="comment"># register conflicts from the just-installed package</span>
<a name="l01830"></a>01830 <span class="keywordflow">if</span> binary_u[CONFLICTS]:
<a name="l01831"></a>01831 <span class="keywordflow">for</span> block <span class="keywordflow">in</span> map(operator.itemgetter(0), parse_depends(binary_u[CONFLICTS] <span class="keywordflow">or</span> [])):
<a name="l01832"></a>01832 name, version, op = block
<a name="l01833"></a>01833 <span class="comment"># skip conflicts for packages provided by itself</span>
<a name="l01834"></a>01834 <span class="comment"># if the conflicting package is in the system (and it is not a self-conflict)</span>
<a name="l01835"></a>01835 <span class="keywordflow">if</span> <span class="keywordflow">not</span> (name <span class="keywordflow">in</span> binary_u[PROVIDES] <span class="keywordflow">and</span> system[name][1] == [pkg]) <span class="keywordflow">and</span> \
<a name="l01836"></a>01836 block[0] != pkg <span class="keywordflow">and</span> block[0] <span class="keywordflow">in</span> system:
<a name="l01837"></a>01837 <span class="keywordflow">if</span> block[0] <span class="keywordflow">in</span> binaries[0]:
<a name="l01838"></a>01838 binary_c = binaries[0][block[0]]
<a name="l01839"></a>01839 <span class="keywordflow">else</span>: binary_c = <span class="keywordtype">None</span>
<a name="l01840"></a>01840 <span class="keywordflow">if</span> op == <span class="stringliteral">''</span> <span class="keywordflow">and</span> version == <span class="stringliteral">''</span> <span class="keywordflow">or</span> binary_c <span class="keywordflow">and</span> check_depends(binary_c[VERSION], op, version):
<a name="l01841"></a>01841 <span class="comment"># if conflict is found, check if it can be solved removing</span>
<a name="l01842"></a>01842 <span class="comment"># already-installed packages without broking the system; if</span>
<a name="l01843"></a>01843 <span class="comment"># this is not possible, give up and return False</span>
<a name="l01844"></a>01844 output = handle_conflict(pkg, name, system.copy(), conflicts.copy())
<a name="l01845"></a>01845 <span class="keywordflow">if</span> output:
<a name="l01846"></a>01846 system, conflicts = output
<a name="l01847"></a>01847 <span class="keywordflow">else</span>:
<a name="l01848"></a>01848 del system[pkg]
<a name="l01849"></a>01849 unregister_conflicts(pkg, conflicts)
<a name="l01850"></a>01850 <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l01851"></a>01851 <span class="comment"># register the conflict)</span>
<a name="l01852"></a>01852 <span class="keywordflow">if</span> block[0] <span class="keywordflow">not</span> <span class="keywordflow">in</span> conflicts:
<a name="l01853"></a>01853 conflicts[block[0]] = []
<a name="l01854"></a>01854 conflicts[block[0]].append((name, version, op, pkg))
<a name="l01855"></a>01855
<a name="l01856"></a>01856 <span class="comment"># list all its dependencies ...</span>
<a name="l01857"></a>01857 dependencies = []
<a name="l01858"></a>01858 <span class="keywordflow">for</span> key <span class="keywordflow">in</span> (PREDEPENDS, DEPENDS):
<a name="l01859"></a>01859 <span class="keywordflow">if</span> <span class="keywordflow">not</span> binary_u[key]: <span class="keywordflow">continue</span>
<a name="l01860"></a>01860 dependencies.extend(parse_depends(binary_u[key]))
<a name="l01861"></a>01861
<a name="l01862"></a>01862 <span class="comment"># ... and go through them</span>
<a name="l01863"></a>01863 <span class="keywordflow">for</span> block <span class="keywordflow">in</span> dependencies:
<a name="l01864"></a>01864 <span class="comment"># list the possible alternatives, in case of a conflict</span>
<a name="l01865"></a>01865 alternatives = map(operator.itemgetter(0), block)
<a name="l01866"></a>01866 valid = <span class="keyword">False</span>
<a name="l01867"></a>01867 <span class="keywordflow">for</span> name, version, op <span class="keywordflow">in</span> block:
<a name="l01868"></a>01868 <span class="comment"># otherwise, if it is already installed or it is installable, the block is satisfied</span>
<a name="l01869"></a>01869 <span class="keywordflow">if</span> name <span class="keywordflow">in</span> system <span class="keywordflow">or</span> satisfy(name, [a <span class="keywordflow">for</span> a <span class="keywordflow">in</span> alternatives <span class="keywordflow">if</span> a != name], pkg):
<a name="l01870"></a>01870 valid = <span class="keyword">True</span>
<a name="l01871"></a>01871 <span class="keywordflow">break</span>
<a name="l01872"></a>01872 <span class="comment"># if the block can't be satisfied, the package is not installable so</span>
<a name="l01873"></a>01873 <span class="comment"># we need to remove it, its conflicts and its provided packages and</span>
<a name="l01874"></a>01874 <span class="comment"># return False</span>
<a name="l01875"></a>01875 <span class="keywordflow">if</span> <span class="keywordflow">not</span> valid:
<a name="l01876"></a>01876 del system[pkg]
<a name="l01877"></a>01877 unregister_conflicts(pkg, conflicts)
<a name="l01878"></a>01878 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> providers:
<a name="l01879"></a>01879 <span class="keywordflow">if</span> satisfy(p, [a <span class="keywordflow">for</span> a <span class="keywordflow">in</span> providers <span class="keywordflow">if</span> a != p], pkg_from):
<a name="l01880"></a><a class="code" href="classbritney_1_1Britney.html#22af61b8a7f6fe71a79d28b5016cae1d">01880</a> <span class="keywordflow">return</span> <span class="keyword">True</span>
<a name="l01881"></a>01881 <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l01882"></a>01882
<a name="l01883"></a>01883 <span class="comment"># if all the blocks have been satisfied, the package is installable</span>
<a name="l01884"></a>01884 <span class="keywordflow">return</span> <span class="keyword">True</span>
<a name="l01885"></a>01885
<a name="l01886"></a>01886 <span class="comment"># check the package at the top of the tree</span>
<a name="l01887"></a>01887 <span class="keywordflow">return</span> satisfy(pkg)
<a name="l01888"></a>01888
<a name="l01889"></a>01889 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#22af61b8a7f6fe71a79d28b5016cae1d">doop_source</a>(self, pkg):
<a name="l01890"></a>01890 <span class="stringliteral">"""Apply a change to the testing distribution as requested by `pkg`</span>
<a name="l01891"></a>01891 <span class="stringliteral"></span>
<a name="l01892"></a>01892 <span class="stringliteral"> This method apply the changes required by the action `pkg` tracking</span>
<a name="l01893"></a>01893 <span class="stringliteral"> them so it will be possible to revert them.</span>
<a name="l01894"></a>01894 <span class="stringliteral"></span>
<a name="l01895"></a>01895 <span class="stringliteral"> The method returns a list of the package name, the suite where the</span>
<a name="l01896"></a>01896 <span class="stringliteral"> package comes from, the list of packages affected by the change and</span>
<a name="l01897"></a>01897 <span class="stringliteral"> the dictionary undo which can be used to rollback the changes.</span>
<a name="l01898"></a>01898 <span class="stringliteral"> """</span>
<a name="l01899"></a>01899 undo = {<span class="stringliteral">'binaries'</span>: {}, <span class="stringliteral">'sources'</span>: {}, <span class="stringliteral">'virtual'</span>: {}, <span class="stringliteral">'nvirtual'</span>: []}
<a name="l01900"></a>01900
<a name="l01901"></a>01901 affected = []
<a name="l01902"></a>01902 arch = <span class="keywordtype">None</span>
<a name="l01903"></a>01903
<a name="l01904"></a>01904 <span class="comment"># local copies for better performances</span>
<a name="l01905"></a>01905 sources = self.sources
<a name="l01906"></a>01906 binaries = self.binaries[<span class="stringliteral">'testing'</span>]
<a name="l01907"></a>01907
<a name="l01908"></a>01908 <span class="comment"># removal of single-arch binary package = "-<package>/<arch>"</span>
<a name="l01909"></a>01909 <span class="keywordflow">if</span> pkg[0] == <span class="stringliteral">"-"</span> <span class="keywordflow">and</span> <span class="stringliteral">"/"</span> <span class="keywordflow">in</span> pkg:
<a name="l01910"></a>01910 pkg_name, arch = pkg.split(<span class="stringliteral">"/"</span>)
<a name="l01911"></a>01911 pkg_name = pkg_name[1:]
<a name="l01912"></a>01912 <span class="keywordflow">if</span> arch.endswith(<span class="stringliteral">"_tpu"</span>):
<a name="l01913"></a>01913 arch, suite = arch.split(<span class="stringliteral">"_"</span>)
<a name="l01914"></a>01914 <span class="keywordflow">else</span>: suite = <span class="stringliteral">"testing"</span>
<a name="l01915"></a>01915 <span class="comment"># arch = "<source>/<arch>",</span>
<a name="l01916"></a>01916 <span class="keywordflow">elif</span> <span class="stringliteral">"/"</span> <span class="keywordflow">in</span> pkg:
<a name="l01917"></a>01917 pkg_name, arch = pkg.split(<span class="stringliteral">"/"</span>)
<a name="l01918"></a>01918 suite = <span class="stringliteral">"unstable"</span>
<a name="l01919"></a>01919 <span class="comment"># removal of source packages = "-<source>",</span>
<a name="l01920"></a>01920 <span class="keywordflow">elif</span> pkg[0] == <span class="stringliteral">"-"</span>:
<a name="l01921"></a>01921 pkg_name = pkg[1:]
<a name="l01922"></a>01922 suite = <span class="stringliteral">"testing"</span>
<a name="l01923"></a>01923 <span class="comment"># testing-proposed-updates = "<source>_tpu"</span>
<a name="l01924"></a>01924 <span class="keywordflow">elif</span> pkg[0].endswith(<span class="stringliteral">"_tpu"</span>):
<a name="l01925"></a>01925 pkg_name = pkg[:-4]
<a name="l01926"></a>01926 suite = <span class="stringliteral">"tpu"</span>
<a name="l01927"></a>01927 <span class="comment"># normal update of source packages = "<source>"</span>
<a name="l01928"></a>01928 <span class="keywordflow">else</span>:
<a name="l01929"></a>01929 pkg_name = pkg
<a name="l01930"></a>01930 suite = <span class="stringliteral">"unstable"</span>
<a name="l01931"></a>01931
<a name="l01932"></a>01932 <span class="comment"># remove all binary packages (if the source already exists)</span>
<a name="l01933"></a>01933 <span class="keywordflow">if</span> <span class="keywordflow">not</span> (arch <span class="keywordflow">and</span> pkg[0] == <span class="stringliteral">'-'</span>):
<a name="l01934"></a>01934 <span class="keywordflow">if</span> pkg_name <span class="keywordflow">in</span> sources[<span class="stringliteral">'testing'</span>]:
<a name="l01935"></a>01935 source = sources[<span class="stringliteral">'testing'</span>][pkg_name]
<a name="l01936"></a>01936 <span class="comment"># remove all the binaries</span>
<a name="l01937"></a>01937 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> source[BINARIES]:
<a name="l01938"></a>01938 binary, parch = p.split(<span class="stringliteral">"/"</span>)
<a name="l01939"></a>01939 <span class="keywordflow">if</span> arch <span class="keywordflow">and</span> parch != arch: <span class="keywordflow">continue</span>
<a name="l01940"></a>01940 <span class="comment"># if a smooth update is possible for the package, skip it</span>
<a name="l01941"></a>01941 <span class="keywordflow">if</span> <span class="keywordflow">not</span> self.options.compatible <span class="keywordflow">and</span> suite == <span class="stringliteral">'unstable'</span> <span class="keywordflow">and</span> \
<a name="l01942"></a>01942 binary <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.binaries[suite][parch][0] <span class="keywordflow">and</span> \
<a name="l01943"></a>01943 (<span class="stringliteral">'ALL'</span> <span class="keywordflow">in</span> self.options.smooth_updates <span class="keywordflow">or</span> \
<a name="l01944"></a>01944 binaries[parch][0][binary][SECTION] <span class="keywordflow">in</span> self.options.smooth_updates):
<a name="l01945"></a>01945 <span class="keywordflow">continue</span>
<a name="l01946"></a>01946 <span class="comment"># save the old binary for undo</span>
<a name="l01947"></a>01947 undo[<span class="stringliteral">'binaries'</span>][p] = binaries[parch][0][binary]
<a name="l01948"></a>01948 <span class="comment"># all the reverse dependencies are affected by the change</span>
<a name="l01949"></a>01949 <span class="keywordflow">for</span> j <span class="keywordflow">in</span> binaries[parch][0][binary][RDEPENDS]:
<a name="l01950"></a>01950 key = (j, parch)
<a name="l01951"></a>01951 <span class="keywordflow">if</span> key <span class="keywordflow">not</span> <span class="keywordflow">in</span> affected: affected.append(key)
<a name="l01952"></a>01952 <span class="comment"># remove the provided virtual packages</span>
<a name="l01953"></a>01953 <span class="keywordflow">for</span> j <span class="keywordflow">in</span> binaries[parch][0][binary][PROVIDES]:
<a name="l01954"></a>01954 key = j + <span class="stringliteral">"/"</span> + parch
<a name="l01955"></a>01955 <span class="keywordflow">if</span> key <span class="keywordflow">not</span> <span class="keywordflow">in</span> undo[<span class="stringliteral">'virtual'</span>]:
<a name="l01956"></a>01956 undo[<span class="stringliteral">'virtual'</span>][key] = binaries[parch][1][j][:]
<a name="l01957"></a>01957 binaries[parch][1][j].remove(binary)
<a name="l01958"></a>01958 <span class="keywordflow">if</span> len(binaries[parch][1][j]) == 0:
<a name="l01959"></a>01959 del binaries[parch][1][j]
<a name="l01960"></a>01960 <span class="comment"># finally, remove the binary package</span>
<a name="l01961"></a>01961 del binaries[parch][0][binary]
<a name="l01962"></a>01962 <span class="comment"># remove the source package</span>
<a name="l01963"></a>01963 <span class="keywordflow">if</span> <span class="keywordflow">not</span> arch:
<a name="l01964"></a>01964 undo[<span class="stringliteral">'sources'</span>][pkg_name] = source
<a name="l01965"></a>01965 del sources[<span class="stringliteral">'testing'</span>][pkg_name]
<a name="l01966"></a>01966 <span class="keywordflow">else</span>:
<a name="l01967"></a>01967 <span class="comment"># the package didn't exist, so we mark it as to-be-removed in case of undo</span>
<a name="l01968"></a>01968 undo[<span class="stringliteral">'sources'</span>][<span class="stringliteral">'-'</span> + pkg_name] = <span class="keyword">True</span>
<a name="l01969"></a>01969
<a name="l01970"></a>01970 <span class="comment"># single binary removal</span>
<a name="l01971"></a>01971 <span class="keywordflow">elif</span> pkg_name <span class="keywordflow">in</span> binaries[arch][0]:
<a name="l01972"></a>01972 undo[<span class="stringliteral">'binaries'</span>][pkg_name + <span class="stringliteral">"/"</span> + arch] = binaries[arch][0][pkg_name]
<a name="l01973"></a>01973 <span class="keywordflow">for</span> j <span class="keywordflow">in</span> binaries[arch][0][pkg_name][RDEPENDS]:
<a name="l01974"></a>01974 key = (j, arch)
<a name="l01975"></a>01975 <span class="keywordflow">if</span> key <span class="keywordflow">not</span> <span class="keywordflow">in</span> affected: affected.append(key)
<a name="l01976"></a>01976 del binaries[arch][0][pkg_name]
<a name="l01977"></a>01977
<a name="l01978"></a>01978 <span class="comment"># add the new binary packages (if we are not removing)</span>
<a name="l01979"></a>01979 <span class="keywordflow">if</span> pkg[0] != <span class="stringliteral">"-"</span>:
<a name="l01980"></a>01980 source = sources[suite][pkg_name]
<a name="l01981"></a>01981 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> source[BINARIES]:
<a name="l01982"></a>01982 binary, parch = p.split(<span class="stringliteral">"/"</span>)
<a name="l01983"></a>01983 <span class="keywordflow">if</span> arch <span class="keywordflow">and</span> parch != arch: <span class="keywordflow">continue</span>
<a name="l01984"></a>01984 key = (binary, parch)
<a name="l01985"></a>01985 <span class="comment"># obviously, added/modified packages are affected</span>
<a name="l01986"></a>01986 <span class="keywordflow">if</span> key <span class="keywordflow">not</span> <span class="keywordflow">in</span> affected: affected.append(key)
<a name="l01987"></a>01987 <span class="comment"># if the binary already exists (built from another ource)</span>
<a name="l01988"></a>01988 <span class="keywordflow">if</span> binary <span class="keywordflow">in</span> binaries[parch][0]:
<a name="l01989"></a>01989 <span class="comment"># save the old binary package</span>
<a name="l01990"></a>01990 undo[<span class="stringliteral">'binaries'</span>][p] = binaries[parch][0][binary]
<a name="l01991"></a>01991 <span class="comment"># all the reverse dependencies are affected by the change</span>
<a name="l01992"></a>01992 <span class="keywordflow">for</span> j <span class="keywordflow">in</span> binaries[parch][0][binary][RDEPENDS]:
<a name="l01993"></a>01993 key = (j, parch)
<a name="l01994"></a>01994 <span class="keywordflow">if</span> key <span class="keywordflow">not</span> <span class="keywordflow">in</span> affected: affected.append(key)
<a name="l01995"></a>01995 <span class="comment"># all the reverse conflicts and their dependency tree are affected by the change</span>
<a name="l01996"></a>01996 <span class="keywordflow">for</span> j <span class="keywordflow">in</span> binaries[parch][0][binary][RCONFLICTS]:
<a name="l01997"></a>01997 key = (j, parch)
<a name="l01998"></a>01998 <span class="keywordflow">if</span> key <span class="keywordflow">not</span> <span class="keywordflow">in</span> affected: affected.append(key)
<a name="l01999"></a>01999 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> self.<a class="code" href="classbritney_1_1Britney.html#a923f6b90e2574e3bb2bb099b05925dd">get_full_tree</a>(j, parch, <span class="stringliteral">'testing'</span>):
<a name="l02000"></a>02000 key = (p, parch)
<a name="l02001"></a>02001 <span class="keywordflow">if</span> key <span class="keywordflow">not</span> <span class="keywordflow">in</span> affected: affected.append(key)
<a name="l02002"></a>02002 <span class="comment"># add/update the binary package</span>
<a name="l02003"></a>02003 binaries[parch][0][binary] = self.binaries[suite][parch][0][binary]
<a name="l02004"></a>02004 <span class="comment"># register new provided packages</span>
<a name="l02005"></a>02005 <span class="keywordflow">for</span> j <span class="keywordflow">in</span> binaries[parch][0][binary][PROVIDES]:
<a name="l02006"></a>02006 key = j + <span class="stringliteral">"/"</span> + parch
<a name="l02007"></a>02007 <span class="keywordflow">if</span> j <span class="keywordflow">not</span> <span class="keywordflow">in</span> binaries[parch][1]:
<a name="l02008"></a>02008 undo[<span class="stringliteral">'nvirtual'</span>].append(key)
<a name="l02009"></a>02009 binaries[parch][1][j] = []
<a name="l02010"></a>02010 <span class="keywordflow">elif</span> key <span class="keywordflow">not</span> <span class="keywordflow">in</span> undo[<span class="stringliteral">'virtual'</span>]:
<a name="l02011"></a>02011 undo[<span class="stringliteral">'virtual'</span>][key] = binaries[parch][1][j][:]
<a name="l02012"></a>02012 binaries[parch][1][j].append(binary)
<a name="l02013"></a>02013 <span class="comment"># all the reverse dependencies are affected by the change</span>
<a name="l02014"></a>02014 <span class="keywordflow">for</span> j <span class="keywordflow">in</span> binaries[parch][0][binary][RDEPENDS]:
<a name="l02015"></a>02015 key = (j, parch)
<a name="l02016"></a>02016 <span class="keywordflow">if</span> key <span class="keywordflow">not</span> <span class="keywordflow">in</span> affected: affected.append(key)
<a name="l02017"></a>02017
<a name="l02018"></a>02018 <span class="comment"># register reverse dependencies and conflicts for the new binary packages</span>
<a name="l02019"></a>02019 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> source[BINARIES]:
<a name="l02020"></a>02020 binary, parch = p.split(<span class="stringliteral">"/"</span>)
<a name="l02021"></a>02021 <span class="keywordflow">if</span> arch <span class="keywordflow">and</span> parch != arch: <span class="keywordflow">continue</span>
<a name="l02022"></a><a class="code" href="classbritney_1_1Britney.html#a923f6b90e2574e3bb2bb099b05925dd">02022</a> self.<a class="code" href="classbritney_1_1Britney.html#f86b93b64ac43c1d04fe88a6a8b1777e">register_reverses</a>(binary, binaries[parch][0] , binaries[parch][1])
<a name="l02023"></a>02023
<a name="l02024"></a>02024 <span class="comment"># add/update the source package</span>
<a name="l02025"></a>02025 <span class="keywordflow">if</span> <span class="keywordflow">not</span> arch:
<a name="l02026"></a>02026 sources[<span class="stringliteral">'testing'</span>][pkg_name] = sources[suite][pkg_name]
<a name="l02027"></a>02027
<a name="l02028"></a>02028 <span class="comment"># return the package name, the suite, the list of affected packages and the undo dictionary</span>
<a name="l02029"></a>02029 <span class="keywordflow">return</span> (pkg_name, suite, affected, undo)
<a name="l02030"></a>02030
<a name="l02031"></a>02031 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#a923f6b90e2574e3bb2bb099b05925dd">get_full_tree</a>(self, pkg, arch, suite):
<a name="l02032"></a>02032 <span class="stringliteral">"""Calculate the full dependency tree for the given package</span>
<a name="l02033"></a>02033 <span class="stringliteral"></span>
<a name="l02034"></a>02034 <span class="stringliteral"> This method returns the full dependency tree for the package `pkg`,</span>
<a name="l02035"></a>02035 <span class="stringliteral"> inside the `arch` architecture for the suite `suite`.</span>
<a name="l02036"></a>02036 <span class="stringliteral"> """</span>
<a name="l02037"></a>02037 packages = [pkg]
<a name="l02038"></a><a class="code" href="classbritney_1_1Britney.html#d453398832baaa7f477f720cfb643029">02038</a> binaries = self.binaries[suite][arch][0]
<a name="l02039"></a>02039 l = n = 0
<a name="l02040"></a>02040 <span class="keywordflow">while</span> len(packages) > l:
<a name="l02041"></a>02041 l = len(packages)
<a name="l02042"></a>02042 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> packages[n:]:
<a name="l02043"></a>02043 packages.extend([x <span class="keywordflow">for</span> x <span class="keywordflow">in</span> binaries[p][RDEPENDS] <span class="keywordflow">if</span> x <span class="keywordflow">not</span> <span class="keywordflow">in</span> packages <span class="keywordflow">and</span> x <span class="keywordflow">in</span> binaries])
<a name="l02044"></a>02044 n = l
<a name="l02045"></a>02045 <span class="keywordflow">return</span> packages
<a name="l02046"></a>02046
<a name="l02047"></a>02047 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#d453398832baaa7f477f720cfb643029">iter_packages</a>(self, packages, selected, hint=False, nuninst=None):
<a name="l02048"></a>02048 <span class="stringliteral">"""Iter on the list of actions and apply them one-by-one</span>
<a name="l02049"></a>02049 <span class="stringliteral"></span>
<a name="l02050"></a>02050 <span class="stringliteral"> This method apply the changes from `packages` to testing, checking the uninstallability</span>
<a name="l02051"></a>02051 <span class="stringliteral"> counters for every action performed. If the action do not improve the it, it is reverted.</span>
<a name="l02052"></a>02052 <span class="stringliteral"> The method returns the new uninstallability counters and the remaining actions if the</span>
<a name="l02053"></a>02053 <span class="stringliteral"> final result is successful, otherwise (None, None).</span>
<a name="l02054"></a>02054 <span class="stringliteral"> """</span>
<a name="l02055"></a>02055 extra = []
<a name="l02056"></a>02056 deferred = []
<a name="l02057"></a>02057 skipped = []
<a name="l02058"></a>02058 mark_passed = <span class="keyword">False</span>
<a name="l02059"></a>02059 position = len(packages)
<a name="l02060"></a>02060
<a name="l02061"></a>02061 <span class="keywordflow">if</span> nuninst:
<a name="l02062"></a>02062 nuninst_comp = nuninst.copy()
<a name="l02063"></a>02063 <span class="keywordflow">else</span>:
<a name="l02064"></a>02064 nuninst_comp = self.nuninst_orig.copy()
<a name="l02065"></a>02065
<a name="l02066"></a>02066 <span class="comment"># local copies for better performances</span>
<a name="l02067"></a>02067 check_installable = self.<a class="code" href="classbritney_1_1Britney.html#4c06ddd116a40752c62d4395e92a97df">check_installable</a>
<a name="l02068"></a>02068 binaries = self.binaries[<span class="stringliteral">'testing'</span>]
<a name="l02069"></a>02069 sources = self.sources
<a name="l02070"></a>02070 architectures = self.options.architectures
<a name="l02071"></a>02071 nobreakall_arches = self.options.nobreakall_arches
<a name="l02072"></a>02072 new_arches = self.options.new_arches
<a name="l02073"></a>02073 break_arches = self.options.break_arches
<a name="l02074"></a>02074 dependencies = self.dependencies
<a name="l02075"></a>02075 compatible = self.options.compatible
<a name="l02076"></a>02076
<a name="l02077"></a>02077 <span class="comment"># pre-process a hint batch</span>
<a name="l02078"></a>02078 pre_process = {}
<a name="l02079"></a>02079 <span class="keywordflow">if</span> selected <span class="keywordflow">and</span> hint:
<a name="l02080"></a>02080 <span class="keywordflow">for</span> pkg <span class="keywordflow">in</span> selected:
<a name="l02081"></a>02081 pkg_name, suite, affected, undo = self.<a class="code" href="classbritney_1_1Britney.html#22af61b8a7f6fe71a79d28b5016cae1d">doop_source</a>(pkg)
<a name="l02082"></a>02082 pre_process[pkg] = (pkg_name, suite, affected, undo)
<a name="l02083"></a>02083
<a name="l02084"></a>02084 lundo = []
<a name="l02085"></a>02085 <span class="keywordflow">if</span> <span class="keywordflow">not</span> hint:
<a name="l02086"></a>02086 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"recur: [%s] %s %d/%d\n"</span> % (<span class="stringliteral">""</span>, <span class="stringliteral">","</span>.join(selected), len(packages), len(extra)))
<a name="l02087"></a>02087
<a name="l02088"></a>02088 <span class="comment"># loop on the packages (or better, actions)</span>
<a name="l02089"></a>02089 <span class="keywordflow">while</span> packages:
<a name="l02090"></a>02090 pkg = packages.pop(0)
<a name="l02091"></a>02091
<a name="l02092"></a>02092 <span class="comment"># this is the marker for the first loop</span>
<a name="l02093"></a>02093 <span class="keywordflow">if</span> <span class="keywordflow">not</span> compatible <span class="keywordflow">and</span> <span class="keywordflow">not</span> mark_passed <span class="keywordflow">and</span> position < 0:
<a name="l02094"></a>02094 mark_passed = <span class="keyword">True</span>
<a name="l02095"></a>02095 packages.extend(deferred)
<a name="l02096"></a>02096 del deferred
<a name="l02097"></a>02097 <span class="keywordflow">else</span>: position -= 1
<a name="l02098"></a>02098
<a name="l02099"></a>02099 <span class="comment"># defer packages if their dependency has been already skipped</span>
<a name="l02100"></a>02100 <span class="keywordflow">if</span> <span class="keywordflow">not</span> compatible <span class="keywordflow">and</span> <span class="keywordflow">not</span> mark_passed:
<a name="l02101"></a>02101 defer = <span class="keyword">False</span>
<a name="l02102"></a>02102 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> dependencies.get(pkg, []):
<a name="l02103"></a>02103 <span class="keywordflow">if</span> p <span class="keywordflow">in</span> skipped:
<a name="l02104"></a>02104 deferred.append(pkg)
<a name="l02105"></a>02105 skipped.append(pkg)
<a name="l02106"></a>02106 defer = <span class="keyword">True</span>
<a name="l02107"></a>02107 <span class="keywordflow">break</span>
<a name="l02108"></a>02108 <span class="keywordflow">if</span> defer: <span class="keywordflow">continue</span>
<a name="l02109"></a>02109
<a name="l02110"></a>02110 <span class="keywordflow">if</span> <span class="keywordflow">not</span> hint:
<a name="l02111"></a>02111 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"trying: %s\n"</span> % (pkg))
<a name="l02112"></a>02112
<a name="l02113"></a>02113 better = <span class="keyword">True</span>
<a name="l02114"></a>02114 nuninst = {}
<a name="l02115"></a>02115
<a name="l02116"></a>02116 <span class="comment"># apply the changes</span>
<a name="l02117"></a>02117 <span class="keywordflow">if</span> pkg <span class="keywordflow">in</span> pre_process:
<a name="l02118"></a>02118 pkg_name, suite, affected, undo = pre_process[pkg]
<a name="l02119"></a>02119 <span class="keywordflow">else</span>:
<a name="l02120"></a>02120 pkg_name, suite, affected, undo = self.<a class="code" href="classbritney_1_1Britney.html#22af61b8a7f6fe71a79d28b5016cae1d">doop_source</a>(pkg)
<a name="l02121"></a>02121 <span class="keywordflow">if</span> hint:
<a name="l02122"></a>02122 lundo.append((undo, pkg, pkg_name, suite))
<a name="l02123"></a>02123
<a name="l02124"></a>02124 <span class="comment"># check the affected packages on all the architectures</span>
<a name="l02125"></a>02125 <span class="keywordflow">for</span> arch <span class="keywordflow">in</span> (<span class="stringliteral">"/"</span> <span class="keywordflow">in</span> pkg <span class="keywordflow">and</span> (pkg.split(<span class="stringliteral">"/"</span>)[1].split(<span class="stringliteral">"_"</span>)[0],) <span class="keywordflow">or</span> architectures):
<a name="l02126"></a>02126 <span class="keywordflow">if</span> arch <span class="keywordflow">not</span> <span class="keywordflow">in</span> nobreakall_arches:
<a name="l02127"></a>02127 skip_archall = <span class="keyword">True</span>
<a name="l02128"></a>02128 <span class="keywordflow">else</span>: skip_archall = <span class="keyword">False</span>
<a name="l02129"></a>02129
<a name="l02130"></a>02130 nuninst[arch] = [x <span class="keywordflow">for</span> x <span class="keywordflow">in</span> nuninst_comp[arch] <span class="keywordflow">if</span> x <span class="keywordflow">in</span> binaries[arch][0]]
<a name="l02131"></a>02131 nuninst[arch + <span class="stringliteral">"+all"</span>] = [x <span class="keywordflow">for</span> x <span class="keywordflow">in</span> nuninst_comp[arch + <span class="stringliteral">"+all"</span>] <span class="keywordflow">if</span> x <span class="keywordflow">in</span> binaries[arch][0]]
<a name="l02132"></a>02132 broken = nuninst[arch + <span class="stringliteral">"+all"</span>]
<a name="l02133"></a>02133 to_check = [x[0] <span class="keywordflow">for</span> x <span class="keywordflow">in</span> affected <span class="keywordflow">if</span> x[1] == arch]
<a name="l02134"></a>02134 <span class="comment"># broken packages (first round)</span>
<a name="l02135"></a>02135 repaired = []
<a name="l02136"></a>02136 broken_changed = <span class="keyword">True</span>
<a name="l02137"></a>02137 last_broken = <span class="keywordtype">None</span>
<a name="l02138"></a>02138 <span class="keywordflow">while</span> broken_changed:
<a name="l02139"></a>02139 broken_changed = <span class="keyword">False</span>
<a name="l02140"></a>02140 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> to_check:
<a name="l02141"></a>02141 <span class="keywordflow">if</span> p == last_broken: <span class="keywordflow">break</span>
<a name="l02142"></a>02142 <span class="keywordflow">if</span> p <span class="keywordflow">not</span> <span class="keywordflow">in</span> binaries[arch][0]: <span class="keywordflow">continue</span>
<a name="l02143"></a>02143 r = check_installable(p, arch, <span class="stringliteral">'testing'</span>, excluded=broken, conflicts=<span class="keyword">True</span>)
<a name="l02144"></a>02144 <span class="keywordflow">if</span> <span class="keywordflow">not</span> r <span class="keywordflow">and</span> p <span class="keywordflow">not</span> <span class="keywordflow">in</span> broken:
<a name="l02145"></a>02145 last_broken = p
<a name="l02146"></a>02146 broken.append(p)
<a name="l02147"></a>02147 broken_changed = <span class="keyword">True</span>
<a name="l02148"></a>02148 <span class="keywordflow">if</span> <span class="keywordflow">not</span> (skip_archall <span class="keywordflow">and</span> binaries[arch][0][p][ARCHITECTURE] == <span class="stringliteral">'all'</span>):
<a name="l02149"></a>02149 nuninst[arch].append(p)
<a name="l02150"></a>02150 <span class="keywordflow">elif</span> r <span class="keywordflow">and</span> p <span class="keywordflow">in</span> broken:
<a name="l02151"></a>02151 last_broken = p
<a name="l02152"></a>02152 repaired.append(p)
<a name="l02153"></a>02153 broken.remove(p)
<a name="l02154"></a>02154 broken_changed = <span class="keyword">True</span>
<a name="l02155"></a>02155 <span class="keywordflow">if</span> <span class="keywordflow">not</span> (skip_archall <span class="keywordflow">and</span> binaries[arch][0][p][ARCHITECTURE] == <span class="stringliteral">'all'</span>):
<a name="l02156"></a>02156 nuninst[arch].remove(p)
<a name="l02157"></a>02157
<a name="l02158"></a>02158 <span class="comment"># broken packages (second round, reverse dependencies of the first round)</span>
<a name="l02159"></a>02159 l = 0
<a name="l02160"></a>02160 broken_changed = <span class="keyword">True</span>
<a name="l02161"></a>02161 last_broken = <span class="keywordtype">None</span>
<a name="l02162"></a>02162 <span class="keywordflow">while</span> broken_changed:
<a name="l02163"></a>02163 broken_changed = <span class="keyword">False</span>
<a name="l02164"></a>02164 <span class="keywordflow">for</span> j <span class="keywordflow">in</span> broken + repaired:
<a name="l02165"></a>02165 <span class="keywordflow">if</span> j <span class="keywordflow">not</span> <span class="keywordflow">in</span> binaries[arch][0]: <span class="keywordflow">continue</span>
<a name="l02166"></a>02166 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> binaries[arch][0][j][RDEPENDS]:
<a name="l02167"></a>02167 <span class="keywordflow">if</span> p <span class="keywordflow">in</span> broken <span class="keywordflow">or</span> p <span class="keywordflow">not</span> <span class="keywordflow">in</span> binaries[arch][0]: <span class="keywordflow">continue</span>
<a name="l02168"></a>02168 r = check_installable(p, arch, <span class="stringliteral">'testing'</span>, excluded=broken, conflicts=<span class="keyword">True</span>)
<a name="l02169"></a>02169 <span class="keywordflow">if</span> <span class="keywordflow">not</span> r <span class="keywordflow">and</span> p <span class="keywordflow">not</span> <span class="keywordflow">in</span> broken:
<a name="l02170"></a>02170 l = -1
<a name="l02171"></a>02171 last_broken = j
<a name="l02172"></a>02172 broken.append(p)
<a name="l02173"></a>02173 broken_changed = <span class="keyword">True</span>
<a name="l02174"></a>02174 <span class="keywordflow">if</span> <span class="keywordflow">not</span> (skip_archall <span class="keywordflow">and</span> binaries[arch][0][p][ARCHITECTURE] == <span class="stringliteral">'all'</span>):
<a name="l02175"></a>02175 nuninst[arch].append(p)
<a name="l02176"></a>02176 <span class="keywordflow">elif</span> r <span class="keywordflow">and</span> p <span class="keywordflow">in</span> nuninst[arch + <span class="stringliteral">"+all"</span>]:
<a name="l02177"></a>02177 last_broken = p
<a name="l02178"></a>02178 repaired.append(p)
<a name="l02179"></a>02179 broken.remove(p)
<a name="l02180"></a>02180 broken_changed = <span class="keyword">True</span>
<a name="l02181"></a>02181 <span class="keywordflow">if</span> <span class="keywordflow">not</span> (skip_archall <span class="keywordflow">and</span> binaries[arch][0][p][ARCHITECTURE] == <span class="stringliteral">'all'</span>):
<a name="l02182"></a>02182 nuninst[arch].remove(p)
<a name="l02183"></a>02183 <span class="keywordflow">if</span> l != -1 <span class="keywordflow">and</span> last_broken == j: <span class="keywordflow">break</span>
<a name="l02184"></a>02184
<a name="l02185"></a>02185 <span class="comment"># if we are processing hints, go ahead</span>
<a name="l02186"></a>02186 <span class="keywordflow">if</span> hint:
<a name="l02187"></a>02187 nuninst_comp[arch] = nuninst[arch]
<a name="l02188"></a>02188 nuninst_comp[arch + <span class="stringliteral">"+all"</span>] = nuninst[arch + <span class="stringliteral">"+all"</span>]
<a name="l02189"></a>02189 <span class="keywordflow">continue</span>
<a name="l02190"></a>02190
<a name="l02191"></a>02191 <span class="comment"># if the uninstallability counter is worse than before, break the loop</span>
<a name="l02192"></a>02192 <span class="keywordflow">if</span> ((<span class="stringliteral">"/"</span> <span class="keywordflow">in</span> pkg <span class="keywordflow">and</span> arch <span class="keywordflow">not</span> <span class="keywordflow">in</span> new_arches) <span class="keywordflow">or</span> \
<a name="l02193"></a>02193 (arch <span class="keywordflow">not</span> <span class="keywordflow">in</span> break_arches)) <span class="keywordflow">and</span> len(nuninst[arch]) > len(nuninst_comp[arch]):
<a name="l02194"></a>02194 better = <span class="keyword">False</span>
<a name="l02195"></a>02195 <span class="keywordflow">break</span>
<a name="l02196"></a>02196
<a name="l02197"></a>02197 <span class="comment"># if we are processing hints or the package is already accepted, go ahead</span>
<a name="l02198"></a>02198 <span class="keywordflow">if</span> hint <span class="keywordflow">or</span> pkg <span class="keywordflow">in</span> selected: <span class="keywordflow">continue</span>
<a name="l02199"></a>02199
<a name="l02200"></a>02200 <span class="comment"># check if the action improved the uninstallability counters</span>
<a name="l02201"></a>02201 <span class="keywordflow">if</span> better:
<a name="l02202"></a>02202 lundo.append((undo, pkg, pkg_name, suite))
<a name="l02203"></a>02203 selected.append(pkg)
<a name="l02204"></a>02204 packages.extend(extra)
<a name="l02205"></a>02205 extra = []
<a name="l02206"></a>02206 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"accepted: %s\n"</span> % (pkg))
<a name="l02207"></a>02207 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">" ori: %s\n"</span> % (self.<a class="code" href="classbritney_1_1Britney.html#e5c18b706e6598474435b1996313cf27">eval_nuninst</a>(self.nuninst_orig)))
<a name="l02208"></a>02208 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">" pre: %s\n"</span> % (self.<a class="code" href="classbritney_1_1Britney.html#e5c18b706e6598474435b1996313cf27">eval_nuninst</a>(nuninst_comp)))
<a name="l02209"></a>02209 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">" now: %s\n"</span> % (self.<a class="code" href="classbritney_1_1Britney.html#e5c18b706e6598474435b1996313cf27">eval_nuninst</a>(nuninst, nuninst_comp)))
<a name="l02210"></a>02210 <span class="keywordflow">if</span> len(selected) <= 20:
<a name="l02211"></a>02211 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">" all: %s\n"</span> % (<span class="stringliteral">" "</span>.join(selected)))
<a name="l02212"></a>02212 <span class="keywordflow">else</span>:
<a name="l02213"></a>02213 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">" most: (%d) .. %s\n"</span> % (len(selected), <span class="stringliteral">" "</span>.join(selected[-20:])))
<a name="l02214"></a>02214 <span class="keywordflow">for</span> k <span class="keywordflow">in</span> nuninst:
<a name="l02215"></a>02215 nuninst_comp[k] = nuninst[k]
<a name="l02216"></a>02216 <span class="keywordflow">else</span>:
<a name="l02217"></a>02217 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"skipped: %s (%d <- %d)\n"</span> % (pkg, len(extra), len(packages)))
<a name="l02218"></a>02218 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">" got: %s\n"</span> % (self.<a class="code" href="classbritney_1_1Britney.html#e5c18b706e6598474435b1996313cf27">eval_nuninst</a>(nuninst, <span class="stringliteral">"/"</span> <span class="keywordflow">in</span> pkg <span class="keywordflow">and</span> nuninst_comp <span class="keywordflow">or</span> <span class="keywordtype">None</span>)))
<a name="l02219"></a>02219 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">" * %s: %s\n"</span> % (arch, <span class="stringliteral">", "</span>.join(sorted([b <span class="keywordflow">for</span> b <span class="keywordflow">in</span> nuninst[arch] <span class="keywordflow">if</span> b <span class="keywordflow">not</span> <span class="keywordflow">in</span> nuninst_comp[arch]]))))
<a name="l02220"></a>02220
<a name="l02221"></a>02221 extra.append(pkg)
<a name="l02222"></a>02222 <span class="keywordflow">if</span> <span class="keywordflow">not</span> mark_passed:
<a name="l02223"></a>02223 skipped.append(pkg)
<a name="l02224"></a>02224
<a name="l02225"></a>02225 <span class="comment"># undo the changes (source)</span>
<a name="l02226"></a>02226 <span class="keywordflow">for</span> k <span class="keywordflow">in</span> undo[<span class="stringliteral">'sources'</span>].keys():
<a name="l02227"></a>02227 <span class="keywordflow">if</span> k[0] == <span class="stringliteral">'-'</span>:
<a name="l02228"></a>02228 del sources[<span class="stringliteral">'testing'</span>][k[1:]]
<a name="l02229"></a>02229 <span class="keywordflow">else</span>: sources[<span class="stringliteral">'testing'</span>][k] = undo[<span class="stringliteral">'sources'</span>][k]
<a name="l02230"></a>02230
<a name="l02231"></a>02231 <span class="comment"># undo the changes (new binaries)</span>
<a name="l02232"></a>02232 <span class="keywordflow">if</span> pkg[0] != <span class="stringliteral">'-'</span> <span class="keywordflow">and</span> pkg_name <span class="keywordflow">in</span> sources[suite]:
<a name="l02233"></a>02233 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> sources[suite][pkg_name][BINARIES]:
<a name="l02234"></a>02234 binary, arch = p.split(<span class="stringliteral">"/"</span>)
<a name="l02235"></a>02235 <span class="keywordflow">if</span> <span class="stringliteral">"/"</span> <span class="keywordflow">in</span> pkg <span class="keywordflow">and</span> arch != pkg[pkg.find(<span class="stringliteral">"/"</span>)+1:]: <span class="keywordflow">continue</span>
<a name="l02236"></a>02236 del binaries[arch][0][binary]
<a name="l02237"></a>02237
<a name="l02238"></a>02238 <span class="comment"># undo the changes (binaries)</span>
<a name="l02239"></a>02239 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> undo[<span class="stringliteral">'binaries'</span>].keys():
<a name="l02240"></a>02240 binary, arch = p.split(<span class="stringliteral">"/"</span>)
<a name="l02241"></a>02241 <span class="keywordflow">if</span> binary[0] == <span class="stringliteral">"-"</span>:
<a name="l02242"></a>02242 del binaries[arch][0][binary[1:]]
<a name="l02243"></a>02243 <span class="keywordflow">else</span>: binaries[arch][0][binary] = undo[<span class="stringliteral">'binaries'</span>][p]
<a name="l02244"></a>02244
<a name="l02245"></a>02245 <span class="comment"># undo the changes (virtual packages)</span>
<a name="l02246"></a>02246 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> undo[<span class="stringliteral">'nvirtual'</span>]:
<a name="l02247"></a>02247 j, arch = p.split(<span class="stringliteral">"/"</span>)
<a name="l02248"></a>02248 del binaries[arch][1][j]
<a name="l02249"></a>02249 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> undo[<span class="stringliteral">'virtual'</span>]:
<a name="l02250"></a>02250 j, arch = p.split(<span class="stringliteral">"/"</span>)
<a name="l02251"></a>02251 <span class="keywordflow">if</span> j[0] == <span class="stringliteral">'-'</span>:
<a name="l02252"></a>02252 del binaries[arch][1][j[1:]]
<a name="l02253"></a>02253 <span class="keywordflow">else</span>: binaries[arch][1][j] = undo[<span class="stringliteral">'virtual'</span>][p]
<a name="l02254"></a>02254
<a name="l02255"></a>02255 <span class="comment"># if we are processing hints, return now</span>
<a name="l02256"></a>02256 <span class="keywordflow">if</span> hint:
<a name="l02257"></a>02257 <span class="keywordflow">return</span> (nuninst_comp, [], lundo)
<a name="l02258"></a><a class="code" href="classbritney_1_1Britney.html#3ef9b6f600eac492fc5aa4b31638198f">02258</a>
<a name="l02259"></a>02259 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">" finish: [%s]\n"</span> % <span class="stringliteral">","</span>.join(selected))
<a name="l02260"></a>02260 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"endloop: %s\n"</span> % (self.<a class="code" href="classbritney_1_1Britney.html#e5c18b706e6598474435b1996313cf27">eval_nuninst</a>(self.nuninst_orig)))
<a name="l02261"></a>02261 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">" now: %s\n"</span> % (self.<a class="code" href="classbritney_1_1Britney.html#e5c18b706e6598474435b1996313cf27">eval_nuninst</a>(nuninst_comp)))
<a name="l02262"></a>02262 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(self.<a class="code" href="classbritney_1_1Britney.html#b8dd18ead23b6e1126bb4c2a5c3cd8ba">eval_uninst</a>(self.<a class="code" href="classbritney_1_1Britney.html#60ccd1851bcea5659fed15010541e244">newlyuninst</a>(self.nuninst_orig, nuninst_comp)))
<a name="l02263"></a>02263 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"\n"</span>)
<a name="l02264"></a>02264
<a name="l02265"></a>02265 <span class="keywordflow">return</span> (nuninst_comp, extra, lundo)
<a name="l02266"></a>02266
<a name="l02267"></a>02267 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#3ef9b6f600eac492fc5aa4b31638198f">do_all</a>(self, maxdepth=0, init=None, actions=None):
<a name="l02268"></a>02268 <span class="stringliteral">"""Testing update runner</span>
<a name="l02269"></a>02269 <span class="stringliteral"></span>
<a name="l02270"></a>02270 <span class="stringliteral"> This method tries to update testing checking the uninstallability</span>
<a name="l02271"></a>02271 <span class="stringliteral"> counters before and after the actions to decide if the update was</span>
<a name="l02272"></a>02272 <span class="stringliteral"> successful or not.</span>
<a name="l02273"></a>02273 <span class="stringliteral"> """</span>
<a name="l02274"></a>02274 selected = []
<a name="l02275"></a>02275 <span class="keywordflow">if</span> actions:
<a name="l02276"></a>02276 upgrade_me = actions[:]
<a name="l02277"></a>02277 <span class="keywordflow">else</span>:
<a name="l02278"></a>02278 upgrade_me = self.upgrade_me[:]
<a name="l02279"></a>02279 nuninst_start = self.nuninst_orig
<a name="l02280"></a>02280
<a name="l02281"></a>02281 <span class="comment"># these are special parameters for hints processing</span>
<a name="l02282"></a>02282 undo = <span class="keyword">False</span>
<a name="l02283"></a>02283 force = <span class="keyword">False</span>
<a name="l02284"></a>02284 earlyabort = <span class="keyword">False</span>
<a name="l02285"></a>02285 <span class="keywordflow">if</span> maxdepth == <span class="stringliteral">"easy"</span> <span class="keywordflow">or</span> maxdepth < 0:
<a name="l02286"></a>02286 force = maxdepth < 0
<a name="l02287"></a>02287 earlyabort = <span class="keyword">True</span>
<a name="l02288"></a>02288 maxdepth = 0
<a name="l02289"></a>02289
<a name="l02290"></a>02290 <span class="comment"># if we have a list of initial packages, check them</span>
<a name="l02291"></a>02291 <span class="keywordflow">if</span> init:
<a name="l02292"></a>02292 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"leading: %s\n"</span> % (<span class="stringliteral">","</span>.join(init)))
<a name="l02293"></a>02293 <span class="keywordflow">for</span> x <span class="keywordflow">in</span> init:
<a name="l02294"></a>02294 <span class="keywordflow">if</span> x <span class="keywordflow">not</span> <span class="keywordflow">in</span> upgrade_me:
<a name="l02295"></a>02295 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"failed: %s\n"</span> % (x))
<a name="l02296"></a>02296 <span class="keywordflow">return</span> <span class="keywordtype">None</span>
<a name="l02297"></a>02297 selected.append(x)
<a name="l02298"></a>02298 upgrade_me.remove(x)
<a name="l02299"></a>02299
<a name="l02300"></a>02300 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"start: %s\n"</span> % self.<a class="code" href="classbritney_1_1Britney.html#e5c18b706e6598474435b1996313cf27">eval_nuninst</a>(nuninst_start))
<a name="l02301"></a>02301 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"orig: %s\n"</span> % self.<a class="code" href="classbritney_1_1Britney.html#e5c18b706e6598474435b1996313cf27">eval_nuninst</a>(nuninst_start))
<a name="l02302"></a>02302
<a name="l02303"></a>02303 <span class="keywordflow">if</span> earlyabort:
<a name="l02304"></a>02304 extra = upgrade_me[:]
<a name="l02305"></a>02305 (nuninst_end, extra, lundo) = self.<a class="code" href="classbritney_1_1Britney.html#d453398832baaa7f477f720cfb643029">iter_packages</a>(init, selected, hint=<span class="keyword">True</span>)
<a name="l02306"></a>02306 undo = <span class="keyword">True</span>
<a name="l02307"></a>02307 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"easy: %s\n"</span> % (self.<a class="code" href="classbritney_1_1Britney.html#e5c18b706e6598474435b1996313cf27">eval_nuninst</a>(nuninst_end)))
<a name="l02308"></a>02308 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(self.<a class="code" href="classbritney_1_1Britney.html#b8dd18ead23b6e1126bb4c2a5c3cd8ba">eval_uninst</a>(self.<a class="code" href="classbritney_1_1Britney.html#60ccd1851bcea5659fed15010541e244">newlyuninst</a>(nuninst_start, nuninst_end)) + <span class="stringliteral">"\n"</span>)
<a name="l02309"></a>02309 <span class="keywordflow">if</span> <span class="keywordflow">not</span> force <span class="keywordflow">and</span> <span class="keywordflow">not</span> self.<a class="code" href="classbritney_1_1Britney.html#2f7401c8e41b8095bd99bd656bb41546">is_nuninst_asgood_generous</a>(self.nuninst_orig, nuninst_end):
<a name="l02310"></a>02310 nuninst_end, extra = <span class="keywordtype">None</span>, <span class="keywordtype">None</span>
<a name="l02311"></a>02311 <span class="keywordflow">else</span>:
<a name="l02312"></a>02312 lundo = []
<a name="l02313"></a>02313 <span class="keywordflow">if</span> init:
<a name="l02314"></a>02314 (nuninst_end, extra, tundo) = self.<a class="code" href="classbritney_1_1Britney.html#d453398832baaa7f477f720cfb643029">iter_packages</a>(init, selected, hint=<span class="keyword">True</span>)
<a name="l02315"></a>02315 lundo.extend(tundo)
<a name="l02316"></a>02316 undo = <span class="keyword">True</span>
<a name="l02317"></a>02317 <span class="keywordflow">else</span>: nuninst_end = <span class="keywordtype">None</span>
<a name="l02318"></a>02318 (nuninst_end, extra, tundo) = self.<a class="code" href="classbritney_1_1Britney.html#d453398832baaa7f477f720cfb643029">iter_packages</a>(upgrade_me, selected, nuninst=nuninst_end)
<a name="l02319"></a>02319 lundo.extend(tundo)
<a name="l02320"></a>02320 <span class="keywordflow">if</span> <span class="keywordflow">not</span> self.<a class="code" href="classbritney_1_1Britney.html#2f7401c8e41b8095bd99bd656bb41546">is_nuninst_asgood_generous</a>(self.nuninst_orig, nuninst_end):
<a name="l02321"></a>02321 nuninst_end, extra = <span class="keywordtype">None</span>, <span class="keywordtype">None</span>
<a name="l02322"></a>02322
<a name="l02323"></a>02323 <span class="keywordflow">if</span> nuninst_end:
<a name="l02324"></a>02324 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"Apparently successful\n"</span>)
<a name="l02325"></a>02325 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"final: %s\n"</span> % <span class="stringliteral">","</span>.join(sorted(selected)))
<a name="l02326"></a>02326 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"start: %s\n"</span> % self.<a class="code" href="classbritney_1_1Britney.html#e5c18b706e6598474435b1996313cf27">eval_nuninst</a>(nuninst_start))
<a name="l02327"></a>02327 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">" orig: %s\n"</span> % self.<a class="code" href="classbritney_1_1Britney.html#e5c18b706e6598474435b1996313cf27">eval_nuninst</a>(self.nuninst_orig))
<a name="l02328"></a>02328 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">" end: %s\n"</span> % self.<a class="code" href="classbritney_1_1Britney.html#e5c18b706e6598474435b1996313cf27">eval_nuninst</a>(nuninst_end))
<a name="l02329"></a>02329 <span class="keywordflow">if</span> force:
<a name="l02330"></a>02330 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"force breaks:\n"</span>)
<a name="l02331"></a>02331 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(self.<a class="code" href="classbritney_1_1Britney.html#b8dd18ead23b6e1126bb4c2a5c3cd8ba">eval_uninst</a>(self.<a class="code" href="classbritney_1_1Britney.html#60ccd1851bcea5659fed15010541e244">newlyuninst</a>(nuninst_start, nuninst_end)) + <span class="stringliteral">"\n"</span>)
<a name="l02332"></a>02332 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"SUCCESS (%d/%d)\n"</span> % (len(actions <span class="keywordflow">or</span> self.upgrade_me), len(extra)))
<a name="l02333"></a>02333 self.nuninst_orig = nuninst_end
<a name="l02334"></a>02334 <span class="keywordflow">if</span> <span class="keywordflow">not</span> actions:
<a name="l02335"></a>02335 self.upgrade_me = sorted(extra)
<a name="l02336"></a>02336 <span class="keywordflow">if</span> <span class="keywordflow">not</span> self.options.compatible:
<a name="l02337"></a>02337 self.<a class="code" href="classbritney_1_1Britney.html#70115e28e2ee6aa3a09d1efbd81b4a87">sort_actions</a>()
<a name="l02338"></a>02338 <span class="keywordflow">else</span>:
<a name="l02339"></a>02339 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"FAILED\n"</span>)
<a name="l02340"></a>02340 <span class="keywordflow">if</span> <span class="keywordflow">not</span> undo: <span class="keywordflow">return</span>
<a name="l02341"></a>02341
<a name="l02342"></a>02342 <span class="comment"># undo all the changes</span>
<a name="l02343"></a>02343 <span class="keywordflow">for</span> (undo, pkg, pkg_name, suite) <span class="keywordflow">in</span> lundo:
<a name="l02344"></a>02344 <span class="comment"># undo the changes (source)</span>
<a name="l02345"></a>02345 <span class="keywordflow">for</span> k <span class="keywordflow">in</span> undo[<span class="stringliteral">'sources'</span>].keys():
<a name="l02346"></a>02346 <span class="keywordflow">if</span> k[0] == <span class="stringliteral">'-'</span>:
<a name="l02347"></a>02347 del self.sources[<span class="stringliteral">'testing'</span>][k[1:]]
<a name="l02348"></a>02348 <span class="keywordflow">else</span>: self.sources[<span class="stringliteral">'testing'</span>][k] = undo[<span class="stringliteral">'sources'</span>][k]
<a name="l02349"></a>02349
<a name="l02350"></a>02350 <span class="comment"># undo the changes (new binaries)</span>
<a name="l02351"></a>02351 <span class="keywordflow">if</span> pkg[0] != <span class="stringliteral">'-'</span> <span class="keywordflow">and</span> pkg_name <span class="keywordflow">in</span> self.sources[suite]:
<a name="l02352"></a>02352 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> self.sources[suite][pkg_name][BINARIES]:
<a name="l02353"></a>02353 binary, arch = p.split(<span class="stringliteral">"/"</span>)
<a name="l02354"></a>02354 <span class="keywordflow">if</span> <span class="stringliteral">"/"</span> <span class="keywordflow">in</span> pkg <span class="keywordflow">and</span> arch != pkg[pkg.find(<span class="stringliteral">"/"</span>)+1:]: <span class="keywordflow">continue</span>
<a name="l02355"></a>02355 del self.binaries[<span class="stringliteral">'testing'</span>][arch][0][binary]
<a name="l02356"></a>02356
<a name="l02357"></a>02357 <span class="comment"># undo the changes (binaries)</span>
<a name="l02358"></a>02358 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> undo[<span class="stringliteral">'binaries'</span>].keys():
<a name="l02359"></a>02359 binary, arch = p.split(<span class="stringliteral">"/"</span>)
<a name="l02360"></a>02360 <span class="keywordflow">if</span> binary[0] == <span class="stringliteral">"-"</span>:
<a name="l02361"></a>02361 del self.binaries[<span class="stringliteral">'testing'</span>][arch][0][binary[1:]]
<a name="l02362"></a>02362 <span class="keywordflow">else</span>: self.binaries[<span class="stringliteral">'testing'</span>][arch][0][binary] = undo[<span class="stringliteral">'binaries'</span>][p]
<a name="l02363"></a>02363
<a name="l02364"></a>02364 <span class="comment"># undo the changes (virtual packages)</span>
<a name="l02365"></a><a class="code" href="classbritney_1_1Britney.html#921effe0d64ed713c38888684a0a26d4">02365</a> <span class="keywordflow">for</span> p <span class="keywordflow">in</span> undo[<span class="stringliteral">'nvirtual'</span>]:
<a name="l02366"></a>02366 j, arch = p.split(<span class="stringliteral">"/"</span>)
<a name="l02367"></a>02367 del self.binaries[<span class="stringliteral">'testing'</span>][arch][1][j]
<a name="l02368"></a>02368 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> undo[<span class="stringliteral">'virtual'</span>]:
<a name="l02369"></a>02369 j, arch = p.split(<span class="stringliteral">"/"</span>)
<a name="l02370"></a>02370 <span class="keywordflow">if</span> j[0] == <span class="stringliteral">'-'</span>:
<a name="l02371"></a>02371 del self.binaries[<span class="stringliteral">'testing'</span>][arch][1][j[1:]]
<a name="l02372"></a>02372 <span class="keywordflow">else</span>: self.binaries[<span class="stringliteral">'testing'</span>][arch][1][j] = undo[<span class="stringliteral">'virtual'</span>][p]
<a name="l02373"></a>02373
<a name="l02374"></a>02374 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#921effe0d64ed713c38888684a0a26d4">upgrade_testing</a>(self):
<a name="l02375"></a>02375 <span class="stringliteral">"""Upgrade testing using the unstable packages</span>
<a name="l02376"></a>02376 <span class="stringliteral"></span>
<a name="l02377"></a>02377 <span class="stringliteral"> This method tries to upgrade testing using the packages from unstable.</span>
<a name="l02378"></a>02378 <span class="stringliteral"> Before running the do_all method, it tries the easy and force-hint</span>
<a name="l02379"></a>02379 <span class="stringliteral"> commands.</span>
<a name="l02380"></a>02380 <span class="stringliteral"> """</span>
<a name="l02381"></a>02381
<a name="l02382"></a>02382 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Starting the upgrade test"</span>, type=<span class="stringliteral">"I"</span>)
<a name="l02383"></a>02383 self.__output = open(self.options.upgrade_output, <span class="stringliteral">'w'</span>)
<a name="l02384"></a>02384 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"Generated on: %s\n"</span> % (time.strftime(<span class="stringliteral">"%Y.%m.%d %H:%M:%S %z"</span>, time.gmtime(time.time()))))
<a name="l02385"></a>02385 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"Arch order is: %s\n"</span> % <span class="stringliteral">", "</span>.join(self.options.architectures))
<a name="l02386"></a>02386
<a name="l02387"></a>02387 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"> Calculating current uninstallability counters"</span>, type=<span class="stringliteral">"I"</span>)
<a name="l02388"></a>02388 self.nuninst_orig = self.<a class="code" href="classbritney_1_1Britney.html#41c5ee0b9d64b2e76a0c1a1c2b28c73e">get_nuninst</a>()
<a name="l02389"></a>02389
<a name="l02390"></a>02390 <span class="keywordflow">if</span> <span class="keywordflow">not</span> self.options.actions:
<a name="l02391"></a>02391 <span class="comment"># process `easy' hints</span>
<a name="l02392"></a>02392 <span class="keywordflow">for</span> x <span class="keywordflow">in</span> self.hints[<span class="stringliteral">'easy'</span>]:
<a name="l02393"></a>02393 self.<a class="code" href="classbritney_1_1Britney.html#7bf70a5ad5754eb949205db3dc4b9c8a">do_hint</a>(<span class="stringliteral">"easy"</span>, x[0], x[1])
<a name="l02394"></a>02394
<a name="l02395"></a>02395 <span class="comment"># process `force-hint' hints</span>
<a name="l02396"></a>02396 <span class="keywordflow">for</span> x <span class="keywordflow">in</span> self.hints[<span class="stringliteral">"force-hint"</span>]:
<a name="l02397"></a>02397 self.<a class="code" href="classbritney_1_1Britney.html#7bf70a5ad5754eb949205db3dc4b9c8a">do_hint</a>(<span class="stringliteral">"force-hint"</span>, x[0], x[1])
<a name="l02398"></a>02398
<a name="l02399"></a>02399 <span class="comment"># run the first round of the upgrade</span>
<a name="l02400"></a>02400 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"> First loop on the packages with depth = 0"</span>, type=<span class="stringliteral">"I"</span>)
<a name="l02401"></a>02401
<a name="l02402"></a>02402 <span class="comment"># separate runs for break arches</span>
<a name="l02403"></a>02403 allpackages = []
<a name="l02404"></a>02404 normpackages = self.upgrade_me[:]
<a name="l02405"></a>02405 archpackages = {}
<a name="l02406"></a>02406 <span class="keywordflow">for</span> a <span class="keywordflow">in</span> self.options.break_arches.split():
<a name="l02407"></a>02407 archpackages[a] = [p <span class="keywordflow">for</span> p <span class="keywordflow">in</span> normpackages <span class="keywordflow">if</span> p.endswith(<span class="stringliteral">"/"</span> + a)]
<a name="l02408"></a>02408 normpackages = [p <span class="keywordflow">for</span> p <span class="keywordflow">in</span> normpackages <span class="keywordflow">if</span> <span class="keywordflow">not</span> p.endswith(<span class="stringliteral">"/"</span> + a)]
<a name="l02409"></a>02409 self.upgrade_me = normpackages
<a name="l02410"></a>02410 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"info: main run\n"</span>)
<a name="l02411"></a>02411 self.<a class="code" href="classbritney_1_1Britney.html#3ef9b6f600eac492fc5aa4b31638198f">do_all</a>()
<a name="l02412"></a>02412 allpackages += self.upgrade_me
<a name="l02413"></a>02413 <span class="keywordflow">for</span> a <span class="keywordflow">in</span> self.options.break_arches.split():
<a name="l02414"></a>02414 backup = self.options.break_arches
<a name="l02415"></a>02415 self.options.break_arches = <span class="stringliteral">" "</span>.join([x <span class="keywordflow">for</span> x <span class="keywordflow">in</span> self.options.break_arches.split() <span class="keywordflow">if</span> x != a])
<a name="l02416"></a>02416 self.upgrade_me = archpackages[a]
<a name="l02417"></a>02417 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"info: broken arch run for %s\n"</span> % (a))
<a name="l02418"></a>02418 self.<a class="code" href="classbritney_1_1Britney.html#3ef9b6f600eac492fc5aa4b31638198f">do_all</a>()
<a name="l02419"></a>02419 allpackages += self.upgrade_me
<a name="l02420"></a>02420 self.options.break_arches = backup
<a name="l02421"></a>02421 self.upgrade_me = allpackages
<a name="l02422"></a>02422
<a name="l02423"></a>02423 <span class="keywordflow">if</span> self.options.actions:
<a name="l02424"></a>02424 <span class="keywordflow">return</span>
<a name="l02425"></a>02425
<a name="l02426"></a>02426 <span class="comment"># process `hint' hints</span>
<a name="l02427"></a>02427 hintcnt = 0
<a name="l02428"></a>02428 <span class="keywordflow">for</span> x <span class="keywordflow">in</span> self.hints[<span class="stringliteral">"hint"</span>][:50]:
<a name="l02429"></a>02429 <span class="keywordflow">if</span> hintcnt > 50:
<a name="l02430"></a>02430 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"Skipping remaining hints..."</span>)
<a name="l02431"></a>02431 <span class="keywordflow">break</span>
<a name="l02432"></a>02432 <span class="keywordflow">if</span> self.<a class="code" href="classbritney_1_1Britney.html#7bf70a5ad5754eb949205db3dc4b9c8a">do_hint</a>(<span class="stringliteral">"hint"</span>, x[0], x[1]):
<a name="l02433"></a>02433 hintcnt += 1
<a name="l02434"></a>02434
<a name="l02435"></a>02435 <span class="comment"># run the auto hinter</span>
<a name="l02436"></a>02436 <span class="keywordflow">if</span> <span class="keywordflow">not</span> self.options.compatible:
<a name="l02437"></a>02437 self.<a class="code" href="classbritney_1_1Britney.html#c9c109f54ddce53b17513405e07dba1a">auto_hinter</a>()
<a name="l02438"></a>02438
<a name="l02439"></a>02439 <span class="comment"># smooth updates</span>
<a name="l02440"></a>02440 <span class="keywordflow">if</span> <span class="keywordflow">not</span> self.options.compatible <span class="keywordflow">and</span> len(self.options.smooth_updates) > 0:
<a name="l02441"></a>02441 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"> Removing old packages left in testing from smooth updates"</span>, type=<span class="stringliteral">"I"</span>)
<a name="l02442"></a>02442 removals = self.<a class="code" href="classbritney_1_1Britney.html#39c07e55b274ff98cb9cecb5f051bc5d">old_libraries</a>()
<a name="l02443"></a>02443 <span class="keywordflow">if</span> len(removals) > 0:
<a name="l02444"></a>02444 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"Removing packages left in testing for smooth updates (%d):\n%s"</span> % \
<a name="l02445"></a>02445 (len(removals), self.<a class="code" href="classbritney_1_1Britney.html#7c45f1c5b1dbd442fb9b85fef3fe1823">old_libraries_format</a>(removals)))
<a name="l02446"></a>02446 self.<a class="code" href="classbritney_1_1Britney.html#3ef9b6f600eac492fc5aa4b31638198f">do_all</a>(actions=removals)
<a name="l02447"></a>02447 removals = self.<a class="code" href="classbritney_1_1Britney.html#39c07e55b274ff98cb9cecb5f051bc5d">old_libraries</a>()
<a name="l02448"></a>02448
<a name="l02449"></a>02449 <span class="keywordflow">if</span> <span class="keywordflow">not</span> self.options.compatible:
<a name="l02450"></a>02450 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"List of old libraries in testing (%d):\n%s"</span> % \
<a name="l02451"></a>02451 (len(removals), self.<a class="code" href="classbritney_1_1Britney.html#7c45f1c5b1dbd442fb9b85fef3fe1823">old_libraries_format</a>(removals)))
<a name="l02452"></a>02452
<a name="l02453"></a>02453 <span class="comment"># output files</span>
<a name="l02454"></a>02454 <span class="keywordflow">if</span> <span class="keywordflow">not</span> self.options.dry_run:
<a name="l02455"></a>02455 <span class="comment"># re-write control files</span>
<a name="l02456"></a>02456 <span class="keywordflow">if</span> self.options.control_files:
<a name="l02457"></a>02457 self.<a class="code" href="classbritney_1_1Britney.html#1a3695a37b15ebd7e81cc33683fde461">write_controlfiles</a>(self.options.testing, <span class="stringliteral">'testing'</span>)
<a name="l02458"></a>02458
<a name="l02459"></a>02459 <span class="comment"># write bugs and dates</span>
<a name="l02460"></a><a class="code" href="classbritney_1_1Britney.html#7bf70a5ad5754eb949205db3dc4b9c8a">02460</a> self.<a class="code" href="classbritney_1_1Britney.html#0a5591fc94b89d53d12cbb8f27d100a7">write_bugs</a>(self.options.testing, self.bugs[<span class="stringliteral">'testing'</span>])
<a name="l02461"></a>02461 self.<a class="code" href="classbritney_1_1Britney.html#83e0bd993e7a099e6bf89d760183a76b">write_dates</a>(self.options.testing, self.dates)
<a name="l02462"></a>02462
<a name="l02463"></a>02463 <span class="comment"># write HeidiResult</span>
<a name="l02464"></a>02464 self.<a class="code" href="classbritney_1_1Britney.html#20f846da79d595d36628c8da3195ac7a">write_heidi</a>(self.options.testing, <span class="stringliteral">'HeidiResult'</span>)
<a name="l02465"></a>02465
<a name="l02466"></a>02466 self.__output.close()
<a name="l02467"></a>02467 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"Test completed!"</span>, type=<span class="stringliteral">"I"</span>)
<a name="l02468"></a>02468
<a name="l02469"></a>02469 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#7bf70a5ad5754eb949205db3dc4b9c8a">do_hint</a>(self, type, who, pkgvers):
<a name="l02470"></a>02470 <span class="stringliteral">"""Process hints</span>
<a name="l02471"></a>02471 <span class="stringliteral"></span>
<a name="l02472"></a>02472 <span class="stringliteral"> This method process `easy`, `hint` and `force-hint` hints. If the</span>
<a name="l02473"></a>02473 <span class="stringliteral"> requested version is not in unstable, than the hint is skipped.</span>
<a name="l02474"></a>02474 <span class="stringliteral"> """</span>
<a name="l02475"></a>02475 hintinfo = {<span class="stringliteral">"easy"</span>: <span class="stringliteral">"easy"</span>,
<a name="l02476"></a>02476 <span class="stringliteral">"hint"</span>: 0,
<a name="l02477"></a>02477 <span class="stringliteral">"force-hint"</span>: -1,}
<a name="l02478"></a>02478
<a name="l02479"></a>02479 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"> Processing '%s' hint from %s"</span> % (type, who), type=<span class="stringliteral">"I"</span>)
<a name="l02480"></a>02480 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"Trying %s from %s: %s\n"</span> % (type, who, <span class="stringliteral">" "</span>.join( [<span class="stringliteral">"%s/%s"</span> % (p,v) <span class="keywordflow">for</span> (p,v) <span class="keywordflow">in</span> pkgvers])))
<a name="l02481"></a>02481
<a name="l02482"></a>02482 ok = <span class="keyword">True</span>
<a name="l02483"></a>02483 <span class="comment"># loop on the requested packages and versions</span>
<a name="l02484"></a>02484 <span class="keywordflow">for</span> pkg, v <span class="keywordflow">in</span> pkgvers:
<a name="l02485"></a>02485 <span class="comment"># remove architecture</span>
<a name="l02486"></a>02486 <span class="keywordflow">if</span> <span class="stringliteral">"/"</span> <span class="keywordflow">in</span> pkg:
<a name="l02487"></a>02487 pkg = pkg[:pkg.find(<span class="stringliteral">"/"</span>)]
<a name="l02488"></a>02488
<a name="l02489"></a>02489 <span class="comment"># skip removal requests</span>
<a name="l02490"></a>02490 <span class="keywordflow">if</span> pkg[0] == <span class="stringliteral">"-"</span>:
<a name="l02491"></a>02491 <span class="keywordflow">continue</span>
<a name="l02492"></a>02492 <span class="comment"># handle testing-proposed-updates</span>
<a name="l02493"></a>02493 <span class="keywordflow">elif</span> pkg.endswith(<span class="stringliteral">"_tpu"</span>):
<a name="l02494"></a>02494 pkg = pkg[:-4]
<a name="l02495"></a>02495 <span class="keywordflow">if</span> pkg <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.sources[<span class="stringliteral">'tpu'</span>]: <span class="keywordflow">continue</span>
<a name="l02496"></a>02496 <span class="keywordflow">if</span> apt_pkg.VersionCompare(self.sources[<span class="stringliteral">'tpu'</span>][pkg][VERSION], v) != 0:
<a name="l02497"></a>02497 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">" Version mismatch, %s %s != %s\n"</span> % (pkg, v, self.sources[<span class="stringliteral">'tpu'</span>][pkg][VERSION]))
<a name="l02498"></a>02498 ok = <span class="keyword">False</span>
<a name="l02499"></a>02499 <span class="comment"># does the package exist in unstable?</span>
<a name="l02500"></a>02500 <span class="keywordflow">elif</span> pkg <span class="keywordflow">not</span> <span class="keywordflow">in</span> self.sources[<span class="stringliteral">'unstable'</span>]:
<a name="l02501"></a>02501 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">" Source %s has no version in unstable\n"</span> % pkg)
<a name="l02502"></a>02502 ok = <span class="keyword">False</span>
<a name="l02503"></a>02503 <span class="keywordflow">elif</span> apt_pkg.VersionCompare(self.sources[<span class="stringliteral">'unstable'</span>][pkg][VERSION], v) != 0:
<a name="l02504"></a><a class="code" href="classbritney_1_1Britney.html#70115e28e2ee6aa3a09d1efbd81b4a87">02504</a> self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">" Version mismatch, %s %s != %s\n"</span> % (pkg, v, self.sources[<span class="stringliteral">'unstable'</span>][pkg][VERSION]))
<a name="l02505"></a>02505 ok = <span class="keyword">False</span>
<a name="l02506"></a>02506 <span class="keywordflow">if</span> <span class="keywordflow">not</span> ok:
<a name="l02507"></a>02507 self.<a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(<span class="stringliteral">"Not using hint\n"</span>)
<a name="l02508"></a>02508 <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l02509"></a>02509
<a name="l02510"></a>02510 self.<a class="code" href="classbritney_1_1Britney.html#3ef9b6f600eac492fc5aa4b31638198f">do_all</a>(hintinfo[type], map(operator.itemgetter(0), pkgvers))
<a name="l02511"></a>02511 <span class="keywordflow">return</span> <span class="keyword">True</span>
<a name="l02512"></a>02512
<a name="l02513"></a>02513 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#70115e28e2ee6aa3a09d1efbd81b4a87">sort_actions</a>(self):
<a name="l02514"></a>02514 <span class="stringliteral">"""Sort actions in a smart way</span>
<a name="l02515"></a>02515 <span class="stringliteral"></span>
<a name="l02516"></a>02516 <span class="stringliteral"> This method sorts the list of actions in a smart way. In details, it uses</span>
<a name="l02517"></a>02517 <span class="stringliteral"> as base sort the number of days the excuse is old, then reordering packages</span>
<a name="l02518"></a>02518 <span class="stringliteral"> so the ones with most reverse dependencies are at the end of the loop.</span>
<a name="l02519"></a>02519 <span class="stringliteral"> If an action depends on another one, it is put after it.</span>
<a name="l02520"></a>02520 <span class="stringliteral"> """</span>
<a name="l02521"></a>02521 upgrade_me = [x.name <span class="keywordflow">for</span> x <span class="keywordflow">in</span> self.excuses <span class="keywordflow">if</span> x.name <span class="keywordflow">in</span> self.upgrade_me]
<a name="l02522"></a>02522 <span class="keywordflow">for</span> e <span class="keywordflow">in</span> self.excuses:
<a name="l02523"></a>02523 <span class="keywordflow">if</span> e.name <span class="keywordflow">not</span> <span class="keywordflow">in</span> upgrade_me: <span class="keywordflow">continue</span>
<a name="l02524"></a>02524 <span class="comment"># try removes at the end of the loop</span>
<a name="l02525"></a>02525 <span class="keywordflow">elif</span> e.name[0] == <span class="stringliteral">'-'</span>:
<a name="l02526"></a>02526 upgrade_me.remove(e.name)
<a name="l02527"></a>02527 upgrade_me.append(e.name)
<a name="l02528"></a>02528 <span class="comment"># otherwise, put it in a good position checking its dependencies</span>
<a name="l02529"></a>02529 <span class="keywordflow">else</span>:
<a name="l02530"></a>02530 pos = []
<a name="l02531"></a>02531 udeps = [upgrade_me.index(x) <span class="keywordflow">for</span> x <span class="keywordflow">in</span> e.deps <span class="keywordflow">if</span> x <span class="keywordflow">in</span> upgrade_me <span class="keywordflow">and</span> x != e.name]
<a name="l02532"></a>02532 <span class="keywordflow">if</span> len(udeps) > 0:
<a name="l02533"></a>02533 pos.append(max(udeps))
<a name="l02534"></a>02534 sdeps = [upgrade_me.index(x) <span class="keywordflow">for</span> x <span class="keywordflow">in</span> e.sane_deps <span class="keywordflow">if</span> x <span class="keywordflow">in</span> upgrade_me <span class="keywordflow">and</span> x != e.name]
<a name="l02535"></a>02535 <span class="keywordflow">if</span> len(sdeps) > 0:
<a name="l02536"></a><a class="code" href="classbritney_1_1Britney.html#c9c109f54ddce53b17513405e07dba1a">02536</a> pos.append(min(sdeps))
<a name="l02537"></a>02537 <span class="keywordflow">if</span> len(pos) == 0: <span class="keywordflow">continue</span>
<a name="l02538"></a>02538 upgrade_me.remove(e.name)
<a name="l02539"></a>02539 upgrade_me.insert(max(pos)+1, e.name)
<a name="l02540"></a>02540 self.dependencies[e.name] = e.deps
<a name="l02541"></a>02541
<a name="l02542"></a>02542 <span class="comment"># replace the list of actions with the new one</span>
<a name="l02543"></a>02543 self.upgrade_me = upgrade_me
<a name="l02544"></a>02544
<a name="l02545"></a>02545 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#c9c109f54ddce53b17513405e07dba1a">auto_hinter</a>(self):
<a name="l02546"></a>02546 <span class="stringliteral">"""Auto hint circular dependencies</span>
<a name="l02547"></a>02547 <span class="stringliteral"></span>
<a name="l02548"></a>02548 <span class="stringliteral"> This method tries to auto hint circular dependencies analyzing the update</span>
<a name="l02549"></a>02549 <span class="stringliteral"> excuses relationships. If they build a circular dependency, which we already</span>
<a name="l02550"></a>02550 <span class="stringliteral"> know as not-working with the standard do_all algorithm, try to `easy` them.</span>
<a name="l02551"></a>02551 <span class="stringliteral"> """</span>
<a name="l02552"></a>02552 self.<a class="code" href="classbritney_1_1Britney.html#678036a5200302d77249f5e702532681">__log</a>(<span class="stringliteral">"> Processing hints from the auto hinter"</span>, type=<span class="stringliteral">"I"</span>)
<a name="l02553"></a>02553
<a name="l02554"></a>02554 <span class="comment"># consider only excuses which are valid candidates</span>
<a name="l02555"></a>02555 excuses = dict([(x.name, x) <span class="keywordflow">for</span> x <span class="keywordflow">in</span> self.excuses <span class="keywordflow">if</span> x.name <span class="keywordflow">in</span> self.upgrade_me])
<a name="l02556"></a>02556
<a name="l02557"></a>02557 <span class="keyword">def </span>find_related(e, hint, first=False):
<a name="l02558"></a>02558 <span class="keywordflow">if</span> e <span class="keywordflow">not</span> <span class="keywordflow">in</span> excuses:
<a name="l02559"></a>02559 <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l02560"></a>02560 excuse = excuses[e]
<a name="l02561"></a>02561 <span class="keywordflow">if</span> e <span class="keywordflow">in</span> self.sources[<span class="stringliteral">'testing'</span>] <span class="keywordflow">and</span> self.sources[<span class="stringliteral">'testing'</span>][e][VERSION] == excuse.ver[1]:
<a name="l02562"></a>02562 <span class="keywordflow">return</span> <span class="keyword">True</span>
<a name="l02563"></a>02563 <span class="keywordflow">if</span> <span class="keywordflow">not</span> first:
<a name="l02564"></a>02564 hint[e] = excuse.ver[1]
<a name="l02565"></a>02565 <span class="keywordflow">if</span> len(excuse.deps) == 0:
<a name="l02566"></a>02566 <span class="keywordflow">return</span> hint
<a name="l02567"></a>02567 <span class="keywordflow">for</span> p <span class="keywordflow">in</span> excuse.deps:
<a name="l02568"></a>02568 <span class="keywordflow">if</span> p <span class="keywordflow">in</span> hint: <span class="keywordflow">continue</span>
<a name="l02569"></a>02569 <span class="keywordflow">if</span> <span class="keywordflow">not</span> find_related(p, hint):
<a name="l02570"></a>02570 <span class="keywordflow">return</span> <span class="keyword">False</span>
<a name="l02571"></a>02571 <span class="keywordflow">return</span> hint
<a name="l02572"></a>02572
<a name="l02573"></a>02573 <span class="comment"># loop on them</span>
<a name="l02574"></a>02574 cache = []
<a name="l02575"></a>02575 <span class="keywordflow">for</span> e <span class="keywordflow">in</span> excuses:
<a name="l02576"></a><a class="code" href="classbritney_1_1Britney.html#39c07e55b274ff98cb9cecb5f051bc5d">02576</a> excuse = excuses[e]
<a name="l02577"></a>02577 <span class="keywordflow">if</span> e <span class="keywordflow">in</span> self.sources[<span class="stringliteral">'testing'</span>] <span class="keywordflow">and</span> self.sources[<span class="stringliteral">'testing'</span>][e][VERSION] == excuse.ver[1] <span class="keywordflow">or</span> \
<a name="l02578"></a>02578 len(excuse.deps) == 0:
<a name="l02579"></a>02579 <span class="keywordflow">continue</span>
<a name="l02580"></a>02580 hint = find_related(e, {}, <span class="keyword">True</span>)
<a name="l02581"></a>02581 <span class="keywordflow">if</span> hint <span class="keywordflow">and</span> e <span class="keywordflow">in</span> hint <span class="keywordflow">and</span> hint <span class="keywordflow">not</span> <span class="keywordflow">in</span> cache:
<a name="l02582"></a>02582 self.<a class="code" href="classbritney_1_1Britney.html#7bf70a5ad5754eb949205db3dc4b9c8a">do_hint</a>(<span class="stringliteral">"easy"</span>, <span class="stringliteral">"autohinter"</span>, hint.items())
<a name="l02583"></a>02583 cache.append(hint)
<a name="l02584"></a>02584
<a name="l02585"></a>02585 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#39c07e55b274ff98cb9cecb5f051bc5d">old_libraries</a>(self):
<a name="l02586"></a>02586 <span class="stringliteral">"""Detect old libraries left in testing for smooth transitions</span>
<a name="l02587"></a>02587 <span class="stringliteral"></span>
<a name="l02588"></a>02588 <span class="stringliteral"> This method detect old libraries which are in testing but no longer</span>
<a name="l02589"></a>02589 <span class="stringliteral"> built from the source package: they are still there because other</span>
<a name="l02590"></a>02590 <span class="stringliteral"> packages still depend on them, but they should be removed as soon</span>
<a name="l02591"></a>02591 <span class="stringliteral"> as possible.</span>
<a name="l02592"></a>02592 <span class="stringliteral"> """</span>
<a name="l02593"></a>02593 sources = self.sources[<span class="stringliteral">'testing'</span>]
<a name="l02594"></a>02594 testing = self.binaries[<span class="stringliteral">'testing'</span>]
<a name="l02595"></a>02595 unstable = self.binaries[<span class="stringliteral">'unstable'</span>]
<a name="l02596"></a><a class="code" href="classbritney_1_1Britney.html#7c45f1c5b1dbd442fb9b85fef3fe1823">02596</a> removals = []
<a name="l02597"></a>02597 <span class="keywordflow">for</span> arch <span class="keywordflow">in</span> self.options.architectures:
<a name="l02598"></a>02598 <span class="keywordflow">for</span> pkg_name <span class="keywordflow">in</span> testing[arch][0]:
<a name="l02599"></a>02599 pkg = testing[arch][0][pkg_name]
<a name="l02600"></a>02600 <span class="keywordflow">if</span> pkg_name <span class="keywordflow">not</span> <span class="keywordflow">in</span> unstable[arch][0] <span class="keywordflow">and</span> \
<a name="l02601"></a>02601 <span class="keywordflow">not</span> self.<a class="code" href="classbritney_1_1Britney.html#85d2e45e8431779b62f398c34972ddf1">same_source</a>(sources[pkg[SOURCE]][VERSION], pkg[SOURCEVER]):
<a name="l02602"></a>02602 removals.append(<span class="stringliteral">"-"</span> + pkg_name + <span class="stringliteral">"/"</span> + arch)
<a name="l02603"></a>02603 <span class="keywordflow">return</span> removals
<a name="l02604"></a>02604
<a name="l02605"></a>02605 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#7c45f1c5b1dbd442fb9b85fef3fe1823">old_libraries_format</a>(self, libs):
<a name="l02606"></a>02606 <span class="stringliteral">"""Format old libraries in a smart table"""</span>
<a name="l02607"></a>02607 libraries = {}
<a name="l02608"></a><a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">02608</a> <span class="keywordflow">for</span> i <span class="keywordflow">in</span> libs:
<a name="l02609"></a>02609 pkg, arch = i.split(<span class="stringliteral">"/"</span>)
<a name="l02610"></a>02610 pkg = pkg[1:]
<a name="l02611"></a>02611 <span class="keywordflow">if</span> pkg <span class="keywordflow">in</span> libraries:
<a name="l02612"></a><a class="code" href="classbritney_1_1Britney.html#0e9551bdf927388f55be5ce15a48c94f">02612</a> libraries[pkg].append(arch)
<a name="l02613"></a>02613 <span class="keywordflow">else</span>:
<a name="l02614"></a>02614 libraries[pkg] = [arch]
<a name="l02615"></a>02615 <span class="keywordflow">return</span> <span class="stringliteral">"\n"</span>.join([<span class="stringliteral">" "</span> + k + <span class="stringliteral">": "</span> + <span class="stringliteral">" "</span>.join(libraries[k]) <span class="keywordflow">for</span> k <span class="keywordflow">in</span> libraries]) + <span class="stringliteral">"\n"</span>
<a name="l02616"></a>02616
<a name="l02617"></a>02617 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#b0406f20fbbbb08cd3c6e5e6b35f77d5">output_write</a>(self, msg):
<a name="l02618"></a>02618 <span class="stringliteral">"""Simple wrapper for output writing"""</span>
<a name="l02619"></a>02619 self.__output.write(msg)
<a name="l02620"></a>02620
<a name="l02621"></a>02621 <span class="keyword">def </span><a class="code" href="classbritney_1_1Britney.html#0e9551bdf927388f55be5ce15a48c94f">main</a>(self):
<a name="l02622"></a>02622 <span class="stringliteral">"""Main method</span>
<a name="l02623"></a>02623 <span class="stringliteral"> </span>
<a name="l02624"></a>02624 <span class="stringliteral"> This is the entry point for the class: it includes the list of calls</span>
<a name="l02625"></a>02625 <span class="stringliteral"> for the member methods which will produce the output files.</span>
<a name="l02626"></a>02626 <span class="stringliteral"> """</span>
<a name="l02627"></a>02627 <span class="comment"># if no actions are provided, build the excuses and sort them</span>
<a name="l02628"></a>02628 <span class="keywordflow">if</span> <span class="keywordflow">not</span> self.options.actions:
<a name="l02629"></a>02629 self.<a class="code" href="classbritney_1_1Britney.html#010f6deffca32f7f71ecf1f5c1bb4985">write_excuses</a>()
<a name="l02630"></a>02630 <span class="keywordflow">if</span> <span class="keywordflow">not</span> self.options.compatible:
<a name="l02631"></a>02631 self.<a class="code" href="classbritney_1_1Britney.html#70115e28e2ee6aa3a09d1efbd81b4a87">sort_actions</a>()
<a name="l02632"></a>02632 <span class="comment"># otherwise, use the actions provided by the command line</span>
<a name="l02633"></a>02633 <span class="keywordflow">else</span>: self.upgrade_me = self.options.actions.split()
<a name="l02634"></a>02634
<a name="l02635"></a>02635 <span class="comment"># run the upgrade test</span>
<a name="l02636"></a>02636 self.<a class="code" href="classbritney_1_1Britney.html#921effe0d64ed713c38888684a0a26d4">upgrade_testing</a>()
<a name="l02637"></a>02637
<a name="l02638"></a>02638 <span class="keywordflow">if</span> __name__ == <span class="stringliteral">'__main__'</span>:
<a name="l02639"></a>02639 Britney().main()
</pre></div><hr size="1"><address style="align: right;"><small>Generated on Fri Aug 18 23:23:25 2006 for briteny by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.7 </small></address>
</body>
</html>