summaryrefslogtreecommitdiff
path: root/Build/source/texk/ttfdump/libttf/kern.c
blob: 54104a0aba43199a9ead2b664855e5f063d5585f (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
/* kern.c -- Kerning Table
 * Copyright (C) 1996 Li-Da Lho, All right reserved 
 */
#include <stdio.h>
#include <stdlib.h>
#include "config.h"
#include "ttf.h"
#include "ttfutil.h"

/* 	$Id: kern.c,v 1.1.1.1 1998/06/05 07:47:52 robert Exp $	 */

static void ttfLoadKERN(FILE *fp,KERNPtr kern,ULONG offset);

void ttfInitKERN(TTFontPtr font)
{
    ULONG tag = FT_MAKE_TAG ('k', 'e', 'r', 'n');
    TableDirPtr ptd;
     
    if ((ptd = ttfLookUpTableDir(tag,font)) != NULL)
	{
	    font->kern = XCALLOC1 (KERN);
	    ttfLoadKERN(font->fp,font->kern,ptd->offset);
	}
}

static void ttfLoadKERN (FILE *fp,KERNPtr kern,ULONG offset)
{
    int i;

    xfseek(fp, offset, SEEK_SET, "ttfLoadKERN");
    
    kern->version = ttfGetUSHORT(fp);
    kern->nTables = ttfGetUSHORT(fp);

    kern->subtable = XCALLOC (kern->nTables, KernSubtable);

    for (i=0;i<kern->nTables;i++)
	{
	    struct kernpair *pairs;
	    int j,n;
	    (kern->subtable+i)->version = ttfGetUSHORT(fp);
	    (kern->subtable+i)->length = ttfGetUSHORT(fp);
	    (kern->subtable+i)->coverage = ttfGetUSHORT(fp);

	    switch ((kern->subtable+i)->coverage >> 8)
		{
		case 0:
		    (kern->subtable+i)->kern.kern0.nPairs = n = 
			ttfGetUSHORT(fp);
		    (kern->subtable+i)->kern.kern0.searchRange =
			ttfGetUSHORT(fp);
		    (kern->subtable+i)->kern.kern0.entrySelector =
			ttfGetUSHORT(fp);
		    (kern->subtable+i)->kern.kern0.rangeShift =
			ttfGetUSHORT(fp);
		    (kern->subtable+i)->kern.kern0.pairs = pairs =
			XCALLOC (n, struct kernpair);

		    for (j=0;j<n;j++)
			{
			    (pairs+j)->left = ttfGetUSHORT(fp);
			    (pairs+j)->right = ttfGetUSHORT(fp);
			    (pairs+j)->value = ttfGetFWord(fp);
			}
		    break;
		case 2:
		    /* not implemented yet */
		    break;
		default:
		    /* do nothing */
		    break;
		}
	}
}

void ttfPrintKERN(FILE *fp,KERNPtr kern)
{
    int i;
    
    fprintf(fp,"'kern' Table - Kerning Data\n");
    fprintf(fp,"---------------------------\n");
    fprintf(fp,"'kern' Version:\t %d\n", kern->version);
    fprintf(fp,"Number of subtables:\t %d\n\n",kern->nTables);

    for (i=0;i<kern->nTables;i++)
	{
	    struct kernpair *pairs;
	    int j,n;

	    fprintf(fp,"\t Subtable format \t %d\n",
		    (kern->subtable+i)->coverage >> 8);
	    fprintf(fp,"\t Subtable version \t %d\n",
		    (kern->subtable+i)->version);
	    fprintf(fp,"\t Bytes in subtable \t %d\n",
		    (kern->subtable+i)->length);
	    fprintf(fp,"\t Coverage bits \t 0x%x\n",
		    (kern->subtable+i)->coverage);
	    switch ((kern->subtable+i)->coverage >> 8)
		{
		case 0:
		    n = (kern->subtable+i)->kern.kern0.nPairs;
		    pairs = (kern->subtable+i)->kern.kern0.pairs;

		    fprintf(fp,"\t Number of pairs %d\n",n);
		    fprintf(fp,"\t Search Range    %d\n",
			    (kern->subtable+i)->kern.kern0.searchRange);
		    fprintf(fp,"\t Entry Selector  %d\n",
			    (kern->subtable+i)->kern.kern0.entrySelector);
		    fprintf(fp,"\t Range Shift     %d\n",
			    (kern->subtable+i)->kern.kern0.rangeShift);

		    fprintf(fp,"\t Left Glyph \t Right Glyph \t Kern Move\n");
		    fprintf(fp,"\t ---------- \t ----------- \t ---------\n");

		    for (j=0;j<n;j++)
			{
			    fprintf(fp,"\t\t %d \t\t %d \t\t %d\n",
				    (pairs+j)->left,(pairs+j)->right,
				    (pairs+j)->value);
			}
		    break;
		case 2:
		    /* not implemented yet */
		    break;
		default:
		    /* do nothing */
		    break;
		}
	    fprintf(fp,"\n");
	}

}

void ttfFreeKERN(KERNPtr kern)
{
    int i;
    
    if (kern != NULL)
	{
	    for (i=0;i<kern->nTables;i++)
		{
		    switch ((kern->subtable+i)->coverage >> 8)
			{
			case 0:
			    free((kern->subtable+i)->kern.kern0.pairs);
			     break;
			case 2:
			    /* not implemented yet */
			    break;
			default:
			    /* do nothing */
			    break;
			}
		}
	    free(kern->subtable);
	    free(kern);
	}
}