gfx/graphite2/src/SegCacheEntry.cpp@6474c204b198 (annotated)
gfx/graphite2/src/SegCacheEntry.cpp
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 | |
| michael@0 | 28 | #ifndef GRAPHITE2_NSEGCACHE |
| michael@0 | 29 | |
| michael@0 | 30 | #include "inc/Main.h" |
| michael@0 | 31 | #include "inc/Slot.h" |
| michael@0 | 32 | #include "inc/Segment.h" |
| michael@0 | 33 | #include "inc/SegCache.h" |
| michael@0 | 34 | #include "inc/SegCacheEntry.h" |
| michael@0 | 35 | |
| michael@0 | 36 | |
| michael@0 | 37 | using namespace graphite2; |
| michael@0 | 38 | |
| michael@0 | 39 | SegCacheEntry::SegCacheEntry(const uint16* cmapGlyphs, size_t length, Segment * seg, size_t charOffset, long long cacheTime) |
| michael@0 | 40 | : m_glyphLength(0), m_unicode(gralloc<uint16>(length)), m_glyph(NULL), |
| michael@0 | 41 | m_attr(NULL), m_justs(NULL), |
| michael@0 | 42 | m_accessCount(0), m_lastAccess(cacheTime) |
| michael@0 | 43 | { |
| michael@0 | 44 | if (m_unicode) |
| michael@0 | 45 | for (uint16 i = 0; i < length; i++) |
| michael@0 | 46 | m_unicode[i] = cmapGlyphs[i]; |
| michael@0 | 47 | |
| michael@0 | 48 | const size_t glyphCount = seg->slotCount(), |
| michael@0 | 49 | sizeof_sjust = SlotJustify::size_of(seg->silf()->numJustLevels()); |
| michael@0 | 50 | if (!glyphCount) return; |
| michael@0 | 51 | size_t num_justs = 0, |
| michael@0 | 52 | justs_pos = 0; |
| michael@0 | 53 | if (seg->hasJustification()) |
| michael@0 | 54 | { |
| michael@0 | 55 | for (const Slot * s = seg->first(); s; s = s->next()) |
| michael@0 | 56 | { |
| michael@0 | 57 | if (s->m_justs == 0) continue; |
| michael@0 | 58 | ++num_justs; |
| michael@0 | 59 | } |
| michael@0 | 60 | m_justs = gralloc<byte>(sizeof_sjust * num_justs); |
| michael@0 | 61 | } |
| michael@0 | 62 | const Slot * slot = seg->first(); |
| michael@0 | 63 | m_glyph = new Slot[glyphCount]; |
| michael@0 | 64 | m_attr = gralloc<int16>(glyphCount * seg->numAttrs()); |
| michael@0 | 65 | if (!m_glyph || (!m_attr && seg->numAttrs())) return; |
| michael@0 | 66 | m_glyphLength = glyphCount; |
| michael@0 | 67 | Slot * slotCopy = m_glyph; |
| michael@0 | 68 | m_glyph->prev(NULL); |
| michael@0 | 69 | |
| michael@0 | 70 | uint16 pos = 0; |
| michael@0 | 71 | while (slot) |
| michael@0 | 72 | { |
| michael@0 | 73 | slotCopy->userAttrs(m_attr + pos * seg->numAttrs()); |
| michael@0 | 74 | slotCopy->m_justs = m_justs ? reinterpret_cast<SlotJustify *>(m_justs + justs_pos++ * sizeof_sjust) : 0; |
| michael@0 | 75 | slotCopy->set(*slot, -static_cast<int32>(charOffset), seg->numAttrs(), seg->silf()->numJustLevels(), length); |
| michael@0 | 76 | slotCopy->index(pos); |
| michael@0 | 77 | if (slot->firstChild()) |
| michael@0 | 78 | slotCopy->m_child = m_glyph + slot->firstChild()->index(); |
| michael@0 | 79 | if (slot->attachedTo()) |
| michael@0 | 80 | slotCopy->attachTo(m_glyph + slot->attachedTo()->index()); |
| michael@0 | 81 | if (slot->nextSibling()) |
| michael@0 | 82 | slotCopy->m_sibling = m_glyph + slot->nextSibling()->index(); |
| michael@0 | 83 | slot = slot->next(); |
| michael@0 | 84 | ++slotCopy; |
| michael@0 | 85 | ++pos; |
| michael@0 | 86 | if (slot) |
| michael@0 | 87 | { |
| michael@0 | 88 | slotCopy->prev(slotCopy-1); |
| michael@0 | 89 | (slotCopy-1)->next(slotCopy); |
| michael@0 | 90 | } |
| michael@0 | 91 | } |
| michael@0 | 92 | } |
| michael@0 | 93 | |
| michael@0 | 94 | |
| michael@0 | 95 | void SegCacheEntry::clear() |
| michael@0 | 96 | { |
| michael@0 | 97 | free(m_unicode); |
| michael@0 | 98 | free(m_attr); |
| michael@0 | 99 | free(m_justs); |
| michael@0 | 100 | delete [] m_glyph; |
| michael@0 | 101 | m_unicode = NULL; |
| michael@0 | 102 | m_glyph = NULL; |
| michael@0 | 103 | m_glyphLength = 0; |
| michael@0 | 104 | m_attr = NULL; |
| michael@0 | 105 | } |
| michael@0 | 106 | |
| michael@0 | 107 | #endif |
| michael@0 | 108 |
