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
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <svl/inethist.hxx>
#include <algorithm>
#include <string.h>
#include <boost/noncopyable.hpp>
#include <rtl/instance.hxx>
#include <rtl/crc.h>
#include <osl/diagnose.h>
#include <osl/getglobalmutex.hxx>
#include <tools/solar.h>
#include <tools/debug.hxx>
#include <tools/urlobj.hxx>
/*
* INetURLHistory internals.
*/
#define INETHIST_DEF_FTP_PORT 21
#define INETHIST_DEF_HTTP_PORT 80
#define INETHIST_DEF_HTTPS_PORT 443
#define INETHIST_SIZE_LIMIT 1024
#define INETHIST_MAGIC_HEAD 0x484D4849UL
class INetURLHistory_Impl: private boost::noncopyable
{
struct head_entry
{
/** Representation.
*/
sal_uInt32 m_nMagic;
sal_uInt16 m_nNext;
sal_uInt16 m_nMBZ;
/** Initialization.
*/
void initialize()
{
m_nMagic = INETHIST_MAGIC_HEAD;
m_nNext = 0;
m_nMBZ = 0;
}
};
struct hash_entry
{
/** Representation.
*/
sal_uInt32 m_nHash;
sal_uInt16 m_nLru;
sal_uInt16 m_nMBZ;
/** Initialization.
*/
void initialize (sal_uInt16 nLru)
{
m_nHash = 0;
m_nLru = nLru;
m_nMBZ = 0;
}
/** Comparison.
*/
bool operator== (sal_uInt32 nHash) const
{
return (m_nHash == nHash);
}
bool operator< (sal_uInt32 nHash) const
{
return (m_nHash < nHash);
}
};
struct lru_entry
{
/** Representation.
*/
sal_uInt32 m_nHash;
sal_uInt16 m_nNext;
sal_uInt16 m_nPrev;
/** Initialization.
*/
void initialize (sal_uInt16 nThis)
{
m_nHash = 0;
m_nNext = nThis;
m_nPrev = nThis;
}
};
/** Representation.
*/
head_entry m_aHead;
hash_entry m_pHash[INETHIST_SIZE_LIMIT];
lru_entry m_pList[INETHIST_SIZE_LIMIT];
/** Initialization.
*/
void initialize();
static sal_uInt16 capacity()
{
return (sal_uInt16)(INETHIST_SIZE_LIMIT);
}
static sal_uInt32 crc32 (OUString const & rData)
{
return rtl_crc32 (0, rData.getStr(), rData.getLength() * sizeof(sal_Unicode));
}
sal_uInt16 find (sal_uInt32 nHash) const;
void move (sal_uInt16 nSI, sal_uInt16 nDI);
void backlink (sal_uInt16 nThis, sal_uInt16 nTail)
{
lru_entry &rThis = m_pList[nThis];
lru_entry &rTail = m_pList[nTail];
rTail.m_nNext = nThis;
rTail.m_nPrev = rThis.m_nPrev;
rThis.m_nPrev = nTail;
m_pList[rTail.m_nPrev].m_nNext = nTail;
}
void unlink (sal_uInt16 nThis)
{
lru_entry &rThis = m_pList[nThis];
m_pList[rThis.m_nPrev].m_nNext = rThis.m_nNext;
m_pList[rThis.m_nNext].m_nPrev = rThis.m_nPrev;
rThis.m_nNext = nThis;
rThis.m_nPrev = nThis;
}
public:
INetURLHistory_Impl();
~INetURLHistory_Impl();
/** putUrl/queryUrl.
*/
void putUrl (const OUString &rUrl);
bool queryUrl (const OUString &rUrl);
};
INetURLHistory_Impl::INetURLHistory_Impl()
{
initialize();
}
INetURLHistory_Impl::~INetURLHistory_Impl()
{
}
void INetURLHistory_Impl::initialize()
{
m_aHead.initialize();
sal_uInt16 i, n = capacity();
for (i = 0; i < n; i++)
m_pHash[i].initialize(i);
for (i = 0; i < n; i++)
m_pList[i].initialize(i);
for (i = 1; i < n; i++)
backlink (m_aHead.m_nNext, i);
}
sal_uInt16 INetURLHistory_Impl::find (sal_uInt32 nHash) const
{
sal_uInt16 l = 0;
sal_uInt16 r = capacity() - 1;
sal_uInt16 c = capacity();
while ((l < r) && (r < c))
{
sal_uInt16 m = (l + r) / 2;
if (m_pHash[m] == nHash)
return m;
if (m_pHash[m] < nHash)
l = m + 1;
else
r = m - 1;
}
return l;
}
void INetURLHistory_Impl::move (sal_uInt16 nSI, sal_uInt16 nDI)
{
hash_entry e = m_pHash[nSI];
if (nSI < nDI)
{
// shift left.
memmove (
&m_pHash[nSI ],
&m_pHash[nSI + 1],
(nDI - nSI) * sizeof(hash_entry));
}
if (nSI > nDI)
{
// shift right.
memmove (
&m_pHash[nDI + 1],
&m_pHash[nDI ],
(nSI - nDI) * sizeof(hash_entry));
}
m_pHash[nDI] = e;
}
void INetURLHistory_Impl::putUrl (const OUString &rUrl)
{
sal_uInt32 h = crc32 (rUrl);
sal_uInt16 k = find (h);
if ((k < capacity()) && (m_pHash[k] == h))
{
// Cache hit.
sal_uInt16 nMRU = m_pHash[k].m_nLru;
if (nMRU != m_aHead.m_nNext)
{
// Update LRU chain.
unlink (nMRU);
backlink (m_aHead.m_nNext, nMRU);
// Rotate LRU chain.
m_aHead.m_nNext = m_pList[m_aHead.m_nNext].m_nPrev;
}
}
else
{
// Cache miss. Obtain least recently used.
sal_uInt16 nLRU = m_pList[m_aHead.m_nNext].m_nPrev;
sal_uInt16 nSI = find (m_pList[nLRU].m_nHash);
if (!(nLRU == m_pHash[nSI].m_nLru))
{
// Update LRU chain.
nLRU = m_pHash[nSI].m_nLru;
unlink (nLRU);
backlink (m_aHead.m_nNext, nLRU);
}
// Rotate LRU chain.
m_aHead.m_nNext = m_pList[m_aHead.m_nNext].m_nPrev;
// Check source and destination.
sal_uInt16 nDI = std::min (k, sal_uInt16(capacity() - 1));
if (nSI < nDI)
{
if (!(m_pHash[nDI] < h))
nDI -= 1;
}
if (nDI < nSI)
{
if (m_pHash[nDI] < h)
nDI += 1;
}
// Assign data.
m_pList[m_aHead.m_nNext].m_nHash = m_pHash[nSI].m_nHash = h;
move (nSI, nDI);
}
}
bool INetURLHistory_Impl::queryUrl (const OUString &rUrl)
{
sal_uInt32 h = crc32 (rUrl);
sal_uInt16 k = find (h);
if ((k < capacity()) && (m_pHash[k] == h))
{
// Cache hit.
return true;
}
else
{
// Cache miss.
return false;
}
}
/*
* INetURLHistory::StaticInstance implementation.
*/
INetURLHistory * INetURLHistory::StaticInstance::operator ()()
{
static INetURLHistory g_aInstance;
return &g_aInstance;
}
INetURLHistory::INetURLHistory() : m_pImpl (new INetURLHistory_Impl())
{
}
INetURLHistory::~INetURLHistory()
{
}
/*
* GetOrCreate.
*/
INetURLHistory* INetURLHistory::GetOrCreate()
{
return rtl_Instance<
INetURLHistory, StaticInstance,
osl::MutexGuard, osl::GetGlobalMutex >::create (
StaticInstance(), osl::GetGlobalMutex());
}
void INetURLHistory::NormalizeUrl_Impl (INetURLObject &rUrl)
{
switch (rUrl.GetProtocol())
{
case INetProtocol::File:
if (!INetURLObject::IsCaseSensitive())
{
OUString aPath (rUrl.GetURLPath(INetURLObject::NO_DECODE).toAsciiLowerCase());
rUrl.SetURLPath (aPath, INetURLObject::NOT_CANONIC);
}
break;
case INetProtocol::Ftp:
if (!rUrl.HasPort())
rUrl.SetPort (INETHIST_DEF_FTP_PORT);
break;
case INetProtocol::Http:
if (!rUrl.HasPort())
rUrl.SetPort (INETHIST_DEF_HTTP_PORT);
if (!rUrl.HasURLPath())
rUrl.SetURLPath("/");
break;
case INetProtocol::Https:
if (!rUrl.HasPort())
rUrl.SetPort (INETHIST_DEF_HTTPS_PORT);
if (!rUrl.HasURLPath())
rUrl.SetURLPath("/");
break;
default:
break;
}
}
void INetURLHistory::PutUrl_Impl (const INetURLObject &rUrl)
{
DBG_ASSERT (m_pImpl, "PutUrl_Impl(): no Implementation");
if (m_pImpl)
{
INetURLObject aHistUrl (rUrl);
NormalizeUrl_Impl (aHistUrl);
m_pImpl->putUrl (aHistUrl.GetMainURL(INetURLObject::NO_DECODE));
Broadcast (INetURLHistoryHint (&rUrl));
if (aHistUrl.HasMark())
{
aHistUrl.SetURL (aHistUrl.GetURLNoMark(INetURLObject::NO_DECODE),
INetURLObject::NOT_CANONIC);
m_pImpl->putUrl (aHistUrl.GetMainURL(INetURLObject::NO_DECODE));
Broadcast (INetURLHistoryHint (&aHistUrl));
}
}
}
bool INetURLHistory::QueryUrl_Impl (const INetURLObject &rUrl)
{
DBG_ASSERT (m_pImpl, "QueryUrl_Impl(): no Implementation");
if (m_pImpl)
{
INetURLObject aHistUrl (rUrl);
NormalizeUrl_Impl (aHistUrl);
return m_pImpl->queryUrl (aHistUrl.GetMainURL(INetURLObject::NO_DECODE));
}
return false;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|