1use std::rc::Rc;
11
12use crate::Engine;
13use crate::cmd::Cmd;
14use crate::hash::{CsId, NO_CS, NULL_CS};
15use crate::token::{Token, TokenList};
16use crate::utf8x;
17
18#[derive(Clone, Copy, Debug, PartialEq, Eq)]
20pub enum LexState {
21 MidLine,
23 SkipBlanks,
25 NewLine,
27}
28
29#[derive(Clone, Copy, Debug, PartialEq, Eq)]
31pub enum TokKind {
32 Parameter,
34 UTemplate,
36 VTemplate,
38 BackedUp,
40 BackedUpChar,
42 Inserted,
44 Macro,
46 OutputText,
48 EveryParText,
50 EveryMathText,
52 EveryDisplayText,
54 EveryHboxText,
56 EveryVboxText,
58 EveryJobText,
60 EveryCrText,
62 MarkText,
64 EveryEofText,
66 WriteText,
68 LocalText,
70}
71
72#[derive(Clone, Copy, Debug, PartialEq, Eq)]
74pub enum CatMode {
75 Current,
77 Table(u32),
79 String,
81 Single(u8),
84}
85
86#[derive(Clone, Copy, Debug, PartialEq, Eq)]
88pub enum LuaLineKind {
89 Print,
91 Sprint,
93}
94
95#[derive(Clone, Debug)]
97pub enum LuaItem {
98 Text {
100 text: Vec<u8>,
102 kind: LuaLineKind,
104 catmode: CatMode,
106 },
107 Tokens(Vec<Token>),
109}
110
111#[derive(Clone, Debug)]
113pub enum LineSource {
114 File {
116 data: Rc<[u8]>,
118 pos: usize,
120 },
121 Terminal,
123 Read(u32),
125 Lines {
127 lines: std::collections::VecDeque<Vec<u8>>,
129 catcodes: Option<u32>,
131 pseudo: bool,
133 },
134 Lua(std::collections::VecDeque<LuaItem>),
136}
137
138#[derive(Clone, Debug)]
140pub struct TextLevel {
141 pub state: LexState,
143 pub buf: Vec<u32>,
146 pub loc: usize,
148 pub source: LineSource,
150 pub line: i32,
152 pub name: Vec<u8>,
154 pub is_input_file: bool,
156 pub eof_seen: bool,
158 pub grp_boundary: usize,
160 pub if_depth: usize,
162 pub catmode: CatMode,
164 pub sync: (u32, i32),
167}
168
169#[derive(Clone, Debug)]
171pub struct TokLevel {
172 pub list: TokenList,
174 pub loc: usize,
176 pub kind: TokKind,
178 pub param_start: usize,
180 pub name: CsId,
182}
183
184#[derive(Clone, Debug)]
186pub enum Level {
187 Text(Box<TextLevel>),
189 Tokens(TokLevel),
191}
192
193#[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd, Ord)]
195pub enum ScannerStatus {
196 Normal,
198 Skipping,
200 Defining,
202 Matching,
204 Aligning,
206 Absorbing,
208}
209
210const INPUT_STACK_SIZE: usize = 10_000;
213
214pub const MAX_IN_OPEN: usize = 15;
217
218fn counts_as_open(source: &LineSource) -> bool {
223 match source {
224 LineSource::File { .. } | LineSource::Read(_) | LineSource::Lua(_) => true,
225 LineSource::Lines { pseudo, .. } => *pseudo,
226 _ => false,
227 }
228}
229
230const SPARE_TOKENS: usize = 16;
232
233#[derive(Debug)]
235pub struct InputState {
236 pub stack: Vec<Level>,
238 pub param_stack: Vec<TokenList>,
240 pub align_state: i32,
242 pub scanner_status: ScannerStatus,
244 pub warning_index: CsId,
246 pub open_parens: usize,
248 pub force_eof: bool,
250 pub last_line: i32,
252 pub in_open: usize,
255 pub spare_tokens: Vec<TokenList>,
258}
259
260impl Default for InputState {
261 fn default() -> Self {
262 InputState {
263 stack: Vec::new(),
264 param_stack: Vec::new(),
265 align_state: 1_000_000,
266 scanner_status: ScannerStatus::Normal,
267 warning_index: NO_CS,
268 open_parens: 0,
269 force_eof: false,
270 last_line: 0,
271 in_open: 0,
272 spare_tokens: Vec::new(),
273 }
274 }
275}
276
277pub const NO_EXPAND_FLAG: u32 = 0x11_0001;
280
281impl InputState {
282 pub fn in_open(&self) -> usize {
284 self.stack
285 .iter()
286 .filter(|l| matches!(l, Level::Text(t) if t.is_input_file))
287 .count()
288 }
289
290 pub fn cur_text(&self) -> Option<&TextLevel> {
292 self.stack.iter().rev().find_map(|l| match l {
293 Level::Text(t) => Some(&**t),
294 Level::Tokens(_) => None,
295 })
296 }
297
298 pub fn line(&self) -> i32 {
300 self.stack
301 .iter()
302 .rev()
303 .find_map(|l| match l {
304 Level::Text(t) if !matches!(t.source, LineSource::Read(_)) => Some(t.line),
305 _ => None,
306 })
307 .unwrap_or(0)
308 }
309
310 pub fn in_token_list(&self) -> bool {
312 matches!(self.stack.last(), Some(Level::Tokens(_)))
313 }
314
315 pub fn terminal_input(&self) -> bool {
317 matches!(self.stack.last(), Some(Level::Text(t)) if matches!(t.source, LineSource::Terminal))
318 }
319}
320
321pub fn next_line(data: &[u8], pos: usize) -> Option<(&[u8], usize)> {
324 if pos >= data.len() {
325 return None;
326 }
327 let rest = &data[pos..];
328 match rest.iter().position(|&b| b == b'\n' || b == b'\r') {
329 Some(i) => {
330 let mut next = pos + i + 1;
331 if rest[i] == b'\r' && rest.get(i + 1) == Some(&b'\n') {
332 next += 1;
333 }
334 Some((&rest[..i], next))
335 }
336 None => Some((rest, data.len())),
337 }
338}
339
340pub fn decode_line(bytes: &[u8]) -> Vec<u32> {
343 let mut end = bytes.len();
344 while end > 0 && bytes[end - 1] == b' ' {
345 end -= 1;
346 }
347 utf8x::chars_marking_invalid(&bytes[..end])
348}
349
350fn is_hex(c: u32) -> bool {
351 matches!(c, 0x30..=0x39 | 0x61..=0x66)
352}
353
354fn hex_val(c: u32) -> u32 {
355 if c <= 0x39 { c - 0x30 } else { c - 0x61 + 10 }
356}
357
358enum Expanded {
360 None,
362 Char { c: u32, len: usize },
364 Bad { six: bool, short: bool },
367}
368
369fn expanded_at(buf: &[u32], k: usize) -> Expanded {
372 let sup = buf[k];
373 if buf.get(k + 1) != Some(&sup) {
374 return Expanded::None;
375 }
376 let run = buf[k..].iter().take(6).take_while(|&&c| c == sup).count();
378 if run >= 4 {
379 let six = run == 6;
380 let n = if six { 6 } else { 4 };
381 let start = k + run;
382 let digits = buf.get(start..start + n);
383 return match digits {
384 Some(d) if d.iter().all(|&c| is_hex(c)) => {
385 let c = d.iter().fold(0u32, |acc, &c| acc * 16 + hex_val(c));
386 if c > 0x10_FFFF {
387 Expanded::Bad { six, short: false }
388 } else {
389 Expanded::Char { c, len: run + n }
390 }
391 }
392 _ => Expanded::Bad {
393 six,
394 short: start + n > buf.len(),
395 },
396 };
397 }
398 let Some(&c) = buf.get(k + 2) else {
400 return Expanded::None;
401 };
402 if c >= 0o200 {
403 return Expanded::None;
404 }
405 if is_hex(c)
406 && let Some(&cc) = buf.get(k + 3)
407 && is_hex(cc)
408 {
409 return Expanded::Char {
410 c: hex_val(c) * 16 + hex_val(cc),
411 len: 4,
412 };
413 }
414 Expanded::Char {
415 c: if c < 0o100 { c + 0o100 } else { c - 0o100 },
416 len: 3,
417 }
418}
419
420impl Engine {
421 pub fn begin_token_list(&mut self, list: TokenList, kind: TokKind) {
425 let name = match kind {
428 TokKind::OutputText => Some("output"),
429 TokKind::EveryParText => Some("everypar"),
430 TokKind::EveryMathText => Some("everymath"),
431 TokKind::EveryDisplayText => Some("everydisplay"),
432 TokKind::EveryHboxText => Some("everyhbox"),
433 TokKind::EveryVboxText => Some("everyvbox"),
434 TokKind::EveryJobText => Some("everyjob"),
435 TokKind::EveryCrText => Some("everycr"),
436 TokKind::EveryEofText => Some("everyeof"),
437 TokKind::MarkText => Some("mark"),
438 TokKind::WriteText => Some("write"),
439 _ => None,
440 };
441 if let Some(name) = name
442 && self
443 .eqtb
444 .int(crate::primitives_gen::assign_int::TRACINGMACROS)
445 > 1
446 {
447 self.begin_diagnostic();
448 self.printer.print_nl("");
449 self.print_esc_str(name);
450 self.printer.print_str("->");
451 self.token_show_list(&list, 0, list.len(), 10_000_000);
452 self.end_diagnostic(false);
453 }
454 self.push_input(Level::Tokens(TokLevel {
455 list,
456 loc: 0,
457 kind,
458 param_start: self.input.param_stack.len(),
459 name: NO_CS,
460 }));
461 }
462
463 fn push_input(&mut self, level: Level) {
466 if self.input.stack.len() > INPUT_STACK_SIZE {
467 self.overflow("input stack size", INPUT_STACK_SIZE as i64);
468 }
469 self.input.stack.push(level);
470 }
471
472 pub fn begin_macro(&mut self, list: TokenList, start: usize, name: CsId, param_start: usize) {
475 self.push_input(Level::Tokens(TokLevel {
476 list,
477 loc: start,
478 kind: TokKind::Macro,
479 param_start,
480 name,
481 }));
482 }
483
484 pub fn ins_list(&mut self, list: TokenList) {
486 self.begin_token_list(list, TokKind::Inserted);
487 }
488
489 pub fn end_token_list(&mut self) {
491 if let Some(Level::Tokens(t)) = self.input.stack.pop() {
492 if matches!(t.kind, TokKind::BackedUp | TokKind::Inserted)
493 && t.list.len() == 1
494 && Rc::strong_count(&t.list) == 1
495 && self.input.spare_tokens.len() < SPARE_TOKENS
496 {
497 self.input.spare_tokens.push(t.list);
498 self.check_interrupt();
499 return;
500 }
501 match t.kind {
502 TokKind::Macro => {
503 self.input.param_stack.truncate(t.param_start);
504 }
505 TokKind::UTemplate => {
506 if self.input.align_state > 500_000 {
507 self.input.align_state = 0;
508 } else {
509 self.fatal_error("(interwoven alignment preambles are not allowed)");
510 }
511 }
512 _ => {}
513 }
514 } else {
515 debug_assert!(false, "end_token_list on a text level");
516 }
517 self.check_interrupt();
518 }
519
520 pub fn back_input(&mut self) {
522 while let Some(Level::Tokens(t)) = self.input.stack.last() {
524 if t.loc < t.list.len() || t.kind == TokKind::VTemplate {
525 break;
526 }
527 self.end_token_list();
528 }
529 let tok = self.cur_tok;
530 if tok.0 < crate::token::CS_TOKEN_FLAG {
531 let cmd = tok.cmd_code();
532 if cmd == Cmd::RightBrace as u32 {
533 self.input.align_state += 1;
534 } else if cmd == Cmd::LeftBrace as u32 {
535 self.input.align_state -= 1;
536 }
537 }
538 let list = match self.input.spare_tokens.pop() {
539 Some(mut list) => {
540 if let Some(slot) = Rc::get_mut(&mut list) {
542 slot[0] = tok;
543 list
544 } else {
545 Rc::from([tok])
546 }
547 }
548 None => Rc::from([tok]),
549 };
550 self.push_input(Level::Tokens(TokLevel {
551 list,
552 loc: 0,
553 kind: TokKind::BackedUp,
554 param_start: self.input.param_stack.len(),
555 name: NO_CS,
556 }));
557 }
558
559 pub fn back_input_inserted(&mut self) {
562 self.back_input();
563 if let Some(Level::Tokens(t)) = self.input.stack.last_mut() {
564 t.kind = TokKind::Inserted;
565 }
566 }
567
568 pub fn begin_file_reading(&mut self, source: LineSource, name: Vec<u8>, is_input_file: bool) {
571 if counts_as_open(&source) {
572 self.check_in_open();
573 self.input.in_open += 1;
574 }
575 self.push_input(Level::Text(Box::new(TextLevel {
576 state: LexState::NewLine,
577 buf: Vec::new(),
578 loc: 0,
579 source,
580 line: 0,
581 name,
582 is_input_file,
583 eof_seen: false,
584 grp_boundary: self.save.cur_boundary,
585 if_depth: self.cond.stack.len(),
586 catmode: CatMode::Current,
587 sync: (0, 0),
588 })));
589 self.sync_input_changed();
590 }
591
592 pub(crate) fn check_in_open(&mut self) {
595 if self.input.in_open >= MAX_IN_OPEN {
596 self.overflow("text input levels", MAX_IN_OPEN as i64);
597 }
598 }
599
600 pub fn end_file_reading(&mut self) {
602 let lvl = self.input.stack.pop();
603 if let Some(Level::Text(t)) = lvl
604 && counts_as_open(&t.source)
605 {
606 self.input.in_open = self.input.in_open.saturating_sub(1);
607 }
608 self.sync_input_changed();
609 }
610
611 fn read_next_line(&mut self) -> bool {
614 let end_line_char = self
615 .eqtb
616 .int(crate::primitives_gen::assign_int::ENDLINECHAR);
617 let Some(Level::Text(t)) = self.input.stack.last_mut() else {
618 return false;
619 };
620 let mut eol = true;
622 let line: Vec<u32> = match &mut t.source {
623 LineSource::File { data, pos } => match next_line(data, *pos) {
624 Some((bytes, next)) => {
625 let l = decode_line(bytes);
626 *pos = next;
627 l
628 }
629 None => return false,
630 },
631 LineSource::Lines { lines, pseudo, .. } => match lines.pop_front() {
632 Some(bytes) => {
633 eol = *pseudo || !lines.is_empty();
634 decode_line(&bytes)
635 }
636 None => return false,
637 },
638 LineSource::Lua(items) => {
639 let last = items.len() == 1;
640 match items.pop_front() {
641 Some(LuaItem::Text {
642 text,
643 kind,
644 catmode,
645 }) => {
646 t.catmode = catmode;
647 t.loc = 0;
648 t.sync.1 += 1;
649 t.line += 1;
653 if kind == LuaLineKind::Sprint {
654 t.buf = utf8x::chars(&text);
655 t.state = LexState::MidLine;
656 self.sync_input_changed();
657 return true;
658 }
659 t.buf = decode_line(&text);
660 t.state = LexState::NewLine;
661 if !last && (0..=0x10_FFFF).contains(&end_line_char) {
662 t.buf.push(end_line_char as u32);
663 }
664 self.sync_input_changed();
665 return true;
666 }
667 Some(LuaItem::Tokens(toks)) => {
668 t.buf.clear();
669 t.loc = 0;
670 t.line += 1;
671 self.pending_lua_tokens = Some(toks);
672 return true;
673 }
674 None => return false,
675 }
676 }
677 LineSource::Terminal | LineSource::Read(_) => return false,
678 };
679 t.buf = line;
680 if eol && (0..=0x10_FFFF).contains(&end_line_char) {
681 t.buf.push(end_line_char as u32);
682 }
683 t.loc = 0;
684 t.line += 1;
685 t.sync.1 = t.line;
686 self.sync_input_changed();
687 true
688 }
689
690 #[inline]
695 pub fn get_next(&mut self) {
696 if let Some(Level::Tokens(t)) = self.input.stack.last_mut()
700 && let Some(&tok) = t.list.get(t.loc)
701 {
702 if tok.is_cs() {
703 let cs = tok.cs_id();
704 let m = self.eqtb.meaning(cs);
705 if m.cmd < Cmd::TabMark || (m.cmd > Cmd::CarRet && !m.cmd.is_outer_or_special()) {
706 t.loc += 1;
707 self.cur_cs = cs;
708 self.cur_cmd = m.cmd;
709 self.cur_chr = m.chr;
710 return;
711 }
712 } else {
713 let cmd = tok.cmd();
714 if cmd > Cmd::CarRet || cmd < Cmd::MathShift {
715 t.loc += 1;
716 match cmd {
717 Cmd::LeftBrace => self.input.align_state += 1,
718 Cmd::RightBrace => self.input.align_state -= 1,
719 _ => {}
720 }
721 self.cur_cs = NO_CS;
722 self.cur_cmd = cmd;
723 self.cur_chr = tok.chr();
724 return;
725 }
726 }
727 }
728 self.get_next_slow();
729 }
730
731 #[inline(never)]
733 fn get_next_slow(&mut self) {
734 'restart: loop {
735 self.cur_cs = NO_CS;
736 let Some(top) = self.input.stack.last_mut() else {
737 self.cur_cmd = Cmd::Relax;
739 self.cur_chr = 0;
740 self.fatal_error("*** (job aborted, no legal \\end found)");
741 };
742 match top {
743 Level::Tokens(t) => {
744 if t.loc < t.list.len() {
745 let tok = t.list[t.loc];
746 t.loc += 1;
747 if tok.is_cs() {
748 let cs = tok.cs_id();
749 self.cur_cs = cs;
750 let m = self.eqtb.meaning(cs);
751 self.cur_cmd = m.cmd;
752 self.cur_chr = m.chr;
753 if self.cur_cmd.is_outer_or_special() {
754 if self.cur_cmd == Cmd::DontExpand {
755 let next = t.list[t.loc];
758 t.loc = t.list.len();
759 let cs = next.cs_id();
760 self.cur_cs = cs;
761 let m = self.eqtb.meaning(cs);
762 self.cur_cmd = m.cmd;
763 self.cur_chr = m.chr;
764 if self.cur_cmd > Cmd::MAX_COMMAND {
765 self.cur_cmd = Cmd::Relax;
766 self.cur_chr = NO_EXPAND_FLAG;
767 }
768 } else {
769 self.check_outer_validity();
770 }
771 }
772 } else {
773 self.cur_cmd = tok.cmd();
774 self.cur_chr = tok.chr();
775 match self.cur_cmd {
776 Cmd::LeftBrace => self.input.align_state += 1,
777 Cmd::RightBrace => self.input.align_state -= 1,
778 Cmd::CarRet => {
779 let p = (self.cur_chr as usize)
785 .checked_sub(1)
786 .and_then(|i| self.input.param_stack.get(t.param_start + i))
787 .cloned();
788 if let Some(p) = p {
789 self.begin_token_list(p, TokKind::Parameter);
790 }
791 continue 'restart;
792 }
793 _ => {}
794 }
795 }
796 } else {
797 self.end_token_list();
798 continue 'restart;
799 }
800 }
801 Level::Text(_) => {
802 if !self.get_next_from_text() {
803 continue 'restart;
804 }
805 }
806 }
807 if self.cur_cmd <= Cmd::CarRet
809 && self.cur_cmd >= Cmd::TabMark
810 && self.input.align_state == 0
811 {
812 self.insert_v_template();
813 continue 'restart;
814 }
815 return;
816 }
817 }
818
819 fn get_next_from_text(&mut self) -> bool {
822 loop {
823 let (c, catmode, state) = {
825 let Some(Level::Text(t)) = self.input.stack.last_mut() else {
826 return false;
827 };
828 if t.loc < t.buf.len() {
829 let c = t.buf[t.loc];
830 t.loc += 1;
831 (c, t.catmode, t.state)
832 } else {
833 if matches!(t.source, LineSource::Read(_)) {
834 self.cur_cmd = Cmd::Relax;
837 self.cur_chr = 0;
838 return true;
839 }
840 if !self.next_line_or_pop() {
841 return false;
842 }
843 continue;
844 }
845 };
846 let c = if utf8x::is_raw(c) {
847 self.invalid_utf8_sequence()
848 } else {
849 c
850 };
851 self.cur_chr = c;
852 let mut c = c;
854 loop {
855 let cat = self.catcode_in_mode(c, catmode);
856 self.cur_cmd = Cmd::from_u8(cat);
857 match (cat, state) {
858 (9, _) | (10, LexState::SkipBlanks | LexState::NewLine) => break,
861 (0, _) => {
862 self.scan_control_sequence();
863 return true;
864 }
865 (13, _) => {
866 let cs = self.hash.active(c);
867 self.cur_cs = cs;
868 let m = self.eqtb.meaning(cs);
869 self.cur_cmd = m.cmd;
870 self.cur_chr = m.chr;
871 self.set_state(LexState::MidLine);
872 if self.cur_cmd.is_outer_or_special() {
873 self.check_outer_validity();
874 }
875 return true;
876 }
877 (7, _) => {
878 match self.expanded_in_line() {
879 Expanded::Char { c: nc, len } => {
880 if let Some(Level::Text(t)) = self.input.stack.last_mut() {
881 t.loc += len - 1;
882 }
883 c = nc;
884 self.cur_chr = c;
885 continue; }
887 Expanded::Bad { six, short } => {
888 self.print_err(match (six, short) {
889 (true, false) => "^^^^^^ needs six hex digits",
890 (true, true) => "^^^^^^ needs six hex digits, end of input",
891 (false, false) => "^^^^ needs four hex digits",
892 (false, true) => "^^^^ needs four hex digits, end of input",
893 });
894 self.help(&[]);
895 self.error();
896 if let Some(Level::Text(t)) = self.input.stack.last_mut() {
900 t.loc += 2;
901 }
902 c = if c < 0o100 { c + 0o100 } else { c - 0o100 };
903 self.cur_chr = c;
904 continue; }
906 Expanded::None => {
907 self.set_state(LexState::MidLine);
908 return true;
909 }
910 }
911 }
912 (15, _) => {
913 self.print_err("Text line contains an invalid character");
914 self.help(&[
915 "A funny symbol that I can't read has just been input.",
916 "Continue, and I'll forget that it ever happened.",
917 ]);
918 self.err.deletions_allowed = false;
919 self.error();
920 self.err.deletions_allowed = true;
921 return false;
922 }
923 (10, LexState::MidLine) => {
924 self.set_state(LexState::SkipBlanks);
925 self.cur_chr = ' ' as u32;
926 return true;
927 }
928 (5, LexState::MidLine) => {
929 self.finish_line();
930 self.cur_cmd = Cmd::Spacer;
931 self.cur_chr = ' ' as u32;
932 return true;
933 }
934 (5, LexState::SkipBlanks) | (14, _) => {
935 self.finish_line();
936 break;
937 }
938 (5, LexState::NewLine) => {
939 self.finish_line();
940 let par = self.cs.par;
941 self.cur_cs = par;
942 let m = self.eqtb.meaning(par);
943 self.cur_cmd = m.cmd;
944 self.cur_chr = m.chr;
945 if self.cur_cmd.is_outer_or_special() {
946 self.check_outer_validity();
947 }
948 return true;
949 }
950 (1, s) => {
951 if s != LexState::MidLine {
952 self.set_state(LexState::MidLine);
953 }
954 self.input.align_state += 1;
955 return true;
956 }
957 (2, s) => {
958 if s != LexState::MidLine {
959 self.set_state(LexState::MidLine);
960 }
961 self.input.align_state -= 1;
962 return true;
963 }
964 (_, s) => {
965 if s != LexState::MidLine {
966 self.set_state(LexState::MidLine);
967 }
968 return true;
969 }
970 }
971 }
972 }
973 }
974
975 #[cold]
980 fn invalid_utf8_sequence(&mut self) -> u32 {
981 if let Some(Level::Text(t)) = self.input.stack.last_mut() {
983 t.loc -= 1;
984 }
985 self.print_err("String contains an invalid utf-8 sequence");
986 self.help(&[
987 "A funny symbol that I can't read has just been (re)read.",
988 "Just continue, I'll change it to 0xFFFD.",
989 ]);
990 self.error();
991 if let Some(Level::Text(t)) = self.input.stack.last_mut() {
992 let mut bytes = 0;
993 while bytes < 3 && t.loc < t.buf.len() {
994 let c = t.buf[t.loc];
995 bytes += if utf8x::is_raw(c) { 1 } else { utf8x::len(c) };
996 t.loc += 1;
997 }
998 }
999 0xFFFD
1000 }
1001
1002 #[inline]
1004 pub fn catcode_in_mode(&self, c: u32, mode: CatMode) -> u8 {
1005 match mode {
1006 CatMode::Current => self.eqtb.catcode(c),
1007 CatMode::Table(t) => self.eqtb.catcode_in(t, c),
1008 CatMode::String => {
1009 if c == ' ' as u32 {
1010 10
1011 } else {
1012 12
1013 }
1014 }
1015 CatMode::Single(k) => k,
1016 }
1017 }
1018
1019 pub fn push_lua_output(&mut self, items: Vec<LuaItem>) {
1021 if items.is_empty() {
1022 return;
1023 }
1024 self.begin_file_reading(
1025 LineSource::Lua(items.into_iter().collect()),
1026 Vec::new(),
1027 false,
1028 );
1029 if let Some(Level::Text(t)) = self.input.stack.last_mut() {
1030 t.line = self.input_line_for_lua;
1031 }
1032 }
1033
1034 fn set_state(&mut self, s: LexState) {
1035 if let Some(Level::Text(t)) = self.input.stack.last_mut() {
1036 t.state = s;
1037 }
1038 }
1039
1040 fn finish_line(&mut self) {
1041 if let Some(Level::Text(t)) = self.input.stack.last_mut() {
1042 t.loc = t.buf.len();
1043 }
1044 }
1045
1046 fn expanded_in_line(&self) -> Expanded {
1048 let Some(Level::Text(t)) = self.input.stack.last() else {
1049 return Expanded::None;
1050 };
1051 expanded_at(&t.buf, t.loc - 1)
1052 }
1053
1054 fn next_line_or_pop(&mut self) -> bool {
1058 let (is_terminal, is_read, is_file) = match self.input.stack.last() {
1059 Some(Level::Text(t)) => (
1060 matches!(t.source, LineSource::Terminal),
1061 matches!(t.source, LineSource::Read(_)),
1062 t.is_input_file,
1063 ),
1064 _ => return false,
1065 };
1066 if is_read {
1067 return false;
1068 }
1069 if is_terminal {
1070 if self.input.stack.len() > 1 {
1072 self.end_file_reading();
1074 return false;
1075 }
1076 self.terminal_exhausted();
1077 return false;
1078 }
1079 let is_lua = matches!(
1080 self.input.stack.last(),
1081 Some(Level::Text(t)) if matches!(t.source, LineSource::Lua(_))
1082 );
1083 if !self.input.force_eof && self.read_next_line() {
1084 if let Some(toks) = self.pending_lua_tokens.take() {
1085 self.begin_token_list(std::rc::Rc::from(toks), TokKind::Inserted);
1086 return false;
1087 }
1088 if !is_lua {
1089 self.set_state(LexState::NewLine);
1090 }
1091 return true;
1092 }
1093 let is_pseudo = matches!(
1095 self.input.stack.last(),
1096 Some(Level::Text(t)) if matches!(t.source, LineSource::Lines { pseudo: true, .. })
1097 );
1098 if !self.input.force_eof && (is_file || is_pseudo) {
1099 let every_eof = self
1102 .eqtb
1103 .toks_param(crate::primitives_gen::assign_toks::EVERYEOF)
1104 .clone();
1105 let seen = match self.input.stack.last_mut() {
1106 Some(Level::Text(t)) => std::mem::replace(&mut t.eof_seen, true),
1107 _ => true,
1108 };
1109 if !seen && !every_eof.is_empty() {
1110 if let Some(Level::Text(t)) = self.input.stack.last_mut() {
1111 t.buf.clear();
1112 t.loc = 0;
1113 }
1114 self.begin_token_list(every_eof, TokKind::EveryEofText);
1115 return false;
1116 }
1117 }
1118 if is_file {
1119 self.printer.print_char(')' as u32);
1120 if is_pseudo {
1121 self.printer.print_char(')' as u32);
1124 }
1125 self.input.open_parens -= 1;
1126 self.printer.update_terminal();
1127 self.file_closed_checks();
1128 }
1129 self.input.force_eof = false;
1130 let check = match self.input.stack.last() {
1133 Some(Level::Text(t)) => match &t.source {
1134 LineSource::Lua(_) => false,
1135 LineSource::Lines { pseudo, .. } => *pseudo,
1136 _ => true,
1137 },
1138 _ => true,
1139 };
1140 self.end_file_reading();
1141 if check {
1142 self.check_outer_validity();
1143 }
1144 false
1145 }
1146
1147 fn scan_control_sequence(&mut self) {
1149 'start_cs: loop {
1150 let Some(Level::Text(t)) = self.input.stack.last() else {
1151 return;
1152 };
1153 let len = t.buf.len();
1154 let loc = t.loc;
1155 let catmode = t.catmode;
1156 if loc >= len {
1157 self.cur_cs = NULL_CS;
1158 break;
1159 }
1160 let mut k = loc;
1161 let mut ch = t.buf[k];
1162 let mut cat = self.catcode_in_mode(ch, catmode);
1163 k += 1;
1164 let state = if cat == 11 || cat == 10 {
1165 LexState::SkipBlanks
1166 } else {
1167 LexState::MidLine
1168 };
1169 if cat == 11 && k < len {
1170 loop {
1172 ch = t.buf[k];
1173 cat = self.catcode_in_mode(ch, catmode);
1174 k += 1;
1175 if cat != 11 || k >= len {
1176 break;
1177 }
1178 }
1179 if self.reduce_expanded(k, ch, cat) {
1180 continue 'start_cs;
1181 }
1182 if cat != 11 {
1183 k -= 1;
1184 }
1185 if k > loc + 1 {
1186 let mut name = Vec::with_capacity(k - loc);
1187 if let Some(Level::Text(t)) = self.input.stack.last() {
1188 for &c in &t.buf[loc..k] {
1189 utf8x::push(&mut name, c);
1190 }
1191 }
1192 self.cur_cs = self.hash.lookup_or_insert(&name);
1193 if let Some(Level::Text(t)) = self.input.stack.last_mut() {
1194 t.loc = k;
1195 t.state = state;
1196 }
1197 break;
1198 }
1199 } else if self.reduce_expanded(k, ch, cat) {
1200 continue 'start_cs;
1201 }
1202 let c = match self.input.stack.last() {
1203 Some(Level::Text(t)) => t.buf[loc],
1204 _ => return,
1205 };
1206 self.cur_cs = self.hash.single(c);
1207 if let Some(Level::Text(t)) = self.input.stack.last_mut() {
1208 t.loc = loc + 1;
1209 t.state = state;
1210 }
1211 break;
1212 }
1213 let m = self.eqtb.meaning(self.cur_cs);
1214 self.cur_cmd = m.cmd;
1215 self.cur_chr = m.chr;
1216 if self.cur_cmd.is_outer_or_special() {
1217 self.check_outer_validity();
1218 }
1219 }
1220
1221 fn reduce_expanded(&mut self, k: usize, ch: u32, cat: u8) -> bool {
1225 if cat != 7 {
1226 return false;
1227 }
1228 let Some(Level::Text(t)) = self.input.stack.last_mut() else {
1229 return false;
1230 };
1231 if t.buf.get(k) != Some(&ch) {
1232 return false;
1233 }
1234 match expanded_at(&t.buf, k - 1) {
1235 Expanded::Char { c, len } => {
1236 t.buf[k - 1] = c;
1237 t.buf.drain(k..k - 1 + len);
1238 true
1239 }
1240 _ => false,
1241 }
1242 }
1243
1244 pub fn get_token(&mut self) {
1246 self.err.no_new_control_sequence = false;
1247 self.get_next();
1248 self.err.no_new_control_sequence = true;
1249 self.cur_tok = self.make_cur_tok();
1250 }
1251
1252 #[inline]
1254 pub fn make_cur_tok(&self) -> Token {
1255 if self.cur_cs == NO_CS {
1256 Token::char(self.cur_cmd, self.cur_chr)
1257 } else {
1258 Token::cs(self.cur_cs)
1259 }
1260 }
1261}
1262
1263#[cfg(test)]
1264mod tests {
1265 use super::*;
1266
1267 #[test]
1268 fn line_splitting() {
1269 let data = b"ab \r\ncd\rx\n\nlast";
1270 let mut pos = 0;
1271 let mut lines = Vec::new();
1272 while let Some((l, next)) = next_line(data, pos) {
1273 lines.push(decode_line(l));
1274 pos = next;
1275 }
1276 let strs: Vec<String> = lines
1277 .iter()
1278 .map(|l| l.iter().map(|&c| char::from_u32(c).unwrap()).collect())
1279 .collect();
1280 assert_eq!(strs, vec!["ab", "cd", "x", "", "last"]);
1281 assert_eq!(decode_line(b"x\t "), vec!['x' as u32, 9]);
1282 }
1283
1284 #[test]
1285 fn expanded_chars() {
1286 let s = |x: &str| x.chars().map(|c| c as u32).collect::<Vec<_>>();
1287 assert!(matches!(
1288 expanded_at(&s("^^A"), 0),
1289 Expanded::Char { c: 1, len: 3 }
1290 ));
1291 assert!(matches!(
1292 expanded_at(&s("^^e9"), 0),
1293 Expanded::Char { c: 0xE9, len: 4 }
1294 ));
1295 assert!(matches!(
1296 expanded_at(&s("^^?"), 0),
1297 Expanded::Char { c: 127, len: 3 }
1298 ));
1299 assert!(matches!(
1300 expanded_at(&s("^^^^00e9"), 0),
1301 Expanded::Char { c: 0xE9, len: 8 }
1302 ));
1303 assert!(matches!(
1304 expanded_at(&s("^^^^^^01f600"), 0),
1305 Expanded::Char {
1306 c: 0x1F600,
1307 len: 12
1308 }
1309 ));
1310 assert!(matches!(
1311 expanded_at(&s("^^^^zz"), 0),
1312 Expanded::Bad {
1313 six: false,
1314 short: true
1315 }
1316 ));
1317 assert!(matches!(expanded_at(&s("^x"), 0), Expanded::None));
1318 }
1319}