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
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
|
% Change file for BibTeX in C, originally by Howard Trickey.
%
% 05/28/84 Initial implementation, version 0.41 of BibTeX
% 07/01/84 Version 0.41a of BibTeX.
% 12/17/84 Version 0.97c of BibTeX.
% 02/12/85 Version 0.98c of BibTeX.
% 02/25/85 Newer version 0.98c of BibTeX.
% 03/25/85 Version 0.98f of BibTeX
% 05/23/85 Version 0.98i of BibTeX
% 02/11/88 Version 0.99b of BibTeX
% 04/04/88 Version 0.99c; converted for use with web2c (ETM).
% 11/30/89 Use FILENAMESIZE instead of 1024 (KB).
% 03/09/90 `int' is a bad variable name for C.
% (more recent changes in the ChangeLog)
% [0] Let bibtex.tex work with latest webmac (which defines \ET, hence
% making E active loses).
@x
\catcode`E=13 \uppercase{\def E{e}}
\def\\#1{\hbox{\let E=\drop\it#1\/\kern.05em}} % italic type for identifiers
@y
\let\maybe = \iffalse % process only changed sections
@z
@x [1] Define my_name
@d banner=='This is BibTeX, Version 0.99d' {printed when the program starts}
@y
@d my_name=='bibtex'
@d banner=='This is BibTeX, Version 0.99d' {printed when the program starts}
@z
% [2] `term_in' and `term_out' are standard input and output. But
% there is a complication: BibTeX passes `term_out' to some routines as
% a var parameter. web2c turns a var parameter f into &f at the calling
% side -- and stdout is sometimes implemented as `&_iob[1]' or some
% such. An address of an address is invalid. Therefore, we define
% variables `standardinput' and `standardoutput' in openinout.c.
@x
@d term_out == tty
@d term_in == tty
@y
@d term_out == standard_output
@d term_in == standard_input
@<Globals in the outer block@>=
standard_input, standard_output: text;
@z
@x [3] Add log_pr macros.
@d trace_pr_newline == begin write_ln(log_file); end
@y
@d trace_pr_newline == begin write_ln(log_file); end
@#
@d log_pr(#) == trace_pr(#)
@d log_pr_ln(#) == trace_pr_ln(#)
@d log_pr_newline == trace_pr_newline
@z
@x [4] Turn debug..gubed et al. into #ifdef's.
@d debug == @{ { remove the `|@{|' when debugging }
@d gubed == @t@>@} { remove the `|@}|' when debugging }
@f debug == begin
@f gubed == end
@#
@d stat == @{ { remove the `|@{|' when keeping statistics }
@d tats == @t@>@} { remove the `|@}|' when keeping statistics }
@f stat == begin
@f tats == end
@#
@d trace == @{ { remove the `|@{|' when in |trace| mode }
@d ecart == @t@>@} { remove the `|@}|' when in |trace| mode }
@f trace == begin
@f ecart == end
@y
@d debug == ifdef('TEXMF_DEBUG')
@d gubed == endif('TEXMF_DEBUG')
@f debug == begin
@f gubed == end
@#
@d stat == ifndef('NO_BIBTEX_STAT')
@d tats == endifn('NO_BIBTEX_STAT')
@f stat==begin
@f tats==end
@#
@d trace == ifdef@&('TRACE')
@d ecart == endif@&('TRACE')
@f trace == begin
@f ecart == end
@z
@x [10] Eliminate the |exit_program| label.
label close_up_shop,@!exit_program @<Labels in the outer block@>;
@y
label close_up_shop @<Labels in the outer block@>;
@z
@x [10] Don't print the banner unless verbose, and initialize dynamic arrays.
begin
initialize;
print_ln(banner);@/
@y
@<Define |parse_arguments|@>
begin
standard_input := stdin;
standard_output := stdout;
@#
pool_size := POOL_SIZE;
buf_size := BUF_SIZE;
max_bib_files := MAX_BIB_FILES;
max_glob_strs := MAX_GLOB_STRS;
max_fields := MAX_FIELDS;
max_cites := MAX_CITES;
wiz_fn_space := WIZ_FN_SPACE;
lit_stk_size := LIT_STK_SIZE;
@#
setup_params;
@#
{Add one to the sizes because that's what bibtex uses.}
bib_file := XTALLOC (max_bib_files + 1, alpha_file);
bib_list := XTALLOC (max_bib_files + 1, str_number);
entry_ints := nil;
entry_strs := nil;
wiz_functions := XTALLOC (wiz_fn_space + 1, hash_ptr2);
field_info := XTALLOC (max_fields + 1, str_number);
s_preamble := XTALLOC (max_bib_files + 1, str_number);
str_pool := XTALLOC (pool_size + 1, ASCII_code);
buffer := XTALLOC (buf_size + 1, ASCII_code);
sv_buffer := XTALLOC (buf_size + 1, ASCII_code);
ex_buf := XTALLOC (buf_size + 1, ASCII_code);
out_buf := XTALLOC (buf_size + 1, ASCII_code);
name_tok := XTALLOC (buf_size + 1, buf_pointer);
name_sep_char := XTALLOC (buf_size + 1, ASCII_code);
@#
glb_str_ptr := XTALLOC (max_glob_strs, str_number);
global_strs := XTALLOC (max_glob_strs * (glob_str_size + 1), ASCII_code);
glb_str_end := XTALLOC (max_glob_strs, integer);
@#
cite_list := XTALLOC (max_cites + 1, str_number);
type_list := XTALLOC (max_cites + 1, hash_ptr2);
entry_exists := XTALLOC (max_cites + 1, boolean);
cite_info := XTALLOC (max_cites + 1, str_number);
@#
str_start := XTALLOC (max_strings + 1, pool_pointer);
@#
hash_next := XTALLOC (hash_max + 1, hash_pointer);
hash_text := XTALLOC (hash_max + 1, str_number);
hash_ilk := XTALLOC (hash_max + 1, str_ilk);
ilk_info := XTALLOC (hash_max + 1, integer);
fn_type := XTALLOC (hash_max + 1, fn_class);
@#
lit_stack := XTALLOC (lit_stk_size + 1, integer);
lit_stk_type := XTALLOC (lit_stk_size + 1, stk_type);
@#
compute_hash_prime;
@#
initialize;
{This initializes the jmp9998 buffer, which can be used early}
hack0;
if verbose then begin
print (banner);
print_ln (version_string);
end
else begin
log_pr (banner);
log_pr_ln (version_string);
end;
log_pr_ln ('Capacity: max_strings=', max_strings:1,
', hash_size=', hash_size:1, ', hash_prime=', hash_prime:1);
@z
% [10] Possibly exit with bad status. It doesn't seem worth it to move
% the definitions of the |history| values to above this module; hence the 1.
@x
exit_program:
end.
@y
if (history > 1) then uexit (history);
end.
@z
@x [13] Remove nonlocal goto.
goto exit_program;
@y
uexit (1);
@z
@x [14] Increase some constants, and uppercase others for dynamic arrays.
@<Constants in the outer block@>=
@y
@<Constants in the outer block@>=
@!hash_base = empty + 1; {lowest numbered hash-table location}
@!quote_next_fn = hash_base - 1; {special marker used in defining functions}
@z
@x [still 14]
@!buf_size=1000; {maximum number of characters in an input line (or string)}
@y
@!BUF_SIZE=20000; {initial maximum number of characters in an input line
(or string)}
@z
@x [still 14]
@!max_bib_files=20; {maximum number of \.{.bib} files allowed}
@!pool_size=65000; {maximum number of characters in strings}
@!max_strings=4000; {maximum number of strings, including pre-defined;
must be |<=hash_size|}
@!max_cites=750; {maximum number of distinct cite keys; must be
|<=max_strings|}
@!min_crossrefs=2; {minimum number of cross-refs required for automatic
|cite_list| inclusion}
@!wiz_fn_space=3000; {maximum amount of |wiz_defined|-function space}
@y [still 14]
@!MAX_BIB_FILES=20; {initial number of \.{.bib} files allowed}
@!POOL_SIZE=65000; {initial number of characters in strings}
@!MAX_STRINGS=4000; {minimum value for |max_strings|}
@!MAX_CITES=750; {initial number of distinct cite keys; must be
|<=max_strings|}
@!WIZ_FN_SPACE=3000; {initial amount of |wiz_defined|-function space}
{|min_crossrefs| can be set at runtime now.}
@z
@x [still 14]
@!single_fn_space=100; {maximum amount for a single |wiz_defined|-function}
@y
@!SINGLE_FN_SPACE=50; {initial amount for a single |wiz_defined|-function}
@z
@x [still 14] handle long citation strings
@!max_ent_ints=3000; {maximum number of |int_entry_var|s
(entries $\times$ |int_entry_var|s)}
@!max_ent_strs=3000; {maximum number of |str_entry_var|s
(entries $\times$ |str_entry_var|s)}
@!ent_str_size=100; {maximum size of a |str_entry_var|; must be |<=buf_size|}
@!glob_str_size=1000; {maximum size of a |str_global_var|;
must be |<=buf_size|}
@!max_fields=17250; {maximum number of fields (entries $\times$ fields,
@y
@!ENT_STR_SIZE=100; {maximum size of a |str_entry_var|; must be |<=buf_size|}
@!GLOB_STR_SIZE=1000; {maximum size of a |str_global_var|;
must be |<=buf_size|}
@!MAX_GLOB_STRS=10; {initial number of |str_global_var| names}
@!MAX_FIELDS=5000; {initial number of fields (entries $\times$ fields,
@z
@x [still 14]
@!lit_stk_size=100; {maximum number of literal functions on the stack}
@y
@!LIT_STK_SIZE=50; {initial space for literal functions on the stack}
@z
@x [15] Increase more constants in the web defines.
@d hash_size=5000 {must be |>= max_strings| and |>= hash_prime|}
@d hash_prime=4253 {a prime number about 85\% of |hash_size| and |>= 128|
and |< @t$2^{14}-2^6$@>|}
@d file_name_size=40 {file names shouldn't be longer than this}
@d max_glob_strs=10 {maximum number of |str_global_var| names}
@d max_glb_str_minus_1 = max_glob_strs-1 {to avoid wasting a |str_global_var|}
@y
{|hash_size| and |hash_prime| are now computed.}
@d HASH_SIZE=5000 {minimum value for |hash_size|}
@#
@d file_name_size==maxint {file names have no arbitrary maximum length}
@#
{For dynamic allocation.}
@d x_entry_strs_tail(#) == (#)]
@d x_entry_strs(#) == entry_strs[(#) * (ent_str_size+1) + x_entry_strs_tail
@d x_global_strs_tail(#) == (#)]
@d x_global_strs(#) == global_strs[(#) * (glob_str_size+1) + x_global_strs_tail
@z
@x [16] Add new variables-that-used-to-be-constants for dynamic arrays.
@<Globals in the outer block@>=
@y
@<Globals in the outer block@>=
@!pool_size: integer;
@!max_bib_files: integer;
@!max_cites: integer;
@!wiz_fn_space: integer;
@!ent_str_size: integer;
@!glob_str_size: integer;
@!max_glob_strs: integer;
@!max_fields: integer;
@!lit_stk_size: integer;
@#
@!max_strings: integer;
@!hash_size: integer;
@!hash_prime: integer;
@#
@!hash_max: integer; {highest numbered hash-table location}
@!end_of_def: integer; {another special marker used in defining functions}
@!undefined: integer; {a special marker used for |type_list|}
@z
@x [17] max_strings=hash_size settable at runtime.
if (hash_prime >= (16384-64)) then bad:=10*bad+6;
@y
if (hash_base <> 1) then bad:=10*bad+6;
@z
@x [still 17] remove buf_size checks, since buf_size changes dynamically.
if (ent_str_size > buf_size) then bad:=10*bad+9;
if (glob_str_size > buf_size) then bad:=100*bad+11;
@y
@z
@x [22, 23, 27, 28] Allow any character as input. [22]
@!ASCII_code=0..127; {seven-bit numbers}
@y
@!ASCII_code=0..255; {eight-bit numbers}
@z
@x [23]
@d text_char == char {the data type of characters in text files}
@d first_text_char=0 {ordinal number of the smallest element of |text_char|}
@d last_text_char=127 {ordinal number of the largest element of |text_char|}
@<Local variables for initialization@>=
i:0..last_text_char; {this is the first one declared}
@y
@d text_char == ASCII_code {the data type of characters in text files}
@d first_text_char=0 {ordinal number of the smallest element of |text_char|}
@d last_text_char=255 {ordinal number of the largest element of |text_char|}
@<Local variables for initialization@>=
i:integer;
@z
@x [27]
for i:=1 to @'37 do xchr[i]:=' ';
xchr[tab]:=chr(tab);
@y
for i:=0 to @'37 do xchr[i]:=chr(i);
for i:=@'177 to @'377 do xchr[i]:=chr(i);
@z
@x [28]
for i:=first_text_char to last_text_char do xord[chr(i)]:=invalid_code;
for i:=1 to @'176 do xord[xchr[i]]:=i;
@y
for i:=first_text_char to last_text_char do xord[xchr[i]]:=i;
@z
@x [32] Put the [128..255] range into lex_class alpha.
for i:=0 to @'177 do lex_class[i] := other_lex;
@y
for i:=0 to @'177 do lex_class[i] := other_lex;
for i:=@'200 to @'377 do lex_class[i] := alpha;
@z
% [still 32] Make RET a `white_space' character, so we won't choke on DOS
% files, which use CR/LF for line endings.
@x
lex_class[tab] := white_space;
@y
lex_class[tab] := white_space;
lex_class[13] := white_space;
@z
@x [33] Allow the [128..255] range in legal_id_char.
for i:=0 to @'177 do id_class[i] := legal_id_char;
@y
for i:=0 to @'377 do id_class[i] := legal_id_char;
@z
% [37] file_name_size no longer exists. See comments in tex.ch for why
% we change the element type to text_char.
@x
@!name_of_file:packed array[1..file_name_size] of char;
{on some systems this is a \&{record} variable}
@!name_length:0..file_name_size;
{this many characters are relevant in |name_of_file| (the rest are blank)}
@!name_ptr:0..file_name_size+1; {index variable into |name_of_file|}
@y
@!name_of_file:^text_char;
@!name_length:integer;
{this many characters are relevant in |name_of_file| }
@!name_ptr:integer; {index variable into |name_of_file|}
@z
@x [38] File opening.
The \ph\ compiler with which the present version of \TeX\ was prepared has
extended the rules of \PASCAL\ in a very convenient way. To open file~|f|,
we can write
$$\vbox{\halign{#\hfil\qquad&#\hfil\cr
|reset(f,@t\\{name}@>,'/O')|&for input;\cr
|rewrite(f,@t\\{name}@>,'/O')|&for output.\cr}}$$
The `\\{name}' parameter, which is of type `\ignorespaces|packed
array[@t\<\\{any}>@>] of text_char|', stands for the name of
the external file that is being opened for input or output.
Blank spaces that might appear in \\{name} are ignored.
The `\.{/O}' parameter tells the operating system not to issue its own
error messages if something goes wrong. If a file of the specified name
cannot be found, or if such a file cannot be opened for some other reason
(e.g., someone may already be trying to write the same file), we will have
|@!erstat(f)<>0| after an unsuccessful |reset| or |rewrite|. This allows
\TeX\ to undertake appropriate corrective action.
\TeX's file-opening procedures return |false| if no file identified by
|name_of_file| could be opened.
@d reset_OK(#)==erstat(#)=0
@d rewrite_OK(#)==erstat(#)=0
@<Procedures and functions for file-system interacting@>=
function erstat(var f:file):integer; extern; {in the runtime library}
@#@t\2@>
function a_open_in(var f:alpha_file):boolean; {open a text file for input}
begin reset(f,name_of_file,'/O'); a_open_in:=reset_OK(f);
end;
@#
function a_open_out(var f:alpha_file):boolean; {open a text file for output}
begin rewrite(f,name_of_file,'/O'); a_open_out:=rewrite_OK(f);
end;
@y
@ File opening will be done in C. But we want an auxiliary function to
change a \BibTeX\ string into a C string, to keep string pool stuff
out of the C code in @.{lib/openclose.c}.
@d no_file_path = -1
@<Procedures and functions for all file...@>=
function bib_makecstring(s:str_number):cstring;
var cstr:cstring;
i:pool_pointer;
begin
cstr := xmalloc_array (ASCII_code, length (s) + 1);
for i := 0 to length(s) - 1 do begin
cstr[i] := str_pool[str_start[s] + i];
end;
cstr[length(s)] := 0;
bib_makecstring := cstr;
exit: end;
@z
@x [39] Do file closing in C.
@<Procedures and functions for file-system interacting@>=
procedure a_close(var f:alpha_file); {close a text file}
begin close(f);
end;
@y
File closing will be done in C, too.
@z
@x [41] Dynamic buf_size.
@!buffer:buf_type; {usually, lines of characters being read}
@y
@!buf_size:integer; {size of buffer}
@!buffer:buf_type; {usually, lines of characters being read}
@z
@x [42] Dyanmic buf_size.
@!buf_pointer = 0..buf_size; {an index into a |buf_type|}
@!buf_type = array[buf_pointer] of ASCII_code; {for various buffers}
@y
@!buf_pointer = integer; {an index into a |buf_type|}
@!buf_type = ^ASCII_code; {for various buffers}
@z
@x [46] Dynamic buf_size.
overflow('buffer size ',buf_size);
@y
BIB_XRETALLOC_NOSET ('buffer', buffer, ASCII_code,
buf_size, buf_size + BUF_SIZE);
BIB_XRETALLOC_NOSET ('sv_buffer', sv_buffer, ASCII_code,
buf_size, buf_size + BUF_SIZE);
BIB_XRETALLOC_NOSET ('ex_buf', ex_buf, ASCII_code,
buf_size, buf_size + BUF_SIZE);
BIB_XRETALLOC_NOSET ('out_buf', out_buf, ASCII_code,
buf_size, buf_size + BUF_SIZE);
BIB_XRETALLOC_NOSET ('name_tok', name_tok, buf_pointer,
buf_size, buf_size + BUF_SIZE);
BIB_XRETALLOC ('name_sep_char', name_sep_char, ASCII_code,
buf_size, buf_size + BUF_SIZE);
@z
@x [47] web2c doesn't understand f^.
buffer[last]:=xord[f^];
get(f); incr(last);
end;
get(f);
@y
buffer[last] := xord[getc (f)];
incr (last);
end;
vgetc (f); {skip the eol}
@z
@x [48] Dynamically allocate str_pool.
@!str_pool : packed array[pool_pointer] of ASCII_code; {the characters}
@!str_start : packed array[str_number] of pool_pointer; {the starting pointers}
@y
@!str_pool : ^ASCII_code; {the characters}
@!str_start :^pool_pointer; {the starting pointers}
@z
@x [49] pool_size is a variable now, so can't be used as a constant.
@!pool_pointer = 0..pool_size; {for variables that point into |str_pool|}
@!str_number = 0..max_strings; {for variables that point into |str_start|}
@y
@!pool_pointer = integer; {for variables that point into |str_pool|}
@!str_number = integer; {for variables that point into |str_start|}
@z
@x [50] Add log_pr_pool_str macro.
@d trace_pr_pool_str(#) == begin
out_pool_str(log_file,#);
end
@y
@d trace_pr_pool_str(#) == begin
out_pool_str(log_file,#);
end
@#
@d log_pr_pool_str(#) == trace_pr_pool_str(#)
@z
@x [53] Reallocate str_pool. We may need more than POOL_SIZE.
if (pool_ptr+# > pool_size) then
@y
while (pool_ptr+# > pool_size) do
@z
@x [still 53] Reallocate str_pool.
overflow('pool size ',pool_size);
@y
BIB_XRETALLOC ('str_pool', str_pool, ASCII_code, pool_size,
pool_size + POOL_SIZE);
@z
% [58] (start_name) reallocate name_of_file for the new name and
% terminate with null.
@x
if (length(file_name) > file_name_size) then
begin
print ('File=');
print_pool_str (file_name);
print_ln (',');
file_nm_size_overflow;
end;
@y
free (name_of_file);
name_of_file := xmalloc_array (ASCII_code, length (file_name) + 1);
@z
@x
name_length := length(file_name);
@y
name_length := length(file_name);
name_of_file[name_length + 1] := 0;
@z
@x [59] (file_nm_size_overflow) This procedure is not used.
procedure file_nm_size_overflow;
begin
overflow('file name size ',file_name_size);
end;
@y
@z
% [60] (add_extension) Don't pad name_of_file with blanks, terminate
% with null. And junk the overflow check, since Web2c can't translate
% the print statement properly and it can never happen, anyway.
@x
if (name_length + length(ext) > file_name_size) then
begin
print ('File=',name_of_file,', extension=');
print_pool_str (ext); print_ln (',');
file_nm_size_overflow;
end;
@y
@z
@x
name_ptr := name_length+1;
while (name_ptr <= file_name_size) do {pad with blanks}
begin
name_of_file[name_ptr] := ' ';
incr(name_ptr);
end;
@y
name_of_file[name_length + 1] := 0;
@z
@x [61] (add_area) This procedure is not used.
procedure add_area(@!area:str_number);
var p_ptr: pool_pointer; {running index}
begin
if (name_length + length(area) > file_name_size) then
begin
print ('File=');
print_pool_str (area); print (name_of_file,',');
file_nm_size_overflow;
end;
name_ptr := name_length;
while (name_ptr > 0) do {shift up name}
begin
name_of_file[name_ptr+length(area)] := name_of_file[name_ptr];
decr(name_ptr);
end;
name_ptr := 1;
p_ptr := str_start[area];
while (p_ptr < str_start[area+1]) do
begin
name_of_file[name_ptr] := chr (str_pool[p_ptr]);
incr(name_ptr); incr(p_ptr);
end;
name_length := name_length + length(area);
end;
@y
@z
@x [64] now Pascal consts or vars, instead of web macros.
@d hash_base = empty + 1 {lowest numbered hash-table location}
@d hash_max = hash_base + hash_size - 1 {highest numbered hash-table location}
@y
@z
@x [still 64] max_strings=hash_size settable at runtime.
@!hash_loc=hash_base..hash_max; {a location within the hash table}
@!hash_pointer=empty..hash_max; {either |empty| or a |hash_loc|}
@y
@!hash_loc=integer; {a location within the hash table}
@!hash_pointer=integer; {either |empty| or a |hash_loc|}
@z
@x [65] max_strings=hash_size settable at runtime.
@!hash_next : packed array[hash_loc] of hash_pointer; {coalesced-list link}
@!hash_text : packed array[hash_loc] of str_number; {pointer to a string}
@!hash_ilk : packed array[hash_loc] of str_ilk; {the type of string}
@!ilk_info : packed array[hash_loc] of integer; {|ilk|-specific info}
@!hash_used : hash_base..hash_max+1; {allocation pointer for hash table}
@y
@!hash_next : ^hash_pointer; {coalesced-list link}
@!hash_text : ^str_number; {pointer to a string}
@!hash_ilk : ^str_ilk; {the type of string}
@!ilk_info : ^integer; {|ilk|-specific info}
@!hash_used : integer; {allocation pointer for hash table}
@z
@x [68] Not used anymore.
@d max_hash_value = hash_prime+hash_prime-2+127 {|h|'s maximum value}
@y
@z
@x [still 68] max_strings=hash_size settable at runtime.
var h:0..max_hash_value; {hash code}
@y
var h:integer; {hash code}
@z
@x [still 68] str_lookup - Avoid 'uninitialized' warning.
@!old_string:boolean; {set to |true| if it's an already encountered string}
@y
@z
@x [still 68] str_lookup - Avoid 'uninitialized' warning.
old_string := false;
@y
str_num := 0; {set to |>0| if it's an already encountered string}
@z
@x [70] str_lookup - Avoid 'uninitialized' warning.
old_string := true;
@y
@z
@x [71] str_lookup - Avoid 'uninitialized' warning.
if (old_string) then {it's an already encountered string}
@y
if (str_num>0) then {it's an already encountered string}
@z
@x [73] Pascal Web's char type will be a const char *.
@!pds_type = packed array [pds_loc] of char;
@y
@!pds_type = const_cstring;
@z
@x [77] C strings start at zero instead of one.
for i:=1 to len do
buffer[i] := xord[pds[i]];
@y
for i:=1 to len do
buffer[i] := xord[ucharcast(pds[i-1])];
@z
@x [97] Can't do this tangle-time arithmetic with file_name_size.
@!aux_name_length : 0..file_name_size+1; {\.{.aux} name sans extension}
@y
@!aux_name_length : integer;
@z
@x [100] Reading the aux file name and command-line processing.
This procedure consists of a loop that reads and processes a (nonnull)
\.{.aux} file name. It's this module and the next two that must be
changed on those systems using command-line arguments. Note: The
|term_out| and |term_in| files are system dependent.
@<Procedures and functions for the reading and processing of input files@>=
procedure get_the_top_level_aux_file_name;
label aux_found,@!aux_not_found;
var @<Variables for possible command-line processing@>@/
begin
check_cmnd_line := false; {many systems will change this}
loop
begin
if (check_cmnd_line) then
@<Process a possible command line@>
else
begin
write (term_out,'Please type input file name (no extension)--');
if (eoln(term_in)) then {so the first |read| works}
read_ln (term_in);
aux_name_length := 0;
while (not eoln(term_in)) do
begin
if (aux_name_length = file_name_size) then
begin
while (not eoln(term_in)) do {discard the rest of the line}
get(term_in);
sam_you_made_the_file_name_too_long;
end;
incr(aux_name_length);
name_of_file[aux_name_length] := term_in^;
get(term_in);
end;
end;
@<Handle this \.{.aux} name@>;
aux_not_found:
check_cmnd_line := false;
end;
aux_found: {now we're ready to read the \.{.aux} file}
end;
@y
@<Procedures and functions for the reading and processing of input files@>=
procedure get_the_top_level_aux_file_name;
label aux_found,@!aux_not_found;
begin
@<Process a possible command line@>
{Leave room for the \.., the extension, the junk byte at the
beginning, and the null byte at the end.}
name_of_file := xmalloc_array (ASCII_code, strlen (cmdline (optind)) + 5);
strcpy (stringcast(name_of_file + 1), cmdline (optind));
aux_name_length := strlen (stringcast(name_of_file + 1));
@<Handle this \.{.aux} name@>;
aux_not_found: uexit (1);
aux_found: {now we're ready to read the \.{.aux} file}
end;
@z
% [101] Don't need this variable; we use argc to check if we have a
% command line.
@x
@<Variables for possible command-line processing@>=
@!check_cmnd_line : boolean; {|true| if we're to check the command line}
@y
@z
@x [102] Get the aux file name from the command line.
@<Process a possible command line@>=
begin
do_nothing; {the ``default system'' doesn't use the command line}
end
@y
@<Process a possible command line@>=
parse_arguments;
@z
% [106] Don't use a path to find the aux file, and don't add the
% extension if it's already there.
@x
add_extension (s_aux_extension); {this also sets |name_length|}
aux_ptr := 0; {initialize the \.{.aux} file stack}
if (not a_open_in(cur_aux_file)) then
@y
if (name_length < 4) or
(strcmp (stringcast(name_of_file + 1 + name_length - 4), '.aux') <> 0)
then
add_extension (s_aux_extension) {this also sets |name_length|}
else
aux_name_length := aux_name_length - 4; {set to length without \.{.aux}}
aux_ptr := 0; {initialize the \.{.aux} file stack}
if (not kpse_in_name_ok(stringcast(name_of_file+1)) or
not a_open_in(cur_aux_file,no_file_path)) then
@z
@x [still 106] Check log_file name.
if (not a_open_out(log_file)) then
@y
if (not kpse_out_name_ok(stringcast(name_of_file+1)) or
not a_open_out(log_file)) then
@z
@x [still 106] Check bbl_file name.
if (not a_open_out(bbl_file)) then
@y
if (not kpse_out_name_ok(stringcast(name_of_file+1)) or
not a_open_out(bbl_file)) then
@z
@x [108] Add log_pr_aux_name.
procedure print_aux_name;
begin
print_pool_str (cur_aux_str);
print_newline;
end;
@y
procedure print_aux_name;
begin
print_pool_str (cur_aux_str);
print_newline;
end;
@#
procedure log_pr_aux_name;
begin
log_pr_pool_str (cur_aux_str);
log_pr_newline;
end;
@z
@x [110] Be silent unless verbose.
print ('The top-level auxiliary file: ');
print_aux_name;
@y
if verbose then begin
print ('The top-level auxiliary file: ');
print_aux_name;
end
else begin
log_pr ('The top-level auxiliary file: ');
log_pr_aux_name;
end;
@z
@x [117] bib_list is dynamically allocated.
@!bib_list : array[bib_number] of str_number; {the \.{.bib} file list}
@y
@!bib_list : ^str_number; {the \.{.bib} file list}
@z
@x [still 117] bib_file also.
@!bib_file : array[bib_number] of alpha_file; {corresponding |file| variables}
@y
@!bib_file : ^alpha_file; {corresponding |file| variables}
@z
@x [118] max_bib_files is a variable now, so can't be used as a const.
@!bib_number = 0..max_bib_files; {gives the |bib_list| range}
@y
@!bib_number = integer; {gives the |bib_list| range}
@z
@x [121] Don't print extension twice; add log_pr_bib_name function.
procedure print_bib_name;
begin
print_pool_str (cur_bib_str);
print_pool_str (s_bib_extension);
print_newline;
end;
@y
{Return true if the |ext| string is at the end of the |s| string. There
are surely far more clever ways to do this, but it doesn't matter.}
function str_ends_with (@!s:str_number; @!ext:str_number) : boolean;
var i : integer;
str_idx,ext_idx : integer;
str_char,ext_char : ASCII_code;
begin
str_ends_with := false;
if (length (ext) > length (s)) then
return; {if extension is longer, they don't match}
str_idx := length (s) - 1;
ext_idx := length (ext) - 1;
while (ext_idx >= 0) do begin {|>=| so we check the |'.'| char.}
str_char := str_pool[str_start[s]+str_idx];
ext_char := str_pool[str_start[ext]+ext_idx];
if (str_char <> ext_char) then
return;
decr (str_idx);
decr (ext_idx);
end;
str_ends_with := true;
exit: end;
{The above is needed because the file name specified in the
\.{\\bibdata} command may or may not have the \.{.bib} extension. If it
does, we don't want to print \.{.bib} twice.}
procedure print_bib_name;
begin
print_pool_str (cur_bib_str);
if not str_ends_with (cur_bib_str, s_bib_extension) then
print_pool_str (s_bib_extension);
print_newline;
end;
@#
procedure log_pr_bib_name;
begin
log_pr_pool_str (cur_bib_str);
if not str_ends_with (cur_bib_str, s_bib_extension) then
log_pr_pool_str (s_bib_extension);
log_pr_newline;
end;
@z
@x [123] Reallocate when we run out of bib files.
overflow('number of database files ',max_bib_files);
@y
begin
{Keep old value of |max_bib_files| for the last array.}
BIB_XRETALLOC_NOSET ('bib_list', bib_list, str_number, max_bib_files,
max_bib_files + MAX_BIB_FILES);
BIB_XRETALLOC_NOSET ('bib_file', bib_file, alpha_file, max_bib_files,
max_bib_files + MAX_BIB_FILES);
BIB_XRETALLOC ('s_preamble', s_preamble, str_number, max_bib_files,
max_bib_files + MAX_BIB_FILES);
end;
@z
@x [still 123] Use BIBINPUTS to search for the .bib file.
add_extension (s_bib_extension);
if (not a_open_in(cur_bib_file)) then
begin
add_area (s_bib_area);
if (not a_open_in(cur_bib_file)) then
open_bibdata_aux_err ('I couldn''t open database file ');
end;
@y
if (not kpse_in_name_ok(stringcast(name_of_file+1)) or
not a_open_in(cur_bib_file, kpse_bib_format)) then
open_bibdata_aux_err ('I couldn''t open database file ');
@z
@x [127] Use BSTINPUTS/TEXINPUTS to search for .bst files.
add_extension (s_bst_extension);
if (not a_open_in(bst_file)) then
begin
add_area (s_bst_area);
if (not a_open_in(bst_file)) then
begin
print ('I couldn''t open style file ');
print_bst_name;@/
bst_str := 0; {mark as unused again}
aux_err_return;
end;
end;
@y
if (not kpse_in_name_ok(stringcast(name_of_file+1)) or
not a_open_in(bst_file, kpse_bst_format)) then
begin
print ('I couldn''t open style file ');
print_bst_name;@/
bst_str := 0; {mark as unused again}
aux_err_return;
end;
@z
@x [127] Be silent unless verbose.
print ('The style file: ');
print_bst_name;
@y
if verbose then begin
print ('The style file: ');
print_bst_name;
end
else begin
log_pr ('The style file: ');
log_pr_bst_name;
end;
@z
@x [128] Add log_pr_bst_name.
procedure print_bst_name;
begin
print_pool_str (bst_str);
print_pool_str (s_bst_extension);
print_newline;
end;
@y
procedure print_bst_name;
begin
print_pool_str (bst_str);
print_pool_str (s_bst_extension);
print_newline;
end;
@#
procedure log_pr_bst_name;
begin
log_pr_pool_str (bst_str);
log_pr_pool_str (s_bst_extension);
log_pr_newline;
end;
@z
@x [129] cite_list is dynamically allocated.
@!cite_list : packed array[cite_number] of str_number; {the cite-key list}
@y
@!cite_list : ^str_number; {the cite-key list}
@z
@x [130] max_cites is no longer const.
@!cite_number = 0..max_cites; {gives the |cite_list| range}
@y
@!cite_number = integer; {gives the |cite_list| range}
@z
@x [138] Dynamic max_cites.
if (last_cite = max_cites) then
begin
print_pool_str (hash_text[cite_loc]);
print_ln (' is the key:');
overflow('number of cite keys ',max_cites);
@y
if (last_cite = max_cites) then
begin
BIB_XRETALLOC_NOSET ('cite_list', cite_list, str_number,
max_cites, max_cites + MAX_CITES);
BIB_XRETALLOC_NOSET ('type_list', type_list, hash_ptr2,
max_cites, max_cites + MAX_CITES);
BIB_XRETALLOC_NOSET ('entry_exists', entry_exists, boolean,
max_cites, max_cites + MAX_CITES);
BIB_XRETALLOC ('cite_info', cite_info, str_number,
max_cites, max_cites + MAX_CITES);
while (last_cite < max_cites) do
begin
type_list[last_cite] := empty;@/
cite_info[last_cite] := any_value; {to appeas \PASCAL's boolean evaluation}
incr(last_cite);
end;
@z
% [141] Don't pad with blanks, terminate with null.
% Don't use a path to search for subsidiary aux files,
% but do check the directory of the main .aux file.
%
% This last is useful, for example, when --output-dir is used and the
% .aux file has an \@input directive resulting from a LaTeX \include;
% see bibtex-auxinclude.test. It's necessary because BibTeX itself does
% not have --output-directory. Maybe it would be (have been?) better to
% add it, but seems too intrusive now? Different bbl location.
@x
while (name_ptr <= file_name_size) do {pad with blanks}
begin
name_of_file[name_ptr] := ' ';
incr(name_ptr);
end;
if (not a_open_in(cur_aux_file)) then
@y
name_of_file[name_ptr] := 0;
if (not kpse_in_name_ok(stringcast(name_of_file+1))
or (not a_open_in(cur_aux_file, no_file_path)
and not a_open_in_with_dirname(cur_aux_file, no_file_path,
bib_makecstring(top_lev_str)))
) then
@z
@x [still 141] Be silent unless verbose.
print ('A level-',aux_ptr:0,' auxiliary file: ');
print_aux_name;
@y
log_pr ('A level-',aux_ptr:0,' auxiliary file: ');
log_pr_aux_name;
@z
% [151] This goto gets turned into a setjmp/longjmp by ./convert --
% unfortunately, it is a nonlocal goto. ekrell@ulysses.att.com
% implemented the conversion.
@x
buf_ptr2 := last; {to get the first input line}
loop
begin
if (not eat_bst_white_space) then {the end of the \.{.bst} file}
goto bst_done;
get_bst_command_and_process;
end;
bst_done: a_close (bst_file);
@y
buf_ptr2 := last; {to get the first input line}
hack1;
begin
if (not eat_bst_white_space) then {the end of the \.{.bst} file}
hack2;
get_bst_command_and_process;
end;
bst_done: a_close (bst_file);
@z
% [160] quote_next_fn and end_of_def are Pascal consts, instead of web macros.
% max_ent_ints and max_ent_strs are gone, max_fields is no longer const.
@x
@d quote_next_fn = hash_base - 1 {special marker used in defining functions}
@d end_of_def = hash_max + 1 {another such special marker}
@<Types in the outer block@>=
@!fn_class = 0..last_fn_class; {the \.{.bst} function classes}
@!wiz_fn_loc = 0..wiz_fn_space; {|wiz_defined|-function storage locations}
@!int_ent_loc = 0..max_ent_ints; {|int_entry_var| storage locations}
@!str_ent_loc = 0..max_ent_strs; {|str_entry_var| storage locations}
@!str_glob_loc = 0..max_glb_str_minus_1; {|str_global_var| storage locations}
@!field_loc = 0..max_fields; {individual field storage locations}
@y
@<Types in the outer block@>=
@!fn_class = 0..last_fn_class; {the \.{.bst} function classes}
@!wiz_fn_loc = integer; {|wiz_defined|-function storage locations}
@!int_ent_loc = integer; {|int_entry_var| storage locations}
@!str_ent_loc = integer; {|str_entry_var| storage locations}
@!str_glob_loc = integer; {|str_global_var| storage locations}
@!field_loc = integer; {individual field storage locations}
@z
@x [161] max_strings=hash_size settable at runtime.
@!fn_type : packed array[hash_loc] of fn_class;
@y
@!fn_type : ^fn_class;
@z
@x [still 161] Dynamically allocate wiz_functions.
@!wiz_functions : packed array[wiz_fn_loc] of hash_ptr2;
@y
@!wiz_functions : ^hash_ptr2;
@z
% [still 161] Convert entry_ints and entry_strs to dynamically-allocated
% one-dimensional arrays; too bad C and Pascal lag Fortran in supporting
% run-time dimensioning of multidimensional arrays. Other changes that
% follow this one will convert every reference to entry_strs[p][q] to
% x_entry_strs(p)(q), the equivalent of entry_strs[p*(ent_str_size+1) +
% q], but hidden inside a macro to mask the addressing computation.
% Although WEB does not have multi-argument macros, webman.tex shows how
% to get the equivalent effect.
@x
@!entry_ints : array[int_ent_loc] of integer;
@!num_ent_ints : int_ent_loc; {the number of distinct |int_entry_var| names}
@!str_ent_ptr : str_ent_loc; {general |str_entry_var| location}
@!entry_strs : array[str_ent_loc] of
packed array[0..ent_str_size] of ASCII_code;
@y
@!entry_ints : ^integer; {dynamically-allocated array}
@!num_ent_ints : int_ent_loc; {the number of distinct |int_entry_var| names}
@!str_ent_ptr : str_ent_loc; {general |str_entry_var| location}
@!entry_strs : ^ASCII_code; {dynamically-allocated array}
@z
@x [still 161] Dynamically allocate global strings
@!str_glb_ptr : 0..max_glob_strs; {general |str_global_var| location}
@!glb_str_ptr : array[str_glob_loc] of str_number;
@!global_strs : array[str_glob_loc] of array[0..glob_str_size] of ASCII_code;
@!glb_str_end : array[str_glob_loc] of 0..glob_str_size; {end markers}
@!num_glb_strs : 0..max_glob_strs; {number of distinct |str_global_var| names}
@y
@!str_glb_ptr : integer; {general |str_global_var| location}
@!glb_str_ptr : ^str_number;
@!global_strs : ^ASCII_code;
@!glb_str_end : ^integer; {end markers}
@!num_glb_strs : integer; {number of distinct |str_global_var| names}
@z
@x [still 161] Dynamically allocate field_info.
@!field_info : packed array[field_loc] of str_number;
@y
@!field_info : ^str_number;
@z
@x [187] Dynamically allocate singl_function.
type @!fn_def_loc = 0..single_fn_space; {for a single |wiz_defined|-function}
var singl_function : packed array[fn_def_loc] of hash_ptr2;
@y
type @!fn_def_loc = integer; {for a single |wiz_defined|-function}
var singl_function : ^hash_ptr2;
@!single_fn_space : integer; {space allocated for this |singl_function| instance}
@z
@x [still 187] Dynamically allocate singl_function.
begin
eat_bst_white_and_eof_check ('function');
@y
begin
single_fn_space := SINGLE_FN_SPACE;
singl_function := XTALLOC (single_fn_space + 1, hash_ptr2);
eat_bst_white_and_eof_check ('function');
@z
@x [still 187] Dynamically allocate singl_function.
exit:
end;
@y
exit:
libc_free (singl_function);
end;
@z
@x [188] Reallocate if out of single function space.
singl_fn_overflow;
@y
begin
BIB_XRETALLOC ('singl_function', singl_function, hash_ptr2,
single_fn_space, single_fn_space + SINGLE_FN_SPACE);
end;
@z
@x [still 188] Procedure |singl_fn_overflow| replaced by inline code.
procedure singl_fn_overflow;
begin
overflow('single function space ',single_fn_space);
end;
@y
@z
@x [198] A variable named `int' is no good in C.
@<Procedures and functions for handling numbers, characters, and strings@>=
@y
@d int == the_int
@<Procedures and functions for handling numbers, characters, and strings@>=
@z
@x [200] Reallocate if out of wizard space.
if (single_ptr + wiz_def_ptr > wiz_fn_space) then
begin
print (single_ptr + wiz_def_ptr : 0,': ');
overflow('wizard-defined function space ',wiz_fn_space);
end;
@y
while (single_ptr + wiz_def_ptr > wiz_fn_space) do
begin
BIB_XRETALLOC ('wiz_functions', wiz_functions, hash_ptr2,
wiz_fn_space, wiz_fn_space + WIZ_FN_SPACE);
end;
@z
@x [216] Reallocate if out of global strings.
overflow('number of string global-variables ',max_glob_strs);
@y
begin
BIB_XRETALLOC_NOSET ('glb_str_ptr', glb_str_ptr, str_number,
max_glob_strs, max_glob_strs + MAX_GLOB_STRS);
BIB_XRETALLOC_STRING ('global_strs', global_strs, glob_str_size,
max_glob_strs, max_glob_strs + MAX_GLOB_STRS);
BIB_XRETALLOC ('glb_str_end', glb_str_end, integer,
max_glob_strs, max_glob_strs + MAX_GLOB_STRS);
str_glb_ptr := num_glb_strs;
while (str_glb_ptr < max_glob_strs) do {make new |str_global_var|s empty}
begin
glb_str_ptr[str_glb_ptr] := 0;
glb_str_end[str_glb_ptr] := 0;
incr(str_glb_ptr);
end;
end;
@z
@x [still 219] undefined is now a Pascal const, instead of a web macro
@d undefined = hash_max + 1 {a special marker used for |type_list|}
@y
@z
@x [still 219] type_list is dynamically allocated.
@!type_list : packed array[cite_number] of hash_ptr2;
@y
@!type_list : ^hash_ptr2;
@z
@x [still 219] entry_exists also.
@!entry_exists : packed array[cite_number] of boolean;
@y
@!entry_exists : ^boolean;
@z
@x [still 219] cite_info also.
@!cite_info : packed array[cite_number] of str_number; {extra |cite_list| info}
@y
@!cite_info : ^str_number; {extra |cite_list| info}
@z
@x [224] Be silent unless verbose.
print ('Database file #',bib_ptr+1:0,': ');
print_bib_name;@/
@y
if verbose then begin
print ('Database file #',bib_ptr+1:0,': ');
print_bib_name;
end
else begin
log_pr ('Database file #',bib_ptr+1:0,': ');
log_pr_bib_name;
end;
@z
@x [226] Reallocate if out of fields.
procedure check_field_overflow (@!total_fields : integer);
begin
if (total_fields > max_fields) then
begin
print_ln (total_fields:0,' fields:');
overflow('total number of fields ',max_fields);
@y
procedure check_field_overflow (@!total_fields : integer);
var @!f_ptr: field_loc;
@!start_fields: field_loc;
begin
if (total_fields > max_fields) then
begin
start_fields := max_fields;
BIB_XRETALLOC ('field_info', field_info, str_number, max_fields,
total_fields + MAX_FIELDS);
{Initialize to |missing|.}
for f_ptr := start_fields to max_fields - 1 do begin
field_info[f_ptr] := missing;
end;
@z
@x [242] Reallocate when we run out of s_preamble's.
bib_err ('You''ve exceeded ',max_bib_files:0,' preamble commands');
@y
begin
{Keep old value of |max_bib_files| for the last array.}
BIB_XRETALLOC_NOSET ('bib_list', bib_list, str_number, max_bib_files,
max_bib_files + MAX_BIB_FILES);
BIB_XRETALLOC_NOSET ('bib_file', bib_file, alpha_file, max_bib_files,
max_bib_files + MAX_BIB_FILES);
BIB_XRETALLOC ('s_preamble', s_preamble, str_number, max_bib_files,
max_bib_files + MAX_BIB_FILES);
end;
@z
@x [263] Add check for fieldinfo[] overflow.
field_ptr := entry_cite_ptr * num_fields + fn_info[field_name_loc];
@y
field_ptr := entry_cite_ptr * num_fields + fn_info[field_name_loc];
if (field_ptr >= max_fields) then
confusion ('field_info index is out of range');
@z
@x [265] Fix bug in the add_database_cite procedure.
check_field_overflow (num_fields*new_cite);
@y
check_field_overflow (num_fields*(new_cite+1));
@z
@x [277] Add check for fieldinfo[] overflow.
@<Add cross-reference information@>=
begin
@y
@<Add cross-reference information@>=
begin
if ((num_cites - 1) * num_fields + crossref_num >= max_fields) then
confusion ('field_info index is out of range');
@z
@x [279] Add check for fieldinfo[] overflow.
@<Subtract cross-reference information@>=
begin
@y
@<Subtract cross-reference information@>=
begin
if ((num_cites - 1) * num_fields + crossref_num >= max_fields) then
confusion ('field_info index is out of range');
@z
@x [285] Add check for fieldinfo[] overflow.
@<Slide this cite key down to its permanent spot@>=
begin
@y
@<Slide this cite key down to its permanent spot@>=
begin
if ((cite_xptr + 1) * num_fields > max_fields) then
confusion ('field_info index is out of range');
@z
@x [287] Allocate entry_ints as needed.
if (num_ent_ints*num_cites > max_ent_ints) then
begin
print (num_ent_ints*num_cites,': ');
overflow('total number of integer entry-variables ',max_ent_ints);
end;
@y
entry_ints := XTALLOC ((num_ent_ints + 1) * (num_cites + 1), integer);
@z
@x [288] Allocate entry_strs as needed.
if (num_ent_strs*num_cites > max_ent_strs) then
begin
print (num_ent_strs*num_cites,': ');
overflow('total number of string entry-variables ',max_ent_strs);
end;
@y
entry_strs := XTALLOC ((num_ent_strs + 1) * (num_cites + 1) * (ent_str_size + 1), ASCII_code);
@z
@x [still 288] Macroize entry_strs[][].
entry_strs[str_ent_ptr][0] := end_of_string;
@y
x_entry_strs(str_ent_ptr)(0) := end_of_string;
@z
@x [291] Dynamic lit_stk_size.
@!lit_stack : array[lit_stk_loc] of integer; {the literal function stack}
@!lit_stk_type : array[lit_stk_loc] of stk_type; {their corresponding types}
@y
@!lit_stack : ^integer; {the literal function stack}
@!lit_stk_type : ^stk_type; {their corresponding types}
@z
@x [291] Dynamic lit_stk_size.
@!lit_stk_loc = 0..lit_stk_size; {the stack range}
@y
@!lit_stk_loc = integer; {the stack range}
@z
@x [301] Macroize entry_strs[][].
char1 := entry_strs[ptr1][char_ptr];
char2 := entry_strs[ptr2][char_ptr];
@y
char1 := x_entry_strs(ptr1)(char_ptr);
char2 := x_entry_strs(ptr2)(char_ptr);
@z
@x [307] Reallocate literal stack.
overflow('literal-stack size ',lit_stk_size);
@y
begin
BIB_XRETALLOC_NOSET ('lit_stack', lit_stack, integer,
lit_stk_size, lit_stk_size + LIT_STK_SIZE);
BIB_XRETALLOC ('lit_stk_type', lit_stk_type, stk_type,
lit_stk_size, lit_stk_size + LIT_STK_SIZE);
end;
@z
@x [320] Dynamic buf_size.
if (out_buf_length+(p_ptr2-p_ptr1) > buf_size) then
overflow('output buffer size ',buf_size);
@y
while (out_buf_length+(p_ptr2-p_ptr1) > buf_size) do
buffer_overflow;
@z
@x [327] Add check for fieldinfo[] overflow.
field_ptr := cite_ptr*num_fields + fn_info[ex_fn_loc];
@y
field_ptr := cite_ptr*num_fields + fn_info[ex_fn_loc];
if (field_ptr >= max_fields) then
confusion ('field_info index is out of range');
@z
@x [330] Macroize entry_strs[][]
while (entry_strs[str_ent_ptr][ex_buf_ptr] <> end_of_string) do
{copy characters into the buffer}
append_ex_buf_char (entry_strs[str_ent_ptr][ex_buf_ptr]);
@y
while (x_entry_strs(str_ent_ptr)(ex_buf_ptr) <> end_of_string) do
{copy characters into the buffer}
append_ex_buf_char (x_entry_strs(str_ent_ptr)(ex_buf_ptr));
@z
@x [330] Macroize global_strs[][]
append_char (global_strs[str_glb_ptr][glob_chr_ptr]);
@y
append_char (x_global_strs(str_glb_ptr)(glob_chr_ptr));
@z
@x [334] Bug fix: remove duplicate entry.
build_in('width$ ',6,b_width,n_width);
build_in('while$ ',6,b_while,n_while);
build_in('width$ ',6,b_width,n_width);
@y
build_in('while$ ',6,b_while,n_while);
build_in('width$ ',6,b_width,n_width);
@z
@x [337] s_preamble is dynamically allocated.
@!s_preamble : array[bib_number] of str_number;
@y
@!s_preamble : ^str_number;
@z
@x [344] Dynamic buf_size.
@!name_tok : packed array[buf_pointer] of buf_pointer; {name-token ptr list}
@!name_sep_char : packed array[buf_pointer] of ASCII_code; {token-ending chars}
@y
@!name_tok : ^buf_pointer; {name-token ptr list}
@!name_sep_char : ^ASCII_code; {token-ending chars}
@z
@x [357] Macroize entry_strs[][].
while (sp_ptr < sp_xptr1) do
begin {copy characters into |entry_strs|}
entry_strs[str_ent_ptr][ent_chr_ptr] := str_pool[sp_ptr];
incr(ent_chr_ptr);
incr(sp_ptr);
end;
entry_strs[str_ent_ptr][ent_chr_ptr] := end_of_string;
@y
while (sp_ptr < sp_xptr1) do
begin {copy characters into |entry_strs|}
x_entry_strs(str_ent_ptr)(ent_chr_ptr) := str_pool[sp_ptr];
incr(ent_chr_ptr);
incr(sp_ptr);
end;
x_entry_strs(str_ent_ptr)(ent_chr_ptr) := end_of_string;
@z
@x [359] Macroize global_strs[][]
global_strs[str_glb_ptr][glob_chr_ptr] := str_pool[sp_ptr];
@y
x_global_strs(str_glb_ptr)(glob_chr_ptr) := str_pool[sp_ptr];
@z
% [388] bibtex.web has mutually exclusive tests here; Oren said he
% doesn't want to fix it until 1.0, since it's obviously of no practical
% import (or someone would have found it before GCC 2 did). Changing
% the second `and' to an `or' makes all but the last of multiple authors
% be omitted in the bbl file, so I simply removed the statement.
@x
while ((ex_buf_xptr < ex_buf_ptr) and
(lex_class[ex_buf[ex_buf_ptr]] = white_space) and
(lex_class[ex_buf[ex_buf_ptr]] = sep_char)) do
incr(ex_buf_xptr); {this removes leading stuff}
@y
@z
% Forgot to check for pool overflow here. Triggered by test case linked
% from http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=520920.
@x [438]
while (sp_ptr < sp_end) do {shift the substring}
@y
str_room(sp_end - sp_ptr);
while (sp_ptr < sp_end) do {shift the substring}
@z
% Forgot to check for pool overflow here. Triggered by bibtex-mem.test (3).
@x [444]
if (pop_lit2 >= cmd_str_ptr) then {no shifting---merely change pointers}
@y
str_room(sp_brace_level + sp_end - sp_ptr);
if (pop_lit2 >= cmd_str_ptr) then {no shifting---merely change pointers}
@z
% [459] Eliminate unreferenced statement label, because `undefined' is
% now a constant expression that is not evaluated at the Web level. If
% this label were ever required, it could be replaced by the constant
% 9997, which is not used as a statement label in BibTeX.
@x
undefined : trace_pr ('unknown')
@y
trace_pr ('unknown')
@z
@x [460] Macroize entry_strs[][].
while (entry_strs[str_ent_ptr][ent_chr_ptr] <> end_of_string) do
begin
trace_pr (xchr[entry_strs[str_ent_ptr][ent_chr_ptr]]);
incr(ent_chr_ptr);
end;
@y
while (x_entry_strs(str_ent_ptr)(ent_chr_ptr) <> end_of_string) do
begin
trace_pr (xchr[x_entry_strs(str_ent_ptr)(ent_chr_ptr)]);
incr(ent_chr_ptr);
end;
@z
@x [462] Add check for fieldinfo[] overflow.
field_ptr := cite_ptr * num_fields;
field_end_ptr := field_ptr + num_fields;
@y
field_ptr := cite_ptr * num_fields;
field_end_ptr := field_ptr + num_fields;
if (field_end_ptr > max_fields) then
confusion ('field_info index is out of range');
@z
% emacs-page
@x [468] System-dependent changes.
This section should be replaced, if necessary, by changes to the program
that are necessary to make \BibTeX\ work at a particular installation.
It is usually best to design your change file so that all changes to
previous sections preserve the section numbering; then everybody's version
will be consistent with the printed program. More extensive changes,
which introduce new sections, can be inserted here; then only the index
itself will get a new section number.
@y
@d argument_is (#) == (strcmp (long_options[option_index].name, #) = 0)
@<Define |parse_arguments|@> =
procedure parse_arguments;
const n_options = 4; {Pascal won't count array lengths for us.}
var @!long_options: array[0..n_options] of getopt_struct;
@!getopt_return_val: integer;
@!option_index: c_int_type;
@!current_option: 0..n_options;
begin
@<Initialize the option variables@>;
@<Define the option table@>;
repeat
getopt_return_val := getopt_long_only (argc, argv, '', long_options,
address_of (option_index));
if getopt_return_val = -1 then begin
{End of arguments; we exit the loop below.} ;
end else if getopt_return_val = "?" then begin
usage (my_name);
end else if argument_is ('min-crossrefs') then begin
min_crossrefs := atoi (optarg);
end else if argument_is ('help') then begin
usage_help (BIBTEX_HELP, nil);
end else if argument_is ('version') then begin
print_version_and_exit (banner, 'Oren Patashnik', nil, nil);
end; {Else it was a flag; |getopt| has already done the assignment.}
until getopt_return_val = -1;
{Now |optind| is the index of first non-option on the command line.
We must have one remaining argument.}
if (optind + 1 <> argc) then begin
write_ln (stderr, my_name, ': Need exactly one file argument.');
usage (my_name);
end;
end;
@ Here is the first of the options we allow.
@.-terse@>
@<Define the option...@> =
current_option := 0;
long_options[0].name := 'terse';
long_options[0].has_arg := 0;
long_options[0].flag := address_of (verbose);
long_options[0].val := 0;
incr (current_option);
@ The global variable |verbose| determines whether or not we print
progress information.
@<Glob...@> =
@!verbose: c_int_type;
@ Start off |true|, to match the default behavior.
@<Initialize the option...@> =
verbose := true;
@ Here is an option to change the minimum number of cross-refs required
for automatic |cite_list| inclusion.
@.-min-crossrefs@>
@<Define the option...@> =
long_options[current_option].name := 'min-crossrefs';
long_options[current_option].has_arg := 1;
long_options[current_option].flag := 0;
long_options[current_option].val := 0;
incr (current_option);
@
@<Glob...@> =
@!min_crossrefs: integer;
@ Set |min_crossrefs| to two by default, so we match the
documentation (\.{btxdoc.tex}).
@<Initialize the option...@> =
min_crossrefs := 2;
@ One of the standard options.
@.-help@>
@<Define the option...@> =
long_options[current_option].name := 'help';
long_options[current_option].has_arg := 0;
long_options[current_option].flag := 0;
long_options[current_option].val := 0;
incr (current_option);
@ Another of the standard options.
@.-version@>
@<Define the option...@> =
long_options[current_option].name := 'version';
long_options[current_option].has_arg := 0;
long_options[current_option].flag := 0;
long_options[current_option].val := 0;
incr (current_option);
@ An element with all zeros always ends the list.
@<Define the option...@> =
long_options[current_option].name := 0;
long_options[current_option].has_arg := 0;
long_options[current_option].flag := 0;
long_options[current_option].val := 0;
@ Determine |ent_str_size|, |glob_str_size|, and |max_strings| from the
environment, configuration file, or default value. Set
|hash_size:=max_strings|, but not less than |HASH_SIZE|.
{|setup_bound_var| stuff adapted from \.{tex.ch}.}
@d setup_bound_var(#)==bound_default:=#; setup_bound_var_end
@d setup_bound_var_end(#)==bound_name:=#; setup_bound_var_end_end
@d setup_bound_var_end_end(#)==
setup_bound_variable(address_of(#), bound_name, bound_default);
if # < bound_default then # := bound_default
@<Procedures and functions for about everything@>=
procedure setup_params;
var bound_default: integer; {for setup}
@!bound_name: const_cstring; {for setup}
begin kpse_set_program_name (argv[0], 'bibtex');
setup_bound_var (ENT_STR_SIZE)('ent_str_size')(ent_str_size);
setup_bound_var (GLOB_STR_SIZE)('glob_str_size')(glob_str_size);
setup_bound_var (MAX_STRINGS)('max_strings')(max_strings);
@#
hash_size := max_strings;
if hash_size < HASH_SIZE then hash_size := HASH_SIZE;
hash_max := hash_size + hash_base - 1;
end_of_def := hash_max + 1;
undefined := hash_max + 1;
end;
@ We use the algorithm from Knuth's \.{primes.web} to compute |hash_prime|
as the smallest prime number not less than 85\% of |hash_size| (and
|>=128|).
@d primes == hash_next {array holding the first |k| primes}
@d mult == hash_text {array holding odd multiples of the first |o| primes}
@<Procedures and functions for about everything@>=
procedure compute_hash_prime;
var hash_want: integer; {85\% of |hash_size|}
@!k: integer; {number of prime numbers $p_i$ in |primes|}
@!j: integer; {a prime number candidate}
@!o: integer; {number of odd multiples of primes in |mult|}
@!square: integer; {$p_o^2$}
@!n: integer; {loop index}
@!j_prime: boolean; {is |j| a prime?}
begin hash_want := (hash_size div 20) * 17;
j := 1;
k := 1;
hash_prime := 2;
primes[k] := hash_prime;
o := 2;
square := 9;
while hash_prime < hash_want do
begin
repeat
j := j + 2;
if j = square then
begin
mult[o] := j;
j := j + 2;
incr (o);
square := primes[o] * primes[o];
end;
n := 2;
j_prime := true;
while (n < o) and j_prime do
begin
while mult[n] < j do mult[n] := mult[n] + 2 * primes[n];
if mult[n] = j then j_prime := false;
incr (n);
end;
until j_prime;
incr (k);
hash_prime := j;
primes[k] := hash_prime;
end;
end;
@z
|