/*

 * Copyright © 2007,2008,2009,2010  Red Hat, Inc.

 * Copyright © 2010,2012,2013  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.

 *

 * Red Hat Author(s): Behdad Esfahbod

 * Google Author(s): Behdad Esfahbod

 */

#ifndef HB_OT_LAYOUT_GSUB_TABLE_HH

#define HB_OT_LAYOUT_GSUB_TABLE_HH

#include "OT/Layout/GSUB/GSUB.hh"

namespace OT {

namespace Layout {

namespace GSUB_impl {

// TODO(garretrieger): Move into the new layout directory.

/* Out-of-class implementation for methods recursing */

#ifndef HB_NO_OT_LAYOUT

/*static*/ inline bool ExtensionSubst::is_reverse () const

{

  return SubstLookup::lookup_type_is_reverse (get_type ());

}

template <typename context_t>

/*static*/ typename context_t::return_t SubstLookup::dispatch_recurse_func (context_t *c, unsigned int lookup_index)

{

  const SubstLookup &l = c->face->table.GSUB.get_relaxed ()->table->get_lookup (lookup_index);

  return l.dispatch (c);

}

/*static*/ typename hb_closure_context_t::return_t SubstLookup::closure_glyphs_recurse_func (hb_closure_context_t *c, unsigned lookup_index, hb_set_t *covered_seq_indices, unsigned seq_index, unsigned end_index)

{

  const SubstLookup &l = c->face->table.GSUB.get_relaxed ()->table->get_lookup (lookup_index);

  if (l.may_have_non_1to1 ())

      hb_set_add_range (covered_seq_indices, seq_index, end_index);

  return l.dispatch (c);

}

template <>

inline hb_closure_lookups_context_t::return_t

SubstLookup::dispatch_recurse_func<hb_closure_lookups_context_t> (hb_closure_lookups_context_t *c, unsigned this_index)

{

  const SubstLookup &l = c->face->table.GSUB.get_relaxed ()->table->get_lookup (this_index);

  return l.closure_lookups (c, this_index);

}

template <>

inline bool SubstLookup::dispatch_recurse_func<hb_ot_apply_context_t> (hb_ot_apply_context_t *c, unsigned int lookup_index)

{

  auto *gsub = c->face->table.GSUB.get_relaxed ();

  const SubstLookup &l = gsub->table->get_lookup (lookup_index);

  unsigned int saved_lookup_props = c->lookup_props;

  unsigned int saved_lookup_index = c->lookup_index;

  c->set_lookup_index (lookup_index);

  c->set_lookup_props (l.get_props ());

  bool ret = false;

  auto *accel = gsub->get_accel (lookup_index);

  ret = accel && accel->apply (c, l.get_subtable_count (), false);

  c->set_lookup_index (saved_lookup_index);

  c->set_lookup_props (saved_lookup_props);

  return ret;

}

#endif

} /* namespace GSUB_impl */

} /* namespace Layout */

} /* namespace OT */

#endif /* HB_OT_LAYOUT_GSUB_TABLE_HH */