Commit graph

3329 commits

Author SHA1 Message Date
Tim Chevalier
ccc7651b48 In reachability, don't ignore nested items
Reachability was considering nested items to be unreachable, which
was causing the bug in #2383. Once I fixed that, I also had to make
impl::make_impl_vtable instantiate methods where necessary, before
calling monomorphic_fn.

Closes #2383
2012-05-29 14:40:35 -07:00
Michael Sullivan
5d1c29912d Fix an error message to not refer to "block type". Closes #2423. 2012-05-29 12:18:59 -07:00
Eric Holk
5e35d49a50 Moving the arc tests into arc.rs. 2012-05-29 11:30:10 -07:00
Eric Holk
aa2efc05ea Adding shared_arc to hide some of the tedium of sharing an arc between tasks.
Also added some asserts and logging to trans.

Modified graph500 to use the shared_arc, but this unfortunately doesn't work due to #2444.
2012-05-29 10:43:19 -07:00
Graydon Hoare
163b0604dc Re-xfail reflect-visit-type since it crashes check-fast. 2012-05-28 17:03:44 -07:00
Graydon Hoare
e0f0c5c1ab Remove bad Load in make_visit_glue, un-xfail reflect-visit-type.rs. 2012-05-28 13:19:31 -07:00
Brian Anderson
18f4bfd576 bench: Remove task-perf-vector-party. No longer relevant 2012-05-26 16:00:38 -07:00
Brian Anderson
45d0fbf6a1 bench: Increase the difficulty of some benchmarks 2012-05-26 16:00:35 -07:00
Brian Anderson
432c6cbde9 core: Make range follow the for loop protocol 2012-05-26 02:28:00 -07:00
Eric Holk
df83a793d9 In generic word count, use str instead of [u8], and use built in is_alphabetic, etc. functions. 2012-05-25 18:32:18 -07:00
Eric Holk
0c3a128419 Update word-count-generic to latest syntax and un-xfail it. Closes #1740. 2012-05-25 18:32:18 -07:00
Niko Matsakis
98740a59da detect ambig. calls to iface bounds, use transactions
cc #2433
2012-05-25 17:04:05 -07:00
Michael Sullivan
8668d06400 Get rid of many implicit copies as a preliminary to Issue #2448. 2012-05-25 16:39:35 -07:00
Niko Matsakis
266fdd032b test for issue #2443 2012-05-25 14:37:35 -07:00
Niko Matsakis
9e6a068034 replace last_use with liveness info 2012-05-25 14:37:30 -07:00
Niko Matsakis
62fe587f81 revisit error message; create spill map 2012-05-25 14:37:30 -07:00
Eric Holk
8b6bfc96cb Const kind checking. The rules are almost certainly incomplete and unsound... 2012-05-24 15:06:56 -07:00
Eric Holk
d993df74c3 Teach parser and related things to understand const kind bounds. 2012-05-24 15:06:56 -07:00
Niko Matsakis
ccd8d5573e remove dead assignments 2012-05-24 13:35:57 -07:00
Niko Matsakis
f5c51b0a9c remove initedness checking from typestate, as best I could 2012-05-24 09:52:16 -07:00
Niko Matsakis
0d3811e275 improve liveness so it reports unused vars / dead assignments
doesn't warn about pattern bindings yet though
2012-05-24 09:52:16 -07:00
Niko Matsakis
30b47649ea new liveness pass to supercede last_use / initedness 2012-05-24 09:52:03 -07:00
Niko Matsakis
a3be0b1054 fix classes and parameterized ifaces; remove needless self check
ref #1726, #2434
2012-05-24 06:49:40 -07:00
Niko Matsakis
bd573becf5 change region scope of call arguments, old one was unsound
improve error message to describe kind of deref'd ptr using sigil
2012-05-24 05:19:44 -07:00
Brian Anderson
4fec4cd8f5 bench: Add hard mode to benchmarks. Activate with RUST_BENCH.
RUST_BENCH is on automatically when running `make perf`
2012-05-23 22:55:41 -07:00
Brian Anderson
2f3cff2806 bench: Remove 99bob benchmarks 2012-05-23 20:29:46 -07:00
Eric Holk
5f154770e2 Prevent capturing non-copyable things in closures. 2012-05-23 15:46:43 -07:00
Eric Holk
6fa1a084f7 A shareable atomically reference counted pointer wrapper.
Needs more tests to ensure safety, and probably some more work on usability too.
2012-05-23 14:58:16 -07:00
Niko Matsakis
9773a22119 shuffle error messages in borrowck, and prevent it from spewing too many
also, fix a few minor issues it complains about
2012-05-23 12:01:27 -07:00
Brian Anderson
248f8826a9 bench: Reduce constants in std-smallintmap to make it valgrind fast 2012-05-23 11:24:02 -07:00
Eric Holk
8678baab12 Resources are once again not copyable. 2012-05-23 10:27:42 -07:00
Niko Matsakis
b93839408c new test 2012-05-23 06:30:29 -07:00
Niko Matsakis
e0f59e835e modify borrowck to allow arbitrary borrows in pure scopes 2012-05-23 06:30:29 -07:00
Brian Anderson
27427a950a Merge pull request #2430 from mmeyerho/master
Added support for #! comments.  Closes issue 1772.
2012-05-22 20:39:53 -07:00
Tim Chevalier
ed357af980 Convert more resource tests to use classes with dtors
And monomorphize dtors correctly.
2012-05-22 22:12:18 -04:00
Margaret Meyerhofer
4f10c19215 Merge branch 'master' of git://github.com/mozilla/rust 2012-05-22 18:23:32 -07:00
Brian Anderson
8caf1403be bench: Reduce some constants to make graph500-bfs faster 2012-05-22 18:20:23 -07:00
Margaret Meyerhofer
6077647878 Added a test for #! comments 2012-05-22 18:03:26 -07:00
Brian Anderson
a32392d032 Merge pull request #2427 from msullivan/shifts
Get rid of the >>> operator and make >> logical or arithmetic depending ...
2012-05-22 17:50:04 -07:00
Michael Sullivan
2a9bf0959b Add a test for Issue #2428. 2012-05-22 16:35:10 -07:00
Eric Holk
037a166ea7 Updating pbfs for new kind rules. 2012-05-22 15:51:11 -07:00
Eric Holk
b62d92c993 Removed accidental machine size dependencies. 2012-05-22 15:31:39 -07:00
Eric Holk
44bea03614 Updating bfs to work with the new random methods. 2012-05-22 15:31:39 -07:00
Eric Holk
5a4e2ae706 More unsafe pointers to share immutable structures between tasks. This version has a 2.8 to 3x speedup! 2012-05-22 15:31:39 -07:00
Eric Holk
7f05f088c7 Be less careful about checking that lengths make sense, for slightly more performance. 2012-05-22 15:31:39 -07:00
Eric Holk
77f6099606 Using unsafe pointers to views to try to reduce some vector copy and allocation time. Doesn't seem to have made much difference. 2012-05-22 15:31:39 -07:00
Eric Holk
ea889742d7 Using unsafe pointers to share closures.
This prevents the tons of copying problems we were having before, which means we only have a 5x slowdown now.
2012-05-22 15:31:39 -07:00
Eric Holk
65abe2c6dc Using libstd future instead.
Turning off sequential versions for tracing.
2012-05-22 15:31:38 -07:00
Eric Holk
cba2761cc4 A new version of the sequential BFS. This uses the same approach as the parallel one, but without using the parallel vector oeprators. 2012-05-22 15:31:38 -07:00
Eric Holk
4312fa44b9 BFS now tries a number of search keys. 2012-05-22 15:31:38 -07:00