2020-08-11 11:10:23 +02:00
|
|
|
/*
|
|
|
|
* Copyright © 2018 Google, Inc.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* Google Author(s): Garret Rieger, Roderick Sheeter
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef HB_SUBSET_PLAN_HH
|
|
|
|
#define HB_SUBSET_PLAN_HH
|
|
|
|
|
|
|
|
#include "hb.hh"
|
|
|
|
|
|
|
|
#include "hb-subset.h"
|
|
|
|
#include "hb-subset-input.hh"
|
2022-10-21 09:36:19 +02:00
|
|
|
#include "hb-subset-accelerator.hh"
|
2020-08-11 11:10:23 +02:00
|
|
|
|
|
|
|
#include "hb-map.hh"
|
2022-09-17 22:19:11 +02:00
|
|
|
#include "hb-bimap.hh"
|
2020-08-11 11:10:23 +02:00
|
|
|
#include "hb-set.hh"
|
|
|
|
|
2022-10-21 09:36:19 +02:00
|
|
|
namespace OT {
|
|
|
|
struct Feature;
|
|
|
|
}
|
|
|
|
|
2023-02-13 10:44:33 +01:00
|
|
|
struct head_maxp_info_t
|
|
|
|
{
|
|
|
|
head_maxp_info_t ()
|
|
|
|
:xMin (0x7FFF), xMax (-0x7FFF), yMin (0x7FFF), yMax (-0x7FFF),
|
|
|
|
maxPoints (0), maxContours (0),
|
|
|
|
maxCompositePoints (0),
|
|
|
|
maxCompositeContours (0),
|
|
|
|
maxComponentElements (0),
|
|
|
|
maxComponentDepth (0),
|
|
|
|
allXMinIsLsb (true) {}
|
|
|
|
|
|
|
|
int xMin;
|
|
|
|
int xMax;
|
|
|
|
int yMin;
|
|
|
|
int yMax;
|
|
|
|
unsigned maxPoints;
|
|
|
|
unsigned maxContours;
|
|
|
|
unsigned maxCompositePoints;
|
|
|
|
unsigned maxCompositeContours;
|
|
|
|
unsigned maxComponentElements;
|
|
|
|
unsigned maxComponentDepth;
|
|
|
|
bool allXMinIsLsb;
|
|
|
|
};
|
|
|
|
|
|
|
|
typedef struct head_maxp_info_t head_maxp_info_t;
|
|
|
|
|
2020-08-11 11:10:23 +02:00
|
|
|
struct hb_subset_plan_t
|
|
|
|
{
|
2023-02-13 10:44:33 +01:00
|
|
|
HB_INTERNAL hb_subset_plan_t (hb_face_t *,
|
|
|
|
const hb_subset_input_t *input);
|
2022-09-17 22:19:11 +02:00
|
|
|
|
|
|
|
~hb_subset_plan_t()
|
|
|
|
{
|
|
|
|
hb_face_destroy (source);
|
|
|
|
hb_face_destroy (dest);
|
2023-02-13 10:44:33 +01:00
|
|
|
|
2022-09-17 22:19:11 +02:00
|
|
|
hb_map_destroy (codepoint_to_glyph);
|
|
|
|
hb_map_destroy (glyph_map);
|
|
|
|
hb_map_destroy (reverse_glyph_map);
|
|
|
|
|
2022-12-16 23:19:09 +01:00
|
|
|
#ifdef HB_EXPERIMENTAL_API
|
2023-02-13 10:44:33 +01:00
|
|
|
for (auto _ : name_table_overrides)
|
|
|
|
_.second.fini ();
|
2022-12-16 23:19:09 +01:00
|
|
|
#endif
|
|
|
|
|
|
|
|
if (inprogress_accelerator)
|
|
|
|
hb_subset_accelerator_t::destroy ((void*) inprogress_accelerator);
|
2022-09-17 22:19:11 +02:00
|
|
|
}
|
|
|
|
|
2020-08-11 11:10:23 +02:00
|
|
|
hb_object_header_t header;
|
|
|
|
|
2021-09-19 22:31:36 +02:00
|
|
|
bool successful;
|
|
|
|
unsigned flags;
|
2022-10-21 09:36:19 +02:00
|
|
|
bool attach_accelerator_data = false;
|
2022-12-16 23:19:09 +01:00
|
|
|
bool force_long_loca = false;
|
2020-08-11 11:10:23 +02:00
|
|
|
|
|
|
|
// The glyph subset
|
2023-02-13 10:44:33 +01:00
|
|
|
hb_map_t *codepoint_to_glyph; // Needs to be heap-allocated
|
2020-08-11 11:10:23 +02:00
|
|
|
|
|
|
|
// Old -> New glyph id mapping
|
2023-02-13 10:44:33 +01:00
|
|
|
hb_map_t *glyph_map; // Needs to be heap-allocated
|
|
|
|
hb_map_t *reverse_glyph_map; // Needs to be heap-allocated
|
2020-08-11 11:10:23 +02:00
|
|
|
|
|
|
|
// Plan is only good for a specific source/dest so keep them with it
|
|
|
|
hb_face_t *source;
|
|
|
|
hb_face_t *dest;
|
|
|
|
|
|
|
|
unsigned int _num_output_glyphs;
|
2023-05-23 02:05:01 +02:00
|
|
|
|
2022-07-24 22:05:03 +02:00
|
|
|
bool all_axes_pinned;
|
2022-09-17 22:19:11 +02:00
|
|
|
bool pinned_at_default;
|
2022-12-16 23:19:09 +01:00
|
|
|
bool has_seac;
|
2022-09-17 22:19:11 +02:00
|
|
|
|
2023-05-23 02:05:01 +02:00
|
|
|
#define HB_SUBSET_PLAN_MEMBER(Type, Name) Type Name;
|
|
|
|
#include "hb-subset-plan-member-list.hh"
|
|
|
|
#undef HB_SUBSET_PLAN_MEMBER
|
2023-02-13 10:44:33 +01:00
|
|
|
|
|
|
|
//recalculated head/maxp table info after instancing
|
|
|
|
mutable head_maxp_info_t head_maxp_info;
|
2022-07-24 22:05:03 +02:00
|
|
|
|
2022-10-21 09:36:19 +02:00
|
|
|
const hb_subset_accelerator_t* accelerator;
|
2022-12-16 23:19:09 +01:00
|
|
|
hb_subset_accelerator_t* inprogress_accelerator;
|
2022-10-21 09:36:19 +02:00
|
|
|
|
2020-08-11 11:10:23 +02:00
|
|
|
public:
|
|
|
|
|
2022-07-24 22:05:03 +02:00
|
|
|
template<typename T>
|
|
|
|
hb_blob_ptr_t<T> source_table()
|
|
|
|
{
|
2023-05-23 02:05:01 +02:00
|
|
|
hb_lock_t lock (accelerator ? &accelerator->sanitized_table_cache_lock : nullptr);
|
2022-12-16 23:19:09 +01:00
|
|
|
|
2023-02-13 10:44:33 +01:00
|
|
|
auto *cache = accelerator ? &accelerator->sanitized_table_cache : &sanitized_table_cache;
|
2022-12-16 23:19:09 +01:00
|
|
|
if (cache
|
|
|
|
&& !cache->in_error ()
|
|
|
|
&& cache->has (+T::tableTag)) {
|
|
|
|
return hb_blob_reference (cache->get (+T::tableTag).get ());
|
2022-07-24 22:05:03 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
hb::unique_ptr<hb_blob_t> table_blob {hb_sanitize_context_t ().reference_table<T> (source)};
|
|
|
|
hb_blob_t* ret = hb_blob_reference (table_blob.get ());
|
|
|
|
|
2022-12-16 23:19:09 +01:00
|
|
|
if (likely (cache))
|
|
|
|
cache->set (+T::tableTag, std::move (table_blob));
|
2022-07-24 22:05:03 +02:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2020-08-11 11:10:23 +02:00
|
|
|
bool in_error () const { return !successful; }
|
|
|
|
|
|
|
|
bool check_success(bool success)
|
|
|
|
{
|
|
|
|
successful = (successful && success);
|
|
|
|
return successful;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The set of input glyph ids which will be retained in the subset.
|
|
|
|
* Does NOT include ids kept due to retain_gids. You probably want to use
|
|
|
|
* glyph_map/reverse_glyph_map.
|
|
|
|
*/
|
|
|
|
inline const hb_set_t *
|
|
|
|
glyphset () const
|
|
|
|
{
|
2023-02-13 10:44:33 +01:00
|
|
|
return &_glyphset;
|
2020-08-11 11:10:23 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The set of input glyph ids which will be retained in the subset.
|
|
|
|
*/
|
|
|
|
inline const hb_set_t *
|
|
|
|
glyphset_gsub () const
|
|
|
|
{
|
2023-02-13 10:44:33 +01:00
|
|
|
return &_glyphset_gsub;
|
2020-08-11 11:10:23 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The total number of output glyphs in the final subset.
|
|
|
|
*/
|
|
|
|
inline unsigned int
|
|
|
|
num_output_glyphs () const
|
|
|
|
{
|
|
|
|
return _num_output_glyphs;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Given an output gid , returns true if that glyph id is an empty
|
|
|
|
* glyph (ie. it's a gid that we are dropping all data for).
|
|
|
|
*/
|
|
|
|
inline bool is_empty_glyph (hb_codepoint_t gid) const
|
|
|
|
{
|
2023-02-13 10:44:33 +01:00
|
|
|
return !_glyphset.has (gid);
|
2020-08-11 11:10:23 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
inline bool new_gid_for_codepoint (hb_codepoint_t codepoint,
|
|
|
|
hb_codepoint_t *new_gid) const
|
|
|
|
{
|
|
|
|
hb_codepoint_t old_gid = codepoint_to_glyph->get (codepoint);
|
|
|
|
if (old_gid == HB_MAP_VALUE_INVALID)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return new_gid_for_old_gid (old_gid, new_gid);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool new_gid_for_old_gid (hb_codepoint_t old_gid,
|
|
|
|
hb_codepoint_t *new_gid) const
|
|
|
|
{
|
|
|
|
hb_codepoint_t gid = glyph_map->get (old_gid);
|
|
|
|
if (gid == HB_MAP_VALUE_INVALID)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
*new_gid = gid;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool old_gid_for_new_gid (hb_codepoint_t new_gid,
|
|
|
|
hb_codepoint_t *old_gid) const
|
|
|
|
{
|
|
|
|
hb_codepoint_t gid = reverse_glyph_map->get (new_gid);
|
|
|
|
if (gid == HB_MAP_VALUE_INVALID)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
*old_gid = gid;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool
|
|
|
|
add_table (hb_tag_t tag,
|
|
|
|
hb_blob_t *contents)
|
|
|
|
{
|
2021-03-16 18:56:39 +01:00
|
|
|
if (HB_DEBUG_SUBSET)
|
|
|
|
{
|
|
|
|
hb_blob_t *source_blob = source->reference_table (tag);
|
2023-02-13 10:44:33 +01:00
|
|
|
DEBUG_MSG(SUBSET, nullptr, "add table %c%c%c%c, dest %u bytes, source %u bytes",
|
2021-03-16 18:56:39 +01:00
|
|
|
HB_UNTAG(tag),
|
|
|
|
hb_blob_get_length (contents),
|
|
|
|
hb_blob_get_length (source_blob));
|
|
|
|
hb_blob_destroy (source_blob);
|
|
|
|
}
|
2020-08-11 11:10:23 +02:00
|
|
|
return hb_face_builder_add_table (dest, tag, contents);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
#endif /* HB_SUBSET_PLAN_HH */
|