Use a helper function for creating query captures

This deduplicates some somewhat complex code between the highlight_iter
and query_iter.
pull/2857/head
Michael Davis 2 years ago
parent b4bf968503
commit 68f7b87519
No known key found for this signature in database

@ -1077,6 +1077,37 @@ thread_local! {
}) })
} }
/// Creates an iterator over the captures in a query within the given range,
/// re-using a cursor from the pool if available.
fn query_captures<'a, 'tree>(
query: &'a Query,
root: Node<'tree>,
source: RopeSlice<'a>,
range: Option<std::ops::Range<usize>>,
) -> (
QueryCursor,
QueryCaptures<'a, 'tree, RopeProvider<'a>, &'a [u8]>,
) {
// Reuse a cursor from the pool if available.
let mut cursor = PARSER.with(|ts_parser| {
let highlighter = &mut ts_parser.borrow_mut();
highlighter.cursors.pop().unwrap_or_default()
});
// The `captures` iterator borrows the `Tree` and the `QueryCursor`, which
// prevents them from being moved. But both of these values are really just
// pointers, so it's actually ok to move them.
let cursor_ref = unsafe { mem::transmute::<_, &'static mut QueryCursor>(&mut cursor) };
// if reusing cursors & no range this resets to whole range
cursor_ref.set_byte_range(range.unwrap_or(0..usize::MAX));
cursor_ref.set_match_limit(TREE_SITTER_MATCH_LIMIT);
let captures = cursor_ref.captures(query, root, RopeProvider(source));
(cursor, captures)
}
#[derive(Debug)] #[derive(Debug)]
pub struct Syntax { pub struct Syntax {
layers: HopSlotMap<LayerId, LanguageLayer>, layers: HopSlotMap<LayerId, LanguageLayer>,
@ -1429,28 +1460,13 @@ impl Syntax {
.layers .layers
.iter() .iter()
.filter_map(|(_, layer)| { .filter_map(|(_, layer)| {
// Reuse a cursor from the pool if available. let (cursor, captures) = query_captures(
let mut cursor = PARSER.with(|ts_parser| {
let highlighter = &mut ts_parser.borrow_mut();
highlighter.cursors.pop().unwrap_or_default()
});
// The `captures` iterator borrows the `Tree` and the `QueryCursor`, which
// prevents them from being moved. But both of these values are really just
// pointers, so it's actually ok to move them.
let cursor_ref =
unsafe { mem::transmute::<_, &'static mut QueryCursor>(&mut cursor) };
cursor_ref.set_byte_range(range.clone().unwrap_or(0..usize::MAX));
cursor_ref.set_match_limit(TREE_SITTER_MATCH_LIMIT);
let mut captures = cursor_ref
.captures(
query_fn(&layer.config), query_fn(&layer.config),
layer.tree().root_node(), layer.tree().root_node(),
RopeProvider(source), source,
) range.clone(),
.peekable(); );
let mut captures = captures.peekable();
// If there aren't any captures for this layer, skip the layer. // If there aren't any captures for this layer, skip the layer.
captures.peek()?; captures.peek()?;
@ -1481,34 +1497,15 @@ impl Syntax {
.filter_map(|(_, layer)| { .filter_map(|(_, layer)| {
// TODO: if range doesn't overlap layer range, skip it // TODO: if range doesn't overlap layer range, skip it
// Reuse a cursor from the pool if available. let (cursor, captures) = query_captures(
let mut cursor = PARSER.with(|ts_parser| {
let highlighter = &mut ts_parser.borrow_mut();
highlighter.cursors.pop().unwrap_or_default()
});
// The `captures` iterator borrows the `Tree` and the `QueryCursor`, which
// prevents them from being moved. But both of these values are really just
// pointers, so it's actually ok to move them.
let cursor_ref = unsafe {
mem::transmute::<&mut tree_sitter::QueryCursor, &mut tree_sitter::QueryCursor>(
&mut cursor,
)
};
// if reusing cursors & no range this resets to whole range
cursor_ref.set_byte_range(range.clone().unwrap_or(0..usize::MAX));
cursor_ref.set_match_limit(TREE_SITTER_MATCH_LIMIT);
let mut captures = cursor_ref
.captures(
&layer.config.query, &layer.config.query,
layer.tree().root_node(), layer.tree().root_node(),
RopeProvider(source), source,
) range.clone(),
.peekable(); );
let mut captures = captures.peekable();
// If there's no captures, skip the layer // If there are no captures, skip the layer
captures.peek()?; captures.peek()?;
Some(HighlightIterLayer { Some(HighlightIterLayer {

Loading…
Cancel
Save