gfx/graphite2/src/inc/Pass.h

Wed, 31 Dec 2014 06:09:35 +0100

author
Michael Schloh von Bennewitz <michael@schloh.com>
date
Wed, 31 Dec 2014 06:09:35 +0100
changeset 0
6474c204b198
permissions
-rw-r--r--

Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.

michael@0 1 /* GRAPHITE2 LICENSING
michael@0 2
michael@0 3 Copyright 2010, SIL International
michael@0 4 All rights reserved.
michael@0 5
michael@0 6 This library is free software; you can redistribute it and/or modify
michael@0 7 it under the terms of the GNU Lesser General Public License as published
michael@0 8 by the Free Software Foundation; either version 2.1 of License, or
michael@0 9 (at your option) any later version.
michael@0 10
michael@0 11 This program is distributed in the hope that it will be useful,
michael@0 12 but WITHOUT ANY WARRANTY; without even the implied warranty of
michael@0 13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
michael@0 14 Lesser General Public License for more details.
michael@0 15
michael@0 16 You should also have received a copy of the GNU Lesser General Public
michael@0 17 License along with this library in the file named "LICENSE".
michael@0 18 If not, write to the Free Software Foundation, 51 Franklin Street,
michael@0 19 Suite 500, Boston, MA 02110-1335, USA or visit their web page on the
michael@0 20 internet at http://www.fsf.org/licenses/lgpl.html.
michael@0 21
michael@0 22 Alternatively, the contents of this file may be used under the terms of the
michael@0 23 Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public
michael@0 24 License, as published by the Free Software Foundation, either version 2
michael@0 25 of the License or (at your option) any later version.
michael@0 26 */
michael@0 27 #pragma once
michael@0 28
michael@0 29 #include <cstdlib>
michael@0 30 #include "inc/Code.h"
michael@0 31
michael@0 32 namespace graphite2 {
michael@0 33
michael@0 34 class Segment;
michael@0 35 class Face;
michael@0 36 class Silf;
michael@0 37 struct Rule;
michael@0 38 struct RuleEntry;
michael@0 39 struct State;
michael@0 40 class FiniteStateMachine;
michael@0 41 class Error;
michael@0 42
michael@0 43 class Pass
michael@0 44 {
michael@0 45 public:
michael@0 46 Pass();
michael@0 47 ~Pass();
michael@0 48
michael@0 49 bool readPass(const byte * pPass, size_t pass_length, size_t subtable_base, Face & face, Error &e);
michael@0 50 void runGraphite(vm::Machine & m, FiniteStateMachine & fsm) const;
michael@0 51 void init(Silf *silf) { m_silf = silf; }
michael@0 52 byte spaceContextuals() const { return (m_flags & 0x0E) >> 1; }
michael@0 53
michael@0 54 CLASS_NEW_DELETE
michael@0 55 private:
michael@0 56 void findNDoRule(Slot* & iSlot, vm::Machine &, FiniteStateMachine& fsm) const;
michael@0 57 int doAction(const vm::Machine::Code* codeptr, Slot * & slot_out, vm::Machine &) const;
michael@0 58 bool testPassConstraint(vm::Machine & m) const;
michael@0 59 bool testConstraint(const Rule & r, vm::Machine &) const;
michael@0 60 bool readRules(const byte * rule_map, const size_t num_entries,
michael@0 61 const byte *precontext, const uint16 * sort_key,
michael@0 62 const uint16 * o_constraint, const byte *constraint_data,
michael@0 63 const uint16 * o_action, const byte * action_data,
michael@0 64 Face &, Error &e);
michael@0 65 bool readStates(const byte * starts, const byte * states, const byte * o_rule_map, Face &, Error &e);
michael@0 66 bool readRanges(const byte * ranges, size_t num_ranges, Error &e);
michael@0 67 uint16 glyphToCol(const uint16 gid) const;
michael@0 68 bool runFSM(FiniteStateMachine & fsm, Slot * slot) const;
michael@0 69 void dumpRuleEventConsidered(const FiniteStateMachine & fsm, const RuleEntry & re) const;
michael@0 70 void dumpRuleEventOutput(const FiniteStateMachine & fsm, const Rule & r, Slot * os) const;
michael@0 71 void adjustSlot(int delta, Slot * & slot_out, SlotMap &) const;
michael@0 72 const Silf* m_silf;
michael@0 73 uint16 * m_cols;
michael@0 74 Rule * m_rules; // rules
michael@0 75 RuleEntry * m_ruleMap;
michael@0 76 uint16 * m_startStates; // prectxt length
michael@0 77 uint16 * m_transitions;
michael@0 78 State * m_states;
michael@0 79
michael@0 80 byte m_flags;
michael@0 81 byte m_iMaxLoop;
michael@0 82 uint16 m_numGlyphs;
michael@0 83 uint16 m_numRules;
michael@0 84 uint16 m_numStates;
michael@0 85 uint16 m_numTransition;
michael@0 86 uint16 m_numSuccess;
michael@0 87 uint16 m_successStart;
michael@0 88 uint16 m_numColumns;
michael@0 89 byte m_minPreCtxt;
michael@0 90 byte m_maxPreCtxt;
michael@0 91 vm::Machine::Code m_cPConstraint;
michael@0 92
michael@0 93 private: //defensive
michael@0 94 Pass(const Pass&);
michael@0 95 Pass& operator=(const Pass&);
michael@0 96 };
michael@0 97
michael@0 98 } // namespace graphite2

mercurial