Auto merge of #44098 - frewsxcv:rollup, r=frewsxcv

Rollup of 7 pull requests - Successful merges: #43776, #43966, #43979, #44072, #44086, #44090, #44091 - Failed merges:

Author: bors

src/etc/htmldocck.py

@@ -29,7 +29,7 @@
 
 In order to avoid one-off dependencies for this task, this script uses
 a reasonably working HTML parser and the existing XPath implementation
-from Python 2's standard library. Hopefully we won't render
+from Python's standard library. Hopefully we won't render
 non-well-formed HTML.
 
 # Commands
@@ -110,11 +110,17 @@
 import re
 import shlex
 from collections import namedtuple
-from HTMLParser import HTMLParser
+try:
+ from html.parser import HTMLParser
+except ImportError:
+ from HTMLParser import HTMLParser
 from xml.etree import cElementTree as ET
 
 # ⇤/⇥ are not in HTML 4 but are in HTML 5
-from htmlentitydefs import entitydefs
+try:
+ from html.entities import entitydefs
+except ImportError:
+ from htmlentitydefs import entitydefs
 entitydefs['larrb'] = u'\u21e4'
 entitydefs['rarrb'] = u'\u21e5'
 entitydefs['nbsp'] = ' '
@@ -123,6 +129,11 @@
 VOID_ELEMENTS = set(['area', 'base', 'br', 'col', 'embed', 'hr', 'img', 'input', 'keygen',
  'link', 'menuitem', 'meta', 'param', 'source', 'track', 'wbr'])
 
+# Python 2 -> 3 compatibility
+try:
+ unichr
+except NameError:
+ unichr = chr
 
 class CustomHTMLParser(HTMLParser):
  """simplified HTML parser.
@@ -184,12 +195,8 @@ def concat_multi_lines(f):
 
  # strip the common prefix from the current line if needed
  if lastline is not None:
- maxprefix = 0
- for i in xrange(min(len(line), len(lastline))):
- if line[i] != lastline[i]:
- break
- maxprefix += 1
- line = line[maxprefix:].lstrip()
+ common_prefix = os.path.commonprefix([line, lastline])
+ line = line[len(common_prefix):].lstrip()
 
  firstlineno = firstlineno or lineno
  if line.endswith('\\'):
@@ -213,7 +220,7 @@ def concat_multi_lines(f):
 
 
 def get_commands(template):
- with open(template, 'rUb') as f:
+ with open(template, 'rU') as f:
  for lineno, line in concat_multi_lines(f):
  m = LINE_PATTERN.search(line)
  if not m:
@@ -372,7 +379,7 @@ def check_command(c, cache):
  cache.get_file(c.args[0])
  ret = True
  except FailedCheck as err:
- cerr = err.message
+ cerr = str(err)
  ret = False
  elif len(c.args) == 2: # @has/matches <path> <pat> = string test
  cerr = "`PATTERN` did not match"
@@ -413,9 +420,9 @@ def check_command(c, cache):
 
  except FailedCheck as err:
  message = '@{}{} check failed'.format('!' if c.negated else '', c.cmd)
- print_err(c.lineno, c.context, err.message, message)
+ print_err(c.lineno, c.context, str(err), message)
  except InvalidCheck as err:
- print_err(c.lineno, c.context, err.message)
+ print_err(c.lineno, c.context, str(err))
 
 def check(target, commands):
  cache = CachedFiles(target)

src/liballoc/allocator.rs

@@ -110,7 +110,7 @@ impl Layout {
 
  /// Creates a layout, bypassing all checks.
  ///
- /// # Unsafety
+ /// # Safety
  ///
  /// This function is unsafe as it does not verify that `align` is
  /// a power-of-two that is also less than or equal to 2^31, nor
@@ -485,7 +485,7 @@ pub unsafe trait Alloc {
  /// behavior, e.g. to ensure initialization to particular sets of
  /// bit patterns.)
  ///
- /// # Unsafety
+ /// # Safety
  ///
  /// This function is unsafe because undefined behavior can result
  /// if the caller does not ensure that `layout` has non-zero size.
@@ -513,7 +513,7 @@ pub unsafe trait Alloc {
 
  /// Deallocate the memory referenced by `ptr`.
  ///
- /// # Unsafety
+ /// # Safety
  ///
  /// This function is unsafe because undefined behavior can result
  /// if the caller does not ensure all of the following:
@@ -617,7 +617,7 @@ pub unsafe trait Alloc {
  /// behavior is well-defined (though underspecified) when this
  /// constraint is violated; further discussion below.
  ///
- /// # Unsafety
+ /// # Safety
  ///
  /// This function is unsafe because undefined behavior can result
  /// if the caller does not ensure all of the following:
@@ -688,7 +688,7 @@ pub unsafe trait Alloc {
  /// Behaves like `alloc`, but also ensures that the contents
  /// are set to zero before being returned.
  ///
- /// # Unsafety
+ /// # Safety
  ///
  /// This function is unsafe for the same reasons that `alloc` is.
  ///
@@ -714,7 +714,7 @@ pub unsafe trait Alloc {
  /// the returned block. For some `layout` inputs, like arrays, this
  /// may include extra storage usable for additional data.
  ///
- /// # Unsafety
+ /// # Safety
  ///
  /// This function is unsafe for the same reasons that `alloc` is.
  ///
@@ -736,7 +736,7 @@ pub unsafe trait Alloc {
  /// the returned block. For some `layout` inputs, like arrays, this
  /// may include extra storage usable for additional data.
  ///
- /// # Unsafety
+ /// # Safety
  ///
  /// This function is unsafe for the same reasons that `realloc` is.
  ///
@@ -770,7 +770,7 @@ pub unsafe trait Alloc {
  /// memory block referenced by `ptr` has not been transferred, and
  /// the contents of the memory block are unaltered.
  ///
- /// # Unsafety
+ /// # Safety
  ///
  /// This function is unsafe because undefined behavior can result
  /// if the caller does not ensure all of the following:
@@ -827,7 +827,7 @@ pub unsafe trait Alloc {
  /// the memory block has not been transferred, and the contents of
  /// the memory block are unaltered.
  ///
- /// # Unsafety
+ /// # Safety
  ///
  /// This function is unsafe because undefined behavior can result
  /// if the caller does not ensure all of the following:
@@ -920,7 +920,7 @@ pub unsafe trait Alloc {
  ///
  /// Captures a common usage pattern for allocators.
  ///
- /// # Unsafety
+ /// # Safety
  ///
  /// This function is unsafe because undefined behavior can result
  /// if the caller does not ensure both:
@@ -993,7 +993,7 @@ pub unsafe trait Alloc {
  /// The returned block is suitable for passing to the
  /// `alloc`/`realloc` methods of this allocator.
  ///
- /// # Unsafety
+ /// # Safety
  ///
  /// This function is unsafe because undefined behavior can result
  /// if the caller does not ensure all of the following:
@@ -1037,7 +1037,7 @@ pub unsafe trait Alloc {
  ///
  /// Captures a common usage pattern for allocators.
  ///
- /// # Unsafety
+ /// # Safety
  ///
  /// This function is unsafe because undefined behavior can result
  /// if the caller does not ensure both:

src/liballoc/boxed.rs

@@ -633,7 +633,7 @@ impl<I: FusedIterator + ?Sized> FusedIterator for Box<I> {}
 /// that `FnBox` may be deprecated in the future if `Box<FnOnce()>`
 /// closures become directly usable.)
 ///
-/// ### Example
+/// # Examples
 ///
 /// Here is a snippet of code which creates a hashmap full of boxed
 /// once closures and then removes them one by one, calling each

src/liballoc/slice.rs

@@ -171,7 +171,7 @@ mod hack {
 impl<T> [T] {
  /// Returns the number of elements in the slice.
  ///
- /// # Example
+ /// # Examples
  ///
  /// ```
  /// let a = [1, 2, 3];
@@ -185,7 +185,7 @@ impl<T> [T] {
 
  /// Returns `true` if the slice has a length of 0.
  ///
- /// # Example
+ /// # Examples
  ///
  /// ```
  /// let a = [1, 2, 3];
@@ -523,7 +523,7 @@ impl<T> [T] {
 
  /// Reverses the order of elements in the slice, in place.
  ///
- /// # Example
+ /// # Examples
  ///
  /// ```
  /// let mut v = [1, 2, 3];
@@ -580,7 +580,7 @@ impl<T> [T] {
  ///
  /// Panics if `size` is 0.
  ///
- /// # Example
+ /// # Examples
  ///
  /// ```
  /// let slice = ['r', 'u', 's', 't'];
@@ -613,7 +613,7 @@ impl<T> [T] {
  ///
  /// Panics if `size` is 0.
  ///
- /// # Example
+ /// # Examples
  ///
  /// ```
  /// let slice = ['l', 'o', 'r', 'e', 'm'];
@@ -1040,7 +1040,7 @@ impl<T> [T] {
  /// `Err` is returned, containing the index where a matching
  /// element could be inserted while maintaining sorted order.
  ///
- /// # Example
+ /// # Examples
  ///
  /// Looks up a series of four elements. The first is found, with a
  /// uniquely determined position; the second and third are not
@@ -1074,7 +1074,7 @@ impl<T> [T] {
  /// `Err` is returned, containing the index where a matching
  /// element could be inserted while maintaining sorted order.
  ///
- /// # Example
+ /// # Examples
  ///
  /// Looks up a series of four elements. The first is found, with a
  /// uniquely determined position; the second and third are not
@@ -1419,7 +1419,7 @@ impl<T> [T] {
  ///
  /// This function will panic if the two slices have different lengths.
  ///
- /// # Example
+ /// # Examples
  ///
  /// ```
  /// let mut dst = [0, 0, 0];
@@ -1445,7 +1445,7 @@ impl<T> [T] {
  ///
  /// This function will panic if the two slices have different lengths.
  ///
- /// # Example
+ /// # Examples
  ///
  /// ```
  /// let mut dst = [0, 0, 0];

src/liballoc/str.rs

@@ -1714,7 +1714,7 @@ impl str {
  ///
  /// [`Err`]: str/trait.FromStr.html#associatedtype.Err
  ///
- /// # Example
+ /// # Examples
  ///
  /// Basic usage
  ///

src/liballoc/string.rs

@@ -82,7 +82,7 @@ use boxed::Box;
 ///
 /// # Examples
 ///
-/// You can create a `String` from a literal string with `String::from`:
+/// You can create a `String` from a literal string with [`String::from`]:
 ///
 /// ```
 /// let hello = String::from("Hello, world!");
@@ -98,6 +98,7 @@ use boxed::Box;
 /// hello.push_str("orld!");
 /// ```
 ///
+/// [`String::from`]: #method.from
 /// [`char`]: ../../std/primitive.char.html
 /// [`push`]: #method.push
 /// [`push_str`]: #method.push_str

src/libcore/cell.rs

@@ -998,7 +998,7 @@ impl<'b, T: ?Sized> Ref<'b, T> {
  /// A method would interfere with methods of the same name on the contents
  /// of a `RefCell` used through `Deref`.
  ///
- /// # Example
+ /// # Examples
  ///
  /// ```
  /// use std::cell::{RefCell, Ref};
@@ -1040,7 +1040,7 @@ impl<'b, T: ?Sized> RefMut<'b, T> {
  /// `RefMut::map(...)`. A method would interfere with methods of the same
  /// name on the contents of a `RefCell` used through `Deref`.
  ///
- /// # Example
+ /// # Examples
  ///
  /// ```
  /// use std::cell::{RefCell, RefMut};

src/libcore/fmt/builders.rs

@@ -58,7 +58,7 @@ impl<'a, 'b: 'a> fmt::Write for PadAdapter<'a, 'b> {
 /// [`Formatter::debug_struct`](struct.Formatter.html#method.debug_struct)
 /// method.
 ///
-/// # Example
+/// # Examples
 ///
 /// ```
 /// use std::fmt;
@@ -153,7 +153,7 @@ impl<'a, 'b: 'a> DebugStruct<'a, 'b> {
 /// [`Formatter::debug_tuple`](struct.Formatter.html#method.debug_tuple)
 /// method.
 ///
-/// # Example
+/// # Examples
 ///
 /// ```
 /// use std::fmt;
@@ -290,7 +290,7 @@ impl<'a, 'b: 'a> DebugInner<'a, 'b> {
 /// [`Formatter::debug_set`](struct.Formatter.html#method.debug_set)
 /// method.
 ///
-/// # Example
+/// # Examples
 ///
 /// ```
 /// use std::fmt;
@@ -361,7 +361,7 @@ impl<'a, 'b: 'a> DebugSet<'a, 'b> {
 /// [`Formatter::debug_list`](struct.Formatter.html#method.debug_list)
 /// method.
 ///
-/// # Example
+/// # Examples
 ///
 /// ```
 /// use std::fmt;
@@ -432,7 +432,7 @@ impl<'a, 'b: 'a> DebugList<'a, 'b> {
 /// [`Formatter::debug_map`](struct.Formatter.html#method.debug_map)
 /// method.
 ///
-/// # Example
+/// # Examples
 ///
 /// ```
 /// use std::fmt;

src/libcore/mem.rs

@@ -901,7 +901,7 @@ impl<T> ManuallyDrop<T> {
 
  /// Manually drops the contained value.
  ///
- /// # Unsafety
+ /// # Safety
  ///
  /// This function runs the destructor of the contained value and thus the wrapped value
  /// now represents uninitialized data. It is up to the user of this method to ensure the

src/librustc_back/target/haiku_base.rs

@@ -20,7 +20,6 @@ pub fn opts() -> TargetOptions {
  target_family: Some("unix".to_string()),
  relro_level: RelroLevel::Full,
  linker_is_gnu: true,
- no_integrated_as: true,
  .. Default::default()
  }
 }