https://github.com/rust-lang/rust http://git.dreamy.place/mirrors/rust/atom?h=master 2013-12-25T03:59:52+00:00 2013-12-25T03:59:52+00:00 Alex Crichton alex@alexcrichton.com 2013-12-13T02:01:59+00:00 urn:sha1:51abdee5f1ad932671350fdd8a7911fe144d08b8 This extracts everything related to green scheduling from libstd and introduces a new libgreen crate. This mostly involves deleting most of std::rt and moving it to libgreen. Along with the movement of code, this commit rearchitects many functions in the scheduler in order to adapt to the fact that Local::take now *only* works on a Task, not a scheduler. This mostly just involved threading the current green task through in a few locations, but there were one or two spots where things got hairy. There are a few repercussions of this commit: * tube/rc have been removed (the runtime implementation of rc) * There is no longer a "single threaded" spawning mode for tasks. This is now encompassed by 1:1 scheduling + communication. Convenience methods have been introduced that are specific to libgreen to assist in the spawning of pools of schedulers. 2013-12-19T14:26:03+00:00 Huon Wilson dbau.pp+github@gmail.com 2013-12-19T14:12:56+00:00 urn:sha1:c00104f36a1dd6aad318d410ffa41b9ec531880a 2013-12-17T06:55:49+00:00 Alex Crichton alex@alexcrichton.com 2013-12-16T02:17:43+00:00 urn:sha1:39a6c9d6376f96cc8b905f00b88d20e42961206c 2013-12-17T01:47:11+00:00 Alex Crichton alex@alexcrichton.com 2013-12-06T02:19:06+00:00 urn:sha1:529e268ab900f1b6e731af64ce2aeecda3555f4e 2013-12-10T23:13:12+00:00 Patrick Walton pcwalton@mimiga.net 2013-12-04T03:18:58+00:00 urn:sha1:7cac9fe76349120ea2373f3ce47a561271b5e8b6 2013-12-10T23:13:12+00:00 Patrick Walton pcwalton@mimiga.net 2013-12-04T00:44:16+00:00 urn:sha1:786dea207d5b891d37e596e96dd2f84c4cb59f49 34 uses of `Cell` remain. 2013-11-29T20:19:16+00:00 Alex Crichton alex@alexcrichton.com 2013-11-26T17:40:24+00:00 urn:sha1:a70f9d7324a91058d31c1301c4351932880d57e8 This adds an implementation of the Chase-Lev work-stealing deque to libstd under std::rt::deque. I've been unable to break the implementation of the deque itself, and it's not super highly optimized just yet (everything uses a SeqCst memory ordering). The major snag in implementing the chase-lev deque is that the buffers used to store data internally cannot get deallocated back to the OS. In the meantime, a shared buffer pool (synchronized by a normal mutex) is used to deallocate/allocate buffers from. This is done in hope of not overcommitting too much memory. It is in theory possible to eventually free the buffers, but one must be very careful in doing so. I was unable to get some good numbers from src/test/bench tests (I don't think many of them are slamming the work queue that much), but I was able to get some good numbers from one of my own tests. In a recent rewrite of select::select(), I found that my implementation was incredibly slow due to contention on the shared work queue. Upon switching to the parallel deque, I saw the contention drop to 0 and the runtime go from 1.6s to 0.9s with the most amount of time spent in libuv awakening the schedulers (plus allocations). Closes #4877 2013-11-27T17:53:48+00:00 Alex Crichton alex@alexcrichton.com 2013-11-26T02:08:31+00:00 urn:sha1:5d6dbf3f262fabcb6cb920dd08be6f9d8df75d5c * Added doc comments explaining what all public functionality does. * Added the ability to spawn a detached thread * Added the ability for the procs to return a value in 'join' 2013-11-26T16:25:27+00:00 Patrick Walton pcwalton@mimiga.net 2013-11-22T07:36:52+00:00 urn:sha1:749ee53c6d23ae1467568d6e0280a4f59e4e952b 2013-11-26T16:25:27+00:00 Patrick Walton pcwalton@mimiga.net 2013-11-22T01:23:21+00:00 urn:sha1:f571e46ddb696d15a8cc912309714ca74f23dcc4 compile-fail tests, run-fail tests, and run-pass tests.