rem stringlengths 0 322k | add stringlengths 0 2.05M | context stringlengths 8 228k |
|---|---|---|
for j in binaries[arch][0][binary]['rconflicts']: key = (j, arch) | for j in binaries[parch][0][binary]['rconflicts']: key = (j, parch) | def doop_source(self, pkg): """Apply a change to the testing distribution as requested by `pkg` |
for p in self.get_full_tree(j, arch, 'testing'): key = (p, arch) | for p in self.get_full_tree(j, parch, 'testing'): key = (p, parch) | def doop_source(self, pkg): """Apply a change to the testing distribution as requested by `pkg` |
binaries[arch][0][binary] = self.binaries[suite][arch][0][binary] | binaries[parch][0][binary] = self.binaries[suite][parch][0][binary] | def doop_source(self, pkg): """Apply a change to the testing distribution as requested by `pkg` |
for j in binaries[arch][0][binary]['provides']: key = j + "/" + arch if j not in binaries[arch][1]: | for j in binaries[parch][0][binary]['provides']: key = j + "/" + parch if j not in binaries[parch][1]: | def doop_source(self, pkg): """Apply a change to the testing distribution as requested by `pkg` |
binaries[arch][1][j] = [] | binaries[parch][1][j] = [] | def doop_source(self, pkg): """Apply a change to the testing distribution as requested by `pkg` |
undo['virtual'][key] = binaries[arch][1][j][:] binaries[arch][1][j].append(binary) | undo['virtual'][key] = binaries[parch][1][j][:] binaries[parch][1][j].append(binary) | def doop_source(self, pkg): """Apply a change to the testing distribution as requested by `pkg` |
binary, arch = p.split("/") self.register_reverses(binary, binaries[arch][0] , binaries[arch][1]) | binary, parch = p.split("/") if arch and parch != arch: continue self.register_reverses(binary, binaries[parch][0] , binaries[parch][1]) | def doop_source(self, pkg): """Apply a change to the testing distribution as requested by `pkg` |
sources['testing'][pkg_name] = sources[suite][pkg_name] | if not arch: sources['testing'][pkg_name] = sources[suite][pkg_name] | def doop_source(self, pkg): """Apply a change to the testing distribution as requested by `pkg` |
selected = self.selected | selected = self.selected[:] | def do_all(self, maxdepth=0, init=None, actions=None): """Testing update runner |
n = len(nuninst[arch]) + (original and len(original[arch]) or 0) if arch in self.options.break_arches: totalbreak = totalbreak + n else: total = total + n res.append("%s-%d" % (arch[0], n)) | n = len(nuninst[arch]) elif original and original.has_key(arch): n = len(original[arch]) else: continue if arch in self.options.break_arches: totalbreak = totalbreak + n else: total = total + n res.append("%s-%d" % (arch[0], n)) | def eval_nuninst(self, nuninst, original=None): res = [] total = 0 totalbreak = 0 for arch in self.options.architectures: if nuninst.has_key(arch): n = len(nuninst[arch]) + (original and len(original[arch]) or 0) if arch in self.options.break_arches: totalbreak = totalbreak + n else: total = total + n res.append("%s-%d... |
key = (j[0], j[1], j[2], arch) | key = (j[0], arch) | def doop_source(self, pkg): |
key = (binary, None, None, arch) | key = (binary, arch) | def doop_source(self, pkg): |
key = (p, None, None, arch) | key = (p, arch) | def doop_source(self, pkg): |
broken = [] for arch in self.options.architectures: | for arch in ("/" in pkg and (pkg.split("/")[1],) or self.options.architectures): | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() |
for p in filter(lambda x: x[3] == arch, affected): | for p in filter(lambda x: x[1] == arch, affected): | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() |
nuninst[arch] = sorted(broken) if len(nuninst[arch]) > 0: | for b in broken: if b not in nuninst[arch]: nuninst[arch].append(b) if len(nuninst[arch]) > len(nuninst_comp[arch]): | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() |
nuninst_new = nuninst_comp | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() | |
output.write(" now: %s\n" % (self.eval_nuninst(nuninst_new))) | output.write(" now: %s\n" % (self.eval_nuninst(nuninst))) | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() |
nuninst_comp = nuninst_new | for k in nuninst: nuninst_comp[k] = nuninst[k] | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() |
output.write(" got: %s\n" % self.eval_nuninst(nuninst, self.nuninst_orig)) output.write(" * %s: %s\n" % (arch, ", ".join(nuninst[arch]))) | output.write(" got: %s\n" % (self.eval_nuninst(nuninst, "/" in pkg and self.nuninst_orig or None))) output.write(" * %s: %s\n" % (arch, ", ".join(sorted(broken)))) | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() |
def do_all(self, output): | def do_all(self, output, maxdepth=0, init=None): | def do_all(self, output): nuninst_start = self.get_nuninst() output.write("start: %s\n" % self.eval_nuninst(nuninst_start)) output.write("orig: %s\n" % self.eval_nuninst(nuninst_start)) self.selected = [] self.nuninst_orig = nuninst_start self.iter_packages(self.upgrade_me, output) |
self.iter_packages(self.upgrade_me, output) | (nuninst_end, extra) = self.iter_packages(self.upgrade_me, output) if nuninst_end: output.write("final: %s\n" % ",".join(self.selected)) output.write("start: %s\n" % self.eval_nuninst(nuninst_start)) output.write(" orig: %s\n" % self.eval_nuninst(self.nuninst_orig)) output.write(" end: %s\n" % self.eval_nuninst(nunin... | def do_all(self, output): nuninst_start = self.get_nuninst() output.write("start: %s\n" % self.eval_nuninst(nuninst_start)) output.write("orig: %s\n" % self.eval_nuninst(nuninst_start)) self.selected = [] self.nuninst_orig = nuninst_start self.iter_packages(self.upgrade_me, output) |
if not system[source][1]: | if not system[source][1][0]: | def handle_conflict(pkg, source, system, conflicts): # reached the top of the tree if not system[source][1]: return False # remove its conflicts unregister_conflicts(source, conflicts) # if there are alternatives, try them alternatives = system[source][0] for alt in alternatives: if satisfy(alt, [x for x in alternative... |
if pkg in binaries[1]: | if pkg_from and pkg in binaries[1]: | def satisfy(pkg, pkg_alt=None, pkg_from=None, system=system, conflicts=conflicts, excluded=[]): # if it is real package and it is already installed, skip it and return True if pkg in binaries[0]: if pkg in system: if type(pkg_from) == list: system[pkg][1].extend(pkg_from) else: system[pkg][1].append(pkg_from) system[pk... |
system[p] = ([], [pkg]) | if p in system: if system[p][1][0] == None: continue system[p][1].append(pkg) else: system[p] = ([], [pkg]) | def satisfy(pkg, pkg_alt=None, pkg_from=None, system=system, conflicts=conflicts, excluded=[]): # if it is real package and it is already installed, skip it and return True if pkg in binaries[0]: if pkg in system: if type(pkg_from) == list: system[pkg][1].extend(pkg_from) else: system[pkg][1].append(pkg_from) system[pk... |
if conflicting not in binary_u['provides'] and ( \ op == '' and version == '' or check_depends(binary_u['version'], op, version)): | if conflicting in binary_u['provides'] and system[conflicting][1] == [pkg]: continue if op == '' and version == '' or check_depends(binary_u['version'], op, version): | def satisfy(pkg, pkg_alt=None, pkg_from=None, system=system, conflicts=conflicts, excluded=[]): # if it is real package and it is already installed, skip it and return True if pkg in binaries[0]: if pkg in system: if type(pkg_from) == list: system[pkg][1].extend(pkg_from) else: system[pkg][1].append(pkg_from) system[pk... |
if name in broken: continue | def satisfy(pkg, pkg_alt=None, pkg_from=None, system=system, conflicts=conflicts, excluded=[]): # if it is real package and it is already installed, skip it and return True if pkg in binaries[0]: if pkg in system: if type(pkg_from) == list: system[pkg][1].extend(pkg_from) else: system[pkg][1].append(pkg_from) system[pk... | |
if len(nuninst[arch]) > len(nuninst_comp[arch]): | if arch not in self.options.break_arches and \ len(nuninst[arch]) > len(nuninst_comp[arch]): | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() |
", ".join(nuninst[arch])) | ", ".join(sorted(nuninst[arch]))) | def eval_uninst(self, nuninst): res = "" for arch in self.options.architectures: if arch in nuninst and nuninst[arch] != []: res = res + " * %s: %s\n" % (arch, ", ".join(nuninst[arch])) return res |
nuninst[arch] = nuninst_comp[arch][:] | nuninst[arch] = [x for x in nuninst_comp[arch] if x in binaries[arch][0]] | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() |
output.write(" got: %s\n" % (self.eval_nuninst(nuninst, "/" in pkg and self.nuninst_orig or None))) output.write(" * %s: %s\n" % (arch, ", ".join(sorted(broken)))) | output.write(" got: %s\n" % (self.eval_nuninst(nuninst, "/" in pkg and nuninst_comp or None))) output.write(" * %s: %s\n" % (arch, ", ".join(sorted([b for b in broken if b not in nuninst_comp[arch]])))) | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() |
for i in provides[a[0]]: | for i in provides.get(a[0]): | def register_reverses(self, pkg, packages, provides, check_doubles=True, parse_depends=apt_pkg.ParseDepends): """Register reverse dependencies and conflicts for the specified package |
if name in binaries[0] and name not in excluded: | if name not in excluded and name in binaries[0]: | def get_dependency_solvers(self, block, arch, distribution, excluded=[], strict=False): """Find the packages which satisfy a dependency block |
if name in binaries[1]: for prov in binaries[1][name]: if prov in excluded or \ prov not in binaries[0]: continue package = binaries[0][prov] if op == '' and version == '' or not strict and apt_pkg.CheckDep(package['version'], op, version): packages.append(prov) break | for prov in binaries[1].get(name, []): if prov in excluded or \ prov not in binaries[0]: continue package = binaries[0][prov] if op == '' and version == '' or not strict and apt_pkg.CheckDep(package['version'], op, version): packages.append(prov) break | def get_dependency_solvers(self, block, arch, distribution, excluded=[], strict=False): """Find the packages which satisfy a dependency block |
elif excuse == None: return False | def excuse_unsat_deps(self, pkg, src, arch, suite, excuse=None, excluded=[], conflicts=False): """Find unsatisfied dependencies for a binary package | |
if not excuse and conflicts: | if conflicts: | def excuse_unsat_deps(self, pkg, src, arch, suite, excuse=None, excluded=[], conflicts=False): """Find unsatisfied dependencies for a binary package |
for block in map(operator.itemgetter(0), parse_depends(binary_u['conflicts'])): | for block in map(operator.itemgetter(0), parse_depends(binary_u.get('conflicts', []))): | def satisfy(pkg, pkg_alt=None, pkg_from=None, system=system, conflicts=conflicts, excluded=[]): |
def should_remove_source(self, pkg): """Check if a source package should be removed from testing This method checks if a source package should be removed from the testing distribution; this happen if the source package is not present in the unstable distribution anymore. It returns True if the package can be removed,... | def satisfy(pkg, pkg_alt=None, pkg_from=None, system=system, conflicts=conflicts, excluded=[]): | |
if pkg_name in self.sources['testing']: source = self.sources['testing'][pkg_name] | if pkg_name in sources['testing']: source = sources['testing'][pkg_name] | def doop_source(self, pkg): |
undo['binaries'][p] = self.binaries['testing'][arch][0][binary] for j in self.binaries['testing'][arch][0][binary]['rdepends']: | undo['binaries'][p] = binaries[arch][0][binary] for j in binaries[arch][0][binary]['rdepends']: | def doop_source(self, pkg): |
for j in self.binaries['testing'][arch][0][binary]['provides']: | for j in binaries[arch][0][binary]['provides']: | def doop_source(self, pkg): |
undo['virtual'][j + "/" + arch] = self.binaries['testing'][arch][1][j][:] self.binaries['testing'][arch][1][j].remove(binary) if len(self.binaries['testing'][arch][1][j]) == 0: del self.binaries['testing'][arch][1][j] del self.binaries['testing'][arch][0][binary] | undo['virtual'][j + "/" + arch] = binaries[arch][1][j][:] binaries[arch][1][j].remove(binary) if len(binaries[arch][1][j]) == 0: del binaries[arch][1][j] del binaries[arch][0][binary] | def doop_source(self, pkg): |
del self.sources['testing'][pkg_name] | del sources['testing'][pkg_name] | def doop_source(self, pkg): |
if pkg_name in self.binaries['testing'][arch][0]: for j in self.binaries['testing'][arch][0][pkg_name]['rdepends']: | if pkg_name in binaries[arch][0]: for j in binaries[arch][0][pkg_name]['rdepends']: | def doop_source(self, pkg): |
source = self.sources[suite][pkg_name] | source = sources[suite][pkg_name] | def doop_source(self, pkg): |
if binary in self.binaries['testing'][arch][0]: undo['binaries'][p] = self.binaries['testing'][arch][0][binary] for j in self.binaries['testing'][arch][0][binary]['rdepends']: | if binary in binaries[arch][0]: undo['binaries'][p] = binaries[arch][0][binary] for j in binaries[arch][0][binary]['rdepends']: | def doop_source(self, pkg): |
for j in self.binaries['testing'][arch][0][binary]['rconflicts']: | for j in binaries[arch][0][binary]['rconflicts']: | def doop_source(self, pkg): |
self.binaries['testing'][arch][0][binary] = self.binaries[suite][arch][0][binary] for j in self.binaries['testing'][arch][0][binary]['provides']: if j not in self.binaries['testing'][arch][1]: | binaries[arch][0][binary] = self.binaries[suite][arch][0][binary] for j in binaries[arch][0][binary]['provides']: if j not in binaries[arch][1]: | def doop_source(self, pkg): |
self.binaries['testing'][arch][1][j] = [] | binaries[arch][1][j] = [] | def doop_source(self, pkg): |
undo['virtual'][j + "/" + arch] = self.binaries['testing'][arch][1][j][:] self.binaries['testing'][arch][1][j].append(binary) for j in self.binaries['testing'][arch][0][binary]['rdepends']: | undo['virtual'][j + "/" + arch] = binaries[arch][1][j][:] binaries[arch][1][j].append(binary) for j in binaries[arch][0][binary]['rdepends']: | def doop_source(self, pkg): |
self.register_reverses(binary, self.binaries['testing'][arch][0] , self.binaries['testing'][arch][1]) self.sources['testing'][pkg_name] = self.sources[suite][pkg_name] | self.register_reverses(binary, binaries[arch][0] , binaries[arch][1]) sources['testing'][pkg_name] = sources[suite][pkg_name] | def doop_source(self, pkg): |
excuse_unsat_deps = self.excuse_unsat_deps | check_installable = self.check_installable | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() |
r = excuse_unsat_deps(p, None, arch, 'testing', None, excluded=broken, conflicts=True) | r = check_installable(p, arch, 'testing', excluded=broken, conflicts=True) | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() |
if p not in binaries[arch][0] or \ | if p in broken or p not in binaries[arch][0] or \ | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() |
for pkg in sorted(filter(lambda x: x.endswith("/" + arch), source_u['binaries'])): | for pkg in sorted(filter(lambda x: x.endswith("/" + arch), source_u['binaries']), key=lambda x: x.split("/")[0]): | def should_upgrade_srcarch(self, src, arch, suite): """Check if binary package should be upgraded |
if pkg in sources['testing']: | if pkg in sources['testing'] and 'fake' not in sources['testing'][pkg]: | def write_excuses(self): """Produce and write the update excuses |
if arch in self.options.architectures: | if arch.split("+", 1)[0] in self.options.architectures: | def read_nuninst(self): """Read the non-installable report""" f = open(self.options.noninst_status) nuninst = {} for r in f: if ":" not in r: continue arch, packages = r.strip().split(":", 1) if arch in self.options.architectures: nuninst[arch] = packages.split() return nuninst |
for pkg in nuninst[arch][:]: | for pkg in nuninst[arch + "+all"]: | def add_nuninst(pkg, arch): if pkg not in nuninst[arch]: nuninst[arch].append(pkg) for p in binaries[arch][0][pkg]['rdepends']: r = check_installable(p, arch, 'testing', excluded=nuninst[arch], conflicts=True) if not r: add_nuninst(p, arch) |
if pkg in broken: | if pkg in broken and pkg_from: | def satisfy(pkg, pkg_alt=None, pkg_from=None, system=system, conflicts=conflicts, excluded=[]): # if it is real package and it is already installed, skip it and return True if pkg in binaries[0]: if pkg in system: if type(pkg_from) == list: system[pkg][1].extend(pkg_from) else: system[pkg][1].append(pkg_from) system[pk... |
lundo.append((undo, pkg, suite)) | lundo.append((undo, pkg, pkg_name, suite)) | def iter_packages(self, packages, selected, hint=False, nuninst=None): """Iter on the list of actions and apply them one-by-one |
broken = nuninst[arch][:] | nuninst[arch + "+all"] = [x for x in nuninst_comp[arch + "+all"] if x in binaries[arch][0]] broken = nuninst[arch + "+all"][:] | def iter_packages(self, packages, selected, hint=False, nuninst=None): """Iter on the list of actions and apply them one-by-one |
if p not in binaries[arch][0] or \ skip_archall and binaries[arch][0][p]['architecture'] == 'all': continue | if p not in binaries[arch][0]: continue | def iter_packages(self, packages, selected, hint=False, nuninst=None): """Iter on the list of actions and apply them one-by-one |
elif r and p in nuninst[arch]: | elif r and p in nuninst[arch + "+all"]: | def iter_packages(self, packages, selected, hint=False, nuninst=None): """Iter on the list of actions and apply them one-by-one |
nuninst[arch].remove(p) | nuninst[arch + "+all"].remove(p) if not (skip_archall and binaries[arch][0][p]['architecture'] == 'all'): nuninst[arch].remove(p) | def iter_packages(self, packages, selected, hint=False, nuninst=None): """Iter on the list of actions and apply them one-by-one |
while l < len(broken): l = len(broken) for j in broken: | while old_broken != broken: old_broken = broken[:] for j in broken + repaired: | def iter_packages(self, packages, selected, hint=False, nuninst=None): """Iter on the list of actions and apply them one-by-one |
if p in broken or p not in binaries[arch][0] or \ skip_archall and binaries[arch][0][p]['architecture'] == 'all': continue | if p in broken or p not in binaries[arch][0]: continue | def iter_packages(self, packages, selected, hint=False, nuninst=None): """Iter on the list of actions and apply them one-by-one |
if b not in nuninst[arch]: | if b not in nuninst[arch + "+all"]: nuninst[arch + "+all"].append(b) if b not in nuninst[arch] and not (skip_archall and binaries[arch][0][b]['architecture'] == 'all'): | def iter_packages(self, packages, selected, hint=False, nuninst=None): """Iter on the list of actions and apply them one-by-one |
self.output_write(" * %s: %s\n" % (arch, ", ".join(sorted([b for b in broken if b not in nuninst_comp[arch]])))) | self.output_write(" * %s: %s\n" % (arch, ", ".join(sorted([b for b in nuninst[arch] if b not in nuninst_comp[arch]])))) | def iter_packages(self, packages, selected, hint=False, nuninst=None): """Iter on the list of actions and apply them one-by-one |
if pkg in sources[suite]: for p in sources[suite][pkg]['binaries']: | if pkg[0] != '-' and pkg_name in sources[suite]: for p in sources[suite][pkg_name]['binaries']: | def iter_packages(self, packages, selected, hint=False, nuninst=None): """Iter on the list of actions and apply them one-by-one |
for (undo, pkg, suite) in lundo: | for (undo, pkg, pkg_name, suite) in lundo: | def do_all(self, maxdepth=0, init=None, actions=None): """Testing update runner |
if pkg in self.sources[suite]: for p in self.sources[suite][pkg]['binaries']: | if pkg_name in self.sources[suite]: for p in self.sources[suite][pkg_name]['binaries']: | def do_all(self, maxdepth=0, init=None, actions=None): """Testing update runner |
for x in self.hints['easy']: self.do_hint("easy", x[0], x[1]) for x in self.hints["force-hint"]: self.do_hint("force-hint", x[0], x[1]) | if not self.options.actions: for x in self.hints['easy']: self.do_hint("easy", x[0], x[1]) for x in self.hints["force-hint"]: self.do_hint("force-hint", x[0], x[1]) | def upgrade_testing(self): """Upgrade testing using the unstable packages |
if not actions: | if not actions and not earlyabort: | def do_all(self, maxdepth=0, init=None, actions=None): """Testing update runner |
def iter_packages(self, packages, hint=False): | def iter_packages(self, packages, selected, hint=False): | def iter_packages(self, packages, hint=False): """Iter on the list of actions and apply them one-by-one |
self.output_write("recur: [%s] %s %d/%d\n" % (",".join(self.selected), "", len(packages), len(extra))) | self.output_write("recur: [%s] %s %d/%d\n" % (",".join(selected), "", len(packages), len(extra))) | def iter_packages(self, packages, hint=False): """Iter on the list of actions and apply them one-by-one |
self.selected.append(pkg) | selected.append(pkg) | def iter_packages(self, packages, hint=False): """Iter on the list of actions and apply them one-by-one |
self.output_write(" now: %s\n" % (self.eval_nuninst(nuninst))) if len(self.selected) <= 20: self.output_write(" all: %s\n" % (" ".join(self.selected))) | self.output_write(" now: %s\n" % (self.eval_nuninst(nuninst, nuninst_comp))) if len(selected) <= 20: self.output_write(" all: %s\n" % (" ".join(selected))) | def iter_packages(self, packages, hint=False): """Iter on the list of actions and apply them one-by-one |
self.output_write(" most: (%d) .. %s\n" % (len(self.selected), " ".join(self.selected[-20:]))) | self.output_write(" most: (%d) .. %s\n" % (len(selected), " ".join(selected[-20:]))) | def iter_packages(self, packages, hint=False): """Iter on the list of actions and apply them one-by-one |
self.output_write(" finish: [%s]\n" % ",".join(self.selected)) | self.output_write(" finish: [%s]\n" % ",".join(selected)) | def iter_packages(self, packages, hint=False): """Iter on the list of actions and apply them one-by-one |
selected = self.selected[:] | selected = self.selected | def do_all(self, maxdepth=0, init=None, actions=None): """Testing update runner |
(nuninst_end, lundo) = self.iter_packages(init, hint=True) | (nuninst_end, lundo) = self.iter_packages(init, selected, hint=True) | def do_all(self, maxdepth=0, init=None, actions=None): """Testing update runner |
(nuninst_end, extra) = self.iter_packages(upgrade_me) | (nuninst_end, extra) = self.iter_packages(upgrade_me, selected) | def do_all(self, maxdepth=0, init=None, actions=None): """Testing update runner |
if k in self.sources[suite]: for p in self.sources[suite][k]['binaries']: binary, arch = p.split("/") del self.binaries['testing'][arch][0][binary] del self.sources['testing'][k] self.sources['testing'][k] = undo['sources'][k] | if k[0] == '-': del self.sources['testing'][k[1:]] else: self.sources['testing'][k] = undo['sources'][k] if pkg in self.sources[suite]: for p in self.sources[suite][pkg]['binaries']: binary, arch = p.split("/") del self.binaries['testing'][arch][0][binary] | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() |
return False return True | return False | def should_upgrade_srcarch(self, src, arch, suite): """Check if binary package should be upgraded |
for p in filter(lambda x: x[3] == arch, affected): if not self.binaries['testing'][arch][0].has_key(p[0]) or \ skip_archall and self.binaries['testing'][arch][0][p[0]]['architecture'] == 'all': continue r = self.excuse_unsat_deps(p[0], None, arch, 'testing', None, excluded=[]) if not r and p[0] not in broken: broken.ap... | nbroken = -1 while len(broken) > nbroken: nbroken = len(broken) for p in filter(lambda x: x[3] == arch, affected): if not self.binaries['testing'][arch][0].has_key(p[0]) or \ skip_archall and self.binaries['testing'][arch][0][p[0]]['architecture'] == 'all': continue r = self.excuse_unsat_deps(p[0], None, arch, 'testing... | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() |
parse_depends = apt_pkg.ParseDepends | register_reverses = self.register_reverses | def read_binaries(self, basedir, distribution, arch): """Read the list of binary packages from the specified directory The binary packages are read from the `Packages_${arch}' files within the directory specified as `basedir' parameter, replacing ${arch} with the value of the arch parameter. Considering the large amou... |
dependencies = [] if 'depends' in packages[pkg]: dependencies.extend(parse_depends(packages[pkg]['depends'])) if 'pre-depends' in packages[pkg]: dependencies.extend(parse_depends(packages[pkg]['pre-depends'])) for p in dependencies: | register_reverses(pkg, packages, provides, check_doubles=False) return (packages, provides) def register_reverses(self, pkg, packages, provides, check_doubles=True, parse_depends=apt_pkg.ParseDepends): """Register reverse dependencies and conflicts for the specified package This method register the reverse dependen... | def read_binaries(self, basedir, distribution, arch): """Read the list of binary packages from the specified directory The binary packages are read from the `Packages_${arch}' files within the directory specified as `basedir' parameter, replacing ${arch} with the value of the arch parameter. Considering the large amou... |
if a[0] in packages: packages[a[0]]['rdepends'].append((pkg, a[1], a[2])) | if a[0] in packages and (not check_doubles or pkg not in packages[a[0]]['rconflicts']): packages[a[0]]['rconflicts'].append(pkg) | def read_binaries(self, basedir, distribution, arch): """Read the list of binary packages from the specified directory The binary packages are read from the `Packages_${arch}' files within the directory specified as `basedir' parameter, replacing ${arch} with the value of the arch parameter. Considering the large amou... |
packages[i]['rdepends'].append((pkg, a[1], a[2])) if 'conflicts' in packages[pkg]: for p in parse_depends(packages[pkg]['conflicts']): if a[0] in packages: packages[a[0]]['rconflicts'].append((pkg, a[1], a[2])) elif a[0] in provides: for i in provides[a[0]]: packages[i]['rconflicts'].append((pkg, a[1], a[2])) return... | if i not in packages: continue if not check_doubles or pkg not in packages[i]['rconflicts']: packages[i]['rconflicts'].append(pkg) | def read_binaries(self, basedir, distribution, arch): """Read the list of binary packages from the specified directory The binary packages are read from the `Packages_${arch}' files within the directory specified as `basedir' parameter, replacing ${arch} with the value of the arch parameter. Considering the large amou... |
tpkg = binaries[arch][0][p[0]] | tpkg = binaries[arch][0][p] | def add_nuninst(pkg, arch): if pkg not in nuninst[arch]: nuninst[arch].append(pkg) for p in binaries[arch][0][pkg]['rdepends']: tpkg = binaries[arch][0][p[0]] if skip_archall and tpkg['architecture'] == 'all': continue r = excuse_unsat_deps(p[0], None, arch, 'testing', None, excluded=nuninst[arch], conflicts=False) if ... |
r = excuse_unsat_deps(p[0], None, arch, 'testing', None, excluded=nuninst[arch], conflicts=False) | r = excuse_unsat_deps(p, None, arch, 'testing', None, excluded=nuninst[arch], conflicts=False) | def add_nuninst(pkg, arch): if pkg not in nuninst[arch]: nuninst[arch].append(pkg) for p in binaries[arch][0][pkg]['rdepends']: tpkg = binaries[arch][0][p[0]] if skip_archall and tpkg['architecture'] == 'all': continue r = excuse_unsat_deps(p[0], None, arch, 'testing', None, excluded=nuninst[arch], conflicts=False) if ... |
add_nuninst(p[0], arch) | add_nuninst(p, arch) | def add_nuninst(pkg, arch): if pkg not in nuninst[arch]: nuninst[arch].append(pkg) for p in binaries[arch][0][pkg]['rdepends']: tpkg = binaries[arch][0][p[0]] if skip_archall and tpkg['architecture'] == 'all': continue r = excuse_unsat_deps(p[0], None, arch, 'testing', None, excluded=nuninst[arch], conflicts=False) if ... |
undo = {'binaries': {}, 'sources': {}} | undo = {'binaries': {}, 'sources': {}, 'virtual': {}, 'nvirtual': []} | def doop_source(self, pkg): |
key = (j[0], arch) | key = (j, arch) | def doop_source(self, pkg): |
for p in self.get_full_tree(j[0], arch, 'testing'): | for p in self.get_full_tree(j, arch, 'testing'): | def doop_source(self, pkg): |
packages.extend(map(operator.itemgetter(0), self.binaries[suite][arch][0][p]['rdepends'])) | packages.extend([x for x in binaries[p]['rdepends'] if x not in packages and x in binaries]) | def get_full_tree(self, pkg, arch, suite): packages = [pkg] l = n = 0 while len(packages) > l: l = len(packages) for p in packages[n:]: packages.extend(map(operator.itemgetter(0), self.binaries[suite][arch][0][p]['rdepends'])) n = l return packages |
if p[0] not in binaries[arch][0] or \ skip_archall and binaries[arch][0][p[0]]['architecture'] == 'all': continue r = excuse_unsat_deps(p[0], None, arch, 'testing', None, excluded=broken, conflicts=True) if not r and p[0] not in broken: broken.append(p[0]) | if p not in binaries[arch][0] or \ skip_archall and binaries[arch][0][p]['architecture'] == 'all': continue r = excuse_unsat_deps(p, None, arch, 'testing', None, excluded=broken, conflicts=True) if not r and p not in broken: broken.append(p) | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() |
if arch not in self.options.break_arches and \ len(nuninst[arch]) > len(nuninst_comp[arch]): | if (("/" in pkg and arch not in self.options.new_arches) or \ (arch not in self.options.break_arches)) and len(nuninst[arch]) > len(nuninst_comp[arch]): | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() |
del self.binaries['testing'][arch][0][p] | del self.binaries['testing'][arch][0][binary] | def iter_packages(self, packages, output): extra = [] nuninst_comp = self.get_nuninst() |
self.log = EinzelDateiLogger('debug.log') | self.loger = EinzelDateiLogger('debug.log') | def __init__(self,server,nickname,ident=None,realname=None): '''gleich verbinden, wenn die klasse erstellt wird''' self._lesebuffer = '' # wir brauchen einen leeren Buffer, in den geschrieben wird. Ein Buffer wird gebraucht, weil nicht alles sofort ankommt bei lag usw self.log = EinzelDateiLogger('debug.log') self._ver... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.