3 # Produces a report on NEW and BYHAND packages
4 # Copyright (C) 2001, 2002, 2003, 2005, 2006 James Troup <james@nocrew.org>
6 # This program is free software; you can redistribute it and/or modify
7 # it under the terms of the GNU General Public License as published by
8 # the Free Software Foundation; either version 2 of the License, or
9 # (at your option) any later version.
11 # This program is distributed in the hope that it will be useful,
12 # but WITHOUT ANY WARRANTY; without even the implied warranty of
13 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 # GNU General Public License for more details.
16 # You should have received a copy of the GNU General Public License
17 # along with this program; if not, write to the Free Software
18 # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 ################################################################################
22 # <o-o> XP runs GCC, XFREE86, SSH etc etc,.,, I feel almost like linux....
23 # <o-o> I am very confident that I can replicate any Linux application on XP
24 # <willy> o-o: *boggle*
25 # <o-o> building from source.
26 # <o-o> Viiru: I already run GIMP under XP
27 # <willy> o-o: why do you capitalise the names of all pieces of software?
28 # <o-o> willy: because I want the EMPHASIZE them....
30 # <willy> o-o: it makes you look like ZIPPY the PINHEAD
31 # <o-o> willy: no idea what you are talking about.
32 # <willy> o-o: do some research
33 # <o-o> willy: for what reason?
35 ################################################################################
37 import copy, glob, os, stat, sys, time
39 from daklib import queue
40 from daklib import utils
41 from daklib.dak_exceptions import *
48 ################################################################################
50 def usage(exit_code=0):
51 print """Usage: dak queue-report
52 Prints a report of packages in queue directories (usually new and byhand).
54 -h, --help show this help and exit.
55 -n, --new produce html-output
56 -s, --sort=key sort output according to key, see below.
57 -a, --age=key if using sort by age, how should time be treated?
58 If not given a default of hours will be used.
60 Sorting Keys: ao=age, oldest first. an=age, newest first.
61 na=name, ascending nd=name, descending
62 nf=notes, first nl=notes, last
64 Age Keys: m=minutes, h=hours, d=days, w=weeks, o=months, y=years
69 ################################################################################
77 ################################################################################
101 return "%s %s%s" % (x, unit, plural(x))
103 ################################################################################
105 def sg_compare (a, b):
108 """Sort by have note, time of oldest upload."""
110 a_note_state = a["note_state"]
111 b_note_state = b["note_state"]
112 if a_note_state < b_note_state:
114 elif a_note_state > b_note_state:
117 # Sort by time of oldest upload
118 return cmp(a["oldest"], b["oldest"])
120 ############################################################
123 for sorting in direction:
124 (sortkey, way, time) = sorting
130 x=int(a[sortkey]/3600)
131 y=int(b[sortkey]/3600)
133 x=int(a[sortkey]/86400)
134 y=int(b[sortkey]/86400)
136 x=int(a[sortkey]/604800)
137 y=int(b[sortkey]/604800)
139 x=int(a[sortkey]/2419200)
140 y=int(b[sortkey]/2419200)
142 x=int(a[sortkey]/29030400)
143 y=int(b[sortkey]/29030400)
157 ############################################################
160 print """<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
161 <html><head><meta http-equiv="Content-Type" content="text/html; charset=utf-8">
162 <title>Debian NEW and BYHAND Packages</title>
163 <link type="text/css" rel="stylesheet" href="style.css">
164 <link rel="shortcut icon" href="http://www.debian.org/favicon.ico">
168 <a href="http://www.debian.org/">
169 <img src="http://www.debian.org/logos/openlogo-nd-50.png" border="0" hspace="0" vspace="0" alt=""></a>
170 <a href="http://www.debian.org/">
171 <img src="http://www.debian.org/Pics/debian.png" border="0" hspace="0" vspace="0" alt="Debian Project"></a>
174 <table class="reddy" width="100%">
177 <img src="http://www.debian.org/Pics/red-upperleft.png" align="left" border="0" hspace="0" vspace="0"
178 alt="" width="15" height="16"></td>
179 <td rowspan="2" class="reddy">Debian NEW and BYHAND Packages</td>
181 <img src="http://www.debian.org/Pics/red-upperright.png" align="right" border="0" hspace="0" vspace="0"
182 alt="" width="16" height="16"></td>
186 <img src="http://www.debian.org/Pics/red-lowerleft.png" align="left" border="0" hspace="0" vspace="0"
187 alt="" width="16" height="16"></td>
189 <img src="http://www.debian.org/Pics/red-lowerright.png" align="right" border="0" hspace="0" vspace="0"
190 alt="" width="15" height="16"></td>
196 print "<p class=\"validate\">Timestamp: %s (UTC)</p>" % (time.strftime("%d.%m.%Y / %H:%M:%S", time.gmtime()))
197 print "<hr><p>Hint: Age is the youngest upload of the package, if there is more than one version.</p>"
198 print "<p>You may want to look at <a href=\"http://ftp-master.debian.org/REJECT-FAQ.html\">the REJECT-FAQ</a> for possible reasons why one of the above packages may get rejected.</p>"
199 print """<a href="http://validator.w3.org/check?uri=referer">
200 <img border="0" src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!" height="31" width="88"></a>
201 <a href="http://jigsaw.w3.org/css-validator/check/referer">
202 <img border="0" src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"
203 height="31" width="88"></a>
205 print "</body></html>"
207 def table_header(type):
208 print "<h1>Summary for: %s</h1>" % (type)
209 print """<center><table border="0">
211 <th align="center">Package</th>
212 <th align="center">Version</th>
213 <th align="center">Arch</th>
214 <th align="center">Distribution</th>
215 <th align="center">Age</th>
216 <th align="center">Maintainer</th>
217 <th align="center">Closes</th>
221 def table_footer(type, source_count, total_count):
222 print "</table></center><br>\n"
223 print "<p class=\"validate\">Package count in <b>%s</b>: <i>%s</i>\n" % (type, source_count)
224 print "<br>Total Package count: <i>%s</i></p>\n" % (total_count)
227 def table_row(source, version, arch, last_mod, maint, distribution, closes):
231 if row_number % 2 != 0:
232 print "<tr class=\"even\">"
234 print "<tr class=\"odd\">"
237 for dist in distribution:
238 if dist == "experimental":
240 print "<td valign=\"top\" class=\"%s\">%s</td>" % (tdclass, source)
241 print "<td valign=\"top\" class=\"%s\">" % (tdclass)
242 for vers in version.split():
243 print "<a href=\"/new/%s_%s.html\">%s</a><br>" % (source, vers, vers)
244 print "</td><td valign=\"top\" class=\"%s\">%s</td><td valign=\"top\" class=\"%s\">" % (tdclass, arch, tdclass)
245 for dist in distribution:
246 print "%s<br>" % (dist)
247 print "</td><td valign=\"top\" class=\"%s\">%s</td>" % (tdclass, last_mod)
248 (name, mail) = maint.split(":")
250 print "<td valign=\"top\" class=\"%s\"><a href=\"http://qa.debian.org/developer.php?login=%s\">%s</a></td>" % (tdclass, mail, name)
251 print "<td valign=\"top\" class=\"%s\">" % (tdclass)
253 print "<a href=\"http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=%s\">#%s</a><br>" % (close, close)
257 ############################################################
259 def process_changes_files(changes_files, type):
262 # Read in all the .changes files
263 for filename in changes_files:
265 Upload.pkg.changes_file = filename
268 cache[filename] = copy.copy(Upload.pkg.changes)
269 cache[filename]["filename"] = filename
272 # Divide the .changes into per-source groups
274 for filename in cache.keys():
275 source = cache[filename]["source"]
276 if not per_source.has_key(source):
277 per_source[source] = {}
278 per_source[source]["list"] = []
279 per_source[source]["list"].append(cache[filename])
280 # Determine oldest time and have note status for each source group
281 for source in per_source.keys():
282 source_list = per_source[source]["list"]
283 first = source_list[0]
284 oldest = os.stat(first["filename"])[stat.ST_MTIME]
286 for d in per_source[source]["list"]:
287 mtime = os.stat(d["filename"])[stat.ST_MTIME]
288 if Cnf.has_key("Queue-Report::Options::New"):
294 have_note += (d.has_key("process-new note"))
295 per_source[source]["oldest"] = oldest
297 per_source[source]["note_state"] = 0; # none
298 elif have_note < len(source_list):
299 per_source[source]["note_state"] = 1; # some
301 per_source[source]["note_state"] = 2; # all
302 per_source_items = per_source.items()
303 per_source_items.sort(sg_compare)
313 for i in per_source_items:
314 last_modified = time.time()-i[1]["oldest"]
315 source = i[1]["list"][0]["source"]
316 if len(source) > max_source_len:
317 max_source_len = len(source)
320 for j in i[1]["list"]:
321 if Cnf.has_key("Queue-Report::Options::New"):
323 (maintainer["maintainer822"], maintainer["maintainer2047"],
324 maintainer["maintainername"], maintainer["maintaineremail"]) = \
325 utils.fix_maintainer (j["maintainer"])
326 except ParseMaintError, msg:
327 print "Problems while parsing maintainer address\n"
328 maintainer["maintainername"] = "Unknown"
329 maintainer["maintaineremail"] = "Unknown"
330 maint="%s:%s" % (maintainer["maintainername"], maintainer["maintaineremail"])
331 distribution=j["distribution"].keys()
332 closes=j["closes"].keys()
333 for arch in j["architecture"].keys():
335 version = j["version"]
336 versions[version] = ""
337 arches_list = arches.keys()
338 arches_list.sort(utils.arch_compare_sw)
339 arch_list = " ".join(arches_list)
340 version_list = " ".join(versions.keys())
341 if len(version_list) > max_version_len:
342 max_version_len = len(version_list)
343 if len(arch_list) > max_arch_len:
344 max_arch_len = len(arch_list)
345 if i[1]["note_state"]:
349 entries.append([source, version_list, arch_list, note, last_modified, maint, distribution, closes])
351 # direction entry consists of "Which field, which direction, time-consider" where
352 # time-consider says how we should treat last_modified. Thats all.
354 # Look for the options for sort and then do the sort.
356 if Cnf.has_key("Queue-Report::Options::Age"):
357 age = Cnf["Queue-Report::Options::Age"]
358 if Cnf.has_key("Queue-Report::Options::New"):
359 # If we produce html we always have oldest first.
360 direction.append([4,-1,"ao"])
362 if Cnf.has_key("Queue-Report::Options::Sort"):
363 for i in Cnf["Queue-Report::Options::Sort"].split(","):
366 direction.append([4,-1,age])
369 direction.append([4,1,age])
372 direction.append([0,1,0])
375 direction.append([0,-1,0])
378 direction.append([3,1,0])
381 direction.append([3,-1,0])
382 entries.sort(lambda x, y: sortfunc(x, y))
383 # Yes, in theory you can add several sort options at the commandline with. But my mind is to small
384 # at the moment to come up with a real good sorting function that considers all the sidesteps you
385 # have with it. (If you combine options it will simply take the last one at the moment).
386 # Will be enhanced in the future.
388 if Cnf.has_key("Queue-Report::Options::New"):
389 direction.append([4,1,"ao"])
390 entries.sort(lambda x, y: sortfunc(x, y))
391 # Output for a html file. First table header. then table_footer.
392 # Any line between them is then a <tr> printed from subroutine table_row.
394 table_header(type.upper())
395 for entry in entries:
396 (source, version_list, arch_list, note, last_modified, maint, distribution, closes) = entry
397 table_row(source, version_list, arch_list, time_pp(last_modified), maint, distribution, closes)
398 total_count = len(changes_files)
399 source_count = len(per_source_items)
400 table_footer(type.upper(), source_count, total_count)
402 # The "normal" output without any formatting.
403 format="%%-%ds | %%-%ds | %%-%ds%%s | %%s old\n" % (max_source_len, max_version_len, max_arch_len)
406 for entry in entries:
407 (source, version_list, arch_list, note, last_modified, undef, undef, undef) = entry
408 msg += format % (source, version_list, arch_list, note, time_pp(last_modified))
411 total_count = len(changes_files)
412 source_count = len(per_source_items)
417 print "%s %s source package%s / %s %s package%s in total." % (source_count, type, plural(source_count), total_count, type, plural(total_count))
421 ################################################################################
426 Cnf = utils.get_conf()
427 Arguments = [('h',"help","Queue-Report::Options::Help"),
428 ('n',"new","Queue-Report::Options::New"),
429 ('s',"sort","Queue-Report::Options::Sort", "HasArg"),
430 ('a',"age","Queue-Report::Options::Age", "HasArg")]
432 if not Cnf.has_key("Queue-Report::Options::%s" % (i)):
433 Cnf["Queue-Report::Options::%s" % (i)] = ""
435 apt_pkg.ParseCommandLine(Cnf, Arguments, sys.argv)
437 Options = Cnf.SubTree("Queue-Report::Options")
441 Upload = queue.Upload(Cnf)
443 if Cnf.has_key("Queue-Report::Options::New"):
446 directories = Cnf.ValueList("Queue-Report::Directories")
448 directories = [ "byhand", "new" ]
450 for directory in directories:
451 changes_files = glob.glob("%s/*.changes" % (Cnf["Dir::Queue::%s" % (directory)]))
452 process_changes_files(changes_files, directory)
454 if Cnf.has_key("Queue-Report::Options::New"):
457 ################################################################################
459 if __name__ == '__main__':