aboutsummaryrefslogtreecommitdiff
path: root/crates/ra_ide/src/syntax_highlighting.rs
diff options
context:
space:
mode:
Diffstat (limited to 'crates/ra_ide/src/syntax_highlighting.rs')
-rw-r--r--crates/ra_ide/src/syntax_highlighting.rs822
1 files changed, 0 insertions, 822 deletions
diff --git a/crates/ra_ide/src/syntax_highlighting.rs b/crates/ra_ide/src/syntax_highlighting.rs
deleted file mode 100644
index f71b804fe..000000000
--- a/crates/ra_ide/src/syntax_highlighting.rs
+++ /dev/null
@@ -1,822 +0,0 @@
1mod tags;
2mod html;
3mod injection;
4#[cfg(test)]
5mod tests;
6
7use hir::{Name, Semantics, VariantDef};
8use ra_ide_db::{
9 defs::{classify_name, classify_name_ref, Definition, NameClass, NameRefClass},
10 RootDatabase,
11};
12use ra_prof::profile;
13use ra_syntax::{
14 ast::{self, HasFormatSpecifier},
15 AstNode, AstToken, Direction, NodeOrToken, SyntaxElement,
16 SyntaxKind::*,
17 TextRange, WalkEvent, T,
18};
19use rustc_hash::FxHashMap;
20
21use crate::FileId;
22
23use ast::FormatSpecifier;
24pub(crate) use html::highlight_as_html;
25pub use tags::{Highlight, HighlightModifier, HighlightModifiers, HighlightTag};
26
27#[derive(Debug, Clone)]
28pub struct HighlightedRange {
29 pub range: TextRange,
30 pub highlight: Highlight,
31 pub binding_hash: Option<u64>,
32}
33
34// Feature: Semantic Syntax Highlighting
35//
36// rust-analyzer highlights the code semantically.
37// For example, `bar` in `foo::Bar` might be colored differently depending on whether `Bar` is an enum or a trait.
38// rust-analyzer does not specify colors directly, instead it assigns tag (like `struct`) and a set of modifiers (like `declaration`) to each token.
39// It's up to the client to map those to specific colors.
40//
41// The general rule is that a reference to an entity gets colored the same way as the entity itself.
42// We also give special modifier for `mut` and `&mut` local variables.
43pub(crate) fn highlight(
44 db: &RootDatabase,
45 file_id: FileId,
46 range_to_highlight: Option<TextRange>,
47 syntactic_name_ref_highlighting: bool,
48) -> Vec<HighlightedRange> {
49 let _p = profile("highlight");
50 let sema = Semantics::new(db);
51
52 // Determine the root based on the given range.
53 let (root, range_to_highlight) = {
54 let source_file = sema.parse(file_id);
55 match range_to_highlight {
56 Some(range) => {
57 let node = match source_file.syntax().covering_element(range) {
58 NodeOrToken::Node(it) => it,
59 NodeOrToken::Token(it) => it.parent(),
60 };
61 (node, range)
62 }
63 None => (source_file.syntax().clone(), source_file.syntax().text_range()),
64 }
65 };
66
67 let mut bindings_shadow_count: FxHashMap<Name, u32> = FxHashMap::default();
68 // We use a stack for the DFS traversal below.
69 // When we leave a node, the we use it to flatten the highlighted ranges.
70 let mut stack = HighlightedRangeStack::new();
71
72 let mut current_macro_call: Option<ast::MacroCall> = None;
73 let mut format_string: Option<SyntaxElement> = None;
74
75 // Walk all nodes, keeping track of whether we are inside a macro or not.
76 // If in macro, expand it first and highlight the expanded code.
77 for event in root.preorder_with_tokens() {
78 match &event {
79 WalkEvent::Enter(_) => stack.push(),
80 WalkEvent::Leave(_) => stack.pop(),
81 };
82
83 let event_range = match &event {
84 WalkEvent::Enter(it) => it.text_range(),
85 WalkEvent::Leave(it) => it.text_range(),
86 };
87
88 // Element outside of the viewport, no need to highlight
89 if range_to_highlight.intersect(event_range).is_none() {
90 continue;
91 }
92
93 // Track "inside macro" state
94 match event.clone().map(|it| it.into_node().and_then(ast::MacroCall::cast)) {
95 WalkEvent::Enter(Some(mc)) => {
96 current_macro_call = Some(mc.clone());
97 if let Some(range) = macro_call_range(&mc) {
98 stack.add(HighlightedRange {
99 range,
100 highlight: HighlightTag::Macro.into(),
101 binding_hash: None,
102 });
103 }
104 if let Some(name) = mc.is_macro_rules() {
105 if let Some((highlight, binding_hash)) = highlight_element(
106 &sema,
107 &mut bindings_shadow_count,
108 syntactic_name_ref_highlighting,
109 name.syntax().clone().into(),
110 ) {
111 stack.add(HighlightedRange {
112 range: name.syntax().text_range(),
113 highlight,
114 binding_hash,
115 });
116 }
117 }
118 continue;
119 }
120 WalkEvent::Leave(Some(mc)) => {
121 assert!(current_macro_call == Some(mc));
122 current_macro_call = None;
123 format_string = None;
124 }
125 _ => (),
126 }
127
128 // Check for Rust code in documentation
129 match &event {
130 WalkEvent::Leave(NodeOrToken::Node(node)) => {
131 if let Some((doctest, range_mapping, new_comments)) =
132 injection::extract_doc_comments(node)
133 {
134 injection::highlight_doc_comment(
135 doctest,
136 range_mapping,
137 new_comments,
138 &mut stack,
139 );
140 }
141 }
142 _ => (),
143 }
144
145 let element = match event {
146 WalkEvent::Enter(it) => it,
147 WalkEvent::Leave(_) => continue,
148 };
149
150 let range = element.text_range();
151
152 let element_to_highlight = if current_macro_call.is_some() && element.kind() != COMMENT {
153 // Inside a macro -- expand it first
154 let token = match element.clone().into_token() {
155 Some(it) if it.parent().kind() == TOKEN_TREE => it,
156 _ => continue,
157 };
158 let token = sema.descend_into_macros(token.clone());
159 let parent = token.parent();
160
161 // Check if macro takes a format string and remember it for highlighting later.
162 // The macros that accept a format string expand to a compiler builtin macros
163 // `format_args` and `format_args_nl`.
164 if let Some(name) = parent
165 .parent()
166 .and_then(ast::MacroCall::cast)
167 .and_then(|mc| mc.path())
168 .and_then(|p| p.segment())
169 .and_then(|s| s.name_ref())
170 {
171 match name.text().as_str() {
172 "format_args" | "format_args_nl" => {
173 format_string = parent
174 .children_with_tokens()
175 .filter(|t| t.kind() != WHITESPACE)
176 .nth(1)
177 .filter(|e| {
178 ast::String::can_cast(e.kind())
179 || ast::RawString::can_cast(e.kind())
180 })
181 }
182 _ => {}
183 }
184 }
185
186 // We only care Name and Name_ref
187 match (token.kind(), parent.kind()) {
188 (IDENT, NAME) | (IDENT, NAME_REF) => parent.into(),
189 _ => token.into(),
190 }
191 } else {
192 element.clone()
193 };
194
195 if let Some(token) = element.as_token().cloned().and_then(ast::RawString::cast) {
196 let expanded = element_to_highlight.as_token().unwrap().clone();
197 if injection::highlight_injection(&mut stack, &sema, token, expanded).is_some() {
198 continue;
199 }
200 }
201
202 let is_format_string = format_string.as_ref() == Some(&element_to_highlight);
203
204 if let Some((highlight, binding_hash)) = highlight_element(
205 &sema,
206 &mut bindings_shadow_count,
207 syntactic_name_ref_highlighting,
208 element_to_highlight.clone(),
209 ) {
210 stack.add(HighlightedRange { range, highlight, binding_hash });
211 if let Some(string) =
212 element_to_highlight.as_token().cloned().and_then(ast::String::cast)
213 {
214 if is_format_string {
215 stack.push();
216 string.lex_format_specifier(|piece_range, kind| {
217 if let Some(highlight) = highlight_format_specifier(kind) {
218 stack.add(HighlightedRange {
219 range: piece_range + range.start(),
220 highlight: highlight.into(),
221 binding_hash: None,
222 });
223 }
224 });
225 stack.pop();
226 }
227 // Highlight escape sequences
228 if let Some(char_ranges) = string.char_ranges() {
229 stack.push();
230 for (piece_range, _) in char_ranges.iter().filter(|(_, char)| char.is_ok()) {
231 if string.text()[piece_range.start().into()..].starts_with('\\') {
232 stack.add(HighlightedRange {
233 range: piece_range + range.start(),
234 highlight: HighlightTag::EscapeSequence.into(),
235 binding_hash: None,
236 });
237 }
238 }
239 stack.pop_and_inject(None);
240 }
241 } else if let Some(string) =
242 element_to_highlight.as_token().cloned().and_then(ast::RawString::cast)
243 {
244 if is_format_string {
245 stack.push();
246 string.lex_format_specifier(|piece_range, kind| {
247 if let Some(highlight) = highlight_format_specifier(kind) {
248 stack.add(HighlightedRange {
249 range: piece_range + range.start(),
250 highlight: highlight.into(),
251 binding_hash: None,
252 });
253 }
254 });
255 stack.pop();
256 }
257 }
258 }
259 }
260
261 stack.flattened()
262}
263
264#[derive(Debug)]
265struct HighlightedRangeStack {
266 stack: Vec<Vec<HighlightedRange>>,
267}
268
269/// We use a stack to implement the flattening logic for the highlighted
270/// syntax ranges.
271impl HighlightedRangeStack {
272 fn new() -> Self {
273 Self { stack: vec![Vec::new()] }
274 }
275
276 fn push(&mut self) {
277 self.stack.push(Vec::new());
278 }
279
280 /// Flattens the highlighted ranges.
281 ///
282 /// For example `#[cfg(feature = "foo")]` contains the nested ranges:
283 /// 1) parent-range: Attribute [0, 23)
284 /// 2) child-range: String [16, 21)
285 ///
286 /// The following code implements the flattening, for our example this results to:
287 /// `[Attribute [0, 16), String [16, 21), Attribute [21, 23)]`
288 fn pop(&mut self) {
289 let children = self.stack.pop().unwrap();
290 let prev = self.stack.last_mut().unwrap();
291 let needs_flattening = !children.is_empty()
292 && !prev.is_empty()
293 && prev.last().unwrap().range.contains_range(children.first().unwrap().range);
294 if !needs_flattening {
295 prev.extend(children);
296 } else {
297 let mut parent = prev.pop().unwrap();
298 for ele in children {
299 assert!(parent.range.contains_range(ele.range));
300
301 let cloned = Self::intersect(&mut parent, &ele);
302 if !parent.range.is_empty() {
303 prev.push(parent);
304 }
305 prev.push(ele);
306 parent = cloned;
307 }
308 if !parent.range.is_empty() {
309 prev.push(parent);
310 }
311 }
312 }
313
314 /// Intersects the `HighlightedRange` `parent` with `child`.
315 /// `parent` is mutated in place, becoming the range before `child`.
316 /// Returns the range (of the same type as `parent`) *after* `child`.
317 fn intersect(parent: &mut HighlightedRange, child: &HighlightedRange) -> HighlightedRange {
318 assert!(parent.range.contains_range(child.range));
319
320 let mut cloned = parent.clone();
321 parent.range = TextRange::new(parent.range.start(), child.range.start());
322 cloned.range = TextRange::new(child.range.end(), cloned.range.end());
323
324 cloned
325 }
326
327 /// Remove the `HighlightRange` of `parent` that's currently covered by `child`.
328 fn intersect_partial(parent: &mut HighlightedRange, child: &HighlightedRange) {
329 assert!(
330 parent.range.start() <= child.range.start()
331 && parent.range.end() >= child.range.start()
332 && child.range.end() > parent.range.end()
333 );
334
335 parent.range = TextRange::new(parent.range.start(), child.range.start());
336 }
337
338 /// Similar to `pop`, but can modify arbitrary prior ranges (where `pop`)
339 /// can only modify the last range currently on the stack.
340 /// Can be used to do injections that span multiple ranges, like the
341 /// doctest injection below.
342 /// If `overwrite_parent` is non-optional, the highlighting of the parent range
343 /// is overwritten with the argument.
344 ///
345 /// Note that `pop` can be simulated by `pop_and_inject(false)` but the
346 /// latter is computationally more expensive.
347 fn pop_and_inject(&mut self, overwrite_parent: Option<Highlight>) {
348 let mut children = self.stack.pop().unwrap();
349 let prev = self.stack.last_mut().unwrap();
350 children.sort_by_key(|range| range.range.start());
351 prev.sort_by_key(|range| range.range.start());
352
353 for child in children {
354 if let Some(idx) =
355 prev.iter().position(|parent| parent.range.contains_range(child.range))
356 {
357 if let Some(tag) = overwrite_parent {
358 prev[idx].highlight = tag;
359 }
360
361 let cloned = Self::intersect(&mut prev[idx], &child);
362 let insert_idx = if prev[idx].range.is_empty() {
363 prev.remove(idx);
364 idx
365 } else {
366 idx + 1
367 };
368 prev.insert(insert_idx, child);
369 if !cloned.range.is_empty() {
370 prev.insert(insert_idx + 1, cloned);
371 }
372 } else {
373 let maybe_idx =
374 prev.iter().position(|parent| parent.range.contains(child.range.start()));
375 match (overwrite_parent, maybe_idx) {
376 (Some(_), Some(idx)) => {
377 Self::intersect_partial(&mut prev[idx], &child);
378 let insert_idx = if prev[idx].range.is_empty() {
379 prev.remove(idx);
380 idx
381 } else {
382 idx + 1
383 };
384 prev.insert(insert_idx, child);
385 }
386 (_, None) => {
387 let idx = prev
388 .binary_search_by_key(&child.range.start(), |range| range.range.start())
389 .unwrap_or_else(|x| x);
390 prev.insert(idx, child);
391 }
392 _ => {
393 unreachable!("child range should be completely contained in parent range");
394 }
395 }
396 }
397 }
398 }
399
400 fn add(&mut self, range: HighlightedRange) {
401 self.stack
402 .last_mut()
403 .expect("during DFS traversal, the stack must not be empty")
404 .push(range)
405 }
406
407 fn flattened(mut self) -> Vec<HighlightedRange> {
408 assert_eq!(
409 self.stack.len(),
410 1,
411 "after DFS traversal, the stack should only contain a single element"
412 );
413 let mut res = self.stack.pop().unwrap();
414 res.sort_by_key(|range| range.range.start());
415 // Check that ranges are sorted and disjoint
416 assert!(res
417 .iter()
418 .zip(res.iter().skip(1))
419 .all(|(left, right)| left.range.end() <= right.range.start()));
420 res
421 }
422}
423
424fn highlight_format_specifier(kind: FormatSpecifier) -> Option<HighlightTag> {
425 Some(match kind {
426 FormatSpecifier::Open
427 | FormatSpecifier::Close
428 | FormatSpecifier::Colon
429 | FormatSpecifier::Fill
430 | FormatSpecifier::Align
431 | FormatSpecifier::Sign
432 | FormatSpecifier::NumberSign
433 | FormatSpecifier::DollarSign
434 | FormatSpecifier::Dot
435 | FormatSpecifier::Asterisk
436 | FormatSpecifier::QuestionMark => HighlightTag::FormatSpecifier,
437 FormatSpecifier::Integer | FormatSpecifier::Zero => HighlightTag::NumericLiteral,
438 FormatSpecifier::Identifier => HighlightTag::Local,
439 })
440}
441
442fn macro_call_range(macro_call: &ast::MacroCall) -> Option<TextRange> {
443 let path = macro_call.path()?;
444 let name_ref = path.segment()?.name_ref()?;
445
446 let range_start = name_ref.syntax().text_range().start();
447 let mut range_end = name_ref.syntax().text_range().end();
448 for sibling in path.syntax().siblings_with_tokens(Direction::Next) {
449 match sibling.kind() {
450 T![!] | IDENT => range_end = sibling.text_range().end(),
451 _ => (),
452 }
453 }
454
455 Some(TextRange::new(range_start, range_end))
456}
457
458fn is_possibly_unsafe(name_ref: &ast::NameRef) -> bool {
459 name_ref
460 .syntax()
461 .parent()
462 .and_then(|parent| {
463 ast::FieldExpr::cast(parent.clone())
464 .map(|_| true)
465 .or_else(|| ast::RecordPatField::cast(parent).map(|_| true))
466 })
467 .unwrap_or(false)
468}
469
470fn highlight_element(
471 sema: &Semantics<RootDatabase>,
472 bindings_shadow_count: &mut FxHashMap<Name, u32>,
473 syntactic_name_ref_highlighting: bool,
474 element: SyntaxElement,
475) -> Option<(Highlight, Option<u64>)> {
476 let db = sema.db;
477 let mut binding_hash = None;
478 let highlight: Highlight = match element.kind() {
479 FN => {
480 bindings_shadow_count.clear();
481 return None;
482 }
483
484 // Highlight definitions depending on the "type" of the definition.
485 NAME => {
486 let name = element.into_node().and_then(ast::Name::cast).unwrap();
487 let name_kind = classify_name(sema, &name);
488
489 if let Some(NameClass::Definition(Definition::Local(local))) = &name_kind {
490 if let Some(name) = local.name(db) {
491 let shadow_count = bindings_shadow_count.entry(name.clone()).or_default();
492 *shadow_count += 1;
493 binding_hash = Some(calc_binding_hash(&name, *shadow_count))
494 }
495 };
496
497 match name_kind {
498 Some(NameClass::Definition(def)) => {
499 highlight_name(db, def, false) | HighlightModifier::Definition
500 }
501 Some(NameClass::ConstReference(def)) => highlight_name(db, def, false),
502 Some(NameClass::FieldShorthand { field, .. }) => {
503 let mut h = HighlightTag::Field.into();
504 if let Definition::Field(field) = field {
505 if let VariantDef::Union(_) = field.parent_def(db) {
506 h |= HighlightModifier::Unsafe;
507 }
508 }
509
510 h
511 }
512 None => highlight_name_by_syntax(name) | HighlightModifier::Definition,
513 }
514 }
515
516 // Highlight references like the definitions they resolve to
517 NAME_REF if element.ancestors().any(|it| it.kind() == ATTR) => {
518 Highlight::from(HighlightTag::Function) | HighlightModifier::Attribute
519 }
520 NAME_REF => {
521 let name_ref = element.into_node().and_then(ast::NameRef::cast).unwrap();
522 let possibly_unsafe = is_possibly_unsafe(&name_ref);
523 match classify_name_ref(sema, &name_ref) {
524 Some(name_kind) => match name_kind {
525 NameRefClass::Definition(def) => {
526 if let Definition::Local(local) = &def {
527 if let Some(name) = local.name(db) {
528 let shadow_count =
529 bindings_shadow_count.entry(name.clone()).or_default();
530 binding_hash = Some(calc_binding_hash(&name, *shadow_count))
531 }
532 };
533 highlight_name(db, def, possibly_unsafe)
534 }
535 NameRefClass::FieldShorthand { .. } => HighlightTag::Field.into(),
536 },
537 None if syntactic_name_ref_highlighting => {
538 highlight_name_ref_by_syntax(name_ref, sema)
539 }
540 None => HighlightTag::UnresolvedReference.into(),
541 }
542 }
543
544 // Simple token-based highlighting
545 COMMENT => {
546 let comment = element.into_token().and_then(ast::Comment::cast)?;
547 let h = HighlightTag::Comment;
548 match comment.kind().doc {
549 Some(_) => h | HighlightModifier::Documentation,
550 None => h.into(),
551 }
552 }
553 STRING | RAW_STRING | RAW_BYTE_STRING | BYTE_STRING => HighlightTag::StringLiteral.into(),
554 ATTR => HighlightTag::Attribute.into(),
555 INT_NUMBER | FLOAT_NUMBER => HighlightTag::NumericLiteral.into(),
556 BYTE => HighlightTag::ByteLiteral.into(),
557 CHAR => HighlightTag::CharLiteral.into(),
558 QUESTION => Highlight::new(HighlightTag::Operator) | HighlightModifier::ControlFlow,
559 LIFETIME => {
560 let h = Highlight::new(HighlightTag::Lifetime);
561 match element.parent().map(|it| it.kind()) {
562 Some(LIFETIME_PARAM) | Some(LABEL) => h | HighlightModifier::Definition,
563 _ => h,
564 }
565 }
566 p if p.is_punct() => match p {
567 T![::] | T![->] | T![=>] | T![&] | T![..] | T![=] | T![@] => {
568 HighlightTag::Operator.into()
569 }
570 T![!] if element.parent().and_then(ast::MacroCall::cast).is_some() => {
571 HighlightTag::Macro.into()
572 }
573 T![*] if element.parent().and_then(ast::PtrType::cast).is_some() => {
574 HighlightTag::Keyword.into()
575 }
576 T![*] if element.parent().and_then(ast::PrefixExpr::cast).is_some() => {
577 let prefix_expr = element.parent().and_then(ast::PrefixExpr::cast)?;
578
579 let expr = prefix_expr.expr()?;
580 let ty = sema.type_of_expr(&expr)?;
581 if ty.is_raw_ptr() {
582 HighlightTag::Operator | HighlightModifier::Unsafe
583 } else if let Some(ast::PrefixOp::Deref) = prefix_expr.op_kind() {
584 HighlightTag::Operator.into()
585 } else {
586 HighlightTag::Punctuation.into()
587 }
588 }
589 T![-] if element.parent().and_then(ast::PrefixExpr::cast).is_some() => {
590 HighlightTag::NumericLiteral.into()
591 }
592 _ if element.parent().and_then(ast::PrefixExpr::cast).is_some() => {
593 HighlightTag::Operator.into()
594 }
595 _ if element.parent().and_then(ast::BinExpr::cast).is_some() => {
596 HighlightTag::Operator.into()
597 }
598 _ if element.parent().and_then(ast::RangeExpr::cast).is_some() => {
599 HighlightTag::Operator.into()
600 }
601 _ if element.parent().and_then(ast::RangePat::cast).is_some() => {
602 HighlightTag::Operator.into()
603 }
604 _ if element.parent().and_then(ast::RestPat::cast).is_some() => {
605 HighlightTag::Operator.into()
606 }
607 _ if element.parent().and_then(ast::Attr::cast).is_some() => {
608 HighlightTag::Attribute.into()
609 }
610 _ => HighlightTag::Punctuation.into(),
611 },
612
613 k if k.is_keyword() => {
614 let h = Highlight::new(HighlightTag::Keyword);
615 match k {
616 T![break]
617 | T![continue]
618 | T![else]
619 | T![if]
620 | T![loop]
621 | T![match]
622 | T![return]
623 | T![while]
624 | T![in] => h | HighlightModifier::ControlFlow,
625 T![for] if !is_child_of_impl(&element) => h | HighlightModifier::ControlFlow,
626 T![unsafe] => h | HighlightModifier::Unsafe,
627 T![true] | T![false] => HighlightTag::BoolLiteral.into(),
628 T![self] => {
629 let self_param_is_mut = element
630 .parent()
631 .and_then(ast::SelfParam::cast)
632 .and_then(|p| p.mut_token())
633 .is_some();
634 // closure to enforce lazyness
635 let self_path = || {
636 sema.resolve_path(&element.parent()?.parent().and_then(ast::Path::cast)?)
637 };
638 if self_param_is_mut
639 || matches!(self_path(),
640 Some(hir::PathResolution::Local(local))
641 if local.is_self(db)
642 && (local.is_mut(db) || local.ty(db).is_mutable_reference())
643 )
644 {
645 HighlightTag::SelfKeyword | HighlightModifier::Mutable
646 } else {
647 HighlightTag::SelfKeyword.into()
648 }
649 }
650 _ => h,
651 }
652 }
653
654 _ => return None,
655 };
656
657 return Some((highlight, binding_hash));
658
659 fn calc_binding_hash(name: &Name, shadow_count: u32) -> u64 {
660 fn hash<T: std::hash::Hash + std::fmt::Debug>(x: T) -> u64 {
661 use std::{collections::hash_map::DefaultHasher, hash::Hasher};
662
663 let mut hasher = DefaultHasher::new();
664 x.hash(&mut hasher);
665 hasher.finish()
666 }
667
668 hash((name, shadow_count))
669 }
670}
671
672fn is_child_of_impl(element: &SyntaxElement) -> bool {
673 match element.parent() {
674 Some(e) => e.kind() == IMPL,
675 _ => false,
676 }
677}
678
679fn highlight_name(db: &RootDatabase, def: Definition, possibly_unsafe: bool) -> Highlight {
680 match def {
681 Definition::Macro(_) => HighlightTag::Macro,
682 Definition::Field(field) => {
683 let mut h = HighlightTag::Field.into();
684 if possibly_unsafe {
685 if let VariantDef::Union(_) = field.parent_def(db) {
686 h |= HighlightModifier::Unsafe;
687 }
688 }
689
690 return h;
691 }
692 Definition::ModuleDef(def) => match def {
693 hir::ModuleDef::Module(_) => HighlightTag::Module,
694 hir::ModuleDef::Function(func) => {
695 let mut h = HighlightTag::Function.into();
696 if func.is_unsafe(db) {
697 h |= HighlightModifier::Unsafe;
698 }
699 return h;
700 }
701 hir::ModuleDef::Adt(hir::Adt::Struct(_)) => HighlightTag::Struct,
702 hir::ModuleDef::Adt(hir::Adt::Enum(_)) => HighlightTag::Enum,
703 hir::ModuleDef::Adt(hir::Adt::Union(_)) => HighlightTag::Union,
704 hir::ModuleDef::EnumVariant(_) => HighlightTag::EnumVariant,
705 hir::ModuleDef::Const(_) => HighlightTag::Constant,
706 hir::ModuleDef::Trait(_) => HighlightTag::Trait,
707 hir::ModuleDef::TypeAlias(_) => HighlightTag::TypeAlias,
708 hir::ModuleDef::BuiltinType(_) => HighlightTag::BuiltinType,
709 hir::ModuleDef::Static(s) => {
710 let mut h = Highlight::new(HighlightTag::Static);
711 if s.is_mut(db) {
712 h |= HighlightModifier::Mutable;
713 h |= HighlightModifier::Unsafe;
714 }
715 return h;
716 }
717 },
718 Definition::SelfType(_) => HighlightTag::SelfType,
719 Definition::TypeParam(_) => HighlightTag::TypeParam,
720 Definition::Local(local) => {
721 let tag =
722 if local.is_param(db) { HighlightTag::ValueParam } else { HighlightTag::Local };
723 let mut h = Highlight::new(tag);
724 if local.is_mut(db) || local.ty(db).is_mutable_reference() {
725 h |= HighlightModifier::Mutable;
726 }
727 return h;
728 }
729 }
730 .into()
731}
732
733fn highlight_name_by_syntax(name: ast::Name) -> Highlight {
734 let default = HighlightTag::UnresolvedReference;
735
736 let parent = match name.syntax().parent() {
737 Some(it) => it,
738 _ => return default.into(),
739 };
740
741 let tag = match parent.kind() {
742 STRUCT => HighlightTag::Struct,
743 ENUM => HighlightTag::Enum,
744 UNION => HighlightTag::Union,
745 TRAIT => HighlightTag::Trait,
746 TYPE_ALIAS => HighlightTag::TypeAlias,
747 TYPE_PARAM => HighlightTag::TypeParam,
748 RECORD_FIELD => HighlightTag::Field,
749 MODULE => HighlightTag::Module,
750 FN => HighlightTag::Function,
751 CONST => HighlightTag::Constant,
752 STATIC => HighlightTag::Static,
753 VARIANT => HighlightTag::EnumVariant,
754 IDENT_PAT => HighlightTag::Local,
755 _ => default,
756 };
757
758 tag.into()
759}
760
761fn highlight_name_ref_by_syntax(name: ast::NameRef, sema: &Semantics<RootDatabase>) -> Highlight {
762 let default = HighlightTag::UnresolvedReference;
763
764 let parent = match name.syntax().parent() {
765 Some(it) => it,
766 _ => return default.into(),
767 };
768
769 let tag = match parent.kind() {
770 METHOD_CALL_EXPR => HighlightTag::Function,
771 FIELD_EXPR => {
772 let h = HighlightTag::Field;
773 let is_union = ast::FieldExpr::cast(parent)
774 .and_then(|field_expr| {
775 let field = sema.resolve_field(&field_expr)?;
776 Some(if let VariantDef::Union(_) = field.parent_def(sema.db) {
777 true
778 } else {
779 false
780 })
781 })
782 .unwrap_or(false);
783 return if is_union { h | HighlightModifier::Unsafe } else { h.into() };
784 }
785 PATH_SEGMENT => {
786 let path = match parent.parent().and_then(ast::Path::cast) {
787 Some(it) => it,
788 _ => return default.into(),
789 };
790 let expr = match path.syntax().parent().and_then(ast::PathExpr::cast) {
791 Some(it) => it,
792 _ => {
793 // within path, decide whether it is module or adt by checking for uppercase name
794 return if name.text().chars().next().unwrap_or_default().is_uppercase() {
795 HighlightTag::Struct
796 } else {
797 HighlightTag::Module
798 }
799 .into();
800 }
801 };
802 let parent = match expr.syntax().parent() {
803 Some(it) => it,
804 None => return default.into(),
805 };
806
807 match parent.kind() {
808 CALL_EXPR => HighlightTag::Function,
809 _ => {
810 if name.text().chars().next().unwrap_or_default().is_uppercase() {
811 HighlightTag::Struct
812 } else {
813 HighlightTag::Constant
814 }
815 }
816 }
817 }
818 _ => default,
819 };
820
821 tag.into()
822}
generated by cgit v1.2.3 (git 2.25.1) at 2025-07-19 00:33:12 +0100