summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/doc/generic
diff options
context:
space:
mode:
authorKarl Berry <karl@freefriends.org>2021-03-08 19:16:10 +0000
committerKarl Berry <karl@freefriends.org>2021-03-08 19:16:10 +0000
commit9fbac07cfaf6f8c5db0aeeae66423e5fedff8adc (patch)
tree6217079ead86439226c9e72777d9017761d4656d /Master/texmf-dist/doc/generic
parentbc334c3dd9395017a3d0327cd0ef1d88da2c290a (diff)
knuth tuneup2021 update from pwebmac/knuth-lib.tar.gz
git-svn-id: svn://tug.org/texlive/trunk@58228 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Master/texmf-dist/doc/generic')
-rw-r--r--Master/texmf-dist/doc/generic/knuth/bibtex/bibtex-changes.pdfbin0 -> 623949 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/bibtex/bibtex.pdfbin0 -> 1329581 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/ctie/ctie-changes.pdfbin0 -> 141031 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/ctie/ctie.pdfbin0 -> 283760 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/cweb/common-changes.pdfbin0 -> 223601 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/cweb/common.pdfbin0 -> 365934 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/cweb/ctangle-changes.pdfbin0 -> 211602 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/cweb/ctangle.pdfbin0 -> 381510 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/cweb/ctwill.pdfbin0 -> 1105039 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/cweb/cweave-changes.pdfbin0 -> 366946 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/cweb/cweave.pdfbin0 -> 815222 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/cweb/cwebman.pdfbin0 -> 346364 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/errata/cm85.bug1906
-rw-r--r--Master/texmf-dist/doc/generic/knuth/errata/errata.eight.pdfbin0 -> 275286 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/errata/errata.eleven.pdfbin0 -> 250939 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/errata/errata.five.pdfbin0 -> 306866 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/errata/errata.four.pdfbin0 -> 334569 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/errata/errata.nine.pdfbin0 -> 156353 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/errata/errata.one.pdfbin0 -> 270066 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/errata/errata.pdfbin1008183 -> 368818 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/errata/errata.seven.pdfbin0 -> 267572 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/errata/errata.six.pdfbin0 -> 303639 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/errata/errata.ten.pdfbin0 -> 378715 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/errata/errata.three.pdfbin0 -> 443745 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/errata/errata.twelve.pdfbin0 -> 413922 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/errata/errata.two.pdfbin0 -> 247190 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/errata/errorlog.pdfbin533370 -> 403427 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/errata/mf84.bug2443
-rw-r--r--Master/texmf-dist/doc/generic/knuth/errata/tex82.bug9279
-rw-r--r--Master/texmf-dist/doc/generic/knuth/etc/vftovp-changes.pdfbin0 -> 213216 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/etc/vftovp.pdfbin456973 -> 461991 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/etc/vptovf-changes.pdfbin0 -> 199934 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/etc/vptovf.pdfbin550714 -> 556621 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/index.html204
-rw-r--r--Master/texmf-dist/doc/generic/knuth/index.pdfbin0 -> 137032 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/mf/mf-changes.pdfbin0 -> 1209192 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/mf/mf.pdfbin3190839 -> 3233890 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/mf/trapman.pdfbin268756 -> 266241 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/mfware/gftodvi-changes.pdfbin0 -> 277421 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/mfware/gftodvi.pdfbin699958 -> 705879 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/mfware/gftopk-changes.pdfbin0 -> 145437 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/mfware/gftopk.pdfbin368916 -> 371125 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/mfware/gftype-changes.pdfbin0 -> 134194 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/mfware/gftype.pdfbin325458 -> 327642 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/mfware/mft-changes.pdfbin0 -> 203404 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/mfware/mft.pdfbin387237 -> 389642 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/other/dvicopy-changes.pdfbin0 -> 314779 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/other/dvicopy.pdfbin0 -> 790516 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/other/patgen-changes.pdfbin0 -> 156271 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/other/patgen.pdfbin0 -> 403186 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/other/pktogf-changes.pdfbin0 -> 121304 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/other/pktogf.pdfbin0 -> 318300 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/other/pktype-changes.pdfbin0 -> 94706 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/other/pktype.pdfbin0 -> 259268 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/pdftex/pdftex-changes.pdfbin0 -> 2657031 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/pdftex/pdftex.pdfbin0 -> 5384274 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/tex/glue.pdfbin198078 -> 197924 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/tex/tex-changes.pdfbin0 -> 1851815 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/tex/tex.pdfbin3565090 -> 3618769 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/tex/tripman.pdfbin328403 -> 325777 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/texware/dvitype-changes.pdfbin0 -> 188204 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/texware/dvitype.pdfbin466071 -> 470056 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/texware/pltotf-changes.pdfbin0 -> 176277 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/texware/pltotf.pdfbin470817 -> 474699 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/texware/pooltype-changes.pdfbin0 -> 76585 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/texware/pooltype.pdfbin191863 -> 191884 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/texware/tftopl-changes.pdfbin0 -> 157838 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/texware/tftopl.pdfbin358275 -> 361540 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/tie/tie-changes.pdfbin0 -> 122778 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/tie/tie.pdfbin0 -> 311729 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/web/tangle-changes.pdfbin0 -> 255115 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/web/tangle.pdfbin575568 -> 581226 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/web/weave-changes.pdfbin0 -> 264713 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/web/weave.pdfbin758163 -> 765442 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/web/webman.pdfbin295332 -> 296020 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/xetex/xetex-changes.pdfbin0 -> 2283995 bytes
-rw-r--r--Master/texmf-dist/doc/generic/knuth/xetex/xetex.pdfbin0 -> 4241603 bytes
77 files changed, 204 insertions, 13628 deletions
diff --git a/Master/texmf-dist/doc/generic/knuth/bibtex/bibtex-changes.pdf b/Master/texmf-dist/doc/generic/knuth/bibtex/bibtex-changes.pdf
new file mode 100644
index 00000000000..afd86ab0614
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/bibtex/bibtex-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/bibtex/bibtex.pdf b/Master/texmf-dist/doc/generic/knuth/bibtex/bibtex.pdf
new file mode 100644
index 00000000000..4717a8d4d48
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/bibtex/bibtex.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/ctie/ctie-changes.pdf b/Master/texmf-dist/doc/generic/knuth/ctie/ctie-changes.pdf
new file mode 100644
index 00000000000..8bad8e03264
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/ctie/ctie-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/ctie/ctie.pdf b/Master/texmf-dist/doc/generic/knuth/ctie/ctie.pdf
new file mode 100644
index 00000000000..82631a892f0
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/ctie/ctie.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/cweb/common-changes.pdf b/Master/texmf-dist/doc/generic/knuth/cweb/common-changes.pdf
new file mode 100644
index 00000000000..b3f19ba4d66
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/cweb/common-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/cweb/common.pdf b/Master/texmf-dist/doc/generic/knuth/cweb/common.pdf
new file mode 100644
index 00000000000..62e75b5a8df
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/cweb/common.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/cweb/ctangle-changes.pdf b/Master/texmf-dist/doc/generic/knuth/cweb/ctangle-changes.pdf
new file mode 100644
index 00000000000..876af8527ea
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/cweb/ctangle-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/cweb/ctangle.pdf b/Master/texmf-dist/doc/generic/knuth/cweb/ctangle.pdf
new file mode 100644
index 00000000000..b68c1bacf9f
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/cweb/ctangle.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/cweb/ctwill.pdf b/Master/texmf-dist/doc/generic/knuth/cweb/ctwill.pdf
new file mode 100644
index 00000000000..e5629b83483
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/cweb/ctwill.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/cweb/cweave-changes.pdf b/Master/texmf-dist/doc/generic/knuth/cweb/cweave-changes.pdf
new file mode 100644
index 00000000000..06d2f2bf92f
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/cweb/cweave-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/cweb/cweave.pdf b/Master/texmf-dist/doc/generic/knuth/cweb/cweave.pdf
new file mode 100644
index 00000000000..143a38b8737
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/cweb/cweave.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/cweb/cwebman.pdf b/Master/texmf-dist/doc/generic/knuth/cweb/cwebman.pdf
new file mode 100644
index 00000000000..92feb676b4f
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/cweb/cwebman.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/errata/cm85.bug b/Master/texmf-dist/doc/generic/knuth/errata/cm85.bug
deleted file mode 100644
index d8cbea6442d..00000000000
--- a/Master/texmf-dist/doc/generic/knuth/errata/cm85.bug
+++ /dev/null
@@ -1,1906 +0,0 @@
-This file is a log of changes made to the "new generation" of Computer Modern
-fonts, after the first output proofs were ready. I had a great deal of
-advice from Neenie Billawala, Matthew Carter, and Richard Southall while
-I was making these revisions.
-
-Entries are in chronological order; thus the most recent news appears
-at the bottom of the file.
-
--------------------------------------------------------------------------------
- Changes based on the proofsheets of April 26, 1985
-ACCENT.MF:
- lower the idots, umlauts, and tilde (MC)
- Polish ell cross: longer stroke in bold
-CMBASE.MF:
-COMLIG.MF:
- double quotes too close together in bold (MC)
-CSCSPU.MF:
- SS made from two S's
-GREEKU.MF:
- Gamma: .25u longer arm
- Lambda: too narrow (MC,NB)
- Xi: 1u wider; shorten middle serifs (MC)
- top and bottom strokes to be arms (NB)
- Psi: more super; thin the lower curve (MC)
- add points 3' and 7' for crisp sans
- Omega: redo the bottom, curl 0 becomes vertical (MC)
- thin from hair to vair at points 3 and 5
-PUNCT.MF:
- Monospace period, comma, colon, semicolon made heavier (MC)
-ROMAN.MF:
- ligs=2 gets ff, fi, etc.; ligs=1 gets only --, '', etc.
- II kerning introduced
- kern between a and ' in csc
-ROMAND.MF:
- 0: med_curve decreased to curve; y2l and y4l raised
- 1: cap_bar changed to bar in the top stroke
- sans-serif serifs also use bar as the slab height
- 2: lighten cap_curve and cap_stem slightly (RS)
- move point 3 down by .5vair (MC)
- 4: thin the diagonal still more (NB)
- bar line moves up one pixel when there's a serif below it
- 6: move bulb to the right (MC)
- make the lower left curve more_super (RS,NB)
- 9: make the upper right curve more_super (RS,NB)
-ROMANL.MF:
- a: bulb positioned by its center rather than the left (MC)
- c: right terminals moved closer to the edge (MC,NB)
- more pull on the inside left (RS)
- e: less left sidebar in monospace (MC)
- bold versions to be wider (MC)
- more pull on inside left (MC,RS)
- g: lower edge of loop goes one pixel lower
- varg: point 6 raised above baseline (MC)
- y0 calculated so that it works when x7l=stem_edge
- lower arc goes one pixel lower
- i: monospace version gets more left sidebar (MC)
- dot moves slightly right (NB)
- stem'' increased to stem' (MC,RS,NB)
- slab replaces tiny in correction for dot-too-close
- j: diminish monospace sidebars (MC)
- shift slightly to right (MC)
- k: serif right_jut decreased .8 to .6
- bug fixed in alpha2 (had y1 not y11)(MC,RS,NB)
- decreased diagonal weights
- "if abs(angle(z3-z4)-45)<2:y4:=y3-(x3-x4);fi" rejected; moves y4 down too much
- n: omit pull inside the arch (MC,RS)
- introduce stem_shift, shifts this character and others slightly right (MC)
- o: raise y2l and y4l (RS)
- s: reduced sidebearing in sans (MC)
- increased thickness at edges (.35 to .5) (RS)
- changed to super_arc, and made it more_super (RS)
- raised the top of upper barb to equal top of the character (RS)
- removed typo (`tiny' for `fine')
- reduced flare in upper terminal of sans, and rounded it properly
- t: width to grow in bold case
- height made independent of bar_height
- slightly longer bar (MC)
- v: decreased left stem (RS)
- w: decreased stems (MC,RS)
- monospace version drops middle from 2/3 to .6 and lengthens inner serifs
- x: decreased left stem
- y: decreased left stem
- z: lighter diagonal, longer upper arm (MC,RS,NB)
-ROMANP.MF:
- $: tau eliminated
-ROMANU.MF:
- A: decrease right stem (MC)
- make the bar thinner (MC,NB)
- bar position based on y0 rather than bar_height
- C: use cap_band instead of vair' at top and bottom (RS)
- correct typo: x2l to be reset, not y2l
- E: middle arm .35u longer, but beak reduced from .7 to .6 (MC)
- F: top arm .25u longer; middle arm as E (MC)
- G: same as C; also the bar is raised one pixel
- J: slightly longer upper left serif
- K: lower diagonal thinned and moved outward
- M: monospace version raised still more in middle
- N: diagonal thinned (MC,RS)
- O: y2l and y4l raised
- R: tail should move to the right (MC,RS,NB)
- bold case gets wider (RS,NB)
- S: changed as s (RS)
- V: took stem_corr off the left stem (MC)
- W: monospace version takes center down from 2/3 to .6, lengthens inner jut
- X: took stem_corr off the left stem (MC)
- Y: took stem_corr off the left stem (MC)
- Z: diagonal made lighter in sans (MC)
- upper arm made longer (MC,RS)
-ROMLIG.MF:
- equalize stem weights (RS,NB)
-ROMSPL.MF:
- ae, oe: incorporate changes of a and e and o
- ss: more stem weight, less curve weight, less bulb (MC,NB)
- dotless i,j: see i,j
-ROMSPU.MF:
- AE: middle arm changes as E (MC)
- if hefty and monospace, avoid the serif on middle arm
- bars not aligned if hefty
- if monospace, middle stem moves to right
- OE: middle arm changes as in AE (MC)
- middle stem lightened
-ROMSUB.MF:
- blankspace: not so close to sides
-SYM.MF:
-CMR10.MF etc:
- bar_height raised in the quote and bold fonts (MC,NB)
- comma_depth in cmtt10 increased from 40 to 50 (MC)
- cap_notch_cut decreased in cmsc10, cmsx10
- apex_o decreased in cmr10, cmb10, cmbx10, cmbx5, cmcsc10, cmtt10
- o decreased in cmb10
- cap_jut decreased from 39 to 34 in cmb10; cap_serif_fit increased 5 to 6
- cmbx5 gets smaller beak, fudge, cap_ess; more apex_corr
-GENERAL:
- "robustness" added when points like x8r of "a" are calculated
- (this affects a,b,d,varg,j,p,q,t,u,dj,ae,6,9,f_stroke)
- "robustness" also added to avoid curl at end of paths
- (this affects c,e,s,C,G,S,1,5,ae,oe,breve,parens)
- "term" subroutine adds robustness for sans-serif terminals
- (this affects C,G,J,S,f_stroke,j,ss,ae,oe,2,3,5,6,9,$,&,?,@)
- code revised to use "pos" instead of "penpos" when possible
- Changes based on the proofsheets of May and June, 1985
-ROMAND.MF:
- 1: use o instead of apex_o
- 4: bar line height shouldn't depend on bar_height
- 5: sans-serif lower terminal position raised; depends on upper left edge
- bug in arm at top (0 for 90) made all hefty arms too small
- 9: disappears at link
-ROMANU.MF:
- B: middle bar positioned by its middle, not its bottom (RS)
- serifed lobes thickened slightly at bottom (RS)
- C: lower terminal is tilted the other way
- C,G: upper terminal in sans-serif is tilted slightly
- upper barb is darkened
- J: tilt the lower terminal
- K: lighten the main diagonal (serif case) (RS)
- lighten the upper diagonal (sans-serif case) (RS)
- M: remove apex_corr (RS)
- N: lighten the diagonal
- P: too light below counter (RS)
- Q: sharpen upper right corner of sans-serif tail (RS)
- top of tail thickened and moved slightly left
- S: less super at upper left and lower right (MC)
- barb to go below baseline
- barbs darkened
- add weight at top, bottom in sans_serif version (RS)
- tilt the lower terminal like the upper one
- top weight needs to be maxed with fine.breadth
- W: top middle stems allowed to overlap in serifed case
- second inner serif made no longer than left outer serif (MC)
- ceiling must become floor, to ensure that x5r>=x4r-mid_corr
- Z: diagonal still too heavy, because previous change was ineffective
- beaks made darker
- better positioning of y2 and y3 when tiny is zero
-CSCSPU.MF:
- J,SS: changes from J and S
-ROMANL.MF:
- a: inappropriate uses of "fine" are removed
- bh introduced to guard against "wild" bar heights
- thin_join introduced at point 9
- robustness logic changed so that x8l-x8r<=u
- c: too much weight constrast between strokes in sans_serif (RS)
- top terminal lowered to match a
- bottom terminal tilted the other way
- d: fine.breadth should have been thin_join as in b, p, q
- e: 1+xpart changed to xpart
- bottom terminal tilted the other way
- g: sans-serif ear to use z0l and z0r
- h,m,n: left inner serifs stay at jut length
- i,l: mod_width for better fit at lowres
- j: reposition stem for better fit (use .5w+2.5u, not w-2.5u)
- remove bug in "pos" change
- k: upper diagonal serif lengthened from 1.2jut to 1.4jut (RS)
- diagonals made still lighter
- r: thin_join introduced
- s: barb to go below baseline
- barbs darkened
- add weight at top, bottom in sans_serif version (RS)
- tilt the lower terminal like the upper one (RS)
- top weight needs to be maxed with fine.breadth
- t: bar extended still more at right (RS)
- v: decreased the width by .25width_adj#
- w: overlap allowed as in W
- second inner serif made no longer than left outer serif (MC)
- ceiling must become floor, to ensure that x5r>=x4r-mid_corr
- x: decreased the width by .5width_adj# (RS)
- y: sans-serif tail curls up too far (RS)
- z: beaks too light; decrease the diagonal to compensate (RS)
- better positioning of y2 and y3 when tiny is zero
-ROMSPL.MF:
- dotless i and j: as i and j
- ae and oe: bottom terminal tilted the other way
- ae: corrected as a
-ROMSPU.MF:
- AE: x12 based on x1l rather than x1, works better in bold cases (RS)
- OE: left curve not to be pulled
-GREEKU.MF:
- Phi and Psi: middle parts must keep away from the serifs
-ROMANP.MF:
- $: strengthened the terminals in sans-serif case, and tilted them
- &: opened the eye by moving point 8 left .5u (RS)
- ?: tilted the sans-serif terminal and moved it down a little more
-PUNCT.MF:
- %: move the diagonal a bit left at the top
- ( and ): 3.5( changed to 3(.
- [ and ]: round changed to ceiling and floor, avoids disappearing brackets
- @: inner a placed by its edges instead of its stem centers (RS)
-ITALL.MF:
- f: lower bulb moved left; .5 changed to .6 between bulb and stem
- k: bug in lower right stroke (missing e's)
- l: bug in italic correction for math fitting (u not u#)
- m: avoid hooks in monospace version
- p: lengthed left serif at bottom from .5jut to .75jut
- x: bulbs moved .25u further out; .5 used between bulb and stem
- w: avoid hook in monospace version
-ITALIG.MF:
- all five: changed like f
- fi: made 1u less wide
- fl,ffl: made .5u less wide, bulb now touches the l stem
- ffi: made .75u less wide
-GREEKL.MF:
- beta, gamma, zeta, xi, omega, varepsilon: +eps at the tight turns
- gamma: final diagonal should be more slanted (MC)
- zeta: as tall as xi, shallower diagonal slant (MC)
- kappa: bug in lower right stroke (missing e's)
- xi: raise the bottom diagonal and distort arc slightly (MC)
- chi: introduce slight curve in main diagonal stroke
- varphi: too wide at right half bowl (MC)
-ITALMS.MF:
- wp: bulb smaller, bottom a little more open
-ITALD.MF:
- 5: changed like 5 in ROMAND
-OLDDIG.MF:
- 2: top a bit narrower, bottom a bit wider (MC)
- 5: changed like 5 in ROMAND
-SYM.MF:
- plus-minus: shift depends on u not asc_height
-SYMBOL.MF:
- minus-plus: shift depends on u not asc_height
- up-and-down arrows (characters '154 and '155): taller and deeper
- clubsuit: wider
- spadesuit: y1+1 changed to y1+.75 (also in clubsuit)
-ROMAN.MF:
- eliminated kerning between L and O,C,G,Q,U (also in TEXTIT and CSC)
-MATHEX.MF:
- font_x_height needed to be set, for positioning of accents
-CMB10.MF:
- dishing is too much (on all bold fonts)
-CMR5.MF:
- letter_fit decreased 10 to 5
-CMBX5.MF:
- fudge should be 1 (cap_stem 8=:7 in aps mode was too much)
- decrease letter_fit drastically; this means f-ligatures must come back
- lowercase parameters increased by 2/36
-CMBI10.MF:
- lowercase serifs too short. (same change to all the italic fonts)
-CMSX10.MF:
- decrease `ess' (RS)
-CMTC10.MF:
- fudge is too much in lowercase
-CMCC10.MF:
- lowercase more extended
- much less letterspace in caps
- increase lower.cap_curve, decrease lower.o
-CMSQI8.MF:
- slope shouldn't be so much (RS)
- increase `ess' (RS)
-
-GENERAL:
- serif-abutment corrections changed to +1 instead of +2
- vround used for vertical rounding
-
-CMBASE.MF:
- new way to set shrink_fit (0,1,2) for monotonicity with letter_fit
- letter_fit not included in mono_charwd
- fine must be positive (else we lose barbs)
- thin_join must be positive (else h_stroke gives a bad pos)
- Changes based on the `version 0' test fonts of July 12
-[not showing hundreds of changes to the `typography' of the programs]
-
-Driver files in general:
-Frequency info (from MANUAL.TEX[tex,dek]) was used to order the ligtables
-font_xheight changed to font_x_height (a change to PLAIN.MF)
-
-Program files in general:
- use `hround' instead of `round' wherever granularity might be wanted
- less_rounded was taken out; autorounded occasionally put in
- arm($,$$,...), the value of y$$ was adjusted by eps (lower) or -eps (upper)
-
-Parameter files in general:
- new 12pt and 17+pt fonts; more sans serif fonts
- new comment at bottom of all parameter files: `switch to the driver file'
-
-ACCENT.MF:
- ^: eps subtracted from y1 (helps avoid degenerate equations in ultralowres)
- '`: eps added to y1
-
-ROMAN.MF:
- kern entry for gj had the wrong sign
- kerns for v removed in sans serif
- new kern for aj in serif case
- new kern for ar in sans serif
-
-ROMAND.MF:
- 3: pos3 needed to be maxed with fine.breadth
- y1r,y9r needed to be adjusted by eps
- 6,9: keep x1 on the correct side of x2 at lowlowres
- (this change also affects OLDDIG, ITALD, and ITALMS partial sign)
-
-ROMANP.MF:
- $: less_tense bulbs
-
-ROMSPL.MF:
- ss: ensure x5 not > x4l at low resolutions
-
-ROMLIG.MF:
- itc shouldn't include the slant...
-
-COMLIG.MF:
- em dash should be one em wide (add letter_fit# to the adjustments)
-
-BIGOP.MF:
- \displaystyle coproduct sign had 1.2bracket instead of 1.8bracket
- charlist syntax changed from commas to colons
-
-BIGDEL.MF:
- extensible double arrow: position wasn't computed as in top and bottom
- charlist syntax changed from commas to colons
-
-BIGACC.MF:
- charlist syntax changed from commas to colons
-
-ITALL.MF:
- c: point 1 made definitely greater than point 2, for lowlowres
- q: x4 increased by eps, for lowlowres path intersection
- r: x4 based on w, not 5u
- s: max(ess,fine.breadth)
- add eps and 2eps for lowlowres case (cmmi6 at 100/in)
-
-ITALMS.MF:
- wp: x6r must not be less than x1r at lowlowres
-
-TSETSL.MF:
- gamma: last time's bugfix from GREEKL needs to be here too
-
-GREEKL.MF:
- omega: add 2eps to x4-x6
- lambda: make sure that y3>y4 at lowlowres
- zeta: make sure that x2>x0 at lowlowres
- varsigma: make sure that x1>x2 at lowlowres
-
-CMFIB8.MF:
- decreased serif_fit, cap_serif_fit; increased curve, cap_curve
-
-CMBASE.MF:
- l,r made newinternals
- serif darkness and skew switches now done with boolean variables
- comma and ammoc: 2eps addedto/subtractedfrom position of x@2
- mod_width now called change_width
- ess and cap_ess initialized to preserve ratios with stem and cap_stem
- mode="string" had to be handled properly
- ^ and ! changed to t_ and o_, as per new PLAIN conventions
- make cmchar "outer"
- t_ is now `relaxed' if it is useless
- soft is now softjoin in PLAIN (we must set join_radius:=u)
- eps is now in PLAIN
- vair is vrounded but at least 1; also slab, etc.
- cal nibs, yscaled by cap_hair not vair
- autorounding and smoothing turned off
-
-ROMANL.MF:
- a: `footed' version is .25u tighter at the right
- b,d,varg,p,q: x4l position relative to .5(w-serif_fit) not 5u
- e: testpath uses .r not .l (because of cmss10)
- f: added 1 at right for monospace lowres versions
- varg: robust sans-serif terminal at tail
- m: missing `round' in r adjustment caused noninteger chardx
- r: x4 based on w, not 5.25u
- s: watch out that ess isn't so small that badpos error occurs (also ROMANU)
- barbs made longer; based on middle stroke not just h
- t: sans-serif terminal made more robust in extreme cases
- w: in non-monospace hefty serif case, the middle point comes to .8h not h
- y: robust sans-serif terminal at tail
-
-ROMANU.MF:
- E: good.y used in y9
-
-PUNCT.MF:
- []: side_thickness needed to be maxed with crisp.breadth
- +1 or -1 makes lowres versions more distinctive
- #: tricky part lost at low resolution
-
-SYMBOL.MF:
- angle brackets: +1 and -1 to make lowres versions more distinctive
- aleph: eps added so that y5 will be well defined at lowlowres
-
-SYM.MF:
- integral sign: bulbs need to be in right direction at lowlowres
-
-CALU.MF:
- A: apex moved slightly down
- D: less flat at top, slightly lower lobe
- F: u less right sidebar
- H: soft corner at upper left
- I: middle stroke more like J, upper bar a little further right
- K: introduce t_ in case of aspect_ratio
- L: darker
- M: lighter first diagonal; clean the joins
- N: lighter diagonal; clean bottom right; .5u less right sidebar
- O: shortened the inner stroke
- P: stem comes lower
- Q: tail not so long at left
- R: not so flat at top; diagonal less tense; tail less high
- T: narrower, also changed like I, .5u less right sidebar,
- heavier, not so high at right
- U: less extreme curve at lower left
- V: cleaned up at bottom; lighter first diagonal; slightly wider
- W: changed like V, but double
- X: new design, less rigid
- Y: new design based more on V than U
- Z: tighter at right, heavier at top and bottom
-
-CMSS10.MF:
- decreased notch_cut and bar_height
-
-%Note: The following can presumably be deleted; I removed it from CMBASE because
-% I don't think it is used any more:
-vardef parallel_pos(expr d,u,v,w) = % point at distance $d$ from $u$,
- % on the line through $w$ that's parallel to |u..v|
- pair p_; p_=w+whatever*(u-v)=u+whatever*(u-v) rotated 90;
- numeric d_; d_=length(u-p_); % distance from $w$ to |u..v|
- if d_>=d: p_ else: p_+(d+-+d_)*unitvector(v-u) fi enddef;
- Changes subsequent to `Version 1' as released on October 7, 1985.
-
-1. thin_join should be subject to blacker:
-@x in CMBASE.MF, the font_setup routine
- define_whole_pixels(letter_fit,thin_join,fine,crisp,tiny);
- define_whole_vertical_pixels(body_height,asc_height,
- cap_height,fig_height,x_height,comma_depth,desc_depth,serif_drop);
- define_whole_blacker_pixels(hair,stem,curve,flare,
-@y
- define_whole_pixels(letter_fit,fine,crisp,tiny);
- define_whole_vertical_pixels(body_height,asc_height,
- cap_height,fig_height,x_height,comma_depth,desc_depth,serif_drop);
- define_whole_blacker_pixels(thin_join,hair,stem,curve,flare,
-@z
-@x
- if thin_join=0: thin_join:=1; fi
-@y
-@z
-[Note, December 11: My first correction also introduced the statement
- if fine<thin_join: fine:=thin_join; fi
-in place of
- if fine=0: fine:=1; fi
-but I can't understand why I would do such a stupid thing!]
-
-2. A new subroutine needed in CMBASE.MF (for cases with aspect_ratio<>1):
-vardef Vround primary y = y_:=vround y;
- if y_<min_Vround: min_Vround else: y_ fi enddef;
-newinternal y_,min_Vround;
-
-@x related changes to the font_setup routine (in CMBASE.MF):
- forsuffixes $=vair,bar,slab,cap_bar,cap_band:
- $:=vround($.#*hppp+blacker); if $<=1: $:=1; fi endfor
-@y
- define_whole_vertical_blacker_pixels(vair,bar,slab,cap_bar,cap_band);
-@z
-@x
- vair':=max(1,vround(vair+vair_corr));
- vstem:=max(1,vround .8[vair,stem]);
- cap_vstem:=max(1,vround .8[vair,cap_stem]);
-@y
- vair':=vround(vair+vair_corr);
- vstem:=vround .8[vair,stem]; cap_vstem:=vround .8[vair,cap_stem];
-@z
-@x
- pickup pencircle scaled rule_thickness; rule.nib:=savepen;
-@y
- min_Vround:=max(fine.breadth,crisp.breadth,tiny.breadth);
- forsuffixes $=vair,bar,slab,cap_bar,cap_band,vair',vstem,cap_vstem:
- if $<min_Vround: $:=min_Vround; fi endfor
- pickup pencircle scaled rule_thickness; rule.nib:=savepen;
-@z
-
-The Vround routine is substituted for vround in the programs for
- Macron, line 6 (in ACCENT.MF)
- Variant epsilon, line 5 (in GREEKL.MF)
- Sigma, line 6 (in GREEKU.MF)
- Omega, line 14 (in GREEKU.MF)
- 2, line 6 (in OLDDIG.MF and ROMAND.MF)
- 7, lines 6 and 8 (in OLDDIG.MF and ROMAND.MF)
- g, lines 6 and 8 (in ROMANL.MF)
- s, line 6 (in ROMANL.MF)
- y, line 9 (in ROMANL.MF)
- z, line 6 (in ROMANL.MF)
- &, line 39 (in ROMANP.MF)
- ?, line 18 (in ROMANP.MF)
- Spanish open ?, line 17 (in ROMANP.MF)
- Z, line 6 (in ROMANU.MF)
- smile and frown, line 4 (in ROMMS.MF)
-
-3. Typo in program for oe ligature.
-@x in file ROMSPL.MF
-else: left_curve=max(tiny.breadth,hround(curve-2stem_corr));
-@y
-else: left_curve=max(fine.breadth,hround(curve-2stem_corr));
-@z
-
-4. Forgotten update to program for SS.
-@x in file CSCSPU.MF
-pickup fine.nib; pos2(max(fine.breadth,s_slab-vround vair_corr),-90);
-pos0(cap_ess,theta); pos7(s_slab,-90);
-x2+x7=2x0=w; x7-x2=if serifs: u else: 0 fi; top y2l=h+o; bot y7r=-o;
-y0=.52h; lft x3l=hround u; rt x6r=hround(w-u);
-x3r-x3l=x6r-x6l=hround .5[s_slab,cap_ess] -fine;
-@y
-numeric ess'; ess'=max(fine.breadth,cap_ess);
-pickup fine.nib; pos2(max(fine.breadth,s_slab-vround vair_corr),-90);
-pos0(ess',theta); pos7(s_slab,-90);
-x2+x7=2x0=w; x7-x2=if serifs: u else: 0 fi; top y2l=h+o; bot y7r=-o;
-y0=.52h; lft x3l=hround u; rt x6r=hround(w-u);
-x3r-x3l=x6r-x6l=hround .5[s_slab,ess']-fine;
-@z
-
-5. Hairline in `k' was overcorrected. (Pavel Curtis)
-@x in file ROMANL.MF
-stem3=max(tiny.breadth,hround(fudged.hair-4stem_corr));
-@y
-stem3=max(tiny.breadth,hround(fudged.hair if hefty:-\\4stem_corr fi));
-@z
-
-6. Too much kerning in "We", etc., in sans-serif fonts
-@x in file ROMAN.MF and TEXSET.MF
- ligtable "F": "V": "W": "o" kern kk#, "e" kern kk#, "u" kern kk#,
- "r" kern kk#, "a" kern kk#, "A" kern kkk#,
-@y
- ligtable "F": "V": "W": if serifs: "o" kern kk#, "e" kern kk#, "u" kern kk#,
- "r" kern kk#, "a" kern kk#, "A" kern kkk#,
- else: "o" kern k#, "e" kern k#, "u" kern k#,
- "r" kern k#, "a" kern k#, "A" kern kk#, fi
-@z
-@x in file TITLE.MF
- ligtable "F": "V": "W": "A" kern kkk#,
-@y
- ligtable "F": "V": "W": "A" kern if serifs: kkk# else: kk#\\fi,
-@z
-@x in file CSC.MF
- ligtable "F": "V": "W": "a" kern kkk#, "A" kern kkk#,
-@y
- ligtable "F": "V": "W": if serifs: "a" kern kkk#, "A" kern kkk#,
- else: "a" kern kk#, "A" kern kk#, fi
-@z
-@x in file CSC.MF
- ligtable "f": "v": "w": "a" kern kkk#,
-@y
- ligtable "f": "v": "w": "a" kern if serifs: kkk# else: kk#\\fi,
-@z
-
-7. dish serifs need to be more robust when dishing is very small.
-@x in file CMBASE.MF
- if y$<y$$: dish_out=bot y$; dish_in=dish_out+dish;
- else: dish_out=top y$; dish_in=dish_out-dish; fi
- erase fill\\(x@1,dish_out)..(x$,dish_in){right}..(x@@1,dish_out)--cycle;
-@y
- if y$<y$$: dish_out=bot y$; dish_in=dish_out+dish; let rev_=reverse;
- else: dish_out=top y$; dish_in=dish_out-dish; let rev_=relax; fi
- erase fill rev_
- ((x@1,dish_out)..(x$,dish_in){right}..(x@@1,dish_out)--cycle);
-@z
-
-8. more robustness in case thin_join is too big
-@x in file ROMANL.MF, program for "b"
-pos4(vair,90); pos5(curve,0);
-pos6(vair,-90); penpos7(x3l-x3r,-180);
-rt x3l=1/3[rt x2,edge]; y3=1/8[bar_height,x_height];
-@y
-pos4(vair,90); pos5(curve,0); pos6(vair,-90); penpos7(x3l-x3r,-180);
-rt x3l=max(rt x3l-(lft x3r-tiny.lft x2l),1/3[rt x2,edge]);
-y3=1/8[bar_height,x_height];
-@z
-@x ibid, program for "d"
-pos4(vair,90); pos5(curve,180);
-pos6(vair,270); penpos7(x3r-x3l,360);
-lft x3l=1/3[lft x2,edge]; y3=1/8[bar_height,x_height];
-@y
-pos4(vair,90); pos5(curve,180); pos6(vair,270); penpos7(x3r-x3l,360);
-lft x3l=min(lft x3l-(rt x3r-tiny.rt x2r),1/3[lft x2,edge]);
-y3=1/8[bar_height,x_height];
-@z
-@x ibid, program for variant "g"
-pos4(vair,90); pos5(curve,180);
-pos6(vair,270); penpos7(x3r-x3l,360);
-lft x3l=2/3[lft x2,edge]; y3=bar_height;
-@y
-pos4(vair,90); pos5(curve,180); pos6(vair,270); penpos7(x3r-x3l,360);
-lft x3l=min(lft x3l-(rt x3r-tiny.rt x2r),2/3[lft x2,edge]); y3=bar_height;
-@z
-@x ibid, program for "p"
-rt x3l=1/3[rt x2,edge]; y3=1/8[bar_height,x_height];
-@y
-rt x3l=max(rt x3l-(lft x3r-tiny.lft x2l), 1/3[rt x2,edge]);
-y3=1/8[bar_height,x_height];
-@z
-@x ibid, program for "q"
-lft x3l=2/3[lft x2,edge]; y3=bar_height;
-@y
-lft x3l=min(lft x3l-(rt x3r-tiny.rt x2r),2/3[lft x2,edge]); y3=bar_height;
-@z
-@x ibid, proram for "q"
-x6l=x4l-.2u; bot y6r=-oo;
-lft x7l=1/3[lft x2,edge]; y7=min(y3,y6+y4-y3+.6vair);
-@y
-x6l=x4l-.2u; bot y6r=-oo; y7=min(y3,y6+y4-y3+.6vair);
-lft x7l=min(lft x7l-(rt x7r-tiny.rt x2r),1/3[lft x2,edge]);
-@z
-
-9. More robust "c" and "e" and "C"
-@x in file ROMANL.MF, program for "c"
- (x,y4l)=whatever[z4r,z5l]; x4l:=x;
-@y
- (x,y4l)=whatever[z4r,z5l]; x4l:=min(x,x4l+.5u);
-@z
-@x ibid, program for "e"
- (x,y4l)=whatever[z4r,z5]; x4l:=x;
-@y
- (x,y4l)=whatever[z4r,z5]; x4l:=min(x,x4l+.5u);
-@z
-@x in file ROMSPL.MF, programs for "ae" and "oe"
- (x,y14l)=whatever[z14r,z15]; x14l:=x;
-@y
- (x,y14l)=whatever[z14r,z15]; x14l:=min(x,x14l+.5u);
-@z
-@x in file ROMANU.MF, programs for "C" and "G"
- (x2l',y2l)=whatever[z2r,z1l]; x2l:=x2l';
- (x4l',y4l)=whatever[z4r,z5l]; x4l:=x4l';
-@y
- (x2l',y2l)=whatever[z2r,z1l]; x2l:=min(x2l',x2l+.5u);
- (x4l',y4l)=whatever[z4r,z5l]; x4l:=min(x4l',x4l+.5u);
-@z
-
-10. More robust foot in "a"
-@x in file ROMANL.MF
- filldraw stroke z5'e---z10e...z11e{right}; % foot
-@y
- pos12(shaved_stem,0); x11=x12; top y12=slab+eps;
- filldraw z5'l---z10l...z11l{right}--z11r
- --z12r{left}...z10r+.75(z12-z11)---z5'r--cycle; % foot
-@z
-
-11. Barbs less sharp
-@x in file ROMANU.MF, programs for "C" and "G"
- x6=x1r; top y6=h+o; x1r-x1'=2cap_curve-fine; y1'=y1;
- path upper_arc; upper_arc=z1{x2-x1,10(y2-y1)}..z2{left};
- numeric t; t=xpart(upper_arc intersectiontimes (z6--z1'));
- filldraw z1r--z6--subpath(t,0) of upper_arc--cycle; % barb
-@y [actually "G" had something similar but not identical]
- pos6(.3[fine.breadth,cap_hair],0); x6r=x1r; top y6=h+o;
- x1r-x1'=2cap_curve-fine; y1'=y1;
- path upper_arc; upper_arc=z1{x2-x1,10(y2-y1)}..z2{left};
- numeric t; t=xpart(upper_arc intersectiontimes (z6l--z1'));
- filldraw z1r--z6r--z6l--subpath(t,0) of upper_arc--cycle; % barb
-@z
-@x ibid, program for "S"
- x10=x1l; top y10=top y2l; x9=x8r; bot y9=bot y7r;
- x1l-x1'=x8'-x8r=1.6cap_curve-fine; y1'=y1; y8'=y8;
- numeric t; t=xpart(upper_arc intersectiontimes(z10--z1'));
- filldraw z1l--z10--subpath(t,0) of upper_arc--cycle; % upper barb
- t:=xpart(lower_arc intersectiontimes(z9--z8'));
- filldraw z8r--z9--subpath(t,1) of lower_arc--cycle; % lower barb
-@y
- pos10(.3[fine.breadth,cap_hair],0); pos9(.3[fine.breadth,cap_hair],0);
- x10r=x1l; top y10=top y2l; x9l=x8r; bot y9=bot y7r;
- x1l-x1'=x8'-x8r=1.6cap_curve-fine; y1'=y1; y8'=y8;
- numeric t; t=xpart(upper_arc intersectiontimes(z10l--z1'));
- filldraw z1l--z10r--z10l--subpath(t,0) of upper_arc--cycle; % upper barb
- t:=xpart(lower_arc intersectiontimes(z9r--z8'));
- filldraw z8r--z9l--z9r--subpath(t,1) of lower_arc--cycle; % lower barb
-@z [the same change goes into file CSCSPU.MF, the program for two S's]
-@x in file ROMANL.MF, program for "s"
- x10=x1l; top y10=top y2l; x9=x8r; bot y9=bot y7r;
- x1l-x1'=x8'-x8r=1.6curve-fine; y1'=y1; y8'=y8;
- numeric t; t=xpart(upper_arc intersectiontimes(z10--z1'));
- filldraw z1l--z10--subpath(t,0) of upper_arc--cycle; % upper barb
- t:=xpart(lower_arc intersectiontimes(z9--z8'));
- filldraw z8r--z9--subpath(t,1) of lower_arc--cycle; % lower barb
-@y
- pos10(.3[fine.breadth,cap_hair],0); pos9(.3[fine.breadth,cap_hair],0);
- x10r=x1l; top y10=top y2l; x9l=x8r; bot y9=bot y7r;
- x1l-x1'=x8'-x8r=1.6cap_curve-fine; y1'=y1; y8'=y8;
- numeric t; t=xpart(upper_arc intersectiontimes(z10l--z1'));
- filldraw z1l--z10r--z10l--subpath(t,0) of upper_arc--cycle; % upper barb
- t:=xpart(lower_arc intersectiontimes(z9r--z8'));
- filldraw z8r--z9l--z9r--subpath(t,1) of lower_arc--cycle; % lower barb
-@z
-
-12. Italic ampersand more robust
-@x in file ITALP
- & pulled_arc.e(9,10)...{dir(theta+90)}z11e; % bowls, loop, and stem
-@y
- & {{interim superness:=more_super; pulled_arc.e(9,10)}}
- ..tension .9 and 1..{dir(theta+100)}z11e; % bowls, loop, and stem
-@z
-
-13. h_stroke more robust (esp in case of typewriter-style m)
-@x in file CMBASE
- pickup fine.nib; pos@0(thin_join,180);
-@y
- penpos@0(min(rt x$r-lft x$l,thin_join)-fine,180); pickup fine.nib;
-@z
-
-14. eliminate dishing in conflict with arm.
-Put a new subroutine into CMBASE.MF:
-def nodish_serif(suffix $,$$,@)(expr left_darkness,left_jut)
- (suffix @@)(expr right_darkness,right_jut) suffix modifier =
- serif($,$$,@,left_darkness,-left_jut) modifier;
- serif($,$$,@@,right_darkness,right_jut) modifier; enddef;
-
-Now use this instead of dish_serif in the following places:
-GREEKU: Gamma, upper serif
- Pi, both upper serifs (fix erroneous comments!)
-SYMBOL: Amalgamation, both lower serifs (fix erroneous comments!)
-ROMANU: B, both serifs
- D, both serifs
- E, both serifs
- F, upper serif
- L, lower serif
- P, upper serif
- R, upper serif
- T, upper bracketing
-ROMSPU: AE, upper and lower middle serifs
-
-15. Change #2 wasn't quite good enough!
-@x in CMBASE
- min_Vround:=max(fine.breadth,crisp.breadth,tiny.breadth);
-@y
- min_Vround:=max(fine.breadth,crisp.breadth,tiny.breadth);
- if min_Vround<vround min_Vround: min_Vround:=vround min_Vround; fi
- if flare<vround flare: flare:=vround flare; fi
-@z
-
-16. body_depth# is now called paren_depth#, since body_depth is
-computed differently. (This is a cosmetic change only; it affects
-files CMBASE, PUNCT, SYM, SYMBOL, and ROMMS.)
-
-17. more robust Sigma
-@x in GREEKU, page 9
-top y1=h; bot y2=h-slab; bot y4=0; x3l-x1l=4/11(w-2u); y3=.5h;
-@y
-top y1=h; bot y2=h-slab-eps; bot y4=0; x3l-x1l=4/11(w-2u); y3=.5h;
-@z
-@x in BIGOP, page 7
-top_arm_thickness=rule_thickness;
-@y
-top_arm_thickness=Vround rule_thickness;
-@z
-@x in BIGOP, page 7 (this change needed twice)
-top y1=0; bot y2=-top_arm_thickness; bot y4=-d; y3=-.5d;
-@y
-top y1=0; bot y2=-top_arm_thickness-eps; bot y4=-d; y3=-.5d;
-@z
-
-18. yet another refinement of change #2
-@x in CMBASE
- forsuffixes $=vair,bar,slab,cap_bar,cap_band,vair',vstem,cap_vstem:
-@y
- forsuffixes $=vair,bar,slab,cap_bar,cap_band,vair',vstem,cap_vstem,bold:
-@z
-
-19. slightly more robust `k'
-@x in ROMANL
-top y3=x_height; rt x3r=hround(r-letter_fit-.7u-right_jut);
-bot y6=0; rt x6r=hround(r-letter_fit-.3u-right_jut);
-@y
-top y3=x_height; rt x3r=hround(r-letter_fit-.7u-right_jut)+eps;
-bot y6=0; rt x6r=hround(r-letter_fit-.3u-right_jut)+eps;
-@z
-
-20. small parameter changes for consistency
-@x in CMBX6
-dish#:=.9/36pt#; % amount erased at top or bottom of serifs
-@y
-dish#:=.8/36pt#; % amount erased at top or bottom of serifs
-@z
-@x in CMBX5
-dish#:=.75/36pt#; % amount erased at top or bottom of serifs
-@y
-dish#:=.7/36pt#; % amount erased at top or bottom of serifs
-@z
-@x in CMSS9 and CMSSI9 [these two lines are not consecutive in the files!]
-notch_cut#:=23/36pt#; % maximum breadth above or below notches
-cap_notch_cut#:=29/36pt#; % max breadth above/below uppercase notches
-@y
-notch_cut#:=17/36pt#; % maximum breadth above or below notches
-cap_notch_cut#:=24/36pt#; % max breadth above/below uppercase notches
-@z
-@x in CMSS8 and CMSSI8 [these two lines are not consecutive in the files!]
-notch_cut#:=21/36pt#; % maximum breadth above or below notches
-cap_notch_cut#:=27/36pt#; % max breadth above/below uppercase notches
-@y
-notch_cut#:=16/36pt#; % maximum breadth above or below notches
-cap_notch_cut#:=22/36pt#; % max breadth above/below uppercase notches
-@z
-@x in CMTI9
-cap_hair#:=10/36pt#; % uppercase hairline breadth
-@y
-cap_hair#:=11/36pt#; % uppercase hairline breadth
-@z
-@x in CMTI8
-cap_hair#:=9.5/36pt#; % uppercase hairline breadth
-@y
-cap_hair#:=11/36pt#; % uppercase hairline breadth
-@z
-@x in CMTI7
-cap_hair#:=9/36pt#; % uppercase hairline breadth
-@y
-cap_hair#:=10.5/36pt#; % uppercase hairline breadth
-@z
-@x in CMTCSC10
-lower.cap_notch_cut#:=24pt#; % max breadth above/below uppercase notches
-@y
-lower.cap_notch_cut#:=24/36pt#; % max breadth above/below uppercase notches
-@z
-
-21. New parameter file CMFI10 was added; font_identifier is "CMFI".
-Also changed the name `cmit10' to `cmitt10'; font_identifier is "CMITT".
-
-22. Still more changes for robustness (based on resolution h120 x v108).
-@x in ROMAND and ITALD, "5"
-bot y5=vround(.53h-vair); top y6r=vround .61803h+o;
-@y
-bot y5=vround(.53h-vair); top y6r=max(vround .61803h+o,top y6r+y5+eps-y6l);
-@z
-@x in OLDDIG, "5"
-bot y5=vround(.53[-d,h]-vair); top y6r=(vround .61803[-d,h])+o;
-@y
-bot y5=vround(.53[-d,h]-vair);
-top y6r=max((vround .61803[-d,h])+o,top y6r+y5+eps-y6l);
-@z
-@x in ROMANU, "C"
- bot y1=vround max(.6h,x_height-.5vair); y5=good.y .95(h-y1);
-@y
- bot y1=min(vround max(.6h,x_height-.5vair),bot y2l-eps);
- y5=max(good.y .95(h-y1),y4l+eps);
-@z
-@x in ROMANU, "G"
- bot y1=vround max(.6h,x_height-.5vair);
-@y
- bot y1=min(vround max(.6h,x_height-.5vair),bot y2l-eps);
-@z
-@x in GREEKL page 6 and TSETSL page 8
-y1=.9h; top y2l=h+oo; top y8r=x_height+oo; y4=y8;
-@y
-top y2l=h+oo; y1=min(.9h,y2r-eps); top y8r=x_height+oo; y4=y8;
-@z
-@x in GREEKL page 16
-x6=x7=w-2u; x8=.5w+.5u; y6=-.3d; y8=-3/4d-oo; bot y7r=-d-oo;
-@y
-x6=x7=w-2u; x8=.5w+.5u; y6=-.3d; bot y7r=-d-oo; y8=max(-3/4d-oo,y7l);
-@z
-@x in ITALL page 12, ITALMS page 6, ITALSP page 4
-lft x5r=hround-.5u; x4=1/3(w-u);
-@y
-x4=1/3(w-u); lft x5r=min(hround-.5u,lft x5r+x4-x5l-eps);
-@z
-@x in ROMANL, "g"
-x11=x13=.5w; bot y13r=-d-oo-1; x14=w-x12; z10'l=z10l;
-@y
-x11=x13=max(.5w,x10+eps); bot y13r=-d-oo-1; x14=w-x12; z10'l=z10l;
-@z
-@x in ROMANL, "s"
- filldraw stroke z1e..tension.9..{left}z2e; % upper arc and terminal
- filldraw stroke z7e{left}..z8e; fi % lower arc and terminal
-@y
- filldraw stroke term.e(2,1,right,.9,4); % upper arc and terminal
- filldraw stroke term.e(7,8,left,1,4); fi % lower arc and terminal
-@z
-@x in ROMANL, "c"
- filldraw stroke pulled_super_arc.e(2,3)(.7superpull)
- & pulled_super_arc.e(3,4)(.5superpull)
- ..tension .9 and 1..z5e; fi % arc and lower terminal
-@y
- forsuffixes e=l,r: path p.e; p.e=z4e{right}..tension .9 and 1..z5e;
- if angle direction 1 of p.e>75:
- p.e:=z4e{right}..tension atleast.9 and 1..{dir 75}z5e; fi endfor
- filldraw stroke pulled_super_arc.e(2,3)(.7superpull)
- & pulled_super_arc.e(3,4)(.5superpull) & p.e; fi % arc and lower terminal
-@z
-@x in ROMSPL, page 5
-lft x8r=hround(stem_edge+.5u+1); x7=max(x8l+eps,.4[lft x8r,x6]);
-@y
-lft x8r=min(hround(stem_edge+.5u+1),lft x8r+x6r-2eps-x8l);
-x7=max(x8l+eps,.4[lft x8r,x6]);
-@z
-@x in ROMAND and OLDDIG, "2"
- lft x1r=hround .75u; bot y1l=vround .7h; y1r:=good.y y1r; x1l:=good.x x1l;
-@y
- lft x1r=hround .75u; bot y1l=vround .7h; y1r:=good.y y1r+eps; x1l:=good.x x1l;
-@z
-@x in SYMBOL, page 42 (Fraktur R)
-z=(z20{up}...{right}z21)intersectionpoint(z22l--z22l+(h,0) rotated theta);
-@y
-path p; p=z20{up}...(z21--(w,y21));
-z=p intersectionpoint(z22l--z22l+(h,0) rotated theta);
-@z
-
-23. Another consequence of change 2:
-"vround" should be "Vround" in the BIGDEL programs for extensible arrows
-(five times).
-Also five times in the BIGOP programs for summation, product, coproduct.
-
-24. Cosmetic change to bring CMBASE in line with PLAIN.
-@x in CMBASE.MF
-def pickup secondary q =
- if numeric q: currentpen:=pen_[q];
- pen_top:=pen_top_[q]; pen_bot:=pen_bot_[q];
- pen_lft:=pen_lft_[q]; pen_rt:=pen_rt_[q];
- currentpen_path:=pen_path_[q];
- if known breadth_[q]: currentbreadth:=breadth_[q]; fi
- else: currentpen:=q yscaled aspect_ratio;
- pen_top:=(ypart penoffset left of currentpen)_o_;
- pen_bot:=(ypart penoffset right of currentpen)_o_;
- pen_lft:=xpart penoffset down of currentpen;
- pen_rt:=xpart penoffset up of currentpen;
- path currentpen_path;
- fi enddef;
-@y
-def numeric_pickup_ primary q =
- currentpen:=pen_[q];
- pen_lft:=pen_lft_[q]; pen_rt:=pen_rt_[q];
- pen_top:=pen_top_[q]; pen_bot:=pen_bot_[q];
- currentpen_path:=pen_path_[q];
- if known breadth_[q]: currentbreadth:=breadth_[q]; fi enddef;
-@z
-
-25. false italic correction in lambda of texset fonts (Feb 25, 1986)
-@x in TEXSET
-mode_setup; font_setup;
-@y
-mode_setup; font_setup; mono_charic#:=0;
-@z
-@x ibid
-slant:=mono_charic#:=0; % the remaining characters will not be slanted
-@y
-slant:=0; % the remaining characters will not be slanted
-@z
-[now remove the occurrences of `charic:=0;' in TSETSL, as they are unnecessary]
-
-*** The above changes are incorporated into the published book,
-*** Computer Modern Typefaces; this is "Version 2" (released March 5, 1986).
- Changes subsequent to `Version 2' as published in C&T, Volume E:
-
-@x in GREEKU
-numeric shaved_stem; shaved_stem=hround .9[vair,.85cap_stem];
-@y
-numeric shaved_stem; shaved_stem=hround .9[vair,.85cap_stem];
-if shaved_stem<crisp.breadth: shaved_stem:=crisp.breadth; fi
-@z
-
-@x in CMSS9 [this affects the TFM file to a small extent!]
-fig_height#:=236/36pt#; % height of numerals
-@y
-fig_height#:=212/36pt#; % height of numerals
-@z
-
-@x in CMSSI9 [this affects the TFM file in ten hts and eleven italcorrs]
-fig_height#:=236/36pt#; % height of numerals
-@y
-fig_height#:=212/36pt#; % height of numerals
-@z
-
-@x in CMR17 [no change to TFM file]
-curve#:=41/36pt#; % lowercase curve breadth
-@y
-curve#:=40/36pt#; % lowercase curve breadth
-@z
-@x
-cap_stem#:=40/36pt#; % uppercase stem breadth
-cap_curve#:=48/36pt#; % uppercase curve breadth
-@y
-cap_stem#:=41/36pt#; % uppercase stem breadth
-cap_curve#:=47/36pt#; % uppercase curve breadth
-@z
-@x
-serif_drop#:=17/36pt#; % vertical drop of sloped serifs
-@y
-serif_drop#:=7/36pt#; % vertical drop of sloped serifs
-@z
-
-@x in ROMAND [this fixes the `disappearing hairline' in some lowres 8's]
- lower_side=hround(.5[hair,stem]+stem_corr);
-@y
- lower_side=hround(.5[hair,stem]+stem_corr);
- if lower_side>1.2upper_side: upper_side:=lower_side; fi
-@z
-% Note: the SAME change should also be made in files ITALD and OLDDIG
-
-@x in ITALL [this fixes italic ell especially at low resolutions]
-top y1=h; x1=x2; filldraw stroke z1e--z2e; % stem
-@y
-top y1=h; x1=x2; filldraw stroke z1e--z2'e; % stem
-@z
-
-@x in SYM, the plus-or-minus character
-x1=x2=.5w; lft x3=lft=x5=hround u-eps; x4=x6=w-x3;
-@y
-x1=x2=.5w; lft x3=lft x5=hround u-eps; x4=x6=w-x3;
-@z actually the code worked but it was "infelicitous"
-
-@x in SYMBOL, the minus-or-plus character
-x1=x2=.5w; lft x3=lft=x5=hround u-eps; x4=x6=w-x3;
-@y
-x1=x2=.5w; lft x3=lft x5=hround u-eps; x4=x6=w-x3;
-@z actually the code worked but it was "infelicitous"
-
-@x in ROMANU, letter J [fixes a bug if dish=0 and crisp<tiny and serifs]
- bulb(3,4,5); % bulb
-@y
- pickup tiny.nib; bulb(3,4,5); % bulb
-@z
-
-@x in ROMANL, letter w [makes notch_cut more useful]
- else: fill diag_end(6r,5r,1,1,5l,6l)--.5[z5l,z6l]
- --.5[z5r,z6r]--cycle;% middle stem
-@y
- else: fill diag_end(6r,5r,1,1,5l,6l)--.9[z5l,z6l]
- ..{z5-z6}.1[z5r,z6r]--cycle; % middle stem
-@z the same change applies also to letter W in ROMANU
-
-@x in CMBASE, makes lowres types (especially TT) look better
- define_blacker_pixels(notch_cut,cap_notch_cut);
-@y
- define_blacker_pixels(notch_cut,cap_notch_cut);
- forsuffixes $=notch_cut,cap_notch_cut: if $<3: $:=3; fi endfor
-@z
-
-@x in BIGOP, the \displaystyle coproduct sign
-lft x11=hround u; x1l-x11=x2l-x12=x22-x2r=hround cap_jut;
-@y
-lft x11=hround u; x1l-x11=x2l-x12=x22-x2r=hround 1.6cap_jut;
-@z
-
-@x in ROMANL, the letter m
-lft x1l=hround(2.5u-.5stem); x1l=x1'l=x2l=x2'l;
-lft x3l=hround(.5w-.5stem); x5-x3=x3-x1;
-if not monospace: r:=hround(x5+x1)-l; fi % change width for better fit
-@y
-lft x1l=hround(2.5u-.5stem); x1l=x1'l=x2l=x2'l; % stem, sic
-lft x3l=hround(.5w-.5mfudged.stem); x5-x3=x3-x1;
-if not monospace: r:=hround(x5+x1)+r-w; fi % change width for better fit
-@z
-
-@x a new routine for CMBASE, following change_width
-@y
-def center_on(expr x) = if not monospace: % change width for symmetric fit
- r:=r+2x-w; w:=2x; fi enddef;
-@z
-@x in SYMBOL, the elementary division operator
-x3-.5dot_size=hround(.5w-.5dot_size); w:=r:=2x3;
-@y
-x3-.5dot_size=hround(.5w-.5dot_size); center_on(x3);
-@z
-Similarly, whenever the construction "w:=r:=2x*" appears, change it to
-"center_on(x*)". This happens in the programs for elementary division operator
-(as noted above), large triangle, large inverted triangle, lattice top,
-lattice bottom, dagger mark, double dagger mark, club/diamond/heart/spade suit
-(all in SYMBOL), plus the diamond operator and universal quantifier in SYM.
-The following additional change needs to be made in the programs
-for lattice top and lattice bottom:
-@x
-x1=x2=good.x .5w; center_on(x1); lft x3=hround u; x4=r-x3;
-@y
-x1=x2=good.x .5w; center_on(x1); lft x3=hround u; x4=w-x3;
-@z
-
-@x in SYMBOL, at end of zero-width slash
-labels(1,2); zero_width; endchar;
-@y
-labels(5,6); zero_width; endchar;
-@z
-
-@x in ROMANU, the letter Q (this change simply labels point 8 on proofs)
-math_fit(-.3cap_height#*slant-.5u#,ic#); penlabels(1,2,3,4,5,6,7); endchar;
-@y
-math_fit(-.3cap_height#*slant-.5u#,ic#);
-penlabels(1,2,3,4,5,6,7,8); endchar;
-@z
-
-@x in ROMANL, the letter i (this change by Jonathan Kew makes the dot rounder)
-if serifs: x3r=max(x1r,x1+.5(dot_diam-tiny)-.2jut) else: x3=x1-.5 fi;
-@y
-if serifs: x3r=max(x1r,hround(x1+.5dot_diam-.2jut)-.5tiny)
-else: x3=x1-.5 fi;
-@z
-
------------Improvements made in January 1992
-[No change to TFM files]
-@x in cmbase (improve lowres as suggested by John Hobby)
-def normal_adjust_fit(expr left_adjustment,right_adjustment) =
- l:=-hround(left_adjustment*hppp)-letter_fit;
- interim xoffset:=-l;
- charwd:=charwd+2letter_fit#+left_adjustment+right_adjustment;
- r:=l+hround(charwd*hppp)-shrink_fit;
- w:=r-hround(right_adjustment*hppp)-letter_fit;
- enddef;
-
-def mono_adjust_fit(expr left_adjustment,right_adjustment) =
- numeric expansion_factor;
- mono_charwd#=2letter_fit#
- +expansion_factor*(charwd+left_adjustment+right_adjustment);
- forsuffixes $=u,jut,cap_jut,beak_jut,apex_corr:
- $:=$.#*expansion_factor*hppp; endfor
- l:=-hround(left_adjustment*expansion_factor*hppp)-letter_fit;
- interim xoffset:=-l;
- r:=l+mono_charwd-shrink_fit;
- w:=r-hround(right_adjustment*expansion_factor*hppp)-letter_fit;
- charwd:=mono_charwd#; charic:=mono_charic#;
- enddef;
-@y
-def do_expansion(expr expansion_factor) =
- forsuffixes $=u,jut,cap_jut,beak_jut,apex_corr:
- $:=$.#*expansion_factor*hppp; endfor
-enddef;
-
-def normal_adjust_fit(expr left_adjustment,right_adjustment) =
- numeric charwd_in; charwd_in=charwd;
- l:=-hround(left_adjustment*hppp)-letter_fit;
- interim xoffset:=-l;
- charwd:=charwd+2letter_fit#+left_adjustment+right_adjustment;
- r:=l+hround(charwd*hppp)-shrink_fit;
- w:=r-hround(right_adjustment*hppp)-letter_fit;
- do_expansion(w/(charwd_in*hppp));
- enddef;
-
-def mono_adjust_fit(expr left_adjustment,right_adjustment) =
- numeric charwd_in; charwd_in=charwd;
- numeric expansion_factor;
- mono_charwd#=2letter_fit#
- +expansion_factor*(charwd+left_adjustment+right_adjustment);
- l:=-hround(left_adjustment*expansion_factor*hppp)-letter_fit;
- interim xoffset:=-l;
- r:=l+mono_charwd-shrink_fit;
- w:=r-hround(right_adjustment*expansion_factor*hppp)-letter_fit;
- charwd:=mono_charwd#; charic:=mono_charic#;
- do_expansion(w/(charwd_in*hppp));
- enddef;
-@z
-@x in SYM, Downward arrow
-pos3(bar,90); pos4(bar,90);
-lft x1l=hround(.5w-.5rule_thickness); y1+.5rule_thickness=h;
-x0=x1=x2; bot y0=-d; x0-x3=x4-x0=3u+eps;
-y3=y4=y0+.24asc_height+eps;
-pos5(bar,angle(z4-z0)); z5l=z0;
-pos6(bar,angle(z3-z0)); z6l=z0;
-z9=.381966[.5[z3,z4],z0];
-@y (make arrowheads heavier, as suggested by Zapf)
-pos3(rule_thickness,90); pos4(rule_thickness,90);
-lft x1l=hround(.5w-.5rule_thickness); y1+.5rule_thickness=h;
-x0=x1=x2; bot y0=-d; x0-x3=x4-x0=if monospace:3u else:4u fi+eps;
-y3=y4=y0+if monospace:.24 else:.36 fi asc_height+eps;
-pos5(rule_thickness,angle(z4-z0)); z5l=z0;
-pos6(rule_thickness,angle(z3-z0)); z6l=z0;
-z9=.2[.5[z3,z4],z0];
-@z
-@x in SYM, Upward arrow
-pos3(bar,90); pos4(bar,90);
-lft x1l=hround(.5w-.5rule_thickness); y1-.5rule_thickness=-d;
-x0=x1=x2; top y0=h; x0-x3=x4-x0=3u+eps;
-y3=y4=y0-.24asc_height-eps;
-pos5(bar,angle(z4-z0)); z5l=z0;
-pos6(bar,angle(z3-z0)); z6l=z0;
-z9=.381966[.5[z3,z4],z0];
-@y
-pos3(rule_thickness,90); pos4(rule_thickness,90);
-lft x1l=hround(.5w-.5rule_thickness); y1-.5rule_thickness=-d;
-x0=x1=x2; top y0=h; x0-x3=x4-x0=if monospace:3u else:4u fi+eps;
-y3=y4=y0-if monospace:.24 else:.36 fi asc_height-eps;
-pos5(rule_thickness,angle(z4-z0)); z5l=z0;
-pos6(rule_thickness,angle(z3-z0)); z6l=z0;
-z9=.2[.5[z3,z4],z0];
-@z
-@x in SYM, Leftward arrow
-pos1(rule_thickness,90); pos2(rule_thickness,90); pos3(bar,0); pos4(bar,0);
-y0=y1=y2=math_axis; x1+.5rule_thickness=hround(w-u); lft x0=hround u;
-y3-y0=y0-y4=.24asc_height+eps; x3=x4=x0+3u+eps;
-pos5(bar,angle(z4-z0)); z5l=z0; pos6(bar,angle(z3-z0)); z6l=z0;
-z9=.381966[.5[z3,z4],z0];
-@y
-pos1(rule_thickness,90); pos2(rule_thickness,90);
-pos3(rule_thickness,0); pos4(rule_thickness,0);
-y0=y1=y2=math_axis; x1+.5rule_thickness=hround(w-u); lft x0=hround u;
-y3-y0=y0-y4=if monospace:.24 else:.36 fi asc_height+eps;
-x3=x4=x0+if monospace:3u else:4u fi+eps;
-pos5(rule_thickness,angle(z4-z0)); z5l=z0;
-pos6(rule_thickness,angle(z3-z0)); z6l=z0;
-z9=.2[.5[z3,z4],z0];
-@z
-@x in SYM, Rightward arrow
-pos1(rule_thickness,90); pos2(rule_thickness,90); pos3(bar,0); pos4(bar,0);
-y0=y1=y2=math_axis; x1-.5rule_thickness=hround u; rt x0=hround(w-u);
-y3-y0=y0-y4=.24asc_height+eps; x3=x4=x0-4u-eps;
-pos5(bar,angle(z4-z0)); z5l=z0; pos6(bar,angle(z3-z0)); z6l=z0;
-z9=.381966[.5[z3,z4],z0];
-@y
-pos1(rule_thickness,90); pos2(rule_thickness,90);
-pos3(rule_thickness,0); pos4(rule_thickness,0);
-y0=y1=y2=math_axis; x1-.5rule_thickness=hround u; rt x0=hround(w-u);
-y3-y0=y0-y4=if monospace:.24 else:.36 fi asc_height+eps;
-x3=x4=x0-if monospace:3u else:4u fi-eps;
-pos5(rule_thickness,angle(z4-z0)); z5l=z0;
-pos6(rule_thickness,angle(z3-z0)); z6l=z0;
-z9=.2[.5[z3,z4],z0];
-@z
-@x in SYM, Left-and-right arrow
-pos1(rule_thickness,90); pos2(rule_thickness,90); pos3(bar,0); pos4(bar,0);
-y0=y1=y2=math_axis if monospace:+vround.3asc_height fi; lft x0=hround u;
-if monospace: x1+.5rule_thickness=hround(w-u) else: x1=.5w fi;
-y3-y0=y0-y4=.24asc_height+eps; x3=x4=x0+3u+eps;
-pos5(bar,angle(z4-z0)); z5l=z0; pos6(bar,angle(z3-z0)); z6l=z0;
-z9=.381966[.5[z3,z4],z0];
-@y
-pos1(rule_thickness,90); pos2(rule_thickness,90);
-pos3(rule_thickness,0); pos4(rule_thickness,0);
-y0=y1=y2=math_axis if monospace:+vround.3asc_height fi; lft x0=hround u;
-if monospace: x1+.5rule_thickness=hround(w-u) else: x1=.5w fi;
-y3-y0=y0-y4=if monospace:.24 else:.36 fi asc_height+eps;
-x3=x4=x0+if monospace:3u else:4u fi+eps;
-pos5(rule_thickness,angle(z4-z0)); z5l=z0;
-pos6(rule_thickness,angle(z3-z0)); z6l=z0;
-z9=.2[.5[z3,z4],z0];
-@z
-@x ibid
-pos11(rule_thickness,90); pos12(rule_thickness,90); pos13(bar,0); pos14(bar,0);
-y10=y11=y12=math_axis if monospace:-vround.3asc_height fi;
-rt x10=hround(w-u);
-if monospace: x11-.5rule_thickness=hround u else: x11=.5w fi;
-y13-y10=y10-y14=.24asc_height+eps; x13=x14=x10-3u-eps;
-pos15(bar,angle(z14-z10)); z15l=z10; pos16(bar,angle(z13-z10)); z16l=z10;
-z19=.381966[.5[z13,z14],z10];
-@y
-pos11(rule_thickness,90); pos12(rule_thickness,90);
-pos13(rule_thickness,0); pos14(rule_thickness,0);
-y10=y11=y12=math_axis if monospace:-vround.3asc_height fi;
-rt x10=hround(w-u);
-if monospace: x11-.5rule_thickness=hround u else: x11=.5w fi;
-y13-y10=y10-y14=if monospace:.24 else:.36 fi asc_height+eps;
-x13=x14=x10-if monospace:3u else:4u fi-eps;
-pos15(rule_thickness,angle(z14-z10)); z15l=z10;
-pos16(rule_thickness,angle(z13-z10)); z16l=z10;
-z19=.2[.5[z13,z14],z10];
-@z
-@x in SYMBOL, Up-and-down arrow
-pos3(bar,90); pos4(bar,90);
-lft x1l=hround(.5w-.5rule_thickness); y1=.5[-d,h];
-x0=x1=x2; bot y0=-d-o; x0-x3=x4-x0=3u+eps;
-y3=y4=y0+.24asc_height+eps;
-pos5(bar,angle(z4-z0)); z5l=z0; pos6(bar,angle(z3-z0)); z6l=z0;
-z9=.381966[.5[z3,z4],z0];
-@y
-pos3(rule_thickness,90); pos4(rule_thickness,90);
-lft x1l=hround(.5w-.5rule_thickness); y1=.5[-d,h];
-x0=x1=x2; bot y0=-d-o; x0-x3=x4-x0=4u+eps;
-y3=y4=y0+.36asc_height+eps;
-pos5(rule_thickness,angle(z4-z0)); z5l=z0;
-pos6(rule_thickness,angle(z3-z0)); z6l=z0;
-z9=.2[.5[z3,z4],z0];
-@z
-@x ibid
-pos13(bar,90); pos14(bar,90);
-x10=x11=x12; top y10=h+o; x10-x13=x14-x10=3u+eps;
-y13=y14=y10-.36asc_height-eps;
-pos15(bar,angle(z14-z10)); z15l=z10;
-pos16(bar,angle(z13-z10)); z16l=z10;
-z19=.381966[.5[z13,z14],z10];
-@y
-pos13(rule_thickness,90); pos14(rule_thickness,90);
-x10=x11=x12; top y10=h+o; x10-x13=x14-x10=4u+eps;
-y13=y14=y10-.24asc_height-eps;
-pos15(rule_thickness,angle(z14-z10)); z15l=z10;
-pos16(rule_thickness,angle(z13-z10)); z16l=z10;
-z19=.2[.5[z13,z14],z10];
-@z
-@x in SYMBOL, Northeast arrow
-pos3(bar,theta); pos4(bar,theta);
-y3=y0; x4=x0; x0-x3=y0-y4=delta+eps;
-pos5(bar,-90); z5l=z0; pos6(bar,-180); z6l=z0;
-z9=.381966[.5[z3,z4],z0];
-@y
-pos3(rule_thickness,theta); pos4(rule_thickness,theta);
-z3-z0=(-4u,.36asc_height) rotated theta;
-z4-z0=(-4u,-.36asc_height) rotated theta;
-pos5(rule_thickness,-90); z5l=z0; pos6(rule_thickness,-180); z6l=z0;
-z9=.2[.5[z3,z4],z0];
-@z
-@x in SYMBOL, Southeast arrow
-pos3(bar,theta); pos4(bar,theta);
-x3=x0; y4=y0; y3-y0=x0-x4=delta+eps;
-pos5(bar,180); z5l=z0; pos6(bar,90); z6l=z0;
-z9=.381966[.5[z3,z4],z0];
-@y
-pos3(rule_thickness,theta); pos4(rule_thickness,theta);
-z3-z0=(-4u,.36asc_height) rotated theta;
-z4-z0=(-4u,-.36asc_height) rotated theta;
-pos5(rule_thickness,180); z5l=z0; pos6(rule_thickness,90); z6l=z0;
-z9=.2[.5[z3,z4],z0];
-@z
-@x in SYMBOL, Northwest arrow
-pos3(bar,-180+theta); pos4(bar,-180+theta);
-x3=x0; y4=y0; x4-x0=y0-y3=delta+eps;
-pos5(bar,0); z5l=z0; pos6(bar,-90); z6l=z0;
-z9=.381966[.5[z3,z4],z0];
-@y
-pos3(rule_thickness,-180+theta); pos4(rule_thickness,-180+theta);
-z4-z0=(4u,.36asc_height) rotated theta;
-z3-z0=(4u,-.36asc_height) rotated theta;
-pos5(rule_thickness,0); z5l=z0; pos6(rule_thickness,-90); z6l=z0;
-z9=.2[.5[z3,z4],z0];
-@z
-@x in SYMBOL, Southwest arrow
-pos3(bar,-180+theta); pos4(bar,-180+theta);
-y3=y0; x4=x0; x3-x0=y4-y0=delta+eps;
-pos5(bar,90); z5l=z0; pos6(bar,0); z6l=z0;
-z9=.381966[.5[z3,z4],z0];
-@y
-pos3(rule_thickness,-180+theta); pos4(rule_thickness,-180+theta);
-z4-z0=(4u,.36asc_height) rotated theta;
-z3-z0=(4u,-.36asc_height) rotated theta;
-pos5(rule_thickness,90); z5l=z0; pos6(rule_thickness,0); z6l=z0;
-z9=.2[.5[z3,z4],z0];
-@z
-@x in ROMMS, Leftward top half arrow
-pos1(rule_thickness,90); pos2(rule_thickness,90); pos3(bar,0); pos4(bar,0);
-y0=y1=y2=math_axis; x1+.5rule_thickness=hround(w-u); lft x0=hround u;
-y3-y0=y0-y4=.24asc_height+eps; x3=x4=x0+3u+eps;
-pos5(bar,angle(z4-z0)); z5l=z0; pos6(bar,angle(z3-z0)); z6l=z0;
-@y
-pos1(rule_thickness,90); pos2(rule_thickness,90);
-pos3(rule_thickness,0); pos4(rule_thickness,0);
-y0=y1=y2=math_axis; x1+.5rule_thickness=hround(w-u); lft x0=hround u;
-y3-y0=y0-y4=.36asc_height+eps; x3=x4=x0+4u+eps;
-pos5(rule_thickness,angle(z4-z0)); z5l=z0;
-pos6(rule_thickness,angle(z3-z0)); z6l=z0;
-@z
-@x in ROMMS, Leftward bottom half arrow
-pos1(rule_thickness,90); pos2(rule_thickness,90); pos3(bar,0); pos4(bar,0);
-y0=y1=y2=math_axis; x1+.5rule_thickness=hround(w-u); lft x0=hround u;
-y3-y0=y0-y4=.24asc_height+eps; x3=x4=x0+3u+eps;
-pos5(bar,angle(z4-z0)); z5l=z0; pos6(bar,angle(z3-z0)); z6l=z0;
-@y
-pos1(rule_thickness,90); pos2(rule_thickness,90);
-pos3(rule_thickness,0); pos4(rule_thickness,0);
-y0=y1=y2=math_axis; x1+.5rule_thickness=hround(w-u); lft x0=hround u;
-y3-y0=y0-y4=.36asc_height+eps; x3=x4=x0+4u+eps;
-pos5(rule_thickness,angle(z4-z0)); z5l=z0;
-pos6(rule_thickness,angle(z3-z0)); z6l=z0;
-@z
-@x in ROMMS, Rightward top half arrow
-pos1(rule_thickness,90); pos2(rule_thickness,90); pos3(bar,0); pos4(bar,0);
-y0=y1=y2=math_axis; x1-.5rule_thickness=hround u; rt x0=hround(w-u);
-y3-y0=y0-y4=.24asc_height+eps; x3=x4=x0-3u-eps;
-pos5(bar,angle(z4-z0)); z5l=z0; pos6(bar,angle(z3-z0)); z6l=z0;
-@y
-pos1(rule_thickness,90); pos2(rule_thickness,90);
-pos3(rule_thickness,0); pos4(rule_thickness,0);
-y0=y1=y2=math_axis; x1-.5rule_thickness=hround u; rt x0=hround(w-u);
-y3-y0=y0-y4=.36asc_height+eps; x3=x4=x0-4u-eps;
-pos5(rule_thickness,angle(z4-z0)); z5l=z0;
-pos6(rule_thickness,angle(z3-z0)); z6l=z0;
-@z
-@x in ROMMS, Rightward bottom half arrow
-pos1(rule_thickness,90); pos2(rule_thickness,90); pos3(bar,0); pos4(bar,0);
-y0=y1=y2=math_axis; x1-.5rule_thickness=hround u; rt x0=hround(w-u);
-y3-y0=y0-y4=.asc_height+eps; x3=x4=x0-3u-eps;
-pos5(bar,angle(z4-z0)); z5l=z0; pos6(bar,angle(z3-z0)); z6l=z0;
-@y
-pos1(rule_thickness,90); pos2(rule_thickness,90);
-pos3(rule_thickness,0); pos4(rule_thickness,0);
-y0=y1=y2=math_axis; x1-.5rule_thickness=hround u; rt x0=hround(w-u);
-y3-y0=y0-y4=.36asc_height+eps; x3=x4=x0-4u-eps;
-pos5(rule_thickness,angle(z4-z0)); z5l=z0;
-pos6(rule_thickness,angle(z3-z0)); z6l=z0;
-@z
-@x in CALU, Calligraphic F
-top y1=top y6=h; z2=.5[z3,z1]+bend;
-bot y3=-o; y4=.1h; y5=y2; y7=.9h;
-draw flex(z1,z2,z3) softjoin (z3...{x4-x3,5(y4-y3)}z4); % stem
-draw z1-flourish_change{up}...z1---z6...{down}z7; % upper bar
-@y
-top y1=top y6=h; z2=.5[z3,z1]+1.2bend;
-bot y3=-o; y4=.1h; y5=y2; y7=.9h;
-draw flex(z1,z2,z3) softjoin (z3...{x4-x3,5(y4-y3)}z4); % stem
-draw z1-flourish_change{up}...(z1-(u,0))---z6...{down}z7; % upper bar
-@z
-@x in CALU, Calligraphic H
-lft x1=lft x3=0; rt x4=rt x6=.8w; rt x9=w;
-top y1=top y4=h; bot y3=-o; bot y6=bot_flourish_line; y9=y6+.1h;
-z2=.6[z3,z1]+bend; z5=.4[z6,z4]-2bend;
-path p[]; p1=flex(z1,z2,z3); p2=flex(z4,z5,z6);
-p3=(-w,.55h)--(2w,.55h);
-lft z7=p3 intersectionpoint p1; rt z8=p3 intersectionpoint p2;
-draw (z1-flourish_change{up}....z1-(u,0)---z1) softjoin p1; % left stem
-@y
-lft x1=lft x3=.5u; rt x4=rt x6=.8w-.6u; rt x9=w;
-top y1=top y4=h; bot y3=-.06h; bot y6=bot_flourish_line; y9=y6+.1h;
-z2=.6[z3,z1]+bend; z5=.4[z6,z4]-bend;
-path p[]; p1=flex(z1,z2,z3); p2=flex(z4,z5,z6);
-p3=(-w,.45h)--(2w,.45h);
-rt z7+2bend=p3 intersectionpoint p1; rt z8=p3 intersectionpoint p2;
-draw (z1-flourish_change-bend{curl2}....z1-(u,0)---z1) softjoin p1; % left stem
-@z
-@x in CALU, Calligraphic I
-lft x0=0; x1=.9w; x2=x4=.5w; x5=.2w; x6=.75w; rt x7=w;
-@y
-lft x0=0; x1=.9w; x2=x4=.5w; x5=.2w; x6=.8w; rt x7=1.05w;
-@z
-@x in CALU, Calligraphic T
-x1=x3=.5w; lft x4=0; x5=w-x6=.25w; rt x7=w;
-x1=.47w; x3=.5w; lft x4=0; x5=w-x6=.25w; rt x7=1.05w;
-z2=.5[z3,z1]+bend;
-x1-x8=x9-x1=2u; y8=y9=y3;
-z0=1/3[z1,z6];
-draw z0{left}...z2{down}...{left}z8; % stem
-draw z8--z9; % foot
-draw z4{up}...z5{right}...z6{right}...{up}z7; % arms
-math_fit(.5u#-5/7h#*slant,-u#); labels(1,2,3,4,5,6,7,8,9); endchar;
-@y
-x1=.47w; x3=.5w; lft x4=0; x5=.25w; x6=.85w; rt x7=1.05w;
-top y1=h; bot y3=-.1h; y4=3/4h; top y5=top y6=h; top y7=1.05h;
-z2=.3[z3,z1]+bend;
-top y0=y1; x0=x2;
-z8=(2u,.2h);
-draw z0---z2...z3; % stem
-draw z4{curl 2}...z5{right}...z6{right}...{up}z7; % arms
-math_fit(.5u#-5/7h#*slant,-u#); labels(1,2,3,4,5,6,7); endchar;
-@z
-@x in GREEKL, lowercase delta
-pos1(hair,-180); pos2(vair,-90);
-numeric theta; theta=angle(18u,-h);
-pos3(stem,theta+90); pos4(stem,theta+90); pos5(1/4[hair,stem],20);
-pos6(vair,-90); pos7(curve,-180); pos8(vair,-270);
-rt x1l=hround(w-2u+.5hair); x2=.5w; x3r=3u; rt x5r=hround(w-u);
-x4=x6=x8=.5w+.5u; lft x7r=hround(1.5u-.5curve);
-top y2l=h+oo; y1=min(.9h,y2r-eps); top y8r=x_height+oo; y4=y8;
-z4-z3=whatever*(18u,-h); y5=y7=.5[y6,y8]; bot y6=-oo;
-filldraw stroke z1e{x2-x1,3(y2-y1)}...z2e{left}...z3e---z4e
- ....z5e{down}...pulled_arc.e(6,7) & pulled_arc.e(7,8); % hook and bowl
-math_fit(-.3x_height#*slant+.5curve#-u#,.7x_height#*slant-.5u#);
-penlabels(1,2,3,4,5,6,7,8); endchar;
-@y
-x0=-u; y0=1.1h;
-numeric light_flare; light_flare=2/3[vair,flare];
-x1=w-2u-.5light_flare; y1=h-.5light_flare;
-numeric theta; theta=angle (z1-z0);
-pos1(light_flare,theta-90); pos2(.2[vair,light_flare],-90); pos3(vair,theta);
-x2=x3+u; y2=h;
-x4=x6=.5w+.5u; top y8r=x_height+oo; z4=z8;
-pos6(vair,-90); pos7(stem,-180); pos8(vair,-270);
-pos4(stem,angle(z4-z0)+90); pos5(stem,30);
-z3=.5[.5[z1,z4],z0];
-y5+.1x_height=y7=.5[y6,y8]; bot y6=-oo;
-lft x7r=hround(1.4u-.5stem); rt x5r=hround(w-u);
-filldraw stroke z1e{z0-z1e}....z2e....z3e{(z0-z1)rotated 90}
- ...z4e{z4e-.8[z4,z0]}
- ....z5e{down}...pulled_arc.e(6,7) & pulled_arc.e(7,8); % hook and bowl
-filldraw z1r{z1r-z0}...z1l{z0-z1l}--cycle; % bulb
-math_fit(-.3x_height#*slant+.5curve#-u#,.7x_height#*slant-.5u#);
-penlabels(0,1,2,3,4,5,6,7,8); endchar;
-@z
-@x in TSETSL, lowercase delta for extended ASCII
-pos1(hair,-180); pos2(vair,-90);
-numeric theta; theta=angle(18u,-h);
-pos3(stem,theta+90); pos4(stem,theta+90); pos5(1/4[hair,stem],20);
-pos6(vair,-90); pos7(curve,-180); pos8(vair,-270);
-rt x1l=hround(w-2u+.5hair); x2=.5w; x3r=3u; rt x5r=hround(w-u);
-x4=x6=x8=.5w+.5u; lft x7r=hround(1.5u-.5curve);
-top y2l=h+oo; y1=min(.9h,y2r-eps); top y8r=x_height+oo; y4=y8;
-z4-z3=whatever*(18u,-h); y5=y7=.5[y6,y8]; bot y6=-oo;
-filldraw stroke z1e{x2-x1,3(y2-y1)}...z2e{left}...z3e---z4e
- ....z5e{down}...pulled_arc.e(6,7) & pulled_arc.e(7,8); % hook and bowl
-penlabels(1,2,3,4,5,6,7,8); endchar;
-@y this next line differs from GREEKL, but the other lines agree
-x0=-u; y0=1.05h;
-numeric light_flare; light_flare=2/3[vair,flare];
-x1=w-2u-.5light_flare; y1=h-.5light_flare;
-numeric theta; theta=angle (z1-z0);
-pos1(light_flare,theta-90); pos2(.2[vair,light_flare],-90); pos3(vair,theta);
-x2=x3+u; y2=h;
-x4=x6=.5w+.5u; top y8r=x_height+oo; z4=z8;
-pos6(vair,-90); pos7(stem,-180); pos8(vair,-270);
-pos4(stem,angle(z4-z0)+90); pos5(stem,30);
-z3=.5[.5[z1,z4],z0];
-y5+.1x_height=y7=.5[y6,y8]; bot y6=-oo;
-lft x7r=hround(1.4u-.5stem); rt x5r=hround(w-u);
-filldraw stroke z1e{z0-z1e}....z2e....z3e{(z0-z1)rotated 90}
- ...z4e{z4e-.8[z4,z0]}
- ....z5e{down}...pulled_arc.e(6,7) & pulled_arc.e(7,8); % hook and bowl
-filldraw z1r{z1r-z0}...z1l{z0-z1l}--cycle; % bulb
-penlabels(0,1,2,3,4,5,6,7,8); endchar;
-@z
-
------------ Changes made after the fourth printing (1993) of Volume E
-
-@x in CSCSPU, letter J [fixes a bug if dish=0 and crisp<tiny and serifs]
- bulb(3,4,5); % bulb
-@y
- pickup tiny.nib; bulb(3,4,5); % bulb
-@z
-
-@x in BIGDEL, two harmless bugs caught by Robert Hunt
-"Extensible vertical arrow--extension module";
-@y
-cmchar "Extensible vertical arrow--extension module";
-@z
-@x
-"Extensible double vertical arrow--extension module";
-@y
-cmchar "Extensible double vertical arrow--extension module";
-@z
-
-@x in GREEKU, letter Phi (hi-res glitch found by Robert Hunt)
-lft x1l=lft x2l=hround(.5w-.5cap_stem); top y1=h; bot y2=0;
-@y
-lft x1l=lft x2l=hround(.5w-.5shaved_stem); top y1=h; bot y2=0;
-@z
-@x in GREEKU, letter Psi similarly
-lft x1l=lft x2l=hround(.5w-.5cap_stem); top y1=h; bot y2=0;
-@y
-lft x1l=lft x2l=hround(.5w-.5shaved_stem); top y1=h; bot y2=0;
-@z
-
-@x in BIGOP, teststyle integral sign
-x5=.5[x4,x6]; x4-x6=1.2u; lft x5r=hround(.5w-.5stem);
-@y
-x5=.5[x4,x6]; x4-x6=1.2u; lft x5r=hround(.5w-.5curve);
-@z
-@x same, displaystyle integral sign
-x5=.5[x4,x6]; x4-x6=4.8u; lft x5r=hround(.5w-.5stem);
-@y
-x5=.5[x4,x6]; x4-x6=4.8u; lft x5r=hround(.5w-.5max_size);
-@z
-@x same, textstyle contour integral sign
-x5=.5[x4,x6]; x4-x6=1.2u; lft x5r=hround(.5w-.5stem);
-@y
-x5=.5[x4,x6]; x4-x6=1.2u; lft x5r=hround(.5w-.5curve);
-@z
-@x same, displaystyle contour integral sign
-x5=.5[x4,x6]; x4-x6=4.8u; lft x5r=hround(.5w-.5stem);
-@y
-x5=.5[x4,x6]; x4-x6=4.8u; lft x5r=hround(.5w-.5max_size);
-@z
-
-@x in ITALMS, the partial differential sign
-path p; p=pulled_super_arc.l(3,4)(pull);
-@y
-path p; {{interim superness:=more_super; p=pulled_super_arc.l(3,4)(pull)}};
-@z
-
-@x in SYMBOL, the elementary division operator
-beginarithchar(oct"004"); pickup rule.nib;
-x3-.5dot_size=hround(.5w-.5dot_size); center_on(x3);
-y3+.5dot_size=vround(math_axis+math_spread[.5x_height,.6x_height]+.5dot_size);
-@y note that pickup rule.nib leaves currentbreadth unchanged
-beginarithchar(oct"004"); pickup fine.nib; pickup rule.nib;
-numeric del; del=dot_size-currentbreadth; % currentbreadth=fine
-x3-.5del=good.x(.5w-.5del); center_on(x3);
-y3+.5del=good.y(math_axis+math_spread[.5x_height,.6x_height]+.5del);
-@z
-
-@x in CMBASE, compute_spread can force even spreads for better rounding
- spread:=ceiling(spread#*hppp)+eps; enddef;
-@y
- spread:=2ceiling(spread#*hppp/2)+eps; enddef;
-@z
-
-@x in CMBASE, better diag_ratio routine avoids overflow in hi-res chars
- numeric a_,b_; b_=b/y; a_=a*a-b_*b_;
- (a*(c++y*sqrt a_)-b_*c)/a_/y enddef;
-@y
- numeric a_,b_,c_; b_=b/y; c_=c/y; a_=a*a-b_*b_;
- (a*(c_++sqrt a_)-b_*c_)/a_ enddef;
-@z
-
-@x in ROMAND, numeral 3, allow hi-res cminch to run without overflow (MacKay)
-x4=1/3[x5,x3l]; z4=z5+whatever*(150u,h);
-@y
-x4=1/3[x5,x3l]; z4=z5+whatever*(15u,.1h);
-@z
-
-@x in ITALP, the Sterling sign (bug caught by Yannis Haralambous)
-lft x6r=hround u; x7=3u; x8=w-3.5u; rt x9r=hround(w-u);
-@y
-lft x6r=hround u; x7=3u; x8=w-3.5u; rt x9l=hround(w-u);
-@z
-
-@x in GREEKL, lowercase omega, I made minor changes for new edition of TAOCP:
-y1+.5hair=h; x1=x2+.75u; pos1(hair,angle(2(x1-x2),y1-y2)+90);
-@y
-y1+.5hair=h; x1=x2+.75u; pos1(hair+dw,angle(2(x1-x2),y1-y2)+90);
-@z
-@x
-x3=.5[x2,x4]; x7+.25u=.5[x6,x8]; rt x8r=hround(w-.5u);
-@y
-x3=.5[x2,x4]; x7-.25u=.5[x6,x8]; rt x8r=hround(w-.5u);
-@z
-
-@x in GREEKL, lowercase beta, I made minor changes for new edition of TAOCP:
-pos3(stem,0); pos4(vair,-90); pos5(hair,-180);
-pos6(vair,-270); pos7(curve,-360); pos8(vair,-450); pos9(hair,-540);
-x0=x1=x9; lft x0l=hround(1.5u-.5hair); x2=x4=x6=x8=.5w+.25u;
-rt x3r=hround(w-1.5u); rt x7r=hround(w-1.5u+.5curve); rt x5l=hround(x4-u);
-bot y0=-d; y1=top y6r=x_height; top y2r=h+oo; y3=.5[y2,y4];
-y5=.5[y4,y6]; top y6r-bot y4r=vstem+eps; bot y8=-oo; y7=y9=.5[y6,y8];
-@y (this change also is made in TSETSL)
-pos3(.8[hair,stem],0); pos4(vair,-90); pos5(hair,-180);
-pos6(vair,-270); pos7(stem,-360); pos8(vair,-450); pos9(hair,-540);
-x0=x1=x9; lft x0l=hround(1.5u-.5hair); x2=x4=x6=x8=.5w-.25u;
-rt x3r=hround(w-1.75u); rt x7r=hround(w-u); rt x5l=hround(x4-u);
-bot y0=-d; y1=top y6r=x_height; top y2r=h+oo; y3=.5[y2,y4];
-y5=.5[y4,y6]; top y6r-bot y4r=vstem+eps; bot y8=-oo; y7=y9=.55[y6,y8];
-@z
-
-@x in ROMANU, less overshoot on uppercase sans serif C (for Vol 2 of TAOCP)
- top y1r=vround .95h+o; top y2r=h+o; y3=.5h;
- bot y4r=-o; bot y5r=vround .08h-o; y5l:=good.y y5l; x5l:=good.x x5l;
-@y
- top y1r=vround .95h+oo; top y2r=h+oo; y3=.5h;
- bot y4r=-oo; bot y5r=vround .08h-oo; y5l:=good.y y5l; x5l:=good.x x5l;
-@z
-
-@x in ROMANU, likewise for G
- top y1r=vround .93h+o; top y2r=h+o; y3=.5h;
- bot y4r=-o; bot y5r=vround .07h-o;
-@y
- top y1r=vround .93h+oo; top y2r=h+oo; y3=.5h;
- bot y4r=-oo; bot y5r=vround .07h-oo;
-@z
-
-@x in SYMBOL, spade suit, a cosmetic change that doesn't affect any fonts:
-labels(1,2,3,5,6,10,11,12,13,14,15); endchar;
-@y
-labels(1,2,3,5,6,7,8,9,10,11,12,13,14,15); endchar;
-@z
-
-@x in CMBASE, sloped_serif.l never used $$ except rarely in letter p
- y@0=max(y@2l-bracket,y$$)-eps;
-@y and in letter p, it was wrong to do so! (but not in any normal font)
- y@0=y@2l-bracket-eps;
-@z
-@x sloped_serif.r never used $$ in any reasonable way at all
- y@0=min(y@2l+bracket,y$$)+eps;
-@y
- y@0=y@2l+bracket+eps;
-@z
-
-in ITALD, programs for 6 and 9: same change as above for partial derivative
-in OLDDIG, programs for 6 and 9: same change as above for partial derivative
-in ROMAND, programs for 6 and 9: same change as above for partial derivative
-in TSETSL, program for partial derivative: same change as above
-
-@x in ROMANL, slight change to cmss10 and cmssbx10 `g' improves meta-ness
-loop_top=Vround .77[vair,fudged.stem];
-@y
-loop_top=if serifs: Vround .77[vair,fudged.stem] else: vair fi;
-@z
-
-@x in CMBASE, recent change shouldn't clobber a_, b_, and c_ of plain.mf
- numeric a_,b_,c_; b_=b/y; c_=c/y; a_=a*a-b_*b_;
- (a*(c_++sqrt a_)-b_*c_)/a_ enddef;
-@y
- numeric aa_,bb_,cc_; bb_=b/y; cc_=c/y; aa_=a*a-bb_*bb_;
- (a*(cc_++sqrt aa_)-bb_*cc_)/aa_ enddef;
-@z
-
-@x in ITALMS, Arrow (vector) accent
-lft x1=hround .5u; x2=w-x1; y1=y2=good.x .7[x_height,asc_height];
-@y a correction of almost purely academic interest
-lft x1=hround .5u; x2=w-x1; y1=y2=good.y .7[x_height,asc_height];
-@z
-
-the following patches make the arrows more robust, but essentially unchanged
-@x in SYM, Downward arrow
- --z2r---z1r..z1l---z2l--subpath (t,0) of\\(z3r{z9-z3}..z5r)
-@y
- ---z1r..z1l---subpath (t,0) of\\(z3r{z9-z3}..z5r)
-@z
-@x in SYM, Upward arrow
- --z2r---z1r..z1l---z2l--subpath (t,0) of\\(z3l{z9-z3}..z5r)
-@y
- ---z1r..z1l---subpath (t,0) of\\(z3l{z9-z3}..z5r)
-@z
-@x in SYM, Leftward arrow
- --z2l---z1l..z1r---z2r--subpath (t,0) of\\(z3r{z9-z3}..z5r)
-@y
- ---z1l..z1r---subpath (t,0) of\\(z3r{z9-z3}..z5r)
-@z
-@x in SYM, Rightward arrow
- --z2l---z1l..z1r---z2r--subpath (t,0) of\\(z3l{z9-z3}..z5r)
-@y
- ---z1l..z1r---subpath (t,0) of\\(z3l{z9-z3}..z5r)
-@z
-@x in SYM, Left-and-right arrow
- --z2l---z1l..z1r---z2r--subpath (t,0) of\\(z3r{z9-z3}..z5r)
-@y
- ---z1l..z1r---subpath (t,0) of\\(z3r{z9-z3}..z5r)
-@z
-@x ibid
- --z12l---z11l..z11r---z12r--subpath (t,0) of\\(z13l{z19-z13}..z15r)
-@y
- ---z11l..z11r---subpath (t,0) of\\(z13l{z19-z13}..z15r)
-@z
-@x in SYMBOL, Up-and-down arrow
- --z2r---z1r..z1l---z2l--subpath (t,0) of\\(z3r{z9-z3}..z5r)
-@y
- ---z1r..z1l---subpath (t,0) of\\(z3r{z9-z3}..z5r)
-@z
-@x ibid
- --z12r---z11r..z11l---z12l--subpath (t,0) of\\(z13l{z19-z13}..z15r)
-@y
- ---z11r..z11l---subpath (t,0) of\\(z13l{z19-z13}..z15r)
-@z
-@x in SYMBOL, Northeast arrow
- --z2l---z1l..z1r---z2r--subpath (t,0) of\\(z3l{z9-z3}..z5r)
-@y
- ---z1l..z1r---subpath (t,0) of\\(z3l{z9-z3}..z5r)
-@z
-@x in SYMBOL, Southeast arrow
- --z2l---z1l..z1r---z2r
- --subpath (t,0) of\\(z3l{z9-z3}..z5r)
-@y
- ---z1l..z1r---subpath (t,0) of\\(z3l{z9-z3}..z5r)
-@z
-@x in SYMBOL, Northwest arrow
- --z2l---z1l..z1r---z2r--subpath (t,0) of\\(z3l{z9-z3}..z5r)
-@y
- ---z1l..z1r---subpath (t,0) of\\(z3l{z9-z3}..z5r)
-@z
-@x in SYMBOL, Southwest arrow
- --z2l---z1l..z1r---z2r
- --subpath (t,0) of\\(z3l{z9-z3}..z5r)
-@y
- ---z1l..z1r---subpath (t,0) of\\(z3l{z9-z3}..z5r)
-@z
-@x in ROMMS, Leftward top half arrow
-filldraw z0--(x0,y2l)---z1l..z1r---z2r
- ..subpath (t,0) of\\(z3r..{2(x0-x3),y0-y3}z5r)
-@y
-filldraw z0--(x0,y2l)--z1l{right}..{left}z1r
- --subpath (t,0) of\\(z3r..{2(x0-x3),y0-y3}z5r)
-@z
-@x in ROMMS, Leftward bottom half arrow
-filldraw z0{2(x4-x0),y4-y0}..z4l
- --subpath (0,t) of\\(z4r..{2(x0-x4),y0-y4}z6r)
-@y
- --z1l{right}..{left}z1r--(x0,y2r)--cycle; % arrowhead and stem
-@z
-@x in ROMMS, Rightward top half arrow
-filldraw z0--(x0,y2l)---z1l..z1r---z2r
- ..subpath (t,0) of\\(z3l..{2(x0-x3),y0-y3}z5r)
-@y
-filldraw z0--(x0,y2l)--z1l{left}..{right}z1r
- --subpath (t,0) of\\(z3l..{2(x0-x3),y0-y3}z5r)
-@z
-@x in ROMMS, Rightward bottom half arrow
- ..z2l---z1l..z1r---(x0,y2r)--cycle; % arrowhead and stem
-@y
- --z1l{left}..{right}z1r--(x0,y2r)--cycle; % arrowhead and stem
-@z
-@x in BIGDEL, Extensible vertical arrow--top
- --z2r---z1r--z1l---z2l--subpath (t,0) of\\(z3l{z9-z3}..z5r)
-@y
- --z1r--z1l--subpath (t,0) of\\(z3l{z9-z3}..z5r)
-@z
-@x in BIGDEL, Extensible vertical arrow--bottom
- --z2r---z1r--z1l---z2l--subpath (t,0) of\\(z3r{z9-z3}..z5r)
-@y
- --z1r--z1l--subpath (t,0) of\\(z3r{z9-z3}..z5r)
-@z
-
-@x in ROMLIG, the ligature fi
- x13=x11-.5; top y14r=min(2x_height,h+1); top y11=x_height;
-@y make the center of the dot consistent with ordinary i, in sans-serif fonts
- x13=x11-.5; top y14r=min(10/7x_height+.5bulb_diam,h)+1; top y11=x_height;
-@z
-@x in ROMLIG, the ligature ffi
- x23=x21-.5; top y24r=min(2x_height,h+1); top y21=x_height;
-@y same corrections as to fi
- x23=x21-.5; top y24r=min(10/7x_height+.5bulb_diam,h)+1; top y21=x_height;
-@z
-
-@x in SYMBOL, the circle operator
-lft x6=hround u; x2=w-x6; top y8=h; y2=math_axis;
-@y this correction makes it a circle even at small size, low resolution
-lft x6=hround u; x2=w-x6; top y8=h; y8-y4=x2-x6;
-@z
-@x in SYMBOL, the bullet
-lft x6=hround u; x2=w-x6; top y8=h; y2=math_axis; circle_points;
-@y likewise
-lft x6=hround u; x2=w-x6; top y8=h; y8-y4=x2-x6; circle_points;
-@z
-
-@x in ROMAND, the numeral 2
- ..z3e{down}.. z4e---z5e--z6e; % stroke
-@y it's more robust to avoid --- next to -- (in case of tiny loops)
- ..z3e{down}..{z5e-z4e}z4e--z5e--z6e; % stroke
-@z
-@x in OLDDIG, oldstyle numeral 2
- ..z3e{down}.. z4e---z5e--z6e; % stroke
-@y likewise
- ..z3e{down}..{z5e-z4e}z4e--z5e--z6e; % stroke
-@z
-
-@x in CSC, after the second font_setup
-extra_endchar:=extra_endchar&"charcode:=charcode+code_offset";
-@y
-extra_endchar:=extra_endchar&"charcode:=charcode+code_offset;";
-@z
-
-@x in ACCENT, in program for Breve
-numeric mid_thickness; mid_thickness=vround 1/3[vair,stem];
-@y
-numeric mid_thickness; mid_thickness=Vround 1/3[vair,stem];
-@z
-
-@x in CMBASE, a more robust arm routine fixes the 7 in cmbx5,6,7,8
- filldraw z$$l{z@1-z$$l}...darkness[z@1,.5[z@2,z$$l] ]...z@2
- ---z$l--z$r--z@0--z$$r--cycle; % arm and beak
-@y
- path p_; p_= z$$l{z@1-z$$l}...darkness[z@1,.5[z@2,z$$l] ]...z@2
- ---z$l--z$r--z@0--z$$r--cycle;
- if (y$$>y$) <> (ypart precontrol 1 of p_ > ypart postcontrol 1 of p_):
- p_:=z$$l{z@1-z$$l}...darkness[z@1,.5[z@2,z$$l] ]
- ---z$l--z$r--z@0--z$$r--cycle; fi
- filldraw p_; % arm and beak
-@z
-
-@x in CALU, I decided in July 2005 that I really wanted a less swashy F
-top y1=top y6=h; z2=.5[z3,z1]+1.2bend;
-bot y3=-o; y4=.1h; y5=y2; y7=.9h;
-draw flex(z1,z2,z3) softjoin (z3...{x4-x3,5(y4-y3)}z4); % stem
-draw z1-flourish_change{up}...(z1-(u,0))---z6...{down}z7; % upper bar
-@y
-top y1=top y6=h; z2=.5[z3,z1]+bend;
-bot y3=-o; y4=.1h; y5=y2; y7=.9h;
-draw flex(z1,z2,z3) softjoin (z3...{x4-x3,5(y4-y3)}z4); % stem
-draw z1-flourish_change+(0,.15asc_height){up}...{right}(z1-(2u,0))
- ---z6...{down}z7; % upper bar
-@z
-
-@x in SYMBOL, two points of Hardy's asymptotic equivalence sign were unlabeled
-labels(1,2,3,4); endchar;
-@y
-labels(1,2,3,4,5,6); endchar;
-@z
-
-@x in GREEKL, correct a tiny notch that can show up at hires (Charles Duan)
-filldraw z1l--z2l--z--z1r--cycle; % stem
-@y
-filldraw z1l--z2l...(x3,y2l)...z--z1r--cycle; % stem
-@z
-
-@x in GREEKL, make almost-invisible semantic corrections to beta
-x0=x1=x9; lft x0l=hround(1.5u-.5hair); x2=x4=x6=x8=.5w-.25u;
-@y
-x0=x1=x9; lft x0r=hround(1.5u-.5hair); x2=x4=x6=x8=.5w-.25u;
-@z
-@x
-y5=.5[y4,y6]; top y6r-bot y4r=vstem+eps; bot y8=-oo; y7=y9=.55[y6,y8];
-@y
-y5=.5[y4,y6]; top y6r-bot y4r=vstem+eps; bot y8r=-oo; y7=y9=.55[y6,y8];
-@z
-@x and also to delta
-y5+.1x_height=y7=.5[y6,y8]; bot y6=-oo;
-@y
-y5+.1x_height=y7=.5[y6,y8]; bot y6r=-oo;
-@z
-@x and also to phi
-top y1=x_height+oo; y2=y4=.5[y1,y3]; bot y3=-oo;
-@y
-top y1r=x_height+oo; y2=y4=.5[y1,y3]; bot y3r=-oo;
-@z
-
------------Here I draw the line with respect to further changes
-
-(I sincerely believe there won't be any more!)
-
-I absolutely guarantee that the TFM files will never change again.
-(Otherwise I would consider zeroing the depth of italic 7,
-which I admit is strange... we can live with it.)
diff --git a/Master/texmf-dist/doc/generic/knuth/errata/errata.eight.pdf b/Master/texmf-dist/doc/generic/knuth/errata/errata.eight.pdf
new file mode 100644
index 00000000000..c53fd591d68
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/errata/errata.eight.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/errata/errata.eleven.pdf b/Master/texmf-dist/doc/generic/knuth/errata/errata.eleven.pdf
new file mode 100644
index 00000000000..8e241e452d1
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/errata/errata.eleven.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/errata/errata.five.pdf b/Master/texmf-dist/doc/generic/knuth/errata/errata.five.pdf
new file mode 100644
index 00000000000..726a5a46b35
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/errata/errata.five.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/errata/errata.four.pdf b/Master/texmf-dist/doc/generic/knuth/errata/errata.four.pdf
new file mode 100644
index 00000000000..83ea64bbf04
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/errata/errata.four.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/errata/errata.nine.pdf b/Master/texmf-dist/doc/generic/knuth/errata/errata.nine.pdf
new file mode 100644
index 00000000000..7db022678e0
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/errata/errata.nine.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/errata/errata.one.pdf b/Master/texmf-dist/doc/generic/knuth/errata/errata.one.pdf
new file mode 100644
index 00000000000..d149cacad54
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/errata/errata.one.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/errata/errata.pdf b/Master/texmf-dist/doc/generic/knuth/errata/errata.pdf
index 1b815338734..c5f79810e29 100644
--- a/Master/texmf-dist/doc/generic/knuth/errata/errata.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/errata/errata.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/errata/errata.seven.pdf b/Master/texmf-dist/doc/generic/knuth/errata/errata.seven.pdf
new file mode 100644
index 00000000000..ab635db356d
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/errata/errata.seven.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/errata/errata.six.pdf b/Master/texmf-dist/doc/generic/knuth/errata/errata.six.pdf
new file mode 100644
index 00000000000..ee218fe024d
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/errata/errata.six.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/errata/errata.ten.pdf b/Master/texmf-dist/doc/generic/knuth/errata/errata.ten.pdf
new file mode 100644
index 00000000000..3c4d0ea3988
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/errata/errata.ten.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/errata/errata.three.pdf b/Master/texmf-dist/doc/generic/knuth/errata/errata.three.pdf
new file mode 100644
index 00000000000..85410281747
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/errata/errata.three.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/errata/errata.twelve.pdf b/Master/texmf-dist/doc/generic/knuth/errata/errata.twelve.pdf
new file mode 100644
index 00000000000..bc5db2dd9b8
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/errata/errata.twelve.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/errata/errata.two.pdf b/Master/texmf-dist/doc/generic/knuth/errata/errata.two.pdf
new file mode 100644
index 00000000000..1916f261bad
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/errata/errata.two.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/errata/errorlog.pdf b/Master/texmf-dist/doc/generic/knuth/errata/errorlog.pdf
index 9ca8e54aabc..c2ec05463ad 100644
--- a/Master/texmf-dist/doc/generic/knuth/errata/errorlog.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/errata/errorlog.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/errata/mf84.bug b/Master/texmf-dist/doc/generic/knuth/errata/mf84.bug
deleted file mode 100644
index c6349b896da..00000000000
--- a/Master/texmf-dist/doc/generic/knuth/errata/mf84.bug
+++ /dev/null
@@ -1,2443 +0,0 @@
-This file has been updated periodically ever since METAFONT84 was born.
-What you are about to read is "authentic source material" from the
-early days before the program converged. Module numbers on the first
-entries may bear little relation to those in Volume D.
-
-Entries are in chronological order; thus the most recent news appears
-at the bottom of the file.
-
--------------------------------------------------------------------------------
-
-(rough list of all bugs found in MF after it passed syntax check)
-Starting with Version -100.0: [Mar 27, first run, about 00:30]
-1. fix_date_and_time was badly patched in INIMF.
-2. cur_tok function forgot "cur_tok:=p" at the end; PASCAL doesn't catch that.
-3. "multiletter control sequences" msgs should say "symbolic tokens".
-Version -99.0: [still Mar 27, done while waiting for WEAVE/TeX output]
-4. do_statement should initialize cur_type:=vacuous.
-5. find_variable has misplaced p:=equiv(p).
-6. one-character primitives shouldn't decrease str_ptr.
-7. clear_symbol had "q" at end where I meant to say "p".
-8. help message for extra token flushing improved.
-9. "buffer[k]" should be "buffer[j]" for 1-character id_lookup.
-10. def_delims forgot to get_next afterwards.
-11. type_command at beginning of statement wasn't diverted.
-12. menu always came out after help message.
-13. forgot to return after getting num/str token from token list.
- Version -98.0: [March 28]
-14. scan_declared_variable flushes too much.
-15. ordered pairs: one level of indirection was forgotten.
-16. type declarations must add "unknown" bit.
-17. semicolon+ added to do_statement cases.
-18. base_ident should get max_str_ref.
-19. "internal[...]" missing in date for base_ident.
-20. do_binary(p,c) should be do_binary(p,d) after continue_path
-21. in scan_def after get_clear_symbol I need to get_next.
-22. get_next needed at end of scan_def.
-23. get_next needed at end of mode_command processing.
-24. randomseed missing error typo: `;' for `:='.
-25. print_nl("") at beginning of show.
-26. refcounts on macro calls were incremented twice.
-27. forgot to advance loc after getting num/str token from token list.
-28. "/" has the wrong command code.
-29. get_x_next needed after, e.g., "1/2" in scan_primary.
-30. take_fraction should be make_fraction in call of frac_mult.
-31. v:=dep_list(v) forgotten in dep+dep branch of add_or_subtract.
-32. q:=link(q) etc misplaced and omitted in p_plus_fq and p_plus_q.
-33. dep_finish recycled a dependency list twice.
-34. call of dep_finish should use null not cur_exp.
-35. decided that "3 3" shouldn't equal 9.
-[also put in new code for the addto command]
- Version -97.0: [March 29]
-36. forget to set q:=qq in scan_expression.
-37. first line of print_path: forgot print_ln.
-38. typo in set_controls: right_y should be left_y.
-39. toss_knot_list forgot that it has a circular list to toss.
-40. print_exp shows big nodes backwards.
-41. angle brackets didn't look good in print_exp; took them out.
-42. left_brace must be between min_tertiary and max_tertiary.
-43. prev_dep should point back to tail, not head, of previous list.
- (that error was in encapsulate and <Copy the big node>)
-44. nonlinear_eq should leave node p vacant, sometimes.
-45. conditional routine forgot that get_boolean starts with get_x_next.
-46. forgot get_x_next in processing of else.
-47. str_ref not initialized by make_string.
-48. param_start not initialized properly.
-49. "%EXPR" didn't look good in token list.
-50. "{loop}" not necessary in forever loops; there's already enough.
-51. macro name didn't come out right when tracing macros.
-52. macro parameters weren't shown when tracing macros.
-53. quote marks missing when displaying strings.
-54. parameter names on macro call trace should look nicer.
-55. statement beginning with bad token: error message needed.
-56. `->' desired in context lines of macro.
-57. forgot q:=loop_list_loc(s) in begin_iteration.
-[also put in new code for shipout]
- Version -96.0: [March 30]
-58. forgot loop_type(s):=null in begin_iteration.
-59. forgot value(p):=null after type(p):=type(pp) in find_variable.
-60. forgot to delete_pen_ref after filling a contour.
-61. check that it's a cycle before calling make_spec.
-62. "if tracing_stats>0" should be "if internal[tracing_stats]>0"!
-63. forgot get_next after showdependencies.
-64. forgot link(r):=p at end of dependency list addition.
-65. extra `get_x_next' in <Scan a direction...>.
-66. typos in last half of <Remove open types...>: mind the p's and q's.
-67. take_fraction should be make_fraction in simple case of two givens.
-68. in print_exp of unknown type, stop if v=null.
-69. showtoken forgot to stop; also should be consistent with TeX.
-70. "continue" label needed in error routine, after all.
-71. id_lookup should treat length-one identifiers by simpler method.
- (in particular, this allows it to find unprintable ones!)
-72. need psi[n+1]:=psi[1] in cyclic case of make_choices.
-73. tension/controls take primaries as arguments, not expressions.
-74. print_spec didn't initialize octant.
-75. print_spec: break lines into two, since they are quite long.
-76. smooth_moves not called in fill_spec.
-77. typo < for > in edge_prep.
-78. edge tracing misses half the corners, and forgot to set trace_y.
-79. edge_prep needs extra logic when rover=head.
-80. make_good should compute cur_d based on good values, not original values;
- but we sometimes need the other alternative too.
-81. valid_sum: the test was backwards.
-82. print_weight blunder: ho(q) should be ho(info(q)).
-83. forgot init_gf in shipout.
-84. typo in <Finish the GF file>: if total_chars<>1 then print("s").
-85. initializations of ww, prev_w, and m were forgotten in ship_out.
-86. typos in initialization of prev_m and gf_min_x.
-87. forgot to update prev_n in ship_out.
-88. relax becomes "expandable".
-89. internal[x]>1 should be internal[x]>unity!
-90. forgot to restore normal scanner_status in pass_text.
-91. (end occurred when if...) was inevitable.
-[also put in new code for openwindow, display]
- Version -95.0: [April 1]
-92. forgot to unscale the window numbers in that new code.
-93. had w<0 test instead of w<=0 in <Record a possible transition...>.
-94. prev_w:=w should be done in all cases of <Record a possible...>.
-95. forgot get_x_next after scanning `1/2'.
-96. in do_assignment, after recycle_value(p) I need to set type(p):=something.
-97. omit `.' after the equivalent in showtoken.
-98. in <Copy the big node p>, I said "until q=p"; I meant "until q=value(p)".
-99. print_macro_name said "info(link(a))"; meant "text(info(info(link(a))))".
-100. forgot get_x_next after macro_call in scan_primary.
-101. scan_primary installed dependent components badly (data structure error).
-102. new_structure failed in case of generic_subscript (data structure error).
-103. param_type case of print_cmd_mod had bad if/else nesting (language error).
-104. null_path forgot to return a value (language error).
-105. p_with_x_becoming_q had typos (q and f for x).
-106. <Copy the big node...> should end with cur_exp:=t, not r.
-107. subscripted definitions: out of sync; scan_primary loop needs revision.
-108. secondarydef went through scan_def instead of make_op_def.
-109. make_op_def forgot the final get_next.
-110. make_op_def also forgot to insert the general_macro preface.
-111. showvar shows too much of macro variables.
- Version -94.0: [April 4]
-112. single_dependency needs to take account of the scale factor.
-113. add_or_subtract starts out with wrong v value. [bug 31 was fixed wrong]
-114. print_exp needs a case for t=independent.
-115. also numeric_type, and case v=null of pair_type, transform_type.
-116. end_token_list thought identity_macro and insertions had ref counts.
-117. disp_var should display also in case of generic subscripts.
-118. find_var should put value(pp):=null when it sets type(pp):=numeric_type.
-119. yet another problem in <Copy the big...>: copy_dep_list(dep_list(q)).
-120. scan_primary should flush_node_list(q) before make_exp_copy(p).
-121. make_scaled arguments reversed in p_over_v.
-[also added code for new internals: smoothing, autorounding]
-[also added code for showstats]
- Version -90.0: [April 5]
-122. Should check range of variables when they become known.
-123. <Exclaim about...> should include begin...end (WEB language error).
-124. forever should be followed by a colon.
-125. dangling else problem in make_eq: "abc"="abc" considered false.
-126. showstats, showtoken should read the semicolon before stopping.
-127. print_variable_name balked at, e.g., xpart of a capsule.
- Version -89.0: [April 6]
-128. after &foo, shouldn't assume there's an input file present.
-129. forever forgot get_next.
-130. pair=path and path=pair should coerce the pair to be a path.
-131. similarly in the operand to `addto'.
-[added new code for cull command]
-[minor revision of internal quantities; e.g., labeling is out, fontmaking is in]
- Version -88.0: [April 7]
-132. "string" operator is renamed "str".
-133. min/max coordinates added to boc command.
-134. labeling_command removed; it will be implemented in macros.
-135. info(p) should be attr_loc(p) in flush_variable.
-136. make_spec didn't realize the need for xh and yh.
-137. gf_new_row parameters had sign reversed.
-138. the "numeric" case was left out of recycle_value.
-[added new code for special/numspecial]
- Version -87.0: [April 13]
-139. q:=qq should apply also after <Splice...>, in scan_expr.
-140. param_size: better defined than a constant.
-141. surprise: back_input fails when cur_cmd=expr_arg, as it changes limit.
-142. <Subdivide...second time wrt x'-y'> forgot to change right_type(r).
-143. show <path> shows the whole path.
-144. expr like 0..1 leads to <Determine the path join...> with q undefined.
-145. typos in <Decide...clockwise>, clobbered dx2 and used right_type(p) twice.
-146. need to adjust expr_arg when macro is inside a macro!
-147. expr_arg forbidden to be in a text argument.
-148. frozen_relax added to prevent premature termination.
-[I took out the code used for debugging the screen interface]
-[added "cycle", a unary operator taking path to boolean]
-[added the code for concatenation and for str and for xpart..yypart]
- Version -86.0: [April 25]
-149. not_scolded_yet was never set false after scolding.
-150. Missing "q:=s" at the end of <Make variable q known>.
-151. In @<Worry...@>, add get_next after back_error.
-152. New xpart routine didn't recycle other components of the big node.
-[added the "hard_times" case of multiplication]
-[added the complete set of boolean expressions]
-[added the eight transformations, applied to three kinds of expressions]
-[added the save command]
-[added the interim command]
-[added the let command]
-[added the pen operations]
-153. Incomplete help message on "Not a variable".
-154. forgot begin...end in the last section of materialize_pen.
-155. blunder <Insert a new line...>: length(p,s,q) should be length(s,q,r).
-156. <Construct the offset...>: forgot begin...end here too.
-157. "(newly created)" shd be " (newly created)".
-158. path_trans: forgot to unstash the capsule p.
-159. set_up_trans: transform_type should be transformed_by, in one place.
-160. <Install sines...>: had p instead of q, in several places.
-161. edges_trans: an edges variable isn't in a capsule.
- Version -85.0: [May 2]
-162. begingroup ... endgroup should be allowed as compound statement.
-163. pausing shouldn't clobber "showit". (WAITS version only)
-164. Improved help message for isolated expressions.
-165. Bad error recovery after "Not a variable" in showvar.
-166. Typo in clear_symbol: name_type(p) instead of name_type(q).
-167. "%" and ";" to be left out of file names being input.
-168. dep_finish used v for two purposes; wrong declared type.
-169. autorounding 2 suppresses correction when the derivative isn't critical.
-170. tab characters should be changed to spaces on input. (WAITS version)
-171. harmful goto: Forgot to |return| after path_trans and edge_trans.
-[added ord, hex, oct, length, char, decimal, and jobname]
- Version -80.0: [May 4]
-172. showvar still screwed up.
-173. don't clobber screen for prompt_input (WAITS only).
-174. length of non-cyclic path is one too high.
-175. <Evoke an error message...> evoked the wrong message.
-176. better error message needed on `Equation cannot be performed'.
-177. ">> " inserted before expression displays.
-178. <Finish linking...> should dup_offset also when n=0.
-179. pencircle was a factor of 2 too big.
-180. cosine of 180 should be -1 exactly.
-181. ord "" should be -1.
-182. shipout should allow expressions as well as variables.
-183. "mod outer_tag" needed in various tests on eq_type.
-184. merge_edges forgot to adjust for changes in m_offsets.
-185. typo, ww for w in print_pen.
-186. typo, "outer" for "errhelp" in print_cmd_mod (message case).
-[added "also"]
-[added "message", "errmessage", "errhelp"]
-[added "outer", "inner"]
-[added "readterminal", "readstring"]
- Version -79.0: [May 6]
-187. read_toks forgot to include the general_macro token.
-188. offset_prep should treat n=0 like n=1.
-189. cusp transitions (from change 169) must be suppressed in envelope case.
-190. <Record a line segment...> shouldn't change xp or yp.
-191. <Find the initial slope...> was used too late.
-192. <Find the index...> had a redundant test (a relic of old code).
-193. <Compute test coeff...> wastefully made the same fraction three times.
-194. doublepath <cycle> should split the cycle.
-195. `if k=0' in fin_offset_prep should have been `if k=1'.
-196. `done:' misplaced in <Make the envelope moves...>.
-197. also move[move_ptr] should be initialized to 1 there, not 0.
-198. skew is used with p=q in fill_envelope.
-199. it's no use tracing subdivision for offsets, since everything is skewed.
-200. in <Record a line...>, round_unscaled should be floor_unscaled.
-201. unskewing: wrong formula (x was .5 too large).
-202. elliptical pens: better correction for the case gamma<=abs(alpha).
-203. dual env_move was updated badly, in both <Transfer...> and <Record...>.
-204. dual env_move to move: subscripts were off by 1.
-205. <Insert...dually...> should set ww:=knil(link(h)), not link(h).
-[added ++]
- Version -70.0: [May 9]
-206. suppressed cusp rounding in envelope case too.
-207. `show' should use `>> ' when it shows an expression.
-208. streamlined the test for bad lambda and mu in |skew|.
-209. after linear_eq, must check if type(cur_exp)=known.
-210. print_spec surprise: contours might never travel toward the first octant!
-211. t0,t1,t2 sign was reversed in <Complete the offset splitting...>.
- Version -69.0: [May 10]
-212. "showvar" changed to "showvariable".
-213. typo: r for r_delim in <Scan a text parameter...>.
-214. "newinternal" feature added.
-215. <Record a line...dually...> needs to update envmove at end of loop.
-216. smooth_moves shouldn't affect the extreme points.
-217. floor(unity*(n-1)/n) is unity when n is large; need to be more careful.
-218. major improvements to rounding, based on new theory of (x+eps,y+eps^2).
-219. pen offsets made symmetrical about the origin.
-220. p:=half(p+q) overflow problem in take_fraction, take_scaled.
-221. cull_edges now updates the max/min values too.
-222. make_spec needs to be more bullet-proof to rounding errors; added `dest's.
-223. xmult/ymult/zmult changed to xscaled/yscaled/zscaled.
-224. elliptical pens improved by temporarily allowing zero-length lines.
-[added edge transposition algorithm]
- Version -67.0: [May 17]
-225. copy can encounter a vacuous expression, e.g. in a parameter.
-226. xy_swap_edges mustn't change w when inserting a large weight.
-227. in #222, had typo pp for r in <split ... second time ... x'-y'>.
-228. in #222, incorrectly assumed local max = global max of cubic.
- Version -66.0: [May 19]
-229. bad_binary(c,p) should have been bad_binary(p,c).
-230. enabled comparison of unknown strings.
-231. fixed ring_delete to avoid unexpected scolding.
-232. should store character width info even when proofing<0.
-[added all the TFM commands and output routines]
-[added the `substring' operation]
-[added `point', `precontrol', `postcontrol'; deleted `direction']
- Version -65.0: [May 24]
-233. Change error message `(t)point(u)' to `point(t)of(u)'.
-234. newinternal to allow a list of tokens.
-235. In <Feed...>, should check for overflow before begin_token_list.
-236. scan_def didn't allow for the case warning_info=null.
- Version -60.0: [May 25]
-237. increased param_size.
-238. added <boolean><relation><boolean>.
-239. <Remove dead cubics> stopped too early if the first cubic was dead.
-240. bad_unary, bad_binary should distinguish pair from unknown pair.
-241. yet another "m<env_move[move_ptr]" test needs to be inserted.
-242. newinternal names need to go in the dump file.
-243. delete_mac_ref(v) should be delete_mac_ref(value(p)) in recycle_value.
-244. constant in <Decide...clockwise> was scaled instead of fraction.
- Version -59.0: [May 27]
-245. break up initialize routine into two parts (cf init_prim in TeX)
- Version -58.0: [May 28]
-246. do_ship_out should scan_expression, not scan_primary.
-247. offset_prep might clobber node q, so we need to search for q again.
-248. pair "1" = true! (blunder in type_test)
-249. allow strings x in `def f(expr x)=def g=x enddef enddef'.
-250. allow exprs in text parameters, in sufficiently easy cases.
-251. check right delimiters in macro_call.
-252. "Bad window number" message gave unscaled value.
-253. turnaround feature improves automatic rounding slightly.
-254. primaries changed to expressions in window and cull commands.
-255. scan_expression should make (0,0){0,0} a path, not a future path.
-256. showvariable and showtoken to allow lists; all shows made consistent.
-257. new internal quantity "windingcheck".
-258. delete warning message about edges never used.
-259. vardef: group the righthand side.
-260. show commands stop once each.
-261. cur_type should be vacuous after equation or assignment on outer level.
- Version -57.0: [June 4]
-262. added xyzzy diagnostic about effect of autorounding.
-263. make_moves now puts xi_corr,eta_corr into halving.
-[otherwise "draw (0,0)..(9,-.00002)" and "draw (0,-.00002)..(9,0)" fail badly!]
- Version -56.0: [June 6]
-264. smooth_moves changed completely; now is LR symmetric, cleaner.
-265. changed "unknown" to "known".
-266. pair to path conversion now done on length, makepen, reverse, etc.
-267. cycle now defined on arguments of any type.
-268. (re 218) sign was flipped in ceiling correction of <insert downward...>.
-[added union, subpath, penoffset, directiontime, intersectiontimes]
-
-Note: the first two draw statements in PENS.mf show an interesting effect.
-With autorounding, the curves are noticeably better, esp the small one.
-But there are two "holes", because of tiny discrepancies that I believe
-are unavoidable.
-Added later: Actually these are avoided by the new smooth_moves, but
-certain others will not be.
- Version -50.0 [June 30]
-269. smoothing to be shut off at the retrograde transitions
-270. more care needed in the rootfinding part of find_direction_time.
-271. improved error recovery after "Isolated expression".
- Version -40.0 [July 3] --- the first version to be "complete"!
-272. trivial change in <Exit...if the derivative $B(x_1,x_2,x_3;t)$...>.
-273. check that halfwords are large enough to hold edge/weight data.
-274. `path reverse (0,1)' should be true.
-275. xy_swap_edges might empty the structure; then x_reflect will fail!
-276. fix_offset was being done too often, due to improper range test.
-277. parameters come out even when tracingonline=0.
-278. step-until wasted r and didn't check syntax carefully.
-279. <Scan a group...> had typo: `line' for `group_line'.
-280. "You can't dump in a group" error was impossible.
-281. need better ETC cutoff in showmacro.
-282. print_exp needs to handle independents, because it's used by disp_var.
-283. suppress `#### xpart %CAPSULEnnnn' printouts.
-[added code for everyjob; this version wasn't complete after all!]
- Version -30.0 [July 9]
-284. need better error/help after ` if s1=s2' when the strings are unknown.
-285. removed autorounding>2; it was leading to more glitches than it was worth.
-286. envelope filling of a cycle to be done by two calls of fill_envelope.
-287. "null" changed to "vacuous".
-288. cyclic path inserted in another path should retain its last arc.
-289. introduce several dozen "put_get" errors for improved recovery.
-290. suppress "with autorounding" when autorounding hasn't been set.
-291. {loop value} came out even when tracingonline=0.
-292. show commands should wake up the terminal before showing their output.
-293. forgot error message in `if true else'.
- Version -20.0 [July 14]
-294. need to catch pens that are too large.
-295. make_eq dassn't change lhs (because this clobbers the memory links later).
-296. string usage is reported too high by showstats.
-297. bilin1 and add_mult_dep can call p_plus_fq with type(q)=proto_dependent.
-298. <Transform a known big node> forgot to recycle pp.
-299. in change number 286, the weight of the two paths should be the same.
-300. print_ln sometimes changed to print_nl("") in order to avoid blank lines.
-301. xyzzy to be combined with tracingedges.
-302. good3 entries should be 1 and 2 (not 1 and 0), to give desired symmetry.
- Version -10.0 [July 17]
-303. had to add `new_if_limit' to `conditional'.
-304. `else' can be incomplete as well as `if' and `elseif'.
-305. new help "You can't redefine a parameter."
-306. print_edges should use cur_edges, because print_weight does.
-307. cull shouldn't round; it should use ordinary inequalities.
-308. obliterated variable left `0' token hanging in scan_primary.
-309. forgot recycle_value(p) in <Evoke...>.
-310. forgot to check improper culling amounts.
-311. `on' to be changed to `inwindow'.
-312. >=max_tfm_dimen should be simply >.
- Version -9.0 [July 19]
-313. max_tfm_dimen needs to be decreased by design_size div 2^21.
-314. merge test data reporting into the screen display routines.
-315. use @# in printout at time of macro expansion tracing.
-316. bad recovery after "Incomplete string" error.
-317. @ should be usable as a parameter.
-318. spacing bad on `missing of' and `too many parameters' errors messages.
-319. keep track of largest str_ptr and pool_ptr values; showstats on two lines.
- Version -8.0 [July 26] [introduced new test routines to study memory usage]
-320. make_pen doesn't recycle the knots
-321. flush_below often says free_node(2) on node of size 3.
-322. make_eq should recycle and free; do_equation shouldn't
-323. re #298 and #309: should also free the value nodes!
-324. the replacement text of a bad_var definition should be recycled.
-325. token lists left unrecycled in error recovery of addto, cull, display.
- Version -7.0 [July 27]
-326. showall to put "(see the transcript file)" after >> if not tracingonline.
-327. remove redundant code: hex in print_the_digs; second l=1 in idlookup.
-328. procedures never called: b_open_in; round_scaled.
-329. need to zero cur_mod after back_expr in <Put the left bracket...>.
-330. <Print the coefficient...> now catches also numbers that round to 1.0.
-331. known_pair logic was obsolete; now it is massively simpler.
-332. fix_check_sum now zeroes the negative bytes; this simplifies other code.
-333. show_dependencies not to show parts of capsules.
-334. forgot to set fix_needed:=false!
-335. move fix_needed from add_or_subtract to dep_finish.
-336. test fix_needed in bilin1 and add_mult_dep.
-337. after back_expr in <Scan a mediation...>, forgot to unstash p.
- Version 0.0 [July 28] [Hurray! The preliminary TRAP test is fully passed.]
-338. corrected blunder in definition of trans_spec type. (found by Karney)
-339. less extreme starting values of gf_min_x and its cousins.
-340. uninitialized left_curl was possible. (found by John Hobby)
-341. In <Reduce...straight line...>, need to test sign before the `div 3' ops.
-342. In pyth_add, remove `+2' when dividing by 4, to prevent overflow.
-343. "Not a variable" changed to "Not a suitable variable".
-344. known_pair forgot to reset cur_type.
-345. round and floor procedures need to work in the presence of huge arguments.
-346. major revision to allow independent variables to disappear silently:
-346a. delete null_path and <Declare the null value routines>.
-346b. delete the hard part of ring_delete, and delete <Scold...for using...>.
-346c. stash/unstash/flush_cur_exp routines to allow independent type.
-346d. print_exp to allow a ring that contains only capsules.
-346e. <Zero out...> becomes <Recycle an independent variable> (major new code).
-346f. stash_in needs code to handle the case cur_type=independent.
-346g. negation needs code to handle the case cur_type=independent.
-346h. take_part needs code to handle the case cur_type=independent.
-346i. do_binary needs code to handle either or both operands independent.
-346j. frac_mult needs code to handle the case cur_type=independent.
-346k. make_eq and try_eq too.
-346l. linear_eq needs to check if cur_exp=x and cur_type=independent.
-346m. linear_eq displays new dependency only when lhs is interesting.
-347. minor improvement for coding style/brevity: the "interesting" function.
-348. test `if t<independent' had been left out of print_exp (was dirty PASCAL).
-349. (begingroup save x;x+1000 endgroup,0) caused subtle bug during unsave.
-350. print_type(known) changed to "known numeric" for consistency.
-351. In <Change...to proto_dependent>, didn't watch for coefficients zeroed.
-352. check_mem now checks also the links in the dependency lists.
-353. null_pen initialization belongs in <Initialize tab...>, not <Set init...>.
-354. fix_dependencies has to worry about coefficients dropping to zero.
-355. add tracing to frac_mult.
-356. need cur_sym>0 at the time of end_read_terminal. (found by S Robinson)
- Version 0.1 [August 30]
-357. Don't complain about winding_number<=0 when doing a doublepath.
-358. Need to test for max_coef=0 in offset_prep.
-359. Cusp detection should allow for more rounding error.
-360. Major change to path syntax, allowing {dir}..{dir} path joins.
-360a. `Fragments' disappear; new_fragment becomes new_knot.
-360b. print_path has simpler conventions.
-360c. future_path type disappears.
-360d. left_brace renumbered and removed from scan_tertiary.
-360e. some scan_tertiary code moves to new subroutine scan_direction.
-360f. scan_expression has a bunch of new code.
-361. scan_expression shouldn't have returned after cycle_hit.
-362. abort_path, scrap_knot logic removed from scan_expression.
- Version 0.2 [September 12]
-363. new operator: makepath <pen primary>.
-364. define point/precontrol/postcontrol at endpoints and beyond. (JDH)
-365. union replaced by +; negation and subtraction allowed on edges.
-366. another new operator: totalweight <edges primary>. (JDH's idea)
-367. undelimited parameters may be preceded by an optional = or :=.
-368. base_area_length was wrong. (affects CH files)(found by Pavel)
-369. internal names to be allowable in suffixes.
-370. label not_found was misplaced in do_add_to. (found by PasMESA translator)
-371. progress report should be given at time of shipout.
-372. procedures make_choices, make_spec,fill_envelope split into shorter pieces.
-373. locals of cubic_intersection made global so that people could split it.
- Version 0.3 [September 27]
-374. allow <future pen> ::= <pen> <transform>
-375. equation that's off by .0001 shouldn't be called inconsistent.
-376. bug in skew: must compute x_coord(q) and y_coord(q) exactly.
-377. right/left/up/down to be assigned to octants 1/5/2/6; was 1/4/2/7.
-378. boundedness to be allowed with any tension, and one-sidedly.
-379. eliminate coordinate nodes in path lists by passing angles instead (JDH).
-380. known_pair to free cur_exp after error msgs that might showdependencies.
-381. scan_primary sometimes accessed num before it had a value (found by Pavel).
-382. invalid characters should cause error message (suggested by PMB).
- Version 0.4 [October 12]
-383. allow `0' in response to error prompts.
-384. put loop value on error context lines.
-385. change `ord' to `ASCII'.
-386. scantokens <string primary> to be permitted; readterminal goes away.
-387. expandafter <token> to be permitted.
-388. improved overflow conventions on make_fraction, make_scaled.
-389. variable=<value over 4096> should get its own error message.
-390. nice_pair first argument can be any integer.
-391. new feature, shortshow commands that don't pause.
-392. "harmless" bug in negate_edges, the sorted list can get out of sorts.
-393. ni too skimpy (15 instead of 63). (JDH)
-394. loop_ptr not initialized. (found by Paul Richards)
-395. bug in <Find the approximate type...>, q=null should goto done1. (Richards)
-396. empty_edges macro added for readability.
-397. x_reflect_edges might as well fix the offset as it goes.
-398. blunder: frozen_bad_vardef had the wrong eq_type.
-399. "name" changed to "tag".
-400. check_arith inserted after division of numeric tokens.
-401. stop_bit was not initialized in <Compile a ligature/kern...>.
-402. char 127 to be a string of length 1; slow_print added (therefore).
-403. pyth_sub added to the repertoire.
-404. minor change to calls on "confusion" in make_fraction, make_scaled. (JJW)
- Version 0.5 [November 9]
-405. 4095.999999 should be erroneous.
-406. length <pair> to give the absolute value; argd changed to "angle".
-407. get_next changed to get_x_next wherever possible.
-408. z1..z2{curl 0} should be equivalent to z1..{curl 0}z2.
-409. scantokens "" should be fast.
-410. allow undelimited suffix and text parameters.
-411. warningcheck to allow large variable values passed over silently.
-412. "edges" changed to "picture".
-413. "winding" changed to "turning".
-414. <If consecutive knots...> had typo, "p" for "q".
-415. elliptical pens should have axis symmetry.
-416. slow_add introduced to catch arithmetic overflow on addition.
-417. add a turningnumber primitive.
-418. no carriage return between ">>" and "Edge structure...".
-419. install new memory management routines (from TeX version 1.3).
-420. generalized cull command. (suggested by Bruce Leban)
-421. bad goto: `x..' reports that x is vacuous, loses value of x.
-422. shortshows replaced by an internal variable "showstopping".
-423. major change, capsule tokens: lots of code and restrictions gone! (JDH)
-424. substring(a,b), subpath(a,b) to reverse the result when a>b.
-425. new GF format: z goes away. (suggested by ALS)
-426. another GF mod: chardw replaced by chardx/chardy, which are scaled. (PMB)
-427. make `&' have the same precedence always (not different for strings).
-428. wrong error message for 2"s" (bug introduced in change 369).
-429. variable l in show_context has to be declared type integer.
-430. bug in chop_path when both limits are large.
- Version 0.6 [December 10]
-431. xoffset and yoffset to be added by shipout. [this affects GF comments]
-432. wake_up_terminal, not t_open_out, before "Ouch..." (Scott Robinson)
-433. undelimited suffix parameters to allow an optional delimiter, disallow =.
-434. showall... to be eliminated; tracingcapsules added.
-435. allow undelimited parameters after delimited ones.
-436. nullpen test in addto should test for any one-point pen.
-437. granularity parameter to affect autorounding (Bruce Leban)
-[this leads to major improvements suggested by JDH; lots of code changes!]
-[basically, make_spec is now responsible for autorounding; fill_spec just fills]
-438. node_size overflow problem must be prevented. (Paul Richards)
-439. allow unary + with a picture.
-440. nullpen should transform quickly to itself, if not shifted.
-441. print_edges should skip over null rows, if it doesn't already.
-442. open_base_file improved (following TeX's change number 302).
-443. output initialization improved (following TeX's change number 303).
-444. operators shouldn't fail because future pen isn't a pen. (JDH)
-445. intersection routine to quit in hard cases. (DRF)
-446. angle routine was off by epsilon on negative arguments. (Karney)
-447. octant assignment should look ahead further in ambiguous cases. (JDH)
-448. <Compute the incoming...> forgot that right_type(r)=endpoint could happen.
-449. turning_number calculated directly, not times 8.
-450. floor_scaled made more efficient by trading subtraction for multiplication.
-451. doublepath autorounding to compromise between east and west. (JDH)
-452. codes of picture_type and path_type interchanged, to simplify a "case".
- Version 0.7 [January 17, 1985]
-453. def to allow both := and =. (NB)
-454. "keeping" and "dropping" instead of "including" and "excluding". (HWT)
-455. (see the transcript...): why, when tracingonline>0?
-456. dead cubics need to be removed also before xy_round. (NB)
-457. [re 433] I said get_x_next twice; a blunder.
- Version 0.75 [January 23, 1985]
-458. Abbreviated boc command makes GF format more attractive for lowres. (GusF)
- Version 0.76 [February 2]
-459. known and unknown might as well both be primitive.
-460. ab_vs_cd(a-d,b,c-b,d) simplifies to ab_vs_cd(a,b,c,d). (JDH)
-461. (from change 435) <Absorb undelimited...> must use k, not n.
-462. (from change 458) max_new_row added, since 165 wasn't updated to 164.
- Version 0.77 [February 16]
-463. abbreviated version of tracingspecs is desired for turning number errors.
-464. improved octant number in pathological cases of quadrant_subdivide (JDH)
-465. xoffset,yoffset communicated to GF file when proofing>0.
-466. Poirot changed to Marple.
-467. reverse<cycle> starts the reversed path at the wrong time.
-468. Extra help given after `undefined coordinate' errors.
-469. Keep segment numbers from overflowing max_halfword. (JDH)
-470. Ditto for pen offset slope numbers.
-471. n_magic had min_halfword with wrong sign. (John Johnson)
- Version 0.80 [April 1]
-472. In errhelp, % means <return>, %% means %. (BPL)
-473. tracing of envelopes should give symbolic octant names.
-474. (-x mod y) should be ((-x) mod y) in good_val.
-475. crossingpoint could overflow on 32-bit machines. (BPL)
-476. Improvements to abbreviated format of number 463.
- Version 0.81 [April 4]
-477. `I hide(showdependencies)' in hint to become `I ???'.
-478. print_strange shouldn't wake up the terminal in scroll mode. (cf 463)
-479. flush_list procedure made a bit faster. (DRF)
-480. bounded velocities to be multiplied by .999 for safety.
-481. Detect error in declaration that tries to extend a vardef.
-482. print_strange puts turns in parentheses (cf 463).
-483. make_name_string shouldn't ever cause string space overflow.
-484. allow <picture primary> xscaled m yscaled n.
-485. checksum should consider values relative to designsize. (DRF)
-[I also increased max_strings to 2000.]
-
-[Note: Neenie found a case where missing pixels can occur, due to
-inconsistent rounding between left-to-right and right-to-left subdivision:
-pickup pencircle; draw
-(0,126)..controls (130.29451,126) and (288,126.00002)
- ..(288,36)..controls (288,143.99998) and (132.97438,144)
- ..(0,144)..controls (0,138) and (0,132)
- ..cycle;
-The "right" way to fix this would be to develop a make_spec routine for
-non-cycles, and to copy a reversed spec, so that double paths would be
-guaranteed self-inverse. However, my later experiments showed that
-autorounding wasn't nearly as useful as I had expected it to be, hence I
-decided not to waste time beefing up this routine; no satisfactory
-automatic approach to rounding occurs to me.]
- Version 0.90 [May 10]
-486. 180-degree turns to be clockwise for half of doublepath cycles.
-487. introduce fillin parameter.
-488. `numeric_type' moved before `known', so that print_exp works (Richards).
-489. numeric_type as unary op should include independent in its range (cf 346).
- Version 0.91 [May 13]
-490. show_token_list gets null_tally parameter.
-491. if bad>0, change the code as in TeX changes 315, 316.
-492. batchmode change as in TeX 317.
-493. "and double autorounding" to be traced, if appropriate.
-494. introduce tracingrestores.
- *`restoring a bad variable'?
-495. put decimal number into gf extension
-496. mediation put into scan_primary, so that round .5[a,b] works properly.
-497. cubic_intersection now has |tol| to compensate for rounding errors.
-498. find_direction_time needs to worry about degenerate case x3=y3=0.
-499. crossing_point(a,b,0) now yields fraction_one if a,b>0.
-500. diag_round shouldn't insist that b-a is even (see below).
-501. macro_call will show_macro with much larger limit.
-502. TFM file statistics are logged too.
-
-* Here's an example (found by Neenie) explaining bugfix 500:
-autorounding:=2; draw
-(7.03159,-9.31831)..controls (12.14732,-9.4386) and (17.4299,-6.82948)
- ..(21.60132,0)..controls (27.47417,9.61507) and (37.87402,15.58647)
- ..(43.74687,25.20154)..controls (51.16223,37.34201) and (57.31,50.171)
- ..(63.45776,63.00002) withpen pencircle;
-The missing pixels are due to the following curious circumstances: (1) the
-middle cubic splits into three, when subdividing into octants; (2) the reverse
-curve splits too but with slightly different rounding, off by 1; (3) the old
-diag_round routine, when it ensures that b-a is even, computes aa=a+1 on
-one side of the curve, but aa=a-1 on the other side, thus making the
-rounding "safe" on only one side. (Namely, on one side we have consecutive
-values
- b=1317666 a=1310720
- b=1329617 a=1310721
-and on the other side,
- b=-1329618 a=-1310720
- b=-1317667 a=-1310721.)
-
-* Here's an example (by JDH) showing the necessary of bugfix 497:
-path p[];
-p1 = (1,0)..controls (1,0.10493) and (0.98347,0.20921)
- ..(0.95105,0.30902)..controls (0.91862,0.40881) and (0.8707,0.50288)
- ..(0.80902,0.58778);
-p2 = (0,0)..controls (0.63403,0.20601) and (1.26807,0.41203)
- ..(1.9021,0.61804);
-show p1 intersectiontimes p2; % (-1,-1), without `tol'
-pickup pencircle;
-currenttransform := identity scaled 150;
-draw p1; draw p2;
-showit; % but they clearly intersect
- Version 0.95 [Aug 12]
-503. `Se' changed to `SSE', etc. (suggested by RFS)
-504. Inconsisting diagonal rounding was introduced in bugfix 500.
-
-[the following lines from @<Determine the before...@> in diag_round:
- if aa>bb then cc:=dd-half(aa-bb-1)@+else cc:=dd-half(aa-bb+1)
- if a>b then c:=d-half(a-b-1)@+else c:=d-half(a-b+1)
-were replaced respectively by:
- if right_type(p)>switch_x_and_y then cc:=dd-half(aa-bb+1)
- else cc:=dd-half(aa-bb-1)
- if right_type(p)>switch_x_and_y then c:=d-half(a-b-1)
- else c:=d-half(a-b+1)
-in order to make the rounding consistent on adjacent octants;
-the following command caused `this can't happen':
-fill (33,7)..controls (32.63094,5.70827) and (32.06163,3.716)
- ..(31.59488,3.36667)..controls (31.10509,3.00009) and (29.14824,3)
- ..(27.85318,3)..controls (27.85286,3) and (23.84952,3)
- ..(23.8492,3)..controls (23.73282,2) and (23.61646,1)
- ..(23.50008,0)..controls (26.66672,0) and (29.83336,0)
- ..(33,0)..controls (33.66667,2.33333) and (34.33333,4.66667)
- ..(35,7)..controls (34.33333,7) and (33.66667,7)
- ..cycle;]
- Version 0.96 [Aug 17]
-505. allow comparison of transforms. [test by trying t=t when t is new...]
-506. {restoring...} shouldn't get through when tracingonline=0.
-507. better error message needed on `interim alpha:=0', `interim 0:=0'.
-508. make_op_def should put parameters in the other order.
-509. <Worry about...> should say get_x_next, not get_next.
-510. unif_rand to allow negative x, save on error messages.
-511. tidy up chop_string when b<0 and/or a>l.
-512. randomseed is automatically logged.
-513. change 495 messed up if gf file couldn't be opened. (found by DRF)
-[In INIMF.CH, 3-character extensions now have 0--9 or A--Z as leading digit.]
- Version 0.97 [Sep 5]
-514. a[b,c] to be tried only if a is numeric type.
-515. simplified the code for length_op(string_type).
-516. citations of `Chapter xx' now replaced by correct references.
-517. <Log the subfile sizes...> to be in stat...tats version only.
-518. remove extra space after <insert> and <scantokens>.
-519. offsets should be included in the tracingoutput output.
-520. a vacuous expression should be considered known.
-521. charlist syntax changed from commas to colons.
-[also the WAITS version command-line reader was fixed to handle `^^W']
- Version 0.99 [Sep 24]
-522. vardef's begingroup...endgroup should be accessible.
-523. allow an empty expression in for loops.
- Version 0.999 [Oct 1]
-524. "charfam" changed to "charext".
-525. variable tt makes get_node slightly faster. (PROFILE suggests this)
-526. cur_cmd<=max should be tested before cur_cmd>=min. (PROFILE)
-527. fast_get_avail used in cur_tok and scan_primary. (PROFILE)
- Version 0.9999 [Oct 27]
-528. Major change to representation of independent variables
- ("serial number" added so that MF's equation solving doesn't depend
- on vagaries of storage allocation)
- [module number change: new module between old 585 and 586]
- [in terms of new numbering, modules 232, 585--587, 589, 594, 597,
- 601, 608, 610, 816--817, 855, 1198--1199 were affected]
-[I also reordered some of the cases in print_op, module 189,
-so that the program could be condensed in published version]
- Version 0.99999 [Nov 13]
-529. forgot to decrease three_l in change 497!
-530. cubic_intersection to give approximation if max_patience exceeded.
-[the following example, found by NB, motivated this change:
- show (
- (36.00104,26.99951)..controls (36.00131,26.99979) and (36.00146,27.00017)
- ..(36.00146,27.00055)
- )intersectiontimes(
- (36,27.00055)..controls (45.17148,21.12364) and (55.83588,18)
- ..(66.72873,18)
- );]
- Version 0.999999 [Dec 2]
-531. hold_head needed (scan_toks calls cur_tok calls copy_edges). (D. Kosower)
- Version 1.0 [January 4, 1986]
-532. Optimization in module 1174, suggested by LER (3 Feb 86)
-@x
- if delta=0 then gf_out(skip0)
- else begin gf_out(skip1); gf_out(delta);
- end
-@y
- begin gf_out(skip1); gf_out(delta);
- end
-@z
-*** Late copies of version 1.0 include this correction;
-in particular, the program listing in Volume D was updated (with scissors)!
- Changes subsequent to `Version 1.0' as published in C&T, Volume D:
-533. Inconsistent punctuation in user messages (found by Karl Berry, June 86)
-@x module 1134
-print_nl("Font metrics written on "); print(metric_file_name);
-@y
-print_nl("Font metrics written on "); print(metric_file_name); print_char(".");
-@z (that was installed in version 1.1)
-
-534. Possible arithmetic overflows (found by Klaus Guntermann, July 86)
-@x module 496
-while max_coef<fraction_one do
-@y
-while max_coef<fraction_half do
-@z (that was installed in version 1.2)
-
-535. Possible loop in nonstopmode (found by Chris Thompson, July 86)
-@x module 1206
- @<Finish the \.{TFM} file@>;
-@y
- internal[fontmaking]:=0; {avoid loop in case of fatal error}
- @<Finish the \.{TFM} file@>;
-@z (that too was installed in version 1.2)
-
-536. Double rounding error should be avoided in make_ellipse (JDH, 22 Nov 86)
-@x module 533
-d:=take_fraction(d,delta);
-alpha:=abs(u); beta:=abs(v);
-if alpha<beta then
- begin delta:=alpha; alpha:=beta; beta:=delta;
- end; {now $\alpha=\max(\vert u\vert,\vert v\vert)$,
- $\beta=\min(\vert u\vert,\vert v\vert)$}
-if internal[fillin]<>0 then d:=d-take_fraction(internal[fillin],beta+beta);
-d:=(d+4) div 8; alpha:=alpha div half_unit;
-@y
-alpha:=abs(u); beta:=abs(v);
-if alpha<beta then
- begin alpha:=abs(v); beta:=abs(u);
- end; {now $\alpha=\max(\vert u\vert,\vert v\vert)$,
- $\beta=\min(\vert u\vert,\vert v\vert)$}
-if internal[fillin]<>0 then
- d:=d-take_fraction(internal[fillin],make_fraction(beta+beta,delta));
-d:=take_fraction((d+4) div 8,delta); alpha:=alpha div half_unit;
-@z (That was the reason for version 1.3)
-
-537. Trivial change to a help message (version number is still 1.3).
-@x module 1086
- ("Pretend that you're Miss Marple, examine all clues,")@/
-@y
- ("Pretend that you're Miss Marple: Examine all clues,")@/
-@z
-
-538. Storage allocation can be more elegant and efficient (4/21/87)
-@x module 169
-if r=p then if ((rlink(p)<>rover) or (llink(p)<>rover)) then
-@y
-if r=p then if rlink(p)<>p then
-@z
-
-539. Unused variables can be eliminated. (Found by John Sauter, 5/5/87)
-@x module 158
-@<Glob...@>=
-@!temp_ptr:pointer; {a pointer variable for occasional emergency use}
-
-@y (I used it only in my change file!)
-@z
-@x module 280
-@!r,@!s,@!t:pointer; {registers for list traversal}
-@y
-@!s,@!t:pointer; {registers for list traversal}
-@z
-@x module 284
-@!sine,@!cosine:fraction; {trig functions of various angles}
-@y (the declarations in module 281 are correct, but in 284 they're superfluous)
-@z
-@x module 497
-var @!q,@!ww:pointer; {for list manipulation}
-@!du,@!dv:scaled; {for slope calculation}
-@!t0,@!t1,@!t2:integer; {test coefficients}
-@!t:fraction; {place where the derivative passes a critical slope}
-@!s:fraction; {slope or reciprocal slope}
-@!v:integer; {intermediate value for updating |x0..y2|}
-begin loop
- begin q:=link(p); right_type(p):=k;
-@y
-var @!ww:pointer; {for list manipulation}
-@!du,@!dv:scaled; {for slope calculation}
-@!t0,@!t1,@!t2:integer; {test coefficients}
-@!t:fraction; {place where the derivative passes a critical slope}
-@!s:fraction; {slope or reciprocal slope}
-@!v:integer; {intermediate value for updating |x0..y2|}
-begin loop
- begin right_type(p):=k;
-@z
-@x module 652
-@!s:0..param_size; {value of |param_start| on the current level}
-@y who knows why that line was there?
-@z
-@x module 862
-var @!p,@!q,@!r:pointer; {for list manipulation}
-@y
-var @!p:pointer; {for list manipulation}
-@z
-@x module 985
-@!vv:scaled; {initial value of |v|}
-@!q:pointer; {successor of |p|}
-begin vv:=v; p:=cur_exp;@/
-@y
-@!q:pointer; {successor of |p|}
-begin p:=cur_exp;@/
-@z
-@x module 1059
-@!t:small_number; {variant of |with_option|}
-@y
-@z
-
-540. Typo suppresses an error detection (Chris Thompson, 2May88)
-@x module 963
- if txy mod unity=0 then if tyy mod unity=0 then
-@y
- if txx mod unity=0 then if tyy mod unity=0 then
-@z
-
-541. get_x_token can lose a scanned declared variable (Chris Thompson, 4May88)
-@x module 1011
-if equiv(x)=null then new_root(x);
-@y
-@z
-@x module 1011
-done:scan_declared_variable:=h;
-@y
-done: if eq_type(x)<>tag_token then clear_symbol(x,false);
-if equiv(x)=null then new_root(x);
-scan_declared_variable:=h;
-@z
-
-542. Avoid negative divisor rounding upward (Chris Thompson, fixed 19Jun88)
-@x module 168
-else t:=(lo_mem_max+hi_mem_min+2) div 2; {|lo_mem_max+2<=t<hi_mem_min|}
-@y
-else t:=lo_mem_max+1+(hi_mem_min-lo_mem_max)div 2; {|lo_mem_max+2<=t<hi_mem_min|}
-@z
-
-543. Better strategy when near memory overflow (Chris Thompson)
-@x module 168
-begin if lo_mem_max+1000<hi_mem_min then t:=lo_mem_max+1000
-@y
-begin if hi_mem_min-lo_mem_max>=1998 then t:=lo_mem_max+1000
-@z
-
-544. Avoid fatal_error after terminal eof (Tim Morgan, reported 25Oct88)
-@x module 66 [serious problem occurred if this was called in open_log_file]
-if not input_ln(term_in,true) then fatal_error("End of file on the terminal!");
-@y
-if not input_ln(term_in,true) then t_open_in;
-@z
-
-545. Force terminal output when open_log_file aborts (6Nov88)
-@x module 789
- begin print_err("I can't write on file `");
-@y
- begin selector:=term_only; print_err("I can't write on file `");
-@z
-
-546. By popular request, undo #544 and fix the bug a more complex way.
-@x module 66 [this undoes change #544]
-if not input_ln(term_in,true) then t_open_in;
-@y
-if not input_ln(term_in,true) then fatal_error("End of file on the terminal!");
-@z
-@x module 87 [now we get to the new stuff]
-begin if job_name>0 then selector:=term_and_log
-@y
-begin if log_opened then selector:=term_and_log
-@z
-@x module 88
- error;
-@y
- if log_opened then error;
-@z
-@x module 782
-@!job_name:str_number; {principal file name}
-@y
-@!job_name:str_number; {principal file name}
-@!log_opened:boolean; {has the transcript file been opened?}
-@z
-@x module 783
-@<Initialize the output...@>=job_name:=0;
-@y
-@<Initialize the output...@>=job_name:=0; log_opened:=false;
-@z
-@x module 788
-selector:=log_only;
-@y
-selector:=log_only; log_opened:=true;
-@z
-@x module 789
-begin if interaction<scroll_mode then {bypass |fatal_error|}
- begin selector:=term_only; print_err("I can't write on file `");
-@.I can't write on file x@>
- print_file_name(cur_name,cur_area,cur_ext); print("'.");@/
- job_name:=0; history:=fatal_error_stop; jump_out;
- end; {abort the program without a log file}
-@y
-begin selector:=term_only;
-@z
-@x module 1023 [this change is optional, but it's a slight improvement]
- if job_name<>0 then selector:=selector+2;
-@y
- if log_opened then selector:=selector+2;
-@z
-@x module 1205
-if job_name>0 then
-@y
-if log_opened then
-@z
-@x module 1208
-if job_name>0 then {the log file is open}
-@y
-if log_opened then
-@z
-
-547. String startup problems corresponding to TeX change 355 (17 Jul 89)
-@x module 30 (Warning: This affects most change files!)
- overflow("buffer size",buf_size);
-@:METAFONT capacity exceeded buffer size}{\quad buffer size@>
-@y
- @<Report overflow of the input buffer, and abort@>;
-@z
-@x module 34
-consist of the remainder of the command line, after the part that invoked \MF.
-@y
-consist of the remainder of the command line, after the part that invoked \MF.
-
-The first line is special also because it may be read before \MF\ has
-input a base file. In such cases, normal error messages cannot yet
-be given. The following code uses concepts that will be explained later.
-
-@<Report overflow of the input buffer, and abort@>=
-if base_ident=0 then
- begin write_ln(term_out,'Buffer size exceeded!'); goto final_end;
-@.Buffer size exceeded@>
- end
-else begin cur_input.loc_field:=first; cur_input.limit_field:=last-1;
- overflow("buffer size",buf_size);
-@:METAFONT capacity exceeded buffer size}{\quad buffer size@>
- end
-@z
-@x module 1193
-k:=pool_ptr-4; undump_four_ASCII
-@y
-k:=pool_ptr-4; undump_four_ASCII;
-init_str_ptr:=str_ptr; init_pool_ptr:=pool_ptr;@/
-max_str_ptr:=str_ptr; max_pool_ptr:=pool_ptr
-@z
-@x module 1204
-tini@/
-@y
-init_str_ptr:=str_ptr; init_pool_ptr:=pool_ptr;@/
-max_str_ptr:=str_ptr; max_pool_ptr:=pool_ptr; fix_date_and_time;
-tini@/
-@z
-@x module 1204
-init_str_ptr:=str_ptr; init_pool_ptr:=pool_ptr;@/
-max_str_ptr:=str_ptr; max_pool_ptr:=pool_ptr;@/
-@y
-@z
-
-548. Major changes to allow 8-bit input, cf. TeX82 #359 (11 Sep 89).
-@x module 18
-@!ASCII_code=0..127; {seven-bit numbers}
-@y
-@!ASCII_code=0..255; {eight-bit numbers}
-@z
-@x module 19
-@d last_text_char=127 {ordinal number of the largest element of |text_char|}
-
-@<Local variables for init...@>=
-@!i:0..last_text_char;
-@y
-@d last_text_char=255 {ordinal number of the largest element of |text_char|}
-
-@<Local variables for init...@>=
-@!i:integer;
-@z
-@x module 21
-xchr[0]:=' '; xchr[@'177]:=' ';
- {ASCII codes 0 and |@'177| do not appear in text}
-@y
-@z
-@x module 22
-for i:=1 to @'37 do xchr[i]:=' ';
-@y changing ' ' to chr(i) here will allow all 8-bit characters to get in
-for i:=0 to @'37 do xchr[i]:=' ';
-for i:=@'177 to @'377 do xchr[i]:=' ';
-@z
-@x module 23
-for i:=1 to @'176 do xord[xchr[i]]:=i;
-@y
-for i:=@'200 to @'377 do xord[xchr[i]]:=i;
-for i:=0 to @'176 do xord[xchr[i]]:=i;
-@z
-@x module 37
-@<Types...@>=
-@!pool_pointer = 0..pool_size; {for variables that point into |str_pool|}
-@!str_number = 0..max_strings; {for variables that point into |str_start|}
-
-@ @<Glob...@>=
-@!str_pool:packed array[pool_pointer] of ASCII_code; {the characters}
-@y [OK to make si(#)==#-128 and so(#)==#+128 (without parens) in change files]
-Some \PASCAL\ compilers won't pack integers into a single byte unless the
-integers lie in the range |-128..127|. To accommodate such systems
-we access the string pool only via macros that can easily be redefined.
-
-@d si(#) == # {convert from |ASCII_code| to |packed_ASCII_code|}
-@d so(#) == # {convert from |packed_ASCII_code| to |ASCII_code|}
-
-@<Types...@>=
-@!pool_pointer = 0..pool_size; {for variables that point into |str_pool|}
-@!str_number = 0..max_strings; {for variables that point into |str_start|}
-@!packed_ASCII_code = 0..255; {elements of |str_pool| array}
-
-@ @<Glob...@>=
-@!str_pool:packed array[pool_pointer] of packed_ASCII_code; {the characters}
-@z
-@x module 41
-begin str_pool[pool_ptr]:=#; incr(pool_ptr);
-@y
-begin str_pool[pool_ptr]:=si(#); incr(pool_ptr);
-@z
-@x module 45
- begin if str_pool[j]<>buffer[k] then
-@y
- begin if so(str_pool[j])<>buffer[k] then
-@z
-@x module 47
-var k,@!l:0..127; {small indices or counters}
-@y
-var k,@!l:0..255; {small indices or counters}
-@z
-@x module 47
-@<Make the first 128 strings@>;
-@y
-@<Make the first 256 strings@>;
-@z
-@x module 48
-@ @<Make the first 128...@>=
-for k:=0 to 127 do
- begin if (@<Character |k| cannot be printed@>) then
- begin append_char("^"); append_char("^");
- if k<@'100 then append_char(k+@'100)
- else append_char(k-@'100);
-@y
-@ @d app_lc_hex(#)==l:=#;
- if l<10 then append_char(l+"0)@+else append_char(l-10+"a")
-
-@<Make the first 256...@>=
-for k:=0 to 255 do
- begin if (@<Character |k| cannot be printed@>) then
- begin append_char("^"); append_char("^");
- if k<@'100 then append_char(k+@'100)
- else if k<@'200 then append_char(k-@'100)
- else begin app_lc_hex(k div 16); app_lc_hex(k mod 16);
- end;
-@z
-@x module 59
- begin print_char(str_pool[j]); incr(j);
-@y
- begin print_char(so(str_pool[j])); incr(j);
-@z
-@x module 60
- begin print(str_pool[j]); incr(j);
-@y
- begin print(so(str_pool[j])); incr(j);
-@z
-@x module 85
- begin if str_pool[j]<>"%" then print(str_pool[j])
- else if j+1=str_start[err_help+1] then print_ln
- else if str_pool[j+1]<>"%" then print_ln
-@y
- begin if str_pool[j]<>si("%") then print(so(str_pool[j]))
- else if j+1=str_start[err_help+1] then print_ln
- else if str_pool[j+1]<>si("%") then print_ln
-@z
-@x module 199
-char_class[127]:=invalid_class;
-@y
-for k:=127 to 255 do char_class[k]:=invalid_class;
-@z
-@x module 200
-@d hash_is_full == (hash_used=1) {test if all positions are occupied}
-@d eq_type(#) == eqtb[#].lh {the current ``meaning'' of a symbolic token}
-@d equiv(#) == eqtb[#].rh {parametric part of a token's meaning}
-@d hash_base=129 {hashing actually starts here}
-@y [incidentally I fixed a bug re hash overflow here]
-@d eq_type(#) == eqtb[#].lh {the current ``meaning'' of a symbolic token}
-@d equiv(#) == eqtb[#].rh {parametric part of a token's meaning}
-@d hash_base=257 {hashing actually starts here}
-@d hash_is_full == (hash_used=hash_base) {are all positions occupied?}
-@z
-@x module 210
-for j:=0 to l-1 do buffer[j]:=str_pool[k+j];
-cur_sym:=id_lookup(0,l);@/
-if s>=128 then {we don't want to have the string twice}
-@y
-for j:=0 to l-1 do buffer[j]:=so(str_pool[k+j]);
-cur_sym:=id_lookup(0,l);@/
-if s>=256 then {we don't want to have the string twice}
-@z
-@x module 223
-begin c:=char_class[str_pool[str_start[r]]];
-@y
-begin c:=char_class[so(str_pool[str_start[r]])];
-@z
-@x module 717
- begin buffer[first]:=str_pool[j]; incr(j); incr(first);
-@y
- begin buffer[first]:=so(str_pool[j]); incr(j); incr(first);
-@z
-@x module 774
-for j:=str_start[a] to str_start[a+1]-1 do append_to_name(str_pool[j]);
-for j:=str_start[n] to str_start[n+1]-1 do append_to_name(str_pool[j]);
-for j:=str_start[e] to str_start[e+1]-1 do append_to_name(str_pool[j]);
-@y
-for j:=str_start[a] to str_start[a+1]-1 do append_to_name(so(str_pool[j]));
-for j:=str_start[n] to str_start[n+1]-1 do append_to_name(so(str_pool[j]));
-for j:=str_start[e] to str_start[e+1]-1 do append_to_name(so(str_pool[j]));
-@z
-@x module 912
- else begin cur_exp:=round_unscaled(cur_exp) mod 128; cur_type:=string_type;
- if cur_exp<0 then cur_exp:=cur_exp+128;
-@y
- else begin cur_exp:=round_unscaled(cur_exp) mod 256; cur_type:=string_type;
- if cur_exp<0 then cur_exp:=cur_exp+256;
-@z
-@x module 913
- else n:=str_pool[str_start[cur_exp]]
-@y
- else n:=so(str_pool[str_start[cur_exp]])
-@z
-@x ibid
- begin m:=str_pool[k];
-@y
- begin m:=so(str_pool[k]);
-@z
-@x module 976
-for k:=str_start[a] to str_start[a+1]-1 do append_char(str_pool[k]);
-for k:=str_start[b] to str_start[b+1]-1 do append_char(str_pool[k]);
-@y
-for k:=str_start[a] to str_start[a+1]-1 do append_char(so(str_pool[k]));
-for k:=str_start[b] to str_start[b+1]-1 do append_char(so(str_pool[k]));
-@z
-@x module 977
- for k:=str_start[s]+b-1 downto str_start[s]+a do append_char(str_pool[k])
-else for k:=str_start[s]+a to str_start[s]+b-1 do append_char(str_pool[k]);
-@y
- for k:=str_start[s]+b-1 downto str_start[s]+a do append_char(so(str_pool[k]))
-else for k:=str_start[s]+a to str_start[s]+b-1 do append_char(so(str_pool[k]));
-@z
-@x module 1103
- begin c:=str_pool[str_start[cur_exp]]; goto found;
-@y
- begin c:=so(str_pool[str_start[cur_exp]]); goto found;
-@z
-@x module 1160
- for k:=str_start[s] to str_start[s+1]-1 do gf_out(str_pool[k]);
- end;
-if t<>0 then for k:=str_start[t] to str_start[t+1]-1 do gf_out(str_pool[k]);
-@y
- for k:=str_start[s] to str_start[s+1]-1 do gf_out(so(str_pool[k]));
- end;
-if t<>0 then for k:=str_start[t] to str_start[t+1]-1 do gf_out(so(str_pool[k]));
-@z
-@x module 1192
- w.b0:=str_pool[k]; w.b1:=str_pool[k+1];
- w.b2:=str_pool[k+2]; w.b3:=str_pool[k+3];
-@y [often qi(so(x))=x, but not e.g. when "quarterwords" are two bytes]
- w.b0:=qi(so(str_pool[k])); w.b1:=qi(so(str_pool[k+1]));
- w.b2:=qi(so(str_pool[k+2])); w.b3:=qi(so(str_pool[k+3]));
-@z
-@x module 1193
- str_pool[k]:=w.b0; str_pool[k+1]:=w.b1;
- str_pool[k+2]:=w.b2; str_pool[k+3]:=w.b3
-@y
- str_pool[k]:=si(qo(w.b0)); str_pool[k+1]:=si(qo(w.b1));
- str_pool[k+2]:=si(qo(w.b2)); str_pool[k+3]:=si(qo(w.b3))
-@z
-
-549. Make ".base" more easily switchable (see TeX82 log #369).
-@x module 775 gets a new definition
-@y
-@d base_extension=".base" {the extension, as a \.{WEB} constant}
-@z now replace ".base" by base_extension in modules 784 and 1200.
-
-550. "This can't happen" happened because of nonmonotonic rounding
- (bug found by Mark Eklof, fixed 7 Oct 89)
-@x module 411
-left_x(r):=x_coord(r);
-@y
-left_x(r):=x_coord(r);
-if right_x(p)>x_coord(r) then right_x(p):=x_coord(r);
- {we always have |x_coord(p)<=right_x(p)|}
-@z
-@x ibid
-else if x_coord(r)>dest_x then x_coord(r):=dest_x;
-@y
-else begin if x_coord(r)>dest_x then
- begin x_coord(r):=dest_x; left_x(r):=-x_coord(r); right_x(r):=x_coord(r);
- end;
- if left_x(q)>dest_x then left_x(q):=dest_x
- else if left_x(q)<x_coord(r) then left_x(q):=x_coord(r);
- end;
-@z
-@x module 412
-left_x(s):=x_coord(s);
-negate(x_coord(s)); right_x(s):=x_coord(s);
-negate(left_x(q));
-@y
-left_x(s):=x_coord(s); {now |x_coord(r)=right_x(r)<=left_x(s)|}
-if left_x(q)<dest_x then left_x(q):=-dest_x
-else if left_x(q)>x_coord(s) then left_x(q):=-x_coord(s)
-else negate(left_x(q));
-negate(x_coord(s)); right_x(s):=x_coord(s);
-@z
-@x module 415
-if x_coord(r)>dest_x then x_coord(r):=dest_x
-else if x_coord(r)<x_coord(pp) then x_coord(r):=x_coord(pp);
-if y_coord(r)<y_coord(pp) then y_coord(r):=y_coord(pp);
-left_y(r):=y_coord(r);
-@y
-if y_coord(r)<y_coord(pp) then y_coord(r):=y_coord(pp);
-left_y(r):=y_coord(r);
-if right_y(pp)>y_coord(r) then right_y(pp):=y_coord(r);
- {we always have |y_coord(pp)<=right_y(pp)|}
-@z
-@x ibid
-else if y_coord(r)>dest_y then y_coord(r):=dest_y;
-@y
-else begin if y_coord(r)>dest_y then
- begin y_coord(r):=dest_y; left_y(r):=-y_coord(r); right_y(r):=y_coord(r);
- end;
- if left_y(qq)>dest_y then left_y(qq):=dest_y
- else if left_y(qq)<y_coord(r) then left_y(qq):=y_coord(r);
- end;
-@z
-@x module 416
-if x_coord(s)>dest_x then x_coord(s):=dest_x
-else if x_coord(s)<x_coord(r) then x_coord(s):=x_coord(r);
-if y_coord(s)<dest_y then y_coord(s):=dest_y;
-if y_coord(s)<y_coord(r) then y_coord(s):=y_coord(r);
-right_type(s):=right_type(pp);
-left_y(s):=y_coord(s);
-negate(y_coord(s)); right_y(s):=y_coord(s);
-negate(left_y(qq));
-@y
-if y_coord(s)<dest_y then y_coord(s):=dest_y;
-if y_coord(s)<y_coord(r) then y_coord(s):=y_coord(r);
-right_type(s):=right_type(pp);
-left_y(s):=y_coord(s); {now |y_coord(r)=right_y(r)<=left_y(s)|}
-if left_y(qq)<dest_y then left_y(qq):=-dest_y
-else if left_y(qq)>y_coord(s) then left_y(qq):=-y_coord(s)
-else negate(left_y(qq));
-negate(y_coord(s)); right_y(s):=y_coord(s);
-@z
-@x module 424
-if y_coord(r)>dest_y then y_coord(r):=dest_y
-else if y_coord(r)<y_coord(p) then y_coord(r):=y_coord(p);
-if x_coord(r)<x_coord(p) then x_coord(r):=x_coord(p);
-left_x(r):=x_coord(r);@/
-y_coord(r):=y_coord(r)+x_coord(r); negate(x_coord(r));@/
-right_x(r):=x_coord(r); right_y(r):=right_y(r)-right_x(r);@/
-left_y(q):=left_y(q)+left_x(q); negate(left_x(q));@/
-dest_y:=dest_y+dest_x; negate(dest_x);
-@y
-if x_coord(p)+y_coord(r)>dest_x+dest_y then
- begin y_coord(r):=dest_x+dest_y-x_coord(p);
- if left_y(r)>y_coord(r) then
- begin left_y(r):=y_coord(r);
- if right_y(p)>y_coord(r) then right_y(p):=y_coord(r);
- end;
- end;
-if x_coord(r)<x_coord(p) then x_coord(r):=x_coord(p)
-else if x_coord(r)+y_coord(r)>dest_x+dest_y then
- x_coord(r):=dest_x+dest_y-y_coord(r);
-left_x(r):=x_coord(r);
-if right_x(p)>x_coord(r) then right_x(p):=x_coord(r);
- {we always have |x_coord(p)<=right_x(p)|}
-y_coord(r):=y_coord(r)+x_coord(r); right_y(r):=right_y(r)+x_coord(r);@/
-negate(x_coord(r)); right_x(r):=x_coord(r);@/
-left_y(q):=left_y(q)+left_x(q); negate(left_x(q));@/
-dest_y:=dest_y+dest_x; negate(dest_x);
-if right_y(r)>dest_y then right_y(r):=dest_y;
-if left_y(q)>dest_y then left_y(q):=dest_y
-else if left_y(q)<y_coord(r) then left_y(q):=y_coord(r);
-if right_y(r)>left_y(q) then right_y(r):=left_y(q);
-@z
-@x ibid
-else if x_coord(r)>dest_x then x_coord(r):=dest_x
-@y
-else begin if x_coord(r)>dest_x then
- begin x_coord(r):=dest_x; left_x(r):=-x_coord(r); right_x(r):=x_coord(r);
- end;
- if left_x(q)>dest_x then left_x(q):=dest_x
- else if left_x(q)<x_coord(r) then left_x(q):=x_coord(r);
- end;
-@z
-@x module 425 is entirely replaced
-@y by the following code:
-@ @<Subdivide the cubic a second time with respect to $x'-y'$@>=
-begin split_cubic(r,t,dest_x,dest_y); s:=link(r);@/
-if x_coord(r)+y_coord(s)>dest_x+dest_y then
- begin y_coord(s):=dest_x+dest_y-x_coord(r);
- if left_y(s)>y_coord(s) then
- begin left_y(s):=y_coord(s);
- if right_y(r)>y_coord(s) then right_y(r):=y_coord(s);
- end;
- end;
-if x_coord(s)+y_coord(s)>dest_x+dest_y then x_coord(s):=dest_x+dest_y-y_coord(s)
-else begin if x_coord(s)<dest_x then x_coord(s):=dest_x;
- if x_coord(s)<x_coord(r) then x_coord(s):=x_coord(r);
- end;
-right_type(s):=right_type(p);
-left_x(s):=x_coord(s); {now |x_coord(r)=right_x(r)<=left_x(s)|}
-if left_x(q)<dest_x then
- begin left_y(q):=left_y(q)+dest_x; left_x(q):=-dest_x;@+end
-else if left_x(q)>x_coord(s) then
- begin left_y(q):=left_y(q)+x_coord(s); left_x(q):=-x_coord(s);@+end
-else begin left_y(q):=left_y(q)+left_x(q); negate(left_x(q));@+end;
-y_coord(s):=y_coord(s)+x_coord(s); right_y(s):=right_y(s)+x_coord(s);@/
-negate(x_coord(s)); right_x(s):=x_coord(s);@/
-dest_y:=dest_y+dest_x;
-if right_y(s)>dest_y then right_y(s):=dest_y;
-if left_y(q)>dest_y then left_y(q):=dest_y
-else if left_y(q)<y_coord(s) then left_y(q):=y_coord(s);
-if right_y(s)>left_y(q) then right_y(s):=left_y(q);
-end
-@z
-
-551. Major change for extended ligatures.
-@x module 11 (this may affect change files)
-@!lig_table_size=300; {maximum number of ligature/kern steps}
-@y
-@!lig_table_size=5000; {maximum number of ligature/kern steps, must be
- at least 255 and at most 32510}
-@!max_kerns=500; {maximum number of distinct kern amounts}
-@z
-@x module 14 gets a new line of code
-@y
-if(lig_table_size<255)or(lig_table_size>32510)then bad:=7;
-@z
-@x module 186
-@d lig_kern_token=76 {the operators `\&{kern}' and `\.{=:}'}
-@d assignment=77 {the operator `\.{:=}'}
-@d colon=78 {the operator `\.:'}
-@#
-@d comma=79 {the operator `\.,'}
-@d end_of_statement==cur_cmd>comma
-@d semicolon=80 {the operator `\.;', must be |comma+1|}
-@d end_group=81 {end a group (\&{endgroup}), must be |semicolon+1|}
-@d stop=82 {end a job (\&{end}, \&{dump}), must be |end_group+1|}
-@y
-@d lig_kern_token=76
- {the operators `\&{kern}' and `\.{=:}' and `\.{=:\char'174}, etc.}
-@d assignment=77 {the operator `\.{:=}'}
-@d skip_to=78 {the operation `\&{skipto}'}
-@d bchar_label=79 {the operator `\.{\char'174\char'174:}'}
-@d double_colon=80 {the operator `\.{::}'}
-@d colon=81 {the operator `\.:'}
-@#
-@d comma=82 {the operator `\.,', must be |colon+1|}
-@d end_of_statement==cur_cmd>comma
-@d semicolon=83 {the operator `\.;', must be |comma+1|}
-@d end_group=84 {end a group (\&{endgroup}), must be |semicolon+1|}
-@d stop=85 {end a job (\&{end}, \&{dump}), must be |end_group+1|}
-@z
-@x module 190
-@d max_given_internal=warning_check
-@y
-@d boundary_char=41 {the right boundary character for ligatures}
-@d max_given_internal=41
-@z
-@x module 192 gets two new lines of code
-@y
-primitive("boundarychar",internal_quantity,boundary_char);@/
-@!@:boundary_char_}{\&{boundarychar} primitive@>
-@z
-@x and module 193 gets one too
-@y
-int_name[boundary_char]:="boundarychar";
-@z
-@x and module 211 gets several
-@y (to be inserted in appropriate places)
-primitive("::",double_colon,0);
-@!@::: }{\.{::} primitive@>
-primitive("||:",bchar_label,0);
-@!@:::: }{\.{\char'174\char'174:} primitive@>
-primitive("skipto",skip_to,0);@/
-@!@:skip_to_}{\&{skipto} primitive@>
-@z
-@x as does module 212
-@y
-bchar_label:print("||:");
-double_colon:print("::");
-skip_to:print("skipto");
-@z
-@x module 1093 has new text (see TeX change 362 for module 545) and also this:
-@d stop_bit(#)==lig_kern[#].b0
-@d next_char(#)==lig_kern[#].b1
-@d op_bit(#)==lig_kern[#].b2
-@y
-@d skip_byte(#)==lig_kern[#].b0
-@d next_char(#)==lig_kern[#].b1
-@d op_byte(#)==lig_kern[#].b2
-@z
-@x module 1096 gets a new definition
-@y
-@d undefined_label==lig_table_size {an undefined local label}
-@z
-@x ...and some changed declarations
-@!char_remainder:array[eight_bits] of eight_bits; {the |remainder| byte}
-@!header_byte:array[1..header_size] of -1..255;
- {bytes of the \.{TFM} header, or $-1$ if unset}
-@!lig_kern:array[0..lig_table_size] of four_quarters; {the ligature/kern table}
-@!nl:0..lig_table_size; {the number of ligature/kern steps so far}
-@!kern:array[eight_bits] of scaled; {distinct kerning amounts}
-@!nk:0..256; {the number of distinct kerns so far}
-@y
-@!char_remainder:array[eight_bits] of 0..lig_table_size; {the |remainder| byte}
-@!header_byte:array[1..header_size] of -1..255;
- {bytes of the \.{TFM} header, or $-1$ if unset}
-@!lig_kern:array[0..lig_table_size] of four_quarters; {the ligature/kern table}
-@!nl:0..32767-256; {the number of ligature/kern steps so far}
-@!kern:array[0..max_kerns] of scaled; {distinct kerning amounts}
-@!nk:0..max_kerns; {the number of distinct kerns so far}
-@z
-@x ...and some new declarations
-@y
-@!skip_table:array[eight_bits] of 0..lig_table_size; {local label status}
-@!lk_started:boolean; {has there been a lig/kern step in this command yet?}
-@!bchar:integer; {right boundary character}
-@!bch_label:0..lig_table_size; {left boundary starting location}
-@!ll,@!lll:0..lig_table_size; {registers used for lig/kern processing}
-@!label_loc:array[0..256] of -1..lig_table_size; {lig/kern starting addresses}
-@!label_char:array[1..256] of eight_bits; {characters for |label_loc|}
-@!label_ptr:0..256; {highest position occupied in |label_loc|}
-@z
-@x module 1097
- end;
-for k:=1 to header_size do header_byte[k]:=-1;
-bc:=255; ec:=0; nl:=0; nk:=0; ne:=0; np:=0;
-@y
- skip_table[k]:=undefined_label;
- end;
-for k:=1 to header_size do header_byte[k]:=-1;
-bc:=255; ec:=0; nl:=0; nk:=0; ne:=0; np:=0;@/
-internal[boundary_char]:=-unity;
-bch_label:=undefined_label;@/
-label_loc[0]:=-1; label_ptr:=0;
-@z
-@x module 1104
-procedure set_tag(@!c:eight_bits;@!t:small_number;@!r:eight_bits);
-begin if char_tag[c]=no_tag then
- begin char_tag[c]:=t; char_remainder[c]:=r;
-@y
-procedure set_tag(@!c:halfword;@!t:small_number;@!r:halfword);
-begin if char_tag[c]=no_tag then
- begin char_tag[c]:=t; char_remainder[c]:=r;
- if t=lig_tag then
- begin incr(label_ptr); label_loc[label_ptr]:=r; label_char[label_ptr]:=c;
- end;
-@z
-@x module 1105
-if (c>" ")and(c<128) then print(c)
-@y
-if (c>" ")and(c<127) then print(c)
-else if c=256 then print("||")
-@z
-@x module 1106
-label continue;
-var @!c,@!cc:eight_bits; {character codes}
-@!k:0..256; {index into the |kern| array}
-@y
-label continue,done;
-var @!c,@!cc:0..256; {character codes}
-@!k:0..max_kerns; {index into the |kern| array}
-@z
-% also the previous code of module 1107 is inserted into 1106
-@x modules 1107--1111 are completely replaced
-@y by the following new code:
-@ @<Store a list of ligature/kern steps@>=
-begin lk_started:=false;
-continue: get_x_next;
-if(cur_cmd=skip_to)and lk_started then
- @<Process a |skip_to| command and |goto done|@>;
-if cur_cmd=bchar_label then
- begin c:=256; cur_cmd:=colon;@+end
-else begin back_input; c:=get_code;@+end;
-if(cur_cmd=colon)or(cur_cmd=double_colon)then
- @<Record a label in a lig/kern subprogram and |goto continue|@>;
-if cur_cmd=lig_kern_token then @<Compile a ligature/kern command@>
-else begin print_err("Illegal ligtable step");
-@.Illegal ligtable step@>
- help1("I was looking for `=:' or `kern' here.");
- back_error; next_char(nl):=qi(0); op_byte(nl):=qi(0); rem_byte(nl):=qi(0);@/
- skip_byte(nl):=stop_flag+1; {this specifies an unconditional stop}
- end;
-if nl=lig_table_size then overflow("ligtable size",lig_table_size);
-@:METAFONT capacity exceeded ligtable size}{\quad ligtable size@>
-incr(nl);
-if cur_cmd=comma then goto continue;
-if skip_byte(nl-1)<stop_flag then skip_byte(nl-1):=stop_flag;
-done:end
-
-@ @<Put each...@>=
-primitive("=:",lig_kern_token,0);
-@!@:=:_}{\.{=:} primitive@>
-primitive("=:|",lig_kern_token,1);
-@!@:=:/_}{\.{=:\char'174} primitive@>
-primitive("=:|>",lig_kern_token,5);
-@!@:=:/>_}{\.{=:\char'174>} primitive@>
-primitive("|=:",lig_kern_token,2);
-@!@:=:/_}{\.{\char'174=:} primitive@>
-primitive("|=:>",lig_kern_token,6);
-@!@:=:/>_}{\.{\char'174=:>} primitive@>
-primitive("|=:|",lig_kern_token,3);
-@!@:=:/_}{\.{\char'174=:\char'174} primitive@>
-primitive("|=:|>",lig_kern_token,7);
-@!@:=:/>_}{\.{\char'174=:\char'174>} primitive@>
-primitive("|=:|>>",lig_kern_token,11);
-@!@:=:/>_}{\.{\char'174=:\char'174>>} primitive@>
-primitive("kern",lig_kern_token,128);
-@!@:kern_}{\&{kern} primitive@>
-
-@ @<Cases of |print_cmd...@>=
-lig_kern_token: case m of
-0:print("=:");
-1:print("=:|");
-2:print("|=:");
-3:print("|=:|");
-5:print("=:|>");
-6:print("|=:>");
-7:print("|=:|>");
-11:print("|=:|>>");
-othercases print("kern")
-endcases;
-
-@ Local labels are implemented by maintaining the |skip_table| array,
-where |skip_table[c]| is either |undefined_label| or the address of the
-most recent lig/kern instruction that skips to local label~|c|. In the
-latter case, the |skip_byte| in that instruction will (temporarily)
-be zero if there were no prior skips to this label, or it will be the
-distance to the prior skip.
-
-We may need to cancel skips that span more than 127 lig/kern steps.
-
-@d cancel_skips(#)==ll:=#;
- repeat lll:=qo(skip_byte(ll)); skip_byte(ll):=stop_flag; ll:=ll-lll;
- until lll=0
-@d skip_error(#)==begin print_err("Too far to skip");
-@.Too far to skip@>
- help1("At most 127 lig/kern steps can separate skipto1 from 1::.");
- error; cancel_skips(#);
- end
-
-@<Process a |skip_to| command and |goto done|@>=
-begin c:=get_code;
-if nl-skip_table[c]>128 then {|skip_table[c]<<nl<=undefined_label|}
- begin skip_error(skip_table[c]); skip_table[c]:=undefined_label;
- end;
-if skip_table[c]=undefined_label then skip_byte(nl-1):=qi(0)
-else skip_byte(nl-1):=qi(nl-skip_table[c]-1);
-skip_table[c]:=nl-1; goto done;
-end
-
-@ @<Record a label in a lig/kern subprogram and |goto continue|@>=
-begin if cur_cmd=colon then
- if c=256 then bch_label:=nl
- else set_tag(c,lig_tag,nl)
-else if skip_table[c]<undefined_label then
- begin ll:=skip_table[c]; skip_table[c]:=undefined_label;
- repeat lll:=qo(skip_byte(ll));
- if nl-ll>128 then
- begin skip_error(ll); goto continue;
- end;
- skip_byte(ll):=qi(nl-ll-1); ll:=ll-lll;
- until lll=0;
- end;
-goto continue;
-end
-@x module 1112
-next_char(nl):=qi(c); op_bit(nl):=qi(cur_mod); stop_bit(nl):=qi(0);
-if cur_mod=0 then rem_byte(nl):=qi(get_code)
-@y
-begin next_char(nl):=qi(c); skip_byte(nl):=qi(0);
-if cur_mod<128 then {ligature op}
- begin op_byte(nl):=qi(cur_mod); rem_byte(nl):=qi(get_code);
- end
-@z
-@x ibid
- begin if nk=256 then overflow("kern",256);
-@:METAFONT capacity exceeded kern}{\quad kern@>
- incr(nk);
- end;
- rem_byte(nl):=qi(k);
- end
-@y
- begin if nk=max_kerns then overflow("kern",max_kerns);
-@:METAFONT capacity exceeded kern}{\quad kern@>
- incr(nk);
- end;
- op_byte(nl):=kern_flag+(k div 256);
- rem_byte(nl):=qi((k mod 256));
- end;
-lk_started:=true;
-end
-@z
-@x module 1135
-tfm_two(6+lh+(ec-bc+1)+nw+nh+nd+ni+nl+nk+ne+np);
- {this is the total number of file words that will be output}
-tfm_two(lh); tfm_two(bc); tfm_two(ec); tfm_two(nw); tfm_two(nh);
-tfm_two(nd); tfm_two(ni); tfm_two(nl); tfm_two(nk); tfm_two(ne); tfm_two(np);
-@y
-@<Compute the ligature/kern program offset and implant the
- left boundary label@>;
-tfm_two(6+lh+(ec-bc+1)+nw+nh+nd+ni+nl+lk_offset+nk+ne+np);
- {this is the total number of file words that will be output}
-tfm_two(lh); tfm_two(bc); tfm_two(ec); tfm_two(nw); tfm_two(nh);
-tfm_two(nd); tfm_two(ni); tfm_two(nl+lk_offset); tfm_two(nk); tfm_two(ne);
-tfm_two(np);
-@z
-% modules 1137&1138 are combined into a single module
-% and so are modules 1140--1141, to make room for two new modules.
-@x module 1136 is moved to after old module 1141
-@y and changed to the following code:
-@ @<Log the subfile sizes of the \.{TFM} file@>=
-if bch_label<undefined_label then decr(nl);
-wlog_ln('(You used ',nw:1,'w,',@| nh:1,'h,',@| nd:1,'d,',@| ni:1,'i,',@|
- nl:1,'l,',@| nk:1,'k,',@| ne:1,'e,',@|
- np:1,'p metric file positions');
-wlog_ln(' out of ',@| '256w,16h,16d,64i,',@|
- lig_table_size:1,'l,',max_kerns:1,'k,256e,',@|
- max_font_dimen:1,'p)');
-end
-@z
-@x module 1139 is completely replaced
-@y by the following three modules:
-@ We need to output special instructions at the beginning of the
-|lig_kern| array in order to specify the right boundary character
-and/or to handle starting addresses that exceed 255. The |label_loc|
-and |label_char| arrays have been set up to record all the
-starting addesses; we have $-1=|label_loc|[0]<|label_loc|[1]\le\cdots
-\le|label_loc|[|label_ptr]|$.
-
-@<Compute the ligature/kern program offset...@>=
-bchar:=round_unscaled(internal[boundary_char]);
-if(bchar<0)or(bchar>255)then
- begin bchar:=-1; lk_started:=false; lk_offset:=0;@+end
-else begin lk_started:=true; lk_offset:=1;@+end;
-@<Find the minimum |lk_offset| and adjust all remainders@>;
-if bch_label<undefined_label then
- begin skip_byte(nl):=qi(255); next_char(nl):=qi(0);
- op_byte(nl):=qi(((bch_label+lk_offset)div 256));
- rem_byte(nl):=qi(((bch_label+lk_offset)mod 256));
- incr(nl); {possibly |nl=lig_table_size+1|}
- end
-
-@ @<Find the minimum |lk_offset|...@>=
-k:=label_ptr; {pointer to the largest unallocated label}
-if label_loc[k]+lk_offset>255 then
- begin lk_offset:=0; lk_started:=false; {location 0 can do double duty}
- repeat char_remainder[label_char[k]]:=lk_offset;
- while label_loc[k-1]=label_loc[k] do
- begin decr(k); char_remainder[label_char[k]]:=lk_offset;
- end;
- incr(lk_offset); decr(k);
- until lk_offset+label_loc[k]<256;
- {N.B.: |lk_offset=256| satisfies this when |k=0|}
- end;
-if lk_offset>0 then
- while k>0 do
- begin char_remainder[label_char[k]]
- :=char_remainder[label_char[k]]+lk_offset;
- decr(k);
- end
-
-@ @<Output the ligature/kern program@>=
-for k:=0 to 255 do if skip_table[k]<undefined_label then
- begin print_nl("(local label "); print_int(k); print(":: was missing)");
-@.local label l:: was missing@>
- cancel_skips(skip_table[k]);
- end;
-if lk_started then {|lk_offset=1| for the special |bchar|}
- begin tfm_out(255); tfm_out(bchar); tfm_two(0);
- end
-else for k:=1 to lk_offset do {output the redirection specs}
- begin ll:=label_loc[label_ptr];
- if bchar<0 then
- begin tfm_out(254); tfm_out(0);
- end
- else begin tfm_out(255); tfm_out(bchar);
- end;
- tfm_two(ll+lk_offset);
- repeat decr(label_ptr);
- until label_loc[label_ptr]<ll;
- end;
-for k:=0 to nl-1 do tfm_qqqq(lig_kern[k]);
-for k:=0 to nk-1 do tfm_four(dimen_out(kern[k]))
-@z
-@x module 1205 gets a new declaration
-@y
-@!lk_offset:0..256; {extra words inserted at beginning of |lig_kern| array}
-@z
-
-552. Improved the covering/shortening routines. (18 Dec 89)
-@x module 1119 gets a new global variable
-@y
-@!excess:integer; {the list is this much too long}
-@z
-@x module 1120 gives it a value
-begin if min_cover(0)<=m then threshold:=0
-@y
-begin excess:=min_cover(0)-m;
-if excess<=0 then threshold:=0
-@z
-@x and module 1122 uses it
-begin repeat p:=link(p); info(p):=m;
-@y
-begin repeat p:=link(p); info(p):=m;
-decr(excess);@+if excess=0 then d:=0;
-@z
-@x and module 1122 also avoids overflow/ambiguous halving
-v:=half(l+value(p));
-@y
-v:=l+half(value(p)-l);
-@z
-
-553. Global variable used prematurely in do_add_to (Alan Jeffrey, 9 Feb 90)
-@x module 403
-@!cur_path_type:double_path_code..also_code; {likewise}
-@y
-@!cur_path_type:double_path_code..contour_code; {likewise}
-@z
-@x module 1059
-begin get_x_next; var_flag:=thing_to_add; scan_primary;
-if cur_type<>token_list then
- @<Abandon edges command because there's no variable@>
-else begin lhs:=cur_exp; cur_path_type:=cur_mod;@/
- cur_type:=vacuous; get_x_next; scan_expression;
- if cur_path_type=also_code then @<Augment some edges by others@>
-@y
-@!add_to_type:double_path_code..also_code; {modifier of \&{addto}}
-begin get_x_next; var_flag:=thing_to_add; scan_primary;
-if cur_type<>token_list then
- @<Abandon edges command because there's no variable@>
-else begin lhs:=cur_exp; add_to_type:=cur_mod;@/
- cur_type:=vacuous; get_x_next; scan_expression;
- if add_to_type=also_code then @<Augment some edges by others@>
-@z
-@x module 1064
-else begin lhs:=null;
-@y
-else begin lhs:=null; cur_path_type:=add_to_type;
-@z
-
-554. Balance the parens showing on the terminal (for Lispers).
-@x module 631
-@!in_open : 0..max_in_open; {the number of lines in the buffer, less one}
-@y
-@!in_open : 0..max_in_open; {the number of lines in the buffer, less one}
-@!open_parens : 0..max_in_open; {the number of open text files}
-@z
-@x module 657
-in_open:=0; max_buf_stack:=0;
-@y
-in_open:=0; open_parens:=0; max_buf_stack:=0;
-@z
-@x module 681
- begin print_char(")"); force_eof:=false;
- update_terminal; {show user that file has been read}
-@y
- begin print_char(")"); decr(open_parens);
- update_terminal; {show user that file has been read}
- force_eof:=false;
-@z
-@x module 793
-print_char("("); print(name); update_terminal;
-@y
-print_char("("); incr(open_parens); print(name); update_terminal;
-@z
-@x module 1209
-if job_name=0 then open_log_file;
-@y
-if job_name=0 then open_log_file;
-while open_parens>0 do
- begin print(" )"); decr(open_parens);
- end;
-@z
-
------------Here I draw the line with respect to further changes
-
-555. Don't try system area if an area was given (see tex82.bug number 312;
-found by Jonathan Kew, May 1990)
-@x module 793
- pack_file_name(cur_name,MF_area,cur_ext);
- if a_open_in(cur_file) then goto done;
-@y
- if cur_area="" then
- begin pack_file_name(cur_name,MF_area,cur_ext);
- if a_open_in(cur_file) then goto done;
- end;
-@z
-
-556. Report correct line number when buffer overflows (CET, Jul 90).
-@x module 794
-begin if not input_ln(cur_file,false) then do_nothing;
-firm_up_the_line;
-buffer[limit]:="%"; first:=limit+1; loc:=start; line:=1;
-@y
-begin line:=1;
-if input_ln(cur_file,false) then do_nothing;
-firm_up_the_line;
-buffer[limit]:="%"; first:=limit+1; loc:=start;
-@z
-
-557. TeX82 bug 308, corrected in 1985, is also in MF! (Lutz Birkhahn, May91)
-@x module 176
-var_used:=lo_mem_stat_max+1-mem_min; dyn_used:=mem_top+1-hi_mem_stat_min;
-@y
-var_used:=lo_mem_stat_max+1-mem_min; dyn_used:=mem_top+1-hi_mem_min;
-@z
-
-558. Allow unprintable file names, as in TeX change 396 (19 Sep 91)
-(Much of this is redundant except for people who make nonportable
-versions that allow other 8-bit codes to be in variable names---and for
-those people only if they allow input of more codes than they can print!
-Still, it seems best to make the programs for TeX and MF as alike as possible.)
-@x module 59
-j:=str_start[s];
-while j<str_start[s+1] do
- begin print_char(so(str_pool[j])); incr(j);
- end;
-@y
-if (s<256)and(selector>pseudo) then print_char(s)
-else begin j:=str_start[s];
- while j<str_start[s+1] do
- begin print_char(so(str_pool[j])); incr(j);
- end;
- end;
-@z
-@x module 60
-j:=str_start[s];
-while j<str_start[s+1] do
- begin print(so(str_pool[j])); incr(j);
- end;
-@y
-if (s<256)and(selector>pseudo) then print_char(s)
-else begin j:=str_start[s];
- while j<str_start[s+1] do
- begin print(so(str_pool[j])); incr(j);
- end;
- end;
-@z
-@x module 61
-else begin print(base_ident); print_ln;
-@y
-else begin slow_print(base_ident); print_ln;
-@z
-@x module 79
- print(input_stack[file_ptr].name_field);
-@y
- slow_print(input_stack[file_ptr].name_field);
-@z
-@x module 223
-print(r);
-@y
-slow_print(r);
-@z
-@x module 254
- print(int_name[q-(hash_end)]); print_char("=");
-@y
- slow_print(int_name[q-(hash_end)]); print_char("=");
-@z
-@x module 254 again
- print(text(q)); print_char("}");
-@y
- slow_print(text(q)); print_char("}");
-@z
-@x module 638
- if name<>null then print(text(name))
-@y
- if name<>null then slow_print(text(name))
-@z
-@x module 664
- if scanner_status=op_defining then print(text(warning_info))
-@y
- if scanner_status=op_defining then slow_print(text(warning_info))
-@z
-@x module 664 again
-loop_defining: begin print("the text of a "); print(text(warning_info));
-@y
-loop_defining: begin print("the text of a "); slow_print(text(warning_info));
-@z
-@x module 722
-begin if n<>null then print(text(n))
-@y
-begin if n<>null then slow_print(text(n))
-@z
-@x module 722 again
- if p=null then print(text(info(info(link(a)))))
-@y
- if p=null then slow_print(text(info(info(link(a)))))
-@z
-@x module 725
- print_nl(" Missing `"); print(text(r_delim));
-@y
- print_nl(" Missing `"); slow_print(text(r_delim));
-@z
-@x module 773
-begin print(a); print(n); print(e);
-@y
-begin slow_print(a); slow_print(n); slow_print(e);
-@z
-@x module 790
-print(base_ident); print(" ");
-@y
-slow_print(base_ident); print(" ");
-@z
-@x module 793
-print_char("("); incr(open_parens); print(name); update_terminal;
-@y
-print_char("("); incr(open_parens); slow_print(name); update_terminal;
-@z
-@x module 998
-if info(lhs)>hash_end then print(int_name[info(lhs)-(hash_end)])
-@y
-if info(lhs)>hash_end then slow_print(int_name[info(lhs)-(hash_end)])
-@z
-@x module 999
- print(int_name[info(lhs)-(hash_end)]);
-@y
- slow_print(int_name[info(lhs)-(hash_end)]);
-@z
-@x module 1032
-else begin print_err("The token `"); print(text(r_delim));
-@y
-else begin print_err("The token `"); slow_print(text(r_delim));
-@z
-@x module 1034
- else print(text(cur_sym));
-@y
- else slow_print(text(cur_sym));
-@z
-@x module 1041
-else begin print(text(cur_sym)); print_char("=");
-@y
-else begin slow_print(text(cur_sym)); print_char("=");
-@z
-@x module 1042
-else begin print_char(""""); print(cur_mod); print_char("""");
-@y
-else begin print_char(""""); slow_print(cur_mod); print_char("""");
-@z
-@x module 1043
- print("t delimiter that matches "); print(text(m));
-@y
- print("t delimiter that matches "); slow_print(text(m));
-@z
-@x module 1043 again
-internal_quantity:print(int_name[m]);
-@y
-internal_quantity:slow_print(int_name[m]);
-@z
-@x module 1134
-print_nl("Font metrics written on "); print(metric_file_name); print_char(".");
-@y
-print_nl("Font metrics written on "); slow_print(metric_file_name);
-print_char(".");
-@z
-@x module 1182
-print_nl("Output written on "); print(output_file_name);
-@y
-print_nl("Output written on "); slow_print(output_file_name);
-@z
-@x module 1200
-print(w_make_name_string(base_file)); flush_string(str_ptr-1);
-print_nl(base_ident)
-@y
-slow_print(w_make_name_string(base_file)); flush_string(str_ptr-1);
-print_nl(""); slow_print(base_ident)
-@z
-@x module 1205
- print(log_name); print_char(".");
-@y
- slow_print(log_name); print_char(".");
-@z
-@x module 1213
-10: print(n);
-@y
-10: slow_print(n);
-@z
-
------- The third printing of Volume D (October 1991) incorporated the above.
-
-559. Debugging routine never used since change 528; needed update then (JDH).
-@x module 617
- p:=dep_list(p); r:=hi_mem_min;
- repeat if info(p)>=r then
-@y
- p:=dep_list(p); r:=inf_val;
- repeat if value(info(p))>=value(r) then
-@z
-
-560. Corrections to blunders in change 550 (noted by B Jackowski, Jul 91).
-@x module 415 can use more paranoia even though no problems have occurred yet
-negate(left_y(qq)); negate(dest_y);@/
-@y
-negate(left_y(qq)); negate(dest_y);@/
-if x_coord(r)<x_coord(pp) then x_coord(r):=x_coord(pp)
-else if x_coord(r)>dest_x then x_coord(r):=dest_x;
-if left_x(r)>x_coord(r) then
- begin left_x(r):=x_coord(r);
- if right_x(pp)>x_coord(r) then right_x(pp):=x_coord(r);
- end;
-if right_x(r)<x_coord(r) then
- begin right_x(r):=x_coord(r);
- if left_x(qq)<x_coord(r) then left_x(qq):=x_coord(r);
- end;
-@z
-@x module 416 similarly
-negate(y_coord(s)); right_y(s):=y_coord(s);
-@y
-negate(y_coord(s)); right_y(s):=y_coord(s);
-if x_coord(s)<x_coord(r) then x_coord(s):=x_coord(r)
-else if x_coord(s)>dest_x then x_coord(s):=dest_x;
-if left_x(s)>x_coord(s) then
- begin left_x(s):=x_coord(s);
- if right_x(r)>x_coord(s) then right_x(r):=x_coord(s);
- end;
-if right_x(s)<x_coord(s) then
- begin right_x(s):=x_coord(s);
- if left_x(qq)<x_coord(s) then left_x(qq):=x_coord(s);
- end;
-@z
-@x module 424 similarly
-if x_coord(p)+y_coord(r)>dest_x+dest_y then
- begin y_coord(r):=dest_x+dest_y-x_coord(p);
- if left_y(r)>y_coord(r) then
- begin left_y(r):=y_coord(r);
- if right_y(p)>y_coord(r) then right_y(p):=y_coord(r);
- end;
- end;
-@y
-if y_coord(r)<y_coord(p) then y_coord(r):=y_coord(p)
-else if y_coord(r)>dest_y then y_coord(r):=dest_y;
-if x_coord(p)+y_coord(r)>dest_x+dest_y then
- y_coord(r):=dest_x+dest_y-x_coord(p);
-if left_y(r)>y_coord(r) then
- begin left_y(r):=y_coord(r);
- if right_y(p)>y_coord(r) then right_y(p):=y_coord(r);
- end;
-if right_y(r)<y_coord(r) then
- begin right_y(r):=y_coord(r);
- if left_y(q)<y_coord(r) then left_y(q):=y_coord(r);
- end;
-@z
-@x in module 424, here's the serious bug introduced in change #550.
-if right_y(r)>dest_y then right_y(r):=dest_y;
-if left_y(q)>dest_y then left_y(q):=dest_y
-else if left_y(q)<y_coord(r) then left_y(q):=y_coord(r);
-if right_y(r)>left_y(q) then right_y(r):=left_y(q);
-@y
-if right_y(r)<y_coord(r) then
- begin right_y(r):=y_coord(r);
- if left_y(q)<y_coord(r) then left_y(q):=y_coord(r);
- end;
-@z
-@x module 425 is analogous
-if x_coord(r)+y_coord(s)>dest_x+dest_y then
- begin y_coord(s):=dest_x+dest_y-x_coord(r);
- if left_y(s)>y_coord(s) then
- begin left_y(s):=y_coord(s);
- if right_y(r)>y_coord(s) then right_y(r):=y_coord(s);
- end;
- end;
-@y
-if y_coord(s)<y_coord(r) then y_coord(s):=y_coord(r)
-else if y_coord(s)>dest_y then y_coord(s):=dest_y;
-if x_coord(r)+y_coord(s)>dest_x+dest_y then
- y_coord(s):=dest_x+dest_y-x_coord(r);
-if left_y(s)>y_coord(s) then
- begin left_y(s):=y_coord(s);
- if right_y(r)>y_coord(s) then right_y(r):=y_coord(s);
- end;
-if right_y(s)<y_coord(s) then
- begin right_y(s):=y_coord(s);
- if left_y(q)<y_coord(s) then left_y(q):=y_coord(s);
- end;
-@z
-@x module 425, the analogous bug
-dest_y:=dest_y+dest_x;
-if right_y(s)>dest_y then right_y(s):=dest_y;
-if left_y(q)>dest_y then left_y(q):=dest_y
-else if left_y(q)<y_coord(s) then left_y(q):=y_coord(s);
-if right_y(s)>left_y(q) then right_y(s):=left_y(q);
-@y
-if right_y(s)<y_coord(s) then
- begin right_y(s):=y_coord(s);
- if left_y(q)<y_coord(s) then left_y(q):=y_coord(s);
- end;
-@z
-
-561. serious longstanding bug caused overflows and bad rounding (1 Mar 95)
-@x module 815
-begin if (max_c[dependent]>=fraction_one)or@|
- (max_c[dependent] div @'10000 >= max_c[proto_dependent]) then
-@y
-begin if (max_c[dependent] div @'10000 >=
- max_c[proto_dependent]) then
-@z
-
-562. final cleanup should not retain spurious reference counts (20 Mar 95)
-@x module 1209
-while open_parens>0 do
-@y
-while input_ptr>0 do
- if token_state then end_token_list@+else end_file_reading;
-while loop_ptr<>null do stop_iteration;
-while open_parens>0 do
-@z
-@x module 1209
- cur_if:=name_type(cond_ptr); cond_ptr:=link(cond_ptr);
-@y
- cur_if:=name_type(cond_ptr); loop_ptr:=cond_ptr;
- cond_ptr:=link(cond_ptr); free_node(loop_ptr,if_node_size);
-@z
-
-563. unprintable strings of length 1 need to be truly length 1 (27 Nov 95,
-pointed out by Ulrik Vieth)
-@x module 671
- if loc=k+1 then cur_mod:=buffer[k]
-@y
- if (loc=k+1) and (length(buffer[k])=1) then cur_mod:=buffer[k]
-@z
-
-564. minor improvement to pythagorean addition (22 Jan 97)
-@x module 124
-if a>0 then
-@y
-if b>0 then
-@z
-
-565. we need not raise hackles about two-digit years (23 Nov 98)
-@x module 1200
-print_int(round_unscaled(internal[year]) mod 100); print_char(".");
-@y
-print_int(round_unscaled(internal[year])); print_char(".");
-@z
-
-566. "this can't happen" can happen if coordinates are half vast
- (Julian Gilbey, January 2001)
-@x module 402
-@!chopped:boolean; {have we truncated any of the data?}
-@y
-@!chopped:integer; {positive if data truncated,
- negative if data dangerously large}
-@z
-@x module 402
-if internal[autorounding]>0 then xy_round;
-octant_subdivide; {complete the subdivision}
-if internal[autorounding]>unity then diag_round;
-@<Remove dead cubics@>;
-@<Insert octant boundaries and compute the turning number@>;
-while left_type(cur_spec)<>endpoint do cur_spec:=link(cur_spec);
-if tracing>0 then
- if internal[autorounding]<=0 then print_spec(", after subdivision")
-@y
-if (internal[autorounding]>0)and(chopped=0) then xy_round;
-octant_subdivide; {complete the subdivision}
-if (internal[autorounding]>unity)and(chopped=0) then diag_round;
-@<Remove dead cubics@>;
-@<Insert octant boundaries and compute the turning number@>;
-while left_type(cur_spec)<>endpoint do cur_spec:=link(cur_spec);
-if tracing>0 then
- if (internal[autorounding]<=0)or(chopped<>0) then
- print_spec(", after subdivision")
-@z
-@x module 404
-@d procrustes(#)==if abs(#)>max_allowed then
- begin chopped:=true;
- if #>0 then #:=max_allowed@+else #:=-max_allowed;
- end
-
-@<Truncate the values of all coordinates that exceed...@>=
-p:=cur_spec; k:=1; chopped:=false;
-@y
-@d procrustes(#)==if abs(#)>=dmax then
- if abs(#)>max_allowed then
- begin chopped:=1;
- if #>0 then #:=max_allowed@+else #:=-max_allowed;
- end
- else if chopped=0 then chopped:=-1
-
-@<Truncate the values of all coordinates that exceed...@>=
-p:=cur_spec; k:=1; chopped:=0; dmax:=half(max_allowed);
-@z
-@x module 404
-if chopped then
-@y
-if chopped>0 then
-@z
-
-567. I forgot to update curtype in e.g. boolean b[]; b1=true=b2;
- (Thorsten Dahlheimer, June 2004)
-@x 1003
- begin nonlinear_eq(v,cur_exp,false); goto done;
-@y
- begin nonlinear_eq(v,cur_exp,false); unstash_cur_exp(cur_exp); goto done;
-@z
-
-568. Wrong handling of extreme TFM values (T. Dahlheimer, June 2004)
-@x 1128
-max_tfm_dimen:=16*internal[design_size]-internal[design_size] div @'10000000;
-@y
-max_tfm_dimen:=16*internal[design_size]-1-internal[design_size] div @'10000000;
-@z
-@x 1129
- if x>0 then x:=three_bytes-1@+else x:=1-three_bytes;
- end
-else x:=make_scaled(x*16,internal[design_size]);
-@y
- if x>0 then x:=max_tfm_param@+else x:=-max_tfm_param;
- end;
-x:=make_scaled(x*16,internal[design_size]);
-@z
-
-569. Bug in make_ellipse when theta=180 (T. Dahlheimer, June 2004)
-@x 530
- else begin beta:=minor_axis; gamma:=major_axis;
-@y
- else begin beta:=minor_axis; gamma:=major_axis; theta:=0;
-@z
-
-570. Forgot outer_tag in scan_declared variable (T. Dahlheimer, June 2004)
-@x 1011
-done: if eq_type(x)<>tag_token then clear_symbol(x,false);
-@y
-done: if eq_type(x) mod outer_tag<>tag_token then clear_symbol(x,false);
-@z
-
-571. Apparent bug if init_gf called at incredibly unlikely time (T. Dahlheimer,
-June 2004); not REALLY a bug, because str_ptr cannot equal max_strings here
-(because this was checked by end_name, and area_delimiter=0 there because
-cur_area="" in the output file name); but anyway I'll make a patch to be clean
-@x 1163
-str_start[str_ptr+1]:=pool_ptr; gf_string(0,str_ptr);
-@y
-gf_string(0,make_string); decr(str_ptr);
-@z
-
-572. Memory leak in make_ellipse on symmetric pens that don't have
-a point on the x-axis (Eberhard Mattes, 03 June 2008)
-@x module 536
-done1: link(p):=s; beta:=-y_coord(h);
-@y
-done1: if (link(p)<>null) then free_node(link(p),knot_node_size);
-link(p):=s; beta:=-y_coord(h);
-@z
-
-573. Don't restrict the length of the banner line, leave it system-dependent code
-(Udo Wermuth, 02 April 2017)
-@x module 61
-incorrect, but the discrepancy is not serious since we assume that the banner
-and base identifier together will occupy at most |max_print_line|
-character positions.
-@y
-incorrect, but the discrepancy is not serious since we assume that this
-part of the program is system dependent.
-@^system dependencies@>
-@z
-
-574. Defeat interactions during batch mode (Xiaosa Zhang, 27 June 2020)
-@x module 78
-@ @<Get user's advice...@>=
-loop@+begin continue: clear_for_error_prompt; prompt_input("? ");
-@y
-@ @<Get user's advice...@>=
-loop@+begin continue: if interaction<>error_stop_mode then return;
- clear_for_error_prompt; prompt_input("? ");
-@z
-
-575. Don't exit to editor if no input file is at the bottom line
-(Xiaosa Zhang, 03 July 2020)
-@x module 79
-"E": if file_ptr>0 then
-@y
-"E": if file_ptr>0 then if input_stack[file_ptr].name_field>=256 then
-@z
-@x module 80
-if file_ptr>0 then print("E to edit your file,");
-@y
-if file_ptr>0 then if input_stack[file_ptr].name_field>=256 then
- print("E to edit your file,");
-@z
-
-576. Keep date and time in system variables, use them in opening banner
-(Udo Wermuth, 11 December 2020)
-@x module 194
-Since standard \PASCAL\ cannot provide such information, something special
-is needed. The program here simply specifies July 4, 1776, at noon; but
-users probably want a better approximation to the truth.
-
-Note that the values are |scaled| integers. Hence \MF\ can no longer
-be used after the year 32767.
-
-@p procedure fix_date_and_time;
-begin internal[time]:=12*60*unity; {minutes since midnight}
-internal[day]:=4*unity; {fourth day of the month}
-internal[month]:=7*unity; {seventh month of the year}
-internal[year]:=1776*unity; {Anno Domini}
-end;
-@y
-Since standard \PASCAL\ cannot provide such information, something special
-is needed. The program here simply assumes that suitable values appear in
-the global variables \\{sys\_time}, \\{sys\_day}, \\{sys\_month}, and
-\\{sys\_year} (which are initialized to noon on 4 July 1776,
-in case the implementor is careless).
-
-Note that the values are |scaled| integers. Hence \MF\ can no longer
-be used after the year 32767.
-
-@p procedure fix_date_and_time;
-begin sys_time:=12*60;
-sys_day:=4; sys_month:=7; sys_year:=1776; {self-evident truths}
-internal[time]:=sys_time*unity; {minutes since midnight}
-internal[day]:=sys_day*unity; {day of the month}
-internal[month]:=sys_month*unity; {month of the year}
-internal[year]:=sys_year*unity; {Anno Domini}
-end;
-@z
-@x module 196
-@ Of course we had better declare another global variable, if the previous
-routines are going to work.
-
-@<Glob...@>=
-@!old_setting:0..max_selector;
-@y
-@ Of course we had better declare a few more global variables, if the previous
-routines are going to work.
-
-@<Glob...@>=
-@!old_setting:0..max_selector;
-@!sys_time,@!sys_day,@!sys_month,@!sys_year:integer;
- {date and time supplied by external system}
-@z
-@x module 790
-print_int(round_unscaled(internal[day])); print_char(" ");
-months:='JANFEBMARAPRMAYJUNJULAUGSEPOCTNOVDEC';
-m:=round_unscaled(internal[month]);
-for k:=3*m-2 to 3*m do wlog(months[k]);
-print_char(" "); print_int(round_unscaled(internal[year])); print_char(" ");
-m:=round_unscaled(internal[time]);
-print_dd(m div 60); print_char(":"); print_dd(m mod 60);
-@y
-print_int(sys_day); print_char(" ");
-months:='JANFEBMARAPRMAYJUNJULAUGSEPOCTNOVDEC';
-for k:=3*sys_month-2 to 3*sys_month do wlog(months[k]);
-print_char(" "); print_int(sys_year); print_char(" ");
-print_dd(sys_time div 60); print_char(":"); print_dd(sys_time mod 60);
-@z
-@x module 1211
-fix_date_and_time; init_randoms((internal[time] div unity)+internal[day]);@/
-@y
-fix_date_and_time; init_randoms(sys_time+sys_day*unity);@/
-@z
-
--------------
-999. The absolutely final change (to be made after my death)
-@x module 2
-@d banner=='This is METAFONT, Version 2.71828182' {printed when \MF\ starts}
-@y
-@d banner=='This is METAFONT, Version $e$' {printed when \MF\ starts}
-@z
-When this change is made, the corresponding line should be changed in
-Volume D, and also on page 31 of The METAFONTbook.
-My last will and testament for METAFONT is that no further changes be made
-under any circumstances. Improved systems should not be called simply
-`METAFONT'; that name, unqualified, should refer only to the program for which
-I have taken personal responsibility. -- Don Knuth
diff --git a/Master/texmf-dist/doc/generic/knuth/errata/tex82.bug b/Master/texmf-dist/doc/generic/knuth/errata/tex82.bug
deleted file mode 100644
index 12de105bae8..00000000000
--- a/Master/texmf-dist/doc/generic/knuth/errata/tex82.bug
+++ /dev/null
@@ -1,9279 +0,0 @@
-This file has been updated periodically ever since TeX82 was born;
-it has been summarized in "The errors of TeX," Software Practice &
-Experience, July 1989. Entries are in chronological order;
-thus the most recent news (including all bugfixes made since
-that article was published) appears at the bottom of the file.
-
-[Add 519 to these entry numbers to get the corresponding number in
-the published article. The article also translates all module
-numbers to their final form; what you are about to read is
-"authentic source material" from the early days before TeX converged.]
-
--------------------------------------------------------------------------------
-
-First updates to the TeX82 listing published in September, 1982.
-(These changes were included in the original Version 0 of TeX, but they
-were discovered after the listing went to press.)
-
-1. Module 943, line 6 (bug discovered 9/28)
-change "if cur_cmd=char_num then" to
- if (cur_cmd=letter) or (cur_cmd=other_char) then r:=qi(cur_chr)
- else if cur_cmd=char_num then
-
-2. "pause" changed to "pausing" and "pause_code" to "pausing code", throughout.
-
-3. Module 719, lines 8 and 11 (bug discovered 9/28)
-insert "rule_save:=overfull_rule; overfull_rule:=0;" after "save_ptr-2;"
-insert "overfull_rule:=rule_save;" before "q:=p+list_offset;"
-and insert a declaration of "overfull_rule: scaled" in module 716.
-
-4. Module 1128, lines 6 and following (bug discovered 9/28)
-change "while n<>0 do" to "loop"
-change "goto done" to
- begin scan_left_brace; new_save_level(false_group);
- goto done;
- end
-change "... return 1130>;" to
- ... return 1130>
- else if n=0 then
- begin new_save_level(case_group); goto done;
- end;
-and change "done: ... (false_group);" to "done:".
-
-5. Module 182, line 10 (suggestion by DRF on 9/30)
-change "0.0" to "?.?"
-
-6. Module 682, new definition of math_spacing (decision of 10/2)
-"0234000122*4000133**3**344*0400400*000000234000111*4111112341011"
-
-7. Module 684, new code for case "4" (decision of 10/2)
-"4": if cur_style<script_style then x:=thick_mu_skip_code else x:=0;
-[Also in module 682 line 7, say "...a conditional thick space (\nonscript..."]
-
-8. Module 11, trie_size changed from 7000 to 8000 because of new
-improved (but longer) hyphenation patterns (10/4)
-
-9. Module 453, forgot to change this when 454 changed (noted by DRF 10/6)
-format_default_length=20 (not 22)
-format_area_length=11 (not 13)
-
- Changes to TEX.WEB made after Version 0 was released in October, 1982.
-
-Since copies of TEX.WEB are not supposed to be edited, there are
-two ways to make your version of TeX bug-free:
- 1. Get a new copy of TEX.WEB.
- 2. Put the corrections into your change file(s).
-Some people will find (1) easier than (2), except the main TeX sources at
-SCORE won't be updated quite as fast as the sources at SAIL (which have to
-be translated into ascii before they are sent to the outside world).
-Actually (2) will be quite easy, unless the list of changes becomes quite
-long, so it is the recommended procedure. In case (2) it would be useful
-to include a comment like "this is fix number xx" (using the numbering
-scheme in this file), so that the change could readily be deleted at some
-future time.
-
-10. Module 857 line -5 (bug discovered 10/8/82 by HWT)
-change it to: if h>0 then decr(h) else h:=trie_op_hash_size;
-
-11. Module 457 line 3 (typo discovered 10/9/82)
-change `\.!' to `\.\&'
-
-12. Module 1245 line 8 (bug fixed 10/9/82, discovered by MMD)
-insert the following between "begin" and "if":
-if format_ident<>0 then initialize; {erase preloaded format}
-
-** Version 0.1 incorporates the above changes.
-
-13. This is an extension to the language, put in to satisfy people who
-objected to the fact that \write (and \openout and \closeout) only
-caused action after being deferred to the next \shipout. Some applications
-call for immediate output, hence a new feature: \immediate followed by
-\openout or \write or \closeout causes the output action to take place
-without delay. For example, \immediate\write{x} is equivalent to
-\shipout\vbox{\write{x}} except that the latter also puts an empty
-page into the DVI file.
-
-The extension requires the following new code:
-13a. Insert `\immediate' after `\closeout' in module 1248.
-13b. Define immediate_code=4 and include the following in module 1252:
- primitive("immediate",extension,immediate_code);
-13c. Include the following in module 1254:
- immediate_code:print_esc("immediate");
-13d. And, in module 1256:
- immediate_code:@<Implement \.{\\immediate}@>;
-13e. Finally, there's a new module inserted after old module 1280.
-Here is the WEB coding for this module:
-
-@ The presence of `\.{\\immediate}' causes the |do_extension| procedure
-to descend to one level of recursion. Nothing happens unless \.{\\immediate}
-is followed by `\.{\\openout}', `\.{\\write}', or `\.{\\closeout}'.
-@^recursion@>
-
-@<Implement \.{\\immediate}@>=
-begin get_nc_token;
-if (cur_cmd=extension)and(cur_chr<=close_node) then
- begin p:=tail; do_extension; {append a whatsit node}
- out_what(tail); {do the action immediately}
- flush_node_list(tail); tail:=p; link(p):=null;
- end
-else back_input;
-end;
-
-** Version 0.2 incorporates the above changes.
-
-14. Like change 11, this one doesn't affect the program, it just improves
-the documentation: Insert the following definitions in module 106:
-define set_glue_ratio_zero(#) == #:=0.0 {assign representation of zero ratio}
-define set_glue_ratio_one(#) == #:=1.0 {assign representation of unit ratio}
-
-These macros are now introduced in a dozen or so future modules, thereby
-eliminating most of the system-dependent changes needed elsewhere for ratios.
-(Note: I also changed 0 to 0.0 in two places of module 182, where a glue_ratio
-comparision was being made.)
-
-15. Change of module 576 (discovered by HWT, 10/14/82)
-"hd:quarterword" should be "hd:eight_bits".
-(The same error occurs in module 522, but in that module the remedy is
-simply to delete the declaration of hd, since this variable is no longer used.)
-
-16. A most embarrassing bug (discovered by DRF, 10/14/82)
-Replace module 531 by:
-
-@ A mild optimization of the output is performed by the |dvi_pop|
-routine, which issues a |pop| unless it is possible to cancel a
-`|push| |pop|' pair. The parameter to |dvi_pop| is the byte address
-following the old |push| that matches the new |pop|.
-
-@p procedure dvi_pop(@!l:integer);
-begin if (l=dvi_offset+dvi_ptr)and(dvi_ptr>0) then decr(dvi_ptr)
-else dvi_out(pop);
-end;
-
-Now we need to make a few changes to subsequent modules:
-16a. In 549, after "incr(cur_s)", insert
- if cur_s>0 then dvi_out(push);
-and before "decr(cur_s)", insert
- if cur_s>0 then dvi_pop(save_loc);
-
-16b. Delete "dvi_out(push);" and "dvi_pop;" from modules 553, 558, 562, 567.
-
-16c. Change module 559 just as in 16a.
-
-17. Module 605, line 6 (discovered 10/15/82)
-The test should be "prev_depth>ignore_depth"
-
-** Version 0.3 incorporates the above changes.
-
-18. Module 11 (noticed by WLS, 10/16/82)
-Delete the definition of align_size (it's harmless but never used)
-
-19. (This change and the next cause major changes to the TRIP output;
-file TRIP.LOG and its relatives are being kept up to date on area [tug,dek].)
-The change avoids error messages when vpackage is called during output.
-Such messages can occur when there was no error, because the page is being
-boxed without the \skip glue from its insertions; so they should be omitted.
-The user who really wants such messages can still get them by saying
-"\setbox255=\vbox to 1ht255{\unbox255}".
-In module 903, insert the followng before the declaration of "wait":
- save_vbadness:integer; {saved value of |vbadness|}
- save_vfuzz: scaled; {saved value of |vfuzz|}
-Then in module 924, insert
- save_vbadness:=vbadness; vbadness:=inf_bad;
- save_vfuzz:=vfuzz; vfuzz:=max_dimen; {inhibit error messages}
-before the call on vpackage, and
- vbadness:=save_vbadness; vfuzz:=save_vfuzz;
-after.
-
-20. Module 917 computes |page_size| improperly. (Noticed 10/21/82)
-Delete the statement "page_so_far[1]:=page_so_far[1]+width(q);"
-and change the preceding statement to:
- page_size:=page_size-h-width(q);
-(The comment about page_so_far in the first paragraph of module 895 is
-correct; I mistakenly introduced a bug in module 917 some months after
-writing the first draft of the code, believing that I was making the
-algorithm more elegant or something.)
-
-** Version 0.4 incorporates the above changes.
-
-21. Since TeX82 applied to (the "woven" documentation) TEX.TEX uses
-about 11500 words of variable-size memory, I'm increasing hi_mem_size
-(in module 12) from 12000 to 13000. Actually, I recommend using considerably
-larger values for mem_max and hi_mem_size, whenever possible.
-
-22. Addition of the \boxmaxdepth parameter (10/22/82):
-This involves renumbering hfuzz_code through dimen_pars, in module 234,
-to numbers 9 through 18; inserting the lines
- @d box_max_depth_code=8 {maximum depth of explicit vboxes}
- @d box_max_depth==dimen_par(box_max_depth_code)
- box_max_depth_code:print_esc("boxmaxdepth");
-to module 234 and
- primitive("boxmaxdepth",assign_dimen,box_max_depth_code);
-to module 235; and changing the call on vpack in module 996 to
- vpackage(link(head),saved(2),saved(1),box_max_depth);
-
-** Version 0.5 incorporates the above changes.
-
-23. Module 1224, line 4 (bug found by GMK/HWT on 10/26/82)
-change "(k+x>eqtb_size)" to "(k+x>eqtb_size+1)"
-
-24. Module 247, line 13 (bug found 10/26/82)
-(bug was reflected in TRIP.LOG but not noticed)
-change "ch_code(p)" to "ch_code(p-single_base)"
-
-25. Module 670, line 18 (bug found 10/27/82)
-interchange the statements "fetch(...)" and "math_type(...):=..."
-(since the fetch routine sometimes has a side-effect of changing math_type)
- A major change (Version 0.6) made on October 28:
-The following list of changes counts as "number 26" on the list.
-Fonts now have identifiers instead of code numbers; the "\:" primitive
-has disappeared; and there are associated new features for "\the".
-
-a. In module 11, delete bad_font_code.
-b. In modules 170 and 172, delete print_esc(":"), and change
- `print_int(font_code' to `sprint_cs(font_ident'.
-c. In module 205, the comment for set_font is revised.
-d. In module 217, there are now five locations for control sequences
- that are perpetually defined; undefined_control_sequence
- is therefore defined to be frozen_control_sequence+5.
-e. In module 248, sprint_cs is now included among <Basic printing procedures>.
-f. Delete the primitive ":" in modules 250 and 251.
-g. Add to module 376: <Declare procedures that scan font-related stuff>
-h. In module 377, seven levels are now distinguished; we define
- font_val=4, ident_val=5, tok_val=6.
-i. In module 380, delete the previous cases for def_family and set_font,
- and the following takes the place of case assign_toks:
- assign_toks,def_family,set_font,def_font: <Fetch a token list or
- font number or font identifier, provided that level=tok_val>;
-j. Module 382 (which now has a new name) has this new ending:
- else if cur_cmd=assign_toks then scanned_result(equiv(m))(tok_val)
- else <Fetch a font number or a font identifier>
-k. Module 389 becomes
- <Fetch a font number or a font identifier>=
- if cur_cmd=set_font then scanned_result(cur_chr)(font_val)
- else if cur_cmd=def_font then
- scanned_result(font_ident[cur_font])(ident_val)
- else begin scan_four_bit_int;
- scanned_result(font_ident[equiv(m+cur_val)])(ident_val);
- end
-l. In module 393, the relation `<>tok_val' becomes `<=mu_val'.
-m. In module 426, the relation `=tok_val' becomes '>=ident_val'.
- Also add a new case to the case statement:
- font_val: begin print(font_name[cur_val]);
- if font_size[cur_val]<>font_dsize[cur_val] then
- begin print(" at "); print_scaled(font_size[cur_val]);
- print("pt");
- end;
- end;
-n. The body of module 427 becomes:
- begin p:=temp_head; link(p):=null;
- if cur_val_level=ident_val then store_new_token(cs_token_flag+cur_val)
- else if cur_val<>null then
- begin r:=link(cur_val); {do not copy the reference count}
- while r<>null do
- begin store_new_token(info(r)); r:=link(r);
- end;
- end;
- the_toks:=p;
- end
-o. In module 480, delete user_font_code; there's a new comment:
- When the user defines \font\f, say, TeX assigns an internal number
- to the user's font \f. For example, if this internal number is 13,
- we will have font_ident[13]=p and equiv(p)=13, where p is the eqtb
- location of the control sequence \f.
-p. In module 481, delete the declaration of font_number, and
- replace the declaration of font_code by
- font_ident:array[internal_font_number] of pointer;
-q. New stuff in module 483 (also delete references to font_number, font_code):
- define bad_font_ident=frozen_control_sequence+4 {denotes a null font}
- font_name[undefined_font]:="nullfont";
- font_ident[undefined_font]:=bad_font_ident;
- text(bad_font_ident):="nullfont"; eq_level(bad_font_ident):=level_one;
- eq_type(bad_font_ident):=set_font;
- equiv(bad_font_ident):=undefined_font;
-r. In module 490, parameter u is new of type pointer, and the
- read_font_info subroutine is changed to a function that
- returns an internal_font_number. There's a new local variable
- g:internal_font_namber; {the number to return}
- and we set g:=undefined_font immediately upon entering read_font_info.
- Also set read_font_info:=g just before exiting.
-s. In module 491, print_int(u) becomes sprint_cs(u).
-t. Delete the statements involving font_code and font_number in module 506,
- and set g:=f at the end of that module.
-u. The body of module 507 becomes:
- <Declare procedures that scan font-related stuff>=
- procedure scan_font_ident;
- var f:internal_font_number;
- begin <Get the next non-blank non-call...>;
- if cur_cmd=set_font then f:=cur_chr
- else begin print_nl("! Missing font identifier");
- help2("I was looking for a control sequence whose")
- ("current meaning has been defined by \font.");
- back_error; f:=undefined_font;
- end;
- end;
-v. New beginning of module 508:
- The following routine is used to implement `\texinfo f n'.
- The boolean parameter writing is set true if the calling program
- intends to change the parameter value.
- <Declare procedures that scan font-related stuff>=
-and "scan_font_number" is changed to "scan_font_ident".
-w. In module 509, "print_int(font_code" becomes "sprint_cs(font_ident".
- Also "font code is defined" becomes "\font is loaded" in the help.
-x. In module 940, the first line of help is changed to
- "You have to specify a font identifier,"
-y. The set_font case in module 1138 reduces to
- set_font: define(cur_font_loc,data,cur_chr);
-z. In module 1153, delete all the complicated stuff starting with "scan_int"
- and substitute simply this:
- scan_font_ident; define(p,data,cur_val);
- end;
-aa. Change new_font to new_font(a) in module 1169, and add parameter
- (a:small_number)
- in module 1170. Also add the label common_ending, and declare
- variable u to have type pointer. The code beginning with "scan_int"
- is changed to the following:
- get_token;
- if cs_ptr=0 then
- <Complain about the missing control sequence and return>;
- u:=cs_ptr; scan_optional_equals; scan_file_name;
- <Scan the ``at'' size specification>;
- <If this font has already been loaded, set f to the internal
- font number and goto common_ending>;
- f:=read_font_info(u,cur_name,cur_area,s);
- common_ending: define(u,set_font,f); font_ident[f]:=u;
- exit:end;
-bb. New module 1172:
- When the user gives a new identifier to a font that was previously
- loaded, the new value becomes the font_ident of record.
- Font names `xyz' and `XYZ' are considered to be different.
- <If this font has already been loaded...>=
- for f:=font_base+1 to font_ptr do
- if [the test previously in module 1174] then goto common_ending
-cc. New module 1173:
- <Complain about the missing control sequence and return>=
- begin print_nl("! A font identifier must be a control sequence");
- help2("You should say, e.g., `\font\f=fontfilename'.")
- ("(I'm going to ignore the \font command you just gave.)");
- back_error; return;
- end
-dd. New module 1174:
- <Cases of print_cmd_chr...>=
- set_font:begin print("select font "); print(font_name[chr_code]);
- if font_size[chr_code]<>font_dsize[chr_code] then
- begin print(" at "); print_scaled(font_size[chr_code]);
- print("pt");
- end;
- end;
-ee. Delete the comment at the beginning of module 1227, and delete the
- loop for k:=0 to bad_font_code-1, and delete dump_int(undefined_font).
-ff. Delete the repeat loop in module 1228.
-gg. Change font_code to font_ident in module 1229, and change
- print_int(font_code to sprint_int(font_ident.
-hh. In module 1230,
- begin undump(single_base)(undefined_control_sequence)(font_ident[k]);
- undump_qqqq(font_check[k]); [and continue as before]
-
-The changes above have been incorporated into Version 0.6.
- The ill-fated Version 0.7
-
-27. (Here's a change that I retracted shortly after making it, since I
-discovered that the source was flaky after all; and I also found a reliable
-source [NBS Circular 570] confirming my original information. I include
-the note here only for historical purposes...)
-
-"After years of searching, I've finally found a definitive definition of
-the printer's point; and (unfortunately) my previous conjecture was wrong.
-The truth is that 83pc=35cm, exactly; so I am changing TeX to conform.
-This means some changes in the comments of modules 101 and 517, and the
-following changes to the program:
-
-"27a. In modules 547 and 571, the appropriate DVI numbers are now:
- dvi_four(109375); dvi_four(2039808); {conversion ratio for sp}
-"27b. The guts of module 418 become:
- if scan_keyword("in") then set_conversion(63246)(875)
- else if scan_keyword("pc") then set_conversion(12)(1)
- else if scan_keyword("cm") then set_conversion(996)(35)
- else if scan_keyword("mm") then set_conversion(498)(175)
- else if scan_keyword("bp") then set_conversion(10541)(10500)
- else if scan_keyword("dd") then set_conversion(996)(931)
- else if scan_keyword("cc") then set_conversion(11952)(931)
- else..."
-
-*** Version 0.7 of TeX incorporated the changes above (82/10/30);
-this version was withdrawn on 82/11/2.
- Changes subsequent to Version 0.6
-
-28. The experience with #27 did lead me to one improvement, thanks
-to Chuck Bigelow, with respect to Didot points. (11/4/82)
-Add the following comment to module 418:
- According to the definitions here, $\rm2660\,dd\approx1000.33297\,mm$;
- this agrees well with the value $\rm1000.333/,mm$ cited by Bosshard
- in {\sl Technische Grundlagen zur Satzherstellung\/} (Bern, 1980).
-And change two lines of the code there as follows:
- else if scan_keyword("dd") then set_conversion(1238)(1157)
- else if scan_keyword("cc") then set_conversion(14856)(1157)
-
-29. The new font material is made more robust by ensuring that \the\font
-always returns a pointer to a control sequence whose command code is
-set_font. (Change 11/4/82)
-
-29a. The code changed in 26aa is changed again, to the following:
- <If the next token isn't a control sequence, issue a complaint and
- return; otherwise set u:=cs_ptr, and set hash_used to the
- location of a ``frozen'' copy of the new font identifier>;
- define(u,set_font,undefined_font);
- scan_optional_equals; scan_file_name;
- <Scan the ``at'' size specification>;
- <If this font has already been loaded, set f to the internal
- font number and goto common_ending>;
- f:=read_font_info(u,cur_name,cur_area,s);
- common_ending: equiv(u):=f; geq_define(hash_used,set_font,f);
- font_ident[f]:=hash_used;
- exit:end;
-29b. Instead of 26cc, here's the new module 1173:
- We reserve a special control sequence for the font identifier;
- this one cannot be redefined by the user, so it is safe to
- return it as a value of \the\font.
- <If the next token isn't a control sequence...>=
- get_token;
- if cs_ptr<hash_base then
- begin print_nl(
- "! A font identifier must be a multiletter control sequence");
- help2("You should say, e.g., `\font\ffn=fontfilename'.")
- ("(I'm going to ignore the \font command you just gave.)");
- back_error; return;
- end;
- repeat if hash_is_full then overflow("hash size",hash_size);
- decr(hash_used);
- until text(hash_used)=0; {search for an empty location in hash}
- u:=cs_ptr; text(hash_used):=text(u); {copy the name}
- stat incr(cs_count); tats
-
-30. Module 993, replace lines 5 to 7 (11/5/82):
-else begin if k=vmode then new_save_level(vbox_group)
- else begin new_save_level(vtop_group); k:=vmode;
- end;
- if looseness<>0 then eq_word_define(int_base+looseness_code,0);
- if hanging_indent<>0 then
- eq_word_define(dimen_base+hanging_indent_code,0);
- if par_shape_ptr<>null then eq_define(par_shape_loc,shape_ref,null);
- end;
-
-31. Module 403, replace line 5 (11/6/82):
-if cur_tok<cs_token_flag then
- begin cur_val:=cur_chr;
- if cur_cmd<=right_brace then
- if cur_cmd=right_brace then incr(align_state)
- else decr(align_state);
- end
-
-32. Improvements to error recovery for bad alignments (11/6/82):
-In module 1039, replace "begin align_error; goto reswitch; end" by "align_error"
-In module 1040, delete "cur_cmd:=left_brace;" and "cur_cmd:=right_brace;"
- and change "error" to "back_error"
-In module 1041, delete "cur_cmd:=relax;"
-
-33. More power to \let (11/8/82):
-33a. Module 1141 becomes:
- <Assignments>+=
- let: begin get_token;
- if cs_ptr<>0 then <Carry out the \let operation>
- else begin print_nl
- ("! You can use \let only with control sequences");
- help2("I'm not \let-ting anything change here,")
- ("since I can only do things like `\let\a=b'.");
- back_error;
- end;
- end;
-33b. Module 1142 becomes:
- <Carry out the \let...>=
- begin p:=cs_ptr;
- repeat get_token;
- until cur_cmd<>spacer;
- if cur_tok=other_token+"=" then
- begin get_token;
- if cur_cmd=spacer then get_token;
- end;
- if cur_cmd>=call then add_token_ref(cur_chr);
- define(p,cur_cmd,cur_chr);
- end
-
-34. This change helps you see an undefined control sequence
-in certain unusual cases (discovered by JDH, 11/8/82):
-Add the clause "(base_ptr=input_ptr) or" to module 294, line 2.
-
-35. Here's an improvement in the formula for demerits; previously
-more weight was given to minimizing bad spacing on lines with penalties,
-so that (slightly loose hyphenated line)(OK line) was considered worse
-than (OK hyphenated line)(quite loose line). (fixed 11/8/82)
-Change lines 2--7 of module 772 to the following:
- d:=line_penalty+b; d:=d*d;
- if pi<>0 then
- if pi>0 then d:=d+pi*pi
- else if pi>eject_penalty then d:=d-pi*pi;
-
-36. Minor change to save buffer space in non-INITEX (11/10/82):
-Enclose the declaration of pool_file in module 50 by init...tini.
-
-37. Minor improvement in format for the context of error messages (11/13/82):
-37a. Module 289, type "inserted" split into "backed_up=3", "inserted=4"
-and the other type numbers increase: "macro=5", etc.
-37b. In module 296, backed_up: if loc=null then print_nl("<recently read>")
- else print_nl("<to be read again> ");
- inserted: print_nl("<inserted text> ");
-37c. Minor changes to comments in modules 289 and 293.
-37d. Change "inserted" to "backed_up" in module 294.
-37e. Add definition "back_list(#)==begin_token_list(#,backed_up)" in module 305.
-37f. In module 306, first test should be ">=backed_up", second "<=inserted".
-37g. Change ins_list to back_list in modules 307, 318, 375, 1195.
-37h. Add definition to module 308:
- ins_error==begin back_error; token_type:=inserted; end
-37i. Change back_error to ins_error in modules 362, 1040, 1046.
-37j. Change "<to be read again>" to "<inserted text>" in module 973 help.
-
-38. Module 407, the error message is changed (11/11/82) to:
-"! Missing number, treated as zero".
-
-39. Fix anomaly when hbadness or vbadness is small (11/11/82):
-Module 593, line 2, "if (-x-total_shrink[normal]>hfuzz) or (hbadness<100)"
-Module 603, line 2, "if (-x-total_shrink[normal]>vfuzz) or (vbadness<100)"
-
-40. Added the \tokens primitive (11/13/82):
-In module 223, defined tokens_loc and tokens (analogous to every_par).
-In module 225, defined the primitive.
-In module 1146, changed the comment to include tokens_loc as a possibility.
-
-41. Change get_nc_token to get_token in module 374 (11/13/82).
-(In particular \def\foo{...}\foo won't say "undefined c.s." now!)
-(This change later retracted during debugging; it was found that
-"endv" aborts the job, so this cure was worse than the disease. Then
-it was re-established as part of the major change to conditionals,
-because endv needed to be more robust anyway.)
-
-42. In module 699, we make \span expand in a preamble (11/13/82).
-Change lines -7 through -3 to:
- begin get_nc_token; goto reswitch;
- end;
-
-43. Modules 321 and 322 have been altered for better efficiency (11/12/82)
-and better exposition; the three conditions of module 322 are now
-in separate if tests.
-
-44. Frozen control sequences are now unredefinable. (11/16/82)
-A new procedure get_r_token has been introduced to give uniform error
-messages for \def, \let, \read, \font, \mathchardef, and to make them
-incapable of changing the frozen equivalents.
-
-Incidentally, get_nc_token is changed to get_x_token; and ch_code
-becomes cat_code.
- A major change (Version 0.8) made on November 14--16:
-Conditional statements are taken from semantics to syntax.
-
-This change, which counts as number 45 on the list, made it necessary
-to renumber the modules. And it was such a drastic change, the
-differences can only be sketched here, using the old module numbers
-for reference. A variety of other things were cleaned up because this
-change made it more natural for them to be handled differently.
-
-45a. Module 158, inserted a permanently empty token list called null_list.
-45b. Module 204, deleted if_test, case_branch, else_code, convert;
- inserted end_cs_name.
-45c. Module 206, inserted if_test, fi_or_else, cs_name, convert, and
- end_template (the latter comes after long_outer_call).
-45d. Module 217, there are now nine frozen control sequences; also null_cs.
-45e. Modules 247 and 248, must be able to print a null control sequence.
-45f. Module 268 (leave_transparent_group) disappears; comments in the
- previous modules also are appropriately simplified.
-45g. Module 273, delete endv_token.
-45h. Modules 277 and 278, delete references to endv (it no longer appears).
-45i. After module 281, a procedure show_cur_cmd_chr takes the
- code for tracing commands from module 937.
-45j. Module 317 now forbids \outer control sequences when skipping,
- and inserts \fi in front of them, for error recovery.
-45k. Module 334 now uses null_cs if carriage-return is an escape.
-45l. Module 343 no longer has endv test.
-45m. Module 344, major extensions to expand_calls make it several modules
- longer. It saves global variables like cur_val. It changes
- end_template to endv. It processes cs_name and convert.
- It processes if_test by calling the "conditional" procedure.
- It processes fi_or_else by checking their legality, and (if legal)
- updating the if stack.
-45n. Module 373 (pass_block) disappears.
-45o. After module 400, radix and cur_val and cur_val_level are initialized.
-45p. Module 428 changes so that conv_toks is a procedure rather than a
- function; this procedure is invoked by expand_calls.
-45q. Modules 436 and 1032, delete reference to conv_toks.
-45r. After module 443, the entire part 48 moves to this part of the program,
- and the parts are renumbered accordingly. \case is changed to
- \ifcase, and it resides under the if_test command.
- New routines are inserted to maintain a linked stack that records
- the current state of conditionals. There's a procedure
- pass_text that skips text while looking for \fi or \else or \or
- on level zero with respect to \if...\fi nesting. The previous
- routines for skip control via handle_right_brace are eliminated,
- and the new ones are somewhat simpler. The new \ifcat is mostly
- combined with the old \if; they no longer ignore spaces.
- The scanner_status is set to normal while processing \ifx.
- \ifx will consider \a to equal 0 after \let\a=0.
-45s. Modules 701, 707: endv_token is replaced by a token for a frozen
- control sequence whose command code end_template makes it behave
- like an outer_call. After expand_calls, it is converted to another
- frozen control sequence, whose command code is endv. This two-step
- facilitates error recovery, instead of giving a fatal error stop.
-45t. Module 874, remove "pass_block(1); goto done".
-45u. After module 1047, routine for end_cs_name prints an error message.
-45v. Module 1049, get_nc_token becomes get_token. (else $\ifmmode fails)
-45w. Module 1202 gets another case (end_template).
-45x. Module 1243, new warning is printed if the if stack isn't empty.
- Changes after version 0.8
-
-46. Declare c : ascii_code in module 825 (noted by DRF, 11/21/82)
-
-47. Module 776 lines 4-6 (suggested by DRF, 11/21/82)
-threshold:=pretolerance;
-if threshold>=0 then
- begin stat if tracing_stats>2 then
- begin begin_diagnostic; print_nl("@@firstpass");
- end; tats
- second_pass:=false;
- end
-else begin threshold:=tolerance; second_pass:=true;
- end;
-
-48. Protection for DVI files (added 11/16/82)
-Replace lines 2 and 3 of module 570 by:
- <Update the values of max_h and max_v; but if the page is too large,
- goto done>;
-Move the statement "dead_cycles:=0" from module 570 to module 568.
-Declare "label done;" in module 568.
-And add the following new module after 570:
-
-@ Sometimes the user will generate a huge page because other error messages
-are being ignored. Such pages are not output to the \.{dvi} file, since they
-may confuse the printing software.
-
-@<Update the values of |max_h| and |max_v|; but if the page is too large...@>=
-if (height(p)>max_dimen)or(depth(p)>max_dimen)or(width(p)>max_dimen) then
- begin print_nl("! Huge page cannot be shipped out");
- help2("The page just created is more than 18 feet tall or")@/
- ("more than 18 feet wide, so I suspect something went wrong.");
- error;
- if tracing_output=0 then
- begin begin_diagnostic;
- print_nl("The following box has been deleted:");
- show_box(p);
- end_diagnostic(true);
- end;
- goto done;
- end;
-if height(p)+depth(p)>max_v then max_v:=height(p)+depth(p);
-if width(p)>max_h then max_h:=width(p)
-
-49. New features \everymath and \everydisplay (12/2/82).
-Make changes analogous to those for "\tokens" (see change 40).
-Put the following just before the end of module 1050:
- if every_math<>null then begin_token_list(every_math,every_math_text);
-And put the following just before the end of module 1056:
- if every_display<>null then
- begin_token_list(every_display,every_display_text);
-
-50. New feature \futurelet (12/2/82):
-Module 1141 changes again. (Also, "let" and "futurelet" share cmd code "let".)
-let: begin n:=cur_chr;
- get_r_token; p:=cs_ptr;
- if n=normal then
- begin repeat get_token;
- until cur_cmd<>spacer;
- if cur_tok=other_token+"=" then
- begin get_token;
- if cur_cmd=spacer then get_token;
- end;
- end
- else begin get_token; q:=cur_tok; get_token; back_input;
- cur_tok:=q; back_input; {look ahead, then back up}
- end; {|back_input| doesn't affect |cur_cmd|, |cur_chr|}
-and continue with "if cur_cmd>=call", as before.
-
-*** The changes above have been incorporated into version 0.9 of TeX.
- Changes after version 0.9
-
-51. new \endinput primitive (suggested by FY, 12/7/82):
-\input and \endinput both use the same command code. The cases in module
-955 are deleted and replaced by those in module 965 (which disappears),
-because \input is now allowed in any mode. The code for any_mode(input)
-is "if cur_chr=0 then start_input else force_eof:=true", and it moves from
-module 952 to just before module 1197. The global variable force_eof
-is initially false, and module 340 becomes (after first:=start;)
- if not force_eof then
- begin if input_ln.... else force_eof:=true;
- end;
- if force_eof then begin print_char(")"); force_eof:=false;...
-
-52. Module 1005, line 4 (12/8/82)
-change "if align_state<0" to "if (mode<0)or(align_state<0)"
-(This avoids embarrassing case where TeX says "type a command or say \end"
-but when you type \end it says "You can't use \end in restricted horiz mode".)
-
-53. Patch to the new code for \csname (12/21/82)
-After eq_type(cs_ptr):=relax, also say equiv(cs_ptr):=256.
-(This corrects a bug that would appear only if \csname occurs right
-after a file name.)
-
-54. Change 47 introduced a bug when tracingonline=0 (12/20/82)
-when omitting firstpass, also do "if tracing_stats>2 then begin_diagnostic;"
-
-55. \hskip -1pt plus 2pt was parsed as \hskip -(1pt plus 2pt)! (12/20/82)
-In module 421, before line -4, insert the following:
- if negative then
- begin cur_val:=-cur_val; negative:=false;
- end;
-But then realize that "negative" is always false on line -2; simplify.
-
-56. Cosmetic change to paragraph statistics (12/23/82)
-tight_fit..very_loose_fit codes have been renumbered very_loose_fit..tight_fit.
-
-57. Module 729 changes to make TeX language more consistent (12/23/82):
-else if type(tail)<>glue_node then tail_append(new_penalty(inf_penalty))
-else begin type(tail):=penalty_node; delete_glue_ref(glue_ptr(tail));
- flush_node_list(leader_ptr(tail)); penalty(tail):=inf_penalty;
-
-58. Commas are allowed as alternates to radix points. (12/23/82)
-define continental_point_token=other_token+"," {decimal point, Eurostyle}
-in module 400, and insert the following twice in 409:
- if cur_tok=continental_point_token then cur_tok:=point_token;
-
-59. \hangindent becomes a normal parameter. (12/23/82)
-This simplifies the code in obvious ways; for example, module 1148 disappears.
-The command code hang_indent goes away too; what was previously called
-hanging_indent is then renamed hang_indent.
-
-60. \prevgraf becomes accessible. (12/23/82)
-This involves renaming the "after" field "pg_field" in the nest array;
-making a new command code set_prev_graf;
-including the following loop into scan_the:
- nest[nest_ptr]:=cur_list; p:=nest_ptr;
- while abs(nest[p].mode_field)<>vmode do decr(p);
- scanned_result(nest[p].pg_field)(int_val);
-and including the following active procedure for any_mode(set_prev_graf):
- procedure change_prev_graf;
- var p:0..nest_size; {index into |nest|}
- begin nest[nest_ptr]:=cur_list; p:=nest_ptr;
- while abs(nest[p].mode_field)<>vmode do decr(p);
- scan_optional_equals; scan_int;
- if cur_val<0 then
- begin print_nl("! Bad \prevgraf");
- help1("I allow only nonnegative values here.");
- int_error(cur_val);
- end
- else begin nest[p].pg_field:=cur_val; cur_list:=nest[nest_ptr];
- end;
- end;
-
-61. \clubpenalty is split off from \widowpenalty. (12/23/82)
-
-62. Bad bug in module 1005 (12/24/82)
-(must not go to reswitch if \par is a macro!)
-Instead of setting cur_cmd and cur_chr and goto reswitch, just back_input
-and set token_type:=inserted.
-
-63. \openin not to prompt if file not present (12/25/82)
-Change lines -4 and -3 of module 1183 to:
- if a_open_in(read_file[n]) then read_open[n]:=just_open
- else read_open[n]:=closed;
-
-64. New \jobname primitive (12/25/82)
-It is added to the "convert" command in the obvious way.
-In conv_toks, the relevant code is
- if job_name=0 then open_log_file
-before "selector" is changed and
- print(job_name)
-after.
-
-65. Better error recovery for math-only things (12/25/82):
-In module 952, don't goto reswitch after insert_dollar_sign.
-In module 954, first back_input, then set cur_tok, and
-don't bother to set cur_chr or cur_cmd; ins_error instead of back_error.
-
-66. Module 1163, line 3, insert "scan_optional_equals" (12/25/82).
-Also make \the\parshape allowed.
-
-67. The location where an \if begins is stacked (12/26/82)
-so that a better error message can be given for \end while \if is incomplete.
-This means two-word nodes instead of one-word nodes in the if stack.
-
-68. Change 30 is extended to \insert, \vadjust, \valign, \output (12/26/82)
-The one-time-only paragraph parameters are now cleared by a
-subroutine called normal_paragraph; hang_after is also set to 1.
-The essential change being made now is to call normal_paragraph in modules
-704, 932, 1009, and 1076.
-
-69. \pagetotal and \pagegoal are added (12/27/82)
-The changes are analogous to, but simpler than, those for \prevgraf.
-
-70. Tracing of page-optimization calculations (12/27/82)
-A bunch of print commands are added to modules 897, 914, and 918,
-activated if tracing_pages>0. Also, \tracingparagraphs is separated
-from \tracingstats.
-
-**** The changes above have been incorporated into version 0.91 of TeX
-
-71. The build_page procedure is broken in two parts (Dec 31, 1982)
-by making module 919 into a procedure called fire_up.
-
-72. \ifeven1\else is made legal by introducing if_code (Dec 31, 1982)
-This improves part of the code in change 45; if_limit has a specific
-value that recovers automatically from a former syntax error.
-
-73. Improvement to alignments when columns don't occur (Dec 31, 1982)
-Delete module 711; and where it was used in module 708, say this:
- begin fin_col:=true; return;
- end;
-Also, in module 717, replace the statement "width(q):=0" by
-"<Nullify width(q) and the tabskip glue following the current column>"
-where that new module has the following code:
- begin width(q):=0; r:=link(q); s:=glue_ptr(r);
- if s<>zero_glue then
- begin add_glue_rel(zero_glue); delete_glue_ref(s);
- glue_ptr(r):=zero_glue;
- end;
- end
-
-74. Better error message in overfull alignment (Dec 31, 1982)
-In module 717, don't set both height and width; set the height zero.
-Then in module 719, switch width to height if necessary. (People didn't
-understand the previous error messages, and I couldn't blame them.)
-
-*** The changes above have been incorporated into version 0.92 of TeX82
-*** (which was the last version of 1982, completed 11:59pm on December 31)
- The first changes after 1982
-
-75. Modules 961 and 962 should be one module. (Jan 3, 1983)
-Also, the absolute constant 100 is replaced, and the test becomes
- if ((page_head=page_tail)and(head=tail)and(dead_cycles=0))or
- (dead_cycles>max_dead_cycles) then
-
-76. Surprise bug: module 1010. (Jan 3, 1983)
-The case "if head<>tail" needs an else clause: else pop_nest.
-Also remove the "<Scan an optional space>" in that module.
-
-77. Improvement to change 22 (Jan 4, 1983)
-In module 996, use box_max_depth from inside the \vbox:
- @!d:scaled; {maximum depth}
- begin d:=box_max_depth; unsave;... vpackage(...,d);
-
-78. \groupbegin and \groupend changed to \begingroup and \endgroup (Jan 4, 83)
-
-79. \deadcycles made accessible (Jan 4, 83)
-
-80. New calculations for split insertions (Jan 4, 83)
-In module 918, we now work with natural width, and add in the page depth too:
-The line "else w:=x_over_n..." is changed to
- else begin w:=page_goal-page_total-page_depth;
- if count(n)<>1000 then w:=x_over_n(w,count(n))*1000;
- end;
-(Note that cur_page_height and cur_page_depth and page_size have been
-renamed page_total, page_depth, and page_goal, in accordance with new syntax.)
-
-*** The changes above have been incorporated into Version 0.93
-
-81. Old bug finally unearthed by PHY (Jan 6, 1983)
-insert "incompleat_node:=null;" after "push_nest;" in module 1097.
-
-82. Extension of change 69: \pageshrink, etc. added (Jan 6, 1983)
-
-83. \floatingpenalty and \insertpenalties added (Jan 6, 1983)
-Also, the insertion nodes now have a new format, so that the values of
-\floatingpenalty, \splittopskip, and \splitmaxdepth can be stored with
-each insertion; this requires the obvious changes in several places:
-a) Module 136, ins_node has fields float,depth,height,ins_ptr,split_top_ptr
-b) Module 184, these fields are displayed
-c) Module 198, ins_node case, also delete_glue_ref(split_top_ptr(p))
-d) Module 202, ins_node case, also add_glue_ref(split_top_ptr(p))
-e) Modules 226-228, new integer parameter \floatingpenalty
-f) Module 883, add parameter d to vert_break subroutine
-g) Module 885, use d instead of split_max_depth
-h) Module 890, argument split_max_depth to call of vert_break
-i) Module 894, change width to height (better name)
-j) Module 900, initialize insert_penalties here, not in 901
-k) Module 914, cost to be awful_bad if insert_penalties>=10000
-l) Module 916, add float(p) to insert_penalties if type(r)<>inserting
-m) Module 916, subtract page_depth from delta
-n) Module 918, subtract page_shrink from delta
-o) Module 918, argument depth(p) to call of vert_break
-p) Module 921, insert_penalties:=0, save split_top_skip before calling 925
-q) Module 921, restore split_top_skip before calling 924
-r) Module 928, set split_top_skip:=split_top_ptr(p) before prune_page_top
-s) Module 929, after q:=p, incr(insert_penalties)
-t) Module 929, before free_node, delete_glue_ref(split_top_ptr(p))
-u) Module 933, clear insert_penalties before calling 934
-v) Module 978, more local variables needed
-w) Module 1010, build the newfangled ins_node
-
-84. Scanner goes to new_line when <return> is category 13 (Jan 7, 1983)
-Insert state:=new_line in module 323 just before the reference to module 339;
-and delete "state:=new_line;" from modules 328 and 330 (and their names).
-
-85. Distinguish between user \kern and font \kern (Jan 9, 1983)
-The nontrivial parts of this are to change "type(s)<>kern_node" to
-"(type(s)<>kern_node)or(subtype(s)<>normal)" in modules 809 and 810;
-and to say "kern_node: if subtype(s)=explicit then goto done4" in module 812.
-The \kern primitive now has "explicit" instead of "normal" in 967.
-
-86. "ignorespace" becomes "ignorespaces" (Jan 9, 1983)
-
-87. Don't omit a blank space after \def, \message, \mark, etc. (Jan 9, 1983)
-<Scan an optional space> is removed from modules 431, 848, 874.
-"info(r):=space_token;" and "link(r):=get_avail; r:=link(r);" removed from 1278.
-
-*** The above changes appear in Version 0.94.
- Version 0.95
-
-88. New active characters in math mode (Jan 12, 1983)
-In module 1062, add a label "restart" and change lines -3 and -2 as follows:
-fam(p):=(c div 256) mod 16;
-if c>=var_code then
- if fam(p)<8 then fam(p):=cur_fam
- else begin <Convert c to an active character whose equivalent is
- ready to be scanned next>; goto restart;
- end;
-In module 1064, the body of the procedure becomes
-begin if c>='4000 then <Convert c ...> else <the former body>; end
-And there's a new module:
-<Convert c...>=
-begin cs_ptr:=(c mod 128)+active_base;
-cur_cmd:=eq_type(cs_ptr); cur_chr:=equiv(cs_ptr); x_token; back_input;
-end
-
-89. Surprise bug: $1-$ treated the - as binary (Jan 15, 1983)
-New module <Convert a final bin_noad to an ord_noad>=
- if r_type=bin_noad then type(r):=ord_noad
-is called in module 649 before the call of 678, and in module 651
-in the place where that code already appears.
-
-90. Another oversight (Jan 15, 1983)
-Add "space_factor:=1000;" after "push_nest" in modules 1027, 1029
-
-91. And a more embarrassing one (Jan 16, 1983)
-I forgot "spotless:=false;" at the beginning of the procedure in module 80.
-But while fixing this, I decided to make it more general since IBMers want
-a return code at the end of the job. So there's a history variable that has
-four values: spotless, warning_issued, error_message_issued, fatal_error_stop.
-a) module 75: declare history, define spotless etc.
-b) module 76: initialize history:=spotless
-c) module 80: if history<error_mess... then history:=error_mess...
-d) 80 and 90: history:=fatal_error_stop before jump_out
-e) 92: if history<error_message_issued then
-f) 232: if history=spotless then history:=warning_issued
-g) 1243: if history=warning_issued then print_nl("(see the log...)")
-
-92. "This can't happen" could happen, so there's new error recovery (Jan 16, 83)
-In module 933, replace the call on confusion by a call of the following module:
- @ @<Recover from an unbalanced output routine@>=
- begin print_nl("! Unbalanced \output routine");
- help2("Your sneaky output routine has fewer real {'s than }'s.")@/
- ("I can't handle that very well; good luck."); error;
- repeat get_token;
- until loc=null;
- end
-In module 1278, replace the call on confusion by a call of:
- @ @<Recover from an unbalanced write command@>=
- begin print_nl("! Unbalanced \write command");
- help2("On this page there's a \write with fewer real {'s than }'s.")@/
- ("I can't handle that very well; good luck."); error;
- repeat get_token;
- until cur_tok=end_write_token;
- end
-
-93. String overflow clobbered the log file (Jan 18, 1983)
-Also, "confusion" before log file open would cause problems. Also start_input
-calling open_log_file calling prompt_file_name calling fatal_error!
-To fix these anomalies, open_log_file no longer calls prompt_file_name,
-if interaction<scrollmode; instead, it terminates after printing what went
-wrong. Also, the fatal_error and overflow and confusion procedures call
-the following new subroutine:
-procedure normalize_selector;
-begin if job_name>0 then selector:=term_and_log else selector:=term_only;
-if interaction=batch_mode then decr(selector);
-if job_name=0 then open_log_file;
-end;
-
-94. \ifeof\fi loops infinitely (Jan 18, discovered by Lamport)
-Change 72 converted such a \fi to <space>\fi. Now it is converted to \relax\fi.
-
-95. \limitswitch changed to \displaylimits et al. (Jan 18, 1983)
-[Incidentally, this fixes a bug in the former positioning of \int\limitswitch]
-a) module 608: subtype of Op can be normal, limits, or no_limits.
-b) 620: display the subtype if not normal
-c) 667: new logic decides limits before looking at the operand (and the operand
- is now called the nucleus); the italic correction is removed only if
- it should not be put back
-d) 1069: subtype(tail):=cur_chr
-
-96. Minor changes to math in unusual cases (Jan 19, 1983)
-a:delete "if height(y)<=0 then height(y):=default_rule_thickness" in module 658
-b:move "if thickness(q)=default..." from module 664 to module 661
-c:delete module 1081, that error message isn't worth the bother
-d:in module 1062, char_num case, c:=math_code(cur_val) (if cur_val<128)
-e:in module 1064, a similar change
-
-97. Bad spacing from change 6 is corrected (Jan 19, 1983)
-underline, overline, radical, vcenter, and accent noads now revert to type
-Ord instead of type Inner.
-{...} produces type Ord also.
-There's a new primitive \mathinner.
-The new_noad function now produces an ord_noad (change its calls accordingly).
-And the default is changed in module 679 to t:=ord_noad; the fraction_noad
-case sets t:=inner_noad, and the (inner_noad,ord_noad) cases swap places.
-
-98. New \mathchoice primitive (Jan 19, 1983)
-a) module 204: new command
-b) 254: math_choice_group
-c) 614: style node three words long, so a choice node can be converted to it
-d) 614a: choice node has four subfields: display_mlist, text_mlits, etc.
-e) 1081a: routines to build a choice_node like 1027-1029 build discretionaries
-
-99. \input moves to syntax from semantics (Jan 19, 1983)
-a) 204, 206: renumber commands
-b) When input is to be expanded, if name_in_progress then insert_relax
-c) 459,464: name_in_pr:=true; begin_name;...end_name; name_in_pr:=false;
-d) 406,461: declare name_in_progress, a global boolean initially false
-
-100. \chardef joins \mathchardef (Jan 19, 1983)
-a) 204: math_only becomes math_given; add new command char_given
-b) 205: new command char_def
-c) 250,251: new primitive char_def
-d) 380: char_given,math_given yield integer after \the
-e) 401: char_given,math_given yield integer in context of integer
-f) 936,943: char_given treated like other_char
-g) 1062,1064: same, if cur_chr<128, else assume math_code(x)=x
-h) 1143,1144: char_def is analogous to math_char_def
-
-101. \unbox becomes \unhbox,\unvbox; also add \unhcopy (Jan 19, 1983)
-Module 1020 changes in the obvious way.
-
-102. \spacefactor, \pagetotal, etc. move to prefixed_command (Jan 20, 1983)
-
-103. \hrule in horizontal mode, \vrule in vertical mode: switch modes (Jan 20)
-
-104. \globaldefs parameter, affects prefixed_command (Jan 20, 1983)
-
-105. After looking at frequency counts, some optimizations made (Jan 21, 1983)
-a) "fast_get_avail" and "fast_store_new_token" introduced to speed up the loops
-in modules 360 and 431.
-b) some procedure call overhead eliminated in begin_token_list, end_token_list,
-back_input, and flush_node_list.
-c) a few if tests changed from "if a and b then" to "if a then if b then".
-
-106. Changes for space efficiency in math constructions (Jan 22, 1983)
-a) In module 1102, mlist_penalties:=(mode>0)
-b) The following code is inserted before "free_node" in module 639 (rebox):
- if (is_char_node(p))and(link(p)=null) then
- begin f:=font(p); v:=char_width(f)(char_info(f)(character(p)));
- if v<>width(b) then link(p):=new_kern(width(b)-v);
- end;
-c) A new module is called just before clean_box exits:
-<Simplify a trivial box>=
-q:=list_ptr(x);
-if is_char_node(q) then
- begin r:=link(q);
- if r<>null then if link(r)=null then if type(r)=kern_node then
- begin free_node(r,small_node_size); link(q):=null;
- end;
- end
-
-107. Oversight in rebox routine (module 639) corrected (Jan 22, 1983)
-if type(b)=vlist_node then b:=hpack(b,natural);
-
-108. Module 217 clobbers eqtb[bad_font_ident] set in change 26q (Jan 22, 1983)
-Decided to fix this by making \nullfont a primitive.
-This means the procedure missing_font can be deleted, and the test for
-undefined font can be removed from the inner loop.
-(This reflects a rather dramatic change from TeX80, where
-a missing font was a fatal "Whoa" error!)
-Note: I thought I could delete module 646, but realized that it still provides
-a useful error message. The dump/undump routines (cf. change 26ee) now
-dump the null_font information too, as its parameters can be changed.
-
-109. End of program now lists all incomplete \ifs (Jan 24, 1983)
-
-110. Alignment preamble setup to allow \halign\lb (Jan 29, 1983)
-The statement "align_state:=-1000000;" is inserted near the beginning
-of module 695 (and the comment about align_state=-999999 is deleted).
-The constant -999999 is changed to -1000000 in modules 700 and 701.
-
-111. Forgot to test is_char_node(r) (Jan 30, 1983)
-in the <Simplify a trivial box> code of change 106c.
-By coincidence, this was caught since somebody used font number 11
-in the second character of a list of length 2!
-
-112. Improved format for stats at end of run (suggested by DRF, Jan 30, 1983)
-Module 1242 changes; nothing subtle.
-
-**** The changes above have been incorporated into version 0.95
- Version 0.96
-
-113. space after one-symbol control sequences NOT to be ignored unless
-the catcode of that symbol is letter or spacer. (Jan 30, 1983)
-The name of module 334 changes slightly; the state is set based
-on cat_code(cur_chr), shortly after label start_cs.
-A new variable cat is introduced and set to cat_code(cur_chr) in modules
-334 and 336.
-
-114. trailing spaces removed on all lines of input (Jan 30, 1983)
-last_nonblank is added to input_ln routine (module 31)
-
-115. mmode+accent gives error but assumes math_accent (Feb 3, 1983)
-This goes into math_ac procedure (module 1075); module 1035 is eliminated.
-
-116. \iftrue and \iffalse (Feb 5, 1983)
-Simple addition of two new conditions.
-
-117. Bad calculation of size for \left and \right (Feb 6, 1983)
-In module 680, the first assignment to delta should be
- delta:=(delta1 div 500)*delimiter_factor.
-
-118. \delimitershortfall (new name) replaces \delimiterlimit. (Feb 12)
-
-119. \abovewithdelims.. to be equivalent to \above (Feb 12)
-Module 1089 revised so that the delimiters are scanned before the dimension.
-
-120. Remove the kludgy math codes introduced in change 88 (Feb 12)
-\fam becomes a normal integer parameter
-and \mathcode stored with min_halfword added
-and \mathcode allowed to be 32768
-and current family is substituted only when it's in range.
-Also the initialization of mathcode for letters now specifies family 1.
-(This implies a dozen or so obvious revisions.)
-
-121. Bug in module 1152: max spacefactor is 32767 (Feb 12)
-also module 1013 gets a restricted range
-
-122. Octal output to be replaced by hexadecimal. (Feb 14)
-
-123. Forgot to include char_given in module 1037, re change 100 (Feb 14)
-
-124. vmode+valign,hmode+halign made legal transitions (Feb 17)
-
-125. \tracingrestores (Feb 18)
-This involves a lot of new, rather tedious code that's interspersed with the
-eqtb definitions (the body of a procedure called show_eqtb).
-
-126. New error message for hmode+hrule in -hmode. (Feb 25)
-head_for_vmode now suggests \leaders in this case. [improves change 103]
-
-127. under/overfull boxes in alignment: Better message. (Feb 27)
-par_begin_line becomes pack_begin_line, and it is set (negative) in
-module 719, read in modules 590 and 601.
-
-128. New \xcr feature. (suggested by Lamport comments, Mar 4)
-align_peek (module 702) ignores it, otherwise it acts like ordinary \cr.
-
-129. In stats, subtract out TeX's own string requirements (Mar 4)
-(cf. change 112)
-init_pool_ptr and init_str_ptr variables added in obvious way
-(declared in module 39, set in module 1240, used in module 1242)
-
-130. \everyhbox and \everyvbox. (Mar 6)
-The modifications are obvious; for example, module 1076 gets the statement
- if every_vbox<>null then begin_token_list(every_vbox,every_vbox_text);
-and a similar pair of statements goes into module 993.
-
-131. Precaution in module 1105 error recovery (March 9, 1983)
-Change the first test to "if (a=null)or danger", in order to
-avoid accessing math_quad when the symbol fonts aren't known to be present.
-
-132. Installed float and unfloat to aid portability (suggested by HWT, 3/7/83)
-
-133. \dispskip becomes \abovedisplayskip and \belowdisplayskip (3/9/83)
-Also \dispaskip becomes \abovedisplayshortskip; \dispbskip similar.
-
-134. \romannumeral separated from \number (suggested by FY, March 10)
-Obvious changes; print_roman_int now accepts negative input but gives
-no output in such cases (the test in module 68 becomes "if n<=0 then return").
-
-135. scan_keyword to ignore leading spaces (Mar 12)
-In module 375, change "else begin" to
-"else if (cur_cmd<>spacer)or(p<>backup_head) then begin".
-
-136. Update to change 112 (Mar 14)
-Module 1242 now uses write and write_ln directly (saves space and time).
-
-137. Another change to page-break cost (suggested by Lamport, March 16)
-Cf. change 83k above; the relevant lines of module 914 now read
- if b<awful_bad then
- if pi<=eject_penalty then c:=pi
- else if b<inf_bad then c:=b+pi+insert_penalties
- else c:=deplorable
- else c:=b;
- if insert_penalties>=10000 then c:=awful_bad;
-and a similar change (but without insert_penalties) occurs in module 887.
-
-**** The changes above have been incorporated into version 0.96 (March 16, 1983)
- Version 0.97
-
-138. \everyjob (suggested by FY, March 18)
-Module 936: main_control inserts every_job as its first action.
-
-139. Improved printout of macro definitions (March 19)
-In module 278, simply treat left_brace like right_brace.
-(This corresponds to the way the manual describes parameter matching.)
-
-140. Omit blanks as non-delimited parameters (March 19)
-In module 360, replace
- else store_new_token(cur_tok);
-by
- else @<Store the current token, but |goto continue| if it is
- a blank space that would become an undelimited parameter@>;
-Then define @<Store the current token...@> to be:
-begin if cur_tok=space_token then
- if info(r)<=end_match_token then
- if info(r)>=match_token then goto continue;
-store_new_token(cur_tok);
-end
-
-141. Minor patch in module 386, catches mu_glue (March 21)
-begin cur_val:=zero_glue; cur_val_level:=glue_val;
-if not is_char_node(tail)and(mode<>0) then
- begin if type(tail)=glue_node then
- begin cur_val:=glue_ptr(tail);
- if subtype(tail)=mu_glue then cur_val_level:=mu_val;
- end;
- end
-else if (mode=vmode)and(tail=head)and(last_page_glue<>max_halfword) then
- cur_val:=last_page_glue;
-end
-
-142. Patch in module 699, \span expands only one level (March 21)
-(See previous change #42.) The "get_x_token" in the code
-while (cur_chr=span_code)and(cur_cmd=tab_mark) do get_x_token;
-should be replaced by:
- begin get_token;
- if cur_cmd>max_command then
- begin expand_calls; get_token;
- end;
- end
-
-143. Single # in \tokens, \message, etc. (March 22)
-(The previous rule was really bad in connection with \uppercase,
-or with \write when #'s had to be given four times!)
-Module 437 should be prefaced with "if macro_def then".
-And get_token should become get_x_token there, if xpand is true.
-
-144. Keyword "to" required in \read. (March 22)
-This will avoid the common error of a missing space before the \cs.
-Also the stream number can be out of range, for terminal input.
-The stream number in a \write can be out of range too, for terminal output.
-Modules 1145 and 1258 and 1280, etc., change in the obvious ways.
-
-145. \ifeven<countnumber> replaced by \ifodd<number> (March 26)
-This makes the language more consistent.
-
-146. Big surprise bug relating to \if\if aabc\fi (March 26)
-(related to change 45; the possibility that cur_if might not be the
-correct one when the conditional is evaluated was discovered today)
-The main change is to add the change_if_limit procedure, and to add
-the variable save_cond_ptr and the code that now depends on it.
-
-147. \if and \ifcat should tolerate primitives (March 28)
-
-148. "absent" becomes "void", a better word (March 28)
-
-149. Module 990: \lastbox to clear the shift_amount (March 28)
-since I don't want to figure out what it means in all cases (\vsplit, etc)
-
-150. print_err("...") takes the place of print_nl("! ...") (DRF, March 29)
-And wake_up_terminal is introduced in module 34, and used in modules
-37, 70, 341, 441, 457, 463, 1210, 1240, 1246.
-
-151. \halign extended to periodic preambles (April 1)
-Modules 688--690: cur_loop introduced, stacked/unstacked
-Module 695: cur_loop initialized
-Module 700: cur_loop set up
-Module 708--709: cur_loop used and advanced
-
-152. \leaders to align by the smallest enclosing box. (April 1)
-Module 549: new local variable left_edge, initialized to cur_h
-Module 557: cur_h:=left_edge+leader_wd*((cur_h-left_edge) div leader_wd)
-Module 559: new local variable top_edge, initialized to cur_v-height(this_box)
-Module 566: analogous to 557
-
-153. hyphenation after whatsits is OK (April 1)
-In module 809, skip past whatsits
-
-154. \par in vertical mode should build_page (April 2)
-vmode+par_end moves from 952 to 1005
-
-155. Clear aux to zero in module 703 (April 2)
-
-156. Digits will switch families (April 4)
-(initialize their math codes differently in module 225)
-
-157. Refinement to correction 83m (April 7)
-the test for not splitting should be
- if ((h<=0)or(h<=delta))and(height(p)+height(r)<=dimen(n)) then
-
-158. (re 128) \xcr renamed to \crcr, at Lamport's request. (April 8)
-
-159. Better error recovery in runaway preamble (April 11)
-Module 319, aligning: set align_state:=-1000000
-
-160. \read to get balanced braces (April 12)
-Module 440 changed to look more like 431.
-Module 443 gives error message if the \read goes off end of file.
-Module 319 removes \outer from forbidden control sequence that is \read.
-
-161. Bug found by Jim Sterken (April 14)
-Module 798 can make q a char_node, so module 794 needs this patch:
- if not is_char_node(q) then
-to be inserted just before "if (type(q)=math_node)..."
-
-162. \uppercase and \lowercase to apply to all characters (April 15)
-module 1196 changes; also I put active_base before single_base in eqtb
-
-**** The changes above have been incorporated into version 0.97 (April 16, 1983)
-**** except the part of 144 about \read-1 was forgotten and put in 0.98 later
- Version 0.98
-
-163. change small_number to 0..65 in module 814 (found by DRF, April 17)
-
-164. improved error recovery in module 1166 (suggested by DRF, April 17)
-after error: repeat get_token; until cur_cmd=right_brace; {flush the patterns}
-
-165. improved \read from terminal (suggested by Todd Allen at Yale, May 1)
-I had forgotten to implement the extended stream numbers in change 144.
-Also, the prompt is now omitted if n<0.
-
-166. \write n writes only to the log file, if n<0. (May 18)
-
-167. Unified syntax for parameters and registers. (May 18)
-a) Command code changes: def_font moved to before prefix;
- register eliminated; set_register renamed register and
- moved (with adv_register...div_register) to before prefix;
- min_internal and max_internal defined.
-b) scan_the renamed scan_something_internal, and it acts on cur_tok.
-c) scan_int, scan_dimen, scan_glue simplified accordingly; instead of
- testing for cur_cmd=the or cur_cmd=register, they now test
- cur_cmd versus min_internal and max_internal.
-d) ins_the is removed.
-e) \minusthe is removed. Consequently "the_toks" needs no parameter.
-
-168. new parameters \hoffset, \voffset (May 18)
-
-169. \everycr (suggested by Spivak, installed May 24)
-
-170. \countdef, \dimendef, etc. (suggested by DRF long ago, installed May 25)
-Straightforward change to internal representation of assign_int and similar
-commands, so that the chr part is now a pointer to the eqtb location.
-
-171. \advance, \multiply, \divide (suggested by FY, installed May 25)
-
-172. \hyphenchar (May 25)
-A new command assign_font_int is introduced, and incorporated into
-scan_something_internal and prefixed_command in the usual way.
-The hyphen_char array entries are initialized in modules 483 and 506,
-allocated in 482, used in modules 809 [is hyphenation to be suppressed?],
-828 [insert the hyphen character], 946 [insert discretionary node
-following hyphen], 1027 [implementation of \-].
-hyphen_char[k] is dumped and undumped in modules 1229 and 1230.
-
-173. \skewchar (May 25)
-Loaded and fetched with the same command code as \hyphenchar.
-Module 659 gets a dozen more lines of program, to compute the skew.
-
-174. \noexpand (May 25)
-This involves: introduction of no_expand and dont_expand command codes;
-frozen_dont_expand as an internal marker; small change to get_next
-when that marker is sensed; change to processing of \if and \ifcat;
-implementation of no_expand in the expand_calls subroutine.
-I also changed the name of expand_calls to "expand".
-
-175. \meaning (May 25)
-This adds one case to the "convert" command.
-print_meaning is a new subroutine, using code that was in show_whatever.
-
-176. "dm" and "vu" are out, ".5\hsize" is in (May 25)
-Straightforward changes to module 416.
-
-177. \texinfo f n becomes \fontdimen n f (May 25)
-
-178. \afterassignment (suggested by ARK, May 27)
-
-179. \chardef\xx=5\xx shouldn't say that \xx is undefined (May 27)
-
-180. \relax to be ignored like spaces in math mode (May 28)
-and in a few other places: <Get next non-blank non-relax non-call token>
-is now used in modules 379, 988, 994, 1062, 1070, 1134, 1179
-(i.e., scan_left_brace, scan_box, scan_math, scan_delimiter, prefixed_command,
-do_assignments, and just after \leaders).
-
-181. improve \mathaccent wrt sub/superscripts (sugg by HWT, May 30)
-
-182. its_all_over: remove dead_cycles>max_dead_cycles (May 30)
-Modules 961 and 962 are combined and simplified.
-
-*** The changes above were installed into version 0.98 on May 31, 1983 ***
- Version 0.99
-
-183. \mark and \insert and \vadjust allowed in restricted hmode (Jun 3)
-also in math; this is a comparatively big change
-[at present, \mark in a display causes TeX to crash with "can't happen"!]
-modules 652 and 679: mark_node,ins_node,adjust_node now permitted
-modules 576 and 578: t becomes a global variable adjust_tail
-modules 802 and 1110: new calling sequence to get the adjustments
-modules 254, 986, 993, 995, 996: adjusted_hbox_group for the new kind of hbox
-modules 698--690: cur_head and cur_tail added to alignment stack
-modules 703, 712, 715: adjustments gathered and appended during \halign
-
-184. \ht, \wd, and \dp (Jun 6)
-
-185. When displaying noads, use ^ and _ instead of ( and [ (Jun 6)
-
-186. A..F in hex constants could be otherchar as well as letter (Jun 6)
-
-187. Remove <scan optional space> from module 417 (Jun 7)
-(it was redundant code)
-
-188. \mkern .5\thinmuskip and \mkern\thinmuskip should be legal (Jun 7)
-
-189. 2.5\space\space\dimen0 should work (Jun 7)
-previously it worked after "plus" or "minus" only!
-
-190. <font identifier> to allow also \font for current font (Jun 7)
-"if cur_cmd=def_font then f:=cur_font else" added to module 507
-
-191. \gdef not to be global when \globaldefs<0 (Jun 7)
-"and (global_defs>=0)" added to module 1139
-
-192. \advance\spaceskip by-\spaceskip should yield zero_glue (Jun 7)
-the procedure trap_zero_glue is culled from module 1147
-
-193. \show should work with any token (Jun 7)
-
-194. \tokens to become 256 registers (Jun 8)
-\toks and \toksdef added in the straightforward way
-(this affects mainly eqtb, scan_something_internal, prefixed_command)
-
-195. allow \indent in math mode (Jun 8)
-also, \valign in math mode to give missing $ error
-modules 1001 and 1043 disappear; 1004 is generalized slightly.
-
-196. remove redundant code (Jun 8)
-In module 1044, there's no need to check cur_group and call off_save.
-Similarly in module 1053.
-
-197. new_write_whatsit shouldn't allow \openout-1, \closeout-1 (Jun 8)
-(simple change to module 1258)
-
-198. \lastbox should give error in math mode (Jun 8)
-(simple change to module 990)
-
-199. \leaders not followed by proper glue should be back_error (Jun 9)
-[I made the change; TRIP should test this error message!]
-
-200. Module 702, correction to beginning of \noalign (Jun 9)
-if mode=-vmode then normal_paragraph;
-
-201. After alphabetic constant, expand the optional space (Jun 10)
-
-202. Set space_factor:=1000 after rule or constructing an accent (Jun 12)
-That's in modules 964 and 1036.
-
-203. blunder in module 783 (caught by Jim Sterken, fixed Jun 14)
-disc_width:=0 needs to be set before testing if s=null
-(A real bug that existed since the beginning! It showed up on page 37
- of the September 1982 TRIP manual; my hand-checking was incomplete...)
-
-204. Change to optional spaces after <dimen> (Jun 14)
-The optional space will now be analogous to that after <number>.
-
-205. Fix conflict between \output and \everydisplay (Jun 14)
-In change 49, I should have inserted every_display before calling build_page.
-
-206. Overflow errors to be consistent with statistics reporting (Jun 17)
-(See change 129.)
-
-207. \tracing switches to be all positive vs nonpositive (Jun 17)
-
-*** The changes above were installed into version 0.99 on June 19, 1983 ***
- Version 0.999
-
-208. \catcode`\%=14 to be done by INITEX (Jun 20)
-
-209. \par in vmode to clear parshape etc. (Jun 21)
-Module 1005, which contains vmode+par_end, now calls normal_paragraph.
-
-210. Improvement to change 39 (Jun 21)
-Module 593, overfull_rule not appended if solely due to hbadness
-
-211. Alignment bug allows glue_set to be less than -1! (Jun 21)
-Modules 723 and 724 need to be patched.
-
-212. Correction to change 134 (found by Debby Clark, Jun 22)
-Module 68: n to be declared integer, not nonnegative_integer.
-
-213. "by" to be optional (suggested by Lamport, Jun 22)
-Module 1158 disappears
-
-214. Module 1235, slight change in format_ident message (Jun 24)
-
-215. New measures needed to thwart trickery (Jun 25)
-Glue set values computed by \span could have been brought into
-TeX's registers via, e.g., \valign and \vsplit; so the
-"kern" idea of module 722 is insufficient and should be abandoned.
-Extra boxes and glue are added; this has additional virtue
-of perfect accuracy in alignment of vertical rules.
-The main change is to introduce a new module after 722, in which s and t
-are updated for spans, and to eliminate the "equivalent kern" code from 719
-(the corresponding glue calculations are now done in the new module).
-
-216. leaders to affect height/width of their boxes (Jun 25)
-Module 583 splits into two parts (one for hpack, one for vpack).
-
-217. \unskip permitted a little more often (Jun 28)
-Module 1018 reports error only if last_page_glue<max_halfword.
-
-218. {\bf A} in math: not to make a box (Jul 1)
-Module 1093 changes as follows: info(saved(0)):=fin_mlist(null) becomes
-p:=fin_mlist(null); info(saved(0)):=p; if <simple case> then <simplify>.
-
-219. "scaled" feature added to \font input.
-
-220. \mathaccent still not working right? (Jul 2)
-Change 181, I forgot to correct delta when box x changed.
-
-221. Remove confusion possible on file of length 1 (found by Lamport)
-Correction suggested by DRF, July 2: introduce bypass_eoln
-
-222. Allow things like ^^b. (July 4)
-This simplifies modules 332 and 335; also affects 48 and 49.
-And (surprise) 58.
-
-223. \escapechar \defaulthyphenchar \defaultskewchar \endlinechar (July 4)
-to make TeX less dependent on the character set
-A lot of error messages are now broken up so that they use print_esc
-
-224. erstat added for file opening/closing (by DRF, July 7)
-That's module 27.
-
-225. \tracingpages output to show total glue too (July 11)
-Added a procedure called print_page_totals, used also by show_activities.
-Broke modules 214 and 896 into two modules each.
-
-226. Guard against insertion into an hbox (July 11)
-A new procedure ensure_vbox is called in modules 917 and 925.
-
-227. <tokenvar>=<tokenvar> allowed (July 11)
-
-228. \errhelp parameter added (July 11)
-
-229. get_preamble_token should look at global_defs (July 11)
-Module 699 is patched.
-
-*** The above changes installed in preliminary version 0.999 on July 12, 1983,
-but I decided later in the day to do a few more things:
-
-230. \string, \noexpand, \meaning to allow \outer (Todd Allen, July 12)
-
-231. \the to be an expandable control sequence (July 12)
-Several things in the language are cleaned up:
-a) \the\tenrm replaced by \fontname\tenrm [\fontname<font>]
-b) when expanding edef, etc., result of \the still expanded only one level
-c) expansion after \def not inhibited, since \noexpand is now present
-d) \the\the disallowed.
-
-232. \unhbox and \unhcopy allowed in math mode if the box is void (July 12)
-Module 1020 is extended to handle this case.
-
-233. Value of default_rule was incorrectly rounded (July 16)
-Module 424: default_rule=26214 {.39999 pt}
-
-234. \mathaccent still not right! (July 16)
-I need to make the final height the max of (height of accented letter w/o
-superscript, height of unaccented letter w superscript).
-
-235. \newlinechar parameter (July 16)
-simple change to print subroutine
-
-236. boxes and rules to be allowed in discretionaries (sugg by HP man, July 16)
-in fact this simply requires omitting of the prohibition (in module 1031)
-and a few more cases equivalent to kern_node in modules 754, 755, 784.
-
-237. \tracingcommands to show all expandable tokens (July 16)
-
-238. \char to be allowed in \hyphenation list (July 16)
-Module 848 changes in the obvious way.
-
-239. \aftergroup (July 16)
-A new save_type.
-
-240. Curtail running dimensions inside alignments (sugg by ARK, July 16)
-Module 720.
-
-241. Strange pattern data could cause PASCAL error (found July 17)
-Put "if hc[1]=127 then hyf[0]:=0;" at beginning of module 878.
-
-242. hc codes for hyphenation are one lower (July 17)
-e.g., hc[...]:=lc_code(...)-1. This makes code 127 impossible to match.
-
-243. whatsits also allowed after hyphenatable words (July 17)
-Module 812.
-
-244. \/ makes an explicit kern (July 17)
-"subtype(tail):=explicit" in module 1023.
-
-*** Version 0.999 installed July 17, 1983.
-But later in the day I decided to do a few more things:
-
-245. Lowercase letters allowed in file names (July 18)
-In module 452, omit the conversion to uppercase.
-
-246. "No output file" becomes "No pages of output." (July 18)
-Module 571.
-
-247. QRS on error leads to confirmation message (sugg by ARK, July 18)
-Module 84.
-
-*** The real version 0.999 finally installed July 18.
- * Version 1.0
-
-(Changes made after the Version 0.999 listing of TeX82)
-(Henceforth the "final" module numbers are used)
-
-248. Module 1215, allow space in \read n to \cs (by FY, July 25, 1983)
-@x patch in get_r_token routine
-begin restart: get_token;
-@y
-begin restart: repeat get_token;
-until cur_tok<>space_token;
-@z
-
-249. Module 498, we must stack the current if type (FY, July 27)
-@x patch in conditional routine
-begin @<Push the condition stack@>;@+save_cond_ptr:=cond_ptr;@/
-@y
-@!this_if:small_number; {type of this conditional}
-begin @<Push the condition stack@>;@+save_cond_ptr:=cond_ptr;this_if:=cur_chr;@/
-@z
-Also replace cur_if by this_if in modules 501, 503, 506. The following
-patches do only what is necessary to make things work:
-@x
- print_cmd_chr(if_test,cur_if);
-@y
- print_cmd_chr(if_test,this_if);
-@z
-@x
-if cur_if=if_int_code then scan_int@+else scan_normal_dimen;
-@y
-if this_if=if_int_code then scan_int@+else scan_normal_dimen;
-@z
-@x
-if cur_if=if_char_code then b:=(n=cur_chr)@+else b:=(m=cur_cmd);
-@y
-if this_if=if_char_code then b:=(n=cur_chr)@+else b:=(m=cur_cmd);
-@z
-
-250. Module 507, \ifx need not put a control sequence in hash table (July 29)
-@x
-get_token; n:=cs_ptr; p:=cur_cmd; q:=cur_chr;
-get_token; if cur_cmd<>p then b:=false
-@y
-get_next; n:=cs_ptr; p:=cur_cmd; q:=cur_chr;
-get_next; if cur_cmd<>p then b:=false
-@z
-
-251. Module 86, message is lost (noticed by HWT, July 31)
-@x
-print("..."); print_ln; return;
-@y
-print("..."); print_ln; update_terminal; return;
-@z
-
-252. Don't put empty at end of \input file! (Aug 1)
-[This simplifies the rules and the program, and also gets around a bug
-that occurred at the end of files with \endlinechar<0.]
-@x Module 362:
-@ An empty line is inserted at the end of the file, if the last line
-wasn't already empty, because |input_ln| sets |last:=first| when
-it discovers an |eof|.
-@^empty line at end of file@>
-
-@<Read next line of file into |buffer|, or
- |goto restart| if the file has ended@>=
-begin incr(line); first:=start;
-if not force_eof then
- begin if input_ln(cur_file,true) then {not end of file}
- firm_up_the_line {this sets |limit|}
- else if limit<>start then firm_up_the_line
- {if |pausing|, the user can add more lines}
- else force_eof:=true;
-@y
-@ @<Read next line of file into |buffer|, or
- |goto restart| if the file has ended@>=
-begin incr(line); first:=start;
-if not force_eof then
- begin if input_ln(cur_file,true) then {not end of file}
- firm_up_the_line {this sets |limit|}
- else force_eof:=true;
-@z
-
-*** The changes above went into Version 0.9999, which was widely distributed
-
-253. Ridiculous blunder made in change 146 (found by FY, August 16)
-@x Correction to module 497
-else loop@+begin q:=cond_ptr;
- if link(q)=p then
- begin type(p):=l; return;
- end;
- if q=null then confusion("if");
-@:this can't happen if}{\quad if@>
- q:=link(q);
-@y
-else begin q:=cond_ptr;
- loop@+ begin if q=null then confusion("if");
-@:this can't happen if}{\quad if@>
- if link(q)=p then
- begin type(q):=l; return;
- end;
- q:=link(q);
- end;
-@z
-
-254. Minor amendment to stat(s) printing (cf. change 129) (August 16)
-@x in module 1334
- wlog_ln(' ',str_ptr-init_str_ptr:1,' strings out of ',
- max_strings-init_str_ptr:1);@/
-@y
- wlog(' ',str_ptr-init_str_ptr:1,' string');
- if str_ptr<>init_str_ptr+1 then wlog('s');
- wlog_ln(' out of ',
-@z
-
-255. Bug in \xleader computations (found by FY, August 18)
-@x in module 592
-@!lq,@!lr:integer; {quantities used in calculations for leaders}
-@y
-@!lq,@!lr,@!lx:integer; {quantities used in calculations for leaders}
-@z
-@x in module 626
- begin edge:=cur_h+rule_wd;
- @<Let |cur_h| be the position of the first box, and set |leader_wd|
- to the spacing between corresponding parts of boxes@>;
- while cur_h+leader_wd<=edge do
- @<Output a leader box at |cur_h|,
- then advance |cur_h| by |leader_wd|@>;
-@y
- begin edge:=cur_h+rule_wd; lx:=0;
- @<Let |cur_h| be the position of the first box, and set |leader_wd+lx|
- to the spacing between corresponding parts of boxes@>;
- while cur_h+leader_wd<=edge do
- @<Output a leader box at |cur_h|,
- then advance |cur_h| by |leader_wd+lx|@>;
-@z
-@x in module 627
- leader_wd:=leader_wd+lx;
-@y
-@z
-@x in module 628
-cur_h:=save_h+leader_wd;
-@y
-cur_h:=save_h+leader_wd+lx;
-@z
-@x in module 635
- begin edge:=cur_v+rule_ht;
- @<Let |cur_v| be the position of the first box, and set |leader_ht|
- to the spacing between corresponding parts of boxes@>;
- while cur_v+leader_ht<=edge do
- @<Output a leader box at |cur_v|,
- then advance |cur_v| by |leader_ht|@>;
-@y
- begin edge:=cur_v+rule_ht; lx:=0;
- @<Let |cur_v| be the position of the first box, and set |leader_ht+lx|
- to the spacing between corresponding parts of boxes@>;
- while cur_v+leader_ht<=edge do
- @<Output a leader box at |cur_v|,
- then advance |cur_v| by |leader_ht+lx|@>;
-@z
-@x in module 636
- leader_ht:=leader_ht+lx;
-@y
-@z
-@x in module 637
-cur_v:=save_v-height(leader_box)+leader_ht;
-@y
-cur_v:=save_v-height(leader_box)+leader_ht+lx;
-@z
-Also insert the following in modules 619 and 629:
-@!lx:scaled; {extra space between leader boxes}
-
-256. \/ should apply to ligatures! (August 20)
-@x in module 1113
-var f:internal_font_number; {the font in the |char_node|}
-begin if is_char_node(tail)and(tail<>head) then
- begin f:=font(tail);
- tail_append(new_kern(char_italic(f)(char_info(f)(character(tail)))));
-@y
-label exit;
-var p:pointer; {|char_node| at the tail of the current list}
-@!f:internal_font_number; {the font in the |char_node|}
-begin if tail<>head then
- begin if is_char_node(tail) then p:=tail
- else if type(tail)=ligature_node then p:=lig_char(tail)
- else return;
- f:=font(p);
- tail_append(new_kern(char_italic(f)(char_info(f)(character(p)))));
-@z
-@x later in that same module
-end;
-@y
-exit: end;
-@z
-
-257. Another debugging hack. (August 27)
-@x module 1339
-15: begin font_in_short_display:=null_font; short_display(n);
- end;
-@y
-15: begin font_in_short_display:=null_font; short_display(n);
- end;
-16: panicking:=not panicking;
-@z
-
-258. Redundant code eliminated (August 27)
-Module 531 needn't set and reset name_in_progress [but it's harmless].
-
-259. Bug: \input shouldn't occur during font size spec (Spivak; fixed August 27)
-@x module 1258
-@ @<Scan the font size specification@>=
-@y
-@ @<Scan the font size specification@>=
-name_in_progress:=true; {this keeps |cur_name| from being changed}
-@z
-@x module 1258
-else s:=-1000
-@y
-else s:=-1000;
-name_in_progress:=false
-@z
-
-260. \ifhbox and \ifvbox introduced. (August 27)
-@x module 487
-@d ifx_code=10 { `\.{\\ifx}' }
-@d if_eof_code=11 { `\.{\\ifeof}' }
-@d if_true_code=12 { `\.{\\iftrue}' }
-@d if_false_code=13 { `\.{\\iffalse}' }
-@d if_case_code=14 { `\.{\\ifcase}' }
-@y
-@d if_hbox_code=10 { `\.{\\ifhbox}' }
-@d if_vbox_code=11 { `\.{\\ifvbox}' }
-@d ifx_code=12 { `\.{\\ifx}' }
-@d if_eof_code=13 { `\.{\\ifeof}' }
-@d if_true_code=14 { `\.{\\iftrue}' }
-@d if_false_code=15 { `\.{\\iffalse}' }
-@d if_case_code=16 { `\.{\\ifcase}' }
-@z
-@x
-primitive("ifx",if_test,ifx_code);
-@y
-primitive("ifhbox",if_test,if_hbox_code);
-@!@:if_hbox_}{\.{\\ifhbox} primitive@>
-primitive("ifvbox",if_test,if_vbox_code);
-@!@:if_vbox_}{\.{\\ifvbox} primitive@>
-primitive("ifx",if_test,ifx_code);
-@z
-@x module 488
- ifx_code:print_esc("ifx");
-@y
- if_hbox_code:print_esc("ifhbox");
- if_vbox_code:print_esc("ifvbox");
- ifx_code:print_esc("ifx");
-@z
-@x module 501
-if_void_code: @<Test if a box is void@>;
-@y
-if_void_code, if_hbox_code, if_vbox_code: @<Test box register status@>;
-@z
-@x module 505
-@ @<Test if a box is void@>=
-begin scan_eight_bit_int; b:=(box(cur_val)=null);
-end
-@y
-@ @<Test box register status@>=
-begin scan_eight_bit_int; p:=box(cur_val);
-if this_if=if_void_code then b:=(p=null)
-else if p=null then b:=false
-else if this_if=if_hbox_code then b:=(type(p)=hlist_node)
-else b:=(type(p)=vlist_node);
-end
-
-261. Serious data structure error (found by Todd Allen, August 29)
-@x module 478 (an error introduced in change 231)
- q:=the_toks; link(p):=link(temp_head); p:=q;
-@y
- q:=the_toks;
- if link(temp_head)<>null then
- begin link(p):=link(temp_head); p:=q;
- end;
-@z
-
-262. Minor patch for efficiency (August 29)
-@x module 466
- begin store_new_token(info(r)); r:=link(r);
-@y
- begin fast_store_new_token(info(r)); r:=link(r);
-@z
-
-263. Minor patch to error message (August 29)
-@module 579
- print(" has "); print_int(font_params[f]);
- print(" fontdimen parameters");
-@.Font x has n fontdimen...@>
-@y
- print(" has only "); print_int(font_params[f]);
- print(" fontdimen parameters");
-@.Font x has only...@>
-@z
-
-*** The changes above comprise version 0.99999, used only at SAIL (August 29)
-
-264. funny blank spaces are showable (August 30)
-@x module 298
-spacer: print("blank space");
-@y
-spacer: chr_cmd("blank space ");
-@z
-
-265. \newlinechar [change 235] should affect print_char too (August 31)
-@x module 58
-procedure print_char(@!c:ascii_code); {prints a single character}
-begin case selector of
-term_and_log: begin wterm(xchr[c]); write(log_file,xchr[c]);
- incr(term_offset); incr(file_offset);
- if term_offset=max_print_line then
- begin wterm_cr; term_offset:=0;
- end;
- if file_offset=max_print_line then
- begin wlog_cr; file_offset:=0;
- end;
- end;
-log_only: begin write(log_file,xchr[c]); incr(file_offset);
- if file_offset=max_print_line then print_ln;
- end;
-term_only: begin wterm(xchr[c]); incr(term_offset);
- if term_offset=max_print_line then print_ln;
- end;
-no_print: do_nothing;
-pseudo: if tally<trick_count then trick_buf[tally mod error_line]:=c;
-new_string: begin if pool_ptr<pool_size then append_char(c);
- end; {drop characters if the string space is full}
-othercases write(write_file[selector],xchr[c])
-endcases;@/
-incr(tally);
-end;
-@y
-procedure print_char(@!s:ascii_code); {prints a single character}
-label exit;
-begin if @<Character |s| is the current new-line character@> then
- if selector<pseudo then
- begin print_ln; return;
- end;
-case selector of
-term_and_log: begin wterm(xchr[s]); wlog(xchr[s]);
- incr(term_offset); incr(file_offset);
- if term_offset=max_print_line then
- begin wterm_cr; term_offset:=0;
- end;
- if file_offset=max_print_line then
- begin wlog_cr; file_offset:=0;
- end;
- end;
-log_only: begin wlog(xchr[s]); incr(file_offset);
- if file_offset=max_print_line then print_ln;
- end;
-term_only: begin wterm(xchr[s]); incr(term_offset);
- if term_offset=max_print_line then print_ln;
- end;
-no_print: do_nothing;
-pseudo: if tally<trick_count then trick_buf[tally mod error_line]:=s;
-new_string: begin if pool_ptr<pool_size then append_char(s);
- end; {drop characters if the string space is full}
-othercases write(write_file[selector],xchr[s])
-endcases;@/
-incr(tally);
-exit:end;
-
-266. \lastkern,\lastpenalty,\unkern,\unpenalty (September 4)
-@x module 208
-@d unskip=25 {nullify glue ( \.{\\unskip} )}
-@y
-@d remove_item=25 {nullify last item ( \.{\\unpenalty},
- \.{\\unkern}, \.{\\unskip} )}
-@z
-@x module 208
-@d last_skip=69 {most recent glue ( \.{\\lastskip} )}
-@y
-@d last_item=69 {most recent item ( \.{\\lastpenalty},
- \.{\\lastkern}, \.{\\lastskip} )}
-@z
-@x module 265
-primitive("lastskip",last_skip,0);@/
-@!@:last_skip_}{\.{\\lastskip} primitive@>
-@y
-@z
-@x module 265
-primitive("the",the,0);
-@!@:the_}{\.{\\the} primitive@>
-primitive("toks",toks_register,0);
-@!@:toks_}{\.{\\toks} primitive@>
-primitive("unskip",unskip,0);@/
-@!@:unskip_}{\.{\\unskip} primitive@>
-@y
-primitive("the",the,0);@/
-@!@:the_}{\.{\\the} primitive@>
-primitive("toks",toks_register,0);@/
-@!@:toks_}{\.{\\toks} primitive@>
-@z
-@x module 266
-last_skip: print_esc("lastskip");
-@y
-@z
-@x module 266
-unskip: print_esc("unskip");
-@y
-@z
-@x module 413
-last_skip: @<Fetch the glue in the current node, if any@>;
-@y
-last_item: @<Fetch an item in the current node, if appropriate@>;
-@z
-@x module 416 [I also changed the comment]
-primitive("dp",set_box_dimen,depth_offset);
-@!@:dp_}{\.{\\dp} primitive@>
-@y
-primitive("dp",set_box_dimen,depth_offset);
-@!@:dp_}{\.{\\dp} primitive@>
-primitive("lastpenalty",last_item,int_val);
-@!@:last_penalty_}{\.{\\lastpenalty} primitive@>
-primitive("lastkern",last_item,dimen_val);
-@!@:last_kern_}{\.{\\lastkern} primitive@>
-primitive("lastskip",last_item,glue_val);
-@!@:last_skip_}{\.{\\lastskip} primitive@>
-@z
-@x module 417
-else print_esc("dp");
-@y
-else print_esc("dp");
-last_item: if chr_code=int_val then print_esc("lastpenalty")
-else if chr_code=dimen_val then print_esc("lastkern")
-else print_esc("lastskip");
-@z
-@x module 424
-@ Here is where \.{\\lastskip} is implemented. The reference count will be
-updated later.
-@:last_skip_}{\.{\\lastskip} primitive@>
-
-@<Fetch the glue in the current node, if any@>=
-begin cur_val:=zero_glue; cur_val_level:=glue_val;
-if not is_char_node(tail)and(mode<>0) then
- begin if type(tail)=glue_node then
- begin cur_val:=glue_ptr(tail);
- if subtype(tail)=mu_glue then cur_val_level:=mu_val;
- end;
- end
-else if (mode=vmode)and(tail=head)and(last_page_glue<>max_halfword) then
- cur_val:=last_page_glue;
-end
-@y
-@ Here is where \.{\\lastpenalty}, \.{\\lastkern}, and \.{\\lastskip} are
-implemented. The reference count for \.{\\lastskip} will be updated later.
-
-@<Fetch an item in the current node...@>=
-begin if cur_chr=glue_val then cur_val:=zero_glue@+else cur_val:=0;
-cur_val_level:=cur_chr;
-if not is_char_node(tail)and(mode<>0) then
- case cur_chr of
- int_val: if type(tail)=penalty_node then cur_val:=penalty(tail);
- dimen_val: if type(tail)=kern_node then cur_val:=width(tail);
- glue_val: if type(tail)=glue_node then
- begin cur_val:=glue_ptr(tail);
- if subtype(tail)=mu_glue then cur_val_level:=mu_val;
- end;
- end {there are no other cases}
-else if (mode=vmode)and(tail=head) then
- case cur_chr of
- int_val: cur_val:=last_penalty;
- dimen_val: cur_val:=last_kern;
- glue_val: if last_glue<>max_halfword then cur_val:=last_glue;
- end; {there are no other cases}
-end
-@z
-@x module 982 [also the comment changes]
-@!last_page_glue:pointer; {used to implement \.{\\lastskip}}
-@y
-@!last_glue:pointer; {used to implement \.{\\lastskip}}
-@!last_penalty:integer; {used to implement \.{\\lastpenalty}}
-@!last_kern:scaled; {used to implement \.{\\lastkern}}
-@z
-@x module 991
-last_page_glue:=max_halfword;
-@y
-last_glue:=max_halfword; last_penalty:=0; last_kern:=0;
-@z
-@x module 994
-@<Update the value of |last_page_glue|@>;
-@y
-@<Update the values of |last_glue|, |last_penalty|, and |last_kern|@>;
-@z
-@x module 996
-@ @<Update the value of |last_page_glue|@>=
-if last_page_glue<>max_halfword then delete_glue_ref(last_page_glue);
-if type(p)=glue_node then
- begin last_page_glue:=glue_ptr(p); add_glue_ref(last_page_glue);
- end
-else last_page_glue:=max_halfword
-@y
-@ @<Update the values of |last_glue|...@>=
-if last_glue<>max_halfword then delete_glue_ref(last_glue);
-last_penalty:=0; last_kern:=0;
-if type(p)=glue_node then
- begin last_glue:=glue_ptr(p); add_glue_ref(last_glue);
- end
-else begin last_glue:=max_halfword;
- if type(p)=penalty_node then last_penalty:=penalty(p)
- else if type(p)=kern_node then last_kern:=width(p);
- end
-@z
-@x module 1017
-if last_page_glue<>max_halfword then delete_glue_ref(last_page_glue);
-@<Start a new current page@>; {this sets |last_page_glue:=max_halfword|}
-@y
-if last_glue<>max_halfword then delete_glue_ref(last_glue);
-@<Start a new current page@>; {this sets |last_glue:=max_halfword|}
-@z
-@x module 1048
-vmode+vmove,hmode+hmove,mmode+hmove,any_mode(last_skip),
-@y
-vmode+vmove,hmode+hmove,mmode+hmove,any_mode(last_item),
-@z
-@x module 1104
-any_mode(unskip): delete_skip;
-@y
-any_mode(remove_item): delete_last;
-@z
-@x module 1105
-procedure delete_skip;
-var p:pointer; {runs through the current list}
-begin if (mode=vmode)and(tail=head) then
- @<Apologize for inability to do \.{\\unskip} now,
- unless the previous node was not glue@>
-else begin if not is_char_node(tail) then if type(tail)=glue_node then
-@y
-procedure delete_last;
-var p:pointer; {runs through the current list}
-begin if (mode=vmode)and(tail=head) then
- @<Apologize for inability to do the operation now,
- unless \.{\\unskip} follows non-glue@>
-else begin if not is_char_node(tail) then if type(tail)=cur_chr then
-@z
-@x module 1106
-@ @<Apologize for inability to do \.{\\unskip}...@>=
-begin if last_page_glue<>max_halfword then
- begin you_cant;
- help2("Sorry...I'm usually unable to take things from the current")@/
- ("page. Try `I\vskip-\lastskip' instead."); error;
-@y
-@ @<Apologize for inability to do the operation...@>=
-begin if (cur_chr<>glue_node)or(last_glue<>max_halfword) then
- begin you_cant;
- help2("Sorry...I'm usually unable to take things from the current")@/
- ("page. Try `I\vskip-\lastskip' instead.");
- if cur_chr=kern_node then help_line[0]:=
- ("page. Try `I\kern-\lastkern' instead.")
- else if cur_chr<>glue_node then help_line[0]:=@|
- ("page. Perhaps you can make the output routine do it.");
- error;
-@z
-@x module 1107
-primitive("unhbox",un_hbox,box_code);@/
-@y
-primitive("unpenalty",remove_item,penalty_node);@/
-@!@:un_penalty_}{\.{\\unpenalty} primitive@>
-primitive("unkern",remove_item,kern_node);@/
-@!@:un_kern_}{\.{\\unkern} primitive@>
-primitive("unskip",remove_item,glue_node);@/
-@!@:un_skip_}{\.{\\unskip} primitive@>
-primitive("unhbox",un_hbox,box_code);@/
-@z
-@x module 1108
-un_hbox: if chr_code=copy_code then print_esc("unhcopy")
-@y
-remove_item: if chr_code=glue_node then print_esc("unskip")
- else if chr_code=kern_node then print_esc("unkern")
- else print_esc("unpenalty");
-un_hbox: if chr_code=copy_code then print_esc("unhcopy")
-@z
-
-*** The above changes installed in version 0.999999 (September 5, 1983)
-
-267. Undo change 29: it was overkill and not needed (Sep 17)
-@x module 1257
-label exit, common_ending;
-var u:pointer; {user's font identifier}
-@!s:scaled; {stated ``at'' size, or negative of scaled magnification}
-@!f:internal_font_number; {runs through existing fonts}
-begin if job_name=0 then open_log_file;
- {avoid confusing \.{texput} with the font name}
-@<If the next token isn't a suitable control sequence, issue a complaint
- and |return|; otherwise set |u:=cs_ptr|, and set |hash_used| to the
- location of a ``frozen'' copy of the new font identifier@>;
-define(u,set_font,null_font); scan_optional_equals; scan_file_name;
-@<Scan the font size specification@>;
-@<If this font has already been loaded, set |f| to the internal
- font number and |goto common_ending|@>;
-f:=read_font_info(u,cur_name,cur_area,s);
-common_ending: equiv(u):=f; geq_define(hash_used,set_font,f);
-font_ident[f]:=hash_used;
-exit:end;
-@y
-label common_ending;
-var u:pointer; {user's font identifier}
-@!s:scaled; {stated ``at'' size, or negative of scaled magnification}
-@!f:internal_font_number; {runs through existing fonts}
-begin if job_name=0 then open_log_file;
- {avoid confusing \.{texput} with the font name}
-get_r_token; u:=cs_ptr;
-define(u,set_font,null_font); scan_optional_equals; scan_file_name;
-@<Scan the font size specification@>;
-@<If this font has already been loaded, set |f| to the internal
- font number and |goto common_ending|@>;
-f:=read_font_info(u,cur_name,cur_area,s);
-common_ending: equiv(u):=f; font_ident[f]:=u;
-end;
-@z
-@x module 1260
-@ We reserve a special control sequence for the font identifier; this one
-cannot be redefined by the user, so it is safe to return it as a value of
-\.{\\the\\font}.
-
-@<If the next token isn't a suitable control sequence...@>=
-get_r_token;
-if cs_ptr<hash_base then
- begin print_err("A font identifier must be a multiletter control sequence");
-@.A font identifier...@>
- help2("You should say, e.g., `\font\ffn=fontfilename'.")@/
- ("(I'm going to ignore the \font command you just gave.)");
- back_error; return;
- end;
-repeat if hash_is_full then overflow("hash size",hash_size);
-@:TeX capacity exceeded hash size}{\quad hash size@>
-decr(hash_used);
-until text(hash_used)=0; {search for an empty location in |hash|}
-u:=cs_ptr; text(hash_used):=text(u); {copy the name}
-@!stat incr(cs_count);@+tats@;@/
-@y
-@z
-Note: Since module 1260 has disappeared, module 1258 has been split into two.
-
-268. Minor change to diagnostic output format (September 18)
-@x module 211 [print_mode]
- 2:print("displayed math");
-@y
- 2:print("display math");
-@z
-
-269. Kerns inserted for accents must be explicit (September 20)
-@x module 1123
-@!p,@!q: pointer; {character and box nodes}
-@y
-@!p,@!q,@!r:pointer; {character, box, and kern nodes}
-@z
-@x module 1125
-link(tail):=new_kern(delta); link(link(tail)):=p;
-link(p):=new_kern(-a-delta); tail:=link(p); p:=q;
-@y
-r:=new_kern(delta); subtype(r):=explicit; link(tail):=r; link(r):=p;
-tail:=new_kern(-a-delta); subtype(tail):=explicit; link(p):=tail; p:=q;
-@z
-
-270. "log" changed to "transcript" in a few output messages (Sep 26)
-@x module 535
-prompt_file_name("log file name",".log");
-@y
-prompt_file_name("transcript file name",".log");
-@z
-@x module 1293
- ("lists on your terminal as well as on the log file.");
-@y
- ("lists on your terminal as well as in the transcript file.");
-@z
-@x module 1335
- print_nl("(see the log file for additional information)");
-@.see the log file...@>
-@y
- print_nl("(see the transcript file for additional information)");
-@.see the transcript file...@>
-@z
-
-271. Uninitialized variable bug (found by Bernd Schulze, 1 Oct 83)
-@x module 944
- begin if trie_op_ptr>=max_quarterword-1 then {overflow}
- begin trie_op_ptr:=max_quarterword;
- new_trie_op:=min_quarterword; return;
-@y we allow one more trie op (OK since trie_op_hash_size is big enough)
- begin if trie_op_ptr=max_quarterword then {overflow}
- begin new_trie_op:=min_quarterword; return;
-@z
-
-272. Spaces at end of lines ignored also in TEX.POOL (by DRF, 14 Oct 83)
-@x module 52
- begin if eoln(pool_file) then bad_pool('! TEX.POOL line too short.');
-@.TEX.POOL line too short@>
- read(pool_file,m); append_char(xord[m]);
-@y
- begin if eoln(pool_file) then m:=' '@+else read(pool_file,m);
- append_char(xord[m]);
-@z
-
-273. |history| updates (by DRF, 14 Oct 83)
-@x module 77
-deletions_allowed:=true; history:=spotless; error_count:=0;
-@y
-deletions_allowed:=true; error_count:=0; {|history| is initialized elsewhere}
-@z
-@x module 1332
-@p begin {@!|start_here|}
-@y
-@p begin {@!|start_here|}
-history:=fatal_error_stop; {in case we quit during initialization}
-@z
-@x ibid.
-main_control; {come to life}
-@y
-history:=spotless; {ready to go!}
-main_control; {come to life}
-@z
-
-274. improved "runaway" messages (suggested by FY, October 18)
-@x module 305 (the introductory comment is changed too)
-@d aligning=4 {|scanner_status| when reading an alignment preamble}
-
-@<Glob...@>=
-@!scanner_status : normal..aligning; {can a subfile end now?}
-@y
-@d aligning=4 {|scanner_status| when reading an alignment preamble}
-@d absorbing=5 {|scanner_status| when reading a balanced text}
-
-@<Glob...@>=
-@!scanner_status : normal..absorbing; {can a subfile end now?}
-@z
-@x module 306 (string space is also now conserved slightly)
- defining: begin print("definition?"); p:=def_ref;
- end;
- matching: begin print("argument?"); p:=temp_head;
- end;
- aligning: begin print("preamble?"); p:=hold_head;
- end;
- end; {there are no other cases}
- print_ln; show_token_list(link(p),null,error_line-10);
-@y
- defining: begin print("definition"); p:=def_ref;
- end;
- matching: begin print("argument"); p:=temp_head;
- end;
- aligning: begin print("preamble"); p:=hold_head;
- end;
- absorbing: begin print("text"); p:=def_ref;
- end;
- end; {there are no other cases}
- print_char("?");print_ln; show_token_list(link(p),null,error_line-10);
-@x module 339 (I also changed the module name)
-end; {there are no other cases}
-@y
-absorbing:begin print("text"); info(p):=right_brace_token+"}";
- end;
-end; {there are no other cases}
-@z
-@x module 473
-begin scanner_status:=defining; warning_index:=cs_ptr;
-def_ref:=get_avail; info(def_ref):=null;
-@y
-begin if macro_def then scanner_status:=defining
-@+else scanner_status:=absorbing;
-warning_index:=cs_ptr; def_ref:=get_avail; info(def_ref):=null;
-@z
-
-275. similar, but this corrects a real bug (found by FY, October 18)
-@x module 1226
- cs_ptr:=q;
- @<Get the next non-blank non-relax non-call token@>;
- if cur_cmd<>left_brace then @<If the righthand side is a token parameter
- or token register, finish the assignment and |goto done|@>;
- back_input; q:=scan_toks(false,false);
-@y
- @<Get the next non-blank non-relax non-call token@>;
- if cur_cmd<>left_brace then @<If the righthand side is a token parameter
- or token register, finish the assignment and |goto done|@>;
- back_input; cs_ptr:=q; q:=scan_toks(false,false);
-@z
-
-276. Change #119 should have changed module 1090 too (by Barry Smith, Oct 24)
-@x module 1183 [which was module 1090 at the time of change 119]
-begin if c mod delimited_code=above_code then scan_normal_dimen;
-if c>=delimited_code then
- begin scan_delimiter(garbage,false); scan_delimiter(garbage,false);
- end;
-@y
-begin if c>=delimited_code then
- begin scan_delimiter(garbage,false); scan_delimiter(garbage,false);
- end;
-if c mod delimited_code=above_code then scan_normal_dimen;
-@z
-
-277. Changes for efficiency, based on empirical frequency data (Nov 9)
-@x module 45 [since the result is true almost always]
-begin j:=str_start[s]; result:=false;
-while j<str_start[s+1] do
- begin if str_pool[j]<>buffer[k] then goto not_found;
-@y
-begin j:=str_start[s];
-while j<str_start[s+1] do
- begin if str_pool[j]<>buffer[k] then
- begin result:=false; goto not_found;
- end;
-@z
-@x module 380 [many compilers don't handle "while true do" very well]
-label done;
-begin loop begin get_next;
-@^inner loop@>
- if cur_cmd<=max_command then goto done;
- if cur_cmd>=call then
- if cur_cmd<end_template then macro_call
- else begin cs_ptr:=frozen_endv; cur_cmd:=endv;
- goto done; {|cur_chr=null_list|}
- end
- else expand;
- end;
-@y
-label restart,done;
-begin restart: get_next;
-@^inner loop@>
-if cur_cmd<=max_command then goto done;
-if cur_cmd>=call then
- if cur_cmd<end_template then macro_call
- else begin cs_ptr:=frozen_endv; cur_cmd:=endv;
- goto done; {|cur_chr=null_list|}
- end
-else expand;
-goto restart;
-@z
-@x module 829 [preparation for change to module 852]
-label exit,done,continue,deactivate;
-@y
-label exit,done,done1,continue,deactivate;
-@z
-@x module 830 [ditto]
-@!save_link:pointer; {temporarily holds value of |link(cur_p)|}
-@y
-@!save_link:pointer; {temporarily holds value of |link(cur_p)|}
-@!shortfall:scaled; {used in badness calculations}
-@z
-@x modue 851 [ditto]
-if cur_active_width[1]<line_width then
-@y
-shortfall:=line_width-cur_active_width[1]; {we're this much too short}
-if shortfall>0 then
-@z
-@x module 852 [avoid calling |badness| in most common case]
-else begin b:=badness(line_width-cur_active_width[1],cur_active_width[2]);
-@y
-else begin if shortfall>7230584 then if cur_active_width[2]<1663497 then
- begin b:=inf_bad; fit_class:=very_loose_fit; goto done1;
- end;
- b:=badness(shortfall,cur_active_width[2]);
-@z
-@x module 852, continued
- else fit_class:=decent_fit;
-@y
- else fit_class:=decent_fit;
- done1:
-@z
-@x module 853 [using |shortfall|, since we now have it]
-begin if cur_active_width[1]-line_width>cur_active_width[6] then
- b:=inf_bad+1
-else b:=badness(cur_active_width[1]-line_width,cur_active_width[6]);
-@y
-begin if -shortfall>cur_active_width[6] then b:=inf_bad+1
-else b:=badness(-shortfall,cur_active_width[6]);
-@z
-
-278. Forgotten |error| call (noticed by Gabi Kuper, December 3, 1983)
-@x module 500
- help1("I'm ignoring this; it doesn't match any \if.");
-@y
- help1("I'm ignoring this; it doesn't match any \if.");
- error;
-@z
-
-*** Version 1.0 released on December 3, 1983 incorporates all of the above.
- Version 1.1
-
-279. Problem with change 267 (found by Mike Urban, received 2 Feb 84)
-(I had overlooked many problems, e.g. `{\font\a=x \global\a}\the\font'
-and `\font\a=x \font\b=x \let\b=\undefined \the\a', etc.
-The remedy involves removal of the font_ident array, so there's a
-sprinkling of corrections in lots of modules. But basically the change
-is quite conservative, so it shouldn't spawn any new bugs (it says here).)
-
-@x module 174 (removing a reference to |font_ident|)
- else sprint_cs(font_ident[font(p)]);
-@y
- else @<Print the font identifier for |font(p)|@>;
-@z
-@x module 176 (removing a reference to |font_ident|)
- else sprint_cs(font_ident[font(p)]);
-@y
- else @<Print the font identifier for |font(p)|@>;
-@z
-@x module 222 (redefining and expanding the `frozen' area)
-@d frozen_null_font=frozen_control_sequence+9 {permanent `\.{\\nullfont}'}
-@d frozen_dont_expand=frozen_control_sequence+10
- {permanent `\.{\\notexpanded:}'}
-@d undefined_control_sequence=frozen_control_sequence+11 {dummy location}
-@y
-@d frozen_dont_expand=frozen_control_sequence+9
- {permanent `\.{\\notexpanded:}'}
-@d frozen_null_font=frozen_control_sequence+10
- {permanent `\.{\\nullfont}'}
-@d font_id_base=frozen_null_font-font_base
- {begins table of 257 permanent font identifiers}
-@d undefined_control_sequence=frozen_null_font+257 {dummy location}
-@z
-@x module 234 (removing a reference to |font_ident|, awkwardly)
-print_char("="); sprint_cs(font_ident[equiv(n)]);
-@y
-print_char("=");@/
-print_esc(hash[font_id_base+equiv(n)].rh);
- {that's |text(font_id_base+equiv(n))|}
-@z
-@x module 256 (adding a new macro, font_id_text)
-@d hash_is_full == (hash_used=hash_base) {test if all positions are occupied}
-@y
-@d hash_is_full == (hash_used=hash_base) {test if all positions are occupied}
-@d font_id_text(#) == text(font_id_base+#) {a frozen font identifier's name}
-@z
-@x module 262 (relaxing a former restriction)
-else if (text(p)<128)or(text(p)>=str_ptr) then print_esc("NONEXISTENT.")
-@y
-else if (text(p)<0)or(text(p)>=str_ptr) then print_esc("NONEXISTENT.")
-@z
-@x module 267 (pick up the changes from 174 and 176)
-@!@^Single-character primitives@>
-@y
-@!@^Single-character primitives@>
-
-Meanwhile, this is a convenient place to catch up on something we were unable
-to do before the hash table was defined:
-
-@<Print the font identifier for |font(p)|@>=
-print_esc(font_id_text(font(p)))
-@z
-@x module 415 (removing another reference to font_ident)
- scanned_result(font_ident[cur_val])(ident_val);
-@y
- scanned_result(font_id_base+cur_val)(ident_val);
-@z
-@x module 548 (change to the comment only)
-to the user's font~\.{\\f}. For example, if this internal number is 13,
-we will have |font_ident[13]=p| and |equiv(p)=13|, where |p| is the |eqtb|
-location of the control sequence~\.{\\f}.
-@y
-to the user's font~\.{\\f}. Adding this number to |font_id_base| gives the
-|eqtb| location of a ``frozen'' control sequence that will always select
-the font.
-@z
-@x module 549 (deleting the declaration of font_ident)
-@!font_ident:array[internal_font_number] of pointer; {the most recent user
- font identifier corresponding to an internal font number}
-@y
-@z
-@x module 552 (deleting an unnecessary initialization of font_ident)
-font_ident[null_font]:=frozen_null_font;
-@y
-@z
-@x module 579 (removing another reference to font_ident)
- begin print_err("Font "); sprint_cs(font_ident[f]);
-@y
- begin print_err("Font "); print_esc(font_id_text(f));
-@z
-@x module 1257 (this is the real change!)
-begin if job_name=0 then open_log_file;
- {avoid confusing \.{texput} with the font name}
-get_r_token; u:=cs_ptr;
-define(u,set_font,null_font); scan_optional_equals; scan_file_name;
-@<Scan the font size specification@>;
-@<If this font has already been loaded, set |f| to the internal
- font number and |goto common_ending|@>;
-f:=read_font_info(u,cur_name,cur_area,s);
-common_ending: equiv(u):=f; font_ident[f]:=u;
-@y
-@!t:str_number; {name for the frozen font identifier}
-@!old_setting:0..max_selector; {holds |selector| setting}
-begin if job_name=0 then open_log_file;
- {avoid confusing \.{texput} with the font name}
-get_r_token; u:=cs_ptr;
-if u>=hash_base then t:=text(u)
-else if u>=single_base then
- if u=null_cs then t:="FONT"@+else t:=u-single_base
-else begin old_setting:=selector; selector:=new_string;
- print("FONT"); print(u-active_base); selector:=old_setting;
-@.FONTx@>
- str_room(1); t:=make_string;
- end;
-define(u,set_font,null_font); scan_optional_equals; scan_file_name;
-@<Scan the font size specification@>;
-@<If this font has already been loaded, set |f| to the internal
- font number and |goto common_ending|@>;
-f:=read_font_info(u,cur_name,cur_area,s);
-common_ending: equiv(u):=f; eqtb[font_id_base+f]:=eqtb[u]; font_id_text(f):=t;
-@z
-@x module 1260 (change to the comment only)
-the new value becomes the |font_ident| of record. Font names `\.{xyz}' and
-@y
-the new name becomes the font identifier of record. Font names `\.{xyz}' and
-@z
-@x module 1322 (no need to dump font_ident)
-begin dump_int(font_ident[k]);
-dump_qqqq(font_check[k]);
-@y
-begin dump_qqqq(font_check[k]);
-@z
-@x module 1322 (or to print from it)
-print_nl("\font"); sprint_cs(font_ident[k]); print_char("=");
-@y
-print_nl("\font"); print_esc(font_id_text(k)); print_char("=");
-@z
-@x module 1323 (or to undump it)
-begin undump(active_base)(undefined_control_sequence)(font_ident[k]);
-undump_qqqq(font_check[k]);@/
-@y
-begin undump_qqqq(font_check[k]);@/
-@z
-
-280. Double interrupt possibility (found by Clint Cuzzo, received 9 Feb 84)
-@x module 1031
-if interrupt>0 then if OK_to_interrupt then
- begin back_input; pause_for_instructions; goto big_switch;
-@y
-if interrupt<>0 then if OK_to_interrupt then
- begin back_input; check_interrupt; goto big_switch;
-@z
-
-281. Improve spacing in $(A,<)$. (12 Feb 84)
-@x module 764
-"0234000122*4000133**3**344*0400400*000000234000111*4111112341011"
-@y
-"0234000122*4000133**3**344*0400400*000000234000111*1111112341011"
-@z
-
-282. Bad goto! (diagnosis by Clint Cuzzo and George O'Connor, recd 13 Feb 84)
-@x module 344 (here we simply change the name of module 346)
-any_state_plus(invalid_char): @<Decry the invalid character and
- |goto switch|@>;
-@y
-any_state_plus(invalid_char): @<Decry the invalid character and
- |goto restart|@>;
-@z
-@x module 346 (because clear_for_error_prompt might make state=token_list)
-goto switch;
-@y
-goto restart;
-@z
-
-283. String pool economy (suggested by DRF, 13 Feb 84)
-@x module 537
-@<Read the first line of the new file@>;
-@y
-if name=str_ptr-1 then {we can conserve string pool space now}
- begin flush_string; name:=cur_name;
- end;
-@<Read the first line of the new file@>;
-@z
-
-284. Nicer scaled output (suggested by METAFONT development, 26 Feb 84)
-@x module 103
-be reproduced exactly. [{\sl Proof:\/} If round$(x)=\lfloor
-x+{1\over2}\rfloor$ and if $\alpha<1$, it is not difficult to verify that
-round$(\alpha\,\hbox{round}( \alpha^{-1}n))=n$ for all integers |n|. In
-our case $\alpha=2^{16}/10^5$.]
-
-@p procedure print_scaled(@!s:scaled); {prints scaled real, rounded to five
- digits}
-begin if s<0 then
- begin print_char("-"); negate(s); {print the sign, if negative}
- end;
-print_int(s div unity); {print the integer part}
-s:=((s mod unity) * 3125 + 1024) div 2048;
- {now |0<=s<100000| is the fraction part}
-print_char(".");
-repeat print_char("0"+(s div 10000)); s:=10*(s mod 10000);
-until s=0;
-end;
-@y
-be reproduced exactly; the ``simplest'' such decimal number is output,
-but there is always at least one digit following the decimal point.
-
-The invariant relation in the \&{repeat} loop is that a sequence of
-decimal digits yet to be printed will yield the original number if and only if
-they form a fraction~$f$ in the range $s-\delta\L10\cdot2^{16}f<s$.
-We can stop if and only if $f=0$ satisfies this condition; the loop will
-terminate before $s$ can possibly become zero.
-
-@p procedure print_scaled(@!s:scaled); {prints scaled real, rounded to five
- digits}
-var delta:scaled; {amount of allowable inaccuracy}
-begin if s<0 then
- begin print_char("-"); negate(s); {print the sign, if negative}
- end;
-print_int(s div unity); {print the integer part}
-print_char(".");
-s:=10*(s mod unity)+5; delta:=10;
-repeat if delta>unity then s:=s+@'100000-(delta div 2); {round the last digit}
-print_char("0"+(s div unity)); s:=10*(s mod unity); delta:=delta*10;
-until s<=delta;
-end;
-@z
-
-*** Those six changes account for version 1.1 (February 29, 1984).
-*** And we put the following change in too, at the last minute:
-
-285. ".00000762939453126pt" didn't round correctly! (March 2, 1984)
-@x module 452
- if k<16 then {digits for |k>=16| cannot affect the result}
-@y (Note, I also changed the comment in module 102: 16 -> 17)
- if k<17 then {digits for |k>=17| cannot affect the result}
-@z
-
-*** Note: I changed "cs_ptr" to "cur_cs", since the name change is more
-indicative of the fact that this variable makes a trio with cur_cmd
-and cur_chr. The TEX.WEB source changed 78 times, as a result, but
-none of the author's change files were affected.
-(But note: "save_cs_ptr" was not changed to "save_cur_cs", because
-of a name conflict.)
-
-*** And the following two were slipped in at the last second:
-
-286. loophole permitted get_next recursion (March 16, 1984)
-@x module 336
- begin @<Back up an outer control sequence so that it can be reread@>;
-@y
- begin deletions_allowed:=false;
- @<Back up an outer control sequence so that it can be reread@>;
-@z
-@x ibid
- end;
-@y
- deletions_allowed:=true;
- end;
-@z [the changes to deletions_allowed in module 338 can now be removed]
-
-287. terminal not open when the program starts bad (March 24, 1984)
-@x module 1332
-initialize; {set global variables to their starting values}
-@<Check the ``constant'' values...@>@;
-if bad>0 then
- begin wake_up_terminal;
- wterm('Ouch---my internal constants have been',
- ' clobbered!---case ',bad:1);
-@.Ouch...clobbered@>
- goto final_end;
- end;
-@y
-@<Check the ``constant'' values...@>@;
-if bad>0 then
- begin t_open_out;
- wterm('Ouch---my internal constants have been',
- ' clobbered!---case ',bad:1);
-@.Ouch...clobbered@>
- goto final_end;
- end;
-initialize; {set global variables to their starting values}
-@z
-
-*** Note: "Cosmetic" changes were also made in module 363 ("print_ln"
-moved to after "wake_up_terminal") and in some commentary.
-
-*** Another last-minute correction:
-288. \patterns{xxx...xxxdxxxdxxx} anomaly found by JRD (Mar 27, 1984)
-@x module 962
-else begin hyf[k]:=cur_chr-"0"; digit_sensed:=true;
-@y
-else begin hyf[k]:=cur_chr-"0";
- if k<63 then digit_sensed:=true;
-@z
-
-*** Yoicks, yet ANOTHER:
-289. a whole case of copy_node_list forgotten (Apr 11, 1984)
-@x module 206
-othercases confusion("copying")
-@y
-adjust_node: begin r:=get_node(small_node_size);
- adjust_ptr(r):=copy_node_list(adjust_ptr(p));
- end; {|words=1=small_node_size-1|}
-othercases confusion("copying")
-@z
-
-*** And "finally"...
-290. uninitialized variables could be accessed (found by Nick Briggs, June 11)
-@x module 552
-font_size[null_font]:=0; font_dsize[null_font]:=0;
-@y
-font_size[null_font]:=0; font_dsize[null_font]:=0;
-char_base[null_font]:=0; width_base[null_font]:=0;
-height_base[null_font]:=0; depth_base[null_font]:=0;
-italic_base[null_font]:=0; lig_kern_base[null_font]:=0;
-kern_base[null_font]:=0; exten_base[null_font]:=0;
-@z (actual values are immaterial except for debugging safeguards)
-
-291. same, cf. modules 355 and 389 (Nick Briggs, June 11)
-@x module 331
-scanner_status:=normal; first:=1;
-@y
-for first:=0 to buf_size do buffer[first]:=0;
-scanner_status:=normal; warning_index:=null; first:=1;
-@z (error was harmless except that it might trigger debugging checks)
-
-292. missing ligature/kern (found by JRD, June 21)
-@x module 1036
- if (cur_cmd=letter)or(cur_cmd=other_char) then r:=qi(cur_chr)
-@y
- if (cur_cmd=letter)or(cur_cmd=other_char)or(cur_cmd=char_given) then
- r:=qi(cur_chr)
-@z
-
-293. quarterword constraint is made explicit (July 4)
-@x module 111
-if (buf_size>max_halfword) then bad:=18;
-@y
-if buf_size>max_halfword then bad:=18;
-if max_quarterword-min_quarterword<255 then bad:=19;
-@z
-
-294. trivial optimization made for consistency with MF (July 7)
-@x module 363
-if (pausing>0)and(interaction>nonstop_mode) then
-@y
-if pausing>0 then if interaction>nonstop_mode then
-@z
-
-295. \tracingmacros>1 for more diagnostics (July 8)
-@x module 323
- if t=macro then param_start:=param_ptr@+else loc:=link(p);
-@y
- if t=macro then param_start:=param_ptr
- else begin loc:=link(p);
- if tracing_macros>1 then
- begin begin_diagnostic; print_nl("");
- case t of
- mark_text:print_esc("mark");
- write_text:print_esc("write");
- othercases print_cmd_chr(assign_toks,t-output_text+output_routine_loc)
- endcases;@/
- print("->"); token_show(p); end_diagnostic(false);
- end;
- end;
-@z
-
-*** The changes above were incorporated in Version 1.1, released July 9, 1984.
- Version 1.2
-
-296. "see the transcript file" on offline show commands. (July 27, 1984)
-@x module 1293
-@ @d show_error==@;@/
- if interaction<error_stop_mode then
- begin help0; decr(error_count);
- end
- else if tracing_online>0 then
- begin@t@>@;@/
- help3("This isn't an error message; I'm just \showing something.")
- @t\4\4@>@/
- ("Type `I\show...' to show more (e.g., \show\cs,")@/
- ("\showthe\count10, \showbox255, \showlists).");
- end
- else begin@t@>@;@/
- help5("This isn't an error message; I'm just \showing something.")
- @t\4\4@>@/
- ("Type `I\show...' to show more (e.g., \show\cs,")@/
- ("\showthe\count10, \showbox255, \showlists).")@/
- ("And type `I\tracingonline=1\show...' to show boxes and")@/
- ("lists on your terminal as well as in the transcript file.");
- end;
- error
-
-@<Declare act...@>=
-procedure show_whatever;
-var p:pointer; {tail of a token list to show}
-begin case cur_chr of
-show_code: @<Show the current meaning of a token@>;
-show_box_code: @<Show the current contents of a box@>;
-show_the_code: @<Show the current value of some parameter or register@>;
-othercases @<Show the current semantic nest@>
-endcases;
-end;
-@y
-@ @<Declare act...@>=
-procedure show_whatever;
-label common_ending;
-var p:pointer; {tail of a token list to show}
-begin case cur_chr of
-show_lists: begin begin_diagnostic; show_activities;
- end;
-show_box_code: @<Show the current contents of a box@>;
-show_code: @<Show the current meaning of a token, then |goto common_ending|@>;
-othercases @<Show the current value of some parameter or register,
- then |goto common_ending|@>
-endcases;@/
-@<Complete a potentially long \.{\\show} command@>;
-common_ending: if interaction<error_stop_mode then
- begin help0; decr(error_count);
- end
-else if tracing_online>0 then
- begin@t@>@;@/
- help3("This isn't an error message; I'm just \showing something.")@/
- ("Type `I\show...' to show more (e.g., \show\cs,")@/
- ("\showthe\count10, \showbox255, \showlists).");
- end
-else begin@t@>@;@/
- help5("This isn't an error message; I'm just \showing something.")
- ("Type `I\show...' to show more (e.g., \show\cs,")@/
- ("\showthe\count10, \showbox255, \showlists).")@/
- ("And type `I\tracingonline=1\show...' to show boxes and")@/
- ("lists on your terminal as well as in the transcript file.");
- end;
-error;
-end;
-@z
-@x module 1294
-@ @<Show the current meaning of a token@>=
-begin get_token; print_nl("> ");
-if cur_cs<>0 then
- begin sprint_cs(cur_cs); print_char("=");
- end;
-print_meaning; show_error;
-@y
-@ @<Show the current meaning of a token...@>=
-begin get_token; print_nl("> ");
-if cur_cs<>0 then
- begin sprint_cs(cur_cs); print_char("=");
- end;
-print_meaning; goto common_ending;
-@z
-@x module 1296
-end_diagnostic(true);
-print_err("OK");
-@.OK@>
-show_error;
-@y
-@z
-@x module 1297
-flush_list(link(temp_head)); show_error;
-@y
-flush_list(link(temp_head)); goto common_ending;
-@z
-@x module 1298
-@ @<Show the current semantic nest@>=
-begin begin_diagnostic; show_activities; end_diagnostic(true);
-print_err("OK");
-show_error;
-@.OK@>
-end
-@y
-@ @<Complete a potentially long \.{\\show} command@>=
-end_diagnostic(true); print_err("OK");
-@.OK@>
-if selector=term_and_log then if tracing_online<=0 then
- begin selector:=term_only; print(" (see the transcript file)");
- selector:=term_and_log;
- end
-@z
-
-297. allow `0' in response to error prompts (October 20, 1984)
-@x module 84
-"1","2","3","4","5","6","7","8","9": if deletions_allowed then
-@y
-"0","1","2","3","4","5","6","7","8","9": if deletions_allowed then
-@z
- Versions 1.3 and 1.4
-
-298. Dirty PASCAL (two quarterword 0's were read as a halfword) (25 Nov 84)
-@x module 846
-print(" -> @@@@"); print_int(serial(prev_break(passive)));
-@y
-print(" -> @@@@");
-if prev_break(passive)=null then print_char("0")
-else print_int(serial(prev_break(passive)));
-@z
-
-299. Ditto! (25 Nov 84)
-@x module 934
-label reswitch, exit, found, not_found;
-@y
-label reswitch, exit, found, not_found, done;
-@z
-@x module 939
-while info(p)>n-3 do {eliminate hyphens \TeX\ doesn't like}
- begin q:=link(p); free_avail(p); p:=q;
- end;
-@<Insert the \(p)pair |(s,p)| into the exception table@>;
-@y
-loop@+ begin if p=null then goto done;
- if info(p)<n-2 then goto done;
- q:=link(p); free_avail(p); p:=q; {eliminate hyphens that \TeX\ doesn't like}
- end;
-done: @<Insert the \(p)pair |(s,p)| into the exception table@>;
-@z
-
-300. Major change to memory management (25 Nov 84)
-[The following changes have two main merits: (1) TeX should run faster on
-virtual-memory systems when the jobs are small; (2) it should be possible
-to use the same production version of TeX both for jobs with lots of macros
-and few boxes as well as for jobs with lots of boxes and few macros, because
-the boundary line between the two types of storage is now chosen dynamically.]
-[The user is unaffected, except that there's only one "memory size" overflow
-error now instead of two.]
-[The TRIP test is now changed slightly: The correct settings of memory
-size parameters are now mem_min=mem_bot=1, mem_top=mem_max=3000.]
-
-@x module 11
-@!mem_max=30000; {greatest index in \TeX's internal |mem| array;
- must be strictly less than |max_halfword|}
-@y
-@!mem_max=30000; {greatest index in \TeX's internal |mem| array;
- must be strictly less than |max_halfword|;
- must be equal to |mem_top| in \.{INITEX}, otherwise |>=mem_top|}
-@!mem_min=0; {smallest index in \TeX's internal |mem| array;
- must be |min_halfword| or more;
- must be equal to |mem_bot| in \.{INITEX}, otherwise |<=mem_bot|}
-@z
-@x module 12
-@d mem_base=0 {smallest index in the |mem| array; must not be less
- than |min_halfword|}
-@d hi_mem_base=13000 {smallest index in the single-word area of |mem|;
- must be substantially larger than |mem_base| and smaller than |mem_max|}
-@y
-@d mem_bot=0 {smallest index in the |mem| array dumped by \.{INITEX};
- must not be less than |mem_min|}
-@d mem_top==30000 {largest index in the |mem| array dumped by \.{INITEX};
- must be substantially larger than |mem_bot|
- and not greater than |mem_max|}
-@z
-@x module 12
- about |(mem_max-hi_mem_base)/6|, but 2100 is already quite generous}
-@y
- about |(mem_max-mem_min)/10|, but 2100 is already quite generous}
-@z
-@x module 14
-if (hi_mem_base<mem_base+100)or(hi_mem_base+100>mem_max) then bad:=4;
-@y
-if mem_bot+1100>mem_top then bad:=4;
-@z
-@x module 111
-if (min_quarterword>0)or(max_quarterword<127) then bad:=11;
-@y
-init if (mem_min<>mem_bot)or(mem_max<>mem_top) then bad:=10;@+tini@;@/
-if (mem_min>mem_bot)or(mem_max<mem_top) then bad:=10;
-if (min_quarterword>0)or(max_quarterword<127) then bad:=11;
-@z
-@x module 111
-if (mem_base<min_halfword)or(mem_max>=max_halfword) then bad:=14;
-@y
-if (mem_min<min_halfword)or(mem_max>=max_halfword) then bad:=14;
-@z
-@x module 115
-value represents a null pointer.
-
-@d pointer==halfword {a flag or a location in |mem| or |eqtb|}
-@d null==mem_base {the null pointer}
-@y
-value represents a null pointer. \TeX\ does not assume that |mem[null]| exists.
-
-@d pointer==halfword {a flag or a location in |mem| or |eqtb|}
-@d null==min_halfword {the null pointer}
-@z
-@x module 116
-@ The |mem| array is divided once and for all into two regions that are
-allocated separately. Locations less than |hi_mem_base| are used for storing
-@y
-@ The |mem| array is divided into two regions that are allocated separately,
-but the dividing line between these two regions is not fixed; they grow
-together until finding their ``natural'' size in a particular job.
-Locations less than or equal to |lo_mem_max| are used for storing
-@z
-@x module 116
-relevant size when a node is freed. The remaining region of |mem| is
-allocated in single words using a conventional \.{AVAIL} stack.
-
-Incidentally, it would be feasible to construct implementations of \TeX\ that
-are based on 16-bit words instead of 32-bit words, for machines having
-comparatively small memories. In such cases it might be desirable to have
-two parallel arrays for the upper part of memory, called say \\{mem\_link}|[p]|
-and \\{mem\_info}|[p]|,
-since the single-word region in the present implementation
-consists entirely of |memory_word| items of type |two_halves|.
-@^small computers@>
-@y
-relevant size when a node is freed. Locations greater than or equal to
-|hi_mem_min| are used for storing one-word records; a conventional
-\.{AVAIL} stack is used for allocation in this region.
-
-Locations of |mem| between |mem_bot| and |mem_top| may be dumped as part
-of preloaded format files, by the \.{INITEX} preprocessor.
-@.INITEX@>
-Production versions of \TeX\ may extend the memory at both ends in order to
-provide more space; locations between |mem_min| and |mem_bot| are always
-used for variable-size nodes, and locations between |mem_top| and |mem_max|
-are always used for single-word nodes.
-
-The key pointers that govern |mem| allocation have a prescribed order:
-$$\hbox{|null<=mem_min<=mem_bot<lo_mem_max<
- hi_mem_min<mem_top<=mem_end<=mem_max|.}$$
-@z
-@x module 116
-@!mem : array[mem_base..mem_max] of memory_word; {the big dynamic storage area}
-@y
-@!mem : array[mem_min..mem_max] of memory_word; {the big dynamic storage area}
-@!lo_mem_max : pointer; {the largest location of variable-size memory in use}
-@!hi_mem_min : pointer; {the smallest location of one-word memory in use}
-@z
-@x module 117
-@!max_var_used : integer; {how much memory was in use}
-@y
-@z
-@x module 118
-occur between |hi_mem_base| and |mem_end|, inclusive, are of type
-@y
-occur between |hi_mem_min| and |mem_end|, inclusive, are of type
-@z
-@x module 120
-else begin runaway; {if memory is exhausted, display possible runaway text}
- overflow("macro memory size",mem_max+1-hi_mem_base);
- {quit; all one-word nodes are busy}
-@:TeX capacity exceeded macro memory size}{\quad macro memory size@>
- end;
-@y
-else begin decr(hi_mem_min); p:=hi_mem_min;
- if hi_mem_min<=lo_mem_max then
- begin runaway; {if memory is exhausted, display possible runaway text}
- overflow("main memory size",mem_max+1-mem_min);
- {quit; all one-word nodes are busy}
-@:TeX capacity exceeded main memory size}{\quad main memory size@>
- end;
- end;
-@z
-@x module 125
-label found,exit;
-@y
-label found,exit,restart;
-@z
-@x module 125
-begin p:=rover; {start at some free node in the ring}
-@y
-begin restart: p:=rover; {start at some free node in the ring}
-@z
-@x module 125
-overflow("box memory size",hi_mem_base-mem_base);
- {sorry, nothing satisfactory is left}
-@:TeX capacity exceeded box memory size}{\quad box memory size@>
-found: link(r):=null; {this node is now nonempty}
-@!stat var_used:=var_used+s; {maintain usage statistics}
-if var_used>max_var_used then max_var_used:=var_used;
-@y
-if lo_mem_max+2<hi_mem_min then
- @<Grow more variable-size memory and |goto restart|@>;
-overflow("main memory size",mem_max+1-mem_min);
- {sorry, nothing satisfactory is left}
-@:TeX capacity exceeded main memory size}{\quad main memory size@>
-found: link(r):=null; {this node is now nonempty}
-@!stat var_used:=var_used+s; {maintain usage statistics}
-@z
-@x modules 126--127
-@ Empirical tests show that the routine in this section performs a
-|remove_node| operation about 0.75 times per allocation, on the average,
-after which it finds that |r>p+1| about 95\% of the time.
-
-@<Try to allocate...@>=
-q:=p+node_size(p); {find the physical successor}
-@^inner loop@>
-while is_empty(q) do @<Merge node |p| with node |q|@>;
-r:=q-s;
-if r>p+1 then @<Allocate from the top of node |p| and |goto found|@>;
-if r=p then if ((rlink(p)<>rover) or (llink(p)<>rover)) then
- @<Allocate entire node |p| and |goto found|@>;
-node_size(p):=q-p {reset the size in case it grew}
-
-@ @<Merge node |p| with node |q|@>=
-begin t:=rlink(q);
-@^inner loop@>
-if q=rover then rover:=t;
-llink(t):=llink(q); rlink(llink(q)):=t;@/
-q:=q+node_size(q);
-end
-@y
-@ The lower part of |mem| grows by 1000 words at a time, unless
-we are very close to going under. When it grows, we simply link
-a new node into the available-space list. This method of controlled
-growth helps to keep the |mem| usage consecutive when \TeX\ is
-implemented on ``virtual memory'' systems.
-@^virtual memory@>
-
-@<Grow more variable-size memory and |goto restart|@>=
-begin if lo_mem_max+1000<hi_mem_min then t:=lo_mem_max+1000
-else t:=(lo_mem_max+hi_mem_min+2) div 2; {|lo_mem_max+2<=t<hi_mem_min|}
-p:=llink(rover); q:=lo_mem_max; rlink(p):=q; llink(rover):=q;@/
-rlink(q):=rover; llink(q):=p; link(q):=empty_flag; node_size(q):=t-lo_mem_max;@/
-lo_mem_max:=t; link(lo_mem_max):=null; info(lo_mem_max):=null;
-rover:=q; goto restart;
-end
-
-@ Empirical tests show that the routine in this section performs a
-node-merging operation about 0.75 times per allocation, on the average,
-after which it finds that |r>p+1| about 95\% of the time.
-
-@<Try to allocate...@>=
-q:=p+node_size(p); {find the physical successor}
-@^inner loop@>
-while is_empty(q) do {merge node |p| with node |q|}
- begin t:=rlink(q);
- if q=rover then rover:=t;
- llink(t):=llink(q); rlink(llink(q)):=t;@/
- q:=q+node_size(q);
- end;
-r:=q-s;
-if r>p+1 then @<Allocate from the top of node |p| and |goto found|@>;
-if r=p then if ((rlink(p)<>rover) or (llink(p)<>rover)) then
- @<Allocate entire node |p| and |goto found|@>;
-node_size(p):=q-p {reset the size in case it grew}
-@z
-% module 129 no longer refers to remove_node; I don't recall when it changed!
-@x module 134
-@d is_char_node(#) == (#>hi_mem_base)
-@y
-@d is_char_node(#) == (#>=hi_mem_min)
-@z
-@x module 162
-example, locations |mem_base| to |mem_base+3| are always used to store the
-specification for glue that is `\.{0pt plus 0pt minus 0pt}'. The
-following macro definitions accomplish the static allocation by giving
-symbolic names to the fixed positions. Dynamic allocation of variable-size
-nodes is restricted to locations |first_mem| through |(hi_mem_base-1)|,
-and single-word nodes are dynamically allocated in locations |second_mem|
-through |mem_max|, inclusive. It is harmless to let |lig_trick|, |garbage|,
-and |backup_head| share the same location of |mem|.
-
-@d zero_glue==mem_base {specification for \.{0pt plus 0pt minus 0pt}}
-@y
-example, locations |mem_bot| to |mem_bot+3| are always used to store the
-specification for glue that is `\.{0pt plus 0pt minus 0pt}'. The
-following macro definitions accomplish the static allocation by giving
-symbolic names to the fixed positions. Static variable-size nodes appear
-in locations |mem_bot| through |lo_mem_stat_max|, and static single-word nodes
-appear in locations |hi_mem_stat_min| through |mem_top|, inclusive. It is
-harmless to let |lig_trick|, |garbage|, and |backup_head| share the same
-location of |mem|.
-
-@d zero_glue==mem_bot {specification for \.{0pt plus 0pt minus 0pt}}
-@z
-@x module 162
-@d first_mem==fil_neg_glue+glue_spec_size {first dynamically allocatable word
- in the variable-size |mem|}
-@#
-@d page_ins_head==hi_mem_base {list of insertion data for current page}
-@d contrib_head==hi_mem_base+1 {vlist of items not yet on current page}
-@d page_head==hi_mem_base+2 {vlist for current page}
-@d temp_head==hi_mem_base+3 {head of a temporary list of some kind}
-@d hold_head==hi_mem_base+4 {head of a temporary list of another kind}
-@d adjust_head==hi_mem_base+5 {head of adjustment list returned by |hpack|}
-@d active==hi_mem_base+6 {head of active list in |line_break|, needs two words}
-@d align_head==hi_mem_base+8 {head of preamble list for alignments}
-@d end_span==hi_mem_base+9 {tail of spanned-width lists}
-@d omit_template==hi_mem_base+10 {a constant token list}
-@d null_list==hi_mem_base+11 {permanently empty list}
-@d lig_trick==hi_mem_base+12 {a ligature masquerading as a |char_node|}
-@d garbage==hi_mem_base+12 {used for scrap information}
-@d backup_head==hi_mem_base+13 {head of token list built by |scan_keyword|}
-@d second_mem==hi_mem_base+14 {first dynamically allocatable word in
- the one-word |mem|}
-@y
-@d lo_mem_stat_max==fil_neg_glue+glue_spec_size-1 {largest statically
- allocated word in the variable-size |mem|}
-@#
-@d page_ins_head==mem_top {list of insertion data for current page}
-@d contrib_head==mem_top-1 {vlist of items not yet on current page}
-@d page_head==mem_top-2 {vlist for current page}
-@d temp_head==mem_top-3 {head of a temporary list of some kind}
-@d hold_head==mem_top-4 {head of a temporary list of another kind}
-@d adjust_head==mem_top-5 {head of adjustment list returned by |hpack|}
-@d active==mem_top-6 {head of active list in |line_break|, needs two words}
-@d align_head==mem_top-8 {head of preamble list for alignments}
-@d end_span==mem_top-9 {tail of spanned-width lists}
-@d omit_template==mem_top-10 {a constant token list}
-@d null_list==mem_top-11 {permanently empty list}
-@d lig_trick==mem_top-12 {a ligature masquerading as a |char_node|}
-@d garbage==mem_top-12 {used for scrap information}
-@d backup_head==mem_top-13 {head of token list built by |scan_keyword|}
-@d hi_mem_stat_min==mem_top-13 {smallest statically allocated word in
- the one-word |mem|}
-@z
-@x module 164
-for k:=mem_base+1 to first_mem-1 do mem[k].sc:=0;
- {all glue dimensions are zeroed}
-@^data structure assumptions@>
-k:=mem_base;@+while k<first_mem do {set first words of glue specifications}
-@y
-for k:=mem_bot+1 to lo_mem_stat_max do mem[k].sc:=0;
- {all glue dimensions are zeroed}
-@^data structure assumptions@>
-k:=mem_bot;@+while k<=lo_mem_stat_max do
- {set first words of glue specifications}
-@z
-@x module 164
-rover:=first_mem; link(rover):=empty_flag; {now initialize the dynamic memory}
-node_size(rover):=hi_mem_base-rover; {which is one big available node}
-llink(rover):=rover; rlink(rover):=rover;@/
-link(hi_mem_base):=null; info(hi_mem_base):=null;
-for k:=hi_mem_base+1 to second_mem-1 do
- mem[k]:=mem[hi_mem_base];{clear list heads}
-@<Initialize the special list heads and constant nodes@>;
-avail:=null; mem_end:=second_mem-1; {initialize the one-word memory}
-var_used:=first_mem-mem_base; dyn_used:=second_mem-hi_mem_base;
-max_var_used:=var_used; {initialize statistics}
-@y
-rover:=lo_mem_stat_max+1;
-link(rover):=empty_flag; {now initialize the dynamic memory}
-node_size(rover):=1000; {which is a 1000-word available node}
-llink(rover):=rover; rlink(rover):=rover;@/
-lo_mem_max:=rover+1000; link(lo_mem_max):=null; info(lo_mem_max):=null;@/
-for k:=hi_mem_stat_min to mem_top do
- mem[k]:=mem[lo_mem_max]; {clear list heads}
-@<Initialize the special list heads and constant nodes@>;
-avail:=null; mem_end:=mem_top;
-hi_mem_min:=hi_mem_stat_min; {initialize the one-word memory}
-var_used:=lo_mem_stat_max+1-mem_bot; dyn_used:=mem_top+1-hi_mem_stat_min;
- {initialize statistics}
-@z
-@x module 165
-@t\hskip1em@>@!was_mem_end: pointer; {previous |mem_end|}
-@y
-@t\hskip1em@>@!was_mem_end,@!was_lo_max,@!was_hi_min: pointer;
- {previous |mem_end|, |lo_mem_max|,and |hi_mem_min|}
-@z
-@x module 166
-@!debug was_mem_end:=mem_base; {indicate that everything was previously free}
-@y
-@!debug was_mem_end:=mem_min; {indicate that everything was previously free}
-was_lo_max:=mem_min; was_hi_min:=mem_max;
-@z
-@x module 167
-begin for p:=mem_base to mem_end do free[p]:=false; {you can probably
- do this faster}
-@y
-begin for p:=mem_min to lo_mem_max do free[p]:=false; {you can probably
- do this faster}
-for p:=hi_mem_min to mem_end do free[p]:=false; {ditto}
-@z
-@x module 167
-for p:=0 to mem_end do was_free[p]:=free[p]; {|was_free:=free| might be faster}
-was_mem_end:=mem_end;
-@y
-for p:=mem_min to lo_mem_max do was_free[p]:=free[p];
-for p:=hi_mem_min to mem_end do was_free[p]:=free[p];
- {|was_free:=free| might be faster}
-was_mem_end:=mem_end; was_lo_max:=lo_mem_max; was_hi_min:=hi_mem_min;
-@z
-@x module 168
- begin if (p>mem_end)or(p<second_mem) then clobbered:=true
-@y
- begin if (p>mem_end)or(p<hi_mem_min) then clobbered:=true
-@z
-@x module 169
-repeat if (p>=hi_mem_base)or(p<first_mem) then clobbered:=true
- else if (rlink(p)>=hi_mem_base)or(rlink(p)<first_mem) then clobbered:=true
- else if not(is_empty(p))or(node_size(p)<2)or@|
- (p+node_size(p)>hi_mem_base)or@| (llink(rlink(p))<>p) then clobbered:=true;
-@y
-repeat if (p>=lo_mem_max)or(p<mem_min) then clobbered:=true
- else if (rlink(p)>=lo_mem_max)or(rlink(p)<mem_min) then clobbered:=true
- else if not(is_empty(p))or(node_size(p)<2)or@|
- (p+node_size(p)>lo_mem_max)or@| (llink(rlink(p))<>p) then clobbered:=true;
-@z
-@x module 170
-p:=mem_base;
-while p<=hi_mem_base do {node |p| should not be empty}
-@y
-p:=mem_min;
-while p<=lo_mem_max do {node |p| should not be empty}
-@z
-@x module 170
- while (p<=hi_mem_base) and not free[p] do incr(p);
- while (p<=hi_mem_base) and free[p] do incr(p);
-@y
- while (p<=lo_mem_max) and not free[p] do incr(p);
- while (p<=lo_mem_max) and free[p] do incr(p);
-@z
-@x module 171
-for p:=mem_base to mem_end do
- if not free[p] and ((p>was_mem_end) or was_free[p]) then
-@y
-for p:=mem_min to lo_mem_max do
- if not free[p] and ((p>was_lo_max) or was_free[p]) then
- begin print_char(" "); print_int(p);
- end;
-for p:=hi_mem_min to mem_end do
- if not free[p] and
- ((p<was_hi_min) or (p>was_mem_end) or was_free[p]) then
-@z
-@x module 172
-begin for q:=mem_base to mem_end do
-@y
-begin for q:=mem_min to lo_mem_max do
-@z
-@x module 172
-@<Search |eqtb| for equivalents equal to |p|@>;
-@y
-for q:=hi_mem_min to mem_end do
- begin if link(q)=p then
- begin print_nl("LINK("); print_int(q); print_char(")");
- end;
- if info(q)=p then
- begin print_nl("INFO("); print_int(q); print_char(")");
- end;
- end;
-@<Search |eqtb| for equivalents equal to |p|@>;
-@z
-@x module 176
-if (p<hi_mem_base)or(p>mem_end) then print_esc("CLOBBERED.")
-@y
-if (p<hi_mem_min)or(p>mem_end) then print_esc("CLOBBERED.")
-@z
-@x module 178
-begin if (p<mem_base)or(p>=hi_mem_base) then print_char("*")
-@y
-begin if (p<mem_min)or(p>=lo_mem_max) then print_char("*")
-@z
-@x module 293
-if (p<hi_mem_base) or (p>mem_end) then
-@y
-if (p<hi_mem_min) or (p>mem_end) then
-@z
-@x module 639
- print_int(dyn_used); print("; max so far: ");
- print_int(max_var_used); print_char("&");
- print_int(mem_end+1-hi_mem_base); print_ln;
-@y
- print_int(dyn_used); print("; still untouched: ");
- print_int(hi_mem_min-lo_mem_max-1); print_ln;
-@z
-@x module 857
-begin save_link:=link(cur_p); {this is OK even if |cur_p=null|}
-link(cur_p):=null; print_nl(""); short_display(link(printed_node));
-link(cur_p):=save_link; printed_node:=cur_p;
-@y
-begin print_nl("");
-if cur_p=null then short_display(link(printed_node))
-else begin save_link:=link(cur_p);
- link(cur_p):=null; print_nl(""); short_display(link(printed_node));
- link(cur_p):=save_link;
- end;
-printed_node:=cur_p;
-@z
-@x module 1249
-if 2*max_halfword<hi_mem_base-mem_base then bad:=41;
-@y
-if 2*max_halfword<mem_top-mem_min then bad:=41;
-@z
-@x module 1307
-dump_int(hi_mem_base);@/
-@y
-dump_int(mem_bot);@/
-dump_int(mem_top);@/
-@z
-@x module 1308
-if x<>hi_mem_base then goto bad_fmt;
-@y
-if x<>mem_bot then goto bad_fmt;
-undump_int(x);
-if x<>mem_top then goto bad_fmt;
-@z
-@x module 1311
-dump_int(rover);
-p:=mem_base; q:=rover; x:=0;
-@y
-dump_int(lo_mem_max); dump_int(rover);
-p:=mem_bot; q:=rover; x:=0;
-@z
-@x module 1311
-var_used:=var_used+hi_mem_base-p; dyn_used:=mem_end+1-hi_mem_base;@/
-dump_int(mem_end); dump_int(avail);
-for k:=p to mem_end do dump_wd(mem[k]);
-x:=x+mem_end+1-p;
-@y
-var_used:=var_used+lo_mem_max-p; dyn_used:=mem_end+1-hi_mem_min;@/
-for k:=p to lo_mem_max do dump_wd(mem[k]);
-x:=x+lo_mem_max+1-p;
-dump_int(hi_mem_min); dump_int(avail);
-for k:=hi_mem_min to mem_end do dump_wd(mem[k]);
-x:=x+mem_end+1-hi_mem_min;
-@z
-@x module 1312
-undump(min_halfword)(hi_mem_base)(rover);
-p:=mem_base; q:=rover; x:=0;
-repeat for k:=p to q+1 do undump_wd(mem[k]);
-p:=q+node_size(q);
-if (p>hi_mem_base)or((q>=rlink(q))and(rlink(q)<>rover)) then goto bad_fmt;
-q:=rlink(q);
-until q=rover;
-undump_size(hi_mem_base)(mem_max)('mem max')(mem_end);
-undump(null)(mem_end)(avail);
-for k:=p to mem_end do undump_wd(mem[k]);
-undump_int(var_used); undump_int(dyn_used);
-max_var_used:=var_used
-@y
-undump(lo_mem_stat_max+1000)(hi_mem_stat_min-1)(lo_mem_max);
-undump(lo_mem_stat_max+1)(lo_mem_max)(rover);
-p:=mem_bot; q:=rover; x:=0;
-repeat for k:=p to q+1 do undump_wd(mem[k]);
-p:=q+node_size(q);
-if (p>lo_mem_max)or((q>=rlink(q))and(rlink(q)<>rover)) then goto bad_fmt;
-q:=rlink(q);
-until q=rover;
-for k:=p to lo_mem_max do undump_wd(mem[k]);
-if mem_min<mem_bot-2 then {make more low memory available}
- begin p:=llink(rover); q:=mem_min+1;
- link(mem_min):=null; info(mem_min):=null; {we don't use the bottom word}
- rlink(p):=q; llink(rover):=q;@/
- rlink(q):=rover; llink(q):=p; link(q):=empty_flag;
- node_size(q):=mem_bot-q;
- end;
-undump(lo_mem_max+1)(hi_mem_stat_min)(hi_mem_min);
-undump(null)(mem_top)(avail); mem_end:=mem_top;
-for k:=hi_mem_min to mem_end do undump_wd(mem[k]);
-undump_int(var_used); undump_int(dyn_used)
-@z
-@x module 1323
-undump(min_halfword)(hi_mem_base)(font_glue[k]);
-@y
-undump(min_halfword)(lo_mem_max)(font_glue[k]);
-@z
-@x module 1334
- wlog_ln(' ',max_var_used:1,'&',mem_end+1-hi_mem_base:1,@|
- ' words of memory out of ',
- hi_mem_base-mem_base:1,'&',mem_max+1-hi_mem_base:1);@/
-@y
- wlog_ln(' ',lo_mem_max-mem_min+mem_end-hi_mem_min+2:1,@|
- ' words of memory out of ',mem_end+1-mem_min:1);@/
-@z that's the end of change number 300!
-
-301. node_size field could overflow if low mem was too large (Dec 20, 1984)
-[This bug existed from the beginning, if hi_mem_base-first_mem>max_halfword!]
-@x module 111
-if (mem_min<min_halfword)or(mem_max>=max_halfword) then bad:=14;
-@y
-if (mem_min<min_halfword)or(mem_max>=max_halfword)or@|
- (mem_bot-mem_min>max_halfword+1) then bad:=14;
-@z
-@x module 125
-@!t:pointer; {temporary register}
-@y
-@!t:integer; {temporary register}
-@z
-@x module 125
-if lo_mem_max+2<hi_mem_min then
-@y
-if lo_mem_max+2<hi_mem_min then if lo_mem_max+2<=mem_bot+max_halfword then
-@z
-@x module 126
-rlink(q):=rover; llink(q):=p; link(q):=empty_flag; node_size(q):=t-lo_mem_max;@/
-@y
-if t>mem_bot+max_halfword then t:=mem_bot+max_halfword;
-rlink(q):=rover; llink(q):=p; link(q):=empty_flag; node_size(q):=t-lo_mem_max;@/
-@z
-
-302. Improvement to missing-format-file error (DRF, 5 Jan 85)
-@x module 524
-var j:0..buf_size; {the first space after the file name}
-begin if buffer[loc]="&" then
- begin incr(loc); j:=loc; buffer[last]:=" ";
- while buffer[j]<>" " do incr(j);
- pack_buffered_name(0,loc,j-1); {try first without the system file area}
- if w_open_in(fmt_file) then
- begin loc:=j; goto found;
- end;@/
- pack_buffered_name(format_area_length,loc,j-1);
- {now try the system format file area}
- if w_open_in(fmt_file) then
- begin loc:=j; goto found;
- end;
- wake_up_terminal;
- wterm_ln('Sorry, I can''t find that format;',' will try PLAIN.');
-@.Sorry, I can't find...@>
- end;
- {now pull out all the stops: try for the system \.{PLAIN} file}
-pack_buffered_name(format_default_length-format_ext_length,1,0);
-if not w_open_in(fmt_file) then
- begin wake_up_terminal;
- wterm_ln('I can''t find the PLAIN format file!');
-@.I can't find PLAIN...@>
-@.PLAIN@>
- open_fmt_file:=false; return;
- end;
-found:open_fmt_file:=true;
-@y
-var j:0..buf_size; {the first space after the format file name}
-begin j:=loc;
-if buffer[loc]="&" then
- begin incr(loc); j:=loc; buffer[last]:=" ";
- while buffer[j]<>" " do incr(j);
- pack_buffered_name(0,loc,j-1); {try first without the system file area}
- if w_open_in(fmt_file) then goto found;
- pack_buffered_name(format_area_length,loc,j-1);
- {now try the system format file area}
- if w_open_in(fmt_file) then goto found;
- wake_up_terminal;
- wterm_ln('Sorry, I can''t find that format;',' will try PLAIN.');
-@.Sorry, I can't find...@>
- update_terminal;
- end;
- {now pull out all the stops: try for the system \.{PLAIN} file}
-pack_buffered_name(format_default_length-format_ext_length,1,0);
-if not w_open_in(fmt_file) then
- begin wake_up_terminal;
- wterm_ln('I can''t find the PLAIN format file!');
-@.I can't find PLAIN...@>
-@.PLAIN@>
- open_fmt_file:=false; return;
- end;
-found:loc:=j; open_fmt_file:=true;
-@z
-
-303. Welcoming message appears sooner (DRF, Jan 7)
-@x module 61
-else begin print(format_ident); print_ln;
- end;
-@y
-else begin print(format_ident); print_ln;
- end;
-update_terminal;
-@z
-
-304. Minor change to help message in "confusion" (Jan 23)
-@x module 95
- help2("One of your earlier faux pas has wounded me deeply,")@/
- ("so I'm barely conscious. Please fix it and try again.");
-@y
- help2("One of your faux pas seems to have wounded me deeply...")@/
- ("in fact, I'm barely conscious. Please fix it and try again.");
-@z
-
-305. Improved logic for `(see the transcript file...)' (Jan 23)
-@x module 245
-if history=spotless then history:=warning_issued;
-if (tracing_online<=0)and(selector=term_and_log) then decr(selector);
-@y
-if (tracing_online<=0)and(selector=term_and_log) then
- begin decr(selector);
- if history=spotless then history:=warning_issued;
- end;
-@z
-
-306. Change 291 violated standard PASCAL (CET1, Feb 18)
-@x module 331
-for first:=0 to buf_size do buffer[first]:=0;
-@y since some procedures `threaten' |first| globally [BS/6192 sec 6.8.3.9]
-first:=buf_size; repeat buffer[first]:=0; decr(first); until first=0;
-@z
-
-307. Nonexistent character could be output via ligature hyphenation (April 11)
-@x module 582 (slight inefficiency removed while correcting this)
-begin if (font_bc[f]<=c)and(font_ec[f]>=c) then
-@y
-begin if font_bc[f]<=c then if font_ec[f]>=c then
-@z
-@x module 892 (likewise)
-@!hu:array[1..63] of ASCII_code; {like |hc|, before conversion to lowercase}
-@y
-@!hu:array[1..63] of ASCII_code; {like |hc|, before conversion to lowercase}
-@!hyf_char:integer; {hyphen character of the relevant font}
-@z
-@x module 896 (likewise)
-done2: if hyphen_char[hf]<0 then goto done1;
-if hyphen_char[hf]>255 then goto done1;
-@y
-done2: hyf_char:=hyphen_char[hf];
-if hyf_char<0 then goto done1;
-if hyf_char>255 then goto done1;
-@z
-@x module 912 and another local variable
-@!c:ASCII_code; {character temporarily replaced by a hyphen}
-@y
-@!c:ASCII_code; {character temporarily replaced by a hyphen}
-@!hyf_node:pointer; {the hyphen, if it exists}
-@z
-@x module 915 (this is the real bugfix)
-minor_tail:=null; c:=hu[i+1]; hu[i+1]:=hyphen_char[hf];
-repeat l:=reconstitute(l+1,i+1);
-if minor_tail=null then pre_break(r):=link(hold_head)
-else link(minor_tail):=link(hold_head);
-minor_tail:=link(hold_head);
-if link(minor_tail)<>null then minor_tail:=link(minor_tail);
-until l>i;
-hu[i+1]:=c; {restore the character in the hyphen position}
-decr(l); hyf[l]:=0
-@y
-minor_tail:=null; hyf_node:=new_character(hf,hyf_char);
-if hyf_node<>null then
- begin incr(i); c:=hu[i]; hu[i]:=hyf_char;
- end;
-repeat l:=reconstitute(l+1,i);
-if minor_tail=null then pre_break(r):=link(hold_head)
-else link(minor_tail):=link(hold_head);
-minor_tail:=link(hold_head);
-if link(minor_tail)<>null then minor_tail:=link(minor_tail);
-until l=i;
-if hyf_node<>null then
- begin hu[i]:=c; {restore the character in the hyphen position}
- free_avail(hyf_node); decr(i); l:=i;
- end;
-hyf[i]:=0
-@z
-@x module 918
-begin r:=new_disc; pre_break(r):=new_character(hf,hyphen_char[hf]);
-@y
-begin r:=new_disc; pre_break(r):=new_character(hf,hyf_char);
-@z
-
-308. Improper memory usage computed by INITEX in change 300. (DRF, April 15)
-@x module 162
-@d hi_mem_stat_min==mem_top-13 {smallest statically allocated word in
- the one-word |mem|}
-@y
-@d hi_mem_stat_min==mem_top-13 {smallest statically allocated word in
- the one-word |mem|}
-@d hi_mem_stat_usage=14 {the number of one-word nodes always present}
-@z
-@x module 164 (text macro without parentheses strikes again!)
-var_used:=lo_mem_stat_max+1-mem_bot; dyn_used:=mem_top+1-hi_mem_stat_min;
-@y
-var_used:=lo_mem_stat_max+1-mem_bot; dyn_used:=hi_mem_stat_usage;
-@z
-
-309. A faster |flush_list| routine for the inner loop. (DRF, April 16)
-@x module 123
-var q:pointer; {the successor of node |p|}
-begin while p<>null do
- begin q:=link(p); free_avail(p); p:=q;
- end;
-@y
-var @!q,@!r:pointer; {list traversers}
-begin if p<>null then
- begin r:=p;
- repeat q:=r; r:=link(r); @!stat decr(dyn_used);@+tats@/
- until r=null; {now |q| is the last node on the list}
- link(q):=avail; avail:=p;
- end;
-@z
-
-310. Kern for accent positioning could disappear after a line break (April 17)
-(Change 269 fixed only part of the problem!)
-@x module 155
-@d explicit=1 {|subtype| of kern nodes from \.{\\kern} and \.{\\/} and accents}
-@y
-@d explicit=1 {|subtype| of kern nodes from \.{\\kern} and \.{\\/}}
-@d acc_kern=2 {|subtype| of kern nodes from accents}
-@z
-@x module 191
-if subtype(p)<=explicit then
- begin print_esc("kern");
- if subtype(p)=explicit then print_char(" ");
- print_scaled(width(p));
-@y
-if subtype(p)<>mu_glue then
- begin print_esc("kern");
- if subtype(p)<>normal then print_char(" ");
- print_scaled(width(p));
- if subtype(p)=acc_kern then print(" (for accent)");
-@.for accent@>
-@z
-@x module 837
- math_node,kern_node: break_width[1]:=break_width[1]-width(s);
-@y
- math_node,kern_node: if subtype(s)=acc_kern then goto done
- else break_width[1]:=break_width[1]-width(s);
-@z
-@x module 879
- if non_discardable(q) then goto done1;
-@y
- if non_discardable(q) then goto done1;
- if subtype(q)=acc_kern then if type(q)=kern_node then goto done1;
-@z
-@x module 1125
-r:=new_kern(delta); subtype(r):=explicit; link(tail):=r; link(r):=p;
-tail:=new_kern(-a-delta); subtype(tail):=explicit; link(p):=tail; p:=q;
-@y
-r:=new_kern(delta); subtype(r):=acc_kern; link(tail):=r; link(r):=p;
-tail:=new_kern(-a-delta); subtype(tail):=acc_kern; link(p):=tail; p:=q;
-@z
-
-311. \lastbox and \unkern must not remove discretionary replacements (April 18)
-(Change 236 introduced this bug!)
-@x module 1079
-label exit;
-var p:pointer; {runs through the current list}
-@y
-label exit, done;
-var @!p,@!q:pointer; {run through the current list}
-@!m:quarterword; {the length of a replacement list}
-@z
-@x modules 1080 and 1081
- @<Apologize for inability to do \.{\\lastbox} now@>
-else begin if not is_char_node(tail) then
- if (type(tail)=hlist_node)or(type(tail)=vlist_node) then
- begin p:=head; cur_box:=tail; shift_amount(cur_box):=0;
- while link(p)<>tail do p:=link(p);
- tail:=p; link(p):=null;
- end;
- end;
-end
-
-@ @<Apologize for inability to do \.{\\lastbox} now@>=
-begin you_cant;
-help2("Sorry...I'm usually unable to take things from the current")@/
- ("page. This \lastbox will therefore be void."); error;
-end
-@y
- begin you_cant;
- help2("Sorry...I usually can't take things from the current page.")@/
- ("This \lastbox will therefore be void."); error;
- end
-else begin if not is_char_node(tail) then
- if (type(tail)=hlist_node)or(type(tail)=vlist_node) then
- @<Remove the last box, unless it's part of a discretionary@>;
- end;
-end
-
-@ @<Remove the last box...@>=
-begin q:=head;
-repeat p:=q;
-if not is_char_node(q) then if type(q)=disc_node then
- begin for m:=1 to replace_count(q) do p:=link(p);
- if p=tail then goto done;
- end;
-q:=link(p);
-until q=tail;
-cur_box:=tail; shift_amount(cur_box):=0;
-tail:=p; link(p):=null;
-done: end
-@z
-@x module 1105
-var p:pointer; {runs through the current list}
-@y
-label exit;
-var @!p,@!q:pointer; {run through the current list}
-@!m:quarterword; {the length of a replacement list}
-@z
-@x module 1105
- begin p:=head;
- while link(p)<>tail do p:=link(p);
- link(p):=null; flush_node_list(tail); tail:=p;
- end;
- end;
-end;
-@y
- begin q:=head;
- repeat p:=q;
- if not is_char_node(q) then if type(q)=disc_node then
- begin for m:=1 to replace_count(q) do p:=link(p);
- if p=tail then return;
- end;
- q:=link(p);
- until q=tail;
- link(p):=null; flush_node_list(tail); tail:=p;
- end;
- end;
-exit:end;
-@z
-@x module 1106
- help2("Sorry...I'm usually unable to take things from the current")@/
- ("page. Try `I\vskip-\lastskip' instead.");
- if cur_chr=kern_node then help_line[0]:=
- ("page. Try `I\kern-\lastkern' instead.")
- else if cur_chr<>glue_node then help_line[0]:=@|
- ("page. Perhaps you can make the output routine do it.");
-@y
- help2("Sorry...I usually can't take things from the current page.")@/
- ("Try `I\vskip-\lastskip' instead.");
- if cur_chr=kern_node then help_line[0]:=
- ("Try `I\kern-\lastkern' instead.")
- else if cur_chr<>glue_node then help_line[0]:=@|
- ("Perhaps you can make the output routine do it.");
-@z
-@x module 1120
-if n<128 then replace_count(tail):=n
-@y
-if n<=max_quarterword then replace_count(tail):=n
-@z
-
-
-*** Note by DEK, 18 Apr 1985
-(The code for version 1.3 has been published by Addison-Wesley under the
-title "TeX: The Program". It was phototypeset on our APS, but does not
-contain changes > 300. Some of those changes have been made in versions
-of TeX called 1.3; but the exact definition of version 1.3 is somewhat
-vague. Version 1.4 was released on April 18, 1985, after
-making change 311. At present I believe Version 1.4 will be identical
-to Version 2.0 except perhaps for things like index entries in the
-documentation and slightly revised help messages. Version 2.0 will
-coincide with the publication of Volume 1 of Computers and Typesetting,
-which will come out when METAFONT and Computer Modern are both finished.)
- Version 1.5
-312. if nonstandard area specified, don't try TEX_area too. (DRF, 26 Apr 85)
-@x module 537
- pack_file_name(cur_name,TEX_area,cur_ext);
- if a_open_in(cur_file) then goto done;
-@y
- if cur_area="" then
- begin pack_file_name(cur_name,TEX_area,cur_ext);
- if a_open_in(cur_file) then goto done;
- end;
-@z
-
-313. length of \write need no longer be limited (cf 235). (NBT, 30 Apr 85)
-@x module 1370
-show_token_list(link(def_ref),null,buf_size-10); print_ln;
-@y
-show_token_list(link(def_ref),null,10000000); print_ln;
-@z
-
-314. bug introduced in #300, just lucky it didn't cause trouble (CET1, 8 May 85)
-@x module 162
-@d active==mem_top-6 {head of active list in |line_break|, needs two words}
-@y
-@d active==mem_top-7 {head of active list in |line_break|, needs two words}
-@z
-
-315. Missing eoln after last typeout (Gropp, 11 May 85)
-@x module 1332
- wterm('Ouch---my internal constants have been',
-@y
- wterm_ln('Ouch---my internal constants have been',
-@z
-
-316. Redundancy (CET1, 17 May 85)
-[Change 287 was apparently introduced because of a faulty assumption,
-although its change to the calling of "initialize" was valid.]
-@x module 1332
- begin t_open_out;
- wterm_ln('Ouch---my internal constants have been',
- ' clobbered!---case ',bad:1);
-@y
- begin wterm_ln('Ouch---my internal constants have been clobbered!',
- '---case ',bad:1);
-@z
-
-317. batchmode to see if log file couldn't be opened (DRF, 22 May 85)
-@x module 92
-if interaction=batch_mode then decr(selector);
-if job_name=0 then open_log_file;
-@y
-if job_name=0 then open_log_file;
-if interaction=batch_mode then decr(selector);
-@z
-
-318. If the string pool overflows while reading the command line... (22 May 85)
-[This bug was first found in METAFONT, when it could occur more easily]
-@x module 525
-begin str_room(name_length);
-for k:=1 to name_length do append_char(xord[name_of_file[k]]);
-make_name_string:=make_string;
-@y
-begin if (pool_ptr+name_length>pool_size)or(str_ptr=max_strings) then
- make_name_string:="?"
-else begin for k:=1 to name_length do append_char(xord[name_of_file[k]]);
- make_name_string:=make_string;
- end;
-@z
-
-319. Bug in \edef\foo{\iffalse\fi\the\toks0} (found by Dan Brotsky, 7 Aug 85)
-@x module 478
- if cur_cmd<>the then goto done2;
- q:=the_toks;
- if link(temp_head)<>null then
- begin link(p):=link(temp_head); p:=q;
- end;
-@y
- if cur_cmd<=max_command then goto done2;
- if cur_cmd<>the then expand
- else begin q:=the_toks;
- if link(temp_head)<>null then
- begin link(p):=link(temp_head); p:=q;
- end;
- end;
-@z
-
-*** Version 1.5 was released on August 7, 1985.
-
-320. Lowercase `plain' for consistency with the manual
-@x module 521
-TEX_format_default:='TeXformats:PLAIN.fmt';
-@.TeXformats@>
-@.PLAIN@>
-@y
-TEX_format_default:='TeXformats:plain.fmt';
-@.TeXformats@>
-@.plain@>
-@z (index entries also changed to lowercase in modules 524, 1331)
-
-321. Terminal woken up by \show and \showthe (November 27, 1985)
-@x module 1294
-begin get_token; print_nl("> ");
-@y
-begin get_token;
-if interaction=error_stop_mode then wake_up_terminal;
-print_nl("> ");
-@z
-@x module 1297
-begin p:=the_toks; print_nl("> "); token_show(temp_head);
-@y
-begin p:=the_toks;
-if interaction=error_stop_mode then wake_up_terminal;
-print_nl("> "); token_show(temp_head);
-@z
- Changes subsequent to `Version 2.0' as published in C&T, Volume B:
-
-322. Trivial change to a help message.
-@x module 1283
- ("Pretend that you're Hercule Poirot, examine all clues,")@/
-@y
- ("Pretend that you're Hercule Poirot: Examine all clues,")@/
-@z
-
-323. Precaution since |index| can be as high as |max_in_open|. (DRF)
-@x module 14
-if hash_prime>hash_size then bad:=5;
-@y
-if hash_prime>hash_size then bad:=5;
-if max_in_open>=128 then bad:=6;
-@z
-
-324. \kern clobbered at end of pre-break list in discretionary break.
-@x module 881
- |disc_break:=true|@>;
- if not is_char_node(q) then
- if (type(q)=math_node)or(type(q)=kern_node) then width(q):=0;
-@y
- |disc_break:=true|@>
- else if (type(q)=math_node)or(type(q)=kern_node) then width(q):=0;
-@z
-
-325. width after discretionary didn't take account of discarded nodes.
-@x module 830 (slight redefinition)
-@!t:quarterword; {replacement count, if |cur_p| is a discretionary node}
-@y
-@!t:integer; {node count, if |cur_p| is a discretionary node}
-@z
-@x module 837 (slight rearrangement)
-if (break_type=unhyphenated)or(cur_p=null) then
- begin s:=cur_p;
- while s<>null do
- begin if is_char_node(s) then goto done;
- case type(s) of
- glue_node:@<Subtract glue from |break_width|@>;
- penalty_node: do_nothing;
- math_node,kern_node: if subtype(s)=acc_kern then goto done
- else break_width[1]:=break_width[1]-width(s);
- othercases goto done
- endcases;@/
- s:=link(s);
- end;
- end
-else @<Compute the discretionary |break_width| values@>;
-@y
-s:=cur_p;
-if break_type>unhyphenated then if cur_p<>null then
- @<Compute the discretionary |break_width| values@>;
-while s<>null do
- begin if is_char_node(s) then goto done;
- case type(s) of
- glue_node:@<Subtract glue from |break_width|@>;
- penalty_node: do_nothing;
- math_node,kern_node: if subtype(s)=acc_kern then goto done
- else break_width[1]:=break_width[1]-width(s);
- othercases goto done
- endcases;@/
- s:=link(s);
- end;
-@z
-@x module 840 (this is the main change to fix the bug)
-begin t:=replace_count(cur_p); s:=cur_p;
-while t>0 do
- begin decr(t); s:=link(s);
- @<Subtract the width of node |s| from |break_width|@>;
- end;
-s:=post_break(cur_p);
-while s<>null do
- begin @<Add the width of node |s| to |break_width|@>;
-@y
-begin t:=replace_count(cur_p); v:=cur_p; s:=post_break(cur_p);
-while t>0 do
- begin decr(t); v:=link(v);
- @<Subtract the width of node |v| from |break_width|@>;
- end;
-while s<>null do
- begin @<Add the width of node |s| to |break_width| and increase |t|,
- unless it's discardable@>;
-@z
-@x module 840, continued
-break_width[1]:=break_width[1]+disc_width;
-@y
-break_width[1]:=break_width[1]+disc_width;
-if t=0 then s:=link(v); {more nodes may also be discardable after the break}
-@z
-@x module 841 (here we just change |s| to |v|)
-@<Subtract the width of node |s|...@>=
-if is_char_node(s) then
- begin f:=font(s);
- break_width[1]:=break_width[1]-char_width(f)(char_info(f)(character(s)));
- end
-else case type(s) of
- ligature_node: begin f:=font(lig_char(s));@/
- break_width[1]:=@|break_width[1]-
- char_width(f)(char_info(f)(character(lig_char(s))));
- end;
- hlist_node,vlist_node,rule_node,kern_node:
- break_width[1]:=break_width[1]-width(s);
-@y
-@<Subtract the width of node |v|...@>=
-if is_char_node(v) then
- begin f:=font(v);
- break_width[1]:=break_width[1]-char_width(f)(char_info(f)(character(v)));
- end
-else case type(v) of
- ligature_node: begin f:=font(lig_char(v));@/
- break_width[1]:=@|break_width[1]-
- char_width(f)(char_info(f)(character(lig_char(v))));
- end;
- hlist_node,vlist_node,rule_node,kern_node:
- break_width[1]:=break_width[1]-width(v);
-@z
-@x module 842
- hlist_node,vlist_node,rule_node,kern_node:
- break_width[1]:=break_width[1]+width(s);
- othercases confusion("disc2")
-@:this can't happen disc2}{\quad disc2@>
- endcases
-@y
- hlist_node,vlist_node,rule_node:break_width[1]:=break_width[1]+width(s);
- kern_node: if (t=0)and(subtype(s)<>acc_kern) then t:=-1 {discardable}
- else break_width[1]:=break_width[1]+width(s);
- othercases confusion("disc2")
-@:this can't happen disc2}{\quad disc2@>
- endcases;
-incr(t)
-@z
-
-*** Version 2.1 was released on January 26, 1987.
-
-326. Removal of redundant code (found by Pat Monardo, 5 Feb 87)
-@x module 1224 [this change need not be made, since it has no effect]
- char_def_code: define(p,char_given,cur_val);
- math_char_def_code: define(p,math_given,cur_val);
-@y the cases cannot occur, so we simply don't list them
-@z
-
-327. More robustness is needed when debugging (Ronaldo Am\'a, 14 Apr 87)
-@x module 174
-begin while p>null do
-@y maybe mem_min>null (but nodes shouldn't be put in location mem_min exactly)
-begin while p>mem_min do
-@z
-@x module 182
-@p procedure show_node_list(@!p:pointer); {prints a node list symbolically}
-@y
-@p procedure show_node_list(@!p:integer); {prints a node list symbolically}
-@z
-@x module 182, continued
-while p>null do
-@y
-while p>mem_min do
-@z
-
-328. Storage allocation can be more elegant and efficient (4/21/87)
-@x module 127
-if r=p then if ((rlink(p)<>rover) or (llink(p)<>rover)) then
-@y
-if r=p then if rlink(p)<>p then
-@z
-
-329. Miscalculation of empty-line condition (April 22, 1987)
-@x module 360
- begin if limit=start then {previous line was empty}
-@y
- begin if (end_line_char<0)or(end_line_char>127) then incr(limit);
- if limit=start then {previous line was empty}
-@z
-
-330. A case where we don't have to assume system bookkeeping (April 28, 1987)
-@x module 560
-done: b_close(tfm_file); read_font_info:=g;
-@y [suggested by Jim Sterken]
-done: if file_opened then b_close(tfm_file);
-read_font_info:=g;
-@z [this was not a bug, according to the comment in module 28]
-
-331. jump_out must fix unfinished output (Found by Klaus Gunterman, 3 Aug 87)
-@x module 593
-doing_leaders:=false; dead_cycles:=0;
-@y
-doing_leaders:=false; dead_cycles:=0; cur_s:=-1;
-@z
-@x module 617
-cur_s:=-1; ensure_dvi_open;
-@y
-ensure_dvi_open;
-@z
-@x module 640
-dvi_out(eop); incr(total_pages);
-@y
-dvi_out(eop); incr(total_pages); cur_s:=-1;
-@z
-@x module 642
-if total_pages=0 then print_nl("No pages of output.")
-@y
-while cur_s>-1 do
- begin if cur_s>0 then dvi_out(pop)
- else begin dvi_out(eop); incr(total_pages);
- end;
- decr(cur_s);
- end;
-if total_pages=0 then print_nl("No pages of output.")
-@z
-
-332. \hangindent=1pt$$\halign{...\cr\noalign{\hrule}}$$ problem (19 Aug 87)
-@x module 805
-q:=link(head);
-@y
-q:=link(head); s:=head;
-@z
-@x module 805, continued
- q:=link(q);
-@y
- s:=q; q:=link(q);
-@z
-@x module 806
-if is_running(depth(q)) then depth(q):=depth(p);
-@y
-if is_running(depth(q)) then depth(q):=depth(p);
-if o<>0 then
- begin r:=link(q); link(q):=null; q:=hpack(q,natural);
- shift_amount(q):=o; link(q):=r; link(s):=q;
- end;
-@z
-
-333. \hskip 0pt plus 1fil\ifdim problem (found by Alan Guth, 20 Aug 87)
-@x module 366
-@!cvl_backup,@!radix_backup:small_number; {to save |cur_val_level| and |radix|}
-@y
-@!cvl_backup,@!radix_backup,@!co_backup:small_number;
- {to save |cur_val_level|, etc.}
-@z
-@x
-backup_backup:=link(backup_head);
-@y
-co_backup:=cur_order; backup_backup:=link(backup_head);
-@z
-@x
-link(backup_head):=backup_backup;
-@y
-cur_order:=co_backup; link(backup_head):=backup_backup;
-@z
-
-334. leaders too sensitive near exact multiples (M. F. Bridgland, 9 Nov 87)
-@x module 626
- begin edge:=cur_h+rule_wd; lx:=0;
-@y
- begin rule_wd:=rule_wd+10; {compensate for floating-point rounding}
- edge:=cur_h+rule_wd; lx:=0;
-@z
-@x ibid
- cur_h:=edge; goto next_p;
-@y
- cur_h:=edge-10; goto next_p;
-@z
-@x module 635
- begin edge:=cur_v+rule_ht; lx:=0;
-@y
- begin rule_ht:=rule_ht+10; {compensate for floating-point rounding}
- edge:=cur_v+rule_ht; lx:=0;
-@z
-@x ibid
- cur_v:=edge; goto next_p;
-@y
- cur_v:=edge-10; goto next_p;
-@z
-
-335. Glitch in fixed-point multiplication of negatives (W.G. Sullivan, 17Nov87)
-@x module 572
-begin alpha:=16*z; beta:=16;
-while z>=@'40000000 do
- begin z:=z div 2; beta:=beta div 2;
- end;
-@y
-begin alpha:=16;
-while z>=@'40000000 do
- begin z:=z div 2; alpha:=alpha+alpha;
- end;
-beta:=256 div alpha; alpha:=alpha*z;
-@z
-
-336. If there are no \patterns and some \lccode is 1 (Breitenlohner, 12Dec87)
-@x module 952
-trie_link(0):=0; trie_char(0):=0; trie_op(0):=0;
-@y
-trie_link(0):=0; trie_char(0):=0; trie_op(0):=min_quarterword;
-@z
-
-337. \csname might encounter undefined_cs in a group (Chris Thompson, 23Dec87)
-@x module 372
- begin eqtb[cur_cs]:=eqtb[frozen_relax];
-@y
- begin eq_define(cur_cs,relax,256);
-@z
-
-338. \outer\def\a0{}\a\a shows temp_head list garbage (Silvio Levy, 20Apr88)
-@x module 391
-repeat if (info(r)>match_token+127)or(info(r)<match_token) then s:=null
-else begin match_chr:=info(r)-match_token; s:=link(r); r:=s;
- p:=temp_head; link(p):=null; m:=0;
-@y
-repeat link(temp_head):=null;
-if (info(r)>match_token+127)or(info(r)<match_token) then s:=null
-else begin match_chr:=info(r)-match_token; s:=link(r); r:=s;
- p:=temp_head; m:=0;
-@z
-
-339. \def\\#1{}\input a\\\z failed (Robert Messer, 24Apr88)
-@x module 259
-var h:integer; {hash code}
-@y
-var h:integer; {hash code}
-@!d:integer; {number of characters in incomplete current string}
-@z
-@x module 260
-str_room(l);
-for k:=j to j+l-1 do append_char(buffer[k]);
-text(p):=make_string;
-@y
-str_room(l); d:=cur_length;
-while pool_ptr>str_start[str_ptr] do
- begin decr(pool_ptr); str_pool[pool_ptr+l]:=str_pool[pool_ptr];
- end; {move current string up to make room for another}
-for k:=j to j+l-1 do append_char(buffer[k]);
-text(p):=make_string; pool_ptr:=pool_ptr+d;
-@z
-
-340. Make patterns work when trie_min=0 (Peter Breitenlohner, 10May88)
-@x module 951
-trie_max:=128; trie_min:=128; trie_link(0):=1; trie_taken[0]:=false;
-@y
-trie_max:=128; trie_min:=128; trie_link(0):=1; trie_taken[0]:=false;
-trie_link(trie_size):=0; trie_back(0):=trie_size; {wrap around}
-@z
-@x module 953
-begin c:=trie_c[p]; {we have |c>0|}
-if c<trie_min then trie_min:=c;
-z:=trie_link(trie_min-1); {get the first conceivably good hole}
-@y
-begin c:=trie_c[p];
-if c<trie_min then trie_min:=c;
-if trie_min=0 then z:=trie_link(trie_size)
-else z:=trie_link(trie_min-1); {get the first conceivably good hole}
-@z
-@x module 966
-r:=0; {finally, we will zero out the holes}
-@y
-r:=trie_size; {finally, we will zero out the holes}
-@z
-
-341. Avoid possible trie_pointer out of range (24May88)
-@x module 923
-hc[0]:=127; hc[hn+1]:=127; hc[hn+2]:=256; {insert delimiters}
-@y
-hc[0]:=127; hc[hn+1]:=127; hc[hn+2]:=128; {insert delimiters}
-@z
-
-342. \input a\romannumeral1 etc.; similar to bug 339. (25May88)
-@x module 464
-@p function str_toks:pointer; {changes the current string to a token list}
-@y
-@p function str_toks(@!b:pool_pointer):pointer;
- {changes the string |str_pool[b..pool_ptr]| to a token list}
-@z
-@x module 464, continued
-p:=temp_head; link(p):=null; k:=str_start[str_ptr];
-@y
-p:=temp_head; link(p):=null; k:=b;
-@z
-@x module 464, concluded
-pool_ptr:=str_start[str_ptr]; str_toks:=p;
-@y
-pool_ptr:=b; str_toks:=p;
-@z
-@x module 465
-begin get_x_token; scan_something_internal(tok_val,false);
-if cur_val_level>=ident_val then @<Copy the token list@>
-else begin old_setting:=selector; selector:=new_string;
-@y
-@!b:pool_pointer; {base of temporary string}
-begin get_x_token; scan_something_internal(tok_val,false);
-if cur_val_level>=ident_val then @<Copy the token list@>
-else begin old_setting:=selector; selector:=new_string; b:=pool_ptr;
-@z
-@x module 465, continued
- selector:=old_setting; the_toks:=str_toks;
-@y
- selector:=old_setting; the_toks:=str_toks(b);
-@z
-@x module 470
-begin c:=cur_chr; @<Scan the argument for command |c|@>;
-old_setting:=selector; selector:=new_string;
-@<Print the result of command |c|@>;
-selector:=old_setting; link(garbage):=str_toks; ins_list(link(temp_head));
-@y
-@!b:pool_pointer; {base of temporary string}
-begin c:=cur_chr; @<Scan the argument for command |c|@>;
-old_setting:=selector; selector:=new_string; b:=pool_ptr;
-@<Print the result of command |c|@>;
-selector:=old_setting; link(garbage):=str_toks(b); ins_list(link(temp_head));
-@z
-
-343. **\input\romannumeral6 confusion bypassed (25May88)
-@x module 525
-begin if (pool_ptr+name_length>pool_size)or(str_ptr=max_strings) then
-@y
-begin if (pool_ptr+name_length>pool_size)or(str_ptr=max_strings)or
- (cur_length>0) then
-@z
-
-344. Avoid negative dividend rounding upward (Chris Thompson, fixed 19Jun88)
-@x module 126
-else t:=(lo_mem_max+hi_mem_min+2) div 2; {|lo_mem_max+2<=t<hi_mem_min|}
-@y
-else t:=lo_mem_max+1+(hi_mem_min-lo_mem_max)div 2; {|lo_mem_max+2<=t<hi_mem_min|}
-@z
-
-345. Better strategy when near memory overflow (Chris Thompson)
-@x module 126
-begin if lo_mem_max+1000<hi_mem_min then t:=lo_mem_max+1000
-@y
-begin if hi_mem_min-lo_mem_max>=1998 then t:=lo_mem_max+1000
-@z
-
-346. An omission from change 333 (Tsunetoshi Hayashi, reported 20June88)
-@x module 439
-cur_val:=0; cur_val_level:=int_val; radix:=0;
-@y
-cur_val:=0; cur_val_level:=int_val; radix:=0; cur_order:=0;
-@z
-
-347. Avoid fatal_error after terminal eof (Tim Morgan, reported 25Oct88)
-@x module 71 [serious problem occurred if this was called in open_log_file]
-if not input_ln(term_in,true) then fatal_error("End of file on the terminal!");
-@y
-if not input_ln(term_in,true) then t_open_in;
-@z
-
-348. Force terminal output when open_log_file aborts (6Nov88)
-@x module 535
- begin print_err("I can't write on file `");
-@y
- begin selector:=term_only; print_err("I can't write on file `");
-@z
-
-349. By popular request, undo #347 and fix the bug a more complex way.
-@x module 71 [this undoes change #347]
-if not input_ln(term_in,true) then t_open_in;
-@y
-if not input_ln(term_in,true) then fatal_error("End of file on the terminal!");
-@z
-@x module 92 [now we get to the new stuff]
-begin if job_name>0 then selector:=term_and_log
-@y
-begin if log_opened then selector:=term_and_log
-@z
-@x module 93
- error;
-@y
- if log_opened then error;
-@z
-@x module 527
-@!job_name:str_number; {principal file name}
-@y
-@!job_name:str_number; {principal file name}
-@!log_opened:boolean; {has the transcript file been opened?}
-@z
-@x module 528
-@<Initialize the output...@>=job_name:=0; name_in_progress:=false;
-@y
-@<Initialize the output...@>=
-job_name:=0; name_in_progress:=false; log_opened:=false;
-@z
-@x module 534
-selector:=log_only;
-@y
-selector:=log_only; log_opened:=true;
-@z
-@x module 535
-begin if interaction<scroll_mode then {bypass |fatal_error|}
- begin selector:=term_only; print_err("I can't write on file `");
-@.I can't write on file x@>
- print_file_name(cur_name,cur_area,cur_ext); print("'.");@/
- job_name:=0; history:=fatal_error_stop; jump_out;
- end; {abort the program without a log file}
-@y
-begin selector:=term_only;
-@z
-@x module 1265 [this change is optional, but it's a slight improvement]
-if job_name<>0 then selector:=selector+2;
-@y
-if log_opened then selector:=selector+2;
-@z
-@x module 1333
-if job_name>0 then
-@y
-if log_opened then
-@z
-@x module 1334
-if job_name>0 then {the log file is open}
-@y
-if log_opened then
-@z
-
-350. Forgotten update in error recovery (Breitenlohner, 20 Jan 89)
-@x module 976
- glue_ptr(p):=r;
-@y
- glue_ptr(p):=r; q:=r;
-@z
-@x module 1004
- glue_ptr(p):=r;
-@y
- glue_ptr(p):=r; q:=r;
-@z
-
-351. Avoid error \aftergroup\relax\dump (Mittelbach&Schoepf, 17 Feb 89)
-@x module 280
-begin check_full_save_stack;
-save_type(save_ptr):=insert_token; save_level(save_ptr):=level_zero;
-save_index(save_ptr):=t; incr(save_ptr);
-@y
-begin if cur_level>level_one then
- begin check_full_save_stack;
- save_type(save_ptr):=insert_token; save_level(save_ptr):=level_zero;
- save_index(save_ptr):=t; incr(save_ptr);
- end;
-@z
-
-352. Cosmetic change to validate comment in 115 (Breitenlohner, 20 Mar 89)
-@x module 791
-begin q:=link(cur_align);
-if (cur_align=null)or(q=null) then confusion("endv");
-@y
-begin if cur_align=null then confusion("endv");
-q:=link(cur_align);@+if q=null then confusion("endv");
-@z
-
-353. $$\begingroup\halign{#\cr}$$ caused confusion (Mittelbach, 7 Jun 89)
-@x module 1130
-mmode+halign: if privileged then init_align;
-@y
-mmode+halign: if privileged then
- if cur_group=math_shift_group then init_align
- else off_save;
-@z
-
-354. Conflict in global array dig with .5\ifdim.6 (Mittelbach, 20 Jun 89)
-@x module 450
-@!k:small_number; {number of digits in a decimal fraction}
-@y
-@!k,@!kk:small_number; {number of digits in a decimal fraction}
-@!p,@!q:pointer; {top of decimal digit stack}
-@z
-@x module 452
-begin k:=0; get_token; {|point_token| is being re-scanned}
-loop@+ begin get_x_token;
- if (cur_tok>zero_token+9)or(cur_tok<zero_token) then goto done1;
- if k<17 then {digits for |k>=17| cannot affect the result}
- begin dig[k]:=cur_tok-zero_token; incr(k);
- end;
- end;
-done1: f:=round_decimals(k);
-@y
-begin k:=0; p:=null; get_token; {|point_token| is being re-scanned}
-loop@+ begin get_x_token;
- if (cur_tok>zero_token+9)or(cur_tok<zero_token) then goto done1;
- if k<17 then {digits for |k>=17| cannot affect the result}
- begin q:=get_avail; link(q):=p; info(q):=cur_tok-zero_token;
- p:=q; incr(k);
- end;
- end;
-done1: for kk:=k downto 1 do
- begin dig[kk-1]:=info(p); q:=p; p:=link(p); free_avail(q);
- end;
-f:=round_decimals(k);
-@z
-
-355. String startup problems (Wayne Sullivan, 17 Jul 89)
-@x module 31 (Warning: This affects most change files!)
- overflow("buffer size",buf_size);
-@:TeX capacity exceeded buffer size}{\quad buffer size@>
-@y
- @<Report overflow of the input buffer, and abort@>;
-@z
-@x module 35
-consist of the remainder of the command line, after the part that invoked
-\TeX.
-@y
-consist of the remainder of the command line, after the part that invoked
-\TeX.
-
-The first line is special also because it may be read before \TeX\ has
-input a format file. In such cases, normal error messages cannot yet
-be given. The following code uses concepts that will be explained later.
-
-@<Report overflow of the input buffer, and abort@>=
-if format_ident=0 then
- begin write_ln(term_out,'Buffer size exceeded!'); goto final_end;
-@.Buffer size exceeded@>
- end
-else begin cur_input.loc_field:=first; cur_input.limit_field:=last-1;
- overflow("buffer size",buf_size);
-@:TeX capacity exceeded buffer size}{\quad buffer size@>
- end
-@z
-@x module 1310
-k:=pool_ptr-4; undump_four_ASCII
-@y
-k:=pool_ptr-4; undump_four_ASCII;
-init_str_ptr:=str_ptr; init_pool_ptr:=pool_ptr
-@z
-@x module 1332
-tini@/
-@y
-init_str_ptr:=str_ptr; init_pool_ptr:=pool_ptr; fix_date_and_time;
-tini@/
-@z
-@x module 1332
-init_str_ptr:=str_ptr; init_pool_ptr:=pool_ptr;@/
-@y
-@z
-
-356. Allow integer products to be 31 bits long (Mittelbach, 16 Aug 89)
-@x module 105
-@p function nx_plus_y(@!n:integer;@!x,@!y:scaled):scaled;
-begin if n<0 then
- begin negate(x); negate(n);
- end;
-if n=0 then nx_plus_y:=y
-else if ((x<=(@'7777777777-y) div n)and(-x<=(@'7777777777+y) div n)) then
- nx_plus_y:=n*x+y
-else begin arith_error:=true; nx_plus_y:=0;
- end;
-end;
-@y
-@d nx_plus_y(#)==mult_and_add(#,@'7777777777)
-@d mult_integers(#)==mult_and_add(#,0,@'17777777777)
-
-@p function mult_and_add(@!n:integer;@!x,@!y,@!max_answer:scaled):scaled;
-begin if n<0 then
- begin negate(x); negate(n);
- end;
-if n=0 then mult_and_add:=y
-else if ((x<=(max_answer-y) div n)and(-x<=(max_answer+y) div n)) then
- mult_and_add:=n*x+y
-else begin arith_error:=true; mult_and_add:=0;
- end;
-end;
-@z
-@x module 1240
- if q=multiply then cur_val:=nx_plus_y(eqtb[l].int,cur_val,0)
-@y
- if q=multiply then
- if p=int_val then cur_val:=mult_integers(eqtb[l].int,cur_val)
- else cur_val:=nx_plus_y(eqtb[l].int,cur_val,0)
-@z
-
-357. Raise the maximum number of tokens normally shown (pointed out by
-John Lavagnino in TeXhax on 19 May 89; corrected on 31 Aug 89).
-@x module 295
-begin if p<>null then show_token_list(link(p),null,1000);
-@y
-begin if p<>null then show_token_list(link(p),null,10000000);
-@z
-@x module 1370 (this part of the change is cosmetic only)
-show_token_list(link(def_ref),null,10000000); print_ln;
-@y
-token_show(def_ref); print_ln;
-@z
-
-358. Like 353, but with $$\begingroup\eqno$$ (Mittelbach, 25 Jul 89)
-@x module 1140
-mmode+eq_no: if privileged then start_eq_no;
-@y
-mmode+eq_no: if privileged then
- if cur_group=math_shift_group then start_eq_no
- else off_save;
-@z
-
-359. Major extension to 8-bit character input. (These changes, and a few that
-follow, were discussed during the 10th TUG meeting and installed during
-the week of 10 Sep 1989. They bring the implementation of TeX82 up to date with
-international developments and experience, and I believe they mark the
-final development of this program into a completely stable system.)
-Several changes to the documentation (not the program) are omitted here.
-@x module 18
-@!ASCII_code=0..127; {seven-bit numbers}
-@y
-@!ASCII_code=0..255; {eight-bit numbers}
-@z
-@x module 19
-@d last_text_char=127 {ordinal number of the largest element of |text_char|}
-
-@<Local variables for init...@>=
-@!i:0..last_text_char;
-@y
-@d last_text_char=255 {ordinal number of the largest element of |text_char|}
-
-@<Local variables for init...@>=
-@!i:integer;
-@z
-@x module 21
-xchr[0]:=' '; xchr[@'177]:=' ';
- {ASCII codes 0 and |@'177| do not appear in text}
-@y
-@z
-@x module 23
-for i:=1 to @'37 do xchr[i]:=' ';
-@y changing ' ' to chr(i) here will allow all 8-bit characters to get in
-for i:=0 to @'37 do xchr[i]:=' ';
-for i:=@'177 to @'377 do xchr[i]:=' ';
-@z
-@x module 24
-for i:=1 to @'176 do xord[xchr[i]]:=i;
-@y
-for i:=@'200 to @'377 do xord[xchr[i]]:=i;
-for i:=0 to @'176 do xord[xchr[i]]:=i;
-@z
-@x module 38
-@<Types...@>=
-@!pool_pointer = 0..pool_size; {for variables that point into |str_pool|}
-@!str_number = 0..max_strings; {for variables that point into |str_start|}
-
-@ @<Glob...@>=
-@!str_pool:packed array[pool_pointer] of ASCII_code; {the characters}
-@y [OK to make si(#)==#-128 and so(#)==#+128 (without parens) in change files]
-Some \PASCAL\ compilers won't pack integers into a single byte unless the
-integers lie in the range |-128..127|. To accommodate such systems
-we access the string pool only via macros that can easily be redefined.
-
-@d si(#) == # {convert from |ASCII_code| to |packed_ASCII_code|}
-@d so(#) == # {convert from |packed_ASCII_code| to |ASCII_code|}
-
-@<Types...@>=
-@!pool_pointer = 0..pool_size; {for variables that point into |str_pool|}
-@!str_number = 0..max_strings; {for variables that point into |str_start|}
-@!packed_ASCII_code = 0..255; {elements of |str_pool| array}
-
-@ @<Glob...@>=
-@!str_pool:packed array[pool_pointer] of packed_ASCII_code; {the characters}
-@z
-@x module 42
-begin str_pool[pool_ptr]:=#; incr(pool_ptr);
-@y
-begin str_pool[pool_ptr]:=si(#); incr(pool_ptr);
-@z
-@x module 45
- begin if str_pool[j]<>buffer[k] then
-@y
- begin if so(str_pool[j])<>buffer[k] then
-@z
-@x module 47
-var k,@!l:0..127; {small indices or counters}
-@y
-var k,@!l:0..255; {small indices or counters}
-@z
-@x module 47
-@<Make the first 128 strings@>;
-@y
-@<Make the first 256 strings@>;
-@z
-@x module 48
-@ @<Make the first 128...@>=
-for k:=0 to 127 do
- begin if (@<Character |k| cannot be printed@>) then
- begin append_char("^"); append_char("^");
- if k<@'100 then append_char(k+@'100)
- else append_char(k-@'100);
-@y
-@ @d app_lc_hex(#)==l:=#;
- if l<10 then append_char(l+"0)@+else append_char(l-10+"a")
-
-@<Make the first 256...@>=
-for k:=0 to 255 do
- begin if (@<Character |k| cannot be printed@>) then
- begin append_char("^"); append_char("^");
- if k<@'100 then append_char(k+@'100)
- else if k<@'200 then append_char(k-@'100)
- else begin app_lc_hex(k div 16); app_lc_hex(k mod 16);
- end;
-@z
-@x module 59
- begin print_char(str_pool[j]); incr(j);
-@y
- begin print_char(so(str_pool[j])); incr(j);
-@z
-@x modules 59 and 60
-else if s<128 then
-@y
-else if s<256 then
-@z
-@x module 60
- begin print(str_pool[j]); incr(j);
-@y
- begin print(so(str_pool[j])); incr(j);
-@z
-@x module 63
-if c>=0 then if c<128 then print(c);
-@y
-if c>=0 then if c<256 then print(c);
-@z
-@x module 68
-@ In certain situations, \TeX\ prints either a standard visible ASCII
-character or its hexadecimal ASCII code.
-
-@p procedure print_ASCII(@!c:integer); {prints a character or its code}
-begin if (c>=0) and (c<=127) then print(c)
-else begin print_char("[");
- if c<0 then print_int(c)@+else print_hex(c);
- print_char("]");
- end;
-end;
-@y
-@ Old versions of \TeX\ needed a procedure called |print_ASCII| whose function
-is now subsumed by |print|. We retain the old name here as a possible aid to
-future software arch\ae ologists.
-
-@d print_ASCII == print
-@z
-@x module 69
- begin print_char(str_pool[j]); n:=n-v;
- end;
- if n<=0 then return; {nonpositive input produces no output}
- k:=j+2; u:=v div (str_pool[k-1]-"0");
- if str_pool[k-1]="2" then
- begin k:=k+2; u:=u div (str_pool[k-1]-"0");
- end;
- if n+u>=v then
- begin print_char(str_pool[k]); n:=n+u;
- end
- else begin j:=j+2; v:=v div (str_pool[j-1]-"0");
-@y
- begin print_char(so(str_pool[j])); n:=n-v;
- end;
- if n<=0 then return; {nonpositive input produces no output}
- k:=j+2; u:=v div (so(str_pool[k-1])-"0");
- if str_pool[k-1]=si("2") then
- begin k:=k+2; u:=u div (so(str_pool[k-1])-"0");
- end;
- if n+u>=v then
- begin print_char(so(str_pool[k])); n:=n+u;
- end
- else begin j:=j+2; v:=v div (so(str_pool[j-1])-"0");
-@z
-@x module 70
- begin print_char(str_pool[j]); incr(j);
-@y
- begin print_char(so(str_pool[j])); incr(j);
-@z
-@x module 222
-@d single_base=active_base+128 {equivalents of one-letter control sequences}
-@d null_cs=single_base+128 {equivalent of \.{\\csname\\endcsname}}
-@y
-@d single_base=active_base+256 {equivalents of one-character control sequences}
-@d null_cs=single_base+256 {equivalent of \.{\\csname\\endcsname}}
-@z
-@x module 230
- {table of 128 command codes (the ``catcodes'')}
-@d lc_code_base=cat_code_base+128 {table of 128 lowercase mappings}
-@d uc_code_base=lc_code_base+128 {table of 128 uppercase mappings}
-@d sf_code_base=uc_code_base+128 {table of 128 spacefactor mappings}
-@d math_code_base=sf_code_base+128 {table of 128 math mode mappings}
-@d int_base=math_code_base+128 {beginning of region 5}
-@y
- {table of 256 command codes (the ``catcodes'')}
-@d lc_code_base=cat_code_base+256 {table of 256 lowercase mappings}
-@d uc_code_base=lc_code_base+256 {table of 256 uppercase mappings}
-@d sf_code_base=uc_code_base+256 {table of 256 spacefactor mappings}
-@d math_code_base=sf_code_base+256 {table of 256 math mode mappings}
-@d int_base=math_code_base+256 {beginning of region 5}
-@z
-@x module 232
-for k:=0 to 127 do
-@y
-for k:=0 to 255 do
-@z
-@x module 236
-@d del_code_base=count_base+256 {128 delimiter code mappings}
-@d dimen_base=del_code_base+128 {beginning of region 6}
-@y
-@d del_code_base=count_base+256 {256 delimiter code mappings}
-@d dimen_base=del_code_base+256 {beginning of region 6}
-@z
-@x module 240
-for k:=0 to 127 do del_code(k):=-1;
-@y
-for k:=0 to 255 do del_code(k):=-1;
-@z
-@x module 264
-begin if s<128 then cur_val:=s+single_base
-@y
-begin if s<256 then cur_val:=s+single_base
-@z
-@x ibid
- for j:=0 to l-1 do buffer[j]:=str_pool[k+j];
-@y
- for j:=0 to l-1 do buffer[j]:=so(str_pool[k+j]);
-@z
-@x module 289
-@d cs_token_flag==@'10000 {amount added to the |eqtb| location in a
- token that stands for a control sequence; is a multiple of~256}
-@y
-@d cs_token_flag==@'7777 {amount added to the |eqtb| location in a
- token that stands for a control sequence; is a multiple of~256, less~1}
-@z
-@x module 293
- if (info(p)<0)or(c>127) then print_esc("BAD.")
-@y
- if info(p)<0 then print_esc("BAD.")
-@z
-@x module 341
-@!cat:0..15; {|cat_code(cur_chr)|, usually}
-@y
-@!cat:0..15; {|cat_code(cur_chr)|, usually}
-@!c,@!cc:ASCII_code; {constituents of a possible expanded code}
-@!d:2..3; {number of excess characters in an expanded code}
-@z
-@x module 352
-@<If this |sup_mark| starts a control character...@>=
-begin if (cur_chr=buffer[loc])and(loc<limit) then
- begin if buffer[loc+1]<@'100 then cur_chr:=buffer[loc+1]+@'100
- else cur_chr:=buffer[loc+1]-@'100;
- loc:=loc+2; goto reswitch;
- end;
-@y
-@ Notice that a code like \.{\^\^8} becomes \.x if not followed by a hex digit.
-
-@d is_hex(#)==(((#>="0")and(#<="9"))or((#>="a")and(#<="f")))
-@d hex_to_cur_chr==
- if c<="9" then cur_chr:=c-"0" @+else cur_chr:=c-"a"+10;
- if cc<="9" then cur_chr:=16*cur_chr+cc-"0"
- else cur_chr:=16*cur_chr+cc-"a"+10
-
-@<If this |sup_mark| starts an expanded character...@>=
-begin if cur_chr=buffer[loc] then if loc<limit then
- begin c:=buffer[loc+1]; @+if c<@'200 then {yes we have an expanded char}
- begin loc:=loc+2;
- if is_hex(c) then if loc<=limit then
- begin cc:=buffer[loc]; @+if is_hex(cc) then
- begin incr(loc); hex_to_cur_chr; goto reswitch;
- end;
- end;
- if c<@'100 then cur_chr:=c+@'100 @+else cur_chr:=c-@'100;
- goto reswitch;
- end;
- end;
-@z
-@x module 355
- begin cur_chr:=buffer[k+1];
- if cur_chr<@'100 then buffer[k-1]:=cur_chr+@'100
- else buffer[k-1]:=cur_chr-@'100;
- limit:=limit-2; first:=first-2;
- while k<=limit do
- begin buffer[k]:=buffer[k+2]; incr(k);
- end;
- goto start_cs;
- end;
-@y
-begin c:=buffer[k+1]; @+if c<@'200 then {yes, one is indeed present}
- begin d:=2;
- if is_hex(c) then @+if k+2<=limit then
- begin cc:=buffer[k+2]; @+if is_hex(cc) then incr(d);
- end;
- if d>2 then
- begin hex_to_cur_chr; buffer[k-1]:=cur_chr;
- end
- else if c<@'100 then buffer[k-1]:=c+@'100
- else buffer[k-1]:=c-@'100;
- limit:=limit-d; first:=first-d;
- while k<=limit do
- begin buffer[k]:=buffer[k+d]; incr(k);
- end;
- goto start_cs;
- end;
- end;
-@z
-@x module 360
-There is one more branch.
-@y
-There is one more branch.
-
-@d end_line_char_inactive == (end_line_char<0)or(end_line_char>255)
-@z
-@x ibid
- if (end_line_char<0)or(end_line_char>127) then decr(limit)
-@y
- if end_line_char_inactive then decr(limit)
-@z
-@x modules 362 and 483 and 538 and 1337
-if (end_line_char<0)or(end_line_char>127) then decr(limit)
-@y
-if end_line_char_inactive then decr(limit)
-@z
-@x module 391
-if (info(r)>match_token+127)or(info(r)<match_token) then s:=null
-@y
-if (info(r)>match_token+255)or(info(r)<match_token) then s:=null
-@z
-@x module 407
- ((cur_chr=str_pool[k])or(cur_chr=str_pool[k]-"a"+"A")) then
-@y
- ((cur_chr=so(str_pool[k]))or(cur_chr=so(str_pool[k])-"a"+"A")) then
-@z
-@x module 414
-begin scan_seven_bit_int;
-@y
-begin scan_char_num;
-@z
-@x module 432
-|scan_something_internal|:
-
-@<Declare procedures that scan restricted classes of integers@>=
-procedure scan_seven_bit_int;
-begin scan_int;
-if (cur_val<0)or(cur_val>127) then
- begin print_err("Bad character code");
-@.Bad character code@>
- help2("The numeric code for a character must be between 0 and 127.")@/
- ("I changed this one to zero."); int_error(cur_val); cur_val:=0;
- end;
-end;
-@y
-|scan_something_internal|.
-@z (and I'll interchange modules 434 and 435)
-@x module 442
-if cur_val>127 then
-@y
-if cur_val>255 then
-@z
-@x module 464
- begin t:=str_pool[k];
-@y
- begin t:=so(str_pool[k]);
-@z
-@x module 506 (correction needed twice)
-if (cur_cmd>active_char)or(cur_chr>127) then
-@y
-if (cur_cmd>active_char)or(cur_chr>255) then
-@z
-@x module 519
-for j:=str_start[a] to str_start[a+1]-1 do append_to_name(str_pool[j]);
-for j:=str_start[n] to str_start[n+1]-1 do append_to_name(str_pool[j]);
-for j:=str_start[e] to str_start[e+1]-1 do append_to_name(str_pool[j]);
-@y
-for j:=str_start[a] to str_start[a+1]-1 do append_to_name(so(str_pool[j]));
-for j:=str_start[n] to str_start[n+1]-1 do append_to_name(so(str_pool[j]));
-for j:=str_start[e] to str_start[e+1]-1 do append_to_name(so(str_pool[j]));
-@z
-@x module 526
-if (cur_cmd>active_char)or(cur_chr>127) then
-@y
-if (cur_cmd>active_char)or(cur_chr>255) then
-@z
-@x module 603 (change to be made twice)
- dvi_out(str_pool[k]);
-@y
- dvi_out(so(str_pool[k]));
-@z
-@x module 617
- for s:=str_start[str_ptr] to pool_ptr-1 do dvi_out(str_pool[s]);
-@y
- for s:=str_start[str_ptr] to pool_ptr-1 do dvi_out(so(str_pool[s]));
-@z
-@x module 766
- begin case str_pool[r_type*8+t+magic_offset] of
-@y
- begin case so(str_pool[r_type*8+t+magic_offset]) of
-@z
-@x module 780
-@d span_code=128 {distinct from any character}
-@d cr_code=129 {distinct from |span_code| and from any character}
-@y
-@d span_code=256 {distinct from any character}
-@d cr_code=257 {distinct from |span_code| and from any character}
-@z
-@x module 815
-label done,done1,done2,done3,done4;
-@y
-label done,done1,done2,done3,done4,continue;
-@z
-@x module 896
- else if (type(s)=kern_node)and(subtype(s)=normal) then c:=128
- else if type(s)=whatsit_node then c:=128
- else goto done1;
- if c<128 then if lc_code(c)<>0 then
- if (lc_code(c)=c)or(uc_hyph>0) then goto done2
- else goto done1;
- s:=link(s);
-@y
- else if (type(s)=kern_node)and(subtype(s)=normal) then goto continue
- else if type(s)=whatsit_node then goto continue
- else goto done1;
- if lc_code(c)<>0 then
- if (lc_code(c)=c)or(uc_hyph>0) then goto done2
- else goto done1;
-continue: s:=link(s);
-@z
-@x module 897
- if c>=128 then goto done3;
- if (lc_code(c)=0)or(hn=63) then goto done3;
- hb:=s; incr(hn); hu[hn]:=c; hc[hn]:=lc_code(c)-1;
-@y
- if lc_code(c)=0 then goto done3;
- if hn=63 then goto done3;
- hb:=s; incr(hn); hu[hn]:=c; hc[hn]:=lc_code(c);
-@z
-@x module 898
-if c>=128 then goto done3;
-if (lc_code(c)=0)or(j=63) then goto done3;
-incr(j); hu[j]:=c; hc[j]:=lc_code(c)-1;@/
-@y
-if lc_code(c)=0 then goto done3;
-if j=63 then goto done3;
-incr(j); hu[j]:=c; hc[j]:=lc_code(c);@/
-@z
-@x module 923
-hc[0]:=127; hc[hn+1]:=127; hc[hn+2]:=128; {insert delimiters}
-@y
-hc[0]:=0; hc[hn+1]:=0; hc[hn+2]:=256; {insert delimiters}
-@z
-@x ibid
- while hc[l]=trie_char(z) do
-@y
- while hc[l]=qo(trie_char(z)) do
-@z
-@x module 931
- repeat if str_pool[u]<hc[j] then goto not_found;
- if str_pool[u]>hc[j] then goto done;
-@y
- repeat if so(str_pool[u])<hc[j] then goto not_found;
- if so(str_pool[u])>hc[j] then goto done;
-@z
-@x module 937
-else begin if (cur_chr>127)or(lc_code(cur_chr)=0) then
-@y
-else begin if lc_code(cur_chr)=0 then
-@z
-@x ibid
- begin incr(n); hc[n]:=lc_code(cur_chr)-1;
-@y
- begin incr(n); hc[n]:=lc_code(cur_chr);
-@z
-@x module 945
-@!init @!trie_c:packed array[trie_pointer] of ASCII_code; {characters to match}
-@y
-@!init @!trie_c:packed array[trie_pointer] of packed_ASCII_code;
- {characters to match}
-@z
-% In modules 951--954, change "127" to "255" and "128" to "256"
-@x module 952
-trie_link(0):=0; trie_char(0):=0; trie_op(0):=min_quarterword;
-@y
-trie_link(0):=0; trie_char(0):=min_quarterword; trie_op(0):=min_quarterword;
-@z
-@x module 953
-begin c:=trie_c[p];
-@y
-begin c:=so(trie_c[p]);
-@z
-@x module 955
- begin if trie_link(h+trie_c[q])=0 then goto not_found;
-@y
- begin if trie_link(h+so(trie_c[q]))=0 then goto not_found;
-@z
-@x module 956
-repeat z:=h+trie_c[q]; trie_back(trie_link(z)):=trie_back(z);
-@y
-repeat z:=h+so(trie_c[q]); trie_back(trie_link(z)):=trie_back(z);
-@z
-@x module 959
- begin q:=trie_l[p]; c:=trie_c[p];
- trie_link(z+c):=trie_ref[q]; trie_char(z+c):=c; trie_op(z+c):=trie_o[p];
-@y
- begin q:=trie_l[p]; c:=so(trie_c[p]);
- trie_link(z+c):=trie_ref[q]; trie_char(z+c):=qi(c); trie_op(z+c):=trie_o[p];
-@z
-@x module 962
- begin if cur_chr="." then cur_chr:=128 {edge-of-word delimiter}
- else begin cur_chr:=lc_code(cur_chr);
- if cur_chr=0 then
- begin print_err("Nonletter");
-@.Nonletter@>
- help1("(See Appendix H.)"); error; cur_chr:=128;
- end;
- end;
- if k<63 then
- begin incr(k); hc[k]:=cur_chr-1; hyf[k]:=0; digit_sensed:=false;
- end;
- end
-else begin hyf[k]:=cur_chr-"0";
- if k<63 then digit_sensed:=true;
- end
-@y
- begin if cur_chr="." then cur_chr:=0 {edge-of-word delimiter}
- else begin cur_chr:=lc_code(cur_chr);
- if cur_chr=0 then
- begin print_err("Nonletter");
-@.Nonletter@>
- help1("(See Appendix H.)"); error;
- end;
- end;
- if k<63 then
- begin incr(k); hc[k]:=cur_chr; hyf[k]:=0; digit_sensed:=false;
- end;
- end
- else if k<63 then
- begin hyf[k]:=cur_chr-"0"; digit_sensed:=true;
- end;
- end
-@z
-@x module 963
- while (p>0)and(c>trie_c[p]) do
-@y
- while (p>0)and(c>so(trie_c[p])) do
-@z
-@x ibid
- if (p=0)or(c<trie_c[p]) then
-@y
- if (p=0)or(c<so(trie_c[p])) then
-@z
-@x module 964
-trie_c[p]:=c; trie_o[p]:=min_quarterword;
-@y
-trie_c[p]:=si(c); trie_o[p]:=min_quarterword;
-@z
-@x module 965
-if hc[1]=127 then hyf[0]:=0;
-if hc[k]=127 then hyf[k]:=0;
-@y
-if hc[1]=0 then hyf[0]:=0;
-if hc[k]=0 then hyf[k]:=0;
-@z
-@x module 966
-h.rh:=0; h.b0:=min_quarterword; h.b1:=0; {|trie_link:=0|,
- |trie_op:=min_quarterword|, |trie_char:=0|}
-@y
-h.rh:=0; h.b0:=min_quarterword; h.b1:=min_quarterword; {|trie_link:=0|,
- |trie_op:=min_quarterword|, |trie_char:=qi(0)|}
-@z
-@x module 1034
-if c<128 then
-@y
-@z
-@x ibid
-else space_factor:=1000
-@y
-@z
-@x module 1151
-letter,other_char,char_given: if cur_chr>=128 then c:=cur_chr
- else begin c:=ho(math_code(cur_chr));
-@y
-letter,other_char,char_given: begin c:=ho(math_code(cur_chr));
-@z
-@x module 1154
-mmode+letter,mmode+other_char,mmode+char_given: if cur_chr<128 then
- set_math_char(ho(math_code(cur_chr)))
- else set_math_char(cur_chr);
-mmode+char_num: begin scan_char_num; cur_chr:=cur_val;
- if cur_chr<128 then set_math_char(ho(math_code(cur_chr)))
- else set_math_char(cur_chr);
-@y
-mmode+letter,mmode+other_char,mmode+char_given:
- set_math_char(ho(math_code(cur_chr)));
-mmode+char_num: begin scan_char_num; cur_chr:=cur_val;
- set_math_char(ho(math_code(cur_chr)));
-@z
-@x module 1232
- p:=cur_chr; scan_seven_bit_int; p:=p+cur_val; scan_optional_equals;
-@y
- p:=cur_chr; scan_char_num; p:=p+cur_val; scan_optional_equals;
-@z
-@x module 1233
-else n:=127
-@y
-else n:=255
-@z
-@x module 1289
- begin if t>=cs_token_flag then t:=t-active_base;
- c:=t mod 256;
- if c<128 then if equiv(b+c)<>0 then t:=256*(t div 256)+equiv(b+c);
- if t>=cs_token_flag then info(p):=t+active_base
- else info(p):=t;
-@y
- begin c:=t mod 256;
- if equiv(b+c)<>0 then info(p):=t-c+equiv(b+c);
-@z
-@x module 1309
- w.b0:=str_pool[k]; w.b1:=str_pool[k+1];
- w.b2:=str_pool[k+2]; w.b3:=str_pool[k+3];
-@y [often qi(so(x))=x, but not e.g. when "quarterwords" are two bytes]
- w.b0:=qi(so(str_pool[k])); w.b1:=qi(so(str_pool[k+1]));
- w.b2:=qi(so(str_pool[k+2])); w.b3:=qi(so(str_pool[k+3]));
-@z
-@x module 1310
- str_pool[k]:=w.b0; str_pool[k+1]:=w.b1;
- str_pool[k+2]:=w.b2; str_pool[k+3]:=w.b3
-@y
- str_pool[k]:=si(qo(w.b0)); str_pool[k+1]:=si(qo(w.b1));
- str_pool[k+2]:=si(qo(w.b2)); str_pool[k+3]:=si(qo(w.b3))
-@z
-@x module 1368
-for k:=str_start[str_ptr] to pool_ptr-1 do dvi_out(str_pool[k]);
-@y
-for k:=str_start[str_ptr] to pool_ptr-1 do dvi_out(so(str_pool[k]));
-@z
-
-360. Major change to allow multiple hyphenation tables.
-I've combined this with the code for a minor change:
-361. New parameters \lefthyphenmin and \righthyphenmin.
-@x module 11 (affects most change files!)
-@!trie_size=8000; {space for hyphenation patterns; should be larger for
- \.{INITEX} than it is in production versions of \TeX}
-@y
-@!trie_size=8000; {space for hyphenation patterns; should be larger for
- \.{INITEX} than it is in production versions of \TeX}
-@!trie_op_size=500; {space for ``opcodes'' in the hyphenation patterns}
-@z
-@x module 212
-known as |space_factor|; it holds the current space factor used in spacing
-calculations. In math mode, |aux| is also known as |incompleat_noad|; if
-@y
-known as |space_factor| and |clang|; it holds the current space factor used in
-spacing calculations, and the current language used for hyphenation.
-(The value of |clang| is undefined in restricted horizontal mode.)
-In math mode, |aux| is also known as |incompleat_noad|; if
-@z
-@x ibid
- @!pg_field,@!aux_field,@!ml_field: integer;
-@y
- @!pg_field,@!ml_field: integer;
- @!aux_field: memory_word;
-@z
-@x module 213
-@d prev_depth==aux {the name of |aux| in vertical mode}
-@d space_factor==aux {the name of |aux| in horizontal mode}
-@d incompleat_noad==aux {the name of |aux| in math mode}
-@y
-@d prev_depth==aux.sc {the name of |aux| in vertical mode}
-@d space_factor==aux.hh.lh {part of |aux| in horizontal mode}
-@d clang==aux.hh.rh {the other part of |aux| in horizontal mode}
-@d incompleat_noad==aux.int {the name of |aux| in math mode}
-@z
-@x module 218
-@!a:integer; {auxiliary}
-@y
-@!a:memory_word; {auxiliary}
-@z
-@x module 219
- if a<=ignore_depth then print("ignored")
- else print_scaled(a);
- if nest[p].pg_field<>0 then
- begin print(", prevgraf ");
- print_int(nest[p].pg_field); print(" line");
- if nest[p].pg_field<>1 then print_char("s");
- end;
- end;
-1: begin print_nl("spacefactor "); print_int(a);
- end;
-2: if a<>null then
- begin print("this will be denominator of:"); show_box(a);
-@y
- if a.sc<=ignore_depth then print("ignored")
- else print_scaled(a.sc);
- if nest[p].pg_field<>0 then
- begin print(", prevgraf ");
- print_int(nest[p].pg_field); print(" line");
- if nest[p].pg_field<>1 then print_char("s");
- end;
- end;
-1: begin print_nl("spacefactor "); print_int(a.hh.lh);
- if m>0 then if a.hh.rh>0 then
- begin print(", current language "); print_int(a.hh.rh);
- end;
- end;
-2: if a.int<>null then
- begin print("this will be denominator of:"); show_box(a.int);
-@z
-@x modules 236--238
-@d int_pars=50 {total number of integer parameters}
-@y
-@d language_code=50 {current hyphenation table}
-@d left_hyphen_min_code=51 {minimum left hyphenation fragment size}
-@d right_hyphen_min_code=52 {minimum right hyphenation fragment size}
-@d int_pars=53 {total number of integer parameters}
-@z and define/print these new parameters appropriately (mimicking new_line_char)
-@x module 418
-else begin cur_val:=aux;
- if m=vmode then cur_val_level:=dimen_val@+else cur_val_level:=int_val;
- end
-@y
-else if m=vmode then
- begin cur_val:=prev_depth; cur_val_level:=dimen_val;
- end
-else begin cur_val:=space_factor; cur_val_level:=int_val;
- end
-@z
-@x module 775
- begin mode:=-vmode; prev_depth:=nest[nest_ptr-2].aux_field;
-@y
- begin mode:=-vmode; prev_depth:=nest[nest_ptr-2].aux_field.sc;
-@z
-@x module 786
-begin push_nest; mode:=(-hmode-vmode)-mode; aux:=0;
-@y
-begin push_nest; mode:=(-hmode-vmode)-mode;
-if mode=-hmode then space_factor:=0 @+else prev_depth:=0;
-@z
-@x module 863
-loop@+ begin @<Create an active breakpoint representing the beginning of
- the paragraph@>;
-@y
-loop@+ begin if threshold>inf_bad then threshold:=inf_bad;
- if second_pass then @<Initialize for hyphenating a paragraph@>;
- @<Create an active breakpoint representing the beginning of the paragraph@>;
-@z
-@x module 891
-passes on only about 5 per cent of the paragraphs.
-@y
-passes on only about 5 per cent of the paragraphs.
-
-@<Initialize for hyphenating...@>=
-begin @!init if trie_not_ready then init_trie; @+tini@;@/
-l_hyf:=left_hyphen_min-1;@+if l_hyf<0 then l_hyf:=0;
-r_hyf:=right_hyphen_min-1;@+if r_hyf<0 then r_hyf:=0;
-min_hyf:=l_hyf+r_hyf+2; cur_lang:=0;
-end
-@z
-@x module 892
-@!hyf_char:integer; {hyphen character of the relevant font}
-@y
-@!hyf_char:integer; {hyphen character of the relevant font}
-@!cur_lang:ASCII_code; {current hyphenation table of interest}
-@!l_hyf,@!r_hyf,@!min_hyf:integer; {limits on fragment sizes}
-@z
-@x module 894
-begin s:=link(cur_p);
-@y
-begin if min_hyf>63 then goto done1;
-s:=link(cur_p);
-@z
-@x module 896
- else if type(s)=whatsit_node then goto continue
-@y
- else if type(s)=whatsit_node then
- begin @<Advance \(p)past a whatsit node in the \(p)pre-hyphenation loop@>;
- goto continue;
- end
-@z
-@x module 899 (title of this module also changes appropriately)
-if hn<5 then goto done1;
-@y
-if hn<min_hyf then goto done1;
-@z
-@x module 902
-for j:=2 to hn-3 do if odd(hyf[j]) then goto found1;
-@y
-for j:=l_hyf+1 to hn-r_hyf-1 do if odd(hyf[j]) then goto found1;
-@z
-@x module 920
-$p_1\ldots p_k$ by setting |@t$z_1$@>:=@t$p_1$@>| and then, for |1<i<=k|,
-@y
-$p_1\ldots p_k$ by letting $z_0$ be one greater than the relevant language index
-and then, for |1<=i<=k|,
-@z
-@x ibid
-the letters in |hc[(l-k+1)..l@,]|, we perform all of the required operations
-for this pattern by carrying out the following little program: Set
-|v:=trie_op(@t$z_k$@>)|. Then set |hyf[l-hyf_distance[v]]:=@tmax@>(
-hyf[l-hyf_distance[v]], hyf_num[v])|, and |v:=hyf_next[v]|; repeat, if
-necessary, until |v=min_quarterword|.
-@y
-the letters in |hc[(l-k+1)..l@,]| of language |t|,
-we perform all of the required operations
-for this pattern by carrying out the following little program: Set
-|v:=trie_op(@t$z_k$@>)|. Then set |v:=v+op_start[t]|,
-|hyf[l-hyf_distance[v]]:=@tmax@>(hyf[l-hyf_distance[v]], hyf_num[v])|,
-and |v:=hyf_next[v]|; repeat, if necessary, until |v=min_quarterword|.
-@z
-@x module 921
-@!hyf_distance:array[quarterword] of small_number; {position |k-j| of $n_j$}
-@!hyf_num:array[quarterword] of small_number; {value of $n_j$}
-@!hyf_next:array[quarterword] of quarterword; {continuation of this |trie_op|}
-@y
-@!hyf_distance:array[1..trie_op_size] of small_number; {position |k-j| of $n_j$}
-@!hyf_num:array[1..trie_op_size] of small_number; {value of $n_j$}
-@!hyf_next:array[1..trie_op_size] of quarterword; {continuation code}
-@!op_start:array[ASCII_code] of 0..trie_op_size; {offset for current language}
-@z
-@x module 922
-@!v:quarterword; {an index into |hyf_distance|, etc.}
-@y
-@!v:integer; {an index into |hyf_distance|, etc.}
-@z
-@x module 923
-for j:=0 to hn-2 do
- begin z:=hc[j]; l:=j;
-@y
-if trie_char(cur_lang+1)<>qi(cur_lang) then return; {no patterns for |cur_lang|}
-for j:=0 to hn-r_hyf do
- begin z:=trie_link(cur_lang+1)+hc[j]; l:=j;
-@z
-@x ibid
-found: hyf[1]:=0; hyf[hn-2]:=0; hyf[hn-1]:=0; hyf[hn]:=0
-@y
-found: for j:=0 to l_hyf do hyf[j]:=0;
-for j:=0 to r_hyf do hyf[hn-j]:=0
-@z
-@x module 924
-repeat i:=l-hyf_distance[v];
-@y
-repeat v:=v+op_start[cur_lang]; i:=l-hyf_distance[v];
-@z
-@x module 930
-h:=hc[1];
-@y
-h:=hc[1]; incr(hn); hc[hn]:=cur_lang;
-@z
-@x ibid
-not_found:
-@y
-not_found: decr(hn)
-@z
-@x module 931
- goto found;
-@y
- decr(hn); goto found;
-@z
-@x module 934
-@p procedure new_hyph_exceptions; {enters new exceptions}
-label reswitch, exit, found, not_found, done;
-@y
-@d set_cur_lang==if language<=0 then cur_lang:=0
- else if language>255 then cur_lang:=0
- else cur_lang:=language
-
-@p procedure new_hyph_exceptions; {enters new exceptions}
-label reswitch, exit, found, not_found;
-@z
-@x ibid
-begin scan_left_brace; {a left brace must follow \.{\\hyphenation}}
-@y
-begin scan_left_brace; {a left brace must follow \.{\\hyphenation}}
-set_cur_lang;
-@z
-@x module 935
- spacer,right_brace: begin if n>4 then @<Enter a hyphenation exception@>;
-@y
- spacer,right_brace: begin if n>1 then @<Enter a hyphenation exception@>;
-@z
-@x module 938
-begin if n>1 then
-@y
-begin if n<63 then
-@z
-@x module 939
-begin str_room(n); h:=0;
-@y
-begin incr(n); hc[n]:=cur_lang; str_room(n); h:=0;
-@z
-@x ibid
-loop@+ begin if p=null then goto done;
- if info(p)<n-2 then goto done;
- q:=link(p); free_avail(p); p:=q; {eliminate hyphens that \TeX\ doesn't like}
- end;
-done: @<Insert the \(p)pair |(s,p)| into the exception table@>;
-@y
-@<Insert the \(p)pair |(s,p)| into the exception table@>;
-@z
-@x module 942
-@p@!init @<Declare procedures for preprocessing hyphenation patterns@>@;
-@y
-@<Declare subprocedures for |line_break|@>=
-@!init @<Declare procedures for preprocessing hyphenation patterns@>@;
-@z
-@x module 943
-@d quarterword_diff=max_quarterword-min_quarterword
-@d trie_op_hash_size=quarterword_diff+quarterword_diff {double}
-
-@<Glob...@>=
-@!init@! trie_op_hash:array[0..trie_op_hash_size] of quarterword;
- {trie op codes for triples}
-tini@;@/
-@t\hskip1em@>@!trie_op_ptr:quarterword; {highest |trie_op| assigned}
-@y
-@<Glob...@>=
-@!init@! trie_op_hash:array[-trie_op_size..trie_op_size] of 0..trie_op_size;
- {trie op codes for quadruples}
-@!trie_used:array[ASCII_code] of quarterword;
- {largest opcode used so far for this language}
-@!trie_op_lang:array[1..trie_op_size] of ASCII_code;
- {language part of a hashed quadruple}
-@!trie_op_val:array[1..trie_op_size] of quarterword;
- {opcode corresponding to a hashed quadruple}
-@!trie_op_ptr:0..trie_op_size; {number of stored ops so far}
-tini
-@z
-@x module 944 should be entirely replaced
-@y by the following code:
-@ It's tempting to remove the |overflow| stops in the following procedure;
-|new_trie_op| could return |min_quarterword| (thereby simply ignoring
-part of a hyphenation pattern) instead of aborting the job. However, that would
-lead to different hyphenation results on different installations of \TeX\
-using the same patterns. The |overflow| stops are necessary for portability
-of patterns.
-
-@<Declare procedures for preprocessing hyph...@>=
-function new_trie_op(@!d,@!n:small_number;@!v:quarterword):quarterword;
-label exit;
-var h:-trie_op_size..trie_op_size; {trial hash location}
-@!u:quarterword; {trial op code}
-@!l:0..trie_op_size; {pointer to stored data}
-begin h:=abs(n+313*d+361*v+1009*cur_lang) mod (trie_op_size+trie_op_size)
- - trie_op_size;
-loop@+ begin l:=trie_op_hash[h];
- if l=0 then {empty position found for a new op}
- begin if trie_op_ptr=trie_op_size then
- overflow("pattern memory ops",trie_op_size);
- u:=trie_used[cur_lang];
- if u=max_quarterword then
- overflow("pattern memory ops per language",
- max_quarterword-min_quarterword);
- incr(trie_op_ptr); incr(u); trie_used[cur_lang]:=u;
- hyf_distance[trie_op_ptr]:=d;
- hyf_num[trie_op_ptr]:=n; hyf_next[trie_op_ptr]:=v;
- trie_op_lang[trie_op_ptr]:=cur_lang; trie_op_hash[h]:=trie_op_ptr;
- trie_op_val[trie_op_ptr]:=u; new_trie_op:=u; return;
- end;
- if (hyf_distance[l]=d)and(hyf_num[l]=n)and(hyf_next[l]=v)
- and(trie_op_lang[l]=cur_lang) then
- begin new_trie_op:=trie_op_val[l]; return;
- end;
- if h>-trie_op_size then decr(h)@+else h:=trie_op_size;
- end;
-exit:end;
-@z
-@x module 945: move the code from this module into 946, and introduce new code:
-@y
-@ After |new_trie_op| has compressed the necessary opcode information,
-plenty of information is available to unscramble the data into the
-final form needed by our hyphenation algorithm.
-
-@<Sort the hyphenation op tables into proper order@>=
-op_start[0]:=-min_quarterword;
-for j:=1 to 255 do op_start[j]:=op_start[j-1]+qo(trie_used[j-1]);
-for j:=1 to trie_op_ptr do
- trie_op_hash[j]:=op_start[trie_op_lang[j]]+trie_op_val[j]; {destination}
-for j:=1 to trie_op_ptr do while trie_op_hash[j]>j do
- begin k:=trie_op_hash[j];@/
- t:=hyf_distance[k]; hyf_distance[k]:=hyf_distance[j]; hyf_distance[j]:=t;@/
- t:=hyf_num[k]; hyf_num[k]:=hyf_num[j]; hyf_num[j]:=t;@/
- t:=hyf_next[k]; hyf_next[k]:=hyf_next[j]; hyf_next[j]:=t;@/
- trie_op_hash[j]:=trie_op_hash[k]; trie_op_hash[k]:=k;
- end
-@z
-@x module 949: Move this code to just after the new module 945!
-mentioned so far, let's write a procedure that does the initialization.
-
-@<Declare procedures for preprocessing hyph...@>=
-procedure init_pattern_memory; {gets ready to build a linked trie}
-var h:0..trie_op_hash_size; {an index into |trie_op_hash|}
-@!p:trie_pointer; {an index into |trie_hash|}
-begin for h:=0 to trie_op_hash_size do trie_op_hash[h]:=min_quarterword;
-trie_op_ptr:=min_quarterword; trie_root:=0; trie_c[0]:=0; trie_ptr:=0;
-for p:=0 to trie_size do trie_hash[p]:=0;
-end;
-@y
-mentioned so far, let's write down the code that gets them started.
-
-@<Initialize table entries...@>=
-for k:=-trie_op_size to trie_op_size do trie_op_hash[k]:=0;
-for k:=0 to 255 do trie_used[k]:=min_quarterword;
-trie_op_ptr:=0;
-@z
-@x module 950
-@t\hskip1em@>@!trie_min:trie_pointer;
- {all locations |<=trie_min| are vacant in |trie|}
-tini@;@/
-@t\hskip1em@>@!trie_max:trie_pointer; {largest location used in |trie|}
-@y
-@t\hskip10pt@>@!trie_min:array[ASCII_code] of trie_pointer;
- {the first possible slot for each character}
-@t\hskip10pt@>@!trie_max:trie_pointer; {largest location used in |trie|}
-@t\hskip10pt@>@!trie_not_ready:boolean; {is the trie still in linked form?}
-tini
-@z
-@x modules 951 and 952
-@ Here is how these data structures are initialized.
-
-@<Declare procedures for preprocessing hyph...@>=
-procedure init_trie_memory; {gets ready to pack into |trie|}
-var p:trie_pointer; {index into |trie_ref|, |trie|, |trie_taken|}
-begin for p:=0 to trie_ptr do trie_ref[p]:=0;
-trie_max:=256; trie_min:=256; trie_link(0):=1; trie_taken[0]:=false;
-trie_link(trie_size):=0; trie_back(0):=trie_size; {wrap around}
-for p:=1 to 256 do
- begin trie_back(p):=p-1; trie_link(p):=p+1; trie_taken[p]:=false;
- end;
-end;
-
-@ Each time \.{\\patterns} appears, it overrides any patterns that were
-entered earlier, so the arrays are not initialized until \TeX\ sees
-\.{\\patterns}. However, some of the global variables must be
-initialized when \.{INITEX} is loaded, in case the user never mentions
-any \.{\\patterns}.
-
-@<Initialize table entries...@>=
-trie_op_ptr:=min_quarterword;@/
-trie_link(0):=0; trie_char(0):=min_quarterword; trie_op(0):=min_quarterword;
-for k:=1 to 255 do trie[k]:=trie[0];
-trie_max:=255;
-@y
-@ Each time \.{\\patterns} appears, it contributes further patterns to
-the future trie, which will be built only when hyphenation is attempted or
-when a format file is dumped. The boolean variable |trie_not_ready|
-will change to |false| when the trie is compressed; this will disable
-further patterns.
-
-@<Initialize table entries...@>=
-trie_not_ready:=true; trie_root:=0; trie_c[0]:=si(0); trie_ptr:=0;
-
-@ Here is how the trie-compression data structures are initialized.
-If storage is tight, it would be possible to overlap |trie_op_hash|,
-|trie_op_lang|, and |trie_op_val| with |trie|, |trie_hash|, and |trie_taken|,
-because we finish with the former just before we need the latter.
-
-@<Get ready to compress the trie@>=
-@<Sort the hyphenation...@>;
-for p:=0 to trie_size do trie_hash[p]:=0;
-trie_root:=compress_trie(trie_root); {identify equivalent subtries}
-for p:=0 to trie_ptr do trie_ref[p]:=0;
-for p:=0 to 255 do trie_min[p]:=p+1;
-trie_link(0):=1; trie_max:=0
-@z
-@x module 953
-begin c:=so(trie_c[p]);
-if c<trie_min then trie_min:=c;
-if trie_min=0 then z:=trie_link(trie_size)
-else z:=trie_link(trie_min-1); {get the first conceivably good hole}
-loop@+ begin if z<c then goto not_found;
- h:=z-c;@/
-@y
-@!l,@!r:trie_pointer; {left and right neighbors}
-@!ll:1..256; {upper limit of |trie_min| updating}
-begin c:=so(trie_c[p]);
-z:=trie_min[c]; {get the first conceivably good hole}
-loop@+ begin h:=z-c;@/
-@z
-@x module 956
-repeat z:=h+so(trie_c[q]); trie_back(trie_link(z)):=trie_back(z);
-trie_link(trie_back(z)):=trie_link(z); trie_link(z):=0; q:=trie_r[q];
-@y
-repeat z:=h+so(trie_c[q]); l:=trie_back(z); r:=trie_link(z);
-trie_back(r):=l; trie_link(l):=r; trie_link(z):=0;
-if l<256 then
- begin if z<256 then ll:=z @+else ll:=256;
- repeat trie_min[l]:=r; incr(l);
- until l=ll;
- end;
-q:=trie_r[q];
-@z
-@x module 958 is entirely replaced
-@y by the following new code:
-@ When the whole trie has been allocated into the sequential table, we
-must go through it once again so that |trie| contains the correct
-information. Null pointers in the linked trie will be represented by the
-value~0, which properly implements an ``empty'' family.
-
-@<Move the data into |trie|@>=
-h.rh:=0; h.b0:=min_quarterword; h.b1:=min_quarterword; {|trie_link:=0|,
- |trie_op:=min_quarterword|, |trie_char:=qi(0)|}
-if trie_root=0 then {no patterns were given}
- begin for r:=0 to 256 do trie[r]:=h;
- trie_max:=256;
- end
-else begin trie_fix(trie_root); {this fixes the non-holes in |trie|}
- r:=0; {now we will zero out all the holes}
- repeat s:=trie_link(r); trie[r]:=h; r:=s;
- until r>trie_max;
- end;
-trie_char(0):=qi("?"); {make |trie_char(c)<>c| for all |c|}
-@z
-@x module 960
-@!r,@!s:trie_pointer; {used to clean up the packed |trie|}
-@!h:two_halves; {template used to zero out |trie|'s holes}
-begin scan_left_brace; {a left brace must follow \.{\\patterns}}
-init_pattern_memory;@/
-@<Enter all of the patterns into a linked trie, until coming to a right
- brace@>;
-trie_root:=compress_trie(trie_root); {compress the trie}
-@<Pack the trie@>;
-end;
-@y
-begin if trie_not_ready then
- begin set_cur_lang; scan_left_brace; {a left brace must follow \.{\\patterns}}
- @<Enter all of the patterns into a linked trie, until coming to a right
- brace@>;
- end
-else begin print_err("Too late for "); print_esc("patterns");
- help1("All patterns must be given before typesetting begins.");
- error; link(garbage):=scan_toks(false,false); flush_list(def_ref);
- end;
-end;
-@z
-@x module 963
-q:=0;
-while l<k do
- begin incr(l); c:=hc[l]; p:=trie_l[q]; first_child:=true;
-@y
-q:=0; hc[0]:=cur_lang;
-while l<=k do
- begin c:=hc[l]; incr(l); p:=trie_l[q]; first_child:=true;
-@z
-@x module 966 now says that the first call ``takes'' location 1,
-@y and the Pascal code in this module is entirely replaced by the following:
-@<Declare procedures for preprocessing hyphenation patterns@>=
-procedure init_trie;
-var @!p:trie_pointer; {pointer for initialization}
-@!j,@!k,@!t:integer; {all-purpose registers for initialization}
-@!r,@!s:trie_pointer; {used to clean up the packed |trie|}
-@!h:two_halves; {template used to zero out |trie|'s holes}
-begin @<Get ready to compress the trie@>;
-if trie_root<>0 then
- begin first_fit(trie_root); trie_pack(trie_root);
- end;
-@<Move the data into |trie|@>;
-trie_not_ready:=false;
-end;
-@z
-@x module 1033 gets new code before main_loop_1
-@y
-if mode>0 then if language<>clang then fix_language;
-@z
-@x modules 1091 and 1200
-push_nest; mode:=hmode; space_factor:=1000;
-@y
-push_nest; mode:=hmode; space_factor:=1000; clang:=0;
-@z
-@x module 1324
-for k:=0 to trie_max do dump_hh(trie[k]);
-dump_int(trie_op_ptr);
-for k:=min_quarterword+1 to trie_op_ptr do
- begin dump_int(hyf_distance[k]);
- dump_int(hyf_num[k]);
- dump_int(hyf_next[k]);
- end;
-print_ln; print_int(hyph_count); print(" hyphenation exception");
-if hyph_count<>1 then print_char("s");
-print_nl("Hyphenation trie of length "); print_int(trie_max);
-@.Hyphenation trie...@>
-print(" has "); print_int(qo(trie_op_ptr)); print(" op");
-if trie_op_ptr<>min_quarterword+1 then print_char("s")
-@y
-print_ln; print_int(hyph_count); print(" hyphenation exception");
-if hyph_count<>1 then print_char("s");
-if trie_not_ready then init_trie;
-dump_int(trie_max);
-for k:=0 to trie_max do dump_hh(trie[k]);
-dump_int(trie_op_ptr);
-for k:=1 to trie_op_ptr do
- begin dump_int(hyf_distance[k]);
- dump_int(hyf_num[k]);
- dump_int(hyf_next[k]);
- end;
-print_nl("Hyphenation trie of length "); print_int(trie_max);
-@.Hyphenation trie...@>
-print(" has "); print_int(trie_op_ptr); print(" op");
-if trie_op_ptr<>1 then print_char("s");
-print(" out of "); print_int(trie_op_size);
-for k:=255 downto 0 do if trie_used[k]>min_quarterword then
- begin print_nl(" "); print_int(qo(trie_used[k]));
- print(" for language "); print_int(k);
- dump_int(k); dump_int(qo(trie_used[k]));
- end
-@z
-@x module 1325
-undump_size(0)(trie_size)('trie size')(trie_max);
-for k:=0 to trie_max do undump_hh(trie[k]);
-undump(min_quarterword)(max_quarterword)(trie_op_ptr);
-for k:=min_quarterword+1 to trie_op_ptr do
- begin undump(0)(63)(hyf_distance[k]); {a |small_number|}
- undump(0)(63)(hyf_num[k]);
- undump(min_quarterword)(max_quarterword)(hyf_next[k]);
- end
-@y
-undump_size(0)(trie_size)('trie size')(j); {|trie_max|}
-for k:=0 to j do undump_hh(trie[k]);
-undump_size(0)(trie_op_size)('trie op size')(j); {|trie_op_ptr|}
-for k:=1 to j do
- begin undump(0)(63)(hyf_distance[k]); {a |small_number|}
- undump(0)(63)(hyf_num[k]);
- undump(min_quarterword)(max_quarterword)(hyf_next[k]);
- end;
-k:=256;
-while j>0 do
- begin undump(0)(k-1)(k); undump(1)(j)(x); j:=j-x; op_start[k]:=qo(j);
- end;
-@!init trie_not_ready:=false @+tini
-@z
-@x module 1341 gets two new definitions
-@y
-@d language_node=4 {|subtype| in whatsits that change the current language}
-@d stored_language(#)==mem[#+1].int {language number, in the range |0..255|}
-@z
-@x module 1344 gets a new definition and a new Pascal statement
-@y
-@d set_language_code=5 {command modifier for \.{\\setlanguage}}
-primitive("setlanguage",extension,set_language_code);@/
-@!@:set_language_}{\.{\\setlanguage} primitive@>
-@z
-@x module 1346 gets a new case
-@y
- set_language_code:print_esc("setlanguage");
-@z
-@x module 1348 gets a new case
-@y
-set_language_code:@<Implement \.{\\setlanguage}@>;
-@z
-@x module 1356 gets a new case
-@y
-language_node:begin print_esc("setlanguage");
- print_int(stored_language(p));
- end;
-@z
-% in modules 1357 and 1358, change "close_node" to "close_node,language_node".
-@x module 1362 becomes two modules
-@ @<Advance \(p)past a whatsit node in the |line_break| loop@>=do_nothing
-@y
-@ @<Advance \(p)past a whatsit node in the \(l)|line_break| loop@>=
-if subtype(cur_p)=language_node then cur_lang:=stored_language(cur_p)
-
-@ @<Advance \(p)past a whatsit node in the \(p)pre-hyphenation loop@>=
-if subtype(s)=language_node then cur_lang:=stored_language(s)
-@z and old module 1367 is moved to just before the old module 1378
-@x module 1373 gets a new case
-@y
-language_node:do_nothing;
-@z
-@x new modules before the system-dependent changes (i.e. before the old 1376)
-@y
-@ @<Implement \.{\\setlanguage}@>=
-if abs(mode)<>hmode then report_illegal_case
-else begin new_whatsit(language_node,small_node_size);
- scan_int;
- if cur_val<=0 then clang:=0
- else if cur_val>255 then clang:=0
- else clang:=cur_val;
- stored_language(tail):=clang;
- end
-
-@ Finally, we need a subroutine that comes into play when a character of
-a non-|clang| language is being appended to the current paragraph.
-
-@<Declare action...@>=
-procedure fix_language;
-var @!l:ASCII_code; {the new current language}
-begin if language<=0 then l:=0
-else if language>255 then l:=0
-else l:=language;
-if l<>clang then
- begin new_whatsit(language_node,small_node_size);
- stored_language(tail):=l; clang:=l;
- end;
-end;
-@z
-
-362. Major extension to ligature capability.
-@x module 143
-a linked list of character nodes for those characters.
-@y
-a linked list of character nodes for all original characters that have been
-deleted. (This list might be empty if the characters that generated the
-ligature were retained in other nodes.)
-
-The |subtype| field is 0, plus 2 and/or 1 if the original source of the
-ligature included implicit left and/or right boundaries.
-@z
-@x in module 144 add the following procedure to the existing code
-@y
-function new_lig_item(@!c:quarterword):pointer;
-var p:pointer; {the new node}
-begin p:=get_node(small_node_size); character(p):=c; lig_ptr(p):=null;
-new_lig_item:=p;
-end;
-@z
-@x module 193
-font_in_short_display:=font(lig_char(p));
-short_display(lig_ptr(p)); print_char(")");
-@y
-if subtype(p)>1 then print_char("|");
-font_in_short_display:=font(lig_char(p)); short_display(lig_ptr(p));
-if odd(subtype(p)) then print_char("|");
-print_char(")");
-end
-@z
-@x modules 208 and 209
-@d radical=65 {square root and similar signs ( \.{\\radical} )}
-@y
-@d no_boundary=65 {suppress boundary ligatures ( \.{\\noboundary} )}
-@d radical=66 {square root and similar signs ( \.{\\radical} )}
-@z and so on, adding 1 to each definition until getting to max_command=100
-@x module 265 gets a new statement
-@y
-primitive("noboundary",no_boundary,0);@/
-@!@:no_boundary_}{\.{\\noboundary} primitive@>
-@z
-@x module 266 gets a new case
-@y
-no_boundary:print_esc("noboundary");
-@z
-@x module 545 is entirely replaced
-@y by the following new specifications:
-@ The |lig_kern| array contains instructions in a simple programming language
-that explains what to do for special letter pairs. Each word in this array is a
-|@!lig_kern_command| of four bytes.
-
-\yskip\hang first byte: |skip_byte|, indicates that this is the final program
- step if the byte is 128 or more, otherwise the next step is obtained by
- skipping this number of intervening steps.\par
-\hang second byte: |next_char|, ``if |next_char| follows the current character,
- then perform the operation and stop, otherwise continue.''\par
-\hang third byte: |op_byte|, indicates a ligature step if less than~128,
- a kern step otherwise.\par
-\hang fourth byte: |remainder|.\par
-\yskip\noindent
-In a kern step, an
-additional space equal to |kern[256*(op_byte-128)+remainder]| is inserted
-between the current character and |next_char|. This amount is
-often negative, so that the characters are brought closer together
-by kerning; but it might be positive.
-
-There are eight kinds of ligature steps, having |op_byte| codes $4a+2b+c$ where
-$0\le a\le b+c$ and $0\le b,c\le1$. The character whose code is
-|remainder| is inserted between the current character and |next_char|;
-then the current character is deleted if $b=0$, and |next_char| is
-deleted if $c=0$; then we pass over $a$~characters to reach the next
-current character (which may have a ligature/kerning program of its own).
-
-If the very first instruction of the |lig_kern| array has |skip_byte=255|,
-the |next_char| byte is the so-called right boundary character of this font;
-the value of |next_char| need not lie between |bc| and~|ec|.
-If the very last instruction of the |lig_kern| array has |skip_byte=255|,
-there is a special ligature/kerning program for a left boundary character,
-beginning at location |256*op_byte+remainder|.
-The interpretation is that \TeX\ puts implicit boundary characters
-before and after each consecutive string of characters from the same font.
-These implicit characters do not appear in the output, but they can affect
-ligatures and kerning.
-
-If the very first instruction of a character's |lig_kern| program has
-|skip_byte>128|, the program actually begins in location
-|256*op_byte+remainder|. This feature allows access to large |lig_kern|
-arrays, because the first instruction must otherwise
-appear in a location |<=255|.
-
-Any instruction with |skip_byte>128| in the |lig_kern| array must have
-|256*op_byte+remainder<nl|. If such an instruction is encountered during
-normal program execution, it denotes an unconditional halt; no ligature
-command is performed.
-
-@d stop_flag=qi(128) {value indicating `\.{STOP}' in a lig/kern program}
-@d kern_flag=qi(128) {op code for a kern step}
-@d skip_byte(#)==#.b0
-@d next_char(#)==#.b1
-@d op_byte(#)==#.b2
-@d rem_byte(#)==#.b3
-@z
-@x module 549
-@<Glob...@>=
-@y
-@d non_char==qi(256) {a |halfword| code that can't match a real character}
-@d non_address==font_mem_size {a spurious |font_index|}
-
-@<Glob...@>=
-@z
-@x module 548 gets a new type definition
-@y
-@!font_index=0..font_mem_size;
-@z
-@x module 549
- {current \.{\\skewchar} values}
-@y
- {current \.{\\skewchar} values}
-@!bchar_label:array[internal_font_number] of font_index;
- {start of |lig_kern| program for left boundary character,
- |non_address| if there is none}
-@!font_bchar:array[internal_font_number] of min_quarterword..non_char;
- {right boundary character, |non_char| if there is none}
-@!font_false_bchar:array[internal_font_number] of min_quarterword..non_char;
- {|font_bchar| if it doesn't exist in the font, otherwise |non_char|}
-@z
-@x module 557
-@d char_kern_end(#)==rem_byte(#)].sc
-@y NOTE: Optimize kern_base_offset in your change file! It's a constant.
-@d char_kern_end(#)==256*op_byte(#)+rem_byte(#)].sc
-@d kern_base_offset==256*(kern_flag)
-@d lig_kern_restart_end(#)==256*op_byte(#)+rem_byte(#)+32768-kern_base_offset
-@d lig_kern_restart(#)==lig_kern_base[#]+lig_kern_restart_end
-@z
-@x module 560
-@!z:scaled; {the design size or the ``at'' size}
-@y
-@!bch_label:integer; {left boundary start location, or infinity}
-@!bchar:0..256; {right boundary character, or 256}
-@!z:scaled; {the design size or the ``at'' size}
-@z
-@x module 566
-kern_base[f]:=lig_kern_base[f]+nl;
-exten_base[f]:=kern_base[f]+nk;
-@y
-kern_base[f]:=lig_kern_base[f]+nl-kern_base_offset;
-exten_base[f]:=kern_base[f]+kern_base_offset+nk;
-@z
-@x module 573: The entire module is replaced
-@y by the following code.
-@ @d check_existence(#)==@t@>@;@/
- begin check_byte_range(#);
- qw:=char_info(f)(#); {N.B.: not |qi(#)|}
- if not char_exists(qw) then abort;
- end
-
-@<Read ligature/kern program@>=
-bch_label:=@'77777; bchar:=256;
-if nl>0 then
- begin for k:=lig_kern_base[f] to kern_base[f]+kern_base_offset-1 do
- begin store_four_quarters(font_info[k].qqqq);
- if a>128 then
- begin if 256*c+d>=nl then abort;
- if a=255 then if k=lig_kern_base[f] then bchar:=b;
- end
- else begin if b<>bchar then check_existence(b);
- if c<128 then check_existence(d) {check ligature}
- else if 256*(c-128)+d>=nk then abort; {check kern}
- if a<128 then if k-lig_kern_base[f]+a+1>=nl then abort;
- end;
- end;
- if a=255 then bch_label:=256*c+d;
- end;
-for k:=kern_base[f]+kern_base_offset to exten_base[f]-1 do
- store_scaled(font_info[k].sc);
-@z
-@x module 574 (actually a bugfix)
- if a<>0 then check_byte_range(a);
- if b<>0 then check_byte_range(b);
- if c<>0 then check_byte_range(c);
- check_byte_range(d);
-@y
- if a<>0 then check_existence(a);
- if b<>0 then check_existence(b);
- if c<>0 then check_existence(c);
- check_existence(d);
-@z
-@x module 576
-font_name[f]:=nom;
-@y
-if bch_label<nl then bchar_label[f]:=bch_label+lig_kern_base[f]
-else bchar_label[f]:=non_address;
-font_bchar[f]:=qi(bchar);
-font_false_bchar[f]:=qi(bchar);
-if bchar<=ec then if bchar>=bc then
- begin qw:=char_info(f)(bchar); {N.B.: not |qi(bchar)|}
- if char_exists(qw) then font_false_bchar[f]:=non_char;
- end;
-font_name[f]:=nom;
-@z
-@x module 708 (slight but optional optimization)
-continue: if (qo(y)>=font_bc[g])and(qo(y)<=font_ec[g]) then
- begin q:=char_info(g)(y);
-@y
-if (qo(y)>=font_bc[g])and(qo(y)<=font_ec[g]) then
- begin continue: q:=char_info(g)(y);
-@z
-@x module 740 (another bugfix)
- i:=char_info(f)(y);
-@y
- i:=char_info(f)(y);
- if not char_exists(i) then goto done;
-@z
-@x module 741
- repeat cur_i:=font_info[a].qqqq;
- if qo(next_char(cur_i))=skew_char[cur_f] then
- begin if op_bit(cur_i)>=kern_flag then
- s:=char_kern(cur_f)(cur_i);
- goto done1;
- end;
- incr(a);
- until stop_bit(cur_i)>=stop_flag;
-@y
- cur_i:=font_info[a].qqqq;
- if skip_byte(cur_i)>stop_flag then
- begin a:=256*(qo(op_byte(cur_i)))+rem_byte(cur_i);
- cur_i:=font_info[a].qqqq;
- end;
- loop begin if qo(next_char(cur_i))=skew_char[cur_f] then
- begin if op_byte(cur_i)>=kern_flag then
- if skip_byte(cur_i)<=stop_flag then s:=char_kern(cur_f)(cur_i);
- goto done1;
- end;
- if skip_byte(cur_i)>=stop_flag then goto done1
- else a:=a+qo(skip_byte(cur_i))+1;
- cur_i:=font_info[a].qqqq;
- end;
-@z
-@x module 749 (yet another bugfix of the same type!)
-@!p,@!v,@!x,@!y,@!z:pointer; {temporary registers for box construction}
-@y
-@!p,@!v,@!x,@!y,@!z:pointer; {temporary registers for box construction}
-@!c:quarterword;@+@!i:four_quarters; {registers for character examination}
-@z
-@x ibid
- begin cur_c:=rem_byte(cur_i); character(nucleus(q)):=cur_c;
- cur_i:=char_info(cur_f)(cur_c);
-@y
- begin c:=rem_byte(cur_i); i:=char_info(cur_f)(c);
- if char_exists(i) then
- begin cur_c:=c; cur_i:=i; character(nucleus(q)):=c;
- end;
-@z
-@x module 752
-@!p:pointer; {temporary register for list manipulation}
-@y
-@!p,@!r:pointer; {temporary registers for list manipulation}
-@z
-@x ibid
- repeat cur_i:=font_info[a].qqqq;@/
- @<If instruction |cur_i| is a kern with |cur_c|,
- attach the kern after |q| and |return|;
- or if it is a ligature with |cur_c|, combine
- noads |q| and |p| and |goto restart|@>;
- incr(a);
- until stop_bit(cur_i)>=stop_flag;
-@y
- cur_i:=font_info[a].qqqq;
- if skip_byte(cur_i)>stop_flag then
- begin a:=lig_kern_restart(cur_f)(cur_i);
- cur_i:=font_info[a].qqqq;
- end;
- loop@+ begin @<If instruction |cur_i| is a kern with |cur_c|, attach
- the kern after~|q|; or if it is a ligature with |cur_c|, combine
- noads |q| and~|p| appropriately; then |return| if the cursor has
- moved past a noad, or |goto restart|@>;
- if skip_byte(cur_i)>=stop_flag then return;
- a:=a+qo(skip_byte(cur_i))+1;
- cur_i:=font_info[a].qqqq;
- end;
-@z
-@x The entire code of module 753 is revised
-@y and should be replaced by the following:
-@ Note that a ligature between an |ord_noad| and another kind of noad
-is replaced by an |ord_noad|, when the two noads collapse into one.
-But we could make a parenthesis (say) change shape when it follows
-certain letters. Presumably a font designer will define such
-ligatures only when this convention makes sense.
-
-\chardef\?='174 % vertical line to indicate character retention
-
-@<If instruction |cur_i| is a kern with |cur_c|, ...@>=
-if next_char(cur_i)=cur_c then if skip_byte(cur_i)<=stop_flag then
- if op_byte(cur_i)>=kern_flag then
- begin p:=new_kern(char_kern(cur_f)(cur_i));
- link(p):=link(q); link(q):=p; return;
- end
- else begin check_interrupt; {allow a way out of infinite ligature loop}
- case op_byte(cur_i) of
- qi(1),qi(5): character(nucleus(q)):=rem_byte(cur_i); {\.{=:\?}, \.{=:\?>}}
- qi(2),qi(6): character(nucleus(p)):=rem_byte(cur_i); {\.{\?=:}, \.{\?=:>}}
- qi(3),qi(7),qi(11):begin r:=new_noad; {\.{\?=:\?}, \.{\?=:\?>}, \.{\?=:\?>>}}
- character(nucleus(r)):=rem_byte(cur_i);
- fam(nucleus(r)):=fam(nucleus(q));@/
- link(q):=r; link(r):=p;
- if op_byte(cur_i)<qi(11) then math_type(nucleus(r)):=math_char
- else math_type(nucleus(r)):=math_text_char; {prevent combination}
- end;
- othercases begin link(q):=link(p);
- character(nucleus(q)):=rem_byte(cur_i); {\.{=:}}
- mem[subscr(q)]:=mem[subscr(p)]; mem[supscr(q)]:=mem[supscr(p)];@/
- free_node(p,noad_size);
- end
- endcases;
- if op_byte(cur_i)>qi(3) then return;
- math_type(nucleus(q)):=math_char; goto restart;
- end
-@z
-@x module 862
-@!q,@!r,@!s:pointer; {miscellaneous nodes of temporary interest}
-@y
-@!q,@!r,@!s,@!prev_s:pointer; {miscellaneous nodes of temporary interest}
-@z
-@x module 892
-nodes $p_a$ and~$p_b$ in the description above are placed into variables
-@y
-nodes $p_{a-1}$ and~$p_b$ in the description above are placed into variables
-@z
-@x ibid
-@!hc:array[0..65] of halfword; {word to be hyphenated}
-@y
-@!hc:array[0..65] of 0..256; {word to be hyphenated}
-@z
-@x ibid
-@!hu:array[1..63] of ASCII_code; {like |hc|, before conversion to lowercase}
-@y
-@!hu:array[0..63] of 0..256; {like |hc|, before conversion to lowercase}
-@z
-@x module 894
-s:=link(cur_p);
-@y
-prev_s:=cur_p; s:=link(prev_s);
-@z
-@x module 895
-label done,found,not_found,found1,exit;
-@y
-label common_ending,done,found,found1,not_found,not_found+1,exit;
-@z
-@x module 896
- else if type(s)=ligature_node then
- begin q:=lig_ptr(s); c:=qo(character(q)); hf:=font(q);
- end
-@y
- else if type(s)=ligature_node then
- if lig_ptr(s)=null then goto continue
- else begin q:=lig_ptr(s); c:=qo(character(q)); hf:=font(q);
- end
-@z
-@x ibid
-continue: s:=link(s);
-@y
-continue: prev_s:=s; s:=link(prev_s);
-@z
-@x ibid
-ha:=s
-@y
-ha:=prev_s
-@z
-@x module 898
-begin j:=hn; q:=lig_ptr(s);
-if font(q)<>hf then goto done3;
-repeat c:=qo(character(q));
-if lc_code(c)=0 then goto done3;
-if j=63 then goto done3;
-incr(j); hu[j]:=c; hc[j]:=lc_code(c);@/
-q:=link(q);
-until q=null;
-@y
-begin if font(lig_char(s))<>hf then goto done3;
-j:=hn; q:=lig_ptr(s);
-while q>null do
- begin c:=qo(character(q));
- if lc_code(c)=0 then goto done3;
- if j=63 then goto done3;
- incr(j); hu[j]:=c; hc[j]:=lc_code(c);@/
- q:=link(q);
- end;
-@z
-@x module 900 gets three new global variables
-@y
-@!init_list:pointer; {list of punctuation characters preceding the word}
-@!init_lig:boolean; {does |init_list| represent a ligature?}
-@!init_lft:boolean; {if so, did the ligature involve a left boundary?}
-@z
-@x module 901
-@!q,@!r,@!s:pointer; {temporary registers for list manipulation}
-@y
-@!p,@!q,@!r,@!s:pointer; {temporary registers for list manipulation}
-@!bchar:halfword; {right boundary character of hyphenated word, or |non_char|}
-@z
-@x module 903 should be entirely replaced
-@y by the following:
-@ If hyphens are in fact going to be inserted, \TeX\ first deletes the
-subsequence of nodes between |ha| and~|hb|. An attempt is made to
-preserve the effect that implicit boundary characters and punctuation marks
-had on ligatures inside the hyphenated word, by storing a left boundary or
-preceding character in |hu[0]| and by storing a possible right boundary
-in |bchar|. We set |j:=0| if |hu[0]| is to be part of the reconstruction;
-otherwise |j:=1|.
-The variable |s| will point to the tail of the current hlist, and
-|q| will point to the node following |hb|, so that
-things can be hooked up after we reconstitute the hyphenated word.
-
-@<Replace nodes |ha..hb| by a sequence of nodes...@>=
-q:=link(hb); link(hb):=null; r:=link(ha); link(ha):=null; bchar:=non_char;
-if type(hb)=ligature_node then if odd(subtype(hb)) then
- bchar:=font_bchar[hf];
-if is_char_node(ha) then
- begin init_list:=ha; init_lig:=false; hu[0]:=qo(character(ha));
- end
-else if type(ha)=ligature_node then
- begin init_list:=lig_ptr(ha); init_lig:=true; init_lft:=(subtype(ha)>1);
- hu[0]:=qo(character(lig_char(ha)));
- if init_list=null then if init_lft then
- begin hu[0]:=256; init_lig:=false;
- end; {in this case a ligature will be reconstructed from scratch}
- free_node(ha,small_node_size);
- end
-else goto not_found+1; {no punctuation found}
-s:=cur_p; {we have |cur_p<>ha| because |type(cur_p)=glue_node|}
-while link(s)<>ha do s:=link(s);
-j:=0; goto common_ending;
-not_found+1: j:=1; s:=ha; init_list:=null;
-if not is_char_node(r) then if type(r)=ligature_node then
- if subtype(r)>1 then
- begin j:=0; hu[0]:=256; init_lig:=false;
- end;
-common_ending: flush_node_list(r);
-@<Reconstitute nodes for the hyphenated word, inserting discretionary hyphens@>;
-flush_list(init_list)
-@z
-@x modules 905--911 are entirely replaced
-@y by the following new code:
-Still further complications arise in the presence of ligatures that do not
-delete the original characters. When punctuation precedes the word being
-hyphenated, \TeX's method is not perfect under all possible scenarios,
-because punctuation marks and letters can propagate information back and forth.
-For example, suppose the original pre-hyphenation pair
-\.{*a} changes to \.{*y} via a \.{\?=:} ligature, which changes to \.{xy}
-via a \.{=:\?} ligature; if $p_{a-1}=\.x$ and $p_a=\.y$, the reconstitution
-procedure isn't smart enough to obtain \.{xy} again. In such cases the
-font designer should include a ligature that goes from \.{xa} to \.{xy}.
-
-@ The processing is facilitated by a subroutine called |reconstitute|. Given
-a string of characters $x_j\ldots x_n$, there is a smallest index $m\ge j$
-such that the ``translation'' of $x_j\ldots x_n$ by ligatures and kerning
-has the form $y_1\ldots y_t$ followed by the translation of $x_{m+1}\ldots x_n$,
-where $y_1\ldots y_t$ is some nonempty sequence of character, ligature, and
-kern nodes. We call $x_j\ldots x_m$ a ``cut prefix'' of $x_j\ldots x_n$.
-For example, if $x_1x_2x_3=\.{fly}$, and if the font contains `fl' as a
-ligature and a kern between `fl' and `y', then $m=2$, $y=2$, and $y_1$ will
-be a ligature node for `fl' followed by an appropriate kern node~$y_2$.
-In the most common case, $x_j$~forms no ligature with $x_{j+1}$ and we
-simply have $m=j$, $y_1=x_j$. If $m<n$ we can repeat the procedure on
-$x_{m+1}\ldots x_n$ until the entire translation has been found.
-
-The |reconstitute| function returns the integer $m$ and puts the nodes
-$y_1\ldots y_t$ into a linked list starting at |link(hold_head)|,
-getting the input $x_j\ldots x_n$ from the |hu| array. If $x_j=256$,
-we consider $x_j$ to be an implicit left boundary character; in this
-case |j| must be strictly less than~|n|. There is a
-parameter |bchar|, which is either 256 or an implicit right boundary character
-assumed to be present just following~$x_n$. (The value |hu[n+1]| is never
-explicitly examined, but the algorithm imagines that |bchar| is there.)
-
-If there exists an index |k| in the range $j\le k\le m$ such that |hyf[k]|
-is odd and such that the result of reconstitute would have been different
-if $x_{k+1}$ had been |hchar|, then |reconstitute| sets |hyphen_passed|
-to the smallest such~|k|. Otherwise it sets |hyphen_passed| to zero.
-
-A special convention is used in the case |j=0|: Then we assume that the
-translation of |hu[0]| appears in a special list of charnodes starting at
-|init_list|; moreover, if |init_lig| is |true|, then |hu[0]| will be
-a ligature character, involving a left boundary if |init_lft| is |true|.
-This facility is provided for cases when a hyphenated
-word is preceded by punctuation (like single or double quotes) that might
-affect the translation of the beginning of the word.
-
-@<Glob...@>=
-@!hyphen_passed:small_number; {first hyphen in a ligature, if any}
-
-@ @<Declare the function called |reconstitute|@>=
-function reconstitute(@!j,@!n:small_number;@!bchar,@!hchar:halfword):
- small_number;
-label continue,done;
-var @!p:pointer; {temporary register for list manipulation}
-@!t:pointer; {a node being appended to}
-@!q:four_quarters; {character information or a lig/kern instruction}
-@!cur_rh:halfword; {hyphen character for ligature testing}
-@!test_char:halfword; {hyphen or other character for ligature testing}
-@!w:scaled; {amount of kerning}
-@!k:font_index; {position of current lig/kern instruction}
-begin hyphen_passed:=0; t:=hold_head; w:=0; link(hold_head):=null;
- {at this point |ligature_present=lft_hit=rt_hit=false|}
-@<Set up data structures with the cursor following position |j|@>;
-continue:@<If there's a ligature or kern at the cursor position, update the data
- structures, possibly advancing~|j|; continue until the cursor moves@>;
-@<Append a ligature and/or kern to the translation;
- |goto continue| if the stack of inserted ligatures is nonempty@>;
-reconstitute:=j;
-end;
-
-@ The reconstitution procedure shares many of the global data structures
-by which \TeX\ has processed the words before they were hyphenated.
-There is an implied ``cursor'' between characters |cur_l| and |cur_r|;
-these characters will be tested for possible ligature activity. If
-|ligature_present| then |cur_l| is a ligature character formed from the
-original characters following |cur_q| in the current translation list.
-There is a ``ligature stack'' between the cursor and character |j+1|,
-consisting of pseudo-ligature nodes linked together by their |link| fields.
-This stack is normally empty unless a ligature command has created a new
-character that will need to be processed later. A pseudo-ligature is
-a special node having a |character| field that represents a potential
-ligature and a |lig_ptr| field that points to a |char_node| or is |null|.
-We have
-$$|cur_r|=\cases{|character(lig_stack)|,&if |lig_stack>null|;\cr
- |qi(hu[j+1])|,&if |lig_stack=null| and |j<n|;\cr
- bchar,&if |lig_stack=null| and |j=n|.\cr}$$
-
-@<Glob...@>=
-@!cur_l,@!cur_r:halfword; {characters before and after the cursor}
-@!cur_q:pointer; {where a ligature should be detached}
-@!lig_stack:pointer; {unfinished business to the right of the cursor}
-@!ligature_present:boolean; {should a ligature node be made for |cur_l|?}
-@!lft_hit,@!rt_hit:boolean; {did we hit a ligature with a boundary character?}
-
-@ @d append_charnode_to_t(#)== begin link(t):=get_avail; t:=link(t);
- font(t):=hf; character(t):=#;
- end
-@d set_cur_r==begin if j<n then cur_r:=qi(hu[j+1])@+else cur_r:=bchar;
- if odd(hyf[j]) then cur_rh:=hchar@+else cur_rh:=non_char;
- end
-
-@<Set up data structures with the cursor following position |j|@>=
-cur_l:=qi(hu[j]); cur_q:=t;
-if j=0 then
- begin ligature_present:=init_lig; p:=init_list;
- if ligature_present then lft_hit:=init_lft;
- while p>null do
- begin append_charnode_to_t(character(p)); p:=link(p);
- end;
- end
-else if cur_l<non_char then append_charnode_to_t(cur_l);
-lig_stack:=null; set_cur_r
-
-@ We may want to look at the lig/kern program twice, once for a hyphen
-and once for a normal letter. (The hyphen might appear after the letter
-in the program, so we'd better not try to look for both at once.)
-
-@<If there's a ligature or kern at the cursor position, update...@>=
-if cur_l=non_char then
- begin k:=bchar_label[hf];
- if k=non_address then goto done@+else q:=font_info[k].qqqq;
- end
-else begin q:=char_info(hf)(cur_l);
- if char_tag(q)<>lig_tag then goto done;
- k:=lig_kern_start(hf)(q); q:=font_info[k].qqqq;
- if skip_byte(q)>stop_flag then
- begin k:=lig_kern_restart(hf)(q); q:=font_info[k].qqqq;
- end;
- end; {now |k| is the starting address of the lig/kern program}
-if cur_rh<non_char then test_char:=cur_rh@+else test_char:=cur_r;
-loop@+begin if next_char(q)=test_char then if skip_byte(q)<=stop_flag then
- if cur_rh<non_char then
- begin hyphen_passed:=j; hchar:=non_char; cur_rh:=non_char;
- goto continue;
- end
- else begin if hchar<non_char then if odd(hyf[j]) then
- begin hyphen_passed:=j; hchar:=non_char;
- end;
- if op_byte(q)<kern_flag then
- @<Carry out a ligature replacement, updating the cursor structure
- and possibly advancing~|j|; |goto continue| if the cursor doesn't
- advance, otherwise |goto done|@>;
- w:=char_kern(hf)(q); goto done; {this kern will be inserted below}
- end;
- if skip_byte(q)>=stop_flag then
- if cur_rh=non_char then goto done
- else begin cur_rh:=non_char; goto continue;
- end;
- k:=k+qo(skip_byte(q))+1; q:=font_info[k].qqqq;
- end;
-done:
-
-@ @d wrap_lig(#)==if ligature_present then
- begin p:=new_ligature(hf,cur_l,link(cur_q));
- if lft_hit then
- begin subtype(p):=2; lft_hit:=false;
- end;
- if # then if lig_stack=null then
- begin incr(subtype(p)); rt_hit:=false;
- end;
- link(cur_q):=p; t:=p; ligature_present:=false;
- end
-@d pop_lig_stack==begin if lig_ptr(lig_stack)>null then
- begin link(t):=lig_ptr(lig_stack); {this is a charnode for |hu[j+1]|}
- t:=link(t); incr(j);
- end;
- p:=lig_stack; lig_stack:=link(p); free_node(p,small_node_size);
- if lig_stack=null then set_cur_r@+else cur_r:=character(lig_stack);
- end {if |lig_stack| isn't |null| we have |cur_rh=non_char|}
-
-@<Append a ligature and/or kern to the translation...@>=
-wrap_lig(rt_hit);
-if w<>0 then
- begin link(t):=new_kern(w); t:=link(t); w:=0;
- end;
-if lig_stack>null then
- begin cur_q:=t; cur_l:=character(lig_stack); ligature_present:=true;
- pop_lig_stack; goto continue;
- end
-
-@ @<Carry out a ligature replacement, updating the cursor structure...@>=
-begin if cur_l=non_char then lft_hit:=true;
-if j=n then if lig_stack=null then rt_hit:=true;
-check_interrupt; {allow a way out in case there's an infinite ligature loop}
-case op_byte(q) of
-qi(1),qi(5):begin cur_l:=rem_byte(q); {\.{=:\?}, \.{=:\?>}}
- ligature_present:=true;
- end;
-qi(2),qi(6):begin cur_r:=rem_byte(q); {\.{\?=:}. \.{\?=:>}}
- if lig_stack>null then character(lig_stack):=cur_r
- else begin lig_stack:=new_lig_item(cur_r);
- if j=n then bchar:=non_char
- else begin p:=get_avail; lig_ptr(lig_stack):=p;
- character(p):=qi(hu[j+1]); font(p):=hf;
- end;
- end;
- end;
-qi(3):begin cur_r:=rem_byte(q); {\.{\?=:\?}}
- p:=lig_stack; lig_stack:=new_lig_item(cur_r); link(lig_stack):=p;
- end;
-qi(7),qi(11):begin wrap_lig(false); {\.{\?=:\?>}, \.{\?=:\?>>}}
- cur_q:=t; cur_l:=rem_byte(q); ligature_present:=true;
- end;
-othercases begin cur_l:=rem_byte(q); ligature_present:=true; {\.{=:}}
- if lig_stack>null then pop_lig_stack
- else if j=n then goto done
- else begin append_charnode_to_t(cur_r); incr(j); set_cur_r;
- end;
- end
-endcases;
-if op_byte(q)>qi(4) then if op_byte(q)<>qi(7) then goto done;
-goto continue;
-end
-@z
-@x module 912
-@!c:ASCII_code; {character temporarily replaced by a hyphen}
-@y
-@!c:ASCII_code; {character temporarily replaced by a hyphen}
-@!c_loc:0..63; {where that character came from}
-@!r_count:integer; {replacement count for discretionary}
-@z
-@x modules 913--918 are to be completely replaced
-@y by the following code:
-@ When the following code is performed, |hyf[0]| and |hyf[hn]| will be zero.
-
-@<Reconstitute nodes for the hyphenated word...@>=
-repeat l:=j; j:=reconstitute(j,hn,bchar,qi(hyf_char))+1;
-if hyphen_passed=0 then
- begin link(s):=link(hold_head);
- while link(s)>null do s:=link(s);
- if odd(hyf[j-1]) then
- begin l:=j; hyphen_passed:=j-1; link(hold_head):=null;
- end;
- end;
-if hyphen_passed>0 then
- @<Create and append a discretionary node as an alternative to the
- unhyphenated word, and continue to develop both branches until they
- become equivalent@>;
-until j>hn;
-link(s):=q
-
-@ @d advance_major_tail==begin major_tail:=link(major_tail); incr(r_count);
- end
-
-@<Create and append a discretionary node as an alternative...@>=
-begin r:=get_node(small_node_size);
-link(r):=link(hold_head); type(r):=disc_node;
-major_tail:=r; r_count:=0;
-while link(major_tail)>null do advance_major_tail;
-i:=hyphen_passed;
-@<Put the \(c)characters |hu[l..i]| and a hyphen into |pre_break(r)|@>;
-@<Put the \(c)characters |hu[i+1..@,]| into |post_break(r)|, appending to this
- list and to |major_tail| until synchronization has been achieved@>;
-@<Move pointer |s| to the end of the current list, and set |replace_count(r)|
- appropriately@>;
-end
-
-@ The new hyphen might combine with the previous character via ligature
-or kern. At this point we have |l-1<=i<=j| and |i<hn|.
-
-@<Put the \(c)characters |hu[l..i]| and a hyphen into |pre_break(r)|@>=
-minor_tail:=null; pre_break(r):=null; hyf_node:=new_character(hf,hyf_char);
-if hyf_node<>null then
- begin incr(i); c:=hu[i]; hu[i]:=hyf_char; free_avail(hyf_node);
- end;
-while l<=i do
- begin l:=reconstitute(l,i,font_bchar[hf],non_char)+1;
- if link(hold_head)>null then
- begin if minor_tail=null then pre_break(r):=link(hold_head)
- else link(minor_tail):=link(hold_head);
- minor_tail:=link(hold_head);
- while link(minor_tail)>null do minor_tail:=link(minor_tail);
- end;
- end;
-if hyf_node<>null then
- begin hu[i]:=c; {restore the character in the hyphen position}
- l:=i; decr(i);
- end
-
-@ The synchronization algorithm begins with |l=i+1<=j|.
-
-@<Put the \(c)characters |hu[i+1..@,]| into |post_break(r)|...@>=
-minor_tail:=null; post_break(r):=null; c_loc:=0;
-if bchar_label[hf]<non_address then {put left boundary at beginning of new line}
- begin decr(l); c:=hu[l]; c_loc:=l; hu[l]:=256;
- end;
-while l<j do
- begin repeat l:=reconstitute(l,hn,bchar,non_char)+1;
- if c_loc>0 then
- begin hu[c_loc]:=c; c_loc:=0;
- end;
- if link(hold_head)>null then
- begin if minor_tail=null then post_break(r):=link(hold_head)
- else link(minor_tail):=link(hold_head);
- minor_tail:=link(hold_head);
- while link(minor_tail)>null do minor_tail:=link(minor_tail);
- end;
- until l>=j;
- while l>j do
- @<Append characters of |hu[j..@,]| to |major_tail|, advancing~|j|@>;
- end
-
-@ @<Append characters of |hu[j..@,]|...@>=
-begin j:=reconstitute(j,hn,bchar,non_char)+1;
-link(major_tail):=link(hold_head);
-while link(major_tail)>null do advance_major_tail;
-end
-
-@ Ligature insertion can cause a word to grow exponentially in size. Therefore
-we must test the size of |r_count| here, even though the hyphenated text
-was at most 63 characters long.
-
-@<Move pointer |s| to the end of the current list...@>=
-if r_count>127 then {we have to forget the discretionary hyphen}
- begin link(s):=link(r); link(r):=null; flush_node_list(r);
- end
-else begin link(s):=r; replace_count(r):=r_count;
- end;
-s:=major_tail
-@z
-@x module 1030
-@d main_loop=70 {go here to typeset |cur_chr| in the current font}
-@d main_loop_1=71 {like |main_loop|, but |(f,c)| = current font and char}
-@d main_loop_2=72 {like |main_loop_1|, but |c| is known to be in range}
-@d main_loop_3=73 {like |main_loop_2|, but several variables are set up}
-@d append_normal_space=74 {go here to append a normal space between words}
-@y
-@d main_loop=70 {go here to typeset a string of consecutive characters}
-@d main_loop_wrapup=80 {go here to finish a character or ligature}
-@d main_loop_move=90 {go here to advance the ligature cursor}
-@d main_loop_move_lig=95 {same, when advancing past a generated ligature}
-@d main_loop_lookahead=100 {go here to bring in another character, if any}
-@d main_lig_loop=110 {go here to check for ligatures or kerning}
-@d append_normal_space=120 {go here to append a normal space between words}
-@z
-@x ibid
-label big_switch,reswitch,main_loop,main_loop_1,main_loop_2,main_loop_3,
-@y
-label big_switch,reswitch,main_loop,main_loop_wrapup,
- main_loop_move,main_loop_move+1,main_loop_move+2,main_loop_move_lig,
- main_loop_lookahead,main_loop_lookahead+1,
- main_lig_loop,main_lig_loop+1,main_lig_loop+2,
-@z
-@x ibid
-@<Local variables for the inner loop of |main_control|@>@;
-@y
-@z
-@x ibid
-hmode+char_num: begin scan_char_num; cur_chr:=cur_val; goto main_loop;
- end;
-@y
-hmode+char_num: begin scan_char_num; cur_chr:=cur_val; goto main_loop;@+end;
-hmode+no_boundary: begin get_x_token;
- if (cur_cmd=letter)or(cur_cmd=other_char)or(cur_cmd=char_given)or
- (cur_cmd=char_num) then cancel_boundary:=true;
- goto reswitch;
- end;
-@z
-@x modules 1032--1040 are all to be replaced
-@y by the following code:
-@ The following part of the program was first written in a structured
-manner, according to the philosophy that ``premature optimization is
-the root of all evil.'' Then it was rearranged into pieces of
-spaghetti so that the most common actions could proceed with little or
-no redundancy.
-
-The original unoptimized form of this algorithm resembles the
-|reconstitute| procedure, which was described earlier in connection with
-hyphenation. Again we have an implied ``cursor`` between characters
-|cur_l| and |cur_r|. The main difference is that the |lig_stack| can now
-contain a charnode as well as pseudo-ligatures; that stack is now
-usually nonempty, because the next character of input (if any) has been
-appended to it. In |main_control| we have
-$$|cur_r|=\cases{|character(lig_stack)|,&if |lig_stack>null|;\cr
- |font_bchar[cur_font]|,&otherwise.\cr}$$
-Several additional global variables are needed.
-
-@<Glob...@>=
-@!main_f:internal_font_number; {the current font}
-@!main_i:four_quarters; {character information bytes for |cur_l|}
-@!main_j:four_quarters; {ligature/kern command}
-@!main_k:font_index; {index into |font_info|}
-@!main_p:pointer; {temporary register for list manipulation}
-@!main_s:integer; {space factor value}
-@!bchar:halfword; {right boundary character of current font, or |non_char|}
-@!false_bchar:halfword; {nonexistent character matching |bchar|, or |non_char|}
-@!cancel_boundary:boolean; {should the left boundary be ignored?}
-@!ins_disc:boolean; {should we insert a discretionary node?}
-
-@ The boolean variables of the main loop are normally false, and always reset
-to false before the loop is left. That saves us the extra work of initializing
-each time.
-
-@<Set init...@>=
-ligature_present:=false; cancel_boundary:=false; lft_hit:=false; rt_hit:=false;
-ins_disc:=false;
-
-@ We leave |space_factor| unchanged if |sf_code(cur_chr)=0|; otherwise we
-set it to |sf_code(cur_chr)|, except that the space factor never changes
-from a value less than 1000 to a value exceeding 1000. The most common
-case is |sf_code(cur_chr)=1000|, so we want that case to be fast.
-
-The overall structure of the main loop is presented here. Some program labels
-are inside the individual sections.
-
-@d adjust_space_factor==@t@>@;@/
- main_s:=sf_code(cur_chr);
- if main_s=1000 then space_factor:=1000
- else if main_s<1000 then
- begin if main_s>0 then space_factor:=main_s;
- end
- else if space_factor<1000 then space_factor:=1000
- else space_factor:=main_s
-
-@<Append character |cur_chr|...@>=
-adjust_space_factor;@/
-main_f:=cur_font;
-bchar:=font_bchar[main_f]; false_bchar:=font_false_bchar[main_f];
-if mode>0 then if language<>clang then fix_language;
-fast_get_avail(lig_stack); font(lig_stack):=main_f; cur_l:=qi(cur_chr);
-character(lig_stack):=cur_l;@/
-cur_q:=tail;
-if cancel_boundary then
- begin cancel_boundary:=false; main_k:=non_address;
- end
-else main_k:=bchar_label[main_f];
-if main_k=non_address then goto main_loop_move+2; {no left boundary processing}
-cur_r:=cur_l; cur_l:=non_char;
-goto main_lig_loop+1; {begin with cursor after left boundary}
-@#
-main_loop_wrapup:@<Make a ligature node, if |ligature_present|;
- insert a null discretionary, if appropriate@>;
-main_loop_move:@<If the cursor is immediately followed by the right boundary,
- |goto reswitch|; if it's followed by an invalid character, |goto big_switch|;
- otherwise move the cursor one step to the right and |goto main_lig_loop|@>;
-main_loop_lookahead:@<Look ahead for another character, or leave |lig_stack|
- empty if there's none there@>;
-main_lig_loop:@<If there's a ligature/kern command relevant to |cur_l| and
- |cur_r|, adjust the text appropriately; exit to |main_loop_wrapup|@>;
-main_loop_move_lig:@<Move the cursor past a pseudo-ligature, then
- |goto main_loop_lookahead| or |main_lig_loop|@>
-
-@ If the current horizontal list is empty, the reference to |character(tail)|
-here is not strictly legal, since |tail| will be a node freshly returned by
-|get_avail|. But this should cause no problem on most implementations, and we
-do want the inner loop to be fast.
-@^dirty Pascal@>
-
-A discretionary break is not inserted for an explicit hyphen when we are in
-restricted horizontal mode. In particular, this avoids putting discretionary
-nodes inside of other discretionaries.
-
-@d pack_lig(#)== {the parameter is either |rt_hit| or |false|}
- begin main_p:=new_ligature(main_f,cur_l,link(cur_q));
- if lft_hit then
- begin subtype(main_p):=2; lft_hit:=false;
- end;
- if # then if lig_stack=null then
- begin incr(subtype(main_p)); rt_hit:=false;
- end;
- link(cur_q):=main_p; tail:=main_p; ligature_present:=false;
- end
-
-@d wrapup(#)==if cur_l<non_char then
- begin if character(tail)=qi(hyphen_char[main_f]) then if link(cur_q)>null then
- ins_disc:=true;
- if ligature_present then pack_lig(#);
- if ins_disc then
- begin ins_disc:=false;
- if mode>0 then tail_append(new_disc);
- end;
- end
-
-@<Make a ligature node, if |ligature_present|;...@>=
-wrapup(rt_hit)
-
-@ @<If the cursor is immediately followed by the right boundary...@>=
-if lig_stack=null then goto reswitch;
-cur_q:=tail; cur_l:=cur_r; {or |character(lig_stack)|}
-main_loop_move+1:if not is_char_node(lig_stack) then goto main_loop_move_lig;
-main_loop_move+2:if(cur_chr<font_bc[main_f])or(cur_chr>font_ec[main_f]) then
- begin char_warning(main_f,cur_chr); free_avail(lig_stack); goto big_switch;
- end;
-main_i:=char_info(main_f)(cur_l);
-if not char_exists(main_i) then
- begin char_warning(main_f,cur_chr); free_avail(lig_stack); goto big_switch;
- end;
-tail_append(lig_stack) {|main_loop_lookahead| is next}
-
-@ Here we are at |main_loop_move_lig|.
-When we begin this code we have |cur_l=character(lig_stack)| and |cur_q=tail|.
-
-@<Move the cursor past a pseudo-ligature...@>=
-main_p:=lig_ptr(lig_stack);
-if main_p>null then tail_append(main_p);
-temp_ptr:=lig_stack; lig_stack:=link(temp_ptr);
-free_node(temp_ptr,small_node_size);
-main_i:=char_info(main_f)(cur_l); ligature_present:=true;
-if lig_stack=null then
- if main_p>null then goto main_loop_lookahead
- else cur_r:=bchar
-else cur_r:=character(lig_stack);
-goto main_lig_loop
-
-@ The result of \.{\\char} can participate in a ligature or kern, so we must
-look ahead for it.
-
-@<Look ahead for another character...@>=
-get_next; {set only |cur_cmd| and |cur_chr|, for speed}
-if cur_cmd=letter then goto main_loop_lookahead+1;
-if cur_cmd=other_char then goto main_loop_lookahead+1;
-if cur_cmd=char_given then goto main_loop_lookahead+1;
-x_token; {now expand and set |cur_cmd|, |cur_chr|, |cur_tok|}
-if cur_cmd=letter then goto main_loop_lookahead+1;
-if cur_cmd=other_char then goto main_loop_lookahead+1;
-if cur_cmd=char_given then goto main_loop_lookahead+1;
-if cur_cmd=char_num then
- begin scan_char_num; cur_chr:=cur_val; goto main_loop_lookahead+1;
- end;
-if cur_cmd=no_boundary then bchar:=non_char;
-cur_r:=bchar; lig_stack:=null; goto main_lig_loop;
-main_loop_lookahead+1: adjust_space_factor;
-fast_get_avail(lig_stack); font(lig_stack):=main_f;
-cur_r:=qi(cur_chr); character(lig_stack):=cur_r;
-if cur_r=false_bchar then cur_r:=non_char {this prevents spurious ligatures}
-
-@ Even though comparatively few characters have a lig/kern program, several
-of the instructions here count as part of \TeX's inner loop, since a
-potentially long sequential search must be performed. For example, tests with
-Computer Modern Roman showed that about 40 per cent of all characters
-actually encountered in practice had a lig/kern program, and that about four
-lig/kern commands were investigated for every such character.
-
-At the beginning of this code we have |main_i=char_info(main_f)(cur_l)|.
-
-@<If there's a ligature/kern command...@>=
-if char_tag(main_i)<>lig_tag then goto main_loop_wrapup;
-main_k:=lig_kern_start(main_f)(main_i); main_j:=font_info[main_k].qqqq;
-if skip_byte(main_j)<=stop_flag then goto main_lig_loop+2;
-main_k:=lig_kern_restart(main_f)(main_j);
-main_lig_loop+1:main_j:=font_info[main_k].qqqq;
-main_lig_loop+2:if next_char(main_j)=cur_r then
- if skip_byte(main_j)<=stop_flag then
- @<Do ligature or kern command, returning to |main_lig_loop|
- or |main_loop_wrapup| or |main_loop_move|@>;
-if skip_byte(main_j)=qi(0) then incr(main_k)
-else begin if skip_byte(main_j)>=stop_flag then goto main_loop_wrapup;
- main_k:=main_k+qo(skip_byte(main_j))+1;
- end;
-goto main_lig_loop+1
-
-@ When a ligature or kern instruction matches a character, we know from
-|read_font_info| that the character exists in the font, even though we
-haven't verified its existence in the normal way.
-
-This section could be made into a subroutine, if the code inside
-|main_control| needs to be shortened.
-
-\chardef\?='174 % vertical line to indicate character retention
-
-@<Do ligature or kern command...@>=
-begin if op_byte(main_j)>=kern_flag then
- begin wrapup(rt_hit);
- tail_append(new_kern(char_kern(main_f)(main_j))); goto main_loop_move;
- end;
-if cur_l=non_char then lft_hit:=true
-else if lig_stack=null then rt_hit:=true;
-check_interrupt; {allow a way out in case there's an infinite ligature loop}
-case op_byte(main_j) of
-qi(1),qi(5):begin cur_l:=rem_byte(main_j); {\.{=:\?}, \.{=:\?>}}
- main_i:=char_info(main_f)(cur_l); ligature_present:=true;
- end;
-qi(2),qi(6):begin cur_r:=rem_byte(main_j); {\.{\?=:}, \.{\?=:>}}
- if lig_stack=null then {right boundary character is being consumed}
- begin lig_stack:=new_lig_item(cur_r); bchar:=non_char;
- end
- else if is_char_node(lig_stack) then {|link(lig_stack)=null|}
- begin main_p:=lig_stack; lig_stack:=new_lig_item(cur_r);
- lig_ptr(lig_stack):=main_p;
- end
- else character(lig_stack):=cur_r;
- end;
-qi(3):begin cur_r:=rem_byte(main_j); {\.{\?=:\?}}
- main_p:=lig_stack; lig_stack:=new_lig_item(cur_r);
- link(lig_stack):=main_p;
- end;
-qi(7),qi(11):begin wrapup(false); {\.{\?=:\?>}, \.{\?=:\?>>}}
- cur_q:=tail; cur_l:=rem_byte(main_j);
- main_i:=char_info(main_f)(cur_l); ligature_present:=true;
- end;
-othercases begin cur_l:=rem_byte(main_j); ligature_present:=true; {\.{=:}}
- if lig_stack=null then goto main_loop_wrapup
- else goto main_loop_move+1;
- end
-endcases;
-if op_byte(main_j)>qi(4) then
- if op_byte(main_j)<>qi(7) then goto main_loop_wrapup;
-if cur_l<non_char then goto main_lig_loop;
-main_k:=bchar_label[main_f]; goto main_lig_loop+1;
-end
-@z
-% HINTS for making main_control shorter if you need to conserve space:
-% (1) make pack_lig(#) a procedure call instead of a macro call
-% (2) make the code of @<Do ligature...@> a function that returns one of
-% four values; you goto a label based on the value returned.
-@x module 1042
-begin p:=font_glue[cur_font];
-if p=null then
- begin f:=cur_font; p:=new_spec(zero_glue); k:=param_base[f]+space_code;
- width(p):=font_info[k].sc; {that's |space(f)|}
- stretch(p):=font_info[k+1].sc; {and |space_stretch(f)|}
- shrink(p):=font_info[k+2].sc; {and |space_shrink(f)|}
- font_glue[f]:=p;
-@y
-begin main_p:=font_glue[cur_font];
-if main_p=null then
- begin main_p:=new_spec(zero_glue); main_k:=param_base[cur_font]+space_code;
- width(main_p):=font_info[main_k].sc; {that's |space(cur_font)|}
- stretch(main_p):=font_info[main_k+1].sc; {and |space_stretch(cur_font)|}
- shrink(main_p):=font_info[main_k+2].sc; {and |space_shrink(cur_font)|}
- font_glue[cur_font]:=main_p;
-@z
-@x module 1045
-any_mode(relax),vmode+spacer,mmode+spacer,mmode+no_boundary:do_nothing;
-@y
-any_mode(relax),vmode+spacer,mmode+spacer:do_nothing;
-@z
-@x module 1090
- vmode+ex_space:@t@>@;@/
-@y
- vmode+ex_space,vmode+no_boundary:@t@>@;@/
-@z
-@x module 1322
-dump_int(font_glue[k]);@/
-@y
-dump_int(font_glue[k]);@/
-dump_int(bchar_label[k]);
-dump_int(font_bchar[k]);
-dump_int(font_false_bchar[k]);@/
-@z
-@x module 1323
-undump(min_halfword)(lo_mem_max)(font_glue[k]);@/
-@y
-undump(min_halfword)(lo_mem_max)(font_glue[k]);@/
-undump(0)(font_mem_size)(bchar_label[k]);
-undump(min_quarterword)(non_char)(font_bchar[k]);
-undump(min_quarterword)(non_char)(font_false_bchar[k]);
-@z
-
-363. New \inputlineno feature desired by Spivak
-@x module 416 gets a new definition and a new statement
-@y
-@d input_line_no_code=glue_val+1 {code for \.{\\inputlineno}}
-primitive("inputlineno",last_item,input_line_no_code);
-@!@:input_line_no_}{\.{\\inputlineno} primitive@>
-@z and module 417 changes in the obvious way
-@x module 424 gets new code at the beginning
-@y
-if cur_chr>glue_val then
- begin cur_val:=line; cur_val_level:=int_val;
- end
-else
-@z
-
-364. New feature \holdinginserts suggested by Mittelbach.
-@x modules 236--238 get a new integer parameter
-@d int_pars=53 {total number of integer parameters}
-@y
-@d holding_inserts_code=53 {do not remove insertion nodes from \.{\\box255}}
-@d int_pars=54 {total number of integer parameters}
-@z and appropriate further lines are added to match all the other parameters
-@x module 1014
-@<Prepare all the boxes involved in insertions to act as queues@>;
-q:=hold_head; link(q):=null; prev_p:=page_head; p:=link(prev_p);
-while p<>best_page_break do
- begin if type(p)=ins_node then @<Either insert the material
- specified by node |p| into the appropriate box, or
- hold it for the next page; also delete node |p| from
- the current page@>
-@y
-if holding_inserts<=0 then
- @<Prepare all the boxes involved in insertions to act as queues@>;
-q:=hold_head; link(q):=null; prev_p:=page_head; p:=link(prev_p);
-while p<>best_page_break do
- begin if type(p)=ins_node then
- begin if holding_inserts<=0 then
- @<Either insert the material specified by node |p| into the
- appropriate box, or hold it for the next page;
- also delete node |p| from the current page@>;
- end
-@z
-% also insert begin...end around the Pascal code of module 1018
-
-365. New \badness feature (which I'd been resisting for years)
-@x module 416 gets a new definition and a new statement
-@y
-@d badness_code=glue_val+2 {code for \.{\\badness}}
-primitive("badness",last_item,badness_code);
-@!@:badness_}{\.{\\badness} primitive@>
-@z and module 417 changes in the obvious way
-@x module 424 (the new code just added in #363)
- begin cur_val:=line; cur_val_level:=int_val;
-@y
- begin if cur_chr=input_line_no_code then cur_val:=line
- else cur_val:=last_badness; {|cur_chr=badness_code|}
- cur_val_level:=int_val;
-@z
-@x module 646 gets a new global variable
-@y
-@!last_badness:integer; {badness of the most recently packaged box}
-@z
-@x module 648
-@ @<Set init...@>=adjust_tail:=null;
-@y
-@ @<Set init...@>=adjust_tail:=null; last_badness:=0;
-@z
-@x modules 649 and 668
-@!b:integer; {badness of the new box}
-begin r:=get_node(box_node_size); type(r):=hlist_node;
-@y (except it's vlist_node in 668)
-begin last_badness:=0; r:=get_node(box_node_size); type(r):=hlist_node;
-@z (except it's vlist_node in 668)
-% change b to last_badness in modules 660&674 (4 times), 667&678 (3 times)
-@x modules 658 and 673
-if (hbadness<inf_bad)and(o=normal)and(list_ptr(r)<>null) then
-@y (except it's vbadness in 673)
-if o=normal then if list_ptr(r)<>null then
-@z
-@x modules 664 and 676
- begin set_glue_ratio_one(glue_set(r)); {this is the maximum shrinkage}
-@y
- begin last_badness:=1000000;
- set_glue_ratio_one(glue_set(r)); {use the maximum shrinkage}
-@z
-@x ibid
-else if (hbadness<100)and(o=normal)and(list_ptr(r)<>null) then
-@y (except it's vbadness in 676)
-else if o=normal then if list_ptr(r)<>null then
-@z
-
-366. New \emergencystretch feature
-@x modules 247--248 get a new dimen parameter
-@d dimen_pars=20 {total number of dimension parameters}
-@y
-@d emergency_stretch_code=20 {reduces badnesses on final pass of line-breaking}
-@d dimen_pars=21 {total number of dimension parameters}
-@z and appropriate further lines are added to match all the other parameters
-@x module 828
-@!second_pass:boolean; {is this our second attempt to break this paragraph?}
-@y
-@!second_pass:boolean; {is this our second attempt to break this paragraph?}
-@!final_pass:boolean; {is this our final attempt to break this paragraph?}
-@z
-% change second_pass to final_pass in modules 854 and 873
-@x module 863
- second_pass:=false;
- end
-else begin threshold:=tolerance; second_pass:=true;
-@y
- second_pass:=false; final_pass:=false;
- end
-else begin threshold:=tolerance; second_pass:=true;
- final_pass:=(emergency_stretch<=0);
-@z
-@x ibid
- @!stat if tracing_paragraphs>0 then print_nl("@@secondpass");@;@+tats@/
- threshold:=tolerance; second_pass:=true; {if at first you don't
- succeed, \dots}
-@y
- if not second_pass then
- begin@!stat if tracing_paragraphs>0 then print_nl("@@secondpass");@;@+tats@/
- threshold:=tolerance; second_pass:=true; final_pass:=(emergency_stretch<=0);
- end {if at first you don't succeed, \dots}
- else begin @!stat if tracing_paragraphs>0 then
- print_nl("@@finalpass");@;@+tats@/
- background[2]:=background[2]+emergency_stretch; final_pass:=true;
- end;
-@z
-
-367. New \errorcontextlines feature suggested by a TUG participant
-@x modules 236--238 get a new integer parameter
-@d int_pars=54 {total number of integer parameters}
-@y
-@d error_context_lines_code=54 {maximum intermediate line pairs shown}
-@d int_pars=55 {total number of integer parameters}
-@z and appropriate further lines are added to match all the other parameters
-@x module 311
-@<Local variables for formatting calculations@>@/
-begin base_ptr:=input_ptr; input_stack[base_ptr]:=cur_input;
- {store current state}
-loop@+begin cur_input:=input_stack[base_ptr]; {enter into the context}
- @<Display the current context@>;
- if (state<>token_list) then
- if (name>17) or (base_ptr=0) then goto done;
-@y
-@!nn:integer; {number of contexts shown so far, less one}
-@!bottom_line:boolean; {have we reached the final context to be shown?}
-@<Local variables for formatting calculations@>@/
-begin base_ptr:=input_ptr; input_stack[base_ptr]:=cur_input;
- {store current state}
-nn:=-1; bottom_line:=false;
-loop@+begin cur_input:=input_stack[base_ptr]; {enter into the context}
- if (state<>token_list) then
- if (name>17) or (base_ptr=0) then bottom_line:=true;
- if (base_ptr=input_ptr)or bottom_line or(nn<error_context_lines) then
- @<Display the current context@>
- else if nn=error_context_lines then
- begin print_nl("..."); incr(nn); {omitted if |error_context_lines<0|}
- end;
- if bottom_line then goto done;
-@z
-% also insert begin...end around the Pascal code of module 312
-% and add the statement "incr(nn)" to that module
-
-368. char_warning inside hyphenation could clobber old_setting
-@x module 863
-done: @!stat if tracing_paragraphs>0 then end_diagnostic(true);@;@+tats@/
-@y
-done: @!stat if tracing_paragraphs>0 then
- begin end_diagnostic(true); normalize_selector;
- end;@+tats@/
-@z
-
-369. Make ".fmt" more easily switchable (Don Hosek).
-@x module 520 gets a new definition
-@y
-@d format_extension=".fmt" {the extension, as a \.{WEB} constant}
-@z now replace ".fmt" by format_extension in modules 529 and 1328.
-
-370. Possible range check on weird nullfont (Breitenlohner, 16 Oct 89).
-@x module 565
-if (bc>ec+1)or(ec>255) then abort;
-@y
-if (bc>ec+1)or(ec>255) then abort;
-if bc>255 then {|bc=256| and |ec=255|}
- begin bc:=1; ec:=0;
- end;
-@z
-
-371. Prevent save_stack conflicts, e.g. in {\hbox\expandafter{\csname
- \endcsname}} (found by Sullivan).
-@x module 645
-@p procedure scan_spec; {scans a box specification and left brace}
-label found;
-begin if scan_keyword("to") then saved(0):=exactly
-@.to@>
-else if scan_keyword("spread") then saved(0):=additional
-@.spread@>
-else begin saved(0):=additional; saved(1):=0;
- goto found;
- end;
-scan_normal_dimen; saved(1):=cur_val;
-found: save_ptr:=save_ptr+2; scan_left_brace;
-@y
-@p procedure scan_spec(@!c:group_code;@!three_codes:boolean);
- {scans a box specification and left brace}
-label found;
-var @!s:integer; {temporarily saved value}
-@!spec_code:exactly..additional;
-begin if three_codes then s:=saved(0);
-if scan_keyword("to") then spec_code:=exactly
-@.to@>
-else if scan_keyword("spread") then spec_code:=additional
-@.spread@>
-else begin spec_code:=additional; cur_val:=0;
- goto found;
- end;
-scan_normal_dimen;
-found: if three_codes then
- begin saved(0):=s; incr(save_ptr);
- end;
-saved(0):=spec_code; saved(1):=cur_val; save_ptr:=save_ptr+2;
-new_save_level(c); scan_left_brace;
-@z
-@x module 774
-scan_spec; new_save_level(align_group);@/
-@y
-scan_spec(align_group,false);@/
-@z
-@x module 1073
- if t=0 then saved(0):=cur_val@+else saved(0):=-cur_val;
- scan_box;
- end;
-any_mode(leader_ship): begin saved(0):=leader_flag-a_leaders+cur_chr; scan_box;
- end;
-any_mode(make_box): begin saved(0):=0; begin_box;
- end;
-@y
- if t=0 then scan_box(cur_val)@+else scan_box(-cur_val);
- end;
-any_mode(leader_ship): scan_box(leader_flag-a_leaders+cur_chr);
-any_mode(make_box): begin_box(0);
-@z
-@x module 1075
-procedure box_end;
-var p:pointer; {|ord_noad| for new box in math mode}
-begin if saved(0)<box_flag then @<Append box |cur_box| to the current list,
- shifted by |saved(0)|@>
-else if saved(0)<ship_out_flag then @<Store \(c)|cur_box| in a box register@>
-else if cur_box<>null then
- if saved(0)>ship_out_flag then @<Append a new leader node that
- uses |cur_box|@>
-@y
-procedure box_end(@!box_context:integer);
-var p:pointer; {|ord_noad| for new box in math mode}
-begin if box_context<box_flag then @<Append box |cur_box| to the current list,
- shifted by |box_context|@>
-else if box_context<ship_out_flag then @<Store \(c)|cur_box| in a box register@>
-else if cur_box<>null then
- if box_context>ship_out_flag then @<Append a new leader node that
- uses |cur_box|@>
-@z
-@x module 1076
- begin shift_amount(cur_box):=saved(0);
-@y
- begin shift_amount(cur_box):=box_context;
-@z
-@x module 1077
-if saved(0)<box_flag+256 then
- eq_define(box_base-box_flag+saved(0),box_ref,cur_box)
-else geq_define(box_base-box_flag-256+saved(0),box_ref,cur_box)
-@y
-if box_context<box_flag+256 then
- eq_define(box_base-box_flag+box_context,box_ref,cur_box)
-else geq_define(box_base-box_flag-256+box_context,box_ref,cur_box)
-@z
-@x module 1078
- begin append_glue; subtype(tail):=saved(0)-(leader_flag-a_leaders);
-@y
- begin append_glue; subtype(tail):=box_context-(leader_flag-a_leaders);
-@z
-@x module 1079
-procedure begin_box;
-@y
-procedure begin_box(@!box_context:integer);
-@z
-@x ibid
-box_end; {in simple cases, we use the box immediately}
-@y
-box_end(box_context); {in simple cases, we use the box immediately}
-@z
-@x module 1083
-incr(save_ptr); scan_spec;
-if k=hmode then
- if (saved(-3)<box_flag)and(abs(mode)=vmode) then
- new_save_level(adjusted_hbox_group)
- else new_save_level(hbox_group)
-else begin if k=vmode then new_save_level(vbox_group)
- else begin new_save_level(vtop_group); k:=vmode;
-@y
-saved(0):=box_context;
-if k=hmode then
- if (box_context<box_flag)and(abs(mode)=vmode) then
- scan_spec(adjusted_hbox_group,true)
- else scan_spec(hbox_group,true)
-else begin if k=vmode then scan_spec(vbox_group,true)
- else begin scan_spec(vtop_group,true); k:=vmode;
-@z
-@x module 1084
-procedure scan_box; {the next input should specify a box or perhaps a rule}
-begin @<Get the next non-blank non-relax...@>;
-if cur_cmd=make_box then begin_box
-else if (saved(0)>=leader_flag)and((cur_cmd=hrule)or(cur_cmd=vrule)) then
- begin cur_box:=scan_rule_spec; box_end;
-@y
-procedure scan_box(@!box_context:integer);
- {the next input should specify a box or perhaps a rule}
-begin @<Get the next non-blank non-relax...@>;
-if cur_cmd=make_box then begin_box(box_context)
-else if (box_context>=leader_flag)and((cur_cmd=hrule)or(cur_cmd=vrule)) then
- begin cur_box:=scan_rule_spec; box_end(box_context);
-@z
-@x module 1086
-pop_nest; box_end;
-@y
-pop_nest; box_end(saved(0));
-@z
-@x module 1117
-else begin incr(save_ptr); saved(-1):=0; scan_left_brace;
- new_save_level(disc_group); push_nest; mode:=-hmode; space_factor:=1000;
-@y
-else begin incr(save_ptr); saved(-1):=0; new_save_level(disc_group);
- scan_left_brace; push_nest; mode:=-hmode; space_factor:=1000;
-@z
-@x module 1119
-incr(saved(-1)); scan_left_brace; new_save_level(disc_group);
-@y
-incr(saved(-1)); new_save_level(disc_group); scan_left_brace;
-@z
-@x module 1167
-mmode+vcenter: begin scan_spec; new_save_level(vcenter_group); normal_paragraph;
-@y
-mmode+vcenter: begin scan_spec(vcenter_group,false); normal_paragraph;
-@z
-@x module 1172
-scan_left_brace; push_math(math_choice_group);
-@y
-push_math(math_choice_group); scan_left_brace;
-@z
-@x module 1174
-incr(saved(-1)); scan_left_brace; push_math(math_choice_group);
-@y
-incr(saved(-1)); push_math(math_choice_group); scan_left_brace;
-@z
-@x module 1241
- if global then saved(0):=box_flag+256+cur_val
- else saved(0):=box_flag+cur_val;
- scan_optional_equals; scan_box;
-@y
- if global then n:=256+cur_val@+else n:=cur_val;
- scan_optional_equals; scan_box(box_flag+n);
-@z
-
-372. Bugfix 339 didn't go far enough (found by Sch\"opf and Mittelbach).
-@x module 516 [NOTE: THIS AFFECTS ALMOST ALL CHANGE FILES!]
-@ And here's the second.
-@^system dependencies@>
-
-@p function more_name(@!c:ASCII_code):boolean;
-begin if c=" " then more_name:=false
-else begin if (c=">")or(c=":") then
- begin area_delimiter:=pool_ptr; ext_delimiter:=0;
- end
- else if (c=".")and(ext_delimiter=0) then ext_delimiter:=pool_ptr;
- str_room(1); append_char(c); {contribute |c| to the current string}
-@y
-@ And here's the second. The string pool might change as the file name is
-being scanned, since a new \.{\\csname} might be entered; therefore we keep
-|area_delimiter| and |ext_delimiter| relative to the beginning of the current
-string, instead of assigning an absolute address like |pool_ptr| to them.
-@^system dependencies@>
-
-@p function more_name(@!c:ASCII_code):boolean;
-begin if c=" " then more_name:=false
-else begin str_room(1); append_char(c); {contribute |c| to the current string}
- if (c=">")or(c=":") then
- begin area_delimiter:=cur_length; ext_delimiter:=0;
- end
- else if (c=".")and(ext_delimiter=0) then ext_delimiter:=cur_length;
-@z
-@x module 517 [NOTE: THIS DOES TOO, AND SO DOES THE NEXT!]
-else begin cur_area:=str_ptr; incr(str_ptr);
- str_start[str_ptr]:=area_delimiter+1;
-@y
-else begin cur_area:=str_ptr;
- str_start[str_ptr+1]:=str_start[str_ptr]+area_delimiter; incr(str_ptr);
-@z
-@x ibid
-else begin cur_name:=str_ptr; incr(str_ptr);
- str_start[str_ptr]:=ext_delimiter; cur_ext:=make_string;
-@y
-else begin cur_name:=str_ptr;
- str_start[str_ptr+1]:=str_start[str_ptr]+ext_delimiter-area_delimiter-1;
- incr(str_ptr); cur_ext:=make_string;
-@z
-
-373. Allow multiple hyphenmins in the same paragraph (Mike Ferguson).
-@x module 212, two new fields for list_state_record
-@y
- @!lhm_field,@!rhm_field: quarterword;
-@z
-@x module 213, two new macros to access those fields
-@y
-@d lhmin==cur_list.lhm_field {\.{\\lefthyphenmin} at start of paragraph}
-@d rhmin==cur_list.rhm_field {\.{\\righthyphenmin} at start of paragraph}
-@z
-@x module 215, two new initializations
-@y
-lhmin:=0; rhmin:=0;
-@z
-@x module 218
- if nest[p].ml_field<0 then print(" (\output routine)");
-@y
- if m=hmode then@+if(nest[p].lhm_field<>2)or(nest[p].rhm_field<>3)then
- begin print(" (hyphenmin "); print_int(nest[p].lhm_field); print_char(",");
- print_int(nest[p].rhm_field); print_char(")");
- end;
- if nest[p].ml_field<0 then print(" (\output routine)");
-@z
-@x module 891
-l_hyf:=left_hyphen_min-1;@+if l_hyf<0 then l_hyf:=0;
-r_hyf:=right_hyphen_min-1;@+if r_hyf<0 then r_hyf:=0;
-min_hyf:=l_hyf+r_hyf+2; cur_lang:=0;
-@y
-l_hyf:=lhmin; r_hyf:=rhmin; cur_lang:=0;
-@z
-@x module 892
-@!l_hyf,@!r_hyf,@!min_hyf:integer; {limits on fragment sizes}
-@y
-@!l_hyf,@!r_hyf:integer; {limits on fragment sizes}
-@z
-@x module 894
-begin if min_hyf>63 then goto done1;
-prev_s:=cur_p; s:=link(prev_s);
-if s<>null then
- begin @<Skip to node |ha|, or |goto done1| if no hyphenation
- should be attempted@>;
- @<Skip to node |hb|, putting letters into |hu| and |hc|@>;
- @<Check that the nodes following |hb| permit hyphenation and that at least
- |min_hyf| letters have been found, otherwise |goto done1|@>;
-@y
-begin prev_s:=cur_p; s:=link(prev_s);
-if s<>null then
- begin @<Skip to node |ha|, or |goto done1| if no hyphenation
- should be attempted@>;
- if l_hyf+r_hyf>63 then goto done1;
- @<Skip to node |hb|, putting letters into |hu| and |hc|@>;
- @<Check that the nodes following |hb| permit hyphenation and that at least
- |l_hyf+r_hyf| letters have been found, otherwise |goto done1|@>;
-@z
-@x module 899
-if hn<min_hyf then goto done1;
-@y
-if hn<l_hyf+r_hyf then goto done1;
-@z
-@x module 902
-for j:=l_hyf+1 to hn-r_hyf-1 do if odd(hyf[j]) then goto found1;
-@y
-for j:=l_hyf to hn-r_hyf do if odd(hyf[j]) then goto found1;
-@z
-@x module 923
-for j:=0 to hn-r_hyf do
-@y
-for j:=0 to hn-r_hyf+1 do
-@z
-@x ibid
-found: for j:=0 to l_hyf do hyf[j]:=0;
-for j:=0 to r_hyf do hyf[hn-j]:=0
-@y
-found: for j:=0 to l_hyf-1 do hyf[j]:=0;
-for j:=0 to r_hyf-1 do hyf[hn-j]:=0
-@z
-@x module 1091 begins with a new subroutine
-@y
-function norm_min(@!h:integer):small_number;
-begin if h<=0 then norm_min:=1@+else if h>=63 then norm_min:=63@+
-else norm_min:=h;
-end;
-@z
-@x module 1091 then uses the new subroutine
-push_nest; mode:=hmode; space_factor:=1000; clang:=0;
-@y
-lhmin:=norm_min(left_hyphen_min); rhmin:=norm_min(right_hyphen_min);
-push_nest; mode:=hmode; space_factor:=1000; clang:=0;
-@z
-@x module 1341
-@d stored_language(#)==mem[#+1].int {language number, in the range |0..255|}
-@y
-@d what_lang(#)==link(#+1) {language number, in the range |0..255|}
-@d what_lhm(#)==type(#+1) {minimum left fragment, in the range |1..63|}
-@d what_rhm(#)==subtype(#+1) {minimum right fragment, in the range |1..63|}
-@z
-@x module 1356
- print_int(stored_language(p));
-@y
- print_int(what_lang(p)); print(" (hyphenmin ");
- print_int(what_lhm(p)); print_char(",");
- print_int(what_rhm(p)); print_char(")");
-@z
-@x modules 1362 and 1363
-@ @<Advance \(p)past a whatsit node in the \(l)|line_break| loop@>=
-if subtype(cur_p)=language_node then cur_lang:=stored_language(cur_p)
-
-@ @<Advance \(p)past a whatsit node in the \(p)pre-hyphenation loop@>=
-if subtype(s)=language_node then cur_lang:=stored_language(s)
-@y
-@ @d adv_past(#)==@+if subtype(#)=language_node then
- begin cur_lang:=what_lang(#); l_hyf:=what_lhm(#); r_hyf:=what_rhm(#);@+end
-
-@<Advance \(p)past a whatsit node in the \(l)|line_break| loop@>=@+
-adv_past(cur_p)
-
-@ @<Advance \(p)past a whatsit node in the \(p)pre-hyphenation loop@>=@+
-adv_past(s)
-@z
-@x module 1376
- stored_language(tail):=l; clang:=l;
-@y
- what_lang(tail):=l; clang:=l;@/
- what_lhm(tail):=norm_min(left_hyphen_min);
- what_rhm(tail):=norm_min(right_hyphen_min);
-@z
-@x module 1377
- stored_language(tail):=clang;
-@y
- what_lang(tail):=clang;
- what_lhm(tail):=norm_min(left_hyphen_min);
- what_rhm(tail):=norm_min(right_hyphen_min);
-@z
-
-374. Make \par and end_template definitely non-character (Marc van Leeuwen)
-@x module 14 gets a new line
-@y
-if mem_top<256+11 then bad:=7; {we will want |null_list>255|}
-@z
-@x module 334
-primitive("par",par_end,0); par_loc:=cur_val; par_token:=cs_token_flag+par_loc;
-@y
-primitive("par",par_end,256); {cf. |scan_file_name|}
-par_loc:=cur_val; par_token:=cs_token_flag+par_loc;
-@z
-
-375. Alignments must be more robust to prevent crashes (Marc van Leeuwen)
-@x module 324
-else if token_type=u_template then align_state:=0;
-@y
-else if token_type=u_template then
- if align_state>500000 then align_state:=0
- else fatal_error("(interwoven alignment preambles are not allowed)");
-@.interwoven alignment preambles...@>
-@z
-@x module 782
-if (cur_cmd=assign_glue)and(cur_chr=glue_base+tab_skip_code) then
-@y
-if cur_cmd=endv then
- fatal_error("(interwoven alignment preambles are not allowed)");
-@.interwoven alignment preambles...@>
-if (cur_cmd=assign_glue)and(cur_chr=glue_base+tab_skip_code) then
-@z
-@x module 791
-p:=link(q);
-@y
-if align_state<500000 then
- fatal_error("(interwoven alignment preambles are not allowed)");
-@.interwoven alignment preambles...@>
-p:=link(q);
-@z
-
-376. Avoid kern removal in discretionary breaks (Marc van Leeuwen)
-@x module 815
-label done,done1,done2,done3,done4,continue;
-@y
-label done,done1,done2,done3,done4,done5,continue;
-@z
-@x module 866
-glue_node: begin @<If node |cur_p| is a legal breakpoint, call |try_break|@>;
- @<Update the active widths by including the glue in |glue_ptr(cur_p)|@>;
-@y
-glue_node: begin @<If node |cur_p| is a legal breakpoint, call |try_break|;
- then update the active widths by including the glue in |glue_ptr(cur_p)|@>;
-@z
-@x ibid
-disc_node: @<Try to break after a discretionary fragment@>;
-@y
-disc_node: @<Try to break after a discretionary fragment, then |goto done5|@>;
-@z
-@x ibid
-end
-@y
-done5:end
-@z
-Combine modules 868 and 869 into a single module, with a semicolon between.
-@x module 870 (which becomes module 869) gets ... in its title
-@y and the following new code just before its final "end":
-r:=replace_count(cur_p); s:=link(cur_p);
-while r>0 do
- begin @<Add the width of node |s| to |act_width|@>;
- decr(r); s:=link(s);
- end;
-prev_p:=cur_p; cur_p:=s; goto done5;
-@z
-@x Now module 871 becomes 870, and we add a new (very similar) module 871:
-@y
-@ @<Add the width of node |s| to |act_width|@>=
-if is_char_node(s) then
- begin f:=font(s);
- act_width:=act_width+char_width(f)(char_info(f)(character(s)));
- end
-else case type(s) of
- ligature_node: begin f:=font(lig_char(s));
- act_width:=act_width+
- char_width(f)(char_info(f)(character(lig_char(s))));
- end;
- hlist_node,vlist_node,rule_node,kern_node:
- act_width:=act_width+width(s);
- othercases confusion("disc4")
-@:this can't happen disc4}{\quad disc4@>
- endcases
-@z
-@x module 877
-@!disc_break:boolean; {was the current break at a discretionary node?}
-@y
-@!disc_break:boolean; {was the current break at a discretionary node?}
-@!post_disc_break:boolean; {and did it have a nonempty post-break part?}
-@z
-@x ibid
-if cur_p<>null then @<Prune unwanted nodes at the beginning of the next line@>;
-@y
-if cur_p<>null then if not post_disc_break then
- @<Prune unwanted nodes at the beginning of the next line@>;
-@z
-@x module 881
-q:=cur_break(cur_p); disc_break:=false;
-@y
-q:=cur_break(cur_p); disc_break:=false; post_disc_break:=false;
-@z
-@x module 883
- if not is_char_node(s) then if next_break(cur_p)<>null then
- if cur_break(next_break(cur_p))=s then s:=r;
-@y that subtle bug is no longer possible so we can remove the code
-@z
-@x module 884
-link(s):=r; r:=post_break(q); post_break(q):=null;
-@y
-link(s):=r; r:=post_break(q); post_break(q):=null; post_disc_break:=true;
-@z
-
-377. Pick up a few discretionary hyphens that were lost because of
-the new (cautious) algorithm.
-@x module 914
-@ @d advance_major_tail==begin major_tail:=link(major_tail); incr(r_count);
- end
-
-@<Create and append a discretionary node as an alternative...@>=
-begin r:=get_node(small_node_size);
-@y
-@ In this repeat loop we will insert another discretionary if |hyf[j-1]| is
-odd, after both branches of the previous discretionary end at position |j-1|.
-Strictly speaking, we aren't justified in doing this, because we don't know
-that a hyphen after |j-1| is truly independent of those branches. But in almost
-all applications we would rather not lose a potentially valuable hyphenation
-point. (Consider the word `difficult', where the letter `c' is in position |j|.)
-
-@d advance_major_tail==begin major_tail:=link(major_tail); incr(r_count);
- end
-
-@<Create and append a discretionary node as an alternative...@>=
-repeat r:=get_node(small_node_size);
-@z
-@x ibid
-i:=hyphen_passed;
-@y
-i:=hyphen_passed; hyf[i]:=0;
-@z
-@x ibid
-end
-@y
-hyphen_passed:=j-1; link(hold_head):=null;
-until not odd(hyf[j-1])
-@z
-
-378. Undumped trie must also be dumpable again (Breitenlohner, 11 Dec 89)
-@x module 1325
-undump_size(0)(trie_size)('trie size')(j); {|trie_max|}
-for k:=0 to j do undump_hh(trie[k]);
-undump_size(0)(trie_op_size)('trie op size')(j); {|trie_op_ptr|}
-@y
-undump_size(0)(trie_size)('trie size')(j); @+init trie_max:=j;@+tini
-for k:=0 to j do undump_hh(trie[k]);
-undump_size(0)(trie_op_size)('trie op size')(j); @+init trie_op_ptr:=j;@+tini
-@z
-@x ibid
-k:=256;
-while j>0 do
- begin undump(0)(k-1)(k); undump(1)(j)(x); j:=j-x; op_start[k]:=qo(j);
-@y
-init for k:=0 to 255 do trie_used[k]:=min_quarterword;@+tini
-k:=256;
-while j>0 do
- begin undump(0)(k-1)(k); undump(1)(j)(x);@+init trie_used[k]:=qi(x);@+tini
- j:=j-x; op_start[k]:=qo(j);
-@z
-
-379. Allow output routine to access page totals. (Suggested by Frank
-Mittelbach and Chris Rowley, December 1989)
-@x module 421
-begin if page_contents=empty then
-@y
-begin if (page_contents=empty) and (not output_active) then
-@z
-
-380. Slightly more robust recovery and detection of \output anomalies.
-(Suggested by Chris Thompson, provoked by George Russell, January 1990)
-@x module 1026
-begin if loc<>null then @<Recover from an unbalanced output routine@>;
-@y
-begin if (loc<>null) or
- ((token_type<>output_text)and(token_type<>backed_up)) then
- @<Recover from an unbalanced output routine@>;
-@z
-@x module 1027
-help2("Your sneaky output routine has fewer real {'s than }'s.")@/
-@y
-help2("Your sneaky output routine has problematic {'s and/or }'s.")@/
-@z
-
-381. \eqno\aftergroup*$$ should yield * after the $$ (Michael Downes, 29 Jan 90)
-@x module 1194
- begin cur_mlist:=p; cur_style:=text_style; mlist_penalties:=false;
-@y
- begin @<Check that another \.\$ follows@>;
- cur_mlist:=p; cur_style:=text_style; mlist_penalties:=false;
-@z
-@x ibid
-else begin @<Check that another \.\$ follows@>;
-@y
-else begin if a=null then @<Check that another \.\$ follows@>;
-@z
-
-382. Missed a case in the 8-bit change (Wayne Sullivan, 1 Feb 1990)
-@x module 360
- begin if (end_line_char<0)or(end_line_char>127) then incr(limit);
-@y
- begin if end_line_char_inactive then incr(limit);
-@z
-
-383. Linebreaking needs to be more robust when total demerits get
-very high (Frank Mittelbach, 22 Feb 1990)
-@x module 830
-@!artificial_badness:boolean; {has |b| been forced to zero?}
-@y
-@!artificial_demerits:boolean; {has |d| been forced to zero?}
-@z
-@x module 833 (this change is cosmetic only)
-@!minimal_demerits:array[very_loose_fit..tight_fit] of scaled; {best total
- demerits known for current line class and position, given the fitness}
-@!minimum_demerits:scaled; {best total demerits known for current line class
-@y
-@!minimal_demerits:array[very_loose_fit..tight_fit] of integer; {best total
- demerits known for current line class and position, given the fitness}
-@!minimum_demerits:integer; {best total demerits known for current line class
-@z
-@x module 836 here we want to ensure that total_demerits < awful_bad
-minimum_demerits:=minimum_demerits+abs(adj_demerits);
-@y
-if abs(adj_demerits)>=awful_bad-minimum_demerits then
- minimum_demerits:=awful_bad-1
-else minimum_demerits:=minimum_demerits+abs(adj_demerits);
-@z
-@x module 851
-begin @!stat artificial_badness:=false;@+tats@/
-@y
-begin artificial_demerits:=false;@/
-@z
-@x module 854
- begin b:=0; {set badness zero, this break is forced}
- @!stat artificial_badness:=true;@+tats
- end
-@y
- artificial_demerits:=true {set demerits zero, this break is forced}
-@z
-@x module 855
-@<Compute the demerits, |d|, from |r| to |cur_p|@>;
-@y
-if artificial_demerits then d:=0
-else @<Compute the demerits, |d|, from |r| to |cur_p|@>;
-@z
-@x module 856
-if artificial_badness then print_char("*")@+else print_int(b);
-@.*\relax@>
-print(" p="); print_int(pi);
-print(" d="); print_int(d);
-@y
-if b>inf_bad then print_char("*")@+else print_int(b);
-@.*\relax@>
-print(" p="); print_int(pi); print(" d=");
-if artificial_demerits then print_char("*")@+else print_int(d);
-@z
-@x module 859
-d:=line_penalty+b; d:=d*d;
-@y
-begin d:=line_penalty+b;
-if abs(d)>=10000 then d:=100000000@+else d:=d*d;
-@z
-@x ibid
-if abs(fit_class-fitness(r))>1 then d:=d+adj_demerits
-@y
-if abs(fit_class-fitness(r))>1 then d:=d+adj_demerits;
-end
-@z
-
-384. Math fonts may disappear outside of \eqno (Marc van Leeuwen).
-@x module 1194
- if danger then flush_math;
-@y
- danger:=false;
- @<Check that the necessary fonts for math symbols are present;
- if not, flush the current math lists and set |danger:=true|@>;
-@z
-
-385. Forgot to rule out charnode when testing for node type (Marc van Leeuwen).
-@x module 805
- begin if type(q)=unset_node then
- @<Set the unset box |q| and the unset boxes in it@>
- else if type(q)=rule_node then
- @<Make the running dimensions in rule |q| extend to the
- boundaries of the alignment@>;
-@y
- begin if not is_char_node(q) then
- if type(q)=unset_node then
- @<Set the unset box |q| and the unset boxes in it@>
- else if type(q)=rule_node then
- @<Make the running dimensions in rule |q| extend to the
- boundaries of the alignment@>;
-@z
-@x module 903
-if type(hb)=ligature_node then if odd(subtype(hb)) then
-@y
-if not is_char_node(hb) then
- if type(hb)=ligature_node then if odd(subtype(hb)) then
-@z
-@x module 1202
- if p<>null then if type(p)=glue_node then d:=0;
-@y
- if p<>null then if not is_char_node(p) then if type(p)=glue_node then d:=0;
-@z
-
-386. Don't change the font of punctuation before a hyphenated word
- (Scott Allendorf, reported 7 Mar 90)
-@x module 895
-label common_ending,done,found,found1,not_found,not_found+1,exit;
-@y
-label common_ending,done,found,found1,found2,not_found,exit;
-@z
-@x module 903
-if is_char_node(ha) then
- begin init_list:=ha; init_lig:=false; hu[0]:=qo(character(ha));
- end
-else if type(ha)=ligature_node then
- begin init_list:=lig_ptr(ha); init_lig:=true; init_lft:=(subtype(ha)>1);
- hu[0]:=qo(character(lig_char(ha)));
- if init_list=null then if init_lft then
- begin hu[0]:=256; init_lig:=false;
- end; {in this case a ligature will be reconstructed from scratch}
- free_node(ha,small_node_size);
- end
-else goto not_found+1; {no punctuation found}
-s:=cur_p; {we have |cur_p<>ha| because |type(cur_p)=glue_node|}
-while link(s)<>ha do s:=link(s);
-j:=0; goto common_ending;
-not_found+1: j:=1; s:=ha; init_list:=null;
-if not is_char_node(r) then if type(r)=ligature_node then
- if subtype(r)>1 then
- begin j:=0; hu[0]:=256; init_lig:=false;
- end;
-@y
-if is_char_node(ha) then
- if font(ha)<>hf then goto found2
- else begin init_list:=ha; init_lig:=false; hu[0]:=qo(character(ha));
- end
-else if type(ha)=ligature_node then
- if font(lig_char(ha))<>hf then goto found2
- else begin init_list:=lig_ptr(ha); init_lig:=true; init_lft:=(subtype(ha)>1);
- hu[0]:=qo(character(lig_char(ha)));
- if init_list=null then if init_lft then
- begin hu[0]:=256; init_lig:=false;
- end; {in this case a ligature will be reconstructed from scratch}
- free_node(ha,small_node_size);
- end
-else begin {no punctuation found; look for left boundary}
- if not is_char_node(r) then if type(r)=ligature_node then
- if subtype(r)>1 then goto found2;
- j:=1; s:=ha; init_list:=null; goto common_ending;
- end;
-s:=cur_p; {we have |cur_p<>ha| because |type(cur_p)=glue_node|}
-while link(s)<>ha do s:=link(s);
-j:=0; goto common_ending;
-found2: s:=ha; j:=0; hu[0]:=256; init_lig:=false; init_list:=null;
-@z
-
-387. Balance the parens showing on the terminal (for Lispers).
-@x module 304
-@!in_open : 0..max_in_open; {the number of lines in the buffer, less one}
-@y
-@!in_open : 0..max_in_open; {the number of lines in the buffer, less one}
-@!open_parens : 0..max_in_open; {the number of open text files}
-@z
-@x module 331
-in_open:=0; max_buf_stack:=0;
-@y
-in_open:=0; open_parens:=0; max_buf_stack:=0;
-@z
-@x module 362
- begin print_char(")"); force_eof:=false;
- update_terminal; {show user that file has been read}
-@y
- begin print_char(")"); decr(open_parens);
- update_terminal; {show user that file has been read}
- force_eof:=false;
-@z
-@x module 537
-print_char("("); print(name); update_terminal; state:=new_line;
-@y
-print_char("("); incr(open_parens); print(name); update_terminal;
-state:=new_line;
-@z
-@x module 1334
-if job_name=0 then open_log_file;
-@y
-if job_name=0 then open_log_file;
-while open_parens>0 do
- begin print(" )"); decr(open_parens);
- end;
-@z
-
-388. Optimize \ifx\p\q after \let\p=\q (Marc van Leeuwen says that
- AmS-TeX uses this a lot).
-@x module 508
- while (p<>null)and(q<>null) do
- if info(p)<>info(q) then p:=null
- else begin p:=link(p); q:=link(q);
- end;
-b:=((p=null)and(q=null));
-@y
-if p=q then b:=true
-else begin while (p<>null)and(q<>null) do
- if info(p)<>info(q) then p:=null
- else begin p:=link(p); q:=link(q);
- end;
- b:=((p=null)and(q=null));
- end;
-@z
-@x module 538 (while we're at it, might as well optimize this too)
-begin if not input_ln(cur_file,false) then do_nothing;
-@y
-begin if input_ln(cur_file,false) then do_nothing;
-@z
-@x module 1020 (and this)
-else begin wait:=false; s:=ins_ptr(p);
- link(last_ins_ptr(r)):=s; s:=last_ins_ptr(r);
-@y
-else begin wait:=false; s:=last_ins_ptr(r); link(s):=ins_ptr(p);
-@z
-
-389. Treat migration properly in displays (Marc van Leeuwen).
-@x module 1199 (a bad bug that really has bitten)
-adjust_tail:=adjust_head; b:=hpack(p,natural);
-@y
-adjust_tail:=adjust_head; b:=hpack(p,natural); p:=list_ptr(b);
-@z
-@x module 1204
-shift_amount(b):=s+d; append_to_vlist(b);
-if t<>adjust_head then
- begin link(tail):=link(adjust_head); tail:=t;
- end
-@y
-shift_amount(b):=s+d; append_to_vlist(b)
-@z
-@x module 1205
- tail_append(new_penalty(post_display_penalty));
- end
-else begin tail_append(new_penalty(post_display_penalty));
- tail_append(new_param_glue(g2));
- end
-@y
- g2:=0;
- end;
-if t<>adjust_head then {migrating material comes after equation number}
- begin link(tail):=link(adjust_head); tail:=t;
- end;
-tail_append(new_penalty(post_display_penalty));
-if g2>0 then tail_append(new_param_glue(g2))
-@z
-
------------Here I draw the line with respect to further changes
-
-390. Uninitialized nullfont parameters (found by Lance Carnes, 11 May 90).
-@x module 552
-hyphen_char[null_font]:="-"; skew_char[null_font]:=-1;
-@y
-hyphen_char[null_font]:="-"; skew_char[null_font]:=-1;
-bchar_label[null_font]:=non_address;
-font_bchar[null_font]:=non_char; font_false_bchar[null_font]:=non_char;
-@z
-
-391. Disable \write{\the\prevgraf} (B. Jackowski, July 1990).
-@x module 422
-begin nest[nest_ptr]:=cur_list; p:=nest_ptr;
-while abs(nest[p].mode_field)<>vmode do decr(p);
-scanned_result(nest[p].pg_field)(int_val);
-end
-@y
-if mode=0 then scanned_result(0)(int_val) {|prev_graf=0| within \.{\\write}}
-else begin nest[nest_ptr]:=cur_list; p:=nest_ptr;
- while abs(nest[p].mode_field)<>vmode do decr(p);
- scanned_result(nest[p].pg_field)(int_val);
- end
-@z
-
-392. Report correct line number when buffer overflows (George Russell).
-@x module 538
-begin if input_ln(cur_file,false) then do_nothing;
-firm_up_the_line;
-if end_line_char_inactive then decr(limit)
-else buffer[limit]:=end_line_char;
-first:=limit+1; loc:=start; line:=1;
-@y
-begin line:=1;
-if input_ln(cur_file,false) then do_nothing;
-firm_up_the_line;
-if end_line_char_inactive then decr(limit)
-else buffer[limit]:=end_line_char;
-first:=limit+1; loc:=start;
-@z
-
--------------
-Note: When making change 376, I forgot to delete the redundant
-code in module 883, and I should also have changed the name of that
-module. These cosmetic changes (and some changes to the comments)
-were made in version 3.14, in addition to the following two changes.
--------------
-
-393. Show unprintable characters in font id's (Wayne Sullivan, Dec 1990)
-@x module 63
-print(s);
-@y
-slow_print(s);
-@z
-@x module 262 can now be spruced up
-else begin print_esc(""); slow_print(text(p));
-@y
-else begin print_esc(text(p));
-@z
-@x and module 263 likewise
-else begin print_esc(""); slow_print(text(p));
- end;
-@y
-else print_esc(text(p));
-@z
-
-394. Avoid range check if total_pages>65535 (Eberhard Mattes, Dec 1990)
-@x module 642
- dvi_out(total_pages div 256); dvi_out(total_pages mod 256);@/
-@y
- dvi_out((total_pages div 256) mod 256); dvi_out(total_pages mod 256);@/
-@z
-
-395. Less confusing error message (18 Sep 91)
-@x module 436
- begin print_err("Bad math code");
-@.Bad math code@>
- help2("A numeric math code must be between 0 and 32767.")@/
-@y (because a \mathcode can be 32768, but not a \mathchar)
- begin print_err("Bad mathchar");
-@.Bad mathchar@>
- help2("A mathchar number must be between 0 and 32767.")@/
-@z
-
-396. Internal strings should not be expanded even if unprintable;
-i.e., selector=new_string => print(c)==print_char(c), print(s)==slow_print(s).
-This change completes what I began with number 393 (18 Sep 91).
-@x modules 59 and 60 (same change to both)
- else if (@<Character |s| is the current new-line character@>) then
- if selector<pseudo then
- begin print_ln; return;
- end;
-@y
- else if selector>pseudo then
- begin print_char(s); return; {internal strings are not expanded}
- end
- else if (@<Character |s| is the current new-line character@>) then
- if selector<pseudo then
- begin print_ln; return;
- end;
-@z
-@x module 61
-else begin print(format_ident); print_ln;
-@y
-else begin slow_print(format_ident); print_ln;
-@z
-@x module 84
- print(input_stack[base_ptr].name_field);
-@y
- slow_print(input_stack[base_ptr].name_field);
-@z
-@x module 518
-begin print(a); print(n); print(e);
-@y
-begin slow_print(a); slow_print(n); slow_print(e);
-@z
-@x module 536
-print(format_ident); print(" ");
-@y
-slow_print(format_ident); print(" ");
-@z
-@x module 537
-print_char("("); incr(open_parens); print(name); update_terminal;
-@y
-print_char("("); incr(open_parens); slow_print(name); update_terminal;
-@z
-@x module 581
- print(font_name[f]); print_char("!"); end_diagnostic(false);
-@y
- slow_print(font_name[f]); print_char("!"); end_diagnostic(false);
-@z
-@x module 642
- print_nl("Output written on "); print(output_file_name);
-@y
- print_nl("Output written on "); slow_print(output_file_name);
-@z
-@x module 1261
-set_font:begin print("select font "); print(font_name[chr_code]);
-@y
-set_font:begin print("select font "); slow_print(font_name[chr_code]);
-@z
-@x module 1280
-print(s); update_terminal;
-@y
-slow_print(s); update_terminal;
-@z
-@x module 1283
-begin print_err(s);
-@y
-begin print_err(""); slow_print(s);
-@z
-@x module 1328
-print(w_make_name_string(fmt_file)); flush_string;
-print_nl(format_ident)
-@y
-slow_print(w_make_name_string(fmt_file)); flush_string;
-print_nl(""); slow_print(format_ident)
-@z
-@x module 1333
- print(log_name); print_char(".");
-@y
- slow_print(log_name); print_char(".");
-@z
-@x module 1339
-10: print(n);
-@y
-10: slow_print(n);
-@z
-
-397. Retain more right context for reconstructing ligatures (19 Sep 91)
-@x module 892
-@!l_hyf,@!r_hyf:integer; {limits on fragment sizes}
-@y
-@!l_hyf,@!r_hyf:integer; {limits on fragment sizes}
-@!hyf_bchar:halfword; {boundary character after $c_n$}
-@z
-@x module 897
- c:=qo(character(s));
-@y
- hyf_bchar:=character(s); c:=qo(hyf_bchar);
-@z
-@x module 897 again
- s:=link(s);
-@y
- s:=link(s); hyf_bchar:=non_char;
-@z
-@x module 898
-j:=hn; q:=lig_ptr(s);
-@y
-j:=hn; q:=lig_ptr(s);@+if q>null then hyf_bchar:=character(q);
-@z
-@x module 903
-q:=link(hb); link(hb):=null; r:=link(ha); link(ha):=null; bchar:=non_char;
-@y
-q:=link(hb); link(hb):=null; r:=link(ha); link(ha):=null; bchar:=hyf_bchar;
-@z
-
-398. Patch the previous code, which could cause double kerning (CET1, 29 Sep 91)
-@x module 897
- hb:=s; incr(hn); hu[hn]:=c; hc[hn]:=lc_code(c);
- end
- else if type(s)=ligature_node then
- @<Move the characters of a ligature node to |hu| and |hc|;
- but |goto done3| if they are not all letters@>
- else if (type(s)<>kern_node)or(subtype(s)<>normal) then goto done3;
- s:=link(s); hyf_bchar:=non_char;
-@y
- hb:=s; incr(hn); hu[hn]:=c; hc[hn]:=lc_code(c); hyf_bchar:=non_char;
- end
- else if type(s)=ligature_node then
- @<Move the characters of a ligature node to |hu| and |hc|;
- but |goto done3| if they are not all letters@>
- else if (type(s)=kern_node)and(subtype(s)=normal) then hb:=s
- else goto done3;
- s:=link(s);
-@z
-@x module 898
-hb:=s; hn:=j;
-@y
-hb:=s; hn:=j;
-if odd(subtype(s)) then hyf_bchar:=font_bchar[hf]@+else hyf_bchar:=non_char;
-@z
-@x module 903
-if not is_char_node(hb) then
- if type(hb)=ligature_node then if odd(subtype(hb)) then
- bchar:=font_bchar[hf];
-@y
-@z
-
-399. Disallow \setbox in do_assignments (problem found by Robert Hunt, Nov 91)
-@x module 76
-@!deletions_allowed:boolean; {is it safe for |error| to call |get_token|?}
-@y
-@!deletions_allowed:boolean; {is it safe for |error| to call |get_token|?}
-@!set_box_allowed:boolean; {is it safe to do a \.{\\setbox} assignment?}
-@z
-@x module 77
-deletions_allowed:=true; error_count:=0; {|history| is initialized elsewhere}
-@y
-deletions_allowed:=true; set_box_allowed:=true;
-error_count:=0; {|history| is initialized elsewhere}
-@z
-@x module 1241
- scan_optional_equals; scan_box(box_flag+n);
-@y
- if set_box_allowed then scan_box(box_flag+n)
- else begin print_err("Improper "); print_esc("setbox");
-@.Improper \\setbox@>
- help2("Sorry, \setbox is not allowed after \halign in a display,")@/
- ("or between \accent and an accented character."); error;
- end;
-@z
-@x module 1270
- prefixed_command;
-@y
- set_box_allowed:=false; prefixed_command; set_box_allowed:=true;
-@z
-
-400. Defend against negative cur_mu (Wayne Sullivan, Nov 91)
-@x module 716
-begin n:=x_over_n(m,@'200000); f:=remainder;@/
-@y
-begin n:=x_over_n(m,@'200000); f:=remainder;@/
-if f<0 then
- begin decr(n); f:=f+@'200000;
- end;
-@z
-@x module 717
- begin n:=x_over_n(m,@'200000); f:=remainder;@/
-@y
- begin n:=x_over_n(m,@'200000); f:=remainder;@/
- if f<0 then
- begin decr(n); f:=f+@'200000;
- end;
-@z
-
-401. Defend against `|}{|' in |\read| (Michael Downes).
-@x module 483
- store_new_token(cur_tok);
-@y
- if align_state<1000000 then {unmatched `\.\}' aborts the line}
- begin repeat get_token; until cur_tok=0;
- align_state:=1000000; goto done;
- end;
- store_new_token(cur_tok);
-@z
-
-402. Economize string storage under multiple \font defs (B. Jackowski)
-@x module 1257
-@!old_setting:0..max_selector; {holds |selector| setting}
-@y
-@!old_setting:0..max_selector; {holds |selector| setting}
-@!flushable_string:str_number; {string not yet referenced}
-@z
-@x module 1260
-for f:=font_base+1 to font_ptr do
- if str_eq_str(font_name[f],cur_name)and str_eq_str(font_area[f],cur_area) then
- begin if s>0 then
-@y
-flushable_string:=str_ptr-1;
-for f:=font_base+1 to font_ptr do
- if str_eq_str(font_name[f],cur_name)and str_eq_str(font_area[f],cur_area) then
- begin if cur_name=flushable_string then
- begin flush_string; cur_name:=font_name[f];
- end;
- if s>0 then
-@z
-
-403. Don't look for \newlinechar within unprintable chars (B. Raichle, Nov 91)
-@x module 59
-var j:pool_pointer; {current character code position}
-@y
-var j:pool_pointer; {current character code position}
-@!nl:integer; {new-line character to restore}
-@z
-@x
- else if selector>pseudo then
- begin print_char(s); return; {internal strings are not expanded}
- end
- else if (@<Character |s| is the current new-line character@>) then
- if selector<pseudo then
- begin print_ln; return;
- end;
-@y
- else begin if selector>pseudo then
- begin print_char(s); return; {internal strings are not expanded}
- end;
- if (@<Character |s| is the current new-line character@>) then
- if selector<pseudo then
- begin print_ln; return;
- end;
- nl:=new_line_char; new_line_char:=-1;
- {temporarily disable new-line character}
- j:=str_start[s];
- while j<str_start[s+1] do
- begin print_char(so(str_pool[j])); incr(j);
- end;
- new_line_char:=nl; return;
- end;
-@z
-@x module 60
-label exit;
-var j:pool_pointer; {current character code position}
-begin if s>=str_ptr then s:="???" {this can't happen}
-@.???@>
-else if s<256 then
- if s<0 then s:="???" {can't happen}
- else if selector>pseudo then
- begin print_char(s); return; {internal strings are not expanded}
- end
- else if (@<Character |s| is the current new-line character@>) then
- if selector<pseudo then
- begin print_ln; return;
- end;
-j:=str_start[s];
-while j<str_start[s+1] do
- begin print(so(str_pool[j])); incr(j);
- end;
-exit:end;
-label exit;
-var j:pool_pointer; {current character code position}
-begin if s>=str_ptr then s:="???" {this can't happen}
-@.???@>
-else if s<256 then
- if s<0 then s:="???" {can't happen}
- else if selector>pseudo then
- begin print_char(s); return; {internal strings are not expanded}
- end
- else if (@<Character |s| is the current new-line character@>) then
- if selector<pseudo then
- begin print_ln; return;
- end;
-j:=str_start[s];
-while j<str_start[s+1] do
- begin print(so(str_pool[j])); incr(j);
- end;
-exit:end;
-@y
-var j:pool_pointer; {current character code position}
-begin if (s>=str_ptr) or (s<256) then print(s)
-else begin j:=str_start[s];
- while j<str_start[s+1] do
- begin print(so(str_pool[j])); incr(j);
- end;
- end;
-end;
-@z
-
-404. False boundary character logic was incorrect (found by Eberhard
- Mattes and Bernd Raichle, 6 Feb 92)
-@x module 1036
-cur_q:=tail; cur_l:=cur_r; {or |character(lig_stack)|}
-@y the following is needed since cur_r might have been changed to non_char
-cur_q:=tail; cur_l:=character(lig_stack);
-@z
-
-405. New paragraph and resume-after-display should continue current
- \language (Sch\"opf and Thompson, 17 July 92)
-@@@ Undo the changes to modules 212, 213, 215 in change number 373.
-@x module 218
- if m=hmode then@+if(nest[p].lhm_field<>2)or(nest[p].rhm_field<>3)then
- begin print(" (hyphenmin "); print_int(nest[p].lhm_field); print_char(",");
- print_int(nest[p].rhm_field); print_char(")");
- end;
-@y
- if m=hmode then if (nest[p].pg_field <> @'40600000) then
- begin print(" (language"); print_int(nest[p].pg_field mod @'200000);
- print(":hyphenmin"); print_int(nest[p].pg_field div @'20000000);
- print_char(","); print_int((nest[p].pg_field div @'200000) mod @'100);
- print_char(")");
- end;
-@z
-@x module 816
-pop_nest;
-@y prev_graf now carries the language parameters at start of horizontal mode
-init_cur_lang:=prev_graf mod @'200000;
-init_l_hyf:=prev_graf div @'20000000;
-init_r_hyf:=(prev_graf div @'200000) mod @'100;
-pop_nest;
-@z
-@x module 891
-l_hyf:=lhmin; r_hyf:=rhmin; cur_lang:=0;
-@y
-cur_lang:=init_cur_lang; l_hyf:=init_l_hyf; r_hyf:=init_r_hyf;
-@z
-@x module 892
-@!cur_lang:ASCII_code; {current hyphenation table of interest}
-@!l_hyf,@!r_hyf:integer; {limits on fragment sizes}
-@y
-@!cur_lang,@!init_cur_lang:ASCII_code; {current hyphenation table of interest}
-@!l_hyf,@!r_hyf,@!init_l_hyf,@!init_r_hyf:integer; {limits on fragment sizes}
-@z
-@x module 1091
-lhmin:=norm_min(left_hyphen_min); rhmin:=norm_min(right_hyphen_min);
-push_nest; mode:=hmode; space_factor:=1000; clang:=0;@/
-@y
-push_nest; mode:=hmode; space_factor:=1000; set_cur_lang; clang:=cur_lang;
-prev_graf:=(norm_min(left_hyphen_min)*@'100+norm_min(right_hyphen_min))
- *@'200000+cur_lang;
-@z
-@x module 1200
-push_nest; mode:=hmode; space_factor:=1000; clang:=0;
-@y
-push_nest; mode:=hmode; space_factor:=1000; set_cur_lang; clang:=cur_lang;
-prev_graf:=(norm_min(left_hyphen_min)*@'100+norm_min(right_hyphen_min))
- *@'200000+cur_lang;
-@z
-
-406. Avoid (harmless) range errors (Philip Taylor and CET1, 17 Dec 92).
-@x module 934
-var n:small_number; {length of current word}
-@!j:small_number; {an index into |hc|}
-@y
-var n:0..64; {length of current word; not always a |small_number|}
-@!j:0..64; {an index into |hc|}
-@z
-@x module 960
-var k,@!l:small_number; {indices into |hc| and |hyf|}
-@y
-var k,@!l:0..64; {indices into |hc| and |hyf|;
- not always in |small_number| range}
-@z
-
-407. Kerns inserted via boundary chars should not disappear (William E. Baxter,
- 25 Feb 93)
-@x module 837
-Kern nodes for accents are treated specially: They do not
-disappear at a line break.
-@y
-Kern nodes do not disappear at a line break unless they are |explicit|.
-@z
-@x ibid
- math_node,kern_node: if subtype(s)=acc_kern then goto done
- else break_width[1]:=break_width[1]-width(s);
-@y
- math_node: break_width[1]:=break_width[1]-width(s);
- kern_node: if subtype(s)<>explicit then goto done
- else break_width[1]:=break_width[1]-width(s);
-@z
-@x module 839
-plus $l_1$, so the length from |cur_p| to |cur_p| should be $\gamma+l_0+l_1-l$,
-minus the length of nodes that will be discarded after the discretionary break.
-@y (this change and the next two should have been made long ago, with #376!)
-plus $l_1$, so the length from |cur_p| to |cur_p| should be $\gamma+l_0+l_1-l$.
-If the post-break text of the discretionary is empty, a break may also
-discard~|q|; in that unusual case we subtract the length of~|q| and any
-other nodes that will be discarded after the discretionary break.
-@z
-@x module 840
- begin @<Add the width of node |s| to |break_width| and increase |t|,
- unless it's discardable@>;
- s:=link(s);
- end;
-break_width[1]:=break_width[1]+disc_width;
-if t=0 then s:=link(v); {more nodes may also be discardable after the break}
-@y
- begin @<Add the width of node |s| to |break_width|@>;
- s:=link(s);
- end;
-break_width[1]:=break_width[1]+disc_width;
-if post_break(cur_p)=null then s:=link(v);
- {nodes may be discardable after the break}
-@z
-@x module 842 (which now has a new title)
- hlist_node,vlist_node,rule_node:break_width[1]:=break_width[1]+width(s);
- kern_node: if (t=0)and(subtype(s)<>acc_kern) then t:=-1 {discardable}
- othercases confusion("disc2")
-@:this can't happen disc2}{\quad disc2@>
- endcases;
-incr(t)
-@y
- hlist_node,vlist_node,rule_node,kern_node:
- break_width[1]:=break_width[1]+width(s);
- othercases confusion("disc2")
-@:this can't happen disc2}{\quad disc2@>
- endcases
-@z
-@x module 866
-kern_node: kern_break;
-@y
-kern_node: if subtype(cur_p)=explicit then kern_break
- else act_width:=act_width+width(cur_p);
-@z
-@x module 868
- else if precedes_break(prev_p) then try_break(0,unhyphenated);
-@y
- else if precedes_break(prev_p) then try_break(0,unhyphenated)
- else if (type(prev_p)=kern_node)and(subtype(prev_p)<>explicit) then
- try_break(0,unhyphenated);
-@z
-@x module 879
- if subtype(q)=acc_kern then if type(q)=kern_node then goto done1;
-@y
- if type(q)=kern_node then if subtype(q)<>explicit then goto done1;
-@z
-
-408. Prevent boundary kern from disappearing after hyphenation (25 Feb 93)
-@x module 897
- else if (type(s)=kern_node)and(subtype(s)=normal) then hb:=s
-@y
- else if (type(s)=kern_node)and(subtype(s)=normal) then
- begin hb:=s;
- hyf_bchar:=font_bchar[hf];
- end
-@z
-
-409. Avoid potential future bug [P Breitenlohner] (26 Jun 93)
-@x module 628 [shift_amount(leader_box)=0 now but maybe not in extensions]
-dvi_v:=save_v; dvi_h:=save_h; cur_v:=save_v;
-@y
-dvi_v:=save_v; dvi_h:=save_h; cur_v:=base_line;
-@z
-@x module 637
-dvi_v:=save_v; dvi_h:=save_h; cur_h:=save_h;
-@y
-dvi_v:=save_v; dvi_h:=save_h; cur_h:=left_edge;
-@z
-
-410. Mustn't let |non-address| depend on |font_mem_size|
-@x module 549
-@d non_address==font_mem_size {a spurious |font_index|}
-@y
-@d non_address=0 {a spurious |bchar_label|}
-@z
-@x module 916
-if bchar_label[hf]<non_address then {put left boundary at beginning of new line}
-@y
-if bchar_label[hf]<>non_address then {put left boundary at beginning of new line}
-@z
-@x module 1323, this will detect obsolete format files
-undump(0)(font_mem_size)(bchar_label[k]);
-@y
-undump(0)(fmem_ptr-1)(bchar_label[k]);
-@z
-
-411. Allow large |font_mem_size|, many font parameters.
-@x module 549
-@!font_params:array[internal_font_number] of halfword; {how many font
-@y
-@!font_params:array[internal_font_number] of font_index; {how many font
-@z
-
-412. Math kerns are explicit; this matters, after change 405 (W Carlip, Sep 94)
-@x module 717
- width(p):=mu_mult(width(p)); subtype(p):=normal;
-@y
- width(p):=mu_mult(width(p)); subtype(p):=explicit;
-@z
-
-413. Avoid overflow on real-to-integer conversion
-@x module 619
-@!edge:scaled; {left edge of sub-box, or right edge of leader space}
-@y
-@!edge:scaled; {left edge of sub-box, or right edge of leader space}
-@!glue_temp:real; {glue value before rounding}
-@z
-@x module 625
-@ @<Move right or output leaders@>=
-begin g:=glue_ptr(p); rule_wd:=width(g);
-if g_sign<>normal then
- begin if g_sign=stretching then
- begin if stretch_order(g)=g_order then
- rule_wd:=rule_wd+round(float(glue_set(this_box))*stretch(g));
-@^real multiplication@>
- end
- else begin if shrink_order(g)=g_order then
- rule_wd:=rule_wd-round(float(glue_set(this_box))*shrink(g));
-@y
-@ @d vet_glue(#)== glue_temp:=#;
- if glue_temp>float_constant(1000000000) then
- glue_temp:=float_constant(1000000000)
- else if glue_temp<-float_constant(1000000000) then
- glue_temp:=-float_constant(1000000000)
-
-@<Move right or output leaders@>=
-begin g:=glue_ptr(p); rule_wd:=width(g);
-if g_sign<>normal then
- begin if g_sign=stretching then
- begin if stretch_order(g)=g_order then
- begin vet_glue(float(glue_set(this_box))*stretch(g));
-@^real multiplication@>
- rule_wd:=rule_wd+round(glue_temp);
- end;
- end
- else if shrink_order(g)=g_order then
- begin vet_glue(float(glue_set(this_box))*shrink(g));
- rule_wd:=rule_wd-round(glue_temp);
-@z
-@x module 629
-@!edge:scaled; {bottom boundary of leader space}
-@y
-@!edge:scaled; {bottom boundary of leader space}
-@!glue_temp:real; {glue value before rounding}
-@z
-@x module 634
- rule_ht:=rule_ht+round(float(glue_set(this_box))*stretch(g));
-@^real multiplication@>
- end
- else begin if shrink_order(g)=g_order then
- rule_ht:=rule_ht-round(float(glue_set(this_box))*shrink(g));
-@y
- begin vet_glue(float(glue_set(this_box))*stretch(g));
-@^real multiplication@>
- rule_ht:=rule_ht+round(glue_temp);
- end;
- end
- else if shrink_order(g)=g_order then
- begin vet_glue(float(glue_set(this_box))*shrink(g));
- rule_ht:=rule_ht-round(glue_temp);
-@z
-
-414. final cleanup should not retain spurious reference counts (20 Mar 95)
-@x module 1335
-while open_parens>0 do
-@y
-while input_ptr>0 do
- if state=token_list then end_token_list@+else end_file_reading;
-while open_parens>0 do
-@z
-@x module 1335, continued
- cur_if:=subtype(cond_ptr); cond_ptr:=link(cond_ptr);
-@y
- cur_if:=subtype(cond_ptr); temp_ptr:=cond_ptr;
- cond_ptr:=link(cond_ptr); free_node(temp_ptr,if_node_size);
-@z
-@x module 1335, concluded
- begin @!init store_fmt_file; return;@+tini@/
-@y
- begin @!init for c:=top_mark_code to split_bot_mark_code do
- if cur_mark[c]<>null then delete_token_ref(cur_mark[c]);
- store_fmt_file; return;@+tini@/
-@z
-
-415. we need not raise hassles about two-digit years (23 Nov 98)
-@x module 1328
-print_int(year mod 100); print_char(".");
-@y
-print_int(year); print_char(".");
-@z
-
-416. \xleaders often drops the final box (Hiroshi Nakashima, 12 July 99)
-@x modules 627 and 636
- else begin lx:=(2*lr+lq+1) div (2*lq+2); {round|(lr/(lq+1))|}
-@y
- else begin lx:=lr div (lq+1);
-@z
-
-417. disallow 100000 unbalanced }s outside of alignment (Ralf Roth, 30 Aug 01)
-@x module 789
-to another alignment is being scanned.
-
-@<Insert the \(v)\<v_j>...@>=
-begin if scanner_status=aligning then
-@y
-to another alignment is being scanned, or when no alignment preamble is active.
-
-@<Insert the \(v)\<v_j>...@>=
-begin if (scanner_status=aligning) or (cur_align=null) then
-@z
-
-418. don't allow end-template except at end of template (Roth, 30 Aug 01)
-@x module 325
-while (state=token_list)and(loc=null) do end_token_list; {conserve stack space}
-@y
-while (state=token_list)and(loc=null)and(token_type<>v_template) do
- end_token_list; {conserve stack space}
-@z
-@x module 390
-while (state=token_list)and(loc=null) do end_token_list; {conserve stack space}
-@y
-while (state=token_list)and(loc=null)and(token_type<>v_template) do
- end_token_list; {conserve stack space}
-@z
-@x module 1131
-during an entire alignment, until |fin_align| removes it.
-
-@<Declare act...@>=
-procedure do_endv;
-begin if cur_group=align_group then
-@y
-during an entire alignment, until |fin_align| removes it.
-
-A devious user might force an |endv| command to occur just about anywhere;
-we must defeat such hacks.
-
-@<Declare act...@>=
-procedure do_endv;
-begin base_ptr:=input_ptr; input_stack[base_ptr]:=cur_input;
-while (input_stack[base_ptr].index_field<>v_template) and
- (input_stack[base_ptr].loc_field=null) and
- (input_stack[base_ptr].state_field=token_list) do decr(base_ptr);
-if (input_stack[base_ptr].index_field<>v_template) or
- (input_stack[base_ptr].loc_field<>null) or
- (input_stack[base_ptr].state_field<>token_list) then
- fatal_error("(interwoven alignment preambles are not allowed)");
-@.interwoven alignment preambles...@>
- if cur_group=align_group then
-@z
-
-419. Improve rounding of glue during output.
-@x module 3
-@!@^dirty \PASCAL@>
-@y
-@!@^dirty \PASCAL@>
-
-Incidentally, \PASCAL's standard |round| function can be problematical,
-because it disagrees with the IEEE floating-point standard.
-Many implementors have
-therefore chosen to substitute their own home-grown rounding procedure.
-@z
-@x module 619
-begin this_box:=temp_ptr; g_order:=glue_order(this_box);
-@y
-@!cur_glue:real; {glue seen so far}
-@!cur_g:scaled; {rounded equivalent of |cur_glue| times the glue ratio}
-begin cur_g:=0; cur_glue:=float_constant(0);
-this_box:=temp_ptr; g_order:=glue_order(this_box);
-@z
-@x module 625
-begin g:=glue_ptr(p); rule_wd:=width(g);
-if g_sign<>normal then
- begin if g_sign=stretching then
- begin if stretch_order(g)=g_order then
- begin vet_glue(float(glue_set(this_box))*stretch(g));
-@^real multiplication@>
- rule_wd:=rule_wd+round(glue_temp);
- end;
- end
- else if shrink_order(g)=g_order then
- begin vet_glue(float(glue_set(this_box))*shrink(g));
- rule_wd:=rule_wd-round(glue_temp);
- end;
- end;
-@y
-begin g:=glue_ptr(p); rule_wd:=width(g)-cur_g;
-if g_sign<>normal then
- begin if g_sign=stretching then
- begin if stretch_order(g)=g_order then
- begin cur_glue:=cur_glue+stretch(g);
- vet_glue(float(glue_set(this_box))*cur_glue);
-@^real multiplication@>
- cur_g:=round(glue_temp);
- end;
- end
- else if shrink_order(g)=g_order then
- begin cur_glue:=cur_glue-shrink(g);
- vet_glue(float(glue_set(this_box))*cur_glue);
- cur_g:=round(glue_temp);
- end;
- end;
-rule_wd:=rule_wd+cur_g;
-@z
-@x module 629
-begin this_box:=temp_ptr; g_order:=glue_order(this_box);
-@y
-@!cur_glue:real; {glue seen so far}
-@!cur_g:scaled; {rounded equivalent of |cur_glue| times the glue ratio}
-begin cur_g:=0; cur_glue:=float_constant(0);
-this_box:=temp_ptr; g_order:=glue_order(this_box);
-@z
-@x module 634
-begin g:=glue_ptr(p); rule_ht:=width(g);
-if g_sign<>normal then
- begin if g_sign=stretching then
- begin if stretch_order(g)=g_order then
- begin vet_glue(float(glue_set(this_box))*stretch(g));
-@^real multiplication@>
- rule_ht:=rule_ht+round(glue_temp);
- end;
- end
- else if shrink_order(g)=g_order then
- begin vet_glue(float(glue_set(this_box))*shrink(g));
- rule_ht:=rule_ht-round(glue_temp);
- end;
- end;
-@y
-begin g:=glue_ptr(p); rule_ht:=width(g)-cur_g;
-if g_sign<>normal then
- begin if g_sign=stretching then
- begin if stretch_order(g)=g_order then
- begin cur_glue:=cur_glue+stretch(g);
- vet_glue(float(glue_set(this_box))*cur_glue);
-@^real multiplication@>
- cur_g:=round(glue_temp);
- end;
- end
- else if shrink_order(g)=g_order then
- begin cur_glue:=cur_glue-shrink(g);
- vet_glue(float(glue_set(this_box))*cur_glue);
- cur_g:=round(glue_temp);
- end;
- end;
-rule_ht:=rule_ht+cur_g;
-@z
-
-420. Error recovery hindered by missing goto statement (reported by
-David Fuchs, September 2007)
-
-@x module 395
-incr(align_state); long_state:=call; cur_tok:=par_token; ins_error;
-@y
-incr(align_state); long_state:=call; cur_tok:=par_token; ins_error;
-goto continue;
-@z
-
-421. Slight improvement to inner loop speed also eliminates a case
-of "dirty Pascal"
-
-@x module 1035
- begin if character(tail)=qi(hyphen_char[main_f]) then if link(cur_q)>null then
-@y
- begin if link(cur_q)>null then
- if character(tail)=qi(hyphen_char[main_f]) then ins_disc:=true;
-@z
-
-422. Amendment to bugfix 414 (reported by David Fuchs, September 2007)
-
-@x module 1335
- store_fmt_file; return;@+tini@/
-@y
- if last_glue<>max_halfword then delete_glue_ref(last_glue);
- store_fmt_file; return;@+tini@/
-@z
-
-423. Remove leaking glue reference after error (DRF, September 2007)
-
-@x module 1236
- help2("I can't carry out that multiplication or division,")@/
- ("since the result is out of range.");
-@y
- help2("I can't carry out that multiplication or division,")@/
- ("since the result is out of range.");
- if p>=glue_val then delete_glue_ref(cur_val);
-@z
-
-424. Leaders with muglue is henceforth disallowed (indeed, David Fuchs
-observed that it has never worked, except in 180pt fonts!)
-
-@x module 1078
-if ((cur_cmd=hskip)and(abs(mode)<>vmode))or@|
- ((cur_cmd=vskip)and(abs(mode)=vmode))or@|
- ((cur_cmd=mskip)and(abs(mode)=mmode)) then
-@y
-if ((cur_cmd=hskip)and(abs(mode)<>vmode))or@|
- ((cur_cmd=vskip)and(abs(mode)=vmode)) then
-@z
-
-425. An optimization suggested by Fuchs that I couldn't resist, because
-it improves the inner loop whenever the last letter of a word
-has a lig/kern program. Also another twiddle for the inner loop.
-
-@x module 1039
-if char_tag(main_i)<>lig_tag then goto main_loop_wrapup;
-@y
-if char_tag(main_i)<>lig_tag then goto main_loop_wrapup;
-if cur_r=non_char then goto main_loop_wrapup;
-@z
-@x module 1036
-tail_append(lig_stack) {|main_loop_lookahead| is next}
-@y
-link(tail):=lig_stack; tail:=lig_stack {|main_loop_lookahead| is next}
-@z
-
-426. For robustness, enforce a restriction checked by TFtoPL (suggested
-by DRF)
-
-@x module 365
-if lf<>6+lh+(ec-bc+1)+nw+nh+nd+ni+nl+nk+ne+np then abort;
-@y
-if lf<>6+lh+(ec-bc+1)+nw+nh+nd+ni+nl+nk+ne+np then abort;
-if (nw=0)or(nh=0)or(nd=0)or(ni=0) then abort;
-@z
-
-427. Tell more precisely the effective size of 1:1 insertions (DEK, 27 Feb 08)
-
-@x module 986
- t:=x_over_n(height(r),1000)*count(t); print_scaled(t);
-@y
- if count(t)=1000 then t:=height(r)
- else t:=x_over_n(height(r),1000)*count(t);
- print_scaled(t);
-@z
-
-428. \csname\endcsname should be followed by space in print_cs, just as all
-other multiletter control sequences are (found by Oleg Bulatov, 14 Sep 2008)
-
-@x module 262
- begin print_esc("csname"); print_esc("endcsname");
-@y
- begin print_esc("csname"); print_esc("endcsname"); print_char(" ");
-@z
-
-429. Don't echo error message to terminal when tracing paragraphs
-(Udo Wermuth, 15 January 2017)
-@x module 826
- begin no_shrink_error_yet:=false;
-@y
- begin no_shrink_error_yet:=false;
- @!stat if tracing_paragraphs>0 then end_diagnostic(true);@+tats@;
-@z
-@x
- error;
-@y
- error;
- @!stat if tracing_paragraphs>0 then begin_diagnostic;@+tats@;
-@z
-
-430. Defeat interactions during batch mode (Xiaosa Zhang, 27 June 2020)
-@x module 83
-@ @<Get user's advice...@>=
-loop@+begin continue: clear_for_error_prompt; prompt_input("? ");
-@y
-@ @<Get user's advice...@>=
-loop@+begin continue: if interaction<>error_stop_mode then return;
- clear_for_error_prompt; prompt_input("? ");
-@z
-
-431. Don't exit to editor if no input file is at the bottom line
-(Xiaosa Zhang, 03 July 2020)
-@x module 84
-"E": if base_ptr>0 then
-@y
-"E": if base_ptr>0 then if input_stack[base_ptr].name_field>=256 then
-@z
-@x module 85
-if base_ptr>0 then print("E to edit your file,");
-@y
-if base_ptr>0 then if input_stack[base_ptr].name_field>=256 then
- print("E to edit your file,");
-@z
-
-432. Keep date and time in system variables, use them in opening banner
-(Udo Wermuth, 11 December 2020)
-@x module 241
-Since standard \PASCAL\ cannot provide such information, something special
-is needed. The program here simply specifies July 4, 1776, at noon; but
-users probably want a better approximation to the truth.
-
-@p procedure fix_date_and_time;
-begin time:=12*60; {minutes since midnight}
-day:=4; {fourth day of the month}
-month:=7; {seventh month of the year}
-year:=1776; {Anno Domini}
-@y
-Since standard \PASCAL\ cannot provide such information, something special
-is needed. The program here simply assumes that suitable values appear in
-the global variables \\{sys\_time}, \\{sys\_day}, \\{sys\_month}, and
-\\{sys\_year} (which are initialized to noon on 4 July 1776,
-in case the implementor is careless).
-
-@p procedure fix_date_and_time;
-begin sys_time:=12*60;
-sys_day:=4; sys_month:=7; sys_year:=1776; {self-evident truths}
-time:=sys_time; {minutes since midnight}
-day:=sys_day; {day of the month}
-month:=sys_month; {month of the year}
-year:=sys_year; {Anno Domini}
-@z
-@x module 246
-@ Of course we had better declare another global variable, if the previous
-routines are going to work.
-
-@<Glob...@>=
-@!old_setting:0..max_selector;
-@y
-@ Of course we had better declare a few more global variables, if the previous
-routines are going to work.
-
-@<Glob...@>=
-@!old_setting:0..max_selector;
-@!sys_time,@!sys_day,@!sys_month,@!sys_year:integer;
- {date and time supplied by external system}
-@z
-@x module 536
-print_int(day); print_char(" ");
-months:='JANFEBMARAPRMAYJUNJULAUGSEPOCTNOVDEC';
-for k:=3*month-2 to 3*month do wlog(months[k]);
-print_char(" "); print_int(year); print_char(" ");
-print_two(time div 60); print_char(":"); print_two(time mod 60);
-@y
-print_int(sys_day); print_char(" ");
-months:='JANFEBMARAPRMAYJUNJULAUGSEPOCTNOVDEC';
-for k:=3*sys_month-2 to 3*sys_month do wlog(months[k]);
-print_char(" "); print_int(sys_year); print_char(" ");
-print_two(sys_time div 60); print_char(":"); print_two(sys_time mod 60);
-@z
-
-433. After nine parameters, delete both # and the token that follows
-(Bruno Le Floch, 22 October 2020)
-@x module 473
-label found,done,done1,done2;
-@y
-label found,continue,done,done1,done2;
-@z
-@x module 474
-begin loop begin get_token; {set |cur_cmd|, |cur_chr|, |cur_tok|}
-@y
-begin loop begin continue: get_token; {set |cur_cmd|, |cur_chr|, |cur_tok|}
-@z
-@x module 476
- help1("I'm going to ignore the # sign you just used."); error;
-@y
- help2("I'm going to ignore the # sign you just used,")@/
- ("as well as the token that followed it."); error; goto continue;
-@z
-
-434. Don't accept an implicit left brace after # in macro head
-(Udo Wermuth, 20 May 2020)
-@x module 476
-if cur_cmd=left_brace then
-@y
-if cur_tok<left_brace_limit then
-@z
-
-435. Keep garbage out of the buffer if a |\read| end unexpectedly
-(DRF, 17 February 2018)
-@x module 486
- align_state:=1000000; error;
-@y
- align_state:=1000000; limit:=0; error;
-@z
-
-436. Zero out nonexistent chars, to prevent rogue TFM files
-(DRF, 06 October 2020)
-@x module 722
- math_type(a):=empty;
-@y
- math_type(a):=empty; cur_i:=null_character;
-@z
-
-437. Don't classify fraction noads as inner noads (DRF, 25 March 2019)
-@x module 761
-fraction_noad: begin t:=inner_noad; s:=fraction_noad_size;
- end;
-@y
-fraction_noad: s:=fraction_noad_size;
-@z
-
-438. Properly identify tabskip glue when tracing repeated templates
-(Igor Liferenko, 10 January 2020)
-@x module 793
-link(p):=new_glue(glue_ptr(cur_loop));
-@y
-link(p):=new_glue(glue_ptr(cur_loop));
-subtype(link(p)):=tab_skip_code+1;
-@z
-
-439. Use the correct range for local variable hn (DRF, 31 October 2020)
-@x module 892
-@!hn:small_number; {the number of positions occupied in |hc|}
-@y
-@!hn:0..64; {the number of positions occupied in |hc|;
- not always a |small_number|}
-@z
-
-440. Normalize newlinechar when printing the final stats
-(Udo Wermuth, 29 November 2020)
-@x module 1333
-begin @<Finish the extensions@>;
-@y
-begin @<Finish the extensions@>; new_line_char:=-1;
-@z
-@x module 1335
-begin c:=cur_chr;
-@y
-begin c:=cur_chr; if c<>1 then new_line_char:=-1;
-@z
-
------------
-999. The absolutely final change (to be made after my death)
-@x module 2
-@d banner=='This is TeX, Version 3.141592653' {printed when \TeX\ starts}
-@y
-@d banner=='This is TeX, Version $\pi$' {printed when \TeX\ starts}
-@z
-When this change is made, the corresponding line should be changed in
-Volume B, and also on page 23 of The TeXbook.
-My last will and testament for TeX is that no further changes be made
-under any circumstances. Improved systems should not be called simply `TeX';
-that name, unqualified, should refer only to the program for which I have
-taken personal responsibility. -- Don Knuth
-
- * Possibly nice ideas that will not be implemented
-
-. classes of marks analogous to classes of insertions
-
-. \showcontext to show the current location without stopping for error
-
-. \show commands to be less like errors
-
-. \everyeof to insert tokens before an \input file ends
- (strange example: \everyeof{\noexpand} will allow things
- like \xdef\a{\input foo}!)
-
-. generalize \leftskip and \rightskip to token lists (problems with
- displayed math then)
-
-. generalize \widowline and \clubline to go further into a paragraph
-
-. \lastbox to remove and box a charnode if one is there
-
-. \lastbox to set a new quantity \lastboxshift, to preserve info now lost
-
-. \posttolerance for third pass of line breaking
-
-* Design errors that are too late to fix
-
-. additional parameters should be in symbol fonts to govern the space between
- rules and text in \over, \sqrt, etc.
-
-. multilingual typesetting doesn't work properly when the \lccode changes
- within a paragraph
-
-. large accents cannot be brought close to small letters in math mode
-
-. \hyphenation is not sensitive to \language
-
-* Bad ideas that will not be implemented
-
-. several people want to be able to remove arbitrary elements of lists,
- but that must never be done because some of those elements (e.g. kerns
- for accents) depend on floating point arithmetic
-
-. if anybody wants letter spacing desperately they should put it in their own
- private version (e.g. generalize the hpack routine) and NOT call it TeX.
diff --git a/Master/texmf-dist/doc/generic/knuth/etc/vftovp-changes.pdf b/Master/texmf-dist/doc/generic/knuth/etc/vftovp-changes.pdf
new file mode 100644
index 00000000000..a800bffff72
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/etc/vftovp-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/etc/vftovp.pdf b/Master/texmf-dist/doc/generic/knuth/etc/vftovp.pdf
index 21ad7e1dc02..b284a6f6bea 100644
--- a/Master/texmf-dist/doc/generic/knuth/etc/vftovp.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/etc/vftovp.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/etc/vptovf-changes.pdf b/Master/texmf-dist/doc/generic/knuth/etc/vptovf-changes.pdf
new file mode 100644
index 00000000000..49b6d717e03
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/etc/vptovf-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/etc/vptovf.pdf b/Master/texmf-dist/doc/generic/knuth/etc/vptovf.pdf
index 57343b64dd7..53c70c0b31f 100644
--- a/Master/texmf-dist/doc/generic/knuth/etc/vptovf.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/etc/vptovf.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/index.html b/Master/texmf-dist/doc/generic/knuth/index.html
new file mode 100644
index 00000000000..b0dc7c3544f
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/index.html
@@ -0,0 +1,204 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml" lang="" xml:lang="">
+<head>
+ <meta charset="utf-8" />
+ <meta name="generator" content="pandoc" />
+ <meta name="viewport" content="width=device-width, initial-scale=1.0, user-scalable=yes" />
+ <title>C/WEB programs in “TeX Live 2021”</title>
+ <style>
+ html {
+ line-height: 1.5;
+ font-family: Georgia, serif;
+ font-size: 20px;
+ color: #1a1a1a;
+ background-color: #fdfdfd;
+ }
+ body {
+ margin: 0 auto;
+ max-width: 36em;
+ padding-left: 50px;
+ padding-right: 50px;
+ padding-top: 50px;
+ padding-bottom: 50px;
+ hyphens: auto;
+ word-wrap: break-word;
+ text-rendering: optimizeLegibility;
+ font-kerning: normal;
+ }
+ @media (max-width: 600px) {
+ body {
+ font-size: 0.9em;
+ padding: 1em;
+ }
+ }
+ @media print {
+ body {
+ background-color: transparent;
+ color: black;
+ font-size: 12pt;
+ }
+ p, h2, h3 {
+ orphans: 3;
+ widows: 3;
+ }
+ h2, h3, h4 {
+ page-break-after: avoid;
+ }
+ }
+ p {
+ margin: 1em 0;
+ }
+ a {
+ color: #1a1a1a;
+ }
+ a:visited {
+ color: #1a1a1a;
+ }
+ img {
+ max-width: 100%;
+ }
+ h1, h2, h3, h4, h5, h6 {
+ margin-top: 1.4em;
+ }
+ h5, h6 {
+ font-size: 1em;
+ font-style: italic;
+ }
+ h6 {
+ font-weight: normal;
+ }
+ ol, ul {
+ padding-left: 1.7em;
+ margin-top: 1em;
+ }
+ li > ol, li > ul {
+ margin-top: 0;
+ }
+ blockquote {
+ margin: 1em 0 1em 1.7em;
+ padding-left: 1em;
+ border-left: 2px solid #e6e6e6;
+ color: #606060;
+ }
+ code {
+ font-family: Menlo, Monaco, 'Lucida Console', Consolas, monospace;
+ font-size: 85%;
+ margin: 0;
+ }
+ pre {
+ margin: 1em 0;
+ overflow: auto;
+ }
+ pre code {
+ padding: 0;
+ overflow: visible;
+ }
+ .sourceCode {
+ background-color: transparent;
+ overflow: visible;
+ }
+ hr {
+ background-color: #1a1a1a;
+ border: none;
+ height: 1px;
+ margin: 1em 0;
+ }
+ table {
+ margin: 1em 0;
+ border-collapse: collapse;
+ width: 100%;
+ overflow-x: auto;
+ display: block;
+ font-variant-numeric: lining-nums tabular-nums;
+ }
+ table caption {
+ margin-bottom: 0.75em;
+ }
+ tbody {
+ margin-top: 0.5em;
+ border-top: 1px solid #1a1a1a;
+ border-bottom: 1px solid #1a1a1a;
+ }
+ th {
+ border-top: 1px solid #1a1a1a;
+ padding: 0.25em 0.5em 0.25em 0.5em;
+ }
+ td {
+ padding: 0.125em 0.5em 0.25em 0.5em;
+ }
+ header {
+ margin-bottom: 4em;
+ text-align: center;
+ }
+ #TOC li {
+ list-style: none;
+ }
+ #TOC a:not(:hover) {
+ text-decoration: none;
+ }
+ code{white-space: pre-wrap;}
+ span.smallcaps{font-variant: small-caps;}
+ span.underline{text-decoration: underline;}
+ div.column{display: inline-block; vertical-align: top; width: 50%;}
+ div.hanging-indent{margin-left: 1.5em; text-indent: -1.5em;}
+ ul.task-list{list-style: none;}
+ .display.math{display: block; text-align: center; margin: 0.5rem auto;}
+ </style>
+ <!--[if lt IE 9]>
+ <script src="//cdnjs.cloudflare.com/ajax/libs/html5shiv/3.7.3/html5shiv-printshiv.min.js"></script>
+ <![endif]-->
+</head>
+<body>
+<header id="title-block-header">
+<h1 class="title">C/WEB programs in “TeX Live 2021”</h1>
+</header>
+<h2 id="introduction">Introduction</h2>
+<p>Welcome to “All Things <code>WEB</code>” in “TeX Live.”</p>
+<p>Here you find the documented source code of all major <code>WEB</code> and <code>CWEB</code> programs in readable format. The “named” entries represent the unmodified base sources, the attached “<code>chg</code>” links point to “only the changed sections (or modules),” so you may want to study these pairs in parallel. Care has been taken to keep the section numbers for the main parts intact.</p>
+<p>Note that all <code>WEB</code> programs are mogrified from Pascal code to C code before compilation, so further modifications and amendments will occur “for the real thing,” i.e., the production of the executable <code>WEB</code> programs. (The <code>CWEB</code> programs do not require these extra modifications, they get linked directly to the external runtime environment.)</p>
+<p>If you believe to have found anything that remains technically, historically, typographically, or politically incorrect, please notify the maintainers on <a href="mailto:tex-k@tug.org">the tex-k mailing list</a>.</p>
+<h2 id="canonical-knuthian-web-programs">Canonical Knuthian WEB programs</h2>
+<ul>
+<li><p><code>etc/</code> <span>[</span> <a href="etc/vftovp.pdf"><code>VFtoVP</code></a> <sub><a href="etc/vftovp-changes.pdf"><code>chg</code></a></sub> <a href="etc/vptovf.pdf"><code>VPtoVF</code></a> <sub><a href="etc/vptovf-changes.pdf"><code>chg</code></a></sub> <span>]</span></p></li>
+<li><p><code>mf/</code> <span>[</span> <a href="mf/mf.pdf"><code>Metafont</code></a> <sub><a href="mf/mf-changes.pdf"><code>chg</code></a></sub> <a href="mf/trapman.pdf"><code>TRAPMAN</code></a> <span>]</span></p></li>
+<li><p><code>mfware/</code> <span>[</span> <a href="mfware/gftype.pdf"><code>GFtype</code></a> <sub><a href="mfware/gftype-changes.pdf"><code>chg</code></a></sub> <a href="mfware/gftopk.pdf"><code>GFtoPK</code></a> <sub><a href="mfware/gftopk-changes.pdf"><code>chg</code></a></sub> <a href="mfware/gftodvi.pdf"><code>GFtoDVI</code></a> <sub><a href="mfware/gftodvi-changes.pdf"><code>chg</code></a></sub> <a href="mfware/mft.pdf"><code>MFT</code></a> <sub><a href="mfware/mft-changes.pdf"><code>chg</code></a></sub> <span>]</span></p></li>
+<li><p><code>tex/</code> <span>[</span> <a href="tex/glue.pdf"><code>GLUE</code></a> <a href="tex/tex.pdf"><code>TeX</code></a> <sub><a href="tex/tex-changes.pdf"><code>chg</code></a></sub> <a href="tex/tripman.pdf"><code>TRIPMAN</code></a> <span>]</span></p></li>
+<li><p><code>texware/</code> <span>[</span> <a href="texware/pooltype.pdf"><code>POOLtype</code></a> <sub><a href="texware/pooltype-changes.pdf"><code>chg</code></a></sub> <a href="texware/tftopl.pdf"><code>TFtoPL</code></a> <sub><a href="texware/tftopl-changes.pdf"><code>chg</code></a></sub> <a href="texware/pltotf.pdf"><code>PLtoTF</code></a> <sub><a href="texware/pltotf-changes.pdf"><code>chg</code></a></sub> <a href="texware/dvitype.pdf"><code>DVItype</code></a> <sub><a href="texware/dvitype-changes.pdf"><code>chg</code></a></sub> <span>]</span></p></li>
+<li><p><code>web/</code> <span>[</span> <a href="web/webman.pdf"><code>WEBMAN</code></a> <a href="web/weave.pdf"><code>WEAVE</code></a> <sub><a href="web/weave-changes.pdf"><code>chg</code></a></sub> <a href="web/tangle.pdf"><code>TANGLE</code></a> <sub><a href="web/tangle-changes.pdf"><code>chg</code></a></sub> <span>]</span></p></li>
+</ul>
+<h2 id="complementary-web-programs">Complementary WEB programs</h2>
+<ul>
+<li><p><code>other/</code> <span>[</span> <a href="other/dvicopy.pdf"><code>DVIcopy</code></a> <sub><a href="other/dvicopy-changes.pdf"><code>chg</code></a></sub> <a href="other/patgen.pdf"><code>PatGen</code></a> <sub><a href="other/patgen-changes.pdf"><code>chg</code></a></sub> <a href="other/pktogf.pdf"><code>PKtoGF</code></a> <sub><a href="other/pktogf-changes.pdf"><code>chg</code></a></sub> <a href="other/pktype.pdf"><code>PKtype</code></a> <sub><a href="other/pktype-changes.pdf"><code>chg</code></a></sub> <span>]</span></p></li>
+<li><p><code>bibtex/</code> <span>[</span> <a href="bibtex/bibtex.pdf"><code>BibTeX</code></a> <sub><a href="bibtex/bibtex-changes.pdf"><code>chg</code></a></sub> <span>]</span></p></li>
+<li><p><code>pdftex/</code> <span>[</span> <a href="pdftex/pdftex.pdf"><code>pdfTeX</code></a> <sub><a href="pdftex/pdftex-changes.pdf"><code>chg</code></a></sub> <span>]</span></p></li>
+<li><p><code>xetex/</code> <span>[</span> <a href="xetex/xetex.pdf"><code>XeTeX</code></a> <sub><a href="xetex/xetex-changes.pdf"><code>chg</code></a></sub> <span>]</span></p></li>
+</ul>
+<h2 id="cweb-programs">CWEB programs</h2>
+<ul>
+<li><p><code>cweb/</code> <span>[</span> <a href="cweb/cwebman.pdf"><code>CWEBMAN</code></a> <a href="cweb/common.pdf"><code>COMMON</code></a> <sub><a href="cweb/common-changes.pdf"><code>chg</code></a></sub> <a href="cweb/ctangle.pdf"><code>CTANGLE</code></a> <sub><a href="cweb/ctangle-changes.pdf"><code>chg</code></a></sub> <a href="cweb/cweave.pdf"><code>CWEAVE</code></a> <sub><a href="cweb/cweave-changes.pdf"><code>chg</code></a></sub> <a href="cweb/ctwill.pdf"><code>CTWILL</code></a> <span>]</span></p></li>
+<li><p><code>ctie/</code> <span>[</span> <a href="ctie/ctie.pdf"><code>CTIE</code></a> <sub><a href="ctie/ctie-changes.pdf"><code>chg</code></a></sub> <span>]</span></p></li>
+<li><p><code>tie/</code> <span>[</span> <a href="tie/tie.pdf"><code>TIE</code></a> <sub><a href="tie/tie-changes.pdf"><code>chg</code></a></sub> <span>]</span></p></li>
+</ul>
+<h2 id="errata-for-computers-typesetting">Errata for “Computers &amp; Typesetting”</h2>
+<ul>
+<li><p><code>errata/</code></p>
+<ul>
+<li><p><a href="errata/errorlog.pdf">The Errors of TeX</a></p></li>
+<li><p><a href="errata/errata.one.pdf">The TeXbook, 1<sup>st</sup> printing</a></p></li>
+<li><p><a href="errata/errata.two.pdf">The TeXbook, 2<sup>nd</sup> printing</a></p></li>
+<li><p><a href="errata/errata.three.pdf">Computers &amp; Typesetting, 15 June 1987</a></p></li>
+<li><p><a href="errata/errata.four.pdf">Computers &amp; Typesetting, 20 February 1989</a></p></li>
+<li><p><a href="errata/errata.five.pdf">Computers &amp; Typesetting, 30 September 1989</a></p></li>
+<li><p><a href="errata/errata.six.pdf">Computers &amp; Typesetting, 31 December 1990</a></p></li>
+<li><p><a href="errata/errata.seven.pdf">Computers &amp; Typesetting, 15 March 1992</a></p></li>
+<li><p><a href="errata/errata.eight.pdf">Computers &amp; Typesetting, pre-Millennium ed.</a></p></li>
+<li><p><a href="errata/errata.nine.pdf">The TeXbook, September 1996</a></p></li>
+<li><p><a href="errata/errata.ten.pdf">Computers &amp; Typesetting, 1<sup>st</sup> Millennium ed.</a></p></li>
+<li><p><a href="errata/errata.eleven.pdf">Computers &amp; Typesetting, 2<sup>nd</sup> Millennium ed.</a></p></li>
+<li><p><a href="errata/errata.twelve.pdf">Computers &amp; Typesetting, early 2014</a></p></li>
+<li><p><a href="errata/errata.pdf">Computers &amp; Typesetting, 31 January 2021</a></p></li>
+</ul></li>
+</ul>
+<h2 id="happy-cweb-programming">Happy C/WEB Programming!</h2>
+</body>
+</html>
diff --git a/Master/texmf-dist/doc/generic/knuth/index.pdf b/Master/texmf-dist/doc/generic/knuth/index.pdf
new file mode 100644
index 00000000000..29c74676474
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/index.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/mf/mf-changes.pdf b/Master/texmf-dist/doc/generic/knuth/mf/mf-changes.pdf
new file mode 100644
index 00000000000..93309d474bd
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/mf/mf-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/mf/mf.pdf b/Master/texmf-dist/doc/generic/knuth/mf/mf.pdf
index c8e5afbb7fe..dd6d0f6eecd 100644
--- a/Master/texmf-dist/doc/generic/knuth/mf/mf.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/mf/mf.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/mf/trapman.pdf b/Master/texmf-dist/doc/generic/knuth/mf/trapman.pdf
index f4e60df8bfc..316f2741695 100644
--- a/Master/texmf-dist/doc/generic/knuth/mf/trapman.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/mf/trapman.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/mfware/gftodvi-changes.pdf b/Master/texmf-dist/doc/generic/knuth/mfware/gftodvi-changes.pdf
new file mode 100644
index 00000000000..c34dad85fd2
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/mfware/gftodvi-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/mfware/gftodvi.pdf b/Master/texmf-dist/doc/generic/knuth/mfware/gftodvi.pdf
index 94ace296772..a5c0f52e9b9 100644
--- a/Master/texmf-dist/doc/generic/knuth/mfware/gftodvi.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/mfware/gftodvi.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/mfware/gftopk-changes.pdf b/Master/texmf-dist/doc/generic/knuth/mfware/gftopk-changes.pdf
new file mode 100644
index 00000000000..1c2ce811847
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/mfware/gftopk-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/mfware/gftopk.pdf b/Master/texmf-dist/doc/generic/knuth/mfware/gftopk.pdf
index c17841c80da..6b2d5debe52 100644
--- a/Master/texmf-dist/doc/generic/knuth/mfware/gftopk.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/mfware/gftopk.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/mfware/gftype-changes.pdf b/Master/texmf-dist/doc/generic/knuth/mfware/gftype-changes.pdf
new file mode 100644
index 00000000000..e16be2298e2
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/mfware/gftype-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/mfware/gftype.pdf b/Master/texmf-dist/doc/generic/knuth/mfware/gftype.pdf
index 8933e248d7e..c0c835ecd80 100644
--- a/Master/texmf-dist/doc/generic/knuth/mfware/gftype.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/mfware/gftype.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/mfware/mft-changes.pdf b/Master/texmf-dist/doc/generic/knuth/mfware/mft-changes.pdf
new file mode 100644
index 00000000000..f7c951970c6
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/mfware/mft-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/mfware/mft.pdf b/Master/texmf-dist/doc/generic/knuth/mfware/mft.pdf
index 73ee2e3bd48..cacc723c47f 100644
--- a/Master/texmf-dist/doc/generic/knuth/mfware/mft.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/mfware/mft.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/other/dvicopy-changes.pdf b/Master/texmf-dist/doc/generic/knuth/other/dvicopy-changes.pdf
new file mode 100644
index 00000000000..dc96e0022c0
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/other/dvicopy-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/other/dvicopy.pdf b/Master/texmf-dist/doc/generic/knuth/other/dvicopy.pdf
new file mode 100644
index 00000000000..cc30c5cee02
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/other/dvicopy.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/other/patgen-changes.pdf b/Master/texmf-dist/doc/generic/knuth/other/patgen-changes.pdf
new file mode 100644
index 00000000000..f3880afaa1f
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/other/patgen-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/other/patgen.pdf b/Master/texmf-dist/doc/generic/knuth/other/patgen.pdf
new file mode 100644
index 00000000000..3e9ba6d7c1c
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/other/patgen.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/other/pktogf-changes.pdf b/Master/texmf-dist/doc/generic/knuth/other/pktogf-changes.pdf
new file mode 100644
index 00000000000..268467de17d
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/other/pktogf-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/other/pktogf.pdf b/Master/texmf-dist/doc/generic/knuth/other/pktogf.pdf
new file mode 100644
index 00000000000..5a60f29da45
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/other/pktogf.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/other/pktype-changes.pdf b/Master/texmf-dist/doc/generic/knuth/other/pktype-changes.pdf
new file mode 100644
index 00000000000..3ddf1dcae98
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/other/pktype-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/other/pktype.pdf b/Master/texmf-dist/doc/generic/knuth/other/pktype.pdf
new file mode 100644
index 00000000000..e6057ef46eb
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/other/pktype.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/pdftex/pdftex-changes.pdf b/Master/texmf-dist/doc/generic/knuth/pdftex/pdftex-changes.pdf
new file mode 100644
index 00000000000..a8867870e53
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/pdftex/pdftex-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/pdftex/pdftex.pdf b/Master/texmf-dist/doc/generic/knuth/pdftex/pdftex.pdf
new file mode 100644
index 00000000000..e3c3eb770cc
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/pdftex/pdftex.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/tex/glue.pdf b/Master/texmf-dist/doc/generic/knuth/tex/glue.pdf
index ba814ca8def..211d85143e1 100644
--- a/Master/texmf-dist/doc/generic/knuth/tex/glue.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/tex/glue.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/tex/tex-changes.pdf b/Master/texmf-dist/doc/generic/knuth/tex/tex-changes.pdf
new file mode 100644
index 00000000000..afdf169114b
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/tex/tex-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/tex/tex.pdf b/Master/texmf-dist/doc/generic/knuth/tex/tex.pdf
index a57729a9696..a59cbe22ce2 100644
--- a/Master/texmf-dist/doc/generic/knuth/tex/tex.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/tex/tex.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/tex/tripman.pdf b/Master/texmf-dist/doc/generic/knuth/tex/tripman.pdf
index 11b3363b843..b0b1021ecb3 100644
--- a/Master/texmf-dist/doc/generic/knuth/tex/tripman.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/tex/tripman.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/texware/dvitype-changes.pdf b/Master/texmf-dist/doc/generic/knuth/texware/dvitype-changes.pdf
new file mode 100644
index 00000000000..037f45ea084
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/texware/dvitype-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/texware/dvitype.pdf b/Master/texmf-dist/doc/generic/knuth/texware/dvitype.pdf
index ac3a2ef3c3a..0f2fba14605 100644
--- a/Master/texmf-dist/doc/generic/knuth/texware/dvitype.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/texware/dvitype.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/texware/pltotf-changes.pdf b/Master/texmf-dist/doc/generic/knuth/texware/pltotf-changes.pdf
new file mode 100644
index 00000000000..d59a4016ecb
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/texware/pltotf-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/texware/pltotf.pdf b/Master/texmf-dist/doc/generic/knuth/texware/pltotf.pdf
index 1d7967e4091..47bfa51dc5a 100644
--- a/Master/texmf-dist/doc/generic/knuth/texware/pltotf.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/texware/pltotf.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/texware/pooltype-changes.pdf b/Master/texmf-dist/doc/generic/knuth/texware/pooltype-changes.pdf
new file mode 100644
index 00000000000..e7d5970efea
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/texware/pooltype-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/texware/pooltype.pdf b/Master/texmf-dist/doc/generic/knuth/texware/pooltype.pdf
index f6b8ad492f8..f09d485c97d 100644
--- a/Master/texmf-dist/doc/generic/knuth/texware/pooltype.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/texware/pooltype.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/texware/tftopl-changes.pdf b/Master/texmf-dist/doc/generic/knuth/texware/tftopl-changes.pdf
new file mode 100644
index 00000000000..6153a5a2468
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/texware/tftopl-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/texware/tftopl.pdf b/Master/texmf-dist/doc/generic/knuth/texware/tftopl.pdf
index 1d5803b8039..a5346c1a4b5 100644
--- a/Master/texmf-dist/doc/generic/knuth/texware/tftopl.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/texware/tftopl.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/tie/tie-changes.pdf b/Master/texmf-dist/doc/generic/knuth/tie/tie-changes.pdf
new file mode 100644
index 00000000000..068d76ce60f
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/tie/tie-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/tie/tie.pdf b/Master/texmf-dist/doc/generic/knuth/tie/tie.pdf
new file mode 100644
index 00000000000..99a6bad137f
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/tie/tie.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/web/tangle-changes.pdf b/Master/texmf-dist/doc/generic/knuth/web/tangle-changes.pdf
new file mode 100644
index 00000000000..e18c8d99750
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/web/tangle-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/web/tangle.pdf b/Master/texmf-dist/doc/generic/knuth/web/tangle.pdf
index ff5fd57a722..19be12f56f5 100644
--- a/Master/texmf-dist/doc/generic/knuth/web/tangle.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/web/tangle.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/web/weave-changes.pdf b/Master/texmf-dist/doc/generic/knuth/web/weave-changes.pdf
new file mode 100644
index 00000000000..24b1f6615d8
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/web/weave-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/web/weave.pdf b/Master/texmf-dist/doc/generic/knuth/web/weave.pdf
index 78a60495b75..a59790ee30e 100644
--- a/Master/texmf-dist/doc/generic/knuth/web/weave.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/web/weave.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/web/webman.pdf b/Master/texmf-dist/doc/generic/knuth/web/webman.pdf
index b0306db4dbf..bf5cbb6faf5 100644
--- a/Master/texmf-dist/doc/generic/knuth/web/webman.pdf
+++ b/Master/texmf-dist/doc/generic/knuth/web/webman.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/xetex/xetex-changes.pdf b/Master/texmf-dist/doc/generic/knuth/xetex/xetex-changes.pdf
new file mode 100644
index 00000000000..a2887352bfa
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/xetex/xetex-changes.pdf
Binary files differ
diff --git a/Master/texmf-dist/doc/generic/knuth/xetex/xetex.pdf b/Master/texmf-dist/doc/generic/knuth/xetex/xetex.pdf
new file mode 100644
index 00000000000..f71e7c2e7ee
--- /dev/null
+++ b/Master/texmf-dist/doc/generic/knuth/xetex/xetex.pdf
Binary files differ