https://github.com/rust-lang/rust http://git.dreamy.place/mirrors/rust/atom?h=1.10.0 2015-09-17T15:40:33+00:00 2015-09-17T15:40:33+00:00 Alex Crichton alex@alexcrichton.com 2015-08-26T23:57:56+00:00 urn:sha1:0675dffac48101faa2bdb634682b2ddf3975bf31 2015-03-15T16:08:21+00:00 Tamir Duberstein tamird@gmail.com 2015-03-14T23:29:28+00:00 urn:sha1:d51047ded072b412ec18a6f78c1fb80835a477f5 2015-02-05T22:37:16+00:00 Brian Anderson banderson@mozilla.com 2015-01-24T23:18:19+00:00 urn:sha1:290b79c15dbbefcba6309880794fb3d677f7a202 This restructures tidy.py to walk the tree itself, and improves performance considerably by not loading entire files into buffers for licenseck. Splits build rules into 'tidy', 'tidy-basic', 'tidy-binaries', 'tidy-errors', 'tidy-features'. 2014-04-11T19:20:33+00:00 Alex Crichton alex@alexcrichton.com 2014-04-11T19:20:33+00:00 urn:sha1:e6072fa0c4c22d62acf3dcb78c8ee260a1368bd7 Previously, upstream C libraries were linked in a nondeterministic fashion because they were collected through iter_crate_data() which is a nodeterministic traversal of a hash map. When upstream rlibs had interdependencies among their native libraries (such as libfoo depending on libc), then the ordering would occasionally be wrong, causing linkage to fail. This uses the topologically sorted list of libraries to collect native libraries, so if a native library depends on libc it just needs to make sure that the rust crate depends on liblibc.