2022-08-02 22:58:35 +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
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "graph.hh"
|
|
|
|
#include "../hb-ot-layout-common.hh"
|
|
|
|
|
|
|
|
#ifndef GRAPH_CLASSDEF_GRAPH_HH
|
|
|
|
#define GRAPH_CLASSDEF_GRAPH_HH
|
|
|
|
|
|
|
|
namespace graph {
|
|
|
|
|
|
|
|
struct ClassDefFormat1 : public OT::ClassDefFormat1_3<SmallTypes>
|
|
|
|
{
|
|
|
|
bool sanitize (graph_t::vertex_t& vertex) const
|
|
|
|
{
|
|
|
|
int64_t vertex_len = vertex.obj.tail - vertex.obj.head;
|
|
|
|
constexpr unsigned min_size = OT::ClassDefFormat1_3<SmallTypes>::min_size;
|
|
|
|
if (vertex_len < min_size) return false;
|
|
|
|
return vertex_len >= min_size + classValue.get_size () - classValue.len.get_size ();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
struct ClassDefFormat2 : public OT::ClassDefFormat2_4<SmallTypes>
|
|
|
|
{
|
|
|
|
bool sanitize (graph_t::vertex_t& vertex) const
|
|
|
|
{
|
|
|
|
int64_t vertex_len = vertex.obj.tail - vertex.obj.head;
|
|
|
|
constexpr unsigned min_size = OT::ClassDefFormat2_4<SmallTypes>::min_size;
|
|
|
|
if (vertex_len < min_size) return false;
|
|
|
|
return vertex_len >= min_size + rangeRecord.get_size () - rangeRecord.len.get_size ();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
struct ClassDef : public OT::ClassDef
|
|
|
|
{
|
|
|
|
template<typename It>
|
2022-08-04 21:21:16 +02:00
|
|
|
static bool add_class_def (gsubgpos_graph_context_t& c,
|
|
|
|
unsigned parent_id,
|
|
|
|
unsigned link_position,
|
|
|
|
It glyph_and_class,
|
|
|
|
unsigned max_size)
|
2022-08-02 22:58:35 +02:00
|
|
|
{
|
|
|
|
unsigned class_def_prime_id = c.graph.new_node (nullptr, nullptr);
|
|
|
|
auto& class_def_prime_vertex = c.graph.vertices_[class_def_prime_id];
|
2022-08-04 21:21:16 +02:00
|
|
|
if (!make_class_def (c, glyph_and_class, class_def_prime_id, max_size))
|
2022-08-02 22:58:35 +02:00
|
|
|
return false;
|
|
|
|
|
2022-08-04 21:21:16 +02:00
|
|
|
auto* class_def_link = c.graph.vertices_[parent_id].obj.real_links.push ();
|
2022-08-02 22:58:35 +02:00
|
|
|
class_def_link->width = SmallTypes::size;
|
|
|
|
class_def_link->objidx = class_def_prime_id;
|
|
|
|
class_def_link->position = link_position;
|
2022-08-04 21:21:16 +02:00
|
|
|
class_def_prime_vertex.parents.push (parent_id);
|
2022-08-02 22:58:35 +02:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename It>
|
|
|
|
static bool make_class_def (gsubgpos_graph_context_t& c,
|
|
|
|
It glyph_and_class,
|
|
|
|
unsigned dest_obj,
|
|
|
|
unsigned max_size)
|
|
|
|
{
|
|
|
|
char* buffer = (char*) hb_calloc (1, max_size);
|
|
|
|
hb_serialize_context_t serializer (buffer, max_size);
|
2022-08-02 23:04:38 +02:00
|
|
|
OT::ClassDef_serialize (&serializer, glyph_and_class);
|
2022-08-02 22:58:35 +02:00
|
|
|
serializer.end_serialize ();
|
|
|
|
if (serializer.in_error ())
|
|
|
|
{
|
|
|
|
hb_free (buffer);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
hb_bytes_t class_def_copy = serializer.copy_bytes ();
|
|
|
|
c.add_buffer ((char *) class_def_copy.arrayZ); // Give ownership to the context, it will cleanup the buffer.
|
|
|
|
|
|
|
|
auto& obj = c.graph.vertices_[dest_obj].obj;
|
|
|
|
obj.head = (char *) class_def_copy.arrayZ;
|
|
|
|
obj.tail = obj.head + class_def_copy.length;
|
|
|
|
|
|
|
|
hb_free (buffer);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool sanitize (graph_t::vertex_t& vertex) const
|
|
|
|
{
|
|
|
|
int64_t vertex_len = vertex.obj.tail - vertex.obj.head;
|
|
|
|
if (vertex_len < OT::ClassDef::min_size) return false;
|
|
|
|
switch (u.format)
|
|
|
|
{
|
|
|
|
case 1: return ((ClassDefFormat1*)this)->sanitize (vertex);
|
|
|
|
case 2: return ((ClassDefFormat2*)this)->sanitize (vertex);
|
|
|
|
#ifndef HB_NO_BORING_EXPANSION
|
|
|
|
// Not currently supported
|
|
|
|
case 3:
|
|
|
|
case 4:
|
|
|
|
#endif
|
|
|
|
default: return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif // GRAPH_CLASSDEF_GRAPH_HH
|