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
|
// Copyright 2014 PDFium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com
#include "core/fpdfapi/cmaps/cmap_int.h"
#include <algorithm>
#include "core/fpdfapi/cpdf_modulemgr.h"
#include "core/fpdfapi/font/cpdf_fontglobals.h"
#include "core/fpdfapi/page/cpdf_pagemodule.h"
#include "third_party/base/span.h"
namespace {
struct SingleCmap {
uint16_t code;
uint16_t cid;
};
struct RangeCmap {
uint16_t low;
uint16_t high;
uint16_t cid;
};
const FXCMAP_CMap* FindNextCMap(const FXCMAP_CMap* pMap) {
return pMap->m_UseOffset ? pMap + pMap->m_UseOffset : nullptr;
}
} // namespace
const FXCMAP_CMap* FindEmbeddedCMap(const ByteString& bsName,
int charset,
int coding) {
CPDF_FontGlobals* pFontGlobals =
CPDF_ModuleMgr::Get()->GetPageModule()->GetFontGlobals();
pdfium::span<const FXCMAP_CMap> pCMaps =
pFontGlobals->GetEmbeddedCharset(charset);
for (size_t i = 0; i < pCMaps.size(); i++) {
if (bsName == pCMaps[i].m_Name)
return &pCMaps[i];
}
return nullptr;
}
uint16_t CIDFromCharCode(const FXCMAP_CMap* pMap, uint32_t charcode) {
ASSERT(pMap);
const uint16_t loword = static_cast<uint16_t>(charcode);
if (charcode >> 16) {
while (pMap) {
if (pMap->m_pDWordMap) {
const FXCMAP_DWordCIDMap* begin = pMap->m_pDWordMap;
const auto* end = begin + pMap->m_DWordCount;
const auto* found = std::lower_bound(
begin, end, charcode,
[](const FXCMAP_DWordCIDMap& element, uint32_t charcode) {
uint16_t hiword = static_cast<uint16_t>(charcode >> 16);
if (element.m_HiWord != hiword)
return element.m_HiWord < hiword;
return element.m_LoWordHigh < static_cast<uint16_t>(charcode);
});
if (found != end && loword >= found->m_LoWordLow &&
loword <= found->m_LoWordHigh) {
return found->m_CID + loword - found->m_LoWordLow;
}
}
pMap = FindNextCMap(pMap);
}
return 0;
}
while (pMap && pMap->m_pWordMap) {
switch (pMap->m_WordMapType) {
case FXCMAP_CMap::Single: {
const auto* begin =
reinterpret_cast<const SingleCmap*>(pMap->m_pWordMap);
const auto* end = begin + pMap->m_WordCount;
const auto* found = std::lower_bound(
begin, end, loword, [](const SingleCmap& element, uint16_t code) {
return element.code < code;
});
if (found != end && found->code == loword)
return found->cid;
break;
}
case FXCMAP_CMap::Range: {
const auto* begin =
reinterpret_cast<const RangeCmap*>(pMap->m_pWordMap);
const auto* end = begin + pMap->m_WordCount;
const auto* found = std::lower_bound(
begin, end, loword, [](const RangeCmap& element, uint16_t code) {
return element.high < code;
});
if (found != end && loword >= found->low && loword <= found->high)
return found->cid + loword - found->low;
break;
}
default: {
NOTREACHED();
break;
}
}
pMap = FindNextCMap(pMap);
}
return 0;
}
uint32_t CharCodeFromCID(const FXCMAP_CMap* pMap, uint16_t cid) {
// TODO(dsinclair): This should be checking both pMap->m_WordMap and
// pMap->m_DWordMap. There was a second while() but it was never reached as
// the first always returns. Investigate and determine how this should
// really be working. (https://codereview.chromium.org/2235743003 removed the
// second while loop.)
ASSERT(pMap);
while (pMap) {
switch (pMap->m_WordMapType) {
case FXCMAP_CMap::Single: {
const auto* pCur =
reinterpret_cast<const SingleCmap*>(pMap->m_pWordMap);
const auto* pEnd = pCur + pMap->m_WordCount;
while (pCur < pEnd) {
if (pCur->cid == cid)
return pCur->code;
++pCur;
}
break;
}
case FXCMAP_CMap::Range: {
const auto* pCur = reinterpret_cast<const RangeCmap*>(pMap->m_pWordMap);
const auto* pEnd = pCur + pMap->m_WordCount;
while (pCur < pEnd) {
if (cid >= pCur->cid && cid <= pCur->cid + pCur->high - pCur->low)
return pCur->low + cid - pCur->cid;
++pCur;
}
break;
}
default: {
NOTREACHED();
break;
}
}
pMap = FindNextCMap(pMap);
}
return 0;
}
|
