Report created on Tue Nov 24 08:00:41 2009. back to main menu

For explanatory information and summary details, see the notes below.

Problem Reports state responsible arrival date last modified
56928: jce-aba port should install to $JAVA_HOME/jre/lib/ext suspended freebsd-java 2003-09-16 2008-03-01
87397: incorrect use of PAPERSIZE make variable in some ports open edwin 2005-10-13 2005-10-21
127018: Linuxulator incapable of using FreeBSD's LDAP environment feedback freebsd-emulatio 2008-09-01 2008-10-21
136229: [linux] certain linux apps look for libraries using a hardcoded path open freebsd-emulatio 2009-07-01 2009-07-13
138229: print/acroread[89]: error while loading shared libraries: libgio-2.0.so.0: cannot open shared object file: No such file or dire open hrs 2009-08-27 2009-09-07
138706: /lib/libz.so version bump prevents java/jdk* from upgrading open freebsd-java 2009-09-10 2009-09-11
total: 6

Notes:

Clicking on each column heading will cause the report to be redone sorted by that column. Clicking again will reverse the sort. The subheadings with date stamps include links to the index of errorlogs for that build environment.

The PRs (if any) for the given port are listed numerically in the Problem Reports column. Thus, for each port, they should also be in order from earliest to latest.

The underlying technology of this report relies on trying to extract information from the existing GNATS database entries. These entries are entered by human users using the send-pr command. As such, the quality of the entries varies greatly.

The fastest, and easiest, information is gleaned from a GNATS entry whose subject line contains the port category and port name, separated by a slash. However, if this algorithm only flagged those, it would miss nearly 50% of the ports PRs, not to mention all the 'framework' PRs.

So, as an extension, various heuristics are used to guess what it is the user really intended. See the code in gnatsQueryUtils.py for the gory details. What's important to understand is this: there is no possible algorithm that will correctly identify all the ambiguous PRs without getting a few false identifications and still run in less than geological time. So, before you are tempted to file a PR on this algorithm itself, read the code to understand its design tradeoffs, and then consider instead filing followup PRs to the ambiguous PRs that would disambiguate them instead. Thanks -- the author.