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