hb-subset-cff-common.hh 6.7 KB
Newer Older
M
Michiharu Ariza 已提交
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
/*
 * Copyright © 2018 Adobe Systems Incorporated.
 *
 *  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.
 *
 * Adobe Author(s): Michiharu Ariza
 */

M
Michiharu Ariza 已提交
27 28
#ifndef HB_SUBSET_CFF_COMMON_HH
#define HB_SUBSET_CFF_COMMON_HH
M
Michiharu Ariza 已提交
29

30
#include "hb.hh"
M
Michiharu Ariza 已提交
31 32

#include "hb-subset-plan.hh"
33
#include "hb-cff-interp-cs-common.hh"
M
Michiharu Ariza 已提交
34 35 36

namespace CFF {

M
Michiharu Ariza 已提交
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
/* Used for writing a temporary charstring */
struct ByteStrBuff : hb_vector_t<char, 1>
{
  inline bool encode_byte (unsigned char b)
  {
    return (push ((const char)b) != &Crap(char));
  }

  inline bool encode_num (const Number& n)
  {
    if (n.in_int_range ())
    {
      int v = n.to_int ();
      if ((-1131 <= v) && (v <= 1131))
      {
        if ((-107 <= v) && (v <= 107))
          return encode_byte (v + 139);
        else if (v > 0)
        {
          v -= 108;
          return encode_byte ((v >> 8) + OpCode_TwoBytePosInt0) && encode_byte (v & 0xFF);
        }
        else
        {
          v = -v - 108;
          return encode_byte ((v >> 8) + OpCode_TwoByteNegInt0) && encode_byte (v & 0xFF);
        }
      }
      assert ((v & ~0xFFFF) == 0);
      return encode_byte (OpCode_shortint) &&
             encode_byte ((v >> 8) & 0xFF) &&
             encode_byte (v & 0xFF);
    }
    else
    {
      int32_t v = n.to_fixed ();
      return encode_byte (OpCode_fixedcs) &&
             encode_byte ((v >> 24) & 0xFF) &&
             encode_byte ((v >> 16) & 0xFF) &&
             encode_byte ((v >> 8) & 0xFF) &&
             encode_byte (v & 0xFF);
    }
  }

  inline bool encode_op (OpCode op)
  {
    if (Is_OpCode_ESC (op))
      return encode_byte (OpCode_escape) &&
             encode_byte (Unmake_OpCode_ESC (op));
    else
      return encode_byte (op);
  }
};

struct ByteStrBuffArray : hb_vector_t<ByteStrBuff, 1>
{
  inline void fini (void)
  {
    for (unsigned int i = 0; i < len; i++)
      hb_vector_t<ByteStrBuff, 1>::operator[] (i).fini ();
    hb_vector_t<ByteStrBuff, 1>::fini ();
  }
};


template <typename ACCESSOR, typename ENV, typename OPSET>
struct SubrFlattener
{
  inline SubrFlattener (const ACCESSOR &acc_, const hb_vector_t<hb_codepoint_t> &glyphs_)
    : acc (acc_),
      glyphs (glyphs_)
  {}

  inline bool flatten (ByteStrBuffArray &flat_charstrings)
  {
    if (!flat_charstrings.resize (glyphs.len))
      return false;
    for (unsigned int i = 0; i < glyphs.len; i++)
      flat_charstrings[i].init ();
    for (unsigned int i = 0; i < glyphs.len; i++)
    {
      hb_codepoint_t  glyph = glyphs[i];
      const ByteStr str = (*acc.charStrings)[glyph];
      unsigned int fd = acc.fdSelect->get_fd (glyph);
      CSInterpreter<ENV, OPSET, ByteStrBuff> interp;
      interp.env.init (str, *acc.globalSubrs, *acc.privateDicts[fd].localSubrs);
      if (unlikely (!interp.interpret (flat_charstrings[i])))
        return false;
    }
    return true;
  }
  
  const ACCESSOR &acc;
  const hb_vector_t<hb_codepoint_t> &glyphs;
};

M
Michiharu Ariza 已提交
133 134
struct SubrRefMaps
{
M
Michiharu Ariza 已提交
135
  inline void init (void)
M
Michiharu Ariza 已提交
136
  {
M
Michiharu Ariza 已提交
137 138
    valid = false;
    global_map = nullptr;
M
Michiharu Ariza 已提交
139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211
    local_maps.init ();
  }

  inline void init (unsigned int fd_count)
  {
    valid = true;
    global_map = hb_set_create ();
    if (global_map == hb_set_get_empty ())
      valid = false;
    if (!local_maps.resize (fd_count))
      valid = false;

    for (unsigned int i = 0; i < local_maps.len; i++)
    {
      local_maps[i] = hb_set_create ();
      if (local_maps[i] == hb_set_get_empty ())
        valid = false;
    }
  }

  inline void fini (void)
  {
    hb_set_destroy (global_map);
    for (unsigned int i = 0; i < local_maps.len; i++)
      hb_set_destroy (local_maps[i]);
    local_maps.fini ();
  }

  bool is_valid (void) const { return valid; }
  bool  valid;
  hb_set_t  *global_map;
  hb_vector_t<hb_set_t *> local_maps;
};

struct SubrRefMapPair
{
  inline void init (void) {}

  hb_set_t  *global_map;
  hb_set_t  *local_map;
};

template <typename ACCESSOR, typename ENV, typename OPSET>
struct SubrSubsetter
{
  inline SubrSubsetter (const ACCESSOR &acc_, const hb_vector_t<hb_codepoint_t> &glyphs_)
    : acc (acc_),
      glyphs (glyphs_)
  {}
  
  bool collect_refs (SubrRefMaps& refmaps /*OUT*/)
  {
    refmaps.init (acc.fdCount);
    if (unlikely (!refmaps.valid)) return false;
    for (unsigned int i = 0; i < glyphs.len; i++)
    {
      hb_codepoint_t  glyph = glyphs[i];
      const ByteStr str = (*acc.charStrings)[glyph];
      unsigned int fd = acc.fdSelect->get_fd (glyph);
      SubrRefMapPair  pair = { refmaps.global_map, refmaps.local_maps[fd] };
      CSInterpreter<ENV, OPSET, SubrRefMapPair> interp;
      interp.env.init (str, *acc.globalSubrs, *acc.privateDicts[fd].localSubrs);
      if (unlikely (!interp.interpret (pair)))
        return false;
    }
    return true;
  }

  const ACCESSOR &acc;
  const hb_vector_t<hb_codepoint_t> &glyphs;
};

};  /* namespace CFF */
M
Michiharu Ariza 已提交
212 213 214 215

HB_INTERNAL bool
hb_plan_subset_cff_fdselect (const hb_vector_t<hb_codepoint_t> &glyphs,
                            unsigned int fdCount,
M
Michiharu Ariza 已提交
216
                            const CFF::FDSelect &src, /* IN */
M
Michiharu Ariza 已提交
217 218 219 220
                            unsigned int &subset_fd_count /* OUT */,
                            unsigned int &subst_fdselect_size /* OUT */,
                            unsigned int &subst_fdselect_format /* OUT */,
                            hb_vector_t<hb_codepoint_t> &subst_first_glyphs /* OUT */,
221
                            CFF::FDMap &fdmap /* OUT */);
M
Michiharu Ariza 已提交
222 223 224 225

HB_INTERNAL bool
hb_serialize_cff_fdselect (hb_serialize_context_t *c,
                          const hb_vector_t<hb_codepoint_t> &glyphs,
M
Michiharu Ariza 已提交
226
                          const CFF::FDSelect &src,
M
Michiharu Ariza 已提交
227 228 229 230
                          unsigned int fd_count,
                          unsigned int fdselect_format,
                          unsigned int size,
                          const hb_vector_t<hb_codepoint_t> &first_glyphs,
231
                          const CFF::FDMap &fdmap);
M
Michiharu Ariza 已提交
232

M
Michiharu Ariza 已提交
233
#endif /* HB_SUBSET_CFF_COMMON_HH */