| 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_resource.h" | 7 #include "../../../include/fpdfapi/fpdf_resource.h" |
| 8 #include "../../../include/fpdfapi/fpdf_module.h" | 8 #include "../../../include/fpdfapi/fpdf_module.h" |
| 9 #include "../fpdf_font/font_int.h" | 9 #include "../fpdf_font/font_int.h" |
| 10 #include "cmap_int.h" | 10 #include "cmap_int.h" |
| 11 void FPDFAPI_FindEmbeddedCMap(const char* name, int charset, int coding, const F
XCMAP_CMap*& pMap) | 11 void FPDFAPI_FindEmbeddedCMap(const char* name, |
| 12 { | 12 int charset, |
| 13 pMap = NULL; | 13 int coding, |
| 14 CPDF_FontGlobals* pFontGlobals = CPDF_ModuleMgr::Get()->GetPageModule()->Get
FontGlobals(); | 14 const FXCMAP_CMap*& pMap) { |
| 15 const FXCMAP_CMap* pCMaps = pFontGlobals->m_EmbeddedCharsets[charset].m_pMap
List; | 15 pMap = NULL; |
| 16 int nCMaps = pFontGlobals->m_EmbeddedCharsets[charset].m_Count; | 16 CPDF_FontGlobals* pFontGlobals = |
| 17 for (int i = 0; i < nCMaps; i ++) { | 17 CPDF_ModuleMgr::Get()->GetPageModule()->GetFontGlobals(); |
| 18 if (FXSYS_strcmp(name, pCMaps[i].m_Name)) { | 18 const FXCMAP_CMap* pCMaps = |
| 19 continue; | 19 pFontGlobals->m_EmbeddedCharsets[charset].m_pMapList; |
| 20 } | 20 int nCMaps = pFontGlobals->m_EmbeddedCharsets[charset].m_Count; |
| 21 pMap = &pCMaps[i]; | 21 for (int i = 0; i < nCMaps; i++) { |
| 22 break; | 22 if (FXSYS_strcmp(name, pCMaps[i].m_Name)) { |
| 23 continue; |
| 23 } | 24 } |
| 25 pMap = &pCMaps[i]; |
| 26 break; |
| 27 } |
| 24 } | 28 } |
| 25 extern "C" { | 29 extern "C" { |
| 26 static int compareWord(const void* p1, const void* p2) | 30 static int compareWord(const void* p1, const void* p2) { |
| 27 { | 31 return (*(FX_WORD*)p1) - (*(FX_WORD*)p2); |
| 28 return (*(FX_WORD*)p1) - (*(FX_WORD*)p2); | 32 } |
| 29 } | |
| 30 }; | 33 }; |
| 31 extern "C" { | 34 extern "C" { |
| 32 static int compareWordRange(const void* key, const void* element) | 35 static int compareWordRange(const void* key, const void* element) { |
| 33 { | 36 if (*(FX_WORD*)key < *(FX_WORD*)element) { |
| 34 if (*(FX_WORD*)key < * (FX_WORD*)element) { | 37 return -1; |
| 35 return -1; | 38 } |
| 36 } | 39 if (*(FX_WORD*)key > ((FX_WORD*)element)[1]) { |
| 37 if (*(FX_WORD*)key > ((FX_WORD*)element)[1]) { | 40 return 1; |
| 38 return 1; | 41 } |
| 39 } | 42 return 0; |
| 40 return 0; | 43 } |
| 41 } | |
| 42 }; | 44 }; |
| 43 extern "C" { | 45 extern "C" { |
| 44 static int compareDWordRange(const void* p1, const void* p2) | 46 static int compareDWordRange(const void* p1, const void* p2) { |
| 45 { | 47 FX_DWORD key = *(FX_DWORD*)p1; |
| 46 FX_DWORD key = *(FX_DWORD*)p1; | 48 FX_WORD hiword = (FX_WORD)(key >> 16); |
| 47 FX_WORD hiword = (FX_WORD)(key >> 16); | 49 FX_WORD* element = (FX_WORD*)p2; |
| 48 FX_WORD* element = (FX_WORD*)p2; | 50 if (hiword < element[0]) { |
| 49 if (hiword < element[0]) { | 51 return -1; |
| 50 return -1; | 52 } |
| 51 } | 53 if (hiword > element[0]) { |
| 52 if (hiword > element[0]) { | 54 return 1; |
| 53 return 1; | 55 } |
| 54 } | 56 FX_WORD loword = (FX_WORD)key; |
| 55 FX_WORD loword = (FX_WORD)key; | 57 if (loword < element[1]) { |
| 56 if (loword < element[1]) { | 58 return -1; |
| 57 return -1; | 59 } |
| 58 } | 60 if (loword > element[2]) { |
| 59 if (loword > element[2]) { | 61 return 1; |
| 60 return 1; | 62 } |
| 61 } | 63 return 0; |
| 62 return 0; | 64 } |
| 63 } | |
| 64 }; | 65 }; |
| 65 extern "C" { | 66 extern "C" { |
| 66 static int compareDWordSingle(const void* p1, const void* p2) | 67 static int compareDWordSingle(const void* p1, const void* p2) { |
| 67 { | 68 FX_DWORD key = *(FX_DWORD*)p1; |
| 68 FX_DWORD key = *(FX_DWORD*)p1; | 69 FX_DWORD value = ((*(FX_WORD*)p2) << 16) | ((FX_WORD*)p2)[1]; |
| 69 FX_DWORD value = ((*(FX_WORD*)p2) << 16) | ((FX_WORD*)p2)[1]; | 70 if (key < value) { |
| 70 if (key < value) { | 71 return -1; |
| 71 return -1; | 72 } |
| 73 if (key > value) { |
| 74 return 1; |
| 75 } |
| 76 return 0; |
| 77 } |
| 78 }; |
| 79 FX_WORD FPDFAPI_CIDFromCharCode(const FXCMAP_CMap* pMap, FX_DWORD charcode) { |
| 80 if (charcode >> 16) { |
| 81 while (1) { |
| 82 if (pMap->m_DWordMapType == FXCMAP_CMap::Range) { |
| 83 FX_WORD* found = |
| 84 (FX_WORD*)FXSYS_bsearch(&charcode, pMap->m_pDWordMap, |
| 85 pMap->m_DWordCount, 8, compareDWordRange); |
| 86 if (found) { |
| 87 return found[3] + (FX_WORD)charcode - found[1]; |
| 72 } | 88 } |
| 73 if (key > value) { | 89 } else if (pMap->m_DWordMapType == FXCMAP_CMap::Single) { |
| 74 return 1; | 90 FX_WORD* found = |
| 91 (FX_WORD*)FXSYS_bsearch(&charcode, pMap->m_pDWordMap, |
| 92 pMap->m_DWordCount, 6, compareDWordSingle); |
| 93 if (found) { |
| 94 return found[2]; |
| 75 } | 95 } |
| 96 } |
| 97 if (pMap->m_UseOffset == 0) { |
| 76 return 0; | 98 return 0; |
| 77 } | 99 } |
| 78 }; | 100 pMap = pMap + pMap->m_UseOffset; |
| 79 FX_WORD FPDFAPI_CIDFromCharCode(const FXCMAP_CMap* pMap, FX_DWORD charcode) | |
| 80 { | |
| 81 if (charcode >> 16) { | |
| 82 while (1) { | |
| 83 if (pMap->m_DWordMapType == FXCMAP_CMap::Range) { | |
| 84 FX_WORD* found = (FX_WORD*)FXSYS_bsearch(&charcode, pMap->m_pDWo
rdMap, pMap->m_DWordCount, 8, compareDWordRange); | |
| 85 if (found) { | |
| 86 return found[3] + (FX_WORD)charcode - found[1]; | |
| 87 } | |
| 88 } else if (pMap->m_DWordMapType == FXCMAP_CMap::Single) { | |
| 89 FX_WORD* found = (FX_WORD*)FXSYS_bsearch(&charcode, pMap->m_pDWo
rdMap, pMap->m_DWordCount, 6, compareDWordSingle); | |
| 90 if (found) { | |
| 91 return found[2]; | |
| 92 } | |
| 93 } | |
| 94 if (pMap->m_UseOffset == 0) { | |
| 95 return 0; | |
| 96 } | |
| 97 pMap = pMap + pMap->m_UseOffset; | |
| 98 } | |
| 99 return 0; | |
| 100 } | |
| 101 FX_WORD code = (FX_WORD)charcode; | |
| 102 while (1) { | |
| 103 if (pMap->m_pWordMap == NULL) { | |
| 104 return 0; | |
| 105 } | |
| 106 if (pMap->m_WordMapType == FXCMAP_CMap::Single) { | |
| 107 FX_WORD* found = (FX_WORD*)FXSYS_bsearch(&code, pMap->m_pWordMap, pM
ap->m_WordCount, 4, compareWord); | |
| 108 if (found) { | |
| 109 return found[1]; | |
| 110 } | |
| 111 } else if (pMap->m_WordMapType == FXCMAP_CMap::Range) { | |
| 112 FX_WORD* found = (FX_WORD*)FXSYS_bsearch(&code, pMap->m_pWordMap, pM
ap->m_WordCount, 6, compareWordRange); | |
| 113 if (found) { | |
| 114 return found[2] + code - found[0]; | |
| 115 } | |
| 116 } | |
| 117 if (pMap->m_UseOffset == 0) { | |
| 118 return 0; | |
| 119 } | |
| 120 pMap = pMap + pMap->m_UseOffset; | |
| 121 } | 101 } |
| 122 return 0; | 102 return 0; |
| 103 } |
| 104 FX_WORD code = (FX_WORD)charcode; |
| 105 while (1) { |
| 106 if (pMap->m_pWordMap == NULL) { |
| 107 return 0; |
| 108 } |
| 109 if (pMap->m_WordMapType == FXCMAP_CMap::Single) { |
| 110 FX_WORD* found = (FX_WORD*)FXSYS_bsearch( |
| 111 &code, pMap->m_pWordMap, pMap->m_WordCount, 4, compareWord); |
| 112 if (found) { |
| 113 return found[1]; |
| 114 } |
| 115 } else if (pMap->m_WordMapType == FXCMAP_CMap::Range) { |
| 116 FX_WORD* found = (FX_WORD*)FXSYS_bsearch( |
| 117 &code, pMap->m_pWordMap, pMap->m_WordCount, 6, compareWordRange); |
| 118 if (found) { |
| 119 return found[2] + code - found[0]; |
| 120 } |
| 121 } |
| 122 if (pMap->m_UseOffset == 0) { |
| 123 return 0; |
| 124 } |
| 125 pMap = pMap + pMap->m_UseOffset; |
| 126 } |
| 127 return 0; |
| 123 } | 128 } |
| 124 FX_DWORD FPDFAPI_CharCodeFromCID(const FXCMAP_CMap* pMap, FX_WORD cid) | 129 FX_DWORD FPDFAPI_CharCodeFromCID(const FXCMAP_CMap* pMap, FX_WORD cid) { |
| 125 { | 130 while (1) { |
| 126 while (1) { | 131 if (pMap->m_WordMapType == FXCMAP_CMap::Single) { |
| 127 if (pMap->m_WordMapType == FXCMAP_CMap::Single) { | 132 const FX_WORD* pCur = pMap->m_pWordMap; |
| 128 const FX_WORD *pCur = pMap->m_pWordMap; | 133 const FX_WORD* pEnd = pMap->m_pWordMap + pMap->m_WordCount * 2; |
| 129 const FX_WORD *pEnd = pMap->m_pWordMap + pMap->m_WordCount * 2; | 134 while (pCur < pEnd) { |
| 130 while (pCur < pEnd) { | 135 if (pCur[1] == cid) { |
| 131 if (pCur[1] == cid) { | 136 return pCur[0]; |
| 132 return pCur[0]; | |
| 133 } | |
| 134 pCur += 2; | |
| 135 } | |
| 136 } else if (pMap->m_WordMapType == FXCMAP_CMap::Range) { | |
| 137 const FX_WORD *pCur = pMap->m_pWordMap; | |
| 138 const FX_WORD *pEnd = pMap->m_pWordMap + pMap->m_WordCount * 3; | |
| 139 while (pCur < pEnd) { | |
| 140 if (cid >= pCur[2] && cid <= pCur[2] + pCur[1] - pCur[0]) { | |
| 141 return pCur[0] + cid - pCur[2]; | |
| 142 } | |
| 143 pCur += 3; | |
| 144 } | |
| 145 } | 137 } |
| 146 if (pMap->m_UseOffset == 0) { | 138 pCur += 2; |
| 147 return 0; | 139 } |
| 140 } else if (pMap->m_WordMapType == FXCMAP_CMap::Range) { |
| 141 const FX_WORD* pCur = pMap->m_pWordMap; |
| 142 const FX_WORD* pEnd = pMap->m_pWordMap + pMap->m_WordCount * 3; |
| 143 while (pCur < pEnd) { |
| 144 if (cid >= pCur[2] && cid <= pCur[2] + pCur[1] - pCur[0]) { |
| 145 return pCur[0] + cid - pCur[2]; |
| 148 } | 146 } |
| 149 pMap = pMap + pMap->m_UseOffset; | 147 pCur += 3; |
| 148 } |
| 150 } | 149 } |
| 151 while (1) { | 150 if (pMap->m_UseOffset == 0) { |
| 152 if (pMap->m_DWordMapType == FXCMAP_CMap::Range) { | 151 return 0; |
| 153 const FX_WORD *pCur = pMap->m_pDWordMap; | 152 } |
| 154 const FX_WORD *pEnd = pMap->m_pDWordMap + pMap->m_DWordCount * 4; | 153 pMap = pMap + pMap->m_UseOffset; |
| 155 while (pCur < pEnd) { | 154 } |
| 156 if (cid >= pCur[3] && cid <= pCur[3] + pCur[2] - pCur[1]) { | 155 while (1) { |
| 157 return (((FX_DWORD)pCur[0] << 16) | pCur[1]) + cid - pCur[3]
; | 156 if (pMap->m_DWordMapType == FXCMAP_CMap::Range) { |
| 158 } | 157 const FX_WORD* pCur = pMap->m_pDWordMap; |
| 159 pCur += 4; | 158 const FX_WORD* pEnd = pMap->m_pDWordMap + pMap->m_DWordCount * 4; |
| 160 } | 159 while (pCur < pEnd) { |
| 161 } else if (pMap->m_DWordMapType == FXCMAP_CMap::Single) { | 160 if (cid >= pCur[3] && cid <= pCur[3] + pCur[2] - pCur[1]) { |
| 162 const FX_WORD *pCur = pMap->m_pDWordMap; | 161 return (((FX_DWORD)pCur[0] << 16) | pCur[1]) + cid - pCur[3]; |
| 163 const FX_WORD *pEnd = pMap->m_pDWordMap + pMap->m_DWordCount * 3; | |
| 164 while (pCur < pEnd) { | |
| 165 if (pCur[2] == cid) { | |
| 166 return ((FX_DWORD)pCur[0] << 16) | pCur[1]; | |
| 167 } | |
| 168 pCur += 3; | |
| 169 } | |
| 170 } | 162 } |
| 171 if (pMap->m_UseOffset == 0) { | 163 pCur += 4; |
| 172 return 0; | 164 } |
| 165 } else if (pMap->m_DWordMapType == FXCMAP_CMap::Single) { |
| 166 const FX_WORD* pCur = pMap->m_pDWordMap; |
| 167 const FX_WORD* pEnd = pMap->m_pDWordMap + pMap->m_DWordCount * 3; |
| 168 while (pCur < pEnd) { |
| 169 if (pCur[2] == cid) { |
| 170 return ((FX_DWORD)pCur[0] << 16) | pCur[1]; |
| 173 } | 171 } |
| 174 pMap = pMap + pMap->m_UseOffset; | 172 pCur += 3; |
| 173 } |
| 175 } | 174 } |
| 176 return 0; | 175 if (pMap->m_UseOffset == 0) { |
| 176 return 0; |
| 177 } |
| 178 pMap = pMap + pMap->m_UseOffset; |
| 179 } |
| 180 return 0; |
| 177 } | 181 } |
| 178 void FPDFAPI_LoadCID2UnicodeMap(int charset, const FX_WORD*& pMap, FX_DWORD& cou
nt) | 182 void FPDFAPI_LoadCID2UnicodeMap(int charset, |
| 179 { | 183 const FX_WORD*& pMap, |
| 180 CPDF_FontGlobals* pFontGlobals = CPDF_ModuleMgr::Get()->GetPageModule()->Get
FontGlobals(); | 184 FX_DWORD& count) { |
| 181 pMap = pFontGlobals->m_EmbeddedToUnicodes[charset].m_pMap; | 185 CPDF_FontGlobals* pFontGlobals = |
| 182 count = pFontGlobals->m_EmbeddedToUnicodes[charset].m_Count; | 186 CPDF_ModuleMgr::Get()->GetPageModule()->GetFontGlobals(); |
| 187 pMap = pFontGlobals->m_EmbeddedToUnicodes[charset].m_pMap; |
| 188 count = pFontGlobals->m_EmbeddedToUnicodes[charset].m_Count; |
| 183 } | 189 } |
| OLD | NEW |