Add m-esr52 at 52.6.0

1 files changed, 127 insertions, 0 deletions

diff --git a/gfx/graphite2/src/inc/SegCacheStore.h b/gfx/graphite2/src/inc/SegCacheStore.h
new file mode 100644
index 000000000..1e6a6e216
--- /dev/null
+++ b/gfx/graphite2/src/inc/SegCacheStore.h
@@ -0,0 +1,127 @@
+/*  GRAPHITE2 LICENSING
+
+    Copyright 2010, SIL International
+    All rights reserved.
+
+    This library is free software; you can redistribute it and/or modify
+    it under the terms of the GNU Lesser General Public License as published
+    by the Free Software Foundation; either version 2.1 of License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should also have received a copy of the GNU Lesser General Public
+    License along with this library in the file named "LICENSE".
+    If not, write to the Free Software Foundation, 51 Franklin Street,
+    Suite 500, Boston, MA 02110-1335, USA or visit their web page on the
+    internet at http://www.fsf.org/licenses/lgpl.html.
+
+Alternatively, the contents of this file may be used under the terms of the
+Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public
+License, as published by the Free Software Foundation, either version 2
+of the License or (at your option) any later version.
+*/
+#pragma once
+
+#ifndef GRAPHITE2_NSEGCACHE
+
+#include "inc/Main.h"
+#include "inc/CmapCache.h"
+#include "inc/SegCache.h"
+
+namespace graphite2 {
+
+class SegCache;
+class Face;
+
+class SilfSegCache
+{
+    SilfSegCache(const SilfSegCache &);
+    SilfSegCache & operator = (const SilfSegCache &);
+
+public:
+    SilfSegCache() : m_caches(NULL), m_cacheCount(0) {};
+    ~SilfSegCache()
+    {
+        assert(m_caches == NULL);
+    }
+    void clear(SegCacheStore * cacheStore)
+    {
+        for (size_t i = 0; i < m_cacheCount; i++)
+        {
+            m_caches[i]->clear(cacheStore);
+            delete m_caches[i];
+        }
+        free(m_caches);
+        m_caches = NULL;
+        m_cacheCount = 0;
+    }
+    SegCache * getOrCreate(SegCacheStore * cacheStore, const Features & features)
+    {
+        for (size_t i = 0; i < m_cacheCount; i++)
+        {
+            if (m_caches[i]->features() == features)
+                return m_caches[i];
+        }
+        SegCache ** newData = gralloc<SegCache*>(m_cacheCount+1);
+        if (newData)
+        {
+            if (m_cacheCount > 0)
+            {
+                memcpy(newData, m_caches, sizeof(SegCache*) * m_cacheCount);
+                free(m_caches);
+            }
+            m_caches = newData;
+            m_caches[m_cacheCount] = new SegCache(cacheStore, features);
+            m_cacheCount++;
+            return m_caches[m_cacheCount - 1];
+        }
+        return NULL;
+    }
+    CLASS_NEW_DELETE
+private:
+    SegCache ** m_caches;
+    size_t m_cacheCount;
+};
+
+class SegCacheStore
+{
+    SegCacheStore(const SegCacheStore &);
+    SegCacheStore & operator = (const SegCacheStore &);
+
+public:
+    SegCacheStore(const Face & face, unsigned int numSilf, size_t maxSegments);
+    ~SegCacheStore()
+    {
+        for (size_t i = 0; i < m_numSilf; i++)
+        {
+            m_caches[i].clear(this);
+        }
+        delete [] m_caches;
+        m_caches = NULL;
+    }
+    SegCache * getOrCreate(unsigned int i, const Features & features)
+    {
+        return m_caches[i].getOrCreate(this, features);
+    }
+    bool isSpaceGlyph(uint16 gid) const { return (gid == m_spaceGid) || (gid == m_zwspGid); }
+    uint16 maxCmapGid() const { return m_maxCmapGid; }
+    uint32 maxSegmentCount() const { return m_maxSegments; };
+
+    CLASS_NEW_DELETE
+private:
+    SilfSegCache * m_caches;
+    uint8 m_numSilf;
+    uint32 m_maxSegments;
+    uint16 m_maxCmapGid;
+    uint16 m_spaceGid;
+    uint16 m_zwspGid;
+};
+
+} // namespace graphite2
+
+#endif
+