Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2014 PDFium Authors. All rights reserved. | 1 // Copyright 2014 PDFium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 // Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com | 5 // Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com |
| 6 | 6 |
| 7 #include "../../../include/fpdfapi/fpdf_module.h" | 7 #include "../../../include/fpdfapi/fpdf_module.h" |
| 8 #include "../../../include/fpdfapi/fpdf_page.h" | 8 #include "../../../include/fpdfapi/fpdf_page.h" |
| 9 #include "../../../include/fpdfapi/fpdf_resource.h" | 9 #include "../../../include/fpdfapi/fpdf_resource.h" |
| 10 #include "../../../include/fxge/fx_freetype.h" | 10 #include "../../../include/fxge/fx_freetype.h" |
| 11 #include "../../../include/fxge/fx_ge.h" | 11 #include "../../../include/fxge/fx_ge.h" |
| 12 #include "../fpdf_cmaps/cmap_int.h" | 12 #include "../fpdf_cmaps/cmap_int.h" |
| 13 #include "font_int.h" | 13 #include "font_int.h" |
| 14 | 14 |
| 15 extern short TT2PDF(int m, FXFT_Face face); | 15 extern short TT2PDF(int m, FXFT_Face face); |
| 16 extern FX_BOOL FT_UseTTCharmap(FXFT_Face face, | 16 extern FX_BOOL FT_UseTTCharmap(FXFT_Face face, |
| 17 int platform_id, | 17 int platform_id, |
| 18 int encoding_id); | 18 int encoding_id); |
| 19 | 19 |
| 20 CPDF_CMapManager::CPDF_CMapManager() { | 20 CPDF_CMapManager::CPDF_CMapManager() { |
| 21 m_bPrompted = FALSE; | 21 m_bPrompted = FALSE; |
| 22 FXSYS_memset(m_CID2UnicodeMaps, 0, sizeof m_CID2UnicodeMaps); | 22 FXSYS_memset(m_CID2UnicodeMaps, 0, sizeof m_CID2UnicodeMaps); |
| 23 } | 23 } |
| 24 CPDF_CMapManager::~CPDF_CMapManager() { | 24 CPDF_CMapManager::~CPDF_CMapManager() { |
| 25 DropAll(FALSE); | 25 auto it = m_CMaps.begin(); |
| 26 while (it != m_CMaps.end()) { | |
|
Lei Zhang
2015/08/15 00:35:44
Range-Based For Loop?
Tom Sepez
2015/08/17 20:15:25
Done; you're right its probably faster to just cle
| |
| 27 auto temp = it++; | |
| 28 delete temp->second; | |
| 29 m_CMaps.erase(temp); | |
| 30 } | |
| 31 for (int i = 0; i < FX_ArraySize(m_CID2UnicodeMaps); ++i) { | |
| 32 delete m_CID2UnicodeMaps[i]; | |
| 33 } | |
| 26 } | 34 } |
| 27 CPDF_CMap* CPDF_CMapManager::GetPredefinedCMap(const CFX_ByteString& name, | 35 CPDF_CMap* CPDF_CMapManager::GetPredefinedCMap(const CFX_ByteString& name, |
| 28 FX_BOOL bPromptCJK) { | 36 FX_BOOL bPromptCJK) { |
| 29 CPDF_CMap* pCMap; | 37 auto it = m_CMaps.find(name); |
| 30 if (m_CMaps.Lookup(name, (void*&)pCMap)) { | 38 if (it != m_CMaps.end()) { |
| 31 return pCMap; | 39 return it->second; |
| 32 } | 40 } |
| 33 pCMap = LoadPredefinedCMap(name, bPromptCJK); | 41 CPDF_CMap* pCMap = LoadPredefinedCMap(name, bPromptCJK); |
| 34 if (name.IsEmpty()) { | 42 if (!name.IsEmpty()) { |
| 35 return pCMap; | 43 m_CMaps[name] = pCMap; |
| 36 } | 44 } |
| 37 m_CMaps.SetAt(name, pCMap); | |
| 38 return pCMap; | 45 return pCMap; |
| 39 } | 46 } |
| 40 CPDF_CMap* CPDF_CMapManager::LoadPredefinedCMap(const CFX_ByteString& name, | 47 CPDF_CMap* CPDF_CMapManager::LoadPredefinedCMap(const CFX_ByteString& name, |
| 41 FX_BOOL bPromptCJK) { | 48 FX_BOOL bPromptCJK) { |
| 42 CPDF_CMap* pCMap = new CPDF_CMap; | 49 CPDF_CMap* pCMap = new CPDF_CMap; |
| 43 const FX_CHAR* pname = name; | 50 const FX_CHAR* pname = name; |
| 44 if (*pname == '/') { | 51 if (*pname == '/') { |
| 45 pname++; | 52 pname++; |
| 46 } | 53 } |
| 47 pCMap->LoadPredefined(this, pname, bPromptCJK); | 54 pCMap->LoadPredefined(this, pname, bPromptCJK); |
| 48 return pCMap; | 55 return pCMap; |
| 49 } | 56 } |
| 50 static const FX_CHAR* const g_CharsetNames[NUMBER_OF_CIDSETS] = { | 57 static const FX_CHAR* const g_CharsetNames[NUMBER_OF_CIDSETS] = { |
| 51 NULL, "GB1", "CNS1", "Japan1", "Korea1", "UCS"}; | 58 NULL, "GB1", "CNS1", "Japan1", "Korea1", "UCS"}; |
| 52 static const int g_CharsetCPs[NUMBER_OF_CIDSETS] = {0, 936, 950, | 59 static const int g_CharsetCPs[NUMBER_OF_CIDSETS] = {0, 936, 950, |
| 53 932, 949, 1200}; | 60 932, 949, 1200}; |
| 54 int _CharsetFromOrdering(const CFX_ByteString& Ordering) { | 61 int _CharsetFromOrdering(const CFX_ByteString& Ordering) { |
| 55 for (int charset = 1; charset < NUMBER_OF_CIDSETS; charset++) { | 62 for (int charset = 1; charset < NUMBER_OF_CIDSETS; charset++) { |
| 56 if (Ordering == CFX_ByteStringC(g_CharsetNames[charset])) | 63 if (Ordering == CFX_ByteStringC(g_CharsetNames[charset])) |
| 57 return charset; | 64 return charset; |
| 58 } | 65 } |
| 59 return CIDSET_UNKNOWN; | 66 return CIDSET_UNKNOWN; |
| 60 } | 67 } |
| 61 void CPDF_CMapManager::ReloadAll() { | 68 void CPDF_CMapManager::ReloadAll() { |
| 62 DropAll(TRUE); | 69 for (auto it = m_CMaps.begin(); it != m_CMaps.end(); ++it) { |
| 63 } | 70 if (CPDF_CMap* pCMap = it->second) { |
|
Lei Zhang
2015/08/15 00:35:44
This is always true.
Tom Sepez
2015/08/17 20:15:25
Done.
| |
| 64 void CPDF_CMapManager::DropAll(FX_BOOL bReload) { | 71 pCMap->LoadPredefined(this, it->first, FALSE); |
| 65 FX_POSITION pos = m_CMaps.GetStartPosition(); | |
| 66 while (pos) { | |
| 67 CFX_ByteString name; | |
| 68 CPDF_CMap* pCMap; | |
| 69 m_CMaps.GetNextAssoc(pos, name, (void*&)pCMap); | |
| 70 if (pCMap == NULL) { | |
| 71 continue; | |
| 72 } | |
| 73 if (bReload) { | |
| 74 pCMap->LoadPredefined(this, name, FALSE); | |
| 75 } else { | |
| 76 delete pCMap; | |
| 77 } | 72 } |
| 78 } | 73 } |
| 79 for (int i = 0; i < sizeof m_CID2UnicodeMaps / sizeof(CPDF_CID2UnicodeMap*); | 74 for (int i = 0; i < FX_ArraySize(m_CID2UnicodeMaps); ++i) { |
| 80 i++) { | 75 if (CPDF_CID2UnicodeMap* pMap = m_CID2UnicodeMaps[i]) { |
| 81 CPDF_CID2UnicodeMap* pMap = m_CID2UnicodeMaps[i]; | |
| 82 if (pMap == NULL) { | |
| 83 continue; | |
| 84 } | |
| 85 if (bReload) { | |
| 86 pMap->Load(this, i, FALSE); | 76 pMap->Load(this, i, FALSE); |
| 87 } else { | |
| 88 delete pMap; | |
| 89 } | 77 } |
| 90 } | 78 } |
| 91 } | 79 } |
| 92 CPDF_CID2UnicodeMap* CPDF_CMapManager::GetCID2UnicodeMap(int charset, | 80 CPDF_CID2UnicodeMap* CPDF_CMapManager::GetCID2UnicodeMap(int charset, |
| 93 FX_BOOL bPromptCJK) { | 81 FX_BOOL bPromptCJK) { |
| 94 if (m_CID2UnicodeMaps[charset] == NULL) { | 82 if (m_CID2UnicodeMaps[charset] == NULL) { |
| 95 m_CID2UnicodeMaps[charset] = LoadCID2UnicodeMap(charset, bPromptCJK); | 83 m_CID2UnicodeMaps[charset] = LoadCID2UnicodeMap(charset, bPromptCJK); |
| 96 } | 84 } |
| 97 return m_CID2UnicodeMaps[charset]; | 85 return m_CID2UnicodeMaps[charset]; |
| 98 } | 86 } |
| (...skipping 1557 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 1656 if (middlecode > CID) { | 1644 if (middlecode > CID) { |
| 1657 end = middle - 1; | 1645 end = middle - 1; |
| 1658 } else if (middlecode < CID) { | 1646 } else if (middlecode < CID) { |
| 1659 begin = middle + 1; | 1647 begin = middle + 1; |
| 1660 } else { | 1648 } else { |
| 1661 return &Japan1_VertCIDs[middle].a; | 1649 return &Japan1_VertCIDs[middle].a; |
| 1662 } | 1650 } |
| 1663 } | 1651 } |
| 1664 return NULL; | 1652 return NULL; |
| 1665 } | 1653 } |
| OLD | NEW |