-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhitex-format.ch
More file actions
2048 lines (1812 loc) · 46.5 KB
/
hitex-format.ch
File metadata and controls
2048 lines (1812 loc) · 46.5 KB
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
@x [0.0] l.239
@s uint8_t int
@y
@s int8_t int
@s uint8_t int
@s UTF_code int
@s UTF8_code int
@z
@x [0.0] l.262
@s to do
@y
@s to do
\def\contentspagenumber{0}
\def\tocpages{3} % HiTeX has a long ToC
\pageno=\contentspagenumber \advance \pageno by \tocpages
@z
@x [1.4] l.462
@<Initialize whatever \TeX\ might access@>;
@y
@<Initialize whatever \TeX\ might access@>@;
@z
@x [3.22] l.745
static unsigned char @!name_of_file0[file_name_size+1]={0},
@y
static unsigned char @!name_of_file0[file_name_size+1]={0},@|
@z
@x [4.42] l.1143
@t\4@>@<Declare \Prote\ procedures for strings@>@;
@y
@#@<Declare \Prote\ procedures for strings@>@;
@z
@x [5.51] l.1305
@<Basic printing procedures@>=
#define @[put(F)@] @[fwrite(&((F).d)@],@[sizeof((F).d),1,(F).f)@]@;
@y
@s sizeof x
@<Basic printing procedures@>=
#define @[put(F)@] @[fwrite(&((F).d),sizeof((F).d),1,(F).f)@]
@z
@x [5.54] l.1387
while (*s!=0) print_char(*s++);@+
@y
while (*s!=0) print_char(*s++);
@z
@x [5.60] l.1513
@/do@+{dig[k]=n%10;n=n/10;incr(k);
}@+ while (!(n==0));
@y
do {dig[k]=n%10;n=n/10;incr(k);
} while (!(n==0));
@z
@x [5.62] l.1532
@/do@+{dig[k]=n%16;n=n/16;incr(k);
}@+ while (!(n==0));
@y
do {dig[k]=n%16;n=n/16;incr(k);
} while (!(n==0));
@z
@x [6.67] l.1609
|error;|\cr}}$$
@y
|error();|\cr}}$$
@z
@x [6.79] l.1828
@<Delete \(c)|c-"0"| tokens and |goto resume|@>@;@+break;
@t\4\4@>@;
@y
@<Delete \(c)|c-"0"| tokens and |goto resume|@>@;@+break;
@z
@x [6.84] l.1922
@/do@+{decr(help_ptr);print(help_line[help_ptr]);print_ln();
}@+ while (!(help_ptr==0));
@y
do {decr(help_ptr);print(help_line[help_ptr]);print_ln();
} while (!(help_ptr==0));
@z
@x [7.96] l.2092
typedef int32_t nonnegative_integer; /*$0\le x<2^{31}$*/
@y
typedef uint32_t nonnegative_integer; /*$0\le x<2^{31}$*/
@z
@x [7.98] l.2130
@/do@+{if (delta > unity) s=s+0100000-50000; /*round the last digit*/
print_char('0'+(s/unity));s=10*(s%unity);delta=delta*10;
}@+ while (!(s <= delta));
@y
do {if (delta > unity) s=s+0100000-50000; /*round the last digit*/
print_char('0'+(s/unity));s=10*(s%unity);delta=delta*10;
} while (!(s <= delta));
@z
@x [7.103] l.2249
@p @<Declare \Prote\ arithmetic routines@>@/
@y
@p @<Declare \Prote\ arithmetic routines@>@;
@z
@x [7.104] l.2283
@d float_constant(A) ((double)(A)) /*convert |int| constant to |double|*/
@y
@d float_constant(A) ((double)(A)) /*convert |int| constant to |double|*/
@#
@d perror e@&r@&r@&o@&r /* this is a \.{CWEB} coding trick: */
@f perror error /* `\&{perror}' will be equivalent to `\&{error}' */
@f error x /* but `|error|' will not be treated as a reserved word */
@z
@x [7.104] l.2289
#error @=float type must have size 4@>
@y
#perror @=float type must have size 4@>
@z
@x [8.108] l.2399
typedef struct { @;@/
@y
@#
typedef struct {
@z
@x [8.108] l.2406
typedef struct { @;@/
@y
@#
typedef struct {
@z
@x [8.108] l.2412
typedef struct { @;@/
@y
@#
typedef struct {
@z
@x [8.108] l.2419
typedef struct {@+FILE *f;@+memory_word@,d;@+} word_file;
@y
@#
typedef struct {@+FILE *f;@+memory_word@,d;@+} word_file;
@z
@x [9.115] l.2562
link(p)=null; /*provide an oft-desired initialization of the new node*/
#ifdef @!STAT
incr(dyn_used);
#endif
@; /*maintain statistics*/
@y
link(p)=null; /*provide an oft-desired initialization of the new node*/
incr_dyn_used; /*maintain statistics*/
@z
@x [9.118] l.2601
@/do@+{q=r;r=link(r);
#ifdef @!STAT
decr(dyn_used);
#endif
}@+ while (!(r==null)); /*now |q| is the last node on the list*/
@y
do {q=r;r=link(r);
decr_dyn_used; /*maintain statistics*/
} while (!(r==null)); /*now |q| is the last node on the list*/
@z
@x [9.120] l.2650
@/do@+{@<Try to allocate within node |p| and its physical successors, and
@y
do {@<Try to allocate within node |p| and its physical successors, and
@z
@x [9.120] l.2654
}@+ while (!(p==rover)); /*repeat until the whole list has been traversed*/
@y
} while (!(p==rover)); /*repeat until the whole list has been traversed*/
@z
@x [10.129] l.2823
In order to make sure that the |character| code fits in a quarterword,
@y
In order to ensure that the |character| code fits in a quarterword,
@z
@x [10.140] l.2998
If |pre_break(p)==null|, the |ex_hyphen_penalty| will be charged for this
break. Otherwise the |hyphen_penalty| will be charged. The texts will
@y
If |pre_break(p)==null|, |ex_hyphen_penalty| will be charged for this
break. Otherwise |hyphen_penalty| will be charged. The texts will
@z
@x [10.147] l.3147
q=@<Current |mem| equivalent of glue parameter number |n|@>@t@>;
@y
q=@[@<Current |mem| equivalent of glue parameter number |n|@>@];
@z
@x [10.150] l.3187
@d kern_node 11 /*|type| of a kern node*/
@d explicit 1 /*|subtype| of kern nodes from \.{\\kern} and \.{\\/}*/
@y
@s explicit true
@d kern_node 11 /*|type| of a kern node*/
@d explicit 1 /*|subtype| of kern nodes from \.{\\kern} and \.{\\/}*/
@z
@x [11.160] l.3348
@t\hskip10pt@>static bool @!was_free0[mem_max-mem_min+1],
@y
static bool @!was_free0[mem_max-mem_min+1],
@z
@x [11.160] l.3351
@t\hskip10pt@>static pointer @!was_mem_end, @!was_lo_max, @!was_hi_min;
@y
static pointer @!was_mem_end, @!was_lo_max, @!was_hi_min;
@z
@x [11.160] l.3353
@t\hskip10pt@>static bool @!panicking; /*do we want to check memory constantly?*/
@y
static bool @!panicking; /*do we want to check memory constantly?*/
@z
@x [11.164] l.3403
@/do@+{if ((p >= lo_mem_max)||(p < mem_min)) clobbered=true;
@y
do {if ((p >= lo_mem_max)||(p < mem_min)) clobbered=true;
@z
@x [11.164] l.3420
}@+ while (!(p==rover));
@y
} while (!(p==rover));
@z
@x [12.169] l.3515
else@<Print the font identifier for |font(p)|@>;
@y
else@<Print the font identifier for |font(p)|@>@;
@z
@x [12.169] l.3524
else@<Print a short indication of the contents of node |p|@>;
@y
else@<Print a short indication of the contents of node |p|@>@;
@z
@x [12.171] l.3557
else@<Print the font identifier for |font(p)|@>;
@y
else@<Print the font identifier for |font(p)|@>@;
@z
@x [12.178] l.3697
@t\4@>@<Cases of |show_node_list| that arise in mlists only@>@;
@y
@/@t\4@>@<Cases of |show_node_list| that arise in mlists only@>@;
@z
@x [12.193] l.3858
{@+@<Assign the values |depth_threshold:=show_box_depth| and |breadth_max:=show_box_breadth|@>;
@y
{@+@<Assign the values |depth_threshold=show_box_depth| and |breadth_max=show_box_breadth|@>;
@z
@x [13.196] l.3896
fast_delete_glue_ref(p)
@y
fast_delete_glue_ref(p)@;
@z
@x [13.197] l.3937
@t\4@>@<Cases of |flush_node_list| that arise in mlists only@>@;
@y
@/@t\4@>@<Cases of |flush_node_list| that arise in mlists only@>@;
@z
@x [17.226] l.4849
@/@<Cases of |assign_toks| for |print_cmd_chr|@>@/
@y
@/@t\4@>@<Cases of |assign_toks| for |print_cmd_chr|@>@;
@z
@x [17.231] l.5117
@<Assign the values |depth_threshold:=show_box_depth|...@>=
@y
@<Assign the values |depth_threshold=show_box_depth|...@>=
@z
@x [17.232] l.5182
@/@<Cases for |print_param|@>@/
@y
@/@t\4@>@<Cases for |print_param|@>@;
@z
@x [17.236] l.5337
@p static void fix_date_and_time(void)
@y
@s tm int
@p static void fix_date_and_time(void)
@z
@x [17.247] l.5540
@p @t\4@>@<Declare the procedure called |print_cmd_chr|@>@;@/
#ifdef @!STAT
@y
@p @<Declare the procedure called |print_cmd_chr|@>@;
#ifdef @!STAT
@+@t}\6\4\4{@>
@z
@x [18.255] l.5666
{@+@/do@+{if (hash_is_full) overflow("hash size", hash_size);
@y
{@+do {if (hash_is_full) overflow("hash size", hash_size);
@z
@x [18.255] l.5669
}@+ while (!(text(hash_used)==0)); /*search for an empty location in |hash|*/
@y
} while (!(text(hash_used)==0)); /*search for an empty location in |hash|*/
@z
@x [18.261] l.5890
@/@<Cases of |expandafter| for |print_cmd_chr|@>@/
@y
@/@t\4@>@<Cases of |expandafter| for |print_cmd_chr|@>@;
@z
@x [18.261] l.5910
case read_to_cs: if (chr_code==0) print_esc("read")
@<Cases of |read| for |print_cmd_chr|@>;@+break;
@y
case read_to_cs: if (chr_code==0) print_esc("read");
else @<Cases of |read| for |print_cmd_chr|@>;@+break;
@z
@x [18.261] l.5917
@<Cases of |set_shape| for |print_cmd_chr|@>@;@/
@y
@/@t\4@>@<Cases of |set_shape| for |print_cmd_chr|@>@;
@z
@x [18.261] l.5919
case the: if (chr_code==0) print_esc("the")
@<Cases of |the| for |print_cmd_chr|@>;@+break;
@y
case the: if (chr_code==0) print_esc("the");
else @<Cases of |the| for |print_cmd_chr|@>;@+break;
@z
@x [18.262] l.5941
printn_esc(font_id_text(font(p)))
@y
printn_esc(font_id_text(font(p)));
@z
@x [19.263] l.5967
of the current group, when it should be
@y
of the current group and
@z
@x [19.270] l.6126
@/@<Cases for |eq_destroy|@>@/
@y
@/@t\4@>@<Cases for |eq_destroy|@>@;
@z
@x [19.272] l.6164
#define assign_trace(A, B)
@y
#define assign_trace(A, B) @[@]
@z
@x [21.293] l.6676
@t\4@>@<Cases of |print_cmd_chr| for symbolic printing of primitives@>@/
@y
@/@t\4@>@<Cases of |print_cmd_chr| for symbolic printing of primitives@>@;
@z
@x [23.326] l.7414
first=buf_size;@/do@+{buffer[first]=0;decr(first);}@+ while (!(first==0));
@y
first=buf_size; do {buffer[first]=0;decr(first);} while (!(first==0));
@z
@x [24.328] l.7448
to the appearance of \.{\\par}; we must set |cur_cs:=par_loc|
@y
to the appearance of \.{\\par}; we must set |cur_cs=par_loc|
@z
@x [24.339] l.7619
any_state_plus(escape): @<Scan a control sequence and set |state:=skip_blanks|
@y
any_state_plus(escape): @<Scan a control sequence and set |state=skip_blanks|
@z
@x [24.339] l.7622
and set |state:=mid_line|@>@;@+break;
@y
and set |state=mid_line|@>@;@+break;
@z
@x [24.339] l.7624
like~\.{\^\^A} or~\.{\^\^df}, then |goto reswitch|, otherwise set |state:=mid_line|@>@;@+break;
@y
like~\.{\^\^A} or~\.{\^\^df}, then |goto reswitch|, otherwise set |state=mid_line|@>@;@+break;
@z
@x [24.339] l.7626
@t\4@>@<Handle situations involving spaces, braces, changes of state@>@;
@y
@/@t\4@>@<Handle situations involving spaces, braces, changes of state@>@;
@z
@x [24.351] l.7810
@/do@+{j=k; k=utf8_get_cur_chr(buffer,k,limit);
@y
@/do {j=k; k=utf8_get_cur_chr(buffer,k,limit);
@z
@x [24.351] l.7812
}@+ while (!((cat!=letter)||(k > limit)));
@y
}@+ while (!((cat!=letter)||(k > limit)));
@z
@x [25.362] l.8057
@/@<Cases for |expandafter|@>@/
@y
@/@t\4@>@<Cases for |expandafter|@>@;
@z
@x [25.364] l.8079
necessary to insert a special `|dont_expand|' marker into \TeX's reading
@y
necessary to insert a special marker `|dont_expand|' into \TeX's reading
@z
@x [25.367] l.8121
@/do@+{get_x_token();
if (cur_cs==0) store_new_token(cur_tok);
}@+ while (!(cur_cs!=0));
@y
do {get_x_token();
if (cur_cs==0) store_new_token(cur_tok);
} while (!(cur_cs!=0));
@z
@x [25.372] l.8181
case input: if (chr_code==0) print_esc("input")
@/@<Cases of |input| for |print_cmd_chr|@>;@/
@y
case input: if (chr_code==0) print_esc("input");
else @<Cases of |input| for |print_cmd_chr|@>@;
@z
@x [25.373] l.8186
if (cur_chr==1) force_eof=true
@/@<Cases for |input|@>;@/
else if (name_in_progress) insert_relax();
else start_input()
@y
if (cur_chr==1) force_eof=true;
else @<Cases for |input|@>@;
else if (name_in_progress) insert_relax();
else start_input();
@z
@x [25.386] l.8399
@/do@+{link(temp_head)=null;
@y
do {link(temp_head)=null;
@z
@x [25.386] l.8404
@<Scan a parameter until its delimiter string has been found; or, if |s=null|,
@y
@<Scan a parameter until its delimiter string has been found; or, if |s==null|,
@z
@x [25.386] l.8407
}@+ while (!(info(r)==end_match_token));
@y
} while (!(info(r)==end_match_token));
@z
@x [25.387] l.8421
resume| if a partial match is still in effect; but abort if |s=null|@>;
@y
resume| if a partial match is still in effect; but abort if |s==null|@>;
@z
@x [25.392] l.8507
@/do@+{store_new_token(info(t));incr(m);u=link(t);v=s;
@y
do {store_new_token(info(t));incr(m);u=link(t);v=s;
@z
@x [25.392] l.8516
}@+ while (!(t==r));
@y
} while (!(t==r));
@z
@x [26.399] l.8608
@/do@+{get_x_token();
}@+ while (!((cur_cmd!=spacer)&&(cur_cmd!=relax)))
@y
do get_x_token(); while (!((cur_cmd!=spacer)&&(cur_cmd!=relax)))
@z
@x [26.401] l.8620
@/do@+{get_x_token();
}@+ while (!(cur_cmd!=spacer))
@y
do get_x_token(); while (!(cur_cmd!=spacer))
@z
@x [26.404] l.8680
@t\4\4@>@<Declare procedures that scan restricted classes of integers@>@;
@t\4\4@>@<Declare \eTeX\ procedures for scanning@>@;
@t\4\4@>@<Declare procedures that scan font-related stuff@>@;
@y
@#@<Declare procedures that scan restricted classes of integers@>@;
@<Declare \eTeX\ procedures for scanning@>@;
@<Declare procedures that scan font-related stuff@>@;
@z
@x [26.406] l.8725
and `\.{\\muskip}' all having |internal_register| as their command code; they are
@y
and `\.{\\muskip}' all having command code |internal_register|; they are
@z
@x [26.408] l.8763
identifier, provided that |level=tok_val|@>@;@+break;
@y
identifier, provided that |level==tok_val|@>@;@+break;
@z
@x [26.412] l.8885
case set_page_int: if (chr_code==0) print_esc("deadcycles")
@/@<Cases of |set_page_int| for |print_cmd_chr|@>;@/
@+else print_esc("insertpenalties");@+break;
@y
case set_page_int: if (chr_code==0) print_esc("deadcycles");
else @<Cases of |set_page_int| for |print_cmd_chr|@>@;
else print_esc("insertpenalties");@+break;
@z
@x [26.412] l.8896
@/@<Cases of |last_item| for |print_cmd_chr|@>@/
@y
@/@t\4@>@<Cases of |last_item| for |print_cmd_chr|@>@;
@z
@x [26.414] l.8918
{@+if (m==0) cur_val=dead_cycles
@/@<Cases for `Fetch the |dead_cycles| or the |insert_penalties|'@>;@/
@y
{@+if (m==0) cur_val=dead_cycles;
else @<Cases for `Fetch the |dead_cycles| or the |insert_penalties|'@>@;
@z
@x [26.419] l.8970
@/@<Cases for fetching a dimension value@>@/
@y
@/@t\4@>@<Cases for fetching a dimension value@>@;
@z
@x [26.419] l.8977
@/@<Cases for fetching an integer value@>@/
@y
@/@t\4@>@<Cases for fetching an integer value@>@;
@z
@x [26.436] l.9202
@/do@+{@<Get the next non-blank non-call token@>;
@y
do {@<Get the next non-blank non-call token@>;
@z
@x [26.436] l.9206
}@+ while (!(cur_tok!=other_token+'+'))
@y
} while (!(cur_tok!=other_token+'+'));
@z
@x [26.443] l.9343
{@+@<Get the next non-blank non-sign...@>;
@y
{@+@<Get the next non-blank non-sign...@>@;
@z
@x [26.456] l.9582
mu=(level==mu_val);@<Get the next non-blank non-sign...@>;
@y
mu=(level==mu_val);@<Get the next non-blank non-sign...@>@;
@z
@x [27.464] l.9788
@/@<Cases of |convert| for |print_cmd_chr|@>@/
@y
@/@t\4@>@<Cases of |convert| for |print_cmd_chr|@>@;
@z
@x [27.466] l.9840
@/@<Cases of `Scan the argument for command |c|'@>@/
@y
@/@t\4@>@<Cases of `Scan the argument for command |c|'@>@;
@z
@x [27.467] l.9859
@/@<Cases of `Print the result of command |c|'@>@/
@y
@/@t\4@>@<Cases of `Print the result of command |c|'@>@;
@z
@x [27.468] l.9905
@t\4@>@<Declare \Prote\ procedures for token lists@>@;@/
@y
@#@<Declare \Prote\ procedures for token lists@>@;
@z
@x [27.477] l.10035
@/do@+{@<Input and store tokens from the next line of the file@>;
}@+ while (!(align_state==1000000));
@y
do @<Input and store tokens from the next line of the file@>@;
while (!(align_state==1000000));
@z
@x [27.478] l.10041
begin_file_reading();name=m+1;
@y
{begin_file_reading();name=m+1;
@z
@x [27.478] l.10054
{@+@/do@+{get_token();}@+ while (!(cur_tok==0));
@y
{@+do get_token(); while (!(cur_tok==0));
@z
@x [27.478] l.10059
done: end_file_reading()
@y
done: end_file_reading();}
@z
@x [28.483] l.10177
@/@<Cases of |if_test| for |print_cmd_chr|@>@/
@y
@/@t\4@>@<Cases of |if_test| for |print_cmd_chr|@>@;
@z
@x [28.496] l.10358
@/@<Cases for |conditional|@>@/
@y
@/@t\4@>@<Cases for |conditional|@>@;
@z
@x [28.501] l.10404
\.{\\if\\noexpand} or following \.{\\ifcat\\noexpand}. We use the fact that
@y
\.{\\if\\noexpand} or \.{\\ifcat\\noexpand}. We use the fact that
@z
@x [29.513] l.10648
into the |name_of_file| value that is used to open files. The present code
@y
into the value |name_of_file| that is used to open files. The present code
@z
@x [29.519] l.10723
#ifdef @!INIT
@y
#ifdef @!INIT
@+@t}\6\4\4{@>
@z
@x [30.560] l.11655
@ The preliminary settings of the index-offset variables |char_base|,
@y
@ The preliminary values of the index-offset variables |char_base|,
@z
@x [30.572] l.11900
@<Issue an error message if |cur_val=fmem_ptr|@>;
@y
@<Issue an error message if |cur_val==fmem_ptr|@>;
@z
@x [30.573] l.11903
@ @<Issue an error message if |cur_val=fmem_ptr|@>=
@y
@ @<Issue an error message if |cur_val==fmem_ptr|@>=
@z
@x [30.574] l.11915
{@+@/do@+{if (fmem_ptr==font_mem_size)
@y
{@+do {if (fmem_ptr==font_mem_size)
@z
@x [30.574] l.11919
}@+ while (!(n==font_params[f]));
@y
} while (!(n==font_params[f]));
@z
@x [32.585] l.12205
@ @p @t\4@>@<Declare procedures needed in |hlist_out|, |vlist_out|@>@t@>@/
@y
@ @p @<Declare procedures needed in |hlist_out|, |vlist_out|@>@t@>@;
@z
@x [33.610] l.12528
@p static void append_to_vlist(pointer @!b)@t\2\2@>@/
{ bool height_known;@t\1@>@/
@y
@p static void append_to_vlist(pointer @!b)
{ @+bool height_known;
@z
@x [33.610] l.12533
{@+scaled d;@t\1@> /*deficiency of space between baselines*/
@y
{@+scaled d; /*deficiency of space between baselines*/
@z
@x [33.610] l.12535
{@+d=width(baseline_skip)-prev_depth-height(b);
@y
d=width(baseline_skip)-prev_depth-height(b);
@z
@x [33.610] l.12541
}@+
} @+ else @+if (prev_depth<=unknown_depth || prev_depth>ignore_depth )@t\2@>@/
@y
} @+ else @+if (prev_depth<=unknown_depth || prev_depth>ignore_depth ) @/
@z
@x [35.631] l.13055
@d mathsy_end(A) fam_fnt(2+A)]].sc
@d mathsy(A) font_info[A+param_base[mathsy_end
@y
@d mathsy_end(A) @[fam_fnt(2+A)]].sc@]
@d mathsy(A) @[font_info[A+param_base[mathsy_end@]
@z
@x [35.638] l.13183
@/do@+{z=z-16;g=fam_fnt(z);
@y
do {z=z-16;g=fam_fnt(z);
@z
@x [35.638] l.13188
}@+ while (!(z < 16));
@y
} while (!(z < 16));
@z
@x [36.659] l.13598
@t\4@>@<Cases for noads that can follow a |bin_noad|@>@;
@t\4@>@<Cases for nodes that can appear in an mlist, after which we |goto
@y
@/@t\4@>@<Cases for noads that can follow a |bin_noad|@>@;
@/@t\4@>@<Cases for nodes that can appear in an mlist, after which we |goto
@z
@x [36.665] l.13687
by procedures with names
like |make_fraction|, |make_radical|, etc. To illustrate
@y
by procedures
like |make_fraction|, |make_radical|, etc. To illustrate
@z
@x [36.698] l.14359
@/do@+{p=link(p);
}@+ while (!(link(p)==null));
@y
do p=link(p); while (!(link(p)==null));
@z
@x [37.700] l.14501
Their |glue_sign| and |glue_order| are pre-empted as well, since it
@y
And their fields |glue_sign| and |glue_order| are pre-empted as well, since it
@z
@x [37.705] l.14585
@p @t\4@>@<Declare the procedure called |get_preamble_token|@>@t@>@/
@y
@p @<Declare the procedure called |get_preamble_token|@>@;
@z
@x [37.716] l.14773
@/do@+{get_x_or_protected();
}@+ while (!(cur_cmd!=spacer));
@y
do get_x_or_protected(); while (!(cur_cmd!=spacer));
@z
@x [37.717] l.14793
@p @t\4@>@<Declare the procedure called |init_span|@>@t@>@/
@y
@p @<Declare the procedure called |init_span|@>@;
@z
@x [37.722] l.14886
@/do@+{get_x_or_protected();
}@+ while (!(cur_cmd!=spacer));
@y
do get_x_or_protected(); while (!(cur_cmd!=spacer));
@z
@x [37.729] l.14981
@/do@+{incr(n);q=link(link(q));
}@+ while (!(q==cur_align));
@y
do {incr(n);q=link(link(q));
} while (!(q==cur_align));
@z
@x [37.731] l.15039
the alignrecords to dummy unset boxes@>;
@y
the alignrecords to dummy unset boxes@>@;
@z
@x [37.731] l.15041
{ @<Handle an alignment that depends on |hsize| or |vsize|@>@;
pop_alignment();
@y
{ /*Handle an alignment that depends on |hsize| or |vsize|*/
pointer r=get_node(align_node_size);
save_ptr=save_ptr-2;pack_begin_line=-mode_line;
type(r)=whatsit_node; subtype(r)=align_node;
align_preamble(r)=preamble;
align_list(r)=link(head);
align_extent(r)=new_xdimen(saved(1),saved_hfactor(1),saved_vfactor(1));
align_m(r)= saved(0);
align_v(r)= (mode!=-vmode);
link(head)=r; tail=r;
pack_begin_line=0;
pop_alignment();
@z
@x [37.731] l.15046
and let |p| point to this prototype box@>;
@<Set the glue in all the unset boxes of the current list@>;
flush_node_list(p);pop_alignment();
@y
and let |p| point to this prototype box@>@;
@<Set the glue in all the unset boxes of the current list@>@;
flush_node_list(p);pop_alignment();
@z
@x [37.731] l.15050
@<Insert the \(c)current list into its environment@>;
} @/
@y
@<Insert the \(c)current list into its environment@>;
} @#
@z
@x [37.732] l.15053
@ @<Handle an alignment that depends on |hsize| or |vsize|@>=
pointer r=get_node(align_node_size);
save_ptr=save_ptr-2;pack_begin_line=-mode_line;
type(r)=whatsit_node; subtype(r)=align_node;
align_preamble(r)=preamble;
align_list(r)=link(head);
align_extent(r)=new_xdimen(saved(1),saved_hfactor(1),saved_vfactor(1));
align_m(r)= saved(0);
align_v(r)= (mode!=-vmode);
link(head)=r; tail=r;
pack_begin_line=0;
@y
@z
@x [37.733] l.15091
@/do@+{flush_list(u_part(q));flush_list(v_part(q));
@y
do {flush_list(u_part(q));flush_list(v_part(q));
@z
@x [37.733] l.15105
}@+ while (!(q==null))
@y
} while (!(q==null));
@z
@x [37.735] l.15117
|@/do@+{| loop is that we want to dispense with node |r|, in |q|'s list,
@y
|do {| loop is that we want to dispense with node |r|, in |q|'s list,
@z
@x [37.735] l.15125
@/do@+{width(r)=width(r)-t;u=info(r);
@y
do {width(r)=width(r)-t;u=info(r);
@z
@x [37.735] l.15136
}@+ while (!(r==end_span));
@y
} while (!(r==end_span));
@z
@x [37.736] l.15153
@/do@+{height(q)=width(q);width(q)=0;q=link(link(q));
}@+ while (!(q==null));
@y
do {height(q)=width(q);width(q)=0;q=link(link(q));
} while (!(q==null));
@z
@x [37.736] l.15157
@/do@+{width(q)=height(q);height(q)=0;q=link(link(q));
}@+ while (!(q==null));
@y
do {width(q)=height(q);height(q)=0;q=link(link(q));
} while (!(q==null));
@z
@x [37.739] l.15196
@/do@+{@<Set the glue in node |r| and change it from an unset node@>;
r=link(link(r));s=link(link(s));
}@+ while (!(r==null));
@y
do {@<Set the glue in node |r| and change it from an unset node@>;
r=link(link(r));s=link(link(s));
} while (!(r==null));
@z
@x [38.755] l.15530
@d do_all_six(A) A(1);A(2);A(3);A(4);A(5);A(6)
@y
@d do_all_six(A) A(1);A(2);A(3);A(4);A(5);A(6)@;
@z
@x [38.761] l.15688
feasible breaks in that class; then |return| if |r=last_active|, otherwise
@y
feasible breaks in that class; then |return| if |r==last_active|, otherwise
@z
@x [38.768] l.15790
@ It is not necessary to create new active nodes having |minimal_demerits|
greater than
|minimum_demerits+abs(adj_demerits)|, since such active nodes will never
@y
@ It is not necessary to create new active nodes with |minimal_demerits|
greater than
|minimum_demerits| ${}+|abs(adj_demerits)|$, since such active nodes will never
@z
@x [38.784] l.16104
subarray |cur_active_width[2 dotdot 5]|, in units of points, fil, fill, and filll.
@y
array |cur_active_width| at positions |[2 dotdot 5]|, in units of points, fil, fill, and filll.
@z
@x [38.788] l.16180
@<Print the list between |printed_node| and |cur_p|, then set |printed_node:=cur_p|@>;
@y
@<Print the list between |printed_node| and |cur_p|, then set |printed_node=cur_p|@>;
@z
@x [39.799] l.16441
@/do@+{f=font(cur_p);
@y
do {f=font(cur_p);
@z
@x [39.799] l.16444
}@+ while (!(!is_char_node(cur_p)));
@y
} while (!(!is_char_node(cur_p)));
@z
@x [39.801] l.16469
else{@+@/do@+{@<Add the width of node |s| to |disc_width|@>;
s=link(s);
}@+ while (!(s==null));
@y
else{@+do {@<Add the width of node |s| to |disc_width|@>;
s=link(s);
} while (!(s==null));
@z
@x [39.806] l.16549
@/do@+{if (type(r)!=delta_node) if (total_demerits(r) < fewest_demerits)
@y
do {if (type(r)!=delta_node) if (total_demerits(r) < fewest_demerits)
@z
@x [39.806] l.16553
}@+ while (!(r==last_active));
@y
} while (!(r==last_active));
@z
@x [39.807] l.16563
@/do@+{if (type(r)!=delta_node)
@y
do {if (type(r)!=delta_node)
@z
@x [39.807] l.16576
}@+ while (!(r==last_active));
@y
} while (!(r==last_active));
@z