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 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347
|
/*
See license.txt in the root of this project.
*/
# include "luametatex.h"
input_state_info lmt_input_state = {
.input_stack = NULL,
.input_stack_data = {
.minimum = min_stack_size,
.maximum = max_stack_size,
.size = siz_stack_size,
.step = stp_stack_size,
.allocated = 0,
.itemsize = sizeof(in_state_record),
.top = 0,
.ptr = 0,
.initial = memory_data_unset,
.offset = 0,
.extra = 0,
},
.in_stack = NULL,
.in_stack_data = {
.minimum = min_in_open,
.maximum = max_in_open,
.size = siz_in_open,
.step = stp_in_open,
.allocated = 0,
.itemsize = sizeof(input_stack_record),
.top = 0,
.ptr = 0,
.initial = memory_data_unset,
.offset = 0,
.extra = 0,
},
.parameter_stack = NULL,
.parameter_stack_data = {
.minimum = min_parameter_size,
.maximum = max_parameter_size,
.size = siz_parameter_size,
.step = stp_parameter_size,
.allocated = 0,
.itemsize = sizeof(halfword),
.top = 0,
.ptr = 0,
.initial = memory_data_unset,
.offset = 0,
.extra = 0,
},
.cur_input = { 0 },
.input_line = 0,
.scanner_status = 0,
.def_ref = 0,
.align_state = 0,
.base_ptr = 0,
.warning_index = 0,
.open_files = 0,
.padding = 0,
} ;
input_file_state_info input_file_state = {
.forced_file = 0,
.forced_line = 0,
.mode = 0,
.line = 0,
};
/*tex
We play safe and always keep a few batches of parameter slots in reserve so that we
are unlikely to overrun.
*/
# define reserved_input_stack_slots 2
# define reserved_in_stack_slots 2
//define reserved_parameter_stack_slots 32
# define reserved_parameter_stack_slots (2 * max_match_count)
void tex_initialize_input_state(void)
{
{
int size = lmt_input_state.input_stack_data.minimum;
lmt_input_state.input_stack = aux_allocate_clear_array(sizeof(in_state_record), size, reserved_input_stack_slots);
if (lmt_input_state.input_stack) {
lmt_input_state.input_stack_data.allocated = size;
} else {
tex_overflow_error("input", size);
}
}
{
int size = lmt_input_state.in_stack_data.minimum;
lmt_input_state.in_stack = aux_allocate_clear_array(sizeof(input_stack_record), size, reserved_in_stack_slots);
if (lmt_input_state.in_stack) {
lmt_input_state.in_stack_data.allocated = size;
} else {
tex_overflow_error("file", size);
}
}
{
int size = lmt_input_state.parameter_stack_data.minimum;
lmt_input_state.parameter_stack = aux_allocate_clear_array(sizeof(halfword), size, reserved_parameter_stack_slots);
if (lmt_input_state.parameter_stack) {
lmt_input_state.parameter_stack_data.allocated = size;
} else {
tex_overflow_error("parameter", size);
}
}
}
static bool tex_aux_room_on_input_stack(void) /* quite similar to save_stack checker so maybe share */
{
int top = lmt_input_state.input_stack_data.ptr;
if (top > lmt_input_state.input_stack_data.top) {
lmt_input_state.input_stack_data.top = top;
if (top > lmt_input_state.input_stack_data.allocated) {
in_state_record *tmp = NULL;
top = lmt_input_state.input_stack_data.allocated + lmt_input_state.input_stack_data.step;
if (top > lmt_input_state.input_stack_data.size) {
top = lmt_input_state.input_stack_data.size;
}
if (top > lmt_input_state.input_stack_data.allocated) {
lmt_input_state.input_stack_data.allocated = top;
tmp = aux_reallocate_array(lmt_input_state.input_stack, sizeof(in_state_record), top, reserved_input_stack_slots);
lmt_input_state.input_stack = tmp;
}
lmt_run_memory_callback("input", tmp ? 1 : 0);
if (! tmp) {
tex_overflow_error("input", top);
return false;
}
}
}
return true;
}
static bool tex_aux_room_on_in_stack(void) /* quite similar to save_stack checker so maybe share */
{
int top = lmt_input_state.in_stack_data.ptr;
if (top > lmt_input_state.in_stack_data.top) {
lmt_input_state.in_stack_data.top = top;
if (top > lmt_input_state.in_stack_data.allocated) {
input_stack_record *tmp = NULL;
top = lmt_input_state.in_stack_data.allocated + lmt_input_state.in_stack_data.step;
if (top > lmt_input_state.in_stack_data.size) {
top = lmt_input_state.in_stack_data.size;
}
if (top > lmt_input_state.in_stack_data.allocated) {
lmt_input_state.in_stack_data.allocated = top;
tmp = aux_reallocate_array(lmt_input_state.in_stack, sizeof(input_stack_record), top, reserved_in_stack_slots);
lmt_input_state.in_stack = tmp;
}
lmt_run_memory_callback("file", tmp ? 1 : 0);
if (! tmp) {
tex_overflow_error("file", top);
return false;
}
}
}
return true;
}
static bool tex_aux_room_on_parameter_stack(void) /* quite similar to save_stack checker so maybe share */
{
int top = lmt_input_state.parameter_stack_data.ptr;
if (top > lmt_input_state.parameter_stack_data.top) {
lmt_input_state.parameter_stack_data.top = top;
if (top > lmt_input_state.parameter_stack_data.allocated) {
halfword *tmp = NULL;
top = lmt_input_state.parameter_stack_data.allocated + lmt_input_state.parameter_stack_data.step;
if (top > lmt_input_state.parameter_stack_data.size) {
top = lmt_input_state.parameter_stack_data.size;
}
if (top > lmt_input_state.parameter_stack_data.allocated) {
lmt_input_state.parameter_stack_data.allocated = top;
tmp = aux_reallocate_array(lmt_input_state.parameter_stack, sizeof(halfword), top, reserved_parameter_stack_slots);
lmt_input_state.parameter_stack = tmp;
}
lmt_run_memory_callback("parameter", tmp ? 1 : 0);
if (! tmp) {
tex_overflow_error("parameter", top);
return false;
}
}
}
return true;
}
void tex_copy_to_parameter_stack(halfword *pstack, int n)
{
if (tex_aux_room_on_parameter_stack()) {
if (n == 1) {
lmt_input_state.parameter_stack[lmt_input_state.parameter_stack_data.ptr++] = pstack[0];
// } else if (n == 2) {
// lmt_input_state.parameter_stack[lmt_input_state.parameter_stack_data.ptr++] = pstack[0];
// lmt_input_state.parameter_stack[lmt_input_state.parameter_stack_data.ptr++] = pstack[1];
} else {
memcpy(&lmt_input_state.parameter_stack[lmt_input_state.parameter_stack_data.ptr], pstack, n * sizeof(halfword));
lmt_input_state.parameter_stack_data.ptr += n;
}
}
}
/*tex
As elsewhere we keep variables that belong together in a structure: |input_stack|, the first
unused location of |input_stack| being |input_ptr|, the largest value of |input_ptr| when
pushing |max_input_stack|, the the \quote {top} input state|cur_input|, the number of lines in
the buffer, less one, |in_open|, the number of open text files |open_files| (in regular \TEX\
called |open_parens| because it relates to the way files are reported), the |input_file| and
the current line number in the current source file |line|. Furthermore some stacks:
|line_stack|. |source_filename_stack| and |full_source_filename_stack|. The |scanner_status|
tells if we can a end a sub-file now. There is an obscure identifier relevant to non-|normal|
scanner status |warning_index|. Then there is the often used reference count pointer of token
list being defined: |def_ref|.
Here is a procedure that uses |scanner_status| to print a warning message when a sub-file has
ended, and at certain other crucial times. Actually it is only called when we run out of
token memory. Because memory errors can be of any kind, we normally will not use the \TEX\
error handler (but we do have a callback).
Similar code is is us in |texerrors.c| for use with the error callback. Maybe some day that
will be default.
*/
void tex_show_validity(void)
{
halfword p = null;
switch (lmt_input_state.scanner_status) {
case scanner_is_defining:
p = lmt_input_state.def_ref;
break;
case scanner_is_matching:
case scanner_is_tolerant:
p = tex_expand_match_token_head();
break;
case scanner_is_aligning:
p = tex_alignment_hold_token_head();
break;
case scanner_is_absorbing:
p = lmt_input_state.def_ref;
break;
}
if (p) {
tex_print_ln();
tex_token_show(p);
tex_print_ln();
}
}
void tex_show_runaway(void)
{
if (lmt_input_state.scanner_status > scanner_is_skipping) {
tex_print_nlp();
switch (lmt_input_state.scanner_status) {
case scanner_is_defining:
tex_print_str("We ran into troubles when scanning a definition.");
break;
case scanner_is_matching:
tex_print_str("We ran into troubles scanning an argument.");
break;
case scanner_is_tolerant:
return;
case scanner_is_aligning:
tex_print_str("We ran into troubles scanning an alignment preamle.");
break;
case scanner_is_absorbing:
tex_print_str("We ran into troubles absorbing something.");
break;
default:
return;
}
tex_print_nlp();
tex_show_validity();
}
}
/*tex
The |parameter_stack| is an auxiliary array used to hold pointers to the token lists for parameters
at the current level and subsidiary levels of input. This stack is maintained with convention
(2), and it grows at a different rate from the others.
So, the token list pointers for parameters is |parameter_stack|, the first unused entry in
|parameter_stack| is |parameter_ptr| which is in the range |0 .. parameter_size + 9|.
The input routines must also interact with the processing of |\halign| and |\valign|, since the
appearance of tab marks and |\cr| in certain places is supposed to trigger the beginning of
special |v_j| template text in the scanner. This magic is accomplished by an |align_state|
variable that is increased by~1 when a |\char'173| is scanned and decreased by~1 when a |\char
'175| is scanned. The |align_state| is nonzero during the $u_j$ template, after which it is set
to zero; the |v_j| template begins when a tab mark or |\cr| occurs at a time that |align_state
= 0|.
Thus, the \quote {current input state} can be very complicated indeed; there can be many levels
and each level can arise in a variety of ways. The |show_context| procedure, which is used by
\TEX's error-reporting routine to print out the current input state on all levels down to the
most recent line of characters from an input file, illustrates most of these conventions. The
global variable |base_ptr| contains the lowest level that was displayed by this procedure.
The status at each level is indicated by printing two lines, where the first line indicates
what was read so far and the second line shows what remains to be read. The context is cropped,
if necessary, so that the first line contains at most |half_error_line| characters, and the
second contains at most |error_line|. Non-current input levels whose |token_type| is |backed_up|
are shown only if they have not been fully read.
When applicable, print the location of the current line. This routine should be changed, if
necessary, to give the best possible indication of where the current line resides in the input
file. For example, on some systems it is best to print both a page and line number.
Because we also have \LUA\ input en output and because error messages and contexts can go
through \LUA, reporting is a bit different in \LUAMETATEX.
*/
static void tex_aux_print_indent(void)
{
for (int q = 1; q <= lmt_error_state.context_indent; q++) {
tex_print_char(' ');
}
}
/* This can be an array: */
static const char *token_types_texts[n_of_token_types] = {
[parameter_text] = "argument",
[template_pre_text] = "templatepre",
[template_post_text] = "templatepost",
[associated_text] = "associated",
[backed_up_text] = "backedup",
[inserted_text] = "inserted text",
[macro_text] = "macro",
[output_text] = "output",
[every_par_text] = "everypar",
[every_par_begin_text] = "everyparbegin",
[every_par_end_text] = "everyparend",
[every_math_text] = "everymath",
[every_display_text] = "everydisplay",
[every_hbox_text] = "everyhbox",
[every_vbox_text] = "everyvbox",
[every_math_atom_text] = "everymathatom",
[every_job_text] = "everyjob",
[every_cr_text] = "everycr",
[every_tab_text] = "everytab",
[end_of_group_text] = "endofgroup",
[mark_text] = "mark",
[token_text] = "token",
[loop_text] = "loop",
[every_eof_text] = "everyeof",
[every_before_par_text] = "everybeforepar",
[end_paragraph_text] = "endpar",
[end_file_text] = "endfile",
[write_text] = "write",
[local_text] = "local",
[local_loop_text] = "localloop",
};
static const unsigned char token_types_verbose[n_of_token_types] = {
[parameter_text] = 0,
[template_pre_text] = 0,
[template_post_text] = 0,
[associated_text] = 0,
[backed_up_text] = 0,
[inserted_text] = 0,
[macro_text] = 0,
[output_text] = 0,
[every_par_text] = 0,
[every_par_begin_text] = 0,
[every_par_end_text] = 0,
[every_math_text] = 0,
[every_display_text] = 0,
[every_hbox_text] = 0,
[every_vbox_text] = 0,
[every_math_atom_text] = 0,
[every_job_text] = 0,
[every_cr_text] = 0,
[every_tab_text] = 0,
[end_of_group_text] = 1,
[mark_text] = 1,
[token_text] = 1,
[loop_text] = 1,
[every_eof_text] = 0,
[every_before_par_text] = 0,
[end_paragraph_text] = 1,
[end_file_text] = 1,
[write_text] = 1,
[local_text] = 1,
[local_loop_text] = 1,
};
// static void tex_aux_print_current_input_state(void)
// {
// int macro = 0;
// tex_print_str("<");
// if (lmt_input_state.cur_input.state == token_list_state) {
// switch (lmt_input_state.cur_input.token_type) {
// case parameter_text:
// tex_print_str("argument");
// break;
// case template_pre_text:
// tex_print_str("templatepre");
// break;
// case template_post_text:
// tex_print_str("templatepost");
// break;
// case associated_text:
// tex_print_str("associated");
// break;
// case backed_up_text:
// tex_print_str(lmt_input_state.cur_input.loc ? "to be read again" : "recently read");
// break;
// case inserted_text:
// tex_print_str("inserted text");
// break;
// case macro_text:
// tex_print_str("macro");
// macro = lmt_input_state.cur_input.name;
// break;
// case output_text:
// tex_print_str("output");
// break;
// case every_par_text:
// tex_print_str("everypar");
// break;
// case every_end_of_par_text:
// tex_print_str("everyendofpar");
// break;
// case every_math_text:
// tex_print_str("everymath");
// break;
// case every_display_text:
// tex_print_str("everydisplay");
// break;
// case every_hbox_text:
// tex_print_str("everyhbox");
// break;
// case every_vbox_text:
// tex_print_str("everyvbox");
// break;
// case every_math_atom_text:
// tex_print_str("everymathatom");
// break;
// case every_job_text:
// tex_print_str("everyjob");
// break;
// case every_cr_text:
// tex_print_str("everycr");
// break;
// case every_tab_text:
// tex_print_str("everytab");
// break;
// case end_of_group_text:
// tex_print_str("endofgroup");
// break;
// case mark_text:
// tex_print_str("mark");
// break;
// case token_text:
// tex_print_str("token");
// break;
// case loop_text:
// tex_print_str("loop");
// break;
// case every_eof_text:
// tex_print_str("everyeof");
// break;
// case every_before_par_text:
// tex_print_str("everybeforepar");
// break;
// case end_paragraph_text:
// tex_print_str("endpar");
// break;
// case end_file_text:
// tex_print_str("endfile");
// break;
// case write_text:
// tex_print_str("write");
// break;
// case local_text:
// tex_print_str("local");
// break;
// case local_loop_text:
// tex_print_str("localloop");
// break;
// default:
// tex_print_str("unknown");
// break;
// }
// } else {
// switch (lmt_input_state.cur_input.name) {
// case io_initial_input_code:
// tex_print_str("initial input");
// break;
// case io_lua_input_code:
// tex_print_str("lua input");
// break;
// case io_token_input_code:
// tex_print_str("token input");
// break;
// case io_token_eof_input_code:
// tex_print_str("token eof input");
// break;
// case io_tex_macro_code:
// case io_file_input_code:
// default:
// {
// /* Todo : figure out what the weird line is when we have a premature file end. */
// tex_print_str("line ");
// tex_print_int(lmt_input_state.cur_input.index);
// tex_print_char('.');
// tex_print_int(lmt_input_state.cur_input.index == lmt_input_state.in_stack_data.ptr ? lmt_input_state.input_line : lmt_input_state.in_stack[lmt_input_state.cur_input.index + 1].line);
// }
// break;
// }
// }
// tex_print_str("> ");
// if (macro) {
// tex_print_cs_checked(macro);
// }
// }
static void tex_aux_print_current_input_state(void)
{
int macro = 0;
tex_print_str("<");
if (lmt_input_state.cur_input.state == token_list_state) {
switch (lmt_input_state.cur_input.token_type) {
case backed_up_text:
tex_print_str(lmt_input_state.cur_input.loc ? "to be read again" : "recently read");
break;
case macro_text:
tex_print_str(token_types_texts[macro_text]);
macro = lmt_input_state.cur_input.name;
break;
default:
if (lmt_input_state.cur_input.token_type < n_of_token_types) {
tex_print_str(token_types_texts[lmt_input_state.cur_input.token_type]);
} else {
tex_print_str("unknown");
}
break;
}
} else {
switch (lmt_input_state.cur_input.name) {
case io_initial_input_code:
tex_print_str("initial input");
break;
case io_lua_input_code:
tex_print_str("lua input");
break;
case io_token_input_code:
tex_print_str("token input");
break;
case io_token_eof_input_code:
tex_print_str("token eof input");
break;
case io_tex_macro_code:
case io_file_input_code:
default:
{
/* Todo : figure out what the weird line is when we have a premature file end. */
tex_print_str("line ");
tex_print_int(lmt_input_state.cur_input.index);
tex_print_char('.');
tex_print_int(lmt_input_state.cur_input.index == lmt_input_state.in_stack_data.ptr ? lmt_input_state.input_line : lmt_input_state.in_stack[lmt_input_state.cur_input.index + 1].line);
}
break;
}
}
tex_print_str("> ");
if (macro) {
tex_print_cs_checked(macro);
}
}
/*tex
Here it is necessary to explain a little trick. We don't want to store a long string that
corresponds to a token list, because that string might take up lots of memory; and we are
printing during a time when an error message is being given, so we dare not do anything that
might overflow one of \TEX's tables. So \quote {pseudo printing} is the answer: We enter a mode
of printing that stores characters into a buffer of length |error_line|, where character $k +
1$ is placed into |trick_buf [k mod error_line]| if |k < trick_count|, otherwise character |k|
is dropped. Initially we set |tally := 0| and |trick_count := 1000000|; then when we reach the
point where transition from line 1 to line 2 should occur, we set |first_count := tally| and
|trick_count := tmax > (error_line, tally + 1 + error_line - half_error_line)|. At the end
of the pseudo printing, the values of |first_count|, |tally|, and |trick_count| give us all the
information we need to print the two lines, and all of the necessary text is in |trick_buf|.
Namely, let |l| be the length of the descriptive information that appears on the first line.
The length of the context information gathered for that line is |k = first_count|, and the
length of the context information gathered for line~2 is $m=\min(|tally|, |trick_count|) - k$.
If |l + k <= h|, where |h = half_error_line|, we print |trick_buf[0 .. k-1]| after the
descriptive information on line~1, and set |n := l + k|; here |n| is the length of line~1. If
|l + k > h|, some cropping is necessary, so we set |n := h| and print |...| followed by
|trick_buf[(l + k - h + 3) .. k - 1]| where subscripts of |trick_buf| are circular modulo
|error_line|. The second line consists of |n|~spaces followed by |trick_buf[k .. (k + m - 1)]|,
unless |n + m > error_line|; in the latter case, further cropping is done. This is easier to
program than to explain.
The following code sets up the print routines so that they will gather the desired information.
*/
void tex_set_trick_count(void)
{
lmt_print_state.first_count = lmt_print_state.tally;
lmt_print_state.trick_count = lmt_print_state.tally + 1 + lmt_error_state.line_limits.size - lmt_error_state.half_line_limits.size;
if (lmt_print_state.trick_count < lmt_error_state.line_limits.size) {
lmt_print_state.trick_count = lmt_error_state.line_limits.size;
}
}
/*tex
We don't care too much if we stay a bit too much below the max error_line even if we have more
room on the line. If length is really an issue then any length is. After all one can set the
length larger.
This is not the nicest looking output so at some day I might spend some time on a variant that
is a bit more helpful.
*/
static void tex_aux_print_valid_utf8(int q)
{
int l = lmt_error_state.line_limits.size;
int c = (int) lmt_print_state.trick_buffer[q % l];
if (c < 128) {
tex_print_char(c);
} else if (c < 194) {
/* invalid */
} else if (c < 224) {
tex_print_char(c);
tex_print_char(lmt_print_state.trick_buffer[(q + 1) % l]);
} else if (c < 240) {
tex_print_char(c);
tex_print_char(lmt_print_state.trick_buffer[(q + 1) % l]);
tex_print_char(lmt_print_state.trick_buffer[(q + 2) % l]);
} else if (c < 245) {
tex_print_char(c);
tex_print_char(lmt_print_state.trick_buffer[(q + 1) % l]);
tex_print_char(lmt_print_state.trick_buffer[(q + 2) % l]);
tex_print_char(lmt_print_state.trick_buffer[(q + 3) % l]);
} else {
/*tex Invalid character! */
}
}
void tex_show_context(void)
{
int context_lines = -1; /*tex Number of contexts shown so far, less one: */
bool bottom_line = false; /*tex Have we reached the final context to be shown? */
lmt_input_state.base_ptr = lmt_input_state.input_stack_data.ptr;
lmt_input_state.input_stack[lmt_input_state.base_ptr] = lmt_input_state.cur_input;
while (1) {
/*tex Enter into the context. */
lmt_input_state.cur_input = lmt_input_state.input_stack[lmt_input_state.base_ptr];
if ((lmt_input_state.cur_input.state != token_list_state) && (io_file_input(lmt_input_state.cur_input.name) || (lmt_input_state.base_ptr == 0))) {
bottom_line = true;
}
if ((lmt_input_state.base_ptr == lmt_input_state.input_stack_data.ptr) || bottom_line || (context_lines < error_context_lines_par)) {
/*tex Display the current context. */
if ((lmt_input_state.base_ptr == lmt_input_state.input_stack_data.ptr) || (lmt_input_state.cur_input.state != token_list_state) || (lmt_input_state.cur_input.token_type != backed_up_text) || (lmt_input_state.cur_input.loc)) {
/*tex
We omit backed-up token lists that have already been read. Get ready to count
characters. We start pseudo printing.
This is complex code. When we display a context, we loop over context lines, but
actually we're talking of two lines: the discriptive line and the token list or
something from the buffer. Then there is that trick buffer stuff. In order to
get a better picture I expanded some variable names. Also, the length of the
input state line never got registered as there was no pseudo printing used.
Because in \LUAMETATEX\ the content can come from \LUA\ we display the state
somewhat differently: we also show the input level for line numbers and we tag
for instance a macro, just for consistency. The contexts are separated by
newlines.
*/
bool skip = false;
tex_print_nlp();
tex_aux_print_current_input_state();
/*
The |pseudo_selector_code| selector value is only set in this context. It makes
sure that we end up at the place where the problem happens.
*/
{
int saved_selector = lmt_print_state.selector;
lmt_print_state.tally = 0;
lmt_print_state.selector = pseudo_selector_code;
lmt_print_state.trick_count = 1000000;
if (lmt_input_state.cur_input.state == token_list_state) {
halfword head = lmt_input_state.cur_input.token_type < macro_text ? lmt_input_state.cur_input.start : token_link(lmt_input_state.cur_input.start);
tex_show_token_list_context(head, lmt_input_state.cur_input.loc);
} else if (lmt_input_state.cur_input.name == io_lua_input_code) {
skip = true;
} else {
/*tex Before we pseudo print the line we determine the effective end. */
int j = lmt_input_state.cur_input.limit;
if (lmt_fileio_state.io_buffer[lmt_input_state.cur_input.limit] != end_line_char_par) {
++j;
}
if (j > 0) {
for (int i = lmt_input_state.cur_input.start; i <= j - 1; i++) {
if (i == lmt_input_state.cur_input.loc) {
tex_set_trick_count();
}
tex_print_char(lmt_fileio_state.io_buffer[i]);
}
}
}
lmt_print_state.selector = saved_selector;
}
/*tex Print two lines using the tricky pseudo printed information. */
if (! skip) {
int p; /*tex Starting or ending place in |trick_buf|. */
int m; /*tex Context information gathered for line 2. */
int n; /*tex Length of line 1. */
tex_print_nlp();
tex_aux_print_indent();
if (lmt_print_state.trick_count == 1000000) {
tex_set_trick_count();
}
/*tex The |set_trick_count| must be performed. */
if (lmt_print_state.tally < lmt_print_state.trick_count) {
m = lmt_print_state.tally - lmt_print_state.first_count;
} else {
m = lmt_print_state.trick_count - lmt_print_state.first_count;
}
if (lmt_print_state.first_count <= lmt_error_state.half_line_limits.size) {
p = 0;
n = lmt_print_state.first_count;
} else {
tex_print_str("...");
p = lmt_print_state.first_count - lmt_error_state.half_line_limits.size + 3;
n = lmt_error_state.half_line_limits.size;
}
for (int q = p; q <= lmt_print_state.first_count - 1; q++) {
tex_aux_print_valid_utf8(q);
}
/*tex
Print |n| spaces to begin line 2. Instead of |n| we use a fixed value of
|error_context_indent|.
*/
if (m + n > lmt_error_state.line_limits.size) {
p = lmt_print_state.first_count + (lmt_error_state.line_limits.size - n - 3);
} else {
p = lmt_print_state.first_count + m;
}
if (lmt_print_state.first_count <= p - 1) {
tex_print_nlp();
tex_aux_print_indent();
for (int q = lmt_print_state.first_count; q <= p - 1; q++) {
tex_aux_print_valid_utf8(q);
}
if (m + n > lmt_error_state.line_limits.size) {
tex_print_str(" ...");
}
}
}
++context_lines;
}
} else if (context_lines == error_context_lines_par) {
tex_print_nlp();
tex_print_str(" ...");
tex_print_nlp();
++context_lines;
/*tex Omitted if |error_context_lines_par < 0|. */
}
if (bottom_line) {
break;
} else {
--lmt_input_state.base_ptr;
}
}
/*tex Restore the original state. */
lmt_input_state.cur_input = lmt_input_state.input_stack[lmt_input_state.input_stack_data.ptr];
tex_print_ln();
tex_print_nlp();
}
/*tex
The following subroutines change the input status in commonly needed ways. First comes
|push_input|, which stores the current state and creates a new level (having, initially, the
same properties as the old). Enter a new input level, save the old:
*/
static inline void tex_aux_push_input(void)
{
if (tex_aux_room_on_input_stack()) {
lmt_input_state.input_stack[lmt_input_state.input_stack_data.ptr] = lmt_input_state.cur_input;
++lmt_input_state.input_stack_data.ptr;
} else {
tex_overflow_error("input stack size", lmt_input_state.input_stack_data.size);
}
}
static inline void tex_aux_pop_input(void)
{
lmt_input_state.cur_input = lmt_input_state.input_stack[--lmt_input_state.input_stack_data.ptr];
}
/*tex
Here is a procedure that starts a new level of token-list input, given a token list |p| and its
type |t|. If |t=macro|, the calling routine should set |name| and |loc|.
I added a few few simple variants because the compiler will then inline the little code involved
and these are used often.
*/
void tex_begin_token_list(halfword t, quarterword kind)
{
tex_aux_push_input();
lmt_input_state.cur_input.state = token_list_state;
lmt_input_state.cur_input.start = t;
lmt_input_state.cur_input.token_type = kind;
if (kind < macro_text) {
lmt_input_state.cur_input.loc = t;
} else if (kind == macro_text) {
/*tex More frequently when processing a document: */
tex_add_token_reference(t);
lmt_input_state.cur_input.parameter_start = lmt_input_state.parameter_stack_data.ptr;
} else {
/*tex More frequently when making a format: */
tex_add_token_reference(t);
/*tex The token list started with a reference count. */
lmt_input_state.cur_input.loc = token_link(t);
if (tracing_macros_par > 0) {
tex_begin_diagnostic();
if (kind < n_of_token_types && token_types_verbose[kind]) {
tex_print_str(token_types_texts[kind]);
} else {
/* messy offsets */
tex_print_cmd_chr(internal_toks_cmd, kind - output_text + internal_toks_location(output_routine_code));
}
tex_print_str("->");
if (kind == loop_text || kind == local_loop_text) {
tex_print_char('{');
}
tex_token_show(t);
tex_end_diagnostic();
}
}
}
/*tex Testing for |t == null| happens before calling the following functions. */
void tex_begin_parameter_list(halfword t)
{
tex_aux_push_input();
lmt_input_state.cur_input.state = token_list_state;
lmt_input_state.cur_input.start = t;
lmt_input_state.cur_input.loc = t;
lmt_input_state.cur_input.token_type = parameter_text;
}
/*
void tex_begin_backed_up_list_checked(halfword t)
{
if (lmt_input_state.cur_input.state == token_list_state && lmt_input_state.cur_input.start == lmt_input_state.cur_input.loc && lmt_input_state.cur_input.token_type == backed_up_text) {
halfword c = t ;
while (token_link(c)) {
c = token_link(c);
}
token_link(c) = lmt_input_state.cur_input.start;
} else {
tex_aux_push_input();
lmt_input_state.cur_input.state = token_list_state;
lmt_input_state.cur_input.token_type = backed_up_text;
}
lmt_input_state.cur_input.start = t;
lmt_input_state.cur_input.loc = t;
}
*/
void tex_begin_backed_up_list(halfword t)
{
tex_aux_push_input();
lmt_input_state.cur_input.state = token_list_state;
lmt_input_state.cur_input.start = t;
lmt_input_state.cur_input.loc = t;
lmt_input_state.cur_input.token_type = backed_up_text;
}
void tex_begin_inserted_list(halfword t)
{
tex_aux_push_input();
lmt_input_state.cur_input.state = token_list_state;
lmt_input_state.cur_input.start = t;
lmt_input_state.cur_input.loc = t;
lmt_input_state.cur_input.token_type = inserted_text;
}
void tex_begin_associated_list(halfword t)
{
tex_aux_push_input();
lmt_input_state.cur_input.state = token_list_state;
lmt_input_state.cur_input.start = t;
lmt_input_state.cur_input.loc = t;
lmt_input_state.cur_input.token_type = associated_text;
}
void tex_begin_macro_list(halfword t)
{
tex_aux_push_input();
lmt_input_state.cur_input.state = token_list_state;
lmt_input_state.cur_input.start = t;
tex_add_token_reference(t);
lmt_input_state.cur_input.token_type = macro_text;
lmt_input_state.cur_input.parameter_start = lmt_input_state.parameter_stack_data.ptr;
}
/*tex
When a token list has been fully scanned, the following computations should be done as we leave
that level of input. The |token_type| tends to be equal to either |backed_up| or |inserted|
about 2/3 of the time.
*/
void tex_end_token_list(void)
{
/*tex Leave a token-list input level: */
switch (lmt_input_state.cur_input.token_type) {
case parameter_text:
break;
case template_pre_text:
if (lmt_input_state.align_state > interwoven_alignment_threshold) {
lmt_input_state.align_state = 0;
} else {
tex_alignment_interwoven_error(7);
}
break;
case template_post_text:
case associated_text:
break;
case backed_up_text:
case inserted_text:
// case end_of_group_text:
/* case local_text: */
tex_flush_token_list(lmt_input_state.cur_input.start);
break;
case macro_text:
{
tex_delete_token_reference(lmt_input_state.cur_input.start);
if (get_token_preamble(lmt_input_state.cur_input.start)) {
/*tex Parameters must be flushed: */
int ptr = lmt_input_state.parameter_stack_data.ptr;
int start = lmt_input_state.cur_input.parameter_start;
while (ptr > start) {
if (lmt_input_state.parameter_stack[--ptr]) {
tex_flush_token_list(lmt_input_state.parameter_stack[ptr]);
// lmt_input_state.parameter_stack[ptr] = null;
}
}
lmt_input_state.parameter_stack_data.ptr = start;
} else {
/*tex We have no arguments so we save very little runtime here. */
}
break;
}
default:
/*tex Update the reference count: */
tex_delete_token_reference(lmt_input_state.cur_input.start);
break;
}
tex_aux_pop_input();
/* check_interrupt(); */
}
void tex_quit_token_list(void)
{
if (lmt_input_state.cur_input.index > 0) {
if (lmt_input_state.cur_input.token_type == backed_up_text) {
/* \expandafter \ignorerest */
tex_end_token_list();
}
tex_end_token_list();
}
}
/*tex A special version used in macro expansion. Maybe some day I'll optimize it. */
void tex_cleanup_input_state(void)
{
while (! lmt_input_state.cur_input.loc && lmt_input_state.cur_input.state == token_list_state) {
switch (lmt_input_state.cur_input.token_type) {
case parameter_text:
break;
case template_pre_text:
if (lmt_input_state.align_state > interwoven_alignment_threshold) {
lmt_input_state.align_state = 0;
} else {
tex_alignment_interwoven_error(7);
}
break;
case template_post_text:
case associated_text:
break;
case backed_up_text:
case inserted_text:
/* case end_of_group_text: */
/* case local_text: */
tex_flush_token_list(lmt_input_state.cur_input.start);
break;
case macro_text:
{
tex_delete_token_reference(lmt_input_state.cur_input.start);
if (get_token_preamble(lmt_input_state.cur_input.start)) {
/*tex Parameters must be flushed: */
int ptr = lmt_input_state.parameter_stack_data.ptr;
int start = lmt_input_state.cur_input.parameter_start;
while (ptr > start) {
if (lmt_input_state.parameter_stack[--ptr]) {
tex_flush_token_list(lmt_input_state.parameter_stack[ptr]);
// lmt_input_state.parameter_stack[ptr] = null;
}
}
lmt_input_state.parameter_stack_data.ptr = start;
}
break;
}
default:
/*tex Update the reference count: */
tex_delete_token_reference(lmt_input_state.cur_input.start);
break;
}
tex_aux_pop_input();
}
}
/*tex
Sometimes \TEX\ has read too far and wants to \quote {unscan} what it has seen. The |back_input|
procedure takes care of this by putting the token just scanned back into the input stream, ready
to be read again. This procedure can be used only if |cur_tok| represents the token to be
replaced. Some applications of \TEX\ use this procedure a lot, so it has been slightly optimized
for speed.
*/
/*tex Undo one token of input: */
void tex_back_input(halfword t)
{
while ((lmt_input_state.cur_input.state == token_list_state) && (! lmt_input_state.cur_input.loc) && (lmt_input_state.cur_input.token_type != template_post_text)) {
tex_end_token_list();
}
{
/*tex A token list of length one: */
halfword p = tex_get_available_token(t);
if (t < right_brace_limit) {
if (t < left_brace_limit) {
--lmt_input_state.align_state;
} else {
++lmt_input_state.align_state;
}
}
if (lmt_input_state.cur_input.state == token_list_state && lmt_input_state.cur_input.start == lmt_input_state.cur_input.loc && lmt_input_state.cur_input.token_type == backed_up_text) {
token_link(p) = lmt_input_state.cur_input.start;
} else {
tex_aux_push_input();
lmt_input_state.cur_input.state = token_list_state;
lmt_input_state.cur_input.token_type = backed_up_text;
}
lmt_input_state.cur_input.start = p;
lmt_input_state.cur_input.loc = p;
}
}
/*tex Insert token |p| into \TEX's input: */
void tex_reinsert_token(halfword t)
{
halfword p = tex_get_available_token(t);
set_token_link(p, lmt_input_state.cur_input.loc);
lmt_input_state.cur_input.start = p;
lmt_input_state.cur_input.loc = p;
if (t < right_brace_limit) {
if (t < left_brace_limit) {
--lmt_input_state.align_state;
} else {
++lmt_input_state.align_state;
}
}
}
/*tex Some aftergroup related code: */
void tex_insert_input(halfword h)
{
if (h) {
while ((lmt_input_state.cur_input.state == token_list_state) && (! lmt_input_state.cur_input.loc) && (lmt_input_state.cur_input.token_type != template_post_text)) {
tex_end_token_list();
}
if (token_info(h) < right_brace_limit) {
if (token_info(h) < left_brace_limit) {
--lmt_input_state.align_state;
} else {
++lmt_input_state.align_state;
}
}
tex_aux_push_input();
lmt_input_state.cur_input.start = h;
lmt_input_state.cur_input.loc = h;
lmt_input_state.cur_input.state = token_list_state;
lmt_input_state.cur_input.token_type = inserted_text;
/*
This happens seldom, so we don't save much on pushing / popping the input:
*/
/*
if (lmt_input_state.cur_input.state == token_list_state && lmt_input_state.cur_input.start == lmt_input_state.cur_input.loc && lmt_input_state.cur_input.token_type == inserted_text) {
token_link(h) = lmt_input_state.cur_input.start;
} else {
tex_aux_push_input();
lmt_input_state.cur_input.state = token_list_state;
lmt_input_state.cur_input.token_type = inserted_text;
}
lmt_input_state.cur_input.start = h;
lmt_input_state.cur_input.loc = h;
*/
}
}
void tex_append_input(halfword h)
{
if (h) {
halfword n = h;
if (n) {
while (token_link(n)) {
n = token_link(n);
}
set_token_link(n, lmt_input_state.cur_input.loc);
} else {
set_token_link(h, lmt_input_state.cur_input.loc);
}
lmt_input_state.cur_input.start = h;
lmt_input_state.cur_input.loc = h;
}
}
/*tex
The |begin_file_reading| procedure starts a new level of input for lines of characters to be
read from a file, or as an insertion from the terminal. It does not take care of opening the
file, nor does it set |loc| or |limit| or |line|.
*/
void tex_begin_file_reading(void)
{
++lmt_input_state.in_stack_data.ptr;
if (tex_aux_room_on_in_stack() && tex_room_in_buffer(lmt_fileio_state.io_first)) {
tex_aux_push_input();
lmt_input_state.cur_input.index = (short) lmt_input_state.in_stack_data.ptr;
lmt_input_state.in_stack[lmt_input_state.cur_input.index].full_source_filename = NULL;
lmt_input_state.in_stack[lmt_input_state.cur_input.index].end_of_file_seen = 0;
lmt_input_state.in_stack[lmt_input_state.cur_input.index].at_end_of_file = null;
lmt_input_state.in_stack[lmt_input_state.cur_input.index].group = cur_boundary;
lmt_input_state.in_stack[lmt_input_state.cur_input.index].line = lmt_input_state.input_line;
lmt_input_state.in_stack[lmt_input_state.cur_input.index].if_ptr = lmt_condition_state.cond_ptr;
lmt_input_state.cur_input.start = lmt_fileio_state.io_first;
lmt_input_state.cur_input.state = mid_line_state;
lmt_input_state.cur_input.name = io_initial_input_code;
lmt_input_state.cur_input.cattable = default_catcode_table_preset;
lmt_input_state.cur_input.partial = 0;
/*tex Prepare terminal input \SYNCTEX\ information. */
lmt_input_state.cur_input.state_file = 0;
lmt_input_state.cur_input.state_line = 0;
}
}
/*tex
Conversely, the variables must be downdated when such a level of input is finished. What needs
to be closed depends on what was opened.
*/
void tex_end_file_reading(void)
{
lmt_fileio_state.io_first = lmt_input_state.cur_input.start;
lmt_input_state.input_line = lmt_input_state.in_stack[lmt_input_state.cur_input.index].line;
switch (lmt_input_state.cur_input.name) {
case io_initial_input_code:
break;
case io_lua_input_code:
case io_token_input_code:
case io_token_eof_input_code:
/*tex happens more frequently than reading from file */
lmt_cstring_close();
break;
case io_tex_macro_code:
break;
default:
/*tex A file opened with |\input|, |\read...| is handled by \LUA. */
tex_lua_a_close_in();
if (lmt_input_state.in_stack[lmt_input_state.cur_input.index].full_source_filename) {
lmt_memory_free(lmt_input_state.in_stack[lmt_input_state.cur_input.index].full_source_filename);
lmt_input_state.in_stack[lmt_input_state.cur_input.index].full_source_filename = NULL;
}
if (lmt_input_state.in_stack[lmt_input_state.cur_input.index].at_end_of_file) {
tex_flush_token_list(lmt_input_state.in_stack[lmt_input_state.cur_input.index].at_end_of_file);
lmt_input_state.in_stack[lmt_input_state.cur_input.index].at_end_of_file = null;
}
break;
}
tex_aux_pop_input();
--lmt_input_state.in_stack_data.ptr;
}
/*tex
To get \TEX's whole input mechanism going, we perform the following actions.
*/
void tex_initialize_inputstack(void)
{
lmt_input_state.input_stack_data.ptr = 0;
lmt_input_state.input_stack_data.top = 0;
lmt_input_state.in_stack[0].full_source_filename = NULL;
lmt_input_state.in_stack_data.ptr = 0;
lmt_input_state.open_files = 0;
lmt_fileio_state.io_buffer_data.top = 0;
lmt_input_state.in_stack[0].group = 0;
lmt_input_state.in_stack[0].if_ptr = null;
lmt_input_state.parameter_stack_data.ptr = 0;
lmt_input_state.parameter_stack_data.top = 0;
lmt_input_state.scanner_status = scanner_is_normal;
lmt_input_state.warning_index = null;
lmt_fileio_state.io_first = 1;
lmt_input_state.cur_input.state = new_line_state;
lmt_input_state.cur_input.start = 1;
lmt_input_state.cur_input.index = 0;
lmt_input_state.input_line = 0;
lmt_input_state.cur_input.name = io_initial_input_code;
lmt_token_state.force_eof = 0;
lmt_token_state.luacstrings = 0;
lmt_input_state.cur_input.cattable = default_catcode_table_preset;
lmt_input_state.cur_input.partial = 0;
lmt_input_state.align_state = busy_alignment_state;
}
/*tex
Currently |iotype| can be |io_token_input_code| or |io_token_eof_input_code| but the idea
was to get rid of the eof variant. However, it seems that there are still use cases (not
in \CONTEXT).
*/
void tex_tex_string_start(int iotype, int cattable)
{
/* (void) iotype; */
{
halfword head = tex_scan_general_text(NULL);
int saved_selector = lmt_print_state.selector;
lmt_print_state.selector = new_string_selector_code;
tex_show_token_list(head, 0, 0);
lmt_print_state.selector = saved_selector;
tex_flush_token_list(head);
}
{
int len;
char *str = tex_take_string(&len);
lmt_cstring_store(str, len, tex_valid_catcode_table(cattable) ? cattable : cat_code_table_par);
tex_begin_file_reading();
lmt_input_state.input_line = 0;
lmt_input_state.cur_input.limit = lmt_input_state.cur_input.start;
lmt_input_state.cur_input.loc = lmt_input_state.cur_input.limit + 1;
lmt_input_state.cur_input.name = iotype; /* io_token_input_code; */
lmt_cstring_start();
}
}
void tex_lua_string_start(void)
{
/*tex Set up |cur_file| and a new level of input: */
tex_begin_file_reading();
lmt_input_state.input_line = 0;
lmt_input_state.cur_input.limit = lmt_input_state.cur_input.start;
/*tex Force line read: */
lmt_input_state.cur_input.loc = lmt_input_state.cur_input.limit + 1;
lmt_input_state.cur_input.name = io_lua_input_code;
lmt_cstring_start();
}
void tex_any_string_start(char* s)
{
/* via terminal emulator */
/*
int len = strlen(s);
if (len > 0 && room_in_buffer(len + 1)) {
fileio_state.io_last = fileio_state.io_first;
strcpy((char *) &fileio_state.io_buffer[fileio_state.io_first], s);
fileio_state.io_last += len;
input_state.cur_input.loc = fileio_state.io_first;
input_state.cur_input.limit = fileio_state.io_last;
fileio_state.io_first = fileio_state.io_last + 1;
}
*/
/* via token input emulator */
lmt_cstring_store(s, (int) strlen(s), cat_code_table_par);
tex_begin_file_reading();
lmt_input_state.input_line = 0;
lmt_input_state.cur_input.limit = lmt_input_state.cur_input.start;
lmt_input_state.cur_input.loc = lmt_input_state.cur_input.limit + 1;
lmt_input_state.cur_input.name = io_token_input_code;
lmt_cstring_start();
}
/*tex a list without ref count*/
halfword tex_wrapped_token_list(halfword list)
{
halfword head = tex_store_new_token(null, left_brace_token + '{');
halfword tail = head;
token_link(tail) = token_link(list);
while (token_link(tail)) {
tail = token_link(tail);
}
tail = tex_store_new_token(tail, right_brace_token + '}');
return head;
}
const char *tex_current_input_file_name(void)
{
int level = lmt_input_state.in_stack_data.ptr;
while (level > 0) {
const char *s = lmt_input_state.in_stack[level--].full_source_filename;
if (s) {
return s;
}
}
/*tex old method */
level = lmt_input_state.in_stack_data.ptr;
while (level > 0) {
int t = lmt_input_state.input_stack[level--].name;
if (t >= cs_offset_value) {
return (const char *) str_string(t);
}
}
return NULL;
}
|