Auto merge of #28689 - Manishearth:rollup, r=Manishearth

- Successful merges: #28664, #28673, #28681, #28682, #28688
- Failed merges:
This commit is contained in:
bors 2015-09-27 11:01:11 +00:00
commit 638b2608a7
47 changed files with 195 additions and 122 deletions

View File

@ -49,16 +49,7 @@ impl<E> Clone for EnumSet<E> {
#[stable(feature = "rust1", since = "1.0.0")] #[stable(feature = "rust1", since = "1.0.0")]
impl<E:CLike + fmt::Debug> fmt::Debug for EnumSet<E> { impl<E:CLike + fmt::Debug> fmt::Debug for EnumSet<E> {
fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result { fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
try!(write!(fmt, "{{")); fmt.debug_set().entries(self).finish()
let mut first = true;
for e in self {
if !first {
try!(write!(fmt, ", "));
}
try!(write!(fmt, "{:?}", e));
first = false;
}
write!(fmt, "}}")
} }
} }

View File

@ -506,8 +506,6 @@ impl str {
/// ///
/// # Examples /// # Examples
/// ``` /// ```
/// #![feature(str_split_at)]
///
/// let s = "Löwe 老虎 Léopard"; /// let s = "Löwe 老虎 Léopard";
/// let first_space = s.find(' ').unwrap_or(s.len()); /// let first_space = s.find(' ').unwrap_or(s.len());
/// let (a, b) = s.split_at(first_space); /// let (a, b) = s.split_at(first_space);

View File

@ -753,8 +753,6 @@ impl<T> Vec<T> {
/// # Examples /// # Examples
/// ///
/// ``` /// ```
/// #![feature(split_off)]
///
/// let mut vec = vec![1,2,3]; /// let mut vec = vec![1,2,3];
/// let vec2 = vec.split_off(1); /// let vec2 = vec.split_off(1);
/// assert_eq!(vec, [1]); /// assert_eq!(vec, [1]);

View File

@ -1319,8 +1319,6 @@ impl<T> VecDeque<T> {
/// # Examples /// # Examples
/// ///
/// ``` /// ```
/// #![feature(split_off)]
///
/// use std::collections::VecDeque; /// use std::collections::VecDeque;
/// ///
/// let mut buf: VecDeque<_> = vec![1,2,3].into_iter().collect(); /// let mut buf: VecDeque<_> = vec![1,2,3].into_iter().collect();
@ -1406,8 +1404,6 @@ impl<T> VecDeque<T> {
/// # Examples /// # Examples
/// ///
/// ``` /// ```
/// #![feature(vec_deque_retain)]
///
/// use std::collections::VecDeque; /// use std::collections::VecDeque;
/// ///
/// let mut buf = VecDeque::new(); /// let mut buf = VecDeque::new();
@ -1787,14 +1783,7 @@ impl<'a, T: 'a + Copy> Extend<&'a T> for VecDeque<T> {
#[stable(feature = "rust1", since = "1.0.0")] #[stable(feature = "rust1", since = "1.0.0")]
impl<T: fmt::Debug> fmt::Debug for VecDeque<T> { impl<T: fmt::Debug> fmt::Debug for VecDeque<T> {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result { fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
try!(write!(f, "[")); f.debug_list().entries(self).finish()
for (i, e) in self.iter().enumerate() {
if i != 0 { try!(write!(f, ", ")); }
try!(write!(f, "{:?}", *e));
}
write!(f, "]")
} }
} }

View File

@ -9,7 +9,6 @@
// except according to those terms. // except according to those terms.
#![feature(ascii)] #![feature(ascii)]
#![feature(append)]
#![feature(binary_heap_extras)] #![feature(binary_heap_extras)]
#![feature(box_syntax)] #![feature(box_syntax)]
#![feature(btree_range)] #![feature(btree_range)]
@ -29,18 +28,14 @@
#![feature(set_recovery)] #![feature(set_recovery)]
#![feature(slice_bytes)] #![feature(slice_bytes)]
#![feature(slice_splits)] #![feature(slice_splits)]
#![feature(split_off)]
#![feature(step_by)] #![feature(step_by)]
#![feature(str_char)] #![feature(str_char)]
#![feature(str_escape)] #![feature(str_escape)]
#![feature(str_match_indices)] #![feature(str_match_indices)]
#![feature(str_split_at)]
#![feature(str_utf16)] #![feature(str_utf16)]
#![feature(box_str)]
#![feature(test)] #![feature(test)]
#![feature(unboxed_closures)] #![feature(unboxed_closures)]
#![feature(unicode)] #![feature(unicode)]
#![feature(vec_deque_retain)]
#![feature(vec_push_all)] #![feature(vec_push_all)]
#[macro_use] extern crate log; #[macro_use] extern crate log;

View File

@ -43,7 +43,7 @@ use std::rc::Rc;
use syntax::ast; use syntax::ast;
use syntax::codemap; use syntax::codemap;
use syntax::codemap::{Span, DUMMY_SP}; use syntax::codemap::{Span, DUMMY_SP};
use util::nodemap::{FnvHashMap, NodeMap}; use util::nodemap::{FnvHashMap, FnvHashSet, NodeMap};
use self::combine::CombineFields; use self::combine::CombineFields;
use self::region_inference::{RegionVarBindings, RegionSnapshot}; use self::region_inference::{RegionVarBindings, RegionSnapshot};
@ -92,6 +92,10 @@ pub struct InferCtxt<'a, 'tcx: 'a> {
pub fulfillment_cx: RefCell<traits::FulfillmentContext<'tcx>>, pub fulfillment_cx: RefCell<traits::FulfillmentContext<'tcx>>,
// the set of predicates on which errors have been reported, to
// avoid reporting the same error twice.
pub reported_trait_errors: RefCell<FnvHashSet<traits::TraitErrorKey<'tcx>>>,
// This is a temporary field used for toggling on normalization in the inference context, // This is a temporary field used for toggling on normalization in the inference context,
// as we move towards the approach described here: // as we move towards the approach described here:
// https://internals.rust-lang.org/t/flattening-the-contexts-for-fun-and-profit/2293 // https://internals.rust-lang.org/t/flattening-the-contexts-for-fun-and-profit/2293
@ -374,6 +378,7 @@ pub fn new_infer_ctxt<'a, 'tcx>(tcx: &'a ty::ctxt<'tcx>,
region_vars: RegionVarBindings::new(tcx), region_vars: RegionVarBindings::new(tcx),
parameter_environment: param_env.unwrap_or(tcx.empty_parameter_environment()), parameter_environment: param_env.unwrap_or(tcx.empty_parameter_environment()),
fulfillment_cx: RefCell::new(traits::FulfillmentContext::new(errors_will_be_reported)), fulfillment_cx: RefCell::new(traits::FulfillmentContext::new(errors_will_be_reported)),
reported_trait_errors: RefCell::new(FnvHashSet()),
normalize: false, normalize: false,
err_count_on_creation: tcx.sess.err_count() err_count_on_creation: tcx.sess.err_count()
} }

View File

@ -348,13 +348,17 @@ impl<'a, 'tcx> ReachableContext<'a, 'tcx> {
// this properly would result in the necessity of computing *type* // this properly would result in the necessity of computing *type*
// reachability, which might result in a compile time loss. // reachability, which might result in a compile time loss.
fn mark_destructors_reachable(&mut self) { fn mark_destructors_reachable(&mut self) {
for adt in self.tcx.adt_defs() { let drop_trait = match self.tcx.lang_items.drop_trait() {
if let Some(destructor_def_id) = adt.destructor() { Some(id) => self.tcx.lookup_trait_def(id), None => { return }
if destructor_def_id.is_local() { };
self.reachable_symbols.insert(destructor_def_id.node); drop_trait.for_each_impl(self.tcx, |drop_impl| {
for destructor in &self.tcx.impl_items.borrow()[&drop_impl] {
let destructor_did = destructor.def_id();
if destructor_did.is_local() {
self.reachable_symbols.insert(destructor_did.node);
} }
} }
} })
} }
} }

View File

@ -28,11 +28,32 @@ use middle::def_id::DefId;
use middle::infer::InferCtxt; use middle::infer::InferCtxt;
use middle::ty::{self, ToPredicate, HasTypeFlags, ToPolyTraitRef, TraitRef, Ty}; use middle::ty::{self, ToPredicate, HasTypeFlags, ToPolyTraitRef, TraitRef, Ty};
use middle::ty::fold::TypeFoldable; use middle::ty::fold::TypeFoldable;
use std::collections::HashMap; use util::nodemap::{FnvHashMap, FnvHashSet};
use std::fmt; use std::fmt;
use syntax::codemap::Span; use syntax::codemap::Span;
use syntax::attr::{AttributeMethods, AttrMetaMethods}; use syntax::attr::{AttributeMethods, AttrMetaMethods};
#[derive(Debug, PartialEq, Eq, Hash)]
pub struct TraitErrorKey<'tcx> {
is_warning: bool,
span: Span,
predicate: ty::Predicate<'tcx>
}
impl<'tcx> TraitErrorKey<'tcx> {
fn from_error<'a>(infcx: &InferCtxt<'a, 'tcx>,
e: &FulfillmentError<'tcx>) -> Self {
let predicate =
infcx.resolve_type_vars_if_possible(&e.obligation.predicate);
TraitErrorKey {
is_warning: is_warning(&e.obligation),
span: e.obligation.cause.span,
predicate: infcx.tcx.erase_regions(&predicate)
}
}
}
pub fn report_fulfillment_errors<'a, 'tcx>(infcx: &InferCtxt<'a, 'tcx>, pub fn report_fulfillment_errors<'a, 'tcx>(infcx: &InferCtxt<'a, 'tcx>,
errors: &Vec<FulfillmentError<'tcx>>) { errors: &Vec<FulfillmentError<'tcx>>) {
for error in errors { for error in errors {
@ -42,6 +63,13 @@ pub fn report_fulfillment_errors<'a, 'tcx>(infcx: &InferCtxt<'a, 'tcx>,
fn report_fulfillment_error<'a, 'tcx>(infcx: &InferCtxt<'a, 'tcx>, fn report_fulfillment_error<'a, 'tcx>(infcx: &InferCtxt<'a, 'tcx>,
error: &FulfillmentError<'tcx>) { error: &FulfillmentError<'tcx>) {
let error_key = TraitErrorKey::from_error(infcx, error);
debug!("report_fulfillment_errors({:?}) - key={:?}",
error, error_key);
if !infcx.reported_trait_errors.borrow_mut().insert(error_key) {
debug!("report_fulfillment_errors: skipping duplicate");
return;
}
match error.code { match error.code {
FulfillmentErrorCode::CodeSelectionError(ref e) => { FulfillmentErrorCode::CodeSelectionError(ref e) => {
report_selection_error(infcx, &error.obligation, e); report_selection_error(infcx, &error.obligation, e);
@ -97,7 +125,7 @@ fn report_on_unimplemented<'a, 'tcx>(infcx: &InferCtxt<'a, 'tcx>,
(gen.name.as_str().to_string(), (gen.name.as_str().to_string(),
trait_ref.substs.types.get(param, i) trait_ref.substs.types.get(param, i)
.to_string()) .to_string())
}).collect::<HashMap<String, String>>(); }).collect::<FnvHashMap<String, String>>();
generic_map.insert("Self".to_string(), generic_map.insert("Self".to_string(),
trait_ref.self_ty().to_string()); trait_ref.self_ty().to_string());
let parser = Parser::new(&istring); let parser = Parser::new(&istring);
@ -308,7 +336,11 @@ pub fn report_object_safety_error<'tcx>(tcx: &ty::ctxt<'tcx>,
"the trait `{}` cannot be made into an object", "the trait `{}` cannot be made into an object",
tcx.item_path_str(trait_def_id)); tcx.item_path_str(trait_def_id));
let mut reported_violations = FnvHashSet();
for violation in violations { for violation in violations {
if !reported_violations.insert(violation.clone()) {
continue;
}
match violation { match violation {
ObjectSafetyViolation::SizedSelf => { ObjectSafetyViolation::SizedSelf => {
tcx.sess.fileline_note( tcx.sess.fileline_note(

View File

@ -49,6 +49,12 @@ pub struct FulfillmentContext<'tcx> {
// than the `SelectionCache`: it avoids duplicate errors and // than the `SelectionCache`: it avoids duplicate errors and
// permits recursive obligations, which are often generated from // permits recursive obligations, which are often generated from
// traits like `Send` et al. // traits like `Send` et al.
//
// Note that because of type inference, a predicate can still
// occur twice in the predicates list, for example when 2
// initially-distinct type variables are unified after being
// inserted. Deduplicating the predicate set on selection had a
// significant performance cost the last time I checked.
duplicate_set: FulfilledPredicates<'tcx>, duplicate_set: FulfilledPredicates<'tcx>,
// A list of all obligations that have been registered with this // A list of all obligations that have been registered with this

View File

@ -21,10 +21,12 @@ use middle::subst;
use middle::ty::{self, HasTypeFlags, Ty}; use middle::ty::{self, HasTypeFlags, Ty};
use middle::ty::fold::TypeFoldable; use middle::ty::fold::TypeFoldable;
use middle::infer::{self, fixup_err_to_string, InferCtxt}; use middle::infer::{self, fixup_err_to_string, InferCtxt};
use std::rc::Rc; use std::rc::Rc;
use syntax::ast; use syntax::ast;
use syntax::codemap::{Span, DUMMY_SP}; use syntax::codemap::{Span, DUMMY_SP};
pub use self::error_reporting::TraitErrorKey;
pub use self::error_reporting::report_fulfillment_errors; pub use self::error_reporting::report_fulfillment_errors;
pub use self::error_reporting::report_overflow_error; pub use self::error_reporting::report_overflow_error;
pub use self::error_reporting::report_selection_error; pub use self::error_reporting::report_selection_error;

View File

@ -27,7 +27,7 @@ use middle::ty::{self, ToPolyTraitRef, Ty};
use std::rc::Rc; use std::rc::Rc;
use syntax::ast; use syntax::ast;
#[derive(Debug)] #[derive(Clone, Debug, PartialEq, Eq, Hash)]
pub enum ObjectSafetyViolation<'tcx> { pub enum ObjectSafetyViolation<'tcx> {
/// Self : Sized declared on the trait /// Self : Sized declared on the trait
SizedSelf, SizedSelf,

View File

@ -245,9 +245,6 @@ pub struct ctxt<'tcx> {
/// True if the variance has been computed yet; false otherwise. /// True if the variance has been computed yet; false otherwise.
pub variance_computed: Cell<bool>, pub variance_computed: Cell<bool>,
/// A method will be in this list if and only if it is a destructor.
pub destructors: RefCell<DefIdSet>,
/// Maps a DefId of a type to a list of its inherent impls. /// Maps a DefId of a type to a list of its inherent impls.
/// Contains implementations of methods that are inherent to a type. /// Contains implementations of methods that are inherent to a type.
/// Methods in these implementations don't need to be exported. /// Methods in these implementations don't need to be exported.
@ -475,7 +472,6 @@ impl<'tcx> ctxt<'tcx> {
normalized_cache: RefCell::new(FnvHashMap()), normalized_cache: RefCell::new(FnvHashMap()),
lang_items: lang_items, lang_items: lang_items,
provided_method_sources: RefCell::new(DefIdMap()), provided_method_sources: RefCell::new(DefIdMap()),
destructors: RefCell::new(DefIdSet()),
inherent_impls: RefCell::new(DefIdMap()), inherent_impls: RefCell::new(DefIdMap()),
impl_items: RefCell::new(DefIdMap()), impl_items: RefCell::new(DefIdMap()),
used_unsafe: RefCell::new(NodeSet()), used_unsafe: RefCell::new(NodeSet()),

View File

@ -272,6 +272,20 @@ impl<'tcx> Method<'tcx> {
} }
} }
impl<'tcx> PartialEq for Method<'tcx> {
#[inline]
fn eq(&self, other: &Self) -> bool { self.def_id == other.def_id }
}
impl<'tcx> Eq for Method<'tcx> {}
impl<'tcx> Hash for Method<'tcx> {
#[inline]
fn hash<H: Hasher>(&self, s: &mut H) {
self.def_id.hash(s)
}
}
#[derive(Clone, Copy, Debug)] #[derive(Clone, Copy, Debug)]
pub struct AssociatedConst<'tcx> { pub struct AssociatedConst<'tcx> {
pub name: Name, pub name: Name,
@ -1681,7 +1695,6 @@ impl<'tcx, 'container> AdtDefData<'tcx, 'container> {
} }
pub fn set_destructor(&self, dtor: DefId) { pub fn set_destructor(&self, dtor: DefId) {
assert!(self.destructor.get().is_none());
self.destructor.set(Some(dtor)); self.destructor.set(Some(dtor));
} }
@ -2315,11 +2328,6 @@ impl<'tcx> ctxt<'tcx> {
self.lookup_adt_def_master(did) self.lookup_adt_def_master(did)
} }
/// Return the list of all interned ADT definitions
pub fn adt_defs(&self) -> Vec<AdtDef<'tcx>> {
self.adt_defs.borrow().values().cloned().collect()
}
/// Given the did of an item, returns its full set of predicates. /// Given the did of an item, returns its full set of predicates.
pub fn lookup_predicates(&self, did: DefId) -> GenericPredicates<'tcx> { pub fn lookup_predicates(&self, did: DefId) -> GenericPredicates<'tcx> {
lookup_locally_or_in_crate_store( lookup_locally_or_in_crate_store(

View File

@ -36,7 +36,6 @@
#![feature(staged_api)] #![feature(staged_api)]
#![feature(str_char)] #![feature(str_char)]
#![feature(filling_drop)] #![feature(filling_drop)]
#![cfg_attr(test, feature(test))]
extern crate serialize; extern crate serialize;
#[macro_use] extern crate log; #[macro_use] extern crate log;

View File

@ -1210,15 +1210,14 @@ impl LintPass for DropWithReprExtern {
impl LateLintPass for DropWithReprExtern { impl LateLintPass for DropWithReprExtern {
fn check_crate(&mut self, ctx: &LateContext, _: &hir::Crate) { fn check_crate(&mut self, ctx: &LateContext, _: &hir::Crate) {
for dtor_did in ctx.tcx.destructors.borrow().iter() { let drop_trait = match ctx.tcx.lang_items.drop_trait() {
let (drop_impl_did, dtor_self_type) = Some(id) => ctx.tcx.lookup_trait_def(id), None => { return }
if dtor_did.is_local() { };
let impl_did = ctx.tcx.map.get_parent_did(dtor_did.node); drop_trait.for_each_impl(ctx.tcx, |drop_impl_did| {
let ty = ctx.tcx.lookup_item_type(impl_did).ty; if !drop_impl_did.is_local() {
(impl_did, ty) return;
} else { }
continue; let dtor_self_type = ctx.tcx.lookup_item_type(drop_impl_did).ty;
};
match dtor_self_type.sty { match dtor_self_type.sty {
ty::TyEnum(self_type_def, _) | ty::TyEnum(self_type_def, _) |
@ -1244,6 +1243,6 @@ impl LateLintPass for DropWithReprExtern {
} }
_ => {} _ => {}
} }
} })
} }
} }

View File

@ -145,10 +145,13 @@ impl<'a> ArchiveBuilder<'a> {
/// Adds all of the contents of a native library to this archive. This will /// Adds all of the contents of a native library to this archive. This will
/// search in the relevant locations for a library named `name`. /// search in the relevant locations for a library named `name`.
pub fn add_native_library(&mut self, name: &str) -> io::Result<()> { pub fn add_native_library(&mut self, name: &str) {
let location = find_library(name, &self.config.lib_search_paths, let location = find_library(name, &self.config.lib_search_paths,
self.config.sess); self.config.sess);
self.add_archive(&location, name, |_| false) self.add_archive(&location, name, |_| false).unwrap_or_else(|e| {
self.config.sess.fatal(&format!("failed to add native library {}: {}",
location.to_string_lossy(), e));
});
} }
/// Adds all of the contents of the rlib at the specified path to this /// Adds all of the contents of the rlib at the specified path to this

View File

@ -616,7 +616,7 @@ fn link_rlib<'a>(sess: &'a Session,
for &(ref l, kind) in sess.cstore.get_used_libraries().borrow().iter() { for &(ref l, kind) in sess.cstore.get_used_libraries().borrow().iter() {
match kind { match kind {
cstore::NativeStatic => ab.add_native_library(&l).unwrap(), cstore::NativeStatic => ab.add_native_library(&l),
cstore::NativeFramework | cstore::NativeUnknown => {} cstore::NativeFramework | cstore::NativeUnknown => {}
} }
} }
@ -792,7 +792,7 @@ fn link_staticlib(sess: &Session, objects: &[PathBuf], out_filename: &Path,
ab.build(); ab.build();
} }
if !sess.target.target.options.no_compiler_rt { if !sess.target.target.options.no_compiler_rt {
ab.add_native_library("compiler-rt").unwrap(); ab.add_native_library("compiler-rt");
} }
let mut all_native_libs = vec![]; let mut all_native_libs = vec![];

View File

@ -620,13 +620,7 @@ impl<'a,'tcx> ConfirmContext<'a,'tcx> {
ty::TraitContainer(trait_def_id) => { ty::TraitContainer(trait_def_id) => {
callee::check_legal_trait_for_method_call(self.fcx.ccx, self.span, trait_def_id) callee::check_legal_trait_for_method_call(self.fcx.ccx, self.span, trait_def_id)
} }
ty::ImplContainer(..) => { ty::ImplContainer(..) => {}
// Since `drop` is a trait method, we expect that any
// potential calls to it will wind up in the other
// arm. But just to be sure, check that the method id
// does not appear in the list of destructors.
assert!(!self.tcx().destructors.borrow().contains(&pick.item.def_id()));
}
} }
} }

View File

@ -431,9 +431,11 @@ pub fn check_item_bodies(ccx: &CrateCtxt) {
} }
pub fn check_drop_impls(ccx: &CrateCtxt) { pub fn check_drop_impls(ccx: &CrateCtxt) {
for drop_method_did in ccx.tcx.destructors.borrow().iter() { let drop_trait = match ccx.tcx.lang_items.drop_trait() {
if drop_method_did.is_local() { Some(id) => ccx.tcx.lookup_trait_def(id), None => { return }
let drop_impl_did = ccx.tcx.map.get_parent_did(drop_method_did.node); };
drop_trait.for_each_impl(ccx.tcx, |drop_impl_did| {
if drop_impl_did.is_local() {
match dropck::check_drop_impl(ccx.tcx, drop_impl_did) { match dropck::check_drop_impl(ccx.tcx, drop_impl_did) {
Ok(()) => {} Ok(()) => {}
Err(()) => { Err(()) => {
@ -441,7 +443,7 @@ pub fn check_drop_impls(ccx: &CrateCtxt) {
} }
} }
} }
} });
ccx.tcx.sess.abort_if_errors(); ccx.tcx.sess.abort_if_errors();
} }

View File

@ -126,7 +126,7 @@ impl<'a, 'tcx> CoherenceChecker<'a, 'tcx> {
// Populate the table of destructors. It might seem a bit strange to // Populate the table of destructors. It might seem a bit strange to
// do this here, but it's actually the most convenient place, since // do this here, but it's actually the most convenient place, since
// the coherence tables contain the trait -> type mappings. // the coherence tables contain the trait -> type mappings.
self.populate_destructor_table(); self.populate_destructors();
// Check to make sure implementations of `Copy` are legal. // Check to make sure implementations of `Copy` are legal.
self.check_implementations_of_copy(); self.check_implementations_of_copy();
@ -286,7 +286,7 @@ impl<'a, 'tcx> CoherenceChecker<'a, 'tcx> {
// Destructors // Destructors
// //
fn populate_destructor_table(&self) { fn populate_destructors(&self) {
let tcx = self.crate_context.tcx; let tcx = self.crate_context.tcx;
let drop_trait = match tcx.lang_items.drop_trait() { let drop_trait = match tcx.lang_items.drop_trait() {
Some(id) => id, None => { return } Some(id) => id, None => { return }
@ -309,9 +309,6 @@ impl<'a, 'tcx> CoherenceChecker<'a, 'tcx> {
ty::TyEnum(type_def, _) | ty::TyEnum(type_def, _) |
ty::TyStruct(type_def, _) => { ty::TyStruct(type_def, _) => {
type_def.set_destructor(method_def_id.def_id()); type_def.set_destructor(method_def_id.def_id());
tcx.destructors
.borrow_mut()
.insert(method_def_id.def_id());
} }
_ => { _ => {
// Destructors only work on nominal types. // Destructors only work on nominal types.

View File

@ -386,6 +386,9 @@
if ((aaa.item.ty === TY_PRIMITIVE) && (bbb.item.ty !== TY_PRIMITIVE)) { if ((aaa.item.ty === TY_PRIMITIVE) && (bbb.item.ty !== TY_PRIMITIVE)) {
return -1; return -1;
} }
if ((bbb.item.ty === TY_PRIMITIVE) && (aaa.item.ty !== TY_PRIMITIVE)) {
return 1;
}
// sort by description (no description goes later) // sort by description (no description goes later)
a = (aaa.item.desc === ''); a = (aaa.item.desc === '');
@ -572,6 +575,10 @@
displayPath = item.path + '::'; displayPath = item.path + '::';
href = rootPath + item.path.replace(/::/g, '/') + href = rootPath + item.path.replace(/::/g, '/') +
'/index.html'; '/index.html';
} else if (type === "primitive") {
displayPath = "";
href = rootPath + item.path.replace(/::/g, '/') +
'/' + type + '.' + name + '.html';
} else if (item.parent !== undefined) { } else if (item.parent !== undefined) {
var myparent = item.parent; var myparent = item.parent;
var anchor = '#' + type + '.' + name; var anchor = '#' + type + '.' + name;

View File

@ -249,8 +249,8 @@
#![feature(wrapping)] #![feature(wrapping)]
#![feature(zero_one)] #![feature(zero_one)]
#![cfg_attr(windows, feature(str_utf16))] #![cfg_attr(windows, feature(str_utf16))]
#![cfg_attr(test, feature(float_from_str_radix, range_inclusive, float_extras, hash_default))] #![cfg_attr(test, feature(float_from_str_radix, range_inclusive, float_extras))]
#![cfg_attr(test, feature(test, rustc_private, float_consts))] #![cfg_attr(test, feature(test, rustc_private))]
#![cfg_attr(target_env = "msvc", feature(link_args))] #![cfg_attr(target_env = "msvc", feature(link_args))]
// Don't link to std. We are std. // Don't link to std. We are std.

View File

@ -32,5 +32,4 @@ fn ice<A>(a: A) {
let r = loop {}; let r = loop {};
r = r + a; r = r + a;
//~^ ERROR not implemented //~^ ERROR not implemented
//~| ERROR not implemented
} }

View File

@ -39,7 +39,6 @@ pub fn f1_int_uint() {
pub fn f1_uint_uint() { pub fn f1_uint_uint() {
f1(2u32, 4u32); f1(2u32, 4u32);
//~^ ERROR the trait `Foo` is not implemented //~^ ERROR the trait `Foo` is not implemented
//~| ERROR the trait `Foo` is not implemented
} }
pub fn f1_uint_int() { pub fn f1_uint_int() {

View File

@ -11,5 +11,4 @@
fn main() { fn main() {
let x: Option<&[u8]> = Some("foo").map(std::mem::transmute); let x: Option<&[u8]> = Some("foo").map(std::mem::transmute);
//~^ ERROR E0277 //~^ ERROR E0277
//~| ERROR E0277
} }

View File

@ -23,7 +23,6 @@ const A_I8_T
: [u32; (i8::MAX as i8 + 1u8) as usize] : [u32; (i8::MAX as i8 + 1u8) as usize]
//~^ ERROR mismatched types //~^ ERROR mismatched types
//~| the trait `core::ops::Add<u8>` is not implemented for the type `i8` //~| the trait `core::ops::Add<u8>` is not implemented for the type `i8`
//~| the trait `core::ops::Add<u8>` is not implemented for the type `i8`
= [0; (i8::MAX as usize) + 1]; = [0; (i8::MAX as usize) + 1];
fn main() { fn main() {
@ -33,4 +32,3 @@ fn main() {
fn foo<T:fmt::Debug>(x: T) { fn foo<T:fmt::Debug>(x: T) {
println!("{:?}", x); println!("{:?}", x);
} }

View File

@ -20,10 +20,8 @@ fn main() {
apply(&3, takes_imm); apply(&3, takes_imm);
apply(&3, takes_mut); apply(&3, takes_mut);
//~^ ERROR (values differ in mutability) //~^ ERROR (values differ in mutability)
//~| ERROR (values differ in mutability)
apply(&mut 3, takes_mut); apply(&mut 3, takes_mut);
apply(&mut 3, takes_imm); apply(&mut 3, takes_imm);
//~^ ERROR (values differ in mutability) //~^ ERROR (values differ in mutability)
//~| ERROR (values differ in mutability)
} }

View File

@ -25,9 +25,6 @@ pub fn main() {
y: 2, y: 2,
}; };
for x in bogus { //~ ERROR `core::iter::Iterator` is not implemented for the type `MyStruct` for x in bogus { //~ ERROR `core::iter::Iterator` is not implemented for the type `MyStruct`
//~^ ERROR
//~^^ ERROR
// FIXME(#21528) not fulfilled obligation error should be reported once, not thrice
drop(x); drop(x);
} }
} }

View File

@ -14,7 +14,6 @@
fn main() { fn main() {
fn bar<T>(_: T) {} fn bar<T>(_: T) {}
[0][0u8]; //~ ERROR: the trait `core::ops::Index<u8>` is not implemented [0][0u8]; //~ ERROR: the trait `core::ops::Index<u8>` is not implemented
//~^ ERROR: the trait `core::ops::Index<u8>` is not implemented
[0][0]; // should infer to be a usize [0][0]; // should infer to be a usize

View File

@ -14,21 +14,13 @@ pub fn main() {
v[3_usize]; v[3_usize];
v[3]; v[3];
v[3u8]; //~ERROR the trait `core::ops::Index<u8>` is not implemented v[3u8]; //~ERROR the trait `core::ops::Index<u8>` is not implemented
//~^ ERROR the trait `core::ops::Index<u8>` is not implemented
v[3i8]; //~ERROR the trait `core::ops::Index<i8>` is not implemented v[3i8]; //~ERROR the trait `core::ops::Index<i8>` is not implemented
//~^ ERROR the trait `core::ops::Index<i8>` is not implemented
v[3u32]; //~ERROR the trait `core::ops::Index<u32>` is not implemented v[3u32]; //~ERROR the trait `core::ops::Index<u32>` is not implemented
//~^ ERROR the trait `core::ops::Index<u32>` is not implemented
v[3i32]; //~ERROR the trait `core::ops::Index<i32>` is not implemented v[3i32]; //~ERROR the trait `core::ops::Index<i32>` is not implemented
//~^ ERROR the trait `core::ops::Index<i32>` is not implemented
s.as_bytes()[3_usize]; s.as_bytes()[3_usize];
s.as_bytes()[3]; s.as_bytes()[3];
s.as_bytes()[3u8]; //~ERROR the trait `core::ops::Index<u8>` is not implemented s.as_bytes()[3u8]; //~ERROR the trait `core::ops::Index<u8>` is not implemented
//~^ ERROR the trait `core::ops::Index<u8>` is not implemented
s.as_bytes()[3i8]; //~ERROR the trait `core::ops::Index<i8>` is not implemented s.as_bytes()[3i8]; //~ERROR the trait `core::ops::Index<i8>` is not implemented
//~^ ERROR the trait `core::ops::Index<i8>` is not implemented
s.as_bytes()[3u32]; //~ERROR the trait `core::ops::Index<u32>` is not implemented s.as_bytes()[3u32]; //~ERROR the trait `core::ops::Index<u32>` is not implemented
//~^ ERROR the trait `core::ops::Index<u32>` is not implemented
s.as_bytes()[3i32]; //~ERROR the trait `core::ops::Index<i32>` is not implemented s.as_bytes()[3i32]; //~ERROR the trait `core::ops::Index<i32>` is not implemented
//~^ ERROR the trait `core::ops::Index<i32>` is not implemented
} }

View File

@ -12,12 +12,10 @@ fn main() {
let x = (); let x = ();
1 + 1 +
x //~^ ERROR E0277 x //~^ ERROR E0277
//~| ERROR E0277
; ;
let x: () = (); let x: () = ();
1 + 1 +
x //~^ ERROR E0277 x //~^ ERROR E0277
//~| ERROR E0277
; ;
} }

View File

@ -18,5 +18,4 @@ fn main() {
}); });
2_usize + (loop {}); 2_usize + (loop {});
//~^ ERROR E0277 //~^ ERROR E0277
//~| ERROR E0277
} }

View File

@ -14,5 +14,4 @@
fn main() { fn main() {
in () { 0 }; in () { 0 };
//~^ ERROR: the trait `core::ops::Placer<_>` is not implemented //~^ ERROR: the trait `core::ops::Placer<_>` is not implemented
//~| ERROR: the trait `core::ops::Placer<_>` is not implemented
} }

View File

@ -11,9 +11,6 @@
fn changer<'a>(mut things: Box<Iterator<Item=&'a mut u8>>) { fn changer<'a>(mut things: Box<Iterator<Item=&'a mut u8>>) {
for item in *things { *item = 0 } for item in *things { *item = 0 }
//~^ ERROR the trait `core::marker::Sized` is not implemented for the type `core::iter::Iterator //~^ ERROR the trait `core::marker::Sized` is not implemented for the type `core::iter::Iterator
//~^^ ERROR
//~^^^ ERROR
// FIXME(#21528) error should be reported once, not thrice
} }
fn main() {} fn main() {}

View File

@ -0,0 +1,23 @@
// Copyright 2015 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
trait Array: Sized {}
fn f<T: Array>(x: &T) {
let _ = x
//~^ ERROR `Array` cannot be made into an object
//~| NOTE the trait cannot require that `Self : Sized`
as
&Array;
//~^ ERROR `Array` cannot be made into an object
//~| NOTE the trait cannot require that `Self : Sized`
}
fn main() {}

View File

@ -17,7 +17,6 @@ impl<A> vec_monad<A> for Vec<A> {
let mut r = panic!(); let mut r = panic!();
for elt in self { r = r + f(*elt); } for elt in self { r = r + f(*elt); }
//~^ ERROR E0277 //~^ ERROR E0277
//~| ERROR E0277
} }
} }
fn main() { fn main() {

View File

@ -23,7 +23,5 @@ impl<RHS: Scalar> Add <RHS> for Bob {
fn main() { fn main() {
let b = Bob + 3.5; let b = Bob + 3.5;
b + 3 //~ ERROR: is not implemented b + 3 //~ ERROR: is not implemented
//~^ ERROR: is not implemented //~^ ERROR: mismatched types
//~^^ ERROR: is not implemented
//~^^^ ERROR: mismatched types
} }

View File

@ -11,5 +11,4 @@
fn main() { fn main() {
1.0f64 - 1.0; 1.0f64 - 1.0;
1.0f64 - 1 //~ ERROR: is not implemented 1.0f64 - 1 //~ ERROR: is not implemented
//~^ ERROR: is not implemented
} }

View File

@ -0,0 +1,35 @@
// Copyright 2015 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
fn main() {
let _ = Iterator::next(&mut ());
//~^ ERROR the trait `core::iter::Iterator` is not implemented
for _ in false {}
//~^ ERROR the trait `core::iter::Iterator` is not implemented
let _ = Iterator::next(&mut ());
//~^ ERROR the trait `core::iter::Iterator` is not implemented
other()
}
pub fn other() {
// check errors are still reported globally
let _ = Iterator::next(&mut ());
//~^ ERROR the trait `core::iter::Iterator` is not implemented
let _ = Iterator::next(&mut ());
//~^ ERROR the trait `core::iter::Iterator` is not implemented
for _ in false {}
//~^ ERROR the trait `core::iter::Iterator` is not implemented
}

View File

@ -0,0 +1,23 @@
// Copyright 2015 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
struct MyStruct;
impl Drop for MyStruct {
//~^ ERROR conflicting implementations for trait
fn drop(&mut self) { }
}
impl Drop for MyStruct {
//~^ NOTE conflicting implementation here
fn drop(&mut self) { }
}
fn main() {}

View File

@ -18,15 +18,12 @@ struct Panolpy {
fn foo(p: &Panolpy) { fn foo(p: &Panolpy) {
22 >> p.char; 22 >> p.char;
//~^ ERROR E0277 //~^ ERROR E0277
//~| ERROR E0277
22 >> p.str; 22 >> p.str;
//~^ ERROR E0277 //~^ ERROR E0277
//~| ERROR E0277
22 >> p; 22 >> p;
//~^ ERROR E0277 //~^ ERROR E0277
//~| ERROR E0277
let x; let x;
22 >> x; // ambiguity error winds up being suppressed 22 >> x; // ambiguity error winds up being suppressed

View File

@ -11,5 +11,4 @@
pub fn main() { pub fn main() {
let s: &str = "hello"; let s: &str = "hello";
let c: u8 = s[4]; //~ ERROR the trait `core::ops::Index<_>` is not implemented let c: u8 = s[4]; //~ ERROR the trait `core::ops::Index<_>` is not implemented
//~^ ERROR the trait `core::ops::Index<_>` is not implemented
} }

View File

@ -17,7 +17,6 @@ fn mutate(s: &mut str) {
s[1usize] = bot(); s[1usize] = bot();
//~^ ERROR `core::ops::Index<usize>` is not implemented for the type `str` //~^ ERROR `core::ops::Index<usize>` is not implemented for the type `str`
//~| ERROR `core::ops::IndexMut<usize>` is not implemented for the type `str` //~| ERROR `core::ops::IndexMut<usize>` is not implemented for the type `str`
//~| ERROR `core::ops::Index<usize>` is not implemented for the type `str`
} }
pub fn main() {} pub fn main() {}

View File

@ -35,7 +35,6 @@ fn b() {
fn c() { fn c() {
let z = call_it_once(square, 22); let z = call_it_once(square, 22);
//~^ ERROR not implemented //~^ ERROR not implemented
//~| ERROR not implemented
} }
fn main() { } fn main() { }

View File

@ -35,7 +35,6 @@ fn b() {
fn c() { fn c() {
let z = call_it_once(square, 22); let z = call_it_once(square, 22);
//~^ ERROR not implemented //~^ ERROR not implemented
//~| ERROR not implemented
} }
fn main() { } fn main() { }

View File

@ -36,7 +36,6 @@ fn b() {
fn c() { fn c() {
let z = call_it_once(square, 22); let z = call_it_once(square, 22);
//~^ ERROR not implemented //~^ ERROR not implemented
//~| ERROR not implemented
} }
fn main() { } fn main() { }

View File

@ -0,0 +1,5 @@
-include ../tools.mk
all:
touch $(TMPDIR)/libfoo.a
echo | $(RUSTC) - --crate-type=rlib -lstatic=foo 2>&1 | grep "failed to add native library"