[−][src]Struct rustc_ap_rustc_span::Span
A compressed span.
SpanData
is 12 bytes, which is a bit too big to stick everywhere. Span
is a form that only takes up 8 bytes, with less space for the length and
context. The vast majority (99.9%+) of SpanData
instances will fit within
those 8 bytes; any SpanData
whose fields don't fit into a Span
are
stored in a separate interner table, and the Span
will index into that
table. Interning is rare enough that the cost is low, but common enough
that the code is exercised regularly.
An earlier version of this code used only 4 bytes for Span
, but that was
slower because only 80--90% of spans could be stored inline (even less in
very large crates) and so the interner was used a lot more.
Inline (compressed) format:
span.base_or_index == span_data.lo
span.len_or_tag == len == span_data.hi - span_data.lo
(must be<= MAX_LEN
)span.ctxt == span_data.ctxt
(must be<= MAX_CTXT
)
Interned format:
span.base_or_index == index
(indexes into the interner table)span.len_or_tag == LEN_TAG
(high bit set, all other bits are zero)span.ctxt == 0
The inline form uses 0 for the tag value (rather than 1) so that we don't need to mask out the tag bit when getting the length, and so that the dummy span can be all zeroes.
Notes about the choice of field sizes:
base
is 32 bits in bothSpan
andSpanData
, which means thatbase
values never cause interning. The number of bits needed forbase
depends on the crate size. 32 bits allows up to 4 GiB of code in a crate.script-servo
is the largest crate inrustc-perf
, requiring 26 bits for some spans.len
is 15 bits inSpan
(a u16, minus 1 bit for the tag) and 32 bits inSpanData
, which means that largelen
values will cause interning. The number of bits needed forlen
does not depend on the crate size. The most common number of bits forlen
are 0--7, with a peak usually at 3 or 4, and then it drops off quickly from 8 onwards. 15 bits is enough for 99.99%+ of cases, but larger values (sometimes 20+ bits) might occur dozens of times in a typical crate.ctxt
is 16 bits inSpan
and 32 bits inSpanData
, which means that largectxt
values will cause interning. The number of bits needed forctxt
values depend partly on the crate size and partly on the form of the code. No crates inrustc-perf
need more than 15 bits forctxt
, but larger crates might need more than 16 bits.
Methods
impl Span
[src]
pub fn fresh_expansion(self, expn_data: ExpnData) -> Span
[src]
Creates a fresh expansion with given properties. Expansions are normally created by macros, but in some cases expansions are created for other compiler-generated code to set per-span properties like allowed unstable features. The returned span belongs to the created expansion and has the new properties, but its location is inherited from the current span.
pub fn fresh_expansion_with_transparency(
self,
expn_data: ExpnData,
transparency: Transparency
) -> Span
[src]
self,
expn_data: ExpnData,
transparency: Transparency
) -> Span
impl Span
[src]
pub fn new(lo: BytePos, hi: BytePos, ctxt: SyntaxContext) -> Self
[src]
pub fn data(self) -> SpanData
[src]
impl Span
[src]
pub fn lo(self) -> BytePos
[src]
pub fn with_lo(self, lo: BytePos) -> Span
[src]
pub fn hi(self) -> BytePos
[src]
pub fn with_hi(self, hi: BytePos) -> Span
[src]
pub fn ctxt(self) -> SyntaxContext
[src]
pub fn with_ctxt(self, ctxt: SyntaxContext) -> Span
[src]
pub fn is_dummy(self) -> bool
[src]
Returns true
if this is a dummy span with any hygienic context.
pub fn from_expansion(self) -> bool
[src]
Returns true
if this span comes from a macro or desugaring.
pub fn in_derive_expansion(self) -> bool
[src]
Returns true
if span
originates in a derive-macro's expansion.
pub fn with_root_ctxt(lo: BytePos, hi: BytePos) -> Span
[src]
pub fn shrink_to_lo(self) -> Span
[src]
Returns a new span representing an empty span at the beginning of this span
pub fn shrink_to_hi(self) -> Span
[src]
Returns a new span representing an empty span at the end of this span.
pub fn substitute_dummy(self, other: Span) -> Span
[src]
Returns self
if self
is not the dummy span, and other
otherwise.
pub fn contains(self, other: Span) -> bool
[src]
Returns true
if self
fully encloses other
.
pub fn overlaps(self, other: Span) -> bool
[src]
Returns true
if self
touches other
.
pub fn source_equal(&self, other: &Span) -> bool
[src]
Returns true
if the spans are equal with regards to the source text.
Use this instead of ==
when either span could be generated code,
and you only care that they point to the same bytes of source text.
pub fn trim_start(self, other: Span) -> Option<Span>
[src]
Returns Some(span)
, where the start is trimmed by the end of other
.
pub fn source_callsite(self) -> Span
[src]
Returns the source span -- this is either the supplied span, or the span for the macro callsite that expanded to it.
pub fn parent(self) -> Option<Span>
[src]
The Span
for the tokens in the previous macro expansion from which self
was generated,
if any.
pub fn edition(self) -> Edition
[src]
Edition of the crate from which this span came.
pub fn rust_2015(&self) -> bool
[src]
pub fn rust_2018(&self) -> bool
[src]
pub fn source_callee(self) -> Option<ExpnData>
[src]
Returns the source callee.
Returns None
if the supplied span has no expansion trace,
else returns the ExpnData
for the macro definition
corresponding to the source callsite.
pub fn allows_unstable(&self, feature: Symbol) -> bool
[src]
Checks if a span is "internal" to a macro in which #[unstable]
items can be used (that is, a macro marked with
#[allow_internal_unstable]
).
pub fn is_desugaring(&self, kind: DesugaringKind) -> bool
[src]
Checks if this span arises from a compiler desugaring of kind kind
.
pub fn desugaring_kind(&self) -> Option<DesugaringKind>
[src]
Returns the compiler desugaring that created this span, or None
if this span is not from a desugaring.
pub fn allows_unsafe(&self) -> bool
[src]
Checks if a span is "internal" to a macro in which unsafe
can be used without triggering the unsafe_code
lint
pub fn macro_backtrace(self) -> impl Iterator<Item = ExpnData>
[src]
pub fn to(self, end: Span) -> Span
[src]
Returns a Span
that would enclose both self
and end
.
pub fn between(self, end: Span) -> Span
[src]
Returns a Span
between the end of self
to the beginning of end
.
pub fn until(self, end: Span) -> Span
[src]
Returns a Span
between the beginning of self
to the beginning of end
.
pub fn from_inner(self, inner: InnerSpan) -> Span
[src]
pub fn with_def_site_ctxt(self, expn_id: ExpnId) -> Span
[src]
Equivalent of Span::def_site
from the proc macro API,
except that the location is taken from the self
span.
pub fn with_call_site_ctxt(&self, expn_id: ExpnId) -> Span
[src]
Equivalent of Span::call_site
from the proc macro API,
except that the location is taken from the self
span.
pub fn with_mixed_site_ctxt(&self, expn_id: ExpnId) -> Span
[src]
Equivalent of Span::mixed_site
from the proc macro API,
except that the location is taken from the self
span.
pub fn with_ctxt_from_mark(
self,
expn_id: ExpnId,
transparency: Transparency
) -> Span
[src]
self,
expn_id: ExpnId,
transparency: Transparency
) -> Span
Produces a span with the same location as self
and context produced by a macro with the
given ID and transparency, assuming that macro was defined directly and not produced by
some other macro (which is the case for built-in and procedural macros).
pub fn apply_mark(self, expn_id: ExpnId, transparency: Transparency) -> Span
[src]
pub fn remove_mark(&mut self) -> ExpnId
[src]
pub fn adjust(&mut self, expn_id: ExpnId) -> Option<ExpnId>
[src]
pub fn modernize_and_adjust(&mut self, expn_id: ExpnId) -> Option<ExpnId>
[src]
pub fn glob_adjust(
&mut self,
expn_id: ExpnId,
glob_span: Span
) -> Option<Option<ExpnId>>
[src]
&mut self,
expn_id: ExpnId,
glob_span: Span
) -> Option<Option<ExpnId>>
pub fn reverse_glob_adjust(
&mut self,
expn_id: ExpnId,
glob_span: Span
) -> Option<Option<ExpnId>>
[src]
&mut self,
expn_id: ExpnId,
glob_span: Span
) -> Option<Option<ExpnId>>
pub fn modern(self) -> Span
[src]
pub fn modern_and_legacy(self) -> Span
[src]
Trait Implementations
impl Clone for Span
[src]
impl Copy for Span
[src]
impl Debug for Span
[src]
impl Default for Span
[src]
impl Eq for Span
[src]
impl From<Span> for MultiSpan
[src]
impl Hash for Span
[src]
fn hash<__H: Hasher>(&self, state: &mut __H)
[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<CTX> HashStable<CTX> for Span where
CTX: HashStableContext,
[src]
CTX: HashStableContext,
fn hash_stable(&self, ctx: &mut CTX, hasher: &mut StableHasher)
[src]
Hashes a span in a stable way. We can't directly hash the span's BytePos
fields (that would be similar to hashing pointers, since those are just
offsets into the SourceMap
). Instead, we hash the (file name, line, column)
triple, which stays the same even if the containing SourceFile
has moved
within the SourceMap
.
Also note that we are hashing byte offsets for the column, not unicode
codepoint offsets. For the purpose of the hash that's sufficient.
Also, hashing filenames is expensive so we avoid doing it twice when the
span starts and ends in the same file, which is almost always the case.
impl Ord for Span
[src]
fn cmp(&self, rhs: &Self) -> Ordering
[src]
#[must_use]
fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]
fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]
fn clamp(self, min: Self, max: Self) -> Self
[src]
impl PartialEq<Span> for Span
[src]
impl PartialOrd<Span> for Span
[src]
fn partial_cmp(&self, rhs: &Self) -> Option<Ordering>
[src]
#[must_use]
fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]
fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]
fn gt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]
fn ge(&self, other: &Rhs) -> bool
1.0.0[src]
impl !Send for Span
[src]
impl StructuralEq for Span
[src]
impl StructuralPartialEq for Span
[src]
impl !Sync for Span
[src]
impl UseSpecializedDecodable for Span
[src]
impl UseSpecializedEncodable for Span
[src]
Auto Trait Implementations
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<'a, T> Captures<'a> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Decodable for T where
T: UseSpecializedDecodable,
[src]
T: UseSpecializedDecodable,
impl<T> Encodable for T where
T: UseSpecializedEncodable + ?Sized,
[src]
T: UseSpecializedEncodable + ?Sized,
impl<Q, K> Equivalent<K> for Q where
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
[src]
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
fn equivalent(&self, key: &K) -> bool
[src]
impl<T> Erased for T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<E> SpecializationError for E
[src]
default fn not_found<S, T>(
trait_name: &'static str,
method_name: &'static str
) -> E where
T: ?Sized,
[src]
trait_name: &'static str,
method_name: &'static str
) -> E where
T: ?Sized,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,