https://github.com/rust-lang/rust http://git.dreamy.place/mirrors/rust/atom?h=master 2023-01-11T09:32:08+00:00 2023-01-11T09:32:08+00:00 Albert Larsan 74931857+albertlarsan68@users.noreply.github.com 2023-01-05T08:13:28+00:00 urn:sha1:cf2dff2b1e3fa55fa5415d524200070d0d7aacfe 2022-06-03T21:16:41+00:00 Jack Huey 31162821+jackh726@users.noreply.github.com 2022-04-01T17:13:25+00:00 urn:sha1:410dcc96741716bf1b4dc9b3bf33f408f220384d 2018-12-26T04:08:33+00:00 Mark Rousskov mark.simulacrum@gmail.com 2018-12-25T15:56:47+00:00 urn:sha1:2a663555ddf36f6b041445894a8c175cd1bc718c 2018-09-01T10:58:18+00:00 Basile Desloges basile.desloges@gmail.com 2018-08-31T17:27:11+00:00 urn:sha1:b01550a7185574a7b97699aaf39e1a9cb6e60f72 2018-07-25T13:36:03+00:00 Niko Matsakis niko@alum.mit.edu 2018-07-25T13:36:03+00:00 urn:sha1:0d918a8575cfc7d7ec97b86e87c11e023ac3a37c 2018-07-13T05:29:10+00:00 Niko Matsakis niko@alum.mit.edu 2018-07-02T15:29:39+00:00 urn:sha1:ed366980310c6bd77a5a879dc3726ad55d48c5fa The strategy is this: - we compute SCCs once all outlives constraints are known - we allocate a set of values **per region** for storing liveness - we allocate a set of values **per SCC** for storing the final values - when we add a liveness constraint to the region R, we also add it to the final value of the SCC to which R belongs - then we can apply the constraints by just walking the DAG for the SCCs and union'ing the children (which have their liveness constraints within) There are a few intermediate refactorings that I really ought to have broken out into their own commits: - reverse the constraint graph so that `R1: R2` means `R1 -> R2` and not `R2 -> R1`. This fits better with the SCC computation and new style of inference (`->` now means "take value from" and not "push value into") - this does affect some of the UI tests, since they traverse the graph, but mostly the artificial ones and they don't necessarily seem worse - put some things (constraint set, etc) into `Rc`. This lets us root them to permit mutation and iteration. It also guarantees they don't change, which is critical to the correctness of the algorithm. - Generalize various helpers that previously operated only on points to work on any sort of region element. 2018-07-04T09:09:33+00:00 Niko Matsakis niko@alum.mit.edu 2018-07-03T15:38:09+00:00 urn:sha1:727f01700b074181bddf49caa07ac5e34455680d 2018-04-15T11:13:42+00:00 Niko Matsakis niko@alum.mit.edu 2018-04-09T09:28:00+00:00 urn:sha1:45d281d7fad8aad28b3193835b93b779634ffb80 2017-12-20T19:38:12+00:00 Niko Matsakis niko@alum.mit.edu 2017-12-12T14:06:35+00:00 urn:sha1:6b39781df6ad149c4fb5cb7d714daf1b7168081f 2017-12-15T15:27:54+00:00 Niko Matsakis niko@alum.mit.edu 2017-12-06T10:50:49+00:00 urn:sha1:0d6bd42abb0b6082d23e7fe84b0121dfa0476b78