The problems associated with bootstrapping an OS on a new architecture have
been around for a long time. The issues with doing so are numerous -- how
to build, what order should the packages in the OS be built in, how to
identify build dependencies, etc. Determining a build map, or build tree,
would go a long way in decreasing the time to entirely rebuild or bootstrap
As a starting point, a brute force build method of repeatedly traversing
the F7 SRPM list alphabetically was done. This resulted in
packages built over a week -- far short of the complete list of SRPMS.
The frequency of successful builds slowed down dramatically after this
of SRPMS were built. The perl-* SRPMS are particularily nasty ...
thetango attempts to resolve the build problem by taking a set of SRPMS and
building build trees by evaluating the dependencies between the potential
resulting binary RPMs, and determining the build tree for individual SRPMS.
Version 2.0.0-0 is similar to version 1.0.0-0 except the code is now in
Anon git repo: