+ for(i=range->first; i<=range->last; ++i)
+ {
+ unsigned n;
+ FT_Bitmap *bmp = &face->glyph->bitmap;
+ int flags = 0;
+ Glyph *glyph;
+
+ n = FT_Get_Char_Index(face, i);
+ if(!n)
+ continue;
+
+ if(autohinter)
+ flags |= FT_LOAD_FORCE_AUTOHINT;
+ FT_Load_Glyph(face, n, flags);
+ FT_Render_Glyph(face->glyph, (distfield ? FT_RENDER_MODE_MONO : FT_RENDER_MODE_NORMAL));
+
+ if(verbose>=2)
+ {
+ printf(" Code point U+%04X", i);
+ if(i>=0x20 && i<0x7F)
+ printf(" (%c)", i);
+ else if(i>=0xA0 && i<=0x10FFFF)
+ {
+ char utf8[5];
+ unsigned bytes;
+
+ for(bytes=2; i>>(1+bytes*5); ++bytes) ;
+ for(j=0; j<bytes; ++j)
+ utf8[j] = 0x80 | ((i>>((bytes-j-1)*6))&0x3F);
+ utf8[0] |= 0xF0<<(4-bytes);
+ utf8[j] = 0;
+
+ printf(" (%s)", utf8);
+ }
+ printf(": glyph %u, size %dx%d\n", n, bmp->width/scale, bmp->rows/scale);
+ }
+
+ if(bmp->pixel_mode!=FT_PIXEL_MODE_GRAY && bmp->pixel_mode!=FT_PIXEL_MODE_MONO)
+ {
+ fprintf(stderr, "Warning: Glyph %u skipped, incompatible pixel mode\n", n);
+ continue;
+ }
+
+ if(font->n_glyphs>=size)
+ {
+ size += 16;
+ font->glyphs = (Glyph *)realloc(font->glyphs, size*sizeof(Glyph));
+ }
+
+ glyph = &font->glyphs[font->n_glyphs++];
+ glyph->index = n;
+ glyph->code = i;
+ glyph->offset_x = (int)(face->glyph->bitmap_left+scale/2)/scale;
+ glyph->offset_y = (int)(face->glyph->bitmap_top-bmp->rows+scale/2)/scale;
+ glyph->advance = (int)(face->glyph->advance.x/scale+32)/64;
+
+ /* Copy the glyph image since FreeType uses a global buffer, which would
+ be overwritten by the next glyph. Negative pitch means the scanlines
+ start from the bottom. */
+ if(distfield)
+ {
+ glyph->offset_x -= border;
+ glyph->offset_y -= border;
+ create_distance_field(bmp, &glyph->image, distfield, border);
+ }
+ else
+ {
+ if(copy_bitmap(bmp, &glyph->image))
+ return -1;
+ }
+ }
+
+ return 0;
+}
+
+int copy_bitmap(const FT_Bitmap *bmp, Image *image)
+{
+ unsigned x, y;
+ unsigned char *src;
+ unsigned char *dst;
+
+ if(init_image(image, bmp->width, bmp->rows))
+ return -1;
+ if(!image->w || !image->h)
+ return 0;
+
+ if(bmp->pitch<0)
+ src = bmp->buffer+(bmp->rows-1)*-bmp->pitch;
+ else
+ src = bmp->buffer;
+ dst = image->data;
+
+ for(y=0; y<bmp->rows; ++y)
+ {
+ if(bmp->pixel_mode==FT_PIXEL_MODE_MONO)
+ {
+ for(x=0; x<bmp->width; ++x)
+ dst[x] = ((src[x/8]&(0x80>>(x%8))) ? 0xFF : 0x00);
+ }
+ else
+ {
+ for(x=0; x<bmp->width; ++x)
+ dst[x] = src[x];
+ }
+
+ src += bmp->pitch;
+ dst += image->w;
+ }
+
+ return 0;
+}
+
+unsigned sqrti(unsigned num)
+{
+ unsigned result = (num>0xFFFF ? 0xFFFF : 0x100);
+ while(result && result*result>=result+num)
+ result -= (result*result+result-num)/(result*2);
+
+ return result;
+}
+
+unsigned find_distance_to_edge(const Image *image, int origin_x, int origin_y, unsigned range)
+{
+ unsigned i, j;
+ int x, y;
+ unsigned char origin_pixel = 0;
+ unsigned closest = range*range;
+
+ if(origin_x>=0 && (unsigned)origin_x<image->w && origin_y>=0 && (unsigned)origin_y<image->h)
+ origin_pixel = image->data[origin_x+origin_y*image->w];
+
+ x = origin_x-1;
+ y = origin_y-1;
+ for(i=1; (i<range && i*i<=closest); ++i, --x, --y) for(j=0; j<4; ++j)
+ {
+ unsigned k;
+ int dx = (j==0 ? 1 : j==2 ? -1 : 0);
+ int dy = (j==1 ? 1 : j==3 ? -1 : 0);
+
+ for(k=0; k<i*2; ++k, x+=dx, y+=dy)
+ {
+ unsigned char pixel = 0;
+ if(x>=0 && (unsigned)x<image->w && y>=0 && (unsigned)y<image->h)
+ pixel = image->data[x+y*image->w];
+
+ if((pixel^origin_pixel)&0x80)
+ {
+ unsigned d = 2*i*i + k*k - 2*k*i;
+ if(d<closest)
+ closest = d;
+ }
+ }
+ }
+
+ return sqrti(closest*0x3F01)/range;
+}
+
+int create_distance_field(const FT_Bitmap *bmp, Image *image, unsigned scale, unsigned margin)
+{
+ unsigned x, y;
+ Image base_image;
+
+ if(init_image(image, (bmp->width+scale-1)/scale+2*margin, (bmp->rows+scale-1)/scale+2*margin))
+ return -1;
+ if(!image->w || !image->h)
+ return 0;
+
+ if(copy_bitmap(bmp, &base_image))
+ return -1;
+
+ image->border = margin;
+ for(y=0; y<image->h; ++y) for(x=0; x<image->w; ++x)
+ {
+ int bx = (x-margin)*scale+scale/2;
+ int by = (y-margin)*scale+scale/2;
+ unsigned char pixel = find_distance_to_edge(&base_image, bx, by, margin*scale);
+ if(bx>=0 && (unsigned)bx<base_image.w && by>=0 && (unsigned)by<base_image.h)
+ pixel |= base_image.data[bx+by*base_image.w]&0x80;
+ if(!(pixel&0x80))
+ pixel = 0x80-pixel;
+ image->data[x+y*image->w] = pixel;
+ }
+
+ free(base_image.data);
+
+ return 0;
+}
+
+int render_grid(Font *font, unsigned cellw, unsigned cellh, unsigned cpl, bool seq)
+{
+ unsigned i;
+ int top = 0, bot = 0;
+ unsigned first, n_cells;
+ unsigned maxw = 0, maxh = 0;
+
+ /* Find extremes of the glyph images. */
+ for(i=0; i<font->n_glyphs; ++i)
+ {
+ int y;
+
+ y = font->glyphs[i].offset_y+font->glyphs[i].image.h;
+ if(y>top)
+ top = y;
+ if(font->glyphs[i].offset_y<bot)
+ bot = font->glyphs[i].offset_y;
+ if(font->glyphs[i].image.w>maxw)
+ maxw = font->glyphs[i].image.w;
+ if(font->glyphs[i].image.h>maxh)
+ maxh = font->glyphs[i].image.h;
+ }
+
+ if(cellw==0)
+ {
+ /* Establish a large enough cell to hold all glyphs in the range. */
+ int square = (cellh==cellw);
+ cellw = maxw;
+ cellh = top-bot;
+ if(square)
+ {
+ if(cellh>cellw)
+ cellw = cellh;
+ else
+ cellh = cellw;
+ }
+ }
+
+ if(verbose>=1)
+ {
+ printf("Max size: %u x %u\n", maxw, maxh);
+ printf("Y range: [%d %d]\n", bot, top);
+ printf("Cell size: %u x %u\n", cellw, cellh);
+ if(maxw>cellw || (unsigned)(top-bot)>cellh)
+ fprintf(stderr, "Warning: character size exceeds cell size\n");
+ }
+
+ if(cpl==0)
+ {
+ /* Determine number of characters per line, trying to fit all the glyphs
+ in a square image. */
+ for(i=1;; i<<=1)
+ {
+ cpl = i/cellw;
+ if(cpl>0 && font->n_glyphs/cpl*cellh<=cpl*cellw)
+ break;
+ }
+ }
+
+ first = font->glyphs[0].code;
+ if(seq)
+ n_cells = font->n_glyphs;
+ else
+ {
+ first -= first%cpl;
+ n_cells = font->glyphs[font->n_glyphs-1].code+1-first;
+ }
+
+ if(init_image(&font->image, cpl*cellw, (n_cells+cpl-1)/cpl*cellh))
+ return -1;
+ memset(font->image.data, 0, font->image.w*font->image.h);
+
+ for(i=0; i<font->n_glyphs; ++i)
+ {
+ Glyph *glyph;
+ unsigned ci, cx, cy;
+ unsigned x, y;
+
+ glyph = &font->glyphs[i];
+
+ if(seq)
+ ci = i;
+ else
+ ci = glyph->code-first;
+
+ cx = (ci%cpl)*cellw;
+ cy = (ci/cpl)*cellh;
+
+ if(cellw>glyph->image.w)
+ cx += (cellw-glyph->image.w)/2;
+ cy += top-glyph->offset_y-glyph->image.h;
+
+ glyph->x = cx;
+ glyph->y = cy;
+
+ for(y=0; y<glyph->image.h; ++y) for(x=0; x<glyph->image.w; ++x)
+ {
+ if(cx+x>=font->image.w || cy+y>=font->image.h)
+ continue;
+ font->image.data[cx+x+(cy+y)*font->image.w] = glyph->image.data[x+y*glyph->image.w];
+ }
+ }
+
+ return 0;
+}
+
+int render_packed(Font *font, unsigned margin, unsigned padding)
+{
+ unsigned i;
+ size_t area = 0;
+ bool *used_glyphs;
+ unsigned *used_pixels;
+ unsigned cx = margin, cy;
+ unsigned used_h = 0;
+
+ /* Compute the total area occupied by glyphs and padding. */
+ for(i=0; i<font->n_glyphs; ++i)
+ {
+ size_t a = area+(font->glyphs[i].image.w+padding)*(font->glyphs[i].image.h+padding);
+ if(a<area)
+ {
+ fprintf(stderr, "Overflow in counting total glyph area\n");
+ return -1;
+ }
+ area = a;
+ }
+
+ /* Find an image size that's approximately square. */
+ for(font->image.w=1;; font->image.w<<=1)
+ {
+ if(font->image.w<=margin*2)
+ continue;
+ font->image.h = area/(font->image.w-margin*2)+margin*2;
+ if(font->image.h<=font->image.w)
+ break;
+ }
+
+ /* Add some extra space to accommodate packing imperfections. */
+ font->image.h = font->image.h*3/2;
+
+ /* Allocate arrays for storing the image and keeping track of used pixels and
+ glyphs. Since glyphs are rectangular and the image is filled starting from
+ the top, it's enough to track the number of used pixels at the top of each
+ column. */
+ if(init_image(&font->image, font->image.w, font->image.h))
+ return -1;
+ memset(font->image.data, 0, font->image.w*font->image.h);
+ used_pixels = (unsigned *)malloc(font->image.w*sizeof(unsigned));
+ memset(used_pixels, 0, font->image.w*sizeof(unsigned));
+ used_glyphs = (bool *)malloc(font->n_glyphs);
+ memset(used_glyphs, 0, font->n_glyphs);
+
+ for(cy=margin; cy+margin<font->image.h;)
+ {
+ unsigned w;
+ unsigned x, y;
+ Glyph *glyph = NULL;
+ unsigned best_score = 0;
+ unsigned target_h = 0;
+
+ /* Find the leftmost free pixel on this row. Also record the lowest
+ extent of glyphs to the left of the free position. */
+ for(; (cx+margin<font->image.w && used_pixels[cx]>cy); ++cx)
+ if(used_pixels[cx]-cy-padding>target_h)
+ target_h = used_pixels[cx]-cy-padding;
+
+ if(cx+margin>=font->image.w)
+ {
+ cx = margin;
+ ++cy;
+ continue;
+ }
+
+ /* Count the free pixel at this position. */
+ for(w=0; (cx+w+margin<font->image.w && used_pixels[cx+w]<=cy); ++w) ;
+
+ /* Find a suitable glyph to put here. */
+ for(i=0; i<font->n_glyphs; ++i)
+ {
+ Glyph *g;
+
+ g = &font->glyphs[i];
+ if(!used_glyphs[i] && g->image.w<=w)
+ {
+ unsigned score;
+
+ /* Prefer glyphs that would reach exactly as low as the ones left
+ of here. This aims to create a straight edge at the bottom for
+ lining up further glyphs. */
+ score = g->image.h+padding;
+ if(g->image.h==target_h)
+ score *= g->image.w;
+ else
+ score += g->image.w;
+
+ if(score>best_score)
+ {
+ glyph = g;
+ best_score = score;
+ }
+ }
+ }
+
+ if(!glyph)
+ {
+ cx += w;
+ continue;
+ }
+
+ used_glyphs[glyph-font->glyphs] = 1;
+ glyph->x = cx;
+ glyph->y = cy;
+
+ for(y=0; y<glyph->image.h; ++y) for(x=0; x<glyph->image.w; ++x)
+ {
+ if(cx+x>=font->image.w || cy+y>=font->image.h)
+ continue;
+ font->image.data[cx+x+(cy+y)*font->image.w] = glyph->image.data[x+y*glyph->image.w];
+ }
+ for(x=0; x<glyph->image.w+2*padding; ++x)
+ {
+ if(cx+x<padding || cx+x>=font->image.w+padding)
+ continue;
+ if(used_pixels[cx+x-padding]<cy+glyph->image.h+padding)
+ used_pixels[cx+x-padding] = cy+glyph->image.h+padding;
+ }
+
+ if(cy+glyph->image.h+margin>used_h)
+ used_h = cy+glyph->image.h+margin;
+ }
+
+ /* Trim the image to the actually used size, in case the original estimate
+ was too pessimistic. */
+ font->image.h = used_h;
+
+ free(used_glyphs);
+ free(used_pixels);
+
+ return 0;
+}
+
+int save_defs(const char *fn, const Font *font)
+{
+ FILE *out;
+ unsigned i;
+
+ out = fopen(fn, "w");