2014-06-09 20:12:30 +00:00
|
|
|
//! The Rust parser and macro expander.
|
|
|
|
//!
|
|
|
|
//! # Note
|
|
|
|
//!
|
|
|
|
//! This API is completely unstable and subject to change.
|
2013-03-29 19:51:10 +00:00
|
|
|
|
2019-02-05 13:37:15 +00:00
|
|
|
#![doc(html_root_url = "https://doc.rust-lang.org/nightly/",
|
2015-11-03 16:34:11 +00:00
|
|
|
test(attr(deny(warnings))))]
|
2014-03-22 01:05:05 +00:00
|
|
|
|
2019-02-06 17:33:01 +00:00
|
|
|
#![deny(rust_2018_idioms)]
|
2019-04-15 11:35:08 +00:00
|
|
|
#![deny(internal)]
|
2019-06-11 09:50:47 +00:00
|
|
|
#![deny(unused_lifetimes)]
|
2019-02-06 17:33:01 +00:00
|
|
|
|
2019-06-04 17:42:43 +00:00
|
|
|
#![feature(bind_by_move_pattern_guards)]
|
2019-06-12 08:42:58 +00:00
|
|
|
#![feature(const_fn)]
|
|
|
|
#![feature(const_transmute)]
|
2018-06-22 22:05:07 +00:00
|
|
|
#![feature(crate_visibility_modifier)]
|
2019-01-01 23:21:05 +00:00
|
|
|
#![feature(label_break_value)]
|
2019-02-10 07:13:30 +00:00
|
|
|
#![feature(nll)]
|
2018-01-24 06:20:30 +00:00
|
|
|
#![feature(rustc_attrs)]
|
2018-06-22 22:05:07 +00:00
|
|
|
#![feature(rustc_diagnostic_macros)]
|
2018-11-07 09:08:41 +00:00
|
|
|
#![feature(step_trait)]
|
2018-08-20 00:51:02 +00:00
|
|
|
#![feature(try_trait)]
|
2018-06-22 22:05:07 +00:00
|
|
|
#![feature(unicode_internals)]
|
2014-01-09 13:05:33 +00:00
|
|
|
|
2018-03-03 05:24:49 +00:00
|
|
|
#![recursion_limit="256"]
|
|
|
|
|
2019-02-06 17:33:01 +00:00
|
|
|
#[allow(unused_extern_crates)]
|
2016-08-23 00:56:52 +00:00
|
|
|
extern crate serialize as rustc_serialize; // used by deriving
|
2016-06-24 23:10:15 +00:00
|
|
|
|
2019-02-07 15:56:05 +00:00
|
|
|
pub use errors;
|
2018-03-07 01:44:10 +00:00
|
|
|
use rustc_data_structures::sync::Lock;
|
Merge indexed_set.rs into bitvec.rs, and rename it bit_set.rs.
Currently we have two files implementing bitsets (and 2D bit matrices).
This commit combines them into one, taking the best features from each.
This involves renaming a lot of things. The high level changes are as
follows.
- bitvec.rs --> bit_set.rs
- indexed_set.rs --> (removed)
- BitArray + IdxSet --> BitSet (merged, see below)
- BitVector --> GrowableBitSet
- {,Sparse,Hybrid}IdxSet --> {,Sparse,Hybrid}BitSet
- BitMatrix --> BitMatrix
- SparseBitMatrix --> SparseBitMatrix
The changes within the bitset types themselves are as follows.
```
OLD OLD NEW
BitArray<C> IdxSet<T> BitSet<T>
-------- ------ ------
grow - grow
new - (remove)
new_empty new_empty new_empty
new_filled new_filled new_filled
- to_hybrid to_hybrid
clear clear clear
set_up_to set_up_to set_up_to
clear_above - clear_above
count - count
contains(T) contains(&T) contains(T)
contains_all - superset
is_empty - is_empty
insert(T) add(&T) insert(T)
insert_all - insert_all()
remove(T) remove(&T) remove(T)
words words words
words_mut words_mut words_mut
- overwrite overwrite
merge union union
- subtract subtract
- intersect intersect
iter iter iter
```
In general, when choosing names I went with:
- names that are more obvious (e.g. `BitSet` over `IdxSet`).
- names that are more like the Rust libraries (e.g. `T` over `C`,
`insert` over `add`);
- names that are more set-like (e.g. `union` over `merge`, `superset`
over `contains_all`, `domain_size` over `num_bits`).
Also, using `T` for index arguments seems more sensible than `&T` --
even though the latter is standard in Rust collection types -- because
indices are always copyable. It also results in fewer `&` and `*`
sigils in practice.
2018-09-14 05:07:25 +00:00
|
|
|
use rustc_data_structures::bit_set::GrowableBitSet;
|
2018-08-05 10:04:56 +00:00
|
|
|
pub use rustc_data_structures::thin_vec::ThinVec;
|
2018-07-30 14:39:03 +00:00
|
|
|
use ast::AttrId;
|
2019-04-05 22:15:49 +00:00
|
|
|
use syntax_pos::edition::Edition;
|
2018-03-07 01:44:10 +00:00
|
|
|
|
2019-05-22 05:17:53 +00:00
|
|
|
const MACRO_ARGUMENTS: Option<&'static str> = Some("macro arguments");
|
|
|
|
|
2015-12-20 21:00:43 +00:00
|
|
|
// A variant of 'try!' that panics on an Err. This is used as a crutch on the
|
|
|
|
// way towards a non-panic!-prone parser. It should be used for fatal parsing
|
|
|
|
// errors; eventually we plan to convert all code using panictry to just use
|
|
|
|
// normal try.
|
2015-03-28 21:58:51 +00:00
|
|
|
macro_rules! panictry {
|
|
|
|
($e:expr) => ({
|
|
|
|
use std::result::Result::{Ok, Err};
|
2019-02-07 15:56:05 +00:00
|
|
|
use errors::FatalError;
|
2015-03-28 21:58:51 +00:00
|
|
|
match $e {
|
|
|
|
Ok(e) => e,
|
2015-12-20 21:00:43 +00:00
|
|
|
Err(mut e) => {
|
|
|
|
e.emit();
|
2018-01-21 11:47:58 +00:00
|
|
|
FatalError.raise()
|
2015-12-20 21:00:43 +00:00
|
|
|
}
|
2015-03-28 21:58:51 +00:00
|
|
|
}
|
|
|
|
})
|
|
|
|
}
|
|
|
|
|
2018-11-01 21:01:38 +00:00
|
|
|
// A variant of 'panictry!' that works on a Vec<Diagnostic> instead of a single DiagnosticBuilder.
|
|
|
|
macro_rules! panictry_buffer {
|
|
|
|
($handler:expr, $e:expr) => ({
|
|
|
|
use std::result::Result::{Ok, Err};
|
2019-02-07 15:56:05 +00:00
|
|
|
use errors::{FatalError, DiagnosticBuilder};
|
2018-11-01 21:01:38 +00:00
|
|
|
match $e {
|
|
|
|
Ok(e) => e,
|
|
|
|
Err(errs) => {
|
|
|
|
for e in errs {
|
|
|
|
DiagnosticBuilder::new_diagnostic($handler, e).emit();
|
|
|
|
}
|
|
|
|
FatalError.raise()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
})
|
|
|
|
}
|
|
|
|
|
2017-03-03 09:23:59 +00:00
|
|
|
#[macro_export]
|
|
|
|
macro_rules! unwrap_or {
|
|
|
|
($opt:expr, $default:expr) => {
|
|
|
|
match $opt {
|
|
|
|
Some(x) => x,
|
|
|
|
None => $default,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-04-25 22:49:52 +00:00
|
|
|
pub struct Globals {
|
Merge indexed_set.rs into bitvec.rs, and rename it bit_set.rs.
Currently we have two files implementing bitsets (and 2D bit matrices).
This commit combines them into one, taking the best features from each.
This involves renaming a lot of things. The high level changes are as
follows.
- bitvec.rs --> bit_set.rs
- indexed_set.rs --> (removed)
- BitArray + IdxSet --> BitSet (merged, see below)
- BitVector --> GrowableBitSet
- {,Sparse,Hybrid}IdxSet --> {,Sparse,Hybrid}BitSet
- BitMatrix --> BitMatrix
- SparseBitMatrix --> SparseBitMatrix
The changes within the bitset types themselves are as follows.
```
OLD OLD NEW
BitArray<C> IdxSet<T> BitSet<T>
-------- ------ ------
grow - grow
new - (remove)
new_empty new_empty new_empty
new_filled new_filled new_filled
- to_hybrid to_hybrid
clear clear clear
set_up_to set_up_to set_up_to
clear_above - clear_above
count - count
contains(T) contains(&T) contains(T)
contains_all - superset
is_empty - is_empty
insert(T) add(&T) insert(T)
insert_all - insert_all()
remove(T) remove(&T) remove(T)
words words words
words_mut words_mut words_mut
- overwrite overwrite
merge union union
- subtract subtract
- intersect intersect
iter iter iter
```
In general, when choosing names I went with:
- names that are more obvious (e.g. `BitSet` over `IdxSet`).
- names that are more like the Rust libraries (e.g. `T` over `C`,
`insert` over `add`);
- names that are more set-like (e.g. `union` over `merge`, `superset`
over `contains_all`, `domain_size` over `num_bits`).
Also, using `T` for index arguments seems more sensible than `&T` --
even though the latter is standard in Rust collection types -- because
indices are always copyable. It also results in fewer `&` and `*`
sigils in practice.
2018-09-14 05:07:25 +00:00
|
|
|
used_attrs: Lock<GrowableBitSet<AttrId>>,
|
|
|
|
known_attrs: Lock<GrowableBitSet<AttrId>>,
|
2018-03-07 01:44:10 +00:00
|
|
|
syntax_pos_globals: syntax_pos::Globals,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl Globals {
|
2019-04-05 22:15:49 +00:00
|
|
|
fn new(edition: Edition) -> Globals {
|
2018-03-07 01:44:10 +00:00
|
|
|
Globals {
|
2018-07-30 14:39:03 +00:00
|
|
|
// We have no idea how many attributes their will be, so just
|
|
|
|
// initiate the vectors with 0 bits. We'll grow them as necessary.
|
Merge indexed_set.rs into bitvec.rs, and rename it bit_set.rs.
Currently we have two files implementing bitsets (and 2D bit matrices).
This commit combines them into one, taking the best features from each.
This involves renaming a lot of things. The high level changes are as
follows.
- bitvec.rs --> bit_set.rs
- indexed_set.rs --> (removed)
- BitArray + IdxSet --> BitSet (merged, see below)
- BitVector --> GrowableBitSet
- {,Sparse,Hybrid}IdxSet --> {,Sparse,Hybrid}BitSet
- BitMatrix --> BitMatrix
- SparseBitMatrix --> SparseBitMatrix
The changes within the bitset types themselves are as follows.
```
OLD OLD NEW
BitArray<C> IdxSet<T> BitSet<T>
-------- ------ ------
grow - grow
new - (remove)
new_empty new_empty new_empty
new_filled new_filled new_filled
- to_hybrid to_hybrid
clear clear clear
set_up_to set_up_to set_up_to
clear_above - clear_above
count - count
contains(T) contains(&T) contains(T)
contains_all - superset
is_empty - is_empty
insert(T) add(&T) insert(T)
insert_all - insert_all()
remove(T) remove(&T) remove(T)
words words words
words_mut words_mut words_mut
- overwrite overwrite
merge union union
- subtract subtract
- intersect intersect
iter iter iter
```
In general, when choosing names I went with:
- names that are more obvious (e.g. `BitSet` over `IdxSet`).
- names that are more like the Rust libraries (e.g. `T` over `C`,
`insert` over `add`);
- names that are more set-like (e.g. `union` over `merge`, `superset`
over `contains_all`, `domain_size` over `num_bits`).
Also, using `T` for index arguments seems more sensible than `&T` --
even though the latter is standard in Rust collection types -- because
indices are always copyable. It also results in fewer `&` and `*`
sigils in practice.
2018-09-14 05:07:25 +00:00
|
|
|
used_attrs: Lock::new(GrowableBitSet::new_empty()),
|
|
|
|
known_attrs: Lock::new(GrowableBitSet::new_empty()),
|
2019-04-05 22:15:49 +00:00
|
|
|
syntax_pos_globals: syntax_pos::Globals::new(edition),
|
2018-03-07 01:44:10 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-04-05 22:15:49 +00:00
|
|
|
pub fn with_globals<F, R>(edition: Edition, f: F) -> R
|
2018-03-07 01:44:10 +00:00
|
|
|
where F: FnOnce() -> R
|
|
|
|
{
|
2019-04-05 22:15:49 +00:00
|
|
|
let globals = Globals::new(edition);
|
2018-03-07 01:44:10 +00:00
|
|
|
GLOBALS.set(&globals, || {
|
|
|
|
syntax_pos::GLOBALS.set(&globals.syntax_pos_globals, f)
|
|
|
|
})
|
|
|
|
}
|
|
|
|
|
2019-04-05 22:15:49 +00:00
|
|
|
pub fn with_default_globals<F, R>(f: F) -> R
|
|
|
|
where F: FnOnce() -> R
|
|
|
|
{
|
|
|
|
with_globals(edition::DEFAULT_EDITION, f)
|
|
|
|
}
|
|
|
|
|
2019-02-06 17:33:01 +00:00
|
|
|
scoped_tls::scoped_thread_local!(pub static GLOBALS: Globals);
|
2018-03-07 01:44:10 +00:00
|
|
|
|
2016-06-28 17:40:40 +00:00
|
|
|
#[macro_use]
|
|
|
|
pub mod diagnostics {
|
|
|
|
#[macro_use]
|
|
|
|
pub mod macros;
|
|
|
|
pub mod plugin;
|
|
|
|
pub mod metadata;
|
|
|
|
}
|
|
|
|
|
2018-11-27 02:59:49 +00:00
|
|
|
// N.B., this module needs to be declared first so diagnostics are
|
2016-06-28 17:40:40 +00:00
|
|
|
// registered before they are used.
|
2019-04-17 21:27:30 +00:00
|
|
|
pub mod error_codes;
|
2016-06-28 17:40:40 +00:00
|
|
|
|
2013-04-03 16:41:40 +00:00
|
|
|
pub mod util {
|
2015-11-25 23:21:38 +00:00
|
|
|
pub mod lev_distance;
|
2015-11-11 05:26:14 +00:00
|
|
|
pub mod node_count;
|
|
|
|
pub mod parser;
|
2013-05-17 00:41:47 +00:00
|
|
|
#[cfg(test)]
|
|
|
|
pub mod parser_testing;
|
Overhaul `syntax::fold::Folder`.
This commit changes `syntax::fold::Folder` from a functional style
(where most methods take a `T` and produce a new `T`) to a more
imperative style (where most methods take and modify a `&mut T`), and
renames it `syntax::mut_visit::MutVisitor`.
The first benefit is speed. The functional style does not require any
reallocations, due to the use of `P::map` and
`MoveMap::move_{,flat_}map`. However, every field in the AST must be
overwritten; even those fields that are unchanged are overwritten with
the same value. This causes a lot of unnecessary memory writes. The
imperative style reduces instruction counts by 1--3% across a wide range
of workloads, particularly incremental workloads.
The second benefit is conciseness; the imperative style is usually more
concise. E.g. compare the old functional style:
```
fn fold_abc(&mut self, abc: ABC) {
ABC {
a: fold_a(abc.a),
b: fold_b(abc.b),
c: abc.c,
}
}
```
with the imperative style:
```
fn visit_abc(&mut self, ABC { a, b, c: _ }: &mut ABC) {
visit_a(a);
visit_b(b);
}
```
(The reductions get larger in more complex examples.)
Overall, the patch removes over 200 lines of code -- even though the new
code has more comments -- and a lot of the remaining lines have fewer
characters.
Some notes:
- The old style used methods called `fold_*`. The new style mostly uses
methods called `visit_*`, but there are a few methods that map a `T`
to something other than a `T`, which are called `flat_map_*` (`T` maps
to multiple `T`s) or `filter_map_*` (`T` maps to 0 or 1 `T`s).
- `move_map.rs`/`MoveMap`/`move_map`/`move_flat_map` are renamed
`map_in_place.rs`/`MapInPlace`/`map_in_place`/`flat_map_in_place` to
reflect their slightly changed signatures.
- Although this commit renames the `fold` module as `mut_visit`, it
keeps it in the `fold.rs` file, so as not to confuse git. The next
commit will rename the file.
2019-02-05 04:20:55 +00:00
|
|
|
pub mod map_in_place;
|
2013-04-03 16:41:40 +00:00
|
|
|
}
|
|
|
|
|
2016-06-21 22:08:13 +00:00
|
|
|
pub mod json;
|
2015-12-13 22:17:55 +00:00
|
|
|
|
2013-01-29 22:41:40 +00:00
|
|
|
pub mod ast;
|
2014-07-01 16:39:41 +00:00
|
|
|
pub mod attr;
|
2018-08-18 10:14:03 +00:00
|
|
|
pub mod source_map;
|
2016-09-07 22:24:01 +00:00
|
|
|
#[macro_use]
|
2014-07-25 02:44:24 +00:00
|
|
|
pub mod config;
|
2015-08-23 18:12:39 +00:00
|
|
|
pub mod entry;
|
2014-09-11 00:55:42 +00:00
|
|
|
pub mod feature_gate;
|
2019-02-05 22:10:05 +00:00
|
|
|
pub mod mut_visit;
|
2013-01-29 22:41:40 +00:00
|
|
|
pub mod parse;
|
2014-05-17 21:46:40 +00:00
|
|
|
pub mod ptr;
|
2014-07-25 02:44:24 +00:00
|
|
|
pub mod show_span;
|
2014-09-10 22:35:21 +00:00
|
|
|
pub mod std_inject;
|
2018-04-22 22:44:19 +00:00
|
|
|
pub use syntax_pos::edition;
|
2017-03-17 04:04:41 +00:00
|
|
|
pub use syntax_pos::symbol;
|
2014-07-25 02:44:24 +00:00
|
|
|
pub mod test;
|
2016-06-20 15:49:33 +00:00
|
|
|
pub mod tokenstream;
|
2014-07-01 16:39:41 +00:00
|
|
|
pub mod visit;
|
2013-01-29 22:41:40 +00:00
|
|
|
|
|
|
|
pub mod print {
|
|
|
|
pub mod pp;
|
|
|
|
pub mod pprust;
|
2012-03-29 20:48:05 +00:00
|
|
|
}
|
|
|
|
|
2013-01-29 22:41:40 +00:00
|
|
|
pub mod ext {
|
2017-03-16 10:23:33 +00:00
|
|
|
pub use syntax_pos::hygiene;
|
2013-01-29 22:41:40 +00:00
|
|
|
pub mod base;
|
2014-07-01 16:39:41 +00:00
|
|
|
pub mod build;
|
2017-02-01 10:33:09 +00:00
|
|
|
pub mod derive;
|
2013-01-29 22:41:40 +00:00
|
|
|
pub mod expand;
|
2016-08-29 05:32:41 +00:00
|
|
|
pub mod placeholders;
|
2014-07-01 16:39:41 +00:00
|
|
|
pub mod source_util;
|
2013-01-29 22:41:40 +00:00
|
|
|
|
|
|
|
pub mod tt {
|
|
|
|
pub mod transcribe;
|
|
|
|
pub mod macro_parser;
|
|
|
|
pub mod macro_rules;
|
2017-01-29 08:38:44 +00:00
|
|
|
pub mod quoted;
|
2012-06-27 22:29:35 +00:00
|
|
|
}
|
2012-03-29 20:48:05 +00:00
|
|
|
}
|
2016-06-28 17:40:40 +00:00
|
|
|
|
2018-07-12 01:54:12 +00:00
|
|
|
pub mod early_buffered_lints;
|
|
|
|
|
2016-10-24 00:22:06 +00:00
|
|
|
#[cfg(test)]
|
|
|
|
mod test_snippet;
|
|
|
|
|
2017-07-31 06:22:09 +00:00
|
|
|
__build_diagnostic_array! { libsyntax, DIAGNOSTICS }
|