1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2008 by Sun Microsystems, Inc.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_vcl.hxx"
#ifdef WNT
#include <tools/svwin.h>
#include <svsys.h>
#endif
#include <tools/debug.hxx>
#include <vcl/sallayout.hxx>
#include "pregraphitestl.h"
#include <graphite/GrClient.h>
#include <graphite/Segment.h>
#include "postgraphitestl.h"
#include <rtl/ustring.hxx>
#include <vcl/graphite_layout.hxx>
#include <vcl/graphite_cache.hxx>
#include "graphite_textsrc.hxx"
GrSegRecord::GrSegRecord(rtl::OUString * rope, TextSourceAdaptor * textSrc, gr::Segment * seg, bool bIsRtl)
: m_rope(rope), m_text(textSrc), m_seg(seg), m_nextKey(NULL),
m_fontScale(0.0f), mbIsRtl(bIsRtl), m_lockCount(0)
{
m_pStr = textSrc->getLayoutArgs().mpStr + seg->startCharacter();
m_startChar = seg->startCharacter();
}
GrSegRecord::~GrSegRecord()
{
clear();
}
void GrSegRecord::reuse(rtl::OUString * rope, TextSourceAdaptor * textSrc, gr::Segment * seg, bool bIsRtl)
{
clear();
mnWidth = 0;
m_rope = rope;
m_text = textSrc;
m_seg = seg;
m_nextKey = NULL;
m_pStr = textSrc->getLayoutArgs().mpStr + seg->startCharacter();
m_startChar = seg->startCharacter();
mbIsRtl = bIsRtl;
}
void GrSegRecord::clearVectors()
{
mvGlyphs.clear();
mvCharDxs.clear();
mvChar2BaseGlyph.clear();
mvGlyph2Char.clear();
}
void GrSegRecord::clear()
{
#ifdef GR_DEBUG_TEXT
if (m_lockCount != 0)
OutputDebugString("GrSegRecord locked!");
#endif
clearVectors();
delete m_rope;
delete m_seg;
delete m_text;
m_rope = NULL;
m_seg = NULL;
m_text = NULL;
m_fontScale = 0.0f;
m_lockCount = 0;
}
GrSegRecord * GraphiteSegmentCache::cacheSegment(TextSourceAdaptor * adapter, gr::Segment * seg, bool bIsRtl)
{
GrSegRecord * record = NULL;
// We keep a record of the oldest key and the last key added
// when the next key is added, the record for the prevKey's m_nextKey field
// is updated to the newest key so that m_oldestKey can be updated to the
// next oldest key when the record for m_oldestKey is deleted
if (m_segMap.size() > SEG_CACHE_SIZE)
{
GraphiteSegMap::iterator oldestPair = m_segMap.find(reinterpret_cast<long>(m_oldestKey));
// oldest record may no longer exist if a buffer was changed
if (oldestPair != m_segMap.end())
{
record = oldestPair->second;
m_segMap.erase(reinterpret_cast<long>(m_oldestKey));
GrRMEntry range = m_ropeMap.equal_range((*(record->m_rope)).hashCode());
while (range.first != range.second)
{
if (range.first->second == record)
{
m_ropeMap.erase(range.first);
break;
}
++range.first;
}
m_oldestKey = record->m_nextKey;
// record will be reused, so don't delete
}
}
// const int seg_char_limit = min(adapter->maLayoutArgs().mnLength,
// adapter->maLayoutArgs().mnEndCharPos
// + GraphiteLayout::EXTRA_CONTEXT_LENGTH);
// if (seg->stopCharacter() - seg->startCharacter() <= 0)
// OutputDebugString("Invalid seg indices\n");
rtl::OUString * pRope = new rtl::OUString(adapter->getLayoutArgs().mpStr + seg->startCharacter(),
seg->stopCharacter() - seg->startCharacter());
if (!pRope) return NULL;
bool reuse = false;
if (record)
record->reuse(pRope, adapter, seg, bIsRtl);
else
record = new GrSegRecord(pRope, adapter, seg, bIsRtl);
if (!record)
{
delete pRope;
return NULL;
}
GraphiteSegMap::iterator iMap =
m_segMap.find(reinterpret_cast<long>(record->m_pStr));
if (iMap != m_segMap.end())
{
// the buffer has changed, so the old cached Segment is useless
reuse = true;
GrSegRecord * found = iMap->second;
// Note: we reuse the old next key to avoid breaking our history
// chain. This means it will be prematurely deleted, but this is
// unlikely to happen very often.
record->m_nextKey = found->m_nextKey;
// overwrite the old record
m_segMap[reinterpret_cast<long>(record->m_pStr)] = record;
// erase the old rope key and save the new one
GrRMEntry range = m_ropeMap.equal_range((*(found->m_rope)).hashCode());
while (range.first != range.second)
{
if (range.first->second == found)
{
m_ropeMap.erase(range.first);
break;
}
++range.first;
}
GraphiteRopeMap::value_type mapEntry(record->m_rope->hashCode(), record);
m_ropeMap.insert(mapEntry);
// remove the old record
delete found;
record->m_lockCount++;
return record;
}
m_segMap[reinterpret_cast<long>(record->m_pStr)] = record;
GraphiteRopeMap::value_type mapEntry((*(record->m_rope)).hashCode(), record);
m_ropeMap.insert(mapEntry);
if (m_oldestKey == NULL)
{
m_oldestKey = record->m_pStr;
m_prevKey = record->m_pStr;
}
else if (reuse == false)
{
DBG_ASSERT(m_segMap.count(reinterpret_cast<long>(m_prevKey)),
"Previous key got lost somehow!");
m_segMap.find(reinterpret_cast<long>(m_prevKey))
->second->m_nextKey = record->m_pStr;
m_prevKey = record->m_pStr;
}
record->m_lockCount++;
return record;
}
|
