90 lines
3.1 KiB
C++
90 lines
3.1 KiB
C++
/*
|
|
* Copyright © 2019-2020 Ebrahim Byagowi
|
|
*
|
|
* This is part of HarfBuzz, a text shaping library.
|
|
*
|
|
* Permission is hereby granted, without written agreement and without
|
|
* license or royalty fees, to use, copy, modify, and distribute this
|
|
* software and its documentation for any purpose, provided that the
|
|
* above copyright notice and the following two paragraphs appear in
|
|
* all copies of this software.
|
|
*
|
|
* IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR
|
|
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
|
|
* ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
|
|
* IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
|
|
* DAMAGE.
|
|
*
|
|
* THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
|
|
* BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
|
* FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
|
|
* ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO
|
|
* PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
|
|
*/
|
|
|
|
#include "hb.hh"
|
|
|
|
#ifndef HB_NO_OT_GLYPH
|
|
|
|
#include "hb-ot.h"
|
|
#include "hb-ot-glyf-table.hh"
|
|
#include "hb-ot-cff1-table.hh"
|
|
#include "hb-ot-cff2-table.hh"
|
|
|
|
hb_bool_t
|
|
hb_ot_glyph_decompose (hb_font_t *font, hb_codepoint_t glyph,
|
|
hb_ot_glyph_decompose_funcs_t *funcs,
|
|
void *user_data)
|
|
{
|
|
if (unlikely (!funcs || glyph >= font->face->get_num_glyphs ())) return false;
|
|
|
|
hb_vector_t<hb_position_t> coords;
|
|
hb_vector_t<uint8_t> commands;
|
|
|
|
bool ret = false;
|
|
|
|
if (!ret) ret = font->face->table.glyf->get_path (font, glyph, &coords, &commands);
|
|
#ifndef HB_NO_OT_FONT_CFF
|
|
if (!ret) ret = font->face->table.cff1->get_path (font, glyph, &coords, &commands);
|
|
if (!ret) ret = font->face->table.cff2->get_path (font, glyph, &coords, &commands);
|
|
#endif
|
|
|
|
if (unlikely (!ret || coords.length % 2 != 0)) return false;
|
|
|
|
/* FIXME: We should do all these memory O(1) without hb_vector_t
|
|
by moving the logic to the tables */
|
|
unsigned int coords_idx = 0;
|
|
for (unsigned int i = 0; i < commands.length; ++i)
|
|
switch (commands[i])
|
|
{
|
|
case 'Z': break;
|
|
case 'M':
|
|
if (unlikely (coords.length < coords_idx + 2)) return false;
|
|
funcs->move_to (coords[coords_idx + 0], coords[coords_idx + 1], user_data);
|
|
coords_idx += 2;
|
|
break;
|
|
case 'L':
|
|
if (unlikely (coords.length < coords_idx + 2)) return false;
|
|
funcs->line_to (coords[coords_idx + 0], coords[coords_idx + 1], user_data);
|
|
coords_idx += 2;
|
|
break;
|
|
case 'Q':
|
|
if (unlikely (coords.length < coords_idx + 4)) return false;
|
|
funcs->conic_to (coords[coords_idx + 0], coords[coords_idx + 1],
|
|
coords[coords_idx + 2], coords[coords_idx + 3], user_data);
|
|
coords_idx += 4;
|
|
break;
|
|
case 'C':
|
|
if (unlikely (coords.length >= coords_idx + 6)) return false;
|
|
funcs->cubic_to (coords[coords_idx + 0], coords[coords_idx + 1],
|
|
coords[coords_idx + 2], coords[coords_idx + 3],
|
|
coords[coords_idx + 4], coords[coords_idx + 5], user_data);
|
|
coords_idx += 6;
|
|
break;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
#endif
|