Skip to content

Commit 99200f7

Browse files
Fix even more URLs
1 parent 16ed850 commit 99200f7

File tree

16 files changed

+25
-25
lines changed

16 files changed

+25
-25
lines changed

compiler/rustc_codegen_cranelift/src/discriminant.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
//! Handling of enum discriminants
22
//!
3-
//! Adapted from https://github.com/rust-lang/rust/blob/d760df5aea483aae041c9a241e7acacf48f75035/src/librustc_codegen_ssa/mir/place.rs
3+
//! Adapted from <https://github.com/rust-lang/rust/blob/d760df5aea483aae041c9a241e7acacf48f75035/src/librustc_codegen_ssa/mir/place.rs>
44
55
use rustc_target::abi::{Int, TagEncoding, Variants};
66

compiler/rustc_middle/src/mir/coverage.rs

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -17,9 +17,9 @@ rustc_index::newtype_index! {
1717
impl ExpressionOperandId {
1818
/// An expression operand for a "zero counter", as described in the following references:
1919
///
20-
/// * https://github.com/rust-lang/llvm-project/blob/llvmorg-8.0.0/llvm/docs/CoverageMappingFormat.rst#counter
21-
/// * https://github.com/rust-lang/llvm-project/blob/llvmorg-8.0.0/llvm/docs/CoverageMappingFormat.rst#tag
22-
/// * https://github.com/rust-lang/llvm-project/blob/llvmorg-8.0.0/llvm/docs/CoverageMappingFormat.rst#counter-expressions
20+
/// * <https://github.com/rust-lang/llvm-project/blob/llvmorg-8.0.0/llvm/docs/CoverageMappingFormat.rst#counter>
21+
/// * <https://github.com/rust-lang/llvm-project/blob/llvmorg-8.0.0/llvm/docs/CoverageMappingFormat.rst#tag>
22+
/// * <https://github.com/rust-lang/llvm-project/blob/llvmorg-8.0.0/llvm/docs/CoverageMappingFormat.rst#counter-expressions>
2323
///
2424
/// This operand can be used to count two or more separate code regions with a single counter,
2525
/// if they run sequentially with no branches, by injecting the `Counter` in a `BasicBlock` for

compiler/rustc_middle/src/mir/mono.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -228,7 +228,7 @@ pub struct CodegenUnit<'tcx> {
228228

229229
/// Specifies the linkage type for a `MonoItem`.
230230
///
231-
/// See https://llvm.org/docs/LangRef.html#linkage-types for more details about these variants.
231+
/// See <https://llvm.org/docs/LangRef.html#linkage-types> for more details about these variants.
232232
#[derive(Copy, Clone, PartialEq, Debug, TyEncodable, TyDecodable, HashStable)]
233233
pub enum Linkage {
234234
External,

compiler/rustc_middle/src/ty/context.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -368,7 +368,7 @@ pub struct TypeckResults<'tcx> {
368368
/// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
369369
///
370370
/// See:
371-
/// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
371+
/// <https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions>
372372
pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
373373

374374
/// Borrows

compiler/rustc_mir/src/borrow_check/region_infer/mod.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1364,7 +1364,7 @@ impl<'tcx> RegionInferenceContext<'tcx> {
13641364
/// terms that the "longer free region" `'a` outlived the "shorter free region" `'b`.
13651365
///
13661366
/// More details can be found in this blog post by Niko:
1367-
/// http://smallcultfollowing.com/babysteps/blog/2019/01/17/polonius-and-region-errors/
1367+
/// <http://smallcultfollowing.com/babysteps/blog/2019/01/17/polonius-and-region-errors/>
13681368
///
13691369
/// In the canonical example
13701370
///

compiler/rustc_mir/src/transform/dest_prop.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88
//! inside a single block to shuffle a value around unnecessarily.
99
//!
1010
//! LLVM by itself is not good enough at eliminating these redundant copies (eg. see
11-
//! https://github.com/rust-lang/rust/issues/32966), so this leaves some performance on the table
11+
//! <https://github.com/rust-lang/rust/issues/32966>), so this leaves some performance on the table
1212
//! that we can regain by implementing an optimization for removing these assign statements in rustc
1313
//! itself. When this optimization runs fast enough, it can also speed up the constant evaluation
1414
//! and code generation phases of rustc due to the reduced number of statements and locals.

compiler/rustc_mir_build/src/thir/pattern/_match.rs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88
//! (b) each pattern is necessary (usefulness)
99
//!
1010
//! The algorithm implemented here is a modified version of the one described in:
11-
//! http://moscova.inria.fr/~maranget/papers/warn/index.html
11+
//! <http://moscova.inria.fr/~maranget/papers/warn/index.html>
1212
//! However, to save future implementors from reading the original paper, we
1313
//! summarise the algorithm here to hopefully save time and be a little clearer
1414
//! (without being so rigorous).
@@ -2040,7 +2040,7 @@ impl<'tcx> MissingConstructors<'tcx> {
20402040
}
20412041
}
20422042

2043-
/// Algorithm from http://moscova.inria.fr/~maranget/papers/warn/index.html.
2043+
/// Algorithm from <http://moscova.inria.fr/~maranget/papers/warn/index.html>.
20442044
/// The algorithm from the paper has been modified to correctly handle empty
20452045
/// types. The changes are:
20462046
/// (0) We don't exit early if the pattern matrix has zero rows. We just

compiler/rustc_parse/src/lexer/mod.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -511,7 +511,7 @@ impl<'a> StringReader<'a> {
511511
}
512512

513513
/// Note: It was decided to not add a test case, because it would be to big.
514-
/// https://github.com/rust-lang/rust/pull/50296#issuecomment-392135180
514+
/// <https://github.com/rust-lang/rust/pull/50296#issuecomment-392135180>
515515
fn report_too_many_hashes(&self, start: BytePos, found: usize) -> ! {
516516
self.fatal_span_(
517517
start,

compiler/rustc_privacy/src/lib.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -38,7 +38,7 @@ use std::{cmp, fmt, mem};
3838
/// Implemented to visit all `DefId`s in a type.
3939
/// Visiting `DefId`s is useful because visibilities and reachabilities are attached to them.
4040
/// The idea is to visit "all components of a type", as documented in
41-
/// https://github.com/rust-lang/rfcs/blob/master/text/2145-type-privacy.md#how-to-determine-visibility-of-a-type.
41+
/// <https://github.com/rust-lang/rfcs/blob/master/text/2145-type-privacy.md#how-to-determine-visibility-of-a-type>.
4242
/// The default type visitor (`TypeVisitor`) does most of the job, but it has some shortcomings.
4343
/// First, it doesn't have overridable `fn visit_trait_ref`, so we have to catch trait `DefId`s
4444
/// manually. Second, it doesn't visit some type components like signatures of fn types, or traits

compiler/rustc_trait_selection/src/traits/object_safety.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -621,7 +621,7 @@ fn object_ty_for_trait<'tcx>(
621621
///
622622
/// In practice, we cannot use `dyn Trait` explicitly in the obligation because it would result
623623
/// in a new check that `Trait` is object safe, creating a cycle (until object_safe_for_dispatch
624-
/// is stabilized, see tracking issue https://github.com/rust-lang/rust/issues/43561).
624+
/// is stabilized, see tracking issue <https://github.com/rust-lang/rust/issues/43561>).
625625
/// Instead, we fudge a little by introducing a new type parameter `U` such that
626626
/// `Self: Unsize<U>` and `U: Trait + ?Sized`, and use `U` in place of `dyn Trait`.
627627
/// Written as a chalk-style query:

0 commit comments

Comments
 (0)