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 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221
//! A module to handle `Reader` #[cfg(feature = "encoding")] use std::borrow::Cow; use std::fs::File; use std::io::{self, BufRead, BufReader}; use std::path::Path; use std::str::from_utf8; #[cfg(feature = "encoding")] use encoding_rs::{Encoding, UTF_16BE, UTF_16LE}; use errors::{Error, Result}; use events::{attributes::Attribute, BytesDecl, BytesEnd, BytesStart, BytesText, Event}; use memchr; enum TagState { Opened, Closed, Empty, /// Either Eof or Errored Exit, } /// A low level encoding-agnostic XML event reader. /// /// Consumes a `BufRead` and streams XML `Event`s. /// /// # Examples /// /// ``` /// use quick_xml::Reader; /// use quick_xml::events::Event; /// /// let xml = r#"<tag1 att1 = "test"> /// <tag2><!--Test comment-->Test</tag2> /// <tag2>Test 2</tag2> /// </tag1>"#; /// let mut reader = Reader::from_str(xml); /// reader.trim_text(true); /// let mut count = 0; /// let mut txt = Vec::new(); /// let mut buf = Vec::new(); /// loop { /// match reader.read_event(&mut buf) { /// Ok(Event::Start(ref e)) => { /// match e.name() { /// b"tag1" => println!("attributes values: {:?}", /// e.attributes().map(|a| a.unwrap().value) /// .collect::<Vec<_>>()), /// b"tag2" => count += 1, /// _ => (), /// } /// }, /// Ok(Event::Text(e)) => txt.push(e.unescape_and_decode(&reader).unwrap()), /// Err(e) => panic!("Error at position {}: {:?}", reader.buffer_position(), e), /// Ok(Event::Eof) => break, /// _ => (), /// } /// buf.clear(); /// } /// ``` pub struct Reader<B: BufRead> { /// reader reader: B, /// current buffer position, useful for debuging errors buf_position: usize, /// current state Open/Close tag_state: TagState, /// expand empty element into an opening and closing element expand_empty_elements: bool, /// trims Text events, skip the element if text is empty trim_text: bool, /// trims trailing whitespaces from markup names in closing tags `</a >` trim_markup_names_in_closing_tags: bool, /// check if End nodes match last Start node check_end_names: bool, /// check if comments contains `--` (false per default) check_comments: bool, /// all currently Started elements which didn't have a matching /// End element yet opened_buffer: Vec<u8>, /// opened name start indexes opened_starts: Vec<usize>, /// a buffer to manage namespaces ns_buffer: NamespaceBufferIndex, #[cfg(feature = "encoding")] /// the encoding specified in the xml, defaults to utf8 encoding: &'static Encoding, #[cfg(feature = "encoding")] /// check if quick-rs could find out the encoding is_encoding_set: bool, } impl<B: BufRead> Reader<B> { /// Creates a `Reader` that reads from a reader implementing `BufRead`. pub fn from_reader(reader: B) -> Reader<B> { Reader { reader: reader, opened_buffer: Vec::new(), opened_starts: Vec::new(), tag_state: TagState::Closed, expand_empty_elements: false, trim_text: false, trim_markup_names_in_closing_tags: true, check_end_names: true, buf_position: 0, check_comments: false, ns_buffer: NamespaceBufferIndex::default(), #[cfg(feature = "encoding")] encoding: ::encoding_rs::UTF_8, #[cfg(feature = "encoding")] is_encoding_set: false, } } /// Changes whether empty elements should be split into an `Open` and a `Close` event. /// /// When set to `true`, all [`Empty`] events produced by a self-closing tag like `<tag/>` are /// expanded into a [`Start`] event followed by a [`End`] event. When set to `false` (the /// default), those tags are represented by an [`Empty`] event instead. /// /// (`false` by default) /// /// [`Empty`]: events/enum.Event.html#variant.Empty /// [`Start`]: events/enum.Event.html#variant.Start /// [`End`]: events/enum.Event.html#variant.End pub fn expand_empty_elements(&mut self, val: bool) -> &mut Reader<B> { self.expand_empty_elements = val; self } /// Changes whether whitespace before and after character data should be removed. /// /// When set to `true`, all [`Text`] events are trimmed. If they are empty, no event will be /// pushed. /// /// (`false` by default) /// /// [`Text`]: events/enum.Event.html#variant.Text pub fn trim_text(&mut self, val: bool) -> &mut Reader<B> { self.trim_text = val; self } /// Changes wether trailing whitespaces after the markup name are trimmed in closing tags /// `</a >`. /// /// If true the emitted [`End`] event is stripped of trailing whitespace after the markup name. /// /// Note that if set to `false` and `check_end_names` is true the comparison of markup names is /// going to fail erronously if a closing tag contains trailing whitespaces. /// /// (`true` by default) /// /// [`End`]: events/enum.Event.html#variant.End pub fn trim_markup_names_in_closing_tags(&mut self, val: bool) -> &mut Reader<B> { self.trim_markup_names_in_closing_tags = val; self } /// Changes whether mismatched closing tag names should be detected. /// /// When set to `false`, it won't check if a closing tag matches the corresponding opening tag. /// For example, `<mytag></different_tag>` will be permitted. /// /// If the XML is known to be sane (already processed, etc.) this saves extra time. /// /// Note that the emitted [`End`] event will not be modified if this is disabled, ie. it will /// contain the data of the mismatched end tag. /// /// (`true` by default) /// /// [`End`]: events/enum.Event.html#variant.End pub fn check_end_names(&mut self, val: bool) -> &mut Reader<B> { self.check_end_names = val; self } /// Changes whether comments should be validated. /// /// When set to `true`, every [`Comment`] event will be checked for not containing `--`, which /// is not allowed in XML comments. Most of the time we don't want comments at all so we don't /// really care about comment correctness, thus the default value is `false` to improve /// performance. /// /// (`false` by default) /// /// [`Comment`]: events/enum.Event.html#variant.Comment pub fn check_comments(&mut self, val: bool) -> &mut Reader<B> { self.check_comments = val; self } /// Gets the current byte position in the input data. /// /// Useful when debugging errors. pub fn buffer_position(&self) -> usize { // when internal state is Opened, we have actually read until '<', // which we don't want to show let offset = if let TagState::Opened = self.tag_state { 1 } else { 0 }; self.buf_position - offset } /// private function to read until '<' is found /// return a `Text` event fn read_until_open<'a, 'b>(&'a mut self, buf: &'b mut Vec<u8>) -> Result<Event<'b>> { self.tag_state = TagState::Opened; let buf_start = buf.len(); match read_until(&mut self.reader, b'<', buf) { Ok(0) => Ok(Event::Eof), Ok(n) => { self.buf_position += n; let (start, len) = if self.trim_text { match buf.iter().skip(buf_start).position(|&b| !is_whitespace(b)) { Some(start) => ( buf_start + start, buf.iter() .rposition(|&b| !is_whitespace(b)) .map_or_else(|| buf.len(), |p| p + 1), ), None => return self.read_event(buf), } } else { (buf_start, buf.len()) }; Ok(Event::Text(BytesText::from_escaped(&buf[start..len]))) } Err(e) => Err(e), } } /// private function to read until '>' is found fn read_until_close<'a, 'b>(&'a mut self, buf: &'b mut Vec<u8>) -> Result<Event<'b>> { self.tag_state = TagState::Closed; // need to read 1 character to decide whether pay special attention to attribute values let buf_start = buf.len(); let start = loop { match self.reader.fill_buf() { Ok(n) if n.is_empty() => return Ok(Event::Eof), Ok(n) => { // We intentionally don't `consume()` the byte, otherwise we would have to // handle things like '<>' here already. break n[0]; } Err(ref e) if e.kind() == io::ErrorKind::Interrupted => continue, Err(e) => return Err(Error::Io(e)), } }; if start != b'/' && start != b'!' && start != b'?' { match read_elem_until(&mut self.reader, b'>', buf) { Ok(0) => Ok(Event::Eof), Ok(n) => { self.buf_position += n; // we already *know* that we are in this case self.read_start(&buf[buf_start..]) } Err(e) => Err(e), } } else { match read_until(&mut self.reader, b'>', buf) { Ok(0) => Ok(Event::Eof), Ok(n) => { self.buf_position += n; match start { b'/' => self.read_end(&buf[buf_start..]), b'!' => self.read_bang(buf_start, buf), b'?' => self.read_question_mark(&buf[buf_start..]), _ => unreachable!( "We checked that `start` must be one of [/!?], was {:?} \ instead.", start ), } } Err(e) => Err(e), } } } /// reads `BytesElement` starting with a `/`, /// if `self.check_end_names`, checks that element matches last opened element /// return `End` event fn read_end<'a, 'b>(&'a mut self, buf: &'b [u8]) -> Result<Event<'b>> { let len = buf.len(); // XML standard permits whitespaces after the markup name in closing tags. // Let's strip them from the buffer before comparing tag names. let name = if self.trim_markup_names_in_closing_tags { if let Some(pos_end_name) = buf[1..].iter().rposition(|&b| !b.is_ascii_whitespace()) { let (name, _) = buf[1..].split_at(pos_end_name + 1); name } else { &buf[1..] } } else { &buf[1..] }; if self.check_end_names { let mismatch_err = |expected: &[u8], found: &[u8], buf_position: &mut usize| { *buf_position -= len; Err(Error::EndEventMismatch { expected: from_utf8(expected).unwrap_or("").to_owned(), found: from_utf8(found).unwrap_or("").to_owned(), }) }; match self.opened_starts.pop() { Some(start) => { if name != &self.opened_buffer[start..] { let expected = &self.opened_buffer[start..]; mismatch_err(expected, name, &mut self.buf_position) } else { self.opened_buffer.truncate(start); Ok(Event::End(BytesEnd::borrowed(name))) } } None => mismatch_err(b"", &buf[1..], &mut self.buf_position), } } else { Ok(Event::End(BytesEnd::borrowed(name))) } } /// reads `BytesElement` starting with a `!`, /// return `Comment`, `CData` or `DocType` event /// /// Note: depending on the start of the Event, we may need to read more /// data, thus we need a mutable buffer fn read_bang<'a, 'b>( &'a mut self, buf_start: usize, buf: &'b mut Vec<u8>, ) -> Result<Event<'b>> { let len = buf.len(); if len >= buf_start + 3 && &buf[buf_start + 1..buf_start + 3] == b"--" { let mut len = buf.len(); while (len - buf_start) < 5 || &buf[len - 2..] != b"--" { buf.push(b'>'); match read_until(&mut self.reader, b'>', buf) { Ok(0) => { self.buf_position -= len; return Err(Error::UnexpectedEof("Comment".to_string())); } Ok(n) => self.buf_position += n, Err(e) => return Err(e.into()), } len = buf.len(); } if self.check_comments { let mut offset = len - 3; for w in buf[buf_start + 3..len - 1].windows(2) { if &*w == b"--" { self.buf_position -= offset; return Err(Error::UnexpectedToken("--".to_string())); } offset -= 1; } } Ok(Event::Comment(BytesText::from_escaped( &buf[buf_start + 3..len - 2], ))) } else if len >= buf_start + 8 { match &buf[buf_start + 1..buf_start + 8] { b"[CDATA[" => { let mut len = buf.len(); while len < 10 || &buf[len - 2..] != b"]]" { buf.push(b'>'); match read_until(&mut self.reader, b'>', buf) { Ok(0) => { self.buf_position -= len; return Err(Error::UnexpectedEof("CData".to_string())); } Ok(n) => self.buf_position += n, Err(e) => return Err(e), } len = buf.len(); } Ok(Event::CData(BytesText::from_escaped( &buf[buf_start + 8..len - 2], ))) } b"DOCTYPE" => { let mut count = buf.iter().skip(buf_start).filter(|&&b| b == b'<').count(); while count > 0 { buf.push(b'>'); match read_until(&mut self.reader, b'>', buf) { Ok(0) => { self.buf_position -= buf.len(); return Err(Error::UnexpectedEof("DOCTYPE".to_string())); } Ok(n) => { self.buf_position += n; let start = buf.len() - n; count += buf.iter().skip(start).filter(|&&b| b == b'<').count(); count -= 1; } Err(e) => return Err(e), } } let len = buf.len(); Ok(Event::DocType(BytesText::from_escaped( &buf[buf_start + 8..len], ))) } _ => return Err(Error::UnexpectedBang), } } else { self.buf_position -= buf.len(); return Err(Error::UnexpectedBang); } } /// reads `BytesElement` starting with a `?`, /// return `Decl` or `PI` event #[cfg(feature = "encoding")] fn read_question_mark<'a, 'b>(&'a mut self, buf: &'b [u8]) -> Result<Event<'b>> { let len = buf.len(); if len > 2 && buf[len - 1] == b'?' { if len > 5 && &buf[1..4] == b"xml" && is_whitespace(buf[4]) { let event = BytesDecl::from_start(BytesStart::borrowed(&buf[1..len - 1], 3)); // Try getting encoding from the declaration event if let Some(enc) = event.encoder() { self.encoding = enc; self.is_encoding_set = true; } Ok(Event::Decl(event)) } else { Ok(Event::PI(BytesText::from_escaped(&buf[1..len - 1]))) } } else { self.buf_position -= len; Err(Error::UnexpectedEof("XmlDecl".to_string())) } } /// reads `BytesElement` starting with a `?`, /// return `Decl` or `PI` event #[cfg(not(feature = "encoding"))] fn read_question_mark<'a, 'b>(&'a mut self, buf: &'b [u8]) -> Result<Event<'b>> { let len = buf.len(); if len > 2 && buf[len - 1] == b'?' { if len > 5 && &buf[1..4] == b"xml" && is_whitespace(buf[4]) { let event = BytesDecl::from_start(BytesStart::borrowed(&buf[1..len - 1], 3)); Ok(Event::Decl(event)) } else { Ok(Event::PI(BytesText::from_escaped(&buf[1..len - 1]))) } } else { self.buf_position -= len; Err(Error::UnexpectedEof("XmlDecl".to_string())) } } #[inline] fn close_expanded_empty(&mut self) -> Result<Event<'static>> { self.tag_state = TagState::Closed; let name = self .opened_buffer .split_off(self.opened_starts.pop().unwrap()); Ok(Event::End(BytesEnd::owned(name))) } /// reads `BytesElement` starting with any character except `/`, `!` or ``?` /// return `Start` or `Empty` event fn read_start<'a, 'b>(&'a mut self, buf: &'b [u8]) -> Result<Event<'b>> { // TODO: do this directly when reading bufreader ... let len = buf.len(); let name_end = buf.iter().position(|&b| is_whitespace(b)).unwrap_or(len); if let Some(&b'/') = buf.last() { let end = if name_end < len { name_end } else { len - 1 }; if self.expand_empty_elements { self.tag_state = TagState::Empty; self.opened_starts.push(self.opened_buffer.len()); self.opened_buffer.extend(&buf[..end]); Ok(Event::Start(BytesStart::borrowed(&buf[..len - 1], end))) } else { Ok(Event::Empty(BytesStart::borrowed(&buf[..len - 1], end))) } } else { if self.check_end_names { self.opened_starts.push(self.opened_buffer.len()); self.opened_buffer.extend(&buf[..name_end]); } Ok(Event::Start(BytesStart::borrowed(buf, name_end))) } } /// Reads the next `Event`. /// /// This is the main entry point for reading XML `Event`s. /// /// `Event`s borrow `buf` and can be converted to own their data if needed (uses `Cow` /// internally). /// /// Having the possibility to control the internal buffers gives you some additional benefits /// such as: /// /// - Reduce the number of allocations by reusing the same buffer. For constrained systems, /// you can call `buf.clear()` once you are done with processing the event (typically at the /// end of your loop). /// - Reserve the buffer length if you know the file size (using `Vec::with_capacity`). /// /// # Examples /// /// ``` /// use quick_xml::Reader; /// use quick_xml::events::Event; /// /// let xml = r#"<tag1 att1 = "test"> /// <tag2><!--Test comment-->Test</tag2> /// <tag2>Test 2</tag2> /// </tag1>"#; /// let mut reader = Reader::from_str(xml); /// reader.trim_text(true); /// let mut count = 0; /// let mut buf = Vec::new(); /// let mut txt = Vec::new(); /// loop { /// match reader.read_event(&mut buf) { /// Ok(Event::Start(ref e)) => count += 1, /// Ok(Event::Text(e)) => txt.push(e.unescape_and_decode(&reader).expect("Error!")), /// Err(e) => panic!("Error at position {}: {:?}", reader.buffer_position(), e), /// Ok(Event::Eof) => break, /// _ => (), /// } /// buf.clear(); /// } /// println!("Found {} start events", count); /// println!("Text events: {:?}", txt); /// ``` pub fn read_event<'a, 'b>(&'a mut self, buf: &'b mut Vec<u8>) -> Result<Event<'b>> { let event = match self.tag_state { TagState::Opened => self.read_until_close(buf), TagState::Closed => self.read_until_open(buf), TagState::Empty => self.close_expanded_empty(), TagState::Exit => return Ok(Event::Eof), }; match event { Err(_) | Ok(Event::Eof) => self.tag_state = TagState::Exit, _ => {} } event } /// Resolves a potentially qualified **event name** into (namespace name, local name). /// /// *Qualified* attribute names have the form `prefix:local-name` where the`prefix` is defined /// on any containing XML element via `xmlns:prefix="the:namespace:uri"`. The namespace prefix /// can be defined on the same element as the attribute in question. /// /// *Unqualified* event inherits the current *default namespace*. #[inline] pub fn event_namespace<'a, 'b, 'c>( &'a self, qname: &'b [u8], namespace_buffer: &'c [u8], ) -> (Option<&'c [u8]>, &'b [u8]) { self.ns_buffer .resolve_namespace(qname, namespace_buffer, true) } /// Resolves a potentially qualified **attribute name** into (namespace name, local name). /// /// *Qualified* attribute names have the form `prefix:local-name` where the`prefix` is defined /// on any containing XML element via `xmlns:prefix="the:namespace:uri"`. The namespace prefix /// can be defined on the same element as the attribute in question. /// /// *Unqualified* attribute names do *not* inherit the current *default namespace*. #[inline] pub fn attribute_namespace<'a, 'b, 'c>( &'a self, qname: &'b [u8], namespace_buffer: &'c [u8], ) -> (Option<&'c [u8]>, &'b [u8]) { self.ns_buffer .resolve_namespace(qname, namespace_buffer, false) } /// Reads the next event and resolves its namespace (if applicable). /// /// # Examples /// /// ``` /// use std::str::from_utf8; /// use quick_xml::Reader; /// use quick_xml::events::Event; /// /// let xml = r#"<x:tag1 xmlns:x="www.xxxx" xmlns:y="www.yyyy" att1 = "test"> /// <y:tag2><!--Test comment-->Test</y:tag2> /// <y:tag2>Test 2</y:tag2> /// </x:tag1>"#; /// let mut reader = Reader::from_str(xml); /// reader.trim_text(true); /// let mut count = 0; /// let mut buf = Vec::new(); /// let mut ns_buf = Vec::new(); /// let mut txt = Vec::new(); /// loop { /// match reader.read_namespaced_event(&mut buf, &mut ns_buf) { /// Ok((ref ns, Event::Start(ref e))) => { /// count += 1; /// match (*ns, e.local_name()) { /// (Some(b"www.xxxx"), b"tag1") => (), /// (Some(b"www.yyyy"), b"tag2") => (), /// (ns, n) => panic!("Namespace and local name mismatch"), /// } /// println!("Resolved namespace: {:?}", ns.and_then(|ns| from_utf8(ns).ok())); /// } /// Ok((_, Event::Text(e))) => { /// txt.push(e.unescape_and_decode(&reader).expect("Error!")) /// }, /// Err(e) => panic!("Error at position {}: {:?}", reader.buffer_position(), e), /// Ok((_, Event::Eof)) => break, /// _ => (), /// } /// buf.clear(); /// } /// println!("Found {} start events", count); /// println!("Text events: {:?}", txt); /// ``` pub fn read_namespaced_event<'a, 'b, 'c>( &'a mut self, buf: &'b mut Vec<u8>, namespace_buffer: &'c mut Vec<u8>, ) -> Result<(Option<&'c [u8]>, Event<'b>)> { self.ns_buffer.pop_empty_namespaces(namespace_buffer); match self.read_event(buf) { Ok(Event::Eof) => Ok((None, Event::Eof)), Ok(Event::Start(e)) => { self.ns_buffer.push_new_namespaces(&e, namespace_buffer); Ok(( self.ns_buffer .find_namespace_value(e.name(), &**namespace_buffer), Event::Start(e), )) } Ok(Event::Empty(e)) => { // For empty elements we need to 'artificially' keep the namespace scope on the // stack until the next `next()` call occurs. // Otherwise the caller has no chance to use `resolve` in the context of the // namespace declarations that are 'in scope' for the empty element alone. // Ex: <img rdf:nodeID="abc" xmlns:rdf="urn:the-rdf-uri" /> self.ns_buffer.push_new_namespaces(&e, namespace_buffer); // notify next `read_namespaced_event()` invocation that it needs to pop this // namespace scope self.ns_buffer.pending_pop = true; Ok(( self.ns_buffer .find_namespace_value(e.name(), &**namespace_buffer), Event::Empty(e), )) } Ok(Event::End(e)) => { // notify next `read_namespaced_event()` invocation that it needs to pop this // namespace scope self.ns_buffer.pending_pop = true; Ok(( self.ns_buffer .find_namespace_value(e.name(), &**namespace_buffer), Event::End(e), )) } Ok(e) => Ok((None, e)), Err(e) => Err(e), } } /// Returns the `Reader`s encoding. /// /// The used encoding may change after parsing the XML declaration. /// /// This encoding will be used by [`decode`]. /// /// [`decode`]: #method.decode #[cfg(feature = "encoding")] pub fn encoding(&self) -> &'static Encoding { self.encoding } /// Decodes a slice using the encoding specified in the XML declaration. /// /// Decode `bytes` with BOM sniffing and with malformed sequences replaced with the /// `U+FFFD REPLACEMENT CHARACTER`. /// /// If no encoding is specified, defaults to UTF-8. #[inline] #[cfg(feature = "encoding")] pub fn decode<'b, 'c>(&'b self, bytes: &'c [u8]) -> Cow<'c, str> { self.encoding.decode(bytes).0 } /// Decodes a UTF8 slice without BOM (Byte order mark) regardless of XML declaration. /// /// Decode `bytes` without BOM and with malformed sequences replaced with the /// `U+FFFD REPLACEMENT CHARACTER`. /// /// # Note /// /// If you instead want to use XML declared encoding, use the `encoding` feature #[inline] #[cfg(not(feature = "encoding"))] pub fn decode_without_bom<'c>(&self, bytes: &'c [u8]) -> Result<&'c str> { if bytes.starts_with(b"\xEF\xBB\xBF") { from_utf8(&bytes[3..]).map_err(Error::Utf8) } else { from_utf8(bytes).map_err(Error::Utf8) } } /// Decodes a slice using without BOM (Byte order mark) the encoding specified in the XML declaration. /// /// Decode `bytes` without BOM and with malformed sequences replaced with the /// `U+FFFD REPLACEMENT CHARACTER`. /// /// If no encoding is specified, defaults to UTF-8. #[inline] #[cfg(feature = "encoding")] pub fn decode_without_bom<'b, 'c>(&'b mut self, mut bytes: &'c [u8]) -> Cow<'c, str> { if self.is_encoding_set { return self.encoding.decode_with_bom_removal(bytes).0; } if bytes.starts_with(b"\xEF\xBB\xBF") { self.is_encoding_set = true; bytes = &bytes[3..]; } else if bytes.starts_with(b"\xFF\xFE") { self.is_encoding_set = true; self.encoding = UTF_16LE; bytes = &bytes[2..]; } else if bytes.starts_with(b"\xFE\xFF") { self.is_encoding_set = true; self.encoding = UTF_16BE; bytes = &bytes[3..]; }; self.encoding.decode_without_bom_handling(bytes).0 } /// Decodes a UTF8 slice regardless of XML declaration. /// /// Decode `bytes` with BOM sniffing and with malformed sequences replaced with the /// `U+FFFD REPLACEMENT CHARACTER`. /// /// # Note /// /// If you instead want to use XML declared encoding, use the `encoding` feature #[inline] #[cfg(not(feature = "encoding"))] pub fn decode<'c>(&self, bytes: &'c [u8]) -> Result<&'c str> { from_utf8(bytes).map_err(Error::Utf8) } /// Get utf8 decoder #[cfg(feature = "encoding")] pub fn decoder(&self) -> Decoder { Decoder { encoding: self.encoding, } } /// Get utf8 decoder #[cfg(not(feature = "encoding"))] pub fn decoder(&self) -> Decoder { Decoder } /// Reads until end element is found /// /// Manages nested cases where parent and child elements have the same name pub fn read_to_end<K: AsRef<[u8]>>(&mut self, end: K, buf: &mut Vec<u8>) -> Result<()> { let mut depth = 0; let end = end.as_ref(); loop { match self.read_event(buf) { Ok(Event::End(ref e)) if e.name() == end => { if depth == 0 { return Ok(()); } depth -= 1; } Ok(Event::Start(ref e)) if e.name() == end => depth += 1, Err(e) => return Err(e), Ok(Event::Eof) => { return Err(Error::UnexpectedEof(format!("</{:?}>", from_utf8(end)))); } _ => (), } buf.clear(); } } /// Reads optional text between start and end tags. /// /// If the next event is a [`Text`] event, returns the decoded and unescaped content as a /// `String`. If the next event is an [`End`] event, returns the empty string. In all other /// cases, returns an error. /// /// Any text will be decoded using the XML encoding specified in the XML declaration (or UTF-8 /// if none is specified). /// /// # Examples /// /// ``` /// use quick_xml::Reader; /// use quick_xml::events::Event; /// /// let mut xml = Reader::from_reader(b" /// <a><b></a> /// <a></a> /// " as &[u8]); /// xml.trim_text(true); /// /// let expected = ["<b>", ""]; /// for &content in expected.iter() { /// match xml.read_event(&mut Vec::new()) { /// Ok(Event::Start(ref e)) => { /// assert_eq!(&xml.read_text(e.name(), &mut Vec::new()).unwrap(), content); /// }, /// e => panic!("Expecting Start event, found {:?}", e), /// } /// } /// ``` /// /// [`Text`]: events/enum.Event.html#variant.Text /// [`End`]: events/enum.Event.html#variant.End pub fn read_text<K: AsRef<[u8]>>(&mut self, end: K, buf: &mut Vec<u8>) -> Result<String> { let s = match self.read_event(buf) { Ok(Event::Text(e)) => e.unescape_and_decode(self), Ok(Event::End(ref e)) if e.name() == end.as_ref() => return Ok("".to_string()), Err(e) => return Err(e), Ok(Event::Eof) => return Err(Error::UnexpectedEof("Text".to_string())), _ => return Err(Error::TextNotFound), }; self.read_to_end(end, buf)?; s } /// Consumes `Reader` returning the underlying reader /// /// Can be used to compute line and column of a parsing error position /// /// # Examples /// /// ``` /// use std::{str, io::Cursor}; /// use quick_xml::Reader; /// use quick_xml::events::Event; /// /// let xml = r#"<tag1 att1 = "test"> /// <tag2><!--Test comment-->Test</tag2> /// <tag3>Test 2</tag3> /// </tag1>"#; /// let mut reader = Reader::from_reader(Cursor::new(xml.as_bytes())); /// let mut buf = Vec::new(); /// /// fn into_line_and_column(reader: Reader<Cursor<&[u8]>>) -> (usize, usize) { /// let end_pos = reader.buffer_position(); /// let mut cursor = reader.into_underlying_reader(); /// let s = String::from_utf8(cursor.into_inner()[0..end_pos].to_owned()) /// .expect("can't make a string"); /// let mut line = 1; /// let mut column = 0; /// for c in s.chars() { /// if c == '\n' { /// line += 1; /// column = 0; /// } else { /// column += 1; /// } /// } /// (line, column) /// } /// /// loop { /// match reader.read_event(&mut buf) { /// Ok(Event::Start(ref e)) => match e.name() { /// b"tag1" | b"tag2" => (), /// tag => { /// assert_eq!(b"tag3", tag); /// assert_eq!((3, 22), into_line_and_column(reader)); /// break; /// } /// }, /// Ok(Event::Eof) => unreachable!(), /// _ => (), /// } /// buf.clear(); /// } /// ``` pub fn into_underlying_reader(self) -> B { self.reader } } impl Reader<BufReader<File>> { /// Creates an XML reader from a file path. pub fn from_file<P: AsRef<Path>>(path: P) -> Result<Reader<BufReader<File>>> { let file = File::open(path).map_err(Error::Io)?; let reader = BufReader::new(file); Ok(Reader::from_reader(reader)) } } impl<'a> Reader<&'a [u8]> { /// Creates an XML reader from a string slice. pub fn from_str(s: &'a str) -> Reader<&'a [u8]> { Reader::from_reader(s.as_bytes()) } } /// read until `byte` is found or end of file /// return the position of byte #[inline] fn read_until<R: BufRead>(r: &mut R, byte: u8, buf: &mut Vec<u8>) -> Result<usize> { let mut read = 0; let mut done = false; while !done { let used = { let available = match r.fill_buf() { Ok(n) if n.is_empty() => return Ok(read), Ok(n) => n, Err(ref e) if e.kind() == io::ErrorKind::Interrupted => continue, Err(e) => return Err(Error::Io(e)), }; match memchr::memchr(byte, available) { Some(i) => { buf.extend_from_slice(&available[..i]); done = true; i + 1 } None => { buf.extend_from_slice(available); available.len() } } }; r.consume(used); read += used; } Ok(read) } /// Derived from `read_until`, but modified to handle XML attributes using a minimal state machine. /// [W3C Extensible Markup Language (XML) 1.1 (2006)](https://www.w3.org/TR/xml11) /// /// Attribute values are defined as follows: /// ```plain /// AttValue := '"' (([^<&"]) | Reference)* '"' /// | "'" (([^<&']) | Reference)* "'" /// ``` /// (`Reference` is something like `"`, but we don't care about escaped characters at this /// level) #[inline] fn read_elem_until<R: BufRead>(r: &mut R, end_byte: u8, buf: &mut Vec<u8>) -> Result<usize> { #[derive(Clone, Copy)] enum State { /// The initial state (inside element, but outside of attribute value) Elem, /// Inside a single-quoted attribute value SingleQ, /// Inside a double-quoted attribute value DoubleQ, } let mut state = State::Elem; let mut read = 0; let mut done = false; while !done { let used = { let available = match r.fill_buf() { Ok(n) if n.is_empty() => return Ok(read), Ok(n) => n, Err(ref e) if e.kind() == io::ErrorKind::Interrupted => continue, Err(e) => return Err(Error::Io(e)), }; let mut memiter = memchr::memchr3_iter(end_byte, b'\'', b'"', available); let used: usize; loop { match memiter.next() { Some(i) => { state = match (state, available[i]) { (State::Elem, b) if b == end_byte => { // only allowed to match `end_byte` while we are in state `Elem` buf.extend_from_slice(&available[..i]); done = true; used = i + 1; break; } (State::Elem, b'\'') => State::SingleQ, (State::Elem, b'\"') => State::DoubleQ, // the only end_byte that gets us out if the same character (State::SingleQ, b'\'') | (State::DoubleQ, b'\"') => State::Elem, // all other bytes: no state change _ => state, }; } None => { buf.extend_from_slice(available); used = available.len(); break; } } } used }; r.consume(used); read += used; } Ok(read) } /// A function to check whether the byte is a whitespace (blank, new line, carriage return or tab) #[inline] pub(crate) fn is_whitespace(b: u8) -> bool { match b { b' ' | b'\r' | b'\n' | b'\t' => true, _ => false, } } /// A namespace declaration. Can either bind a namespace to a prefix or define the current default /// namespace. #[derive(Debug)] struct Namespace { /// Index of the namespace in the buffer start: usize, /// Length of the prefix /// * if bigger than start, then binds this namespace to the corresponding slice. /// * else defines the current default namespace. prefix_len: usize, /// The namespace name (the URI) of this namespace declaration. /// /// The XML standard specifies that an empty namespace value 'removes' a namespace declaration /// for the extent of its scope. For prefix declarations that's not very interesting, but it is /// vital for default namespace declarations. With `xmlns=""` you can revert back to the default /// behaviour of leaving unqualified element names unqualified. value_len: usize, /// Level of nesting at which this namespace was declared. The declaring element is included, /// i.e., a declaration on the document root has `level = 1`. /// This is used to pop the namespace when the element gets closed. level: i32, } impl Namespace { /// Gets the value slice out of namespace buffer /// /// Returns `None` if `value_len == 0` #[inline] fn opt_value<'a, 'b>(&'a self, ns_buffer: &'b [u8]) -> Option<&'b [u8]> { if self.value_len == 0 { None } else { let start = self.start + self.prefix_len; Some(&ns_buffer[start..start + self.value_len]) } } /// Check if the namespace matches the potentially qualified name #[inline] fn is_match(&self, ns_buffer: &[u8], qname: &[u8]) -> bool { if self.prefix_len == 0 { !qname.contains(&b':') } else { qname.get(self.prefix_len).map_or(false, |n| *n == b':') && qname.starts_with(&ns_buffer[self.start..self.start + self.prefix_len]) } } } /// A namespace management buffer. /// /// Holds all internal logic to push/pop namespaces with their levels. #[derive(Debug, Default)] struct NamespaceBufferIndex { /// a buffer of namespace ranges slices: Vec<Namespace>, /// The number of open tags at the moment. We need to keep track of this to know which namespace /// declarations to remove when we encounter an `End` event. nesting_level: i32, /// For `Empty` events keep the 'scope' of the element on the stack artificially. That way, the /// consumer has a chance to use `resolve` in the context of the empty element. We perform the /// pop as the first operation in the next `next()` call. pending_pop: bool, } impl NamespaceBufferIndex { #[inline] fn find_namespace_value<'a, 'b, 'c>( &'a self, element_name: &'b [u8], buffer: &'c [u8], ) -> Option<&'c [u8]> { self.slices .iter() .rfind(|n| n.is_match(buffer, element_name)) .and_then(|n| n.opt_value(buffer)) } fn pop_empty_namespaces(&mut self, buffer: &mut Vec<u8>) { if !self.pending_pop { return; } self.pending_pop = false; self.nesting_level -= 1; let current_level = self.nesting_level; // from the back (most deeply nested scope), look for the first scope that is still valid match self.slices.iter().rposition(|n| n.level <= current_level) { // none of the namespaces are valid, remove all of them None => { buffer.clear(); self.slices.clear(); } // drop all namespaces past the last valid namespace Some(last_valid_pos) => { if let Some(len) = self.slices.get(last_valid_pos + 1).map(|n| n.start) { buffer.truncate(len); self.slices.truncate(last_valid_pos + 1); } } } } fn push_new_namespaces(&mut self, e: &BytesStart, buffer: &mut Vec<u8>) { self.nesting_level += 1; let level = self.nesting_level; // adds new namespaces for attributes starting with 'xmlns:' and for the 'xmlns' // (default namespace) attribute. for a in e.attributes().with_checks(false) { if let Ok(Attribute { key: k, value: v }) = a { if k.starts_with(b"xmlns") { match k.get(5) { None => { let start = buffer.len(); buffer.extend_from_slice(&*v); self.slices.push(Namespace { start: start, prefix_len: 0, value_len: v.len(), level: level, }); } Some(&b':') => { let start = buffer.len(); buffer.extend_from_slice(&k[6..]); buffer.extend_from_slice(&*v); self.slices.push(Namespace { start: start, prefix_len: k.len() - 6, value_len: v.len(), level: level, }); } _ => break, } } } else { break; } } } /// Resolves a potentially qualified **attribute name** into (namespace name, local name). /// /// *Qualified* attribute names have the form `prefix:local-name` where the`prefix` is defined /// on any containing XML element via `xmlns:prefix="the:namespace:uri"`. The namespace prefix /// can be defined on the same element as the attribute in question. /// /// *Unqualified* attribute names do *not* inherit the current *default namespace*. #[inline] fn resolve_namespace<'a, 'b, 'c>( &'a self, qname: &'b [u8], buffer: &'c [u8], use_default: bool, ) -> (Option<&'c [u8]>, &'b [u8]) { self.slices .iter() .rfind(|n| n.is_match(buffer, qname)) .map_or((None, qname), |n| { let len = n.prefix_len; if len > 0 { (n.opt_value(buffer), &qname[len + 1..]) } else if use_default { (n.opt_value(buffer), qname) } else { (None, qname) } }) } } /// Utf8 Decoder #[cfg(not(feature = "encoding"))] #[derive(Clone, Copy)] pub struct Decoder; /// Utf8 Decoder #[cfg(feature = "encoding")] #[derive(Clone, Copy)] pub struct Decoder { encoding: &'static Encoding, } impl Decoder { #[cfg(not(feature = "encoding"))] pub fn decode<'c>(&self, bytes: &'c [u8]) -> Result<&'c str> { from_utf8(bytes).map_err(Error::Utf8) } #[cfg(feature = "encoding")] pub fn decode<'c>(&self, bytes: &'c [u8]) -> Cow<'c, str> { self.encoding.decode(bytes).0 } }