<feed xmlns='http://www.w3.org/2005/Atom'>
<title>rust/compiler/rustc_query_system/src/dep_graph/query.rs, branch 1.58.0</title>
<subtitle>https://github.com/rust-lang/rust
</subtitle>
<id>http://git.dreamy.place/mirrors/rust/atom?h=1.58.0</id>
<link rel='self' href='http://git.dreamy.place/mirrors/rust/atom?h=1.58.0'/>
<link rel='alternate' type='text/html' href='http://git.dreamy.place/mirrors/rust/'/>
<updated>2021-03-30T16:10:08+00:00</updated>
<entry>
<title>Address review.</title>
<updated>2021-03-30T16:10:08+00:00</updated>
<author>
<name>Camille GILLOT</name>
<email>gillot.camille@gmail.com</email>
</author>
<published>2021-03-18T18:26:08+00:00</published>
<link rel='alternate' type='text/html' href='http://git.dreamy.place/mirrors/rust/commit/?id=fe89f3236c08abd8fd2c81cdd2f41ff2066f13ac'/>
<id>urn:sha1:fe89f3236c08abd8fd2c81cdd2f41ff2066f13ac</id>
<content type='text'>
</content>
</entry>
<entry>
<title>Fix tests.</title>
<updated>2021-03-30T16:10:06+00:00</updated>
<author>
<name>Camille GILLOT</name>
<email>gillot.camille@gmail.com</email>
</author>
<published>2021-03-06T12:55:20+00:00</published>
<link rel='alternate' type='text/html' href='http://git.dreamy.place/mirrors/rust/commit/?id=cfe786e5e00316fb70b48fc6e324b72acf069df4'/>
<id>urn:sha1:cfe786e5e00316fb70b48fc6e324b72acf069df4</id>
<content type='text'>
Avoid invoking queries inside `check_paths`, since we are holding a lock
to the reconstructed graph.
</content>
</entry>
<entry>
<title>Stream the dep-graph to a file.</title>
<updated>2021-03-30T16:09:59+00:00</updated>
<author>
<name>Camille GILLOT</name>
<email>gillot.camille@gmail.com</email>
</author>
<published>2021-03-02T21:38:49+00:00</published>
<link rel='alternate' type='text/html' href='http://git.dreamy.place/mirrors/rust/commit/?id=6bfaf3a9cb7b601e3c4ed2e661ed213b8bc4d639'/>
<id>urn:sha1:6bfaf3a9cb7b601e3c4ed2e661ed213b8bc4d639</id>
<content type='text'>
</content>
</entry>
<entry>
<title>Remove (lots of) dead code</title>
<updated>2021-03-28T02:16:33+00:00</updated>
<author>
<name>Joshua Nelson</name>
<email>jyn514@gmail.com</email>
</author>
<published>2021-03-16T05:50:34+00:00</published>
<link rel='alternate' type='text/html' href='http://git.dreamy.place/mirrors/rust/commit/?id=441dc3640a408e612064464b0c6308bdca6c16ce'/>
<id>urn:sha1:441dc3640a408e612064464b0c6308bdca6c16ce</id>
<content type='text'>
Found with https://github.com/est31/warnalyzer.

Dubious changes:
- Is anyone else using rustc_apfloat? I feel weird completely deleting
  x87 support.
- Maybe some of the dead code in rustc_data_structures, in case someone
  wants to use it in the future?
- Don't change rustc_serialize

  I plan to scrap most of the json module in the near future (see
  https://github.com/rust-lang/compiler-team/issues/418) and fixing the
  tests needed more work than I expected.

TODO: check if any of the comments on the deleted code should be kept.
</content>
</entry>
<entry>
<title>rustc_query_system: use more space-efficient edges representation</title>
<updated>2020-12-22T22:12:57+00:00</updated>
<author>
<name>Tyson Nottingham</name>
<email>tgnottingham@gmail.com</email>
</author>
<published>2020-12-01T05:07:08+00:00</published>
<link rel='alternate' type='text/html' href='http://git.dreamy.place/mirrors/rust/commit/?id=dd1ab840d279c96adf5d7778670f14a6398b595a'/>
<id>urn:sha1:dd1ab840d279c96adf5d7778670f14a6398b595a</id>
<content type='text'>
Use single vector of edges rather than per-node vector. There is a small
hit to instruction counts (&lt; 0.5%), but the memory savings make up for it.
</content>
</entry>
<entry>
<title>rustc_query_system: share previous graph data with current graph</title>
<updated>2020-12-22T22:12:57+00:00</updated>
<author>
<name>Tyson Nottingham</name>
<email>tgnottingham@gmail.com</email>
</author>
<published>2020-11-26T09:10:43+00:00</published>
<link rel='alternate' type='text/html' href='http://git.dreamy.place/mirrors/rust/commit/?id=f6d6b0c96d86541e8fb69d133ff6222a038e5a53'/>
<id>urn:sha1:f6d6b0c96d86541e8fb69d133ff6222a038e5a53</id>
<content type='text'>
Reduce memory consumption by taking advantage of red/green algorithm
properties to share the previous dependency graph's node data with the
current graph instead of storing node data redundantly. Red nodes can
share the `DepNode`, and green nodes can share the `DepNode` and
`Fingerprint`. Edges will be shared when possible in a later change.
</content>
</entry>
<entry>
<title>Remove unused code from rustc_query_system</title>
<updated>2020-10-14T02:14:32+00:00</updated>
<author>
<name>est31</name>
<email>MTest31@outlook.com</email>
</author>
<published>2020-10-09T09:22:54+00:00</published>
<link rel='alternate' type='text/html' href='http://git.dreamy.place/mirrors/rust/commit/?id=338fad21621638ed93e4f6cb05c55105b617af71'/>
<id>urn:sha1:338fad21621638ed93e4f6cb05c55105b617af71</id>
<content type='text'>
</content>
</entry>
<entry>
<title>mv compiler to compiler/</title>
<updated>2020-08-30T15:45:07+00:00</updated>
<author>
<name>mark</name>
<email>markm@cs.wisc.edu</email>
</author>
<published>2020-08-28T03:58:48+00:00</published>
<link rel='alternate' type='text/html' href='http://git.dreamy.place/mirrors/rust/commit/?id=9e5f7d5631b8f4009ac1c693e585d4b7108d4275'/>
<id>urn:sha1:9e5f7d5631b8f4009ac1c693e585d4b7108d4275</id>
<content type='text'>
</content>
</entry>
</feed>
