1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867
mod program;
pub use self::program::{CheckGroup, CheckProgram, CheckSection, CheckTree};
use crate::{common::*, pattern::matcher::MatchAny};
pub struct Checker<'a> {
config: &'a Config,
interner: &'a mut StringInterner,
program: CheckProgram<'a>,
match_file: ArcSource,
}
impl<'a> Checker<'a> {
pub fn new(
config: &'a Config,
interner: &'a mut StringInterner,
program: CheckProgram<'a>,
match_file: ArcSource,
) -> Self {
Self {
config,
interner,
program,
match_file,
}
}
/// Check `source` against the rules in this [Checker]
pub fn check<S>(&mut self, source: &S) -> TestResult
where
S: NamedSourceFile + ?Sized,
{
let source = ArcSource::new(Source::new(source.name(), source.source().to_string()));
self.check_input(source)
}
/// Check `input` against the rules in this [Checker]
pub fn check_str<S>(&mut self, input: &S) -> TestResult
where
S: AsRef<str>,
{
let source = ArcSource::new(Source::from(input.as_ref().to_string()));
self.check_input(source)
}
/// Check `source` against the rules in this [Checker]
pub fn check_input(&mut self, source: ArcSource) -> TestResult {
let buffer = source.source_bytes();
let mut context = MatchContext::new(
self.config,
self.interner,
self.match_file.clone(),
source.clone(),
buffer,
);
if !self.config.allow_empty && buffer.is_empty() {
return TestResult::from_error(TestFailed::new(
vec![CheckFailedError::EmptyInput],
&context,
));
}
match discover_blocks(&self.program, &mut context) {
Ok(blocks) => check_blocks(blocks, &self.program, &mut context),
Err(failed) => TestResult::from_error(failed),
}
}
}
/// Analyze the input to identify regions of input corresponding to
/// block sections in `program`, i.e. regions delimited by CHECK-LABEL
/// directives.
///
/// This will evaluate the CHECK-LABEL patterns, and construct block
/// metadata for each region trailing a CHECK-LABEL directive.
pub fn discover_blocks<'input, 'context: 'input>(
program: &CheckProgram<'context>,
context: &mut MatchContext<'input, 'context>,
) -> Result<SmallVec<[BlockInfo; 2]>, TestFailed> {
// Traverse the code of the program and try to identify
// the byte ranges corresponding to block starts of the
// program. Once the block starts are recorded, we can
// properly constrain the search bounds of the matchers
let mut blocks = SmallVec::<[BlockInfo; 2]>::default();
let mut errors = Vec::<CheckFailedError>::new();
// We must push an implicit block for ops that come before the first CHECK-LABEL,
// if such ops exist
let eof = context.cursor().end_of_file();
if !matches!(program.sections.first(), Some(CheckSection::Block { .. })) {
blocks.push(BlockInfo {
label_info: None,
sections: Some(Range::new(
0,
program
.sections
.iter()
.take_while(|s| !matches!(s, CheckSection::Block { .. }))
.count(),
)),
start: Some(0),
end: None,
eof,
});
}
for (i, section) in program.sections.iter().enumerate() {
if let CheckSection::Block { ref label, .. } = section {
// Find the starting index of this pattern
//
// If no match is found, record the error,
// and skip ahead in the instruction stream
let buffer = context.search_to_eof();
match label.try_match(buffer, context) {
Ok(result) => {
match result.info {
Some(info) => {
// We must compute the indices for the end of the previous block,
// and the start of the current block, by looking forwards/backwards
// for the nearest newlines in those directions.
let match_start = info.span.offset();
let cursor = context.cursor_mut();
let eol = cursor.next_newline_from(match_start).unwrap_or(eof);
let prev_block_end = cursor.prev_newline_from(match_start).unwrap_or(0);
// Start subsequent searches at the newline, to ensure that rules which
// match on next lines can eat the first newline, but prevent any further
// matching of rules on this line
cursor.set_start(eol);
// Create the block info for this CHECK-LABEL to record the start index
let block_id = blocks.len();
blocks.push(BlockInfo {
label_info: Some(info.into_static()),
sections: Some(Range::new(i, i + 1)),
start: Some(cursor.start()),
end: None,
eof,
});
// Update the block info for the most recent CHECK-LABEL to record its end index,
// if one is present
if let Some(prev_block) = blocks[..block_id]
.iter_mut()
.rev()
.find(|bi| bi.start.is_some())
{
prev_block.end = Some(prev_block_end);
}
}
None => {
// The current block could not be found, so record an error
blocks.push(BlockInfo {
label_info: None,
sections: Some(Range::new(i, i + 1)),
start: None,
end: None,
eof,
});
let span = label.span();
let msg = format!(
"Unable to find a match for this pattern in the input.\
Search started at byte {}, ending at {eof}",
context.cursor().start()
);
errors.push(CheckFailedError::MatchNoneButExpected {
span,
match_file: context.match_file(),
note: Some(msg),
});
}
}
}
Err(err) => {
blocks.push(BlockInfo {
label_info: None,
sections: Some(Range::new(i, i + 1)),
start: None,
end: None,
eof,
});
errors.push(CheckFailedError::MatchNoneForInvalidPattern {
span: label.span(),
match_file: context.match_file(),
error: Some(RelatedError::new(err)),
});
}
}
}
}
// Reset the context bounds
context.cursor_mut().reset();
if errors.is_empty() {
Ok(blocks)
} else {
Err(TestFailed::new(errors, context))
}
}
/// Evaluate all check operations in the given blocks
pub fn check_blocks<'input, 'a: 'input, I>(
blocks: I,
program: &'input CheckProgram<'a>,
context: &mut MatchContext<'input, 'a>,
) -> TestResult
where
I: IntoIterator<Item = BlockInfo>,
{
// Execute compiled check program now that we have the blocks identified.
//
// If we encounter a block which was not found in the check file, all ops
// up to the next CHECK-LABEL are skipped.
//
// Each time a CHECK-LABEL is found, we set the search bounds of the match
// context to stay within that region. If --enable-var-scopes is set, the
// locals bound so far will be cleared
let mut test_result = TestResult::new(context);
for mut block in blocks.into_iter() {
if let Some(label_info) = block.label_info.take() {
test_result.matched(label_info);
}
if block.start.is_none() {
continue;
}
if block.sections.is_none() {
continue;
}
// Update the match context cursor
context.enter_block(block.range());
let section_range = unsafe { block.sections.unwrap_unchecked() };
if section_range.len() > 1 {
// No CHECK-LABEL
check_group_sections(
&program.sections[section_range.start..section_range.end],
&mut test_result,
context,
);
} else {
match &program.sections[section_range.start] {
CheckSection::Block { ref body, .. } => {
// CHECK-LABEL
check_block_section(body, &mut test_result, context);
}
section @ CheckSection::Group { .. } => {
// Single-group, no blocks
check_group_sections(core::slice::from_ref(section), &mut test_result, context);
}
}
}
}
test_result
}
/// Evaluate a section of check operations with the given context,
/// gathering any errors encountered into `errors`.
pub fn check_block_section<'input, 'a: 'input>(
body: &[CheckGroup<'a>],
test_result: &mut TestResult,
context: &mut MatchContext<'input, 'a>,
) {
for group in body.iter() {
match check_group(group, test_result, context) {
Ok(Ok(matched) | Err(matched)) => {
matched
.into_iter()
.for_each(|matches| test_result.append(matches));
}
Err(err) => {
test_result.failed(err);
}
}
}
}
pub fn check_group_sections<'input, 'a: 'input>(
body: &[CheckSection<'a>],
test_result: &mut TestResult,
context: &mut MatchContext<'input, 'a>,
) {
for section in body.iter() {
let CheckSection::Group { body: ref group } = section else {
unreachable!()
};
match check_group(group, test_result, context) {
Ok(Ok(matched) | Err(matched)) => {
matched
.into_iter()
.for_each(|matches| test_result.append(matches));
}
Err(err) => {
test_result.failed(err);
}
}
}
}
pub fn check_group<'section, 'input, 'a: 'input>(
group: &'section CheckGroup<'a>,
test_result: &mut TestResult,
context: &mut MatchContext<'input, 'a>,
) -> Result<Result<Vec<Matches<'input>>, Vec<Matches<'input>>>, CheckFailedError> {
match group {
CheckGroup::Never(ref pattern) => {
// The given pattern should not match any of
// the remaining input in this block
let input = context.search_block();
match check_not(pattern, input, context) {
Ok(Ok(num_patterns)) => {
(0..num_patterns).for_each(|_| test_result.passed());
Ok(Ok(vec![]))
}
Ok(Err(info)) => Ok(Err(vec![Matches::from_iter([MatchResult::failed(
CheckFailedError::MatchFoundButExcluded {
span: info.span,
input_file: context.input_file(),
labels: vec![RelatedLabel::error(
Label::new(info.pattern_span, "by this pattern"),
context.match_file(),
)],
},
)])])),
Err(err) => {
// Something went wrong with this pattern
Err(CheckFailedError::MatchNoneErrorNote {
span: pattern.span(),
match_file: context.match_file(),
error: Some(RelatedError::new(err)),
})
}
}
}
CheckGroup::Ordered(rules) => {
let mut matched = vec![];
for rule in rules.iter() {
match rule.apply(context) {
Ok(matches) => {
matched.push(matches);
}
Err(err) => {
test_result.failed(CheckFailedError::MatchNoneErrorNote {
span: rule.span(),
match_file: context.match_file(),
error: Some(RelatedError::new(err)),
});
}
}
}
if matched.is_empty() || matched.iter().all(|m| m.range().is_none()) {
Ok(Err(matched))
} else {
Ok(Ok(matched))
}
}
CheckGroup::Repeated { rule, count } => {
let mut matched = vec![];
for _ in 0..*count {
match rule.apply(context) {
Ok(matches) => {
matched.push(matches);
}
Err(err) => {
test_result.failed(CheckFailedError::MatchNoneErrorNote {
span: rule.span(),
match_file: context.match_file(),
error: Some(RelatedError::new(err)),
});
break;
}
}
}
if matched.is_empty() || matched.iter().all(|m| m.range().is_none()) {
Ok(Err(matched))
} else {
Ok(Ok(matched))
}
}
CheckGroup::Unordered(check_dag) => match check_dag.apply(context) {
Ok(matches) => {
if matches.range().is_none() {
Ok(Err(vec![matches]))
} else {
Ok(Ok(vec![matches]))
}
}
Err(err) => {
test_result.failed(CheckFailedError::MatchNoneErrorNote {
span: check_dag.span(),
match_file: context.match_file(),
error: Some(RelatedError::new(err)),
});
Ok(Err(vec![]))
}
},
CheckGroup::Bounded {
left: check_dag,
ref right,
} => {
let initial_result = check_dag.apply(context);
match check_group(right, test_result, context) {
Ok(Ok(mut right_matches)) => {
let right_range = right_matches[0]
.range()
.expect("expected at least one match");
match initial_result {
Ok(mut left_matches) => {
if let Some(left_range) = left_matches.range() {
if left_range.start >= right_range.start
|| left_range.end >= right_range.start
{
// At least one matching CHECK-DAG overlaps following CHECK,
// so visit each match result and rewrite overlapping matches
// to better guide users
let right_pattern_span = right.first_pattern_span();
for mr in left_matches.iter_mut() {
match mr {
MatchResult {
info: Some(ref mut info),
ty,
} if ty.is_ok() => {
let left_range = info.span.range();
if left_range.start >= right_range.start
|| left_range.end >= right_range.start
{
let span = info.span;
let pattern_span = info.pattern_span;
*mr = MatchResult::failed(CheckFailedError::MatchFoundButDiscarded {
span,
input_file: context.input_file(),
labels: vec![
RelatedLabel::error(Label::new(pattern_span, "matched by this pattern"), context.match_file()),
RelatedLabel::warn(Label::new(right_pattern_span, "because it cannot be reordered past this pattern"), context.match_file()),
RelatedLabel::note(Label::point(right_range.start, "which begins here"), context.input_file()),
],
note: None,
});
}
}
MatchResult {
info: Some(ref mut info),
ty: MatchType::Failed(ref err),
} => {
let span = info.span;
let pattern_span = info.pattern_span;
match err {
CheckFailedError::MatchError { .. }
| CheckFailedError::MatchFoundErrorNote { .. }
| CheckFailedError::MatchFoundConstraintFailed { .. }
| CheckFailedError::MatchFoundButDiscarded { .. } => {
if span.start() >= right_range.start || span.end() >= right_range.start {
*mr = MatchResult::failed(CheckFailedError::MatchFoundButDiscarded {
span,
input_file: context.input_file(),
labels: vec![
RelatedLabel::error(Label::new(pattern_span, "matched by this pattern"), context.match_file()),
RelatedLabel::warn(Label::new(right_pattern_span, "because it cannot be reordered past this pattern"), context.match_file()),
RelatedLabel::note(Label::point(right_range.start, "which begins here"), context.input_file()),
],
note: None,
});
}
}
_ => (),
}
}
_ => continue,
}
}
}
}
let mut matched = Vec::with_capacity(1 + right_matches.len());
matched.push(left_matches);
matched.append(&mut right_matches);
Ok(Ok(matched))
}
Err(err) => {
test_result.failed(CheckFailedError::MatchNoneErrorNote {
span: check_dag.span(),
match_file: context.match_file(),
error: Some(RelatedError::new(err)),
});
Ok(Ok(right_matches))
}
}
}
Ok(Err(mut right_matches)) => match initial_result {
Ok(left_matches) => {
let mut matched = Vec::with_capacity(1 + right_matches.len());
let is_ok = left_matches.range().is_none();
matched.push(left_matches);
matched.append(&mut right_matches);
if is_ok {
Ok(Err(matched))
} else {
Ok(Ok(matched))
}
}
Err(err) => {
test_result.failed(CheckFailedError::MatchNoneErrorNote {
span: check_dag.span(),
match_file: context.match_file(),
error: Some(RelatedError::new(err)),
});
Ok(Err(right_matches))
}
},
Err(right_err) => {
let result = match initial_result {
Ok(left_matches) => {
if left_matches.range().is_none() {
Err(vec![left_matches])
} else {
Ok(vec![left_matches])
}
}
Err(left_err) => {
test_result.failed(CheckFailedError::MatchNoneErrorNote {
span: check_dag.span(),
match_file: context.match_file(),
error: Some(RelatedError::new(left_err)),
});
Err(vec![])
}
};
test_result.failed(CheckFailedError::MatchNoneErrorNote {
span: right.span(),
match_file: context.match_file(),
error: Some(RelatedError::new(Report::new(right_err))),
});
Ok(result)
}
}
}
CheckGroup::Tree(ref tree) => check_tree(tree, test_result, context),
}
}
fn check_tree<'input, 'a: 'input>(
tree: &CheckTree<'a>,
test_result: &mut TestResult,
context: &mut MatchContext<'input, 'a>,
) -> Result<Result<Vec<Matches<'input>>, Vec<Matches<'input>>>, CheckFailedError> {
match tree {
CheckTree::Leaf(ref group) => check_group(group, test_result, context),
CheckTree::Both {
ref root,
ref left,
ref right,
} => {
let mut matched = vec![];
match check_tree(left, test_result, context).expect("unexpected check-not error") {
// There may be some errors, but at least one pattern matched
Ok(mut left_matched) => {
assert!(
!left_matched.is_empty(),
"expected at least one match result"
);
// Set aside the start of the exclusion region between `left` and `right`
let left_end = left_matched
.iter()
.filter_map(|matches| matches.range().map(|r| r.end))
.max()
.unwrap();
// Add the left matches to the pending test results
matched.append(&mut left_matched);
match check_tree(right, test_result, context)
.expect("unexpected check-not error")
{
Ok(mut right_matched) => {
assert!(
!right_matched.is_empty(),
"expected at least one match result"
);
// Find the end of the exclusion region
let right_start = right_matched
.iter()
.filter_map(|matches| matches.range().map(|r| r.start))
.min()
.unwrap();
// Ensure none of the CHECK-NOT patterns match in the exclusion region
let exclusion = context.search_range(left_end..right_start);
match check_not(root, exclusion, context) {
Ok(Ok(num_passed)) => {
(0..num_passed).for_each(|_| test_result.passed());
}
Ok(Err(info)) => {
let right_pattern_span = match right.leftmost() {
Left(group) => group.first_pattern_span(),
Right(patterns) => patterns.first_pattern_span(),
};
matched.push(Matches::from_iter([MatchResult::failed(CheckFailedError::MatchFoundButExcluded {
span: info.span,
input_file: context.input_file(),
labels: vec![
RelatedLabel::error(Label::new(info.pattern_span, "excluded by this pattern"), context.match_file()),
RelatedLabel::note(Label::new(right_pattern_span, "exclusion is bounded by this pattern"), context.match_file()),
RelatedLabel::note(Label::point(right_start, "which corresponds to this location in the input"), context.input_file()),
],
})]));
}
Err(err) => {
// Something went wrong with this pattern
matched.push(Matches::from_iter([MatchResult::failed(
CheckFailedError::MatchNoneErrorNote {
span: root.span(),
match_file: context.match_file(),
error: Some(RelatedError::new(err)),
},
)]));
}
}
// Add the right matches to the test results
matched.append(&mut right_matched);
}
Err(mut right_matched) => {
// TODO: Check to see if the right-hand side would have matched BEFORE left, and present a better error
// Since none of the right-hand patterns matched, we will treat the CHECK-NOT patterns
// as having passed, since the error of interest is the failed match
(0..root.pattern_len()).for_each(|_| test_result.passed());
// Add the right matches to the test results
matched.append(&mut right_matched);
}
}
Ok(Ok(matched))
}
// None of the left-hand patterns matched
Err(mut left_matched) => {
// Add the failed matches to the test results
matched.append(&mut left_matched);
// Proceed with the right-hand patterns
let left_end = context.cursor().start();
match check_tree(right, test_result, context)
.expect("unexpected check-not error")
{
Ok(mut right_matched) => {
assert!(
!right_matched.is_empty(),
"expected at least one match result"
);
// Find the end of the exclusion region
let right_start = right_matched
.iter()
.filter_map(|matches| matches.range().map(|r| r.start))
.min()
.unwrap();
// Ensure none of the CHECK-NOT patterns match in the exclusion region
let exclusion = context.search_range(left_end..right_start);
match check_not(root, exclusion, context) {
Ok(Ok(num_passed)) => {
(0..num_passed).for_each(|_| test_result.passed());
}
Ok(Err(info)) => {
matched.push(Matches::from_iter([MatchResult::failed(
CheckFailedError::MatchFoundButExcluded {
span: info.span,
input_file: context.input_file(),
labels: vec![RelatedLabel::error(
Label::new(info.pattern_span, "by this pattern"),
context.match_file(),
)],
},
)]));
}
Err(err) => {
// Something went wrong with this pattern
matched.push(Matches::from_iter([MatchResult::failed(
CheckFailedError::MatchNoneErrorNote {
span: root.span(),
match_file: context.match_file(),
error: Some(RelatedError::new(err)),
},
)]));
}
}
// Add the right matches to the test results
matched.append(&mut right_matched);
Ok(Ok(matched))
}
Err(mut right_matched) => {
// Since none of the right-hand patterns matched, we will treat the CHECK-NOT patterns
// as having passed, since the error of interest is the failed match
(0..root.pattern_len()).for_each(|_| test_result.passed());
// Add the right matches to the test results
matched.append(&mut right_matched);
Ok(Err(matched))
}
}
}
}
}
CheckTree::Left { root, ref left } => {
let left_end = context.cursor().start();
match check_tree(left, test_result, context).expect("unexpected check-not error") {
Ok(mut left_matched) => {
assert!(
!left_matched.is_empty(),
"expected at least one match result"
);
let exclusion = context.search_block();
match check_not(root, exclusion, context) {
Ok(Ok(num_passed)) => {
(0..num_passed).for_each(|_| test_result.passed());
}
Ok(Err(info)) => {
left_matched.push(Matches::from_iter([MatchResult::failed(
CheckFailedError::MatchFoundButExcluded {
span: info.span,
input_file: context.input_file(),
labels: vec![RelatedLabel::error(
Label::new(info.pattern_span, "by this pattern"),
context.match_file(),
)],
},
)]));
}
Err(err) => {
// Something went wrong with this pattern
left_matched.push(Matches::from_iter([MatchResult::failed(
CheckFailedError::MatchNoneErrorNote {
span: root.span(),
match_file: context.match_file(),
error: Some(RelatedError::new(err)),
},
)]));
}
}
Ok(Ok(left_matched))
}
Err(mut left_matched) => {
// None of the left-hand patterns matched, but we can proceed with the CHECK-NOT anyway
let right_start = context.cursor().end();
let exclusion = context.search_range(left_end..right_start);
match check_not(root, exclusion, context) {
Ok(Ok(num_passed)) => {
(0..num_passed).for_each(|_| test_result.passed());
}
Ok(Err(info)) => {
left_matched.push(Matches::from_iter([MatchResult::failed(
CheckFailedError::MatchFoundButExcluded {
span: info.span,
input_file: context.input_file(),
labels: vec![RelatedLabel::error(
Label::new(info.pattern_span, "by this pattern"),
context.match_file(),
)],
},
)]));
}
Err(err) => {
// Something went wrong with this pattern
left_matched.push(Matches::from_iter([MatchResult::failed(
CheckFailedError::MatchNoneErrorNote {
span: root.span(),
match_file: context.match_file(),
error: Some(RelatedError::new(err)),
},
)]));
}
}
Ok(Err(left_matched))
}
}
}
CheckTree::Right { root, ref right } => {
let left_end = context.cursor().start();
match check_tree(right, test_result, context).expect("unexpected check-not error") {
Ok(mut right_matched) => {
assert!(
!right_matched.is_empty(),
"expected at least one match result"
);
let right_start = right_matched
.iter()
.filter_map(|matches| matches.range().map(|r| r.start))
.min()
.unwrap();
let exclusion = context.search_range(left_end..right_start);
match check_not(root, exclusion, context) {
Ok(Ok(num_passed)) => {
(0..num_passed).for_each(|_| test_result.passed());
}
Ok(Err(info)) => {
right_matched.push(Matches::from_iter([MatchResult::failed(
CheckFailedError::MatchFoundButExcluded {
span: info.span,
input_file: context.input_file(),
labels: vec![RelatedLabel::error(
Label::new(info.pattern_span, "by this pattern"),
context.match_file(),
)],
},
)]));
}
Err(err) => {
// Something went wrong with this pattern
right_matched.push(Matches::from_iter([MatchResult::failed(
CheckFailedError::MatchNoneErrorNote {
span: root.span(),
match_file: context.match_file(),
error: Some(RelatedError::new(err)),
},
)]));
}
}
Ok(Ok(right_matched))
}
Err(right_matched) => {
// Since none of the right-hand patterns matched, we will treat the CHECK-NOT patterns
// as having passed, since the error of interest is the failed match
(0..root.pattern_len()).for_each(|_| test_result.passed());
Ok(Err(right_matched))
}
}
}
}
}
fn check_not<'input, 'a: 'input>(
patterns: &MatchAny<'a>,
input: Input<'input>,
context: &mut MatchContext<'input, 'a>,
) -> DiagResult<Result<usize, MatchInfo<'input>>> {
match patterns.try_match_mut(input, context)? {
MatchResult {
info: Some(info),
ty,
} if ty.is_ok() => Ok(Err(info)),
result => {
assert!(!result.is_ok());
Ok(Ok(patterns.pattern_len()))
}
}
}
#[derive(Debug)]
pub struct BlockInfo {
/// The span of the CHECK-LABEL span which started this block, if applicable
#[allow(unused)]
pub label_info: Option<MatchInfo<'static>>,
/// The section index range in the check program which covers all of the sections
/// included in this block
pub sections: Option<Range<usize>>,
/// The starting byte index of the block, if known.
///
/// The index begins at the start of the next line following the CHECK-LABEL line
///
/// If None, the CHECK-LABEL pattern was never found; `end` must also be None
/// in that case
pub start: Option<usize>,
/// The ending byte index of the block, if known.
///
/// The index ends at the last byte of the line preceding a subsequent CHECK-LABEL.
///
/// If subsequent blocks with start indices are recorded, this must be Some with
/// an end index relative to the next start index in ascending order.
pub end: Option<usize>,
/// The end-of-file index
pub eof: usize,
}
impl BlockInfo {
pub fn range(&self) -> Range<usize> {
Range::new(self.start.unwrap_or(0), self.end.unwrap_or(self.eof))
}
}