134 lines
2.8 KiB
C
134 lines
2.8 KiB
C
|
/* cmapclean.c -- parse a CMap file and write it back out */
|
||
|
|
|
||
|
|
#include <stdio.h>
|
||
|
|
#include <string.h>
|
||
|
|
|
||
|
|
#include "mupdf/pdf.h"
|
||
|
|
|
||
|
|
struct cidrange {
|
||
|
|
unsigned int lo, hi, v;
|
||
|
|
};
|
||
|
|
|
||
|
|
static int cmpcidrange(const void *va, const void *vb)
|
||
|
|
{
|
||
|
|
unsigned int a = ((const struct cidrange *)va)->lo;
|
||
|
|
unsigned int b = ((const struct cidrange *)vb)->lo;
|
||
|
|
return a < b ? -1 : a > b ? 1 : 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
static void pc(unsigned int c)
|
||
|
|
{
|
||
|
|
if (c <= 0xff) printf("<%02x>", c);
|
||
|
|
else if (c <= 0xffff) printf("<%04x>", c);
|
||
|
|
else if (c <= 0xffffff) printf("<%06x>", c);
|
||
|
|
else printf("<%010x>", c);
|
||
|
|
}
|
||
|
|
|
||
|
|
int
|
||
|
|
main(int argc, char **argv)
|
||
|
|
{
|
||
|
|
fz_context *ctx;
|
||
|
|
fz_stream *fi;
|
||
|
|
pdf_cmap *cmap;
|
||
|
|
int k, m, n, i;
|
||
|
|
struct cidrange *r;
|
||
|
|
|
||
|
|
if (argc != 2)
|
||
|
|
{
|
||
|
|
fprintf(stderr, "usage: cmapclean input.cmap\n");
|
||
|
|
return 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
ctx = fz_new_context(NULL, NULL, FZ_STORE_UNLIMITED);
|
||
|
|
if (!ctx)
|
||
|
|
{
|
||
|
|
fprintf(stderr, "cannot initialise context\n");
|
||
|
|
return 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
fi = fz_open_file(ctx, argv[1]);
|
||
|
|
cmap = pdf_load_cmap(ctx, fi);
|
||
|
|
fz_drop_stream(ctx, fi);
|
||
|
|
|
||
|
|
printf("begincmap\n");
|
||
|
|
printf("/CMapName /%s def\n", cmap->cmap_name);
|
||
|
|
printf("/WMode %d def\n", cmap->wmode);
|
||
|
|
if (cmap->usecmap_name[0])
|
||
|
|
printf("/%s usecmap\n", cmap->usecmap_name);
|
||
|
|
|
||
|
|
if (cmap->codespace_len)
|
||
|
|
{
|
||
|
|
printf("begincodespacerange\n");
|
||
|
|
for (k = 0; k < cmap->codespace_len; k++)
|
||
|
|
{
|
||
|
|
if (cmap->codespace[k].n == 1)
|
||
|
|
printf("<%02x> <%02x>\n", cmap->codespace[k].low, cmap->codespace[k].high);
|
||
|
|
else if (cmap->codespace[k].n == 2)
|
||
|
|
printf("<%04x> <%04x>\n", cmap->codespace[k].low, cmap->codespace[k].high);
|
||
|
|
else if (cmap->codespace[k].n == 3)
|
||
|
|
printf("<%06x> <%06x>\n", cmap->codespace[k].low, cmap->codespace[k].high);
|
||
|
|
else if (cmap->codespace[k].n == 4)
|
||
|
|
printf("<%08x> <%08x>\n", cmap->codespace[k].low, cmap->codespace[k].high);
|
||
|
|
else
|
||
|
|
printf("<%x> <%x>\n", cmap->codespace[k].low, cmap->codespace[k].high);
|
||
|
|
}
|
||
|
|
printf("endcodespacerange\n");
|
||
|
|
}
|
||
|
|
|
||
|
|
n = cmap->rlen + cmap->xlen;
|
||
|
|
r = fz_malloc(ctx, n * sizeof *r);
|
||
|
|
i = 0;
|
||
|
|
|
||
|
|
for (k = 0; k < cmap->rlen; k++) {
|
||
|
|
r[i].lo = cmap->ranges[k].low;
|
||
|
|
r[i].hi = cmap->ranges[k].high;
|
||
|
|
r[i].v = cmap->ranges[k].out;
|
||
|
|
++i;
|
||
|
|
}
|
||
|
|
|
||
|
|
for (k = 0; k < cmap->xlen; k++) {
|
||
|
|
r[i].lo = cmap->xranges[k].low;
|
||
|
|
r[i].hi = cmap->xranges[k].high;
|
||
|
|
r[i].v = cmap->xranges[k].out;
|
||
|
|
++i;
|
||
|
|
}
|
||
|
|
|
||
|
|
qsort(r, n, sizeof *r, cmpcidrange);
|
||
|
|
|
||
|
|
if (n)
|
||
|
|
{
|
||
|
|
printf("begincidchar\n");
|
||
|
|
for (i = 0; i < n; ++i)
|
||
|
|
{
|
||
|
|
for (k = r[i].lo, m = r[i].v; k <= r[i].hi; ++k, ++m)
|
||
|
|
{
|
||
|
|
pc(k);
|
||
|
|
printf("%u\n", m);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
printf("endcidchar\n");
|
||
|
|
}
|
||
|
|
|
||
|
|
#if 0
|
||
|
|
if (cmap->mlen > 0)
|
||
|
|
{
|
||
|
|
printf("beginbfchar\n");
|
||
|
|
for (k = 0; k < cmap->mlen; k++)
|
||
|
|
{
|
||
|
|
pc(cmap->mranges[k].low);
|
||
|
|
|
||
|
|
printf("<");
|
||
|
|
for (m = 0; m < cmap->mranges[k].len; ++m)
|
||
|
|
printf("%04x", cmap->mranges[k].out[m]);
|
||
|
|
printf(">\n");
|
||
|
|
}
|
||
|
|
printf("endbfchar\n");
|
||
|
|
}
|
||
|
|
#endif
|
||
|
|
|
||
|
|
printf("endcmap\n");
|
||
|
|
|
||
|
|
fz_drop_context(ctx);
|
||
|
|
return 0;
|
||
|
|
}
|