2022-07-27 20:58:41 +02:00
|
|
|
/*
|
|
|
|
* Copyright © 2022 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
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef GRAPH_PAIRPOS_GRAPH_HH
|
|
|
|
#define GRAPH_PAIRPOS_GRAPH_HH
|
|
|
|
|
|
|
|
#include "../OT/Layout/GPOS/PairPos.hh"
|
|
|
|
#include "../OT/Layout/GPOS/PosLookupSubTable.hh"
|
|
|
|
|
|
|
|
namespace graph {
|
|
|
|
|
|
|
|
struct PairPosFormat1 : public OT::Layout::GPOS_impl::PairPosFormat1_3<SmallTypes>
|
|
|
|
{
|
|
|
|
bool split_subtables (gsubgpos_graph_context_t& c, unsigned this_index)
|
|
|
|
{
|
|
|
|
printf("Checking if pair pos %u needs splits...\n", this_index);
|
|
|
|
hb_set_t visited;
|
2022-07-27 21:33:46 +02:00
|
|
|
const unsigned base_size = OT::Layout::GPOS_impl::PairPosFormat1_3<SmallTypes>::min_size;
|
2022-07-27 20:58:41 +02:00
|
|
|
printf(" base_size = %u\n", base_size);
|
|
|
|
unsigned accumulated = base_size;
|
|
|
|
// TODO: include coverage size
|
|
|
|
unsigned num_pair_sets = pairSet.len;
|
|
|
|
printf(" num_pair_sets = %u\n", num_pair_sets);
|
2022-07-27 21:33:46 +02:00
|
|
|
hb_vector_t<unsigned> split_points;
|
2022-07-27 20:58:41 +02:00
|
|
|
for (unsigned i = 0; i < pairSet.len; i++)
|
|
|
|
{
|
|
|
|
unsigned pair_set_index = pair_set_graph_index (c, this_index, i);
|
|
|
|
accumulated += c.graph.find_subgraph_size (pair_set_index, visited);
|
2022-07-27 21:33:46 +02:00
|
|
|
accumulated += SmallTypes::size; // for PairSet offset.
|
2022-07-27 20:58:41 +02:00
|
|
|
|
2022-07-27 21:33:46 +02:00
|
|
|
if (accumulated > (1 << 15)) // TODO (1 << 16)
|
2022-07-27 20:58:41 +02:00
|
|
|
{
|
|
|
|
printf(" PairPos split needed %u/%u\n", i, num_pair_sets);
|
2022-07-27 21:33:46 +02:00
|
|
|
split_points.push (i);
|
2022-07-27 20:58:41 +02:00
|
|
|
accumulated = base_size;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-07-27 21:33:46 +02:00
|
|
|
// TODO: do the split
|
|
|
|
do_split (c, this_index, split_points);
|
|
|
|
|
2022-07-27 20:58:41 +02:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
2022-07-27 21:33:46 +02:00
|
|
|
|
|
|
|
// Split this PairPos into two or more PairPos's. split_points defines
|
|
|
|
// the indices (first index to include in the new table) to split at.
|
|
|
|
// Returns the object id's of the newly created PairPos subtables.
|
|
|
|
hb_vector_t<unsigned> do_split (gsubgpos_graph_context_t& c,
|
|
|
|
unsigned this_index,
|
|
|
|
const hb_vector_t<unsigned> split_points)
|
|
|
|
{
|
|
|
|
hb_vector_t<unsigned> new_objects;
|
|
|
|
if (!split_points)
|
|
|
|
return new_objects;
|
|
|
|
|
|
|
|
for (unsigned i = 0; i < split_points.length; i++)
|
|
|
|
{
|
|
|
|
unsigned start = split_points[i];
|
|
|
|
unsigned end = (i < split_points.length - 1) ? split_points[i + 1] : pairSet.len;
|
|
|
|
new_objects.push (clone_range (c, this_index, start, end));
|
|
|
|
// TODO error checking.
|
|
|
|
}
|
|
|
|
|
|
|
|
shrink (split_points[0]);
|
|
|
|
|
|
|
|
return new_objects;
|
|
|
|
}
|
|
|
|
|
|
|
|
void shrink (unsigned size)
|
|
|
|
{
|
|
|
|
printf(" shrink to [0, %u).\n", size);
|
|
|
|
// TODO
|
|
|
|
}
|
|
|
|
|
|
|
|
// Create a new PairPos including PairSet's from start (inclusive) to end (exclusive).
|
|
|
|
// Returns object id of the new object.
|
|
|
|
unsigned clone_range (gsubgpos_graph_context_t& c,
|
|
|
|
unsigned this_index,
|
|
|
|
unsigned start, unsigned end) const
|
|
|
|
{
|
|
|
|
printf(" cloning range [%u, %u).\n", start, end);
|
|
|
|
// TODO
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2022-07-27 20:58:41 +02:00
|
|
|
unsigned pair_set_graph_index (gsubgpos_graph_context_t& c, unsigned this_index, unsigned i) const
|
|
|
|
{
|
|
|
|
return c.graph.index_for_offset (this_index, &pairSet[i]);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
struct PairPosFormat2 : public OT::Layout::GPOS_impl::PairPosFormat2_4<SmallTypes>
|
|
|
|
{
|
|
|
|
bool split_subtables (gsubgpos_graph_context_t& c, unsigned this_index)
|
|
|
|
{
|
|
|
|
// TODO
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
struct PairPos : public OT::Layout::GPOS_impl::PairPos
|
|
|
|
{
|
|
|
|
bool split_subtables (gsubgpos_graph_context_t& c, unsigned this_index)
|
|
|
|
{
|
|
|
|
unsigned format = u.format;
|
|
|
|
printf("PairPos::format = %u\n", format);
|
|
|
|
switch (u.format) {
|
|
|
|
case 1:
|
|
|
|
return ((PairPosFormat1*)(&u.format1))->split_subtables (c, this_index);
|
|
|
|
case 2:
|
|
|
|
return ((PairPosFormat2*)(&u.format2))->split_subtables (c, this_index);
|
|
|
|
#ifndef HB_NO_BORING_EXPANSION
|
|
|
|
case 3:
|
|
|
|
case 4:
|
|
|
|
// Don't split 24bit PairPos's.
|
|
|
|
#endif
|
|
|
|
default:
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif // GRAPH_PAIRPOS_GRAPH_HH
|