From 116934fbf0f866176ca6e2360f10134c1da4eea7 Mon Sep 17 00:00:00 2001 From: Peter Breitenlohner Date: Thu, 7 Mar 2013 14:35:38 +0000 Subject: graphite2 1.2.1 git-svn-id: svn://tug.org/texlive/trunk@29306 c570f23f-e606-0410-a88d-b1316a301751 --- Build/source/libs/graphite2/ChangeLog | 5 + Build/source/libs/graphite2/configure | 24 +- .../graphite2/graphite2-1.2.0-PATCHES/ChangeLog | 14 - .../graphite2/graphite2-1.2.0-PATCHES/TL-Changes | 10 - .../patch-01-case-sensitive | 14 - .../graphite2-1.2.0-PATCHES/patch-02-attribute-hot | 14 - .../graphite2/graphite2-1.2.0/.hg_archival.txt | 5 - Build/source/libs/graphite2/graphite2-1.2.0/.hgeol | 15 - .../libs/graphite2/graphite2-1.2.0/.hgignore | 34 - .../source/libs/graphite2/graphite2-1.2.0/.hgtags | 27 - .../libs/graphite2/graphite2-1.2.0/CMakeLists.txt | 73 - .../source/libs/graphite2/graphite2-1.2.0/COPYING | 26 - .../libs/graphite2/graphite2-1.2.0/ChangeLog | 89 - .../libs/graphite2/graphite2-1.2.0/Graphite.cmake | 99 - .../source/libs/graphite2/graphite2-1.2.0/LICENSE | 510 ----- .../source/libs/graphite2/graphite2-1.2.0/Todo.txt | 9 - .../libs/graphite2/graphite2-1.2.0/graphite2.pc.in | 7 - .../graphite2-1.2.0/include/graphite2/Font.h | 389 ---- .../graphite2-1.2.0/include/graphite2/Log.h | 85 - .../graphite2-1.2.0/include/graphite2/Segment.h | 400 ---- .../graphite2-1.2.0/include/graphite2/Types.h | 69 - .../libs/graphite2/graphite2-1.2.0/src/Bidi.cpp | 578 ------ .../graphite2/graphite2-1.2.0/src/CMakeLists.txt | 139 -- .../graphite2/graphite2-1.2.0/src/CachedFace.cpp | 127 -- .../graphite2/graphite2-1.2.0/src/CmapCache.cpp | 152 -- .../libs/graphite2/graphite2-1.2.0/src/Code.cpp | 609 ------ .../libs/graphite2/graphite2-1.2.0/src/Face.cpp | 254 --- .../graphite2/graphite2-1.2.0/src/FeatureMap.cpp | 279 --- .../graphite2/graphite2-1.2.0/src/FileFace.cpp | 118 -- .../libs/graphite2/graphite2-1.2.0/src/Font.cpp | 62 - .../graphite2/graphite2-1.2.0/src/GlyphCache.cpp | 344 ---- .../graphite2/graphite2-1.2.0/src/GlyphFace.cpp | 48 - .../graphite2/graphite2-1.2.0/src/Justifier.cpp | 267 --- .../graphite2/graphite2-1.2.0/src/NameTable.cpp | 222 --- .../libs/graphite2/graphite2-1.2.0/src/Pass.cpp | 586 ------ .../libs/graphite2/graphite2-1.2.0/src/Rule.cpp | 31 - .../graphite2/graphite2-1.2.0/src/SegCache.cpp | 224 --- .../graphite2-1.2.0/src/SegCacheEntry.cpp | 106 -- .../graphite2-1.2.0/src/SegCacheStore.cpp | 47 - .../libs/graphite2/graphite2-1.2.0/src/Segment.cpp | 453 ----- .../libs/graphite2/graphite2-1.2.0/src/Silf.cpp | 385 ---- .../libs/graphite2/graphite2-1.2.0/src/Slot.cpp | 388 ---- .../libs/graphite2/graphite2-1.2.0/src/Sparse.cpp | 59 - .../libs/graphite2/graphite2-1.2.0/src/TtfUtil.cpp | 1982 -------------------- .../graphite2/graphite2-1.2.0/src/UtfCodec.cpp | 45 - .../graphite2/graphite2-1.2.0/src/call_machine.cpp | 135 -- .../graphite2-1.2.0/src/direct_machine.cpp | 117 -- .../libs/graphite2/graphite2-1.2.0/src/files.mk | 115 -- .../graphite2/graphite2-1.2.0/src/gr_char_info.cpp | 65 - .../libs/graphite2/graphite2-1.2.0/src/gr_face.cpp | 255 --- .../graphite2/graphite2-1.2.0/src/gr_features.cpp | 138 -- .../libs/graphite2/graphite2-1.2.0/src/gr_font.cpp | 72 - .../graphite2/graphite2-1.2.0/src/gr_logging.cpp | 193 -- .../graphite2/graphite2-1.2.0/src/gr_segment.cpp | 174 -- .../libs/graphite2/graphite2-1.2.0/src/gr_slot.cpp | 173 -- .../graphite2/graphite2-1.2.0/src/inc/CachedFace.h | 56 - .../graphite2/graphite2-1.2.0/src/inc/CharInfo.h | 67 - .../graphite2/graphite2-1.2.0/src/inc/CmapCache.h | 82 - .../libs/graphite2/graphite2-1.2.0/src/inc/Code.h | 175 -- .../graphite2/graphite2-1.2.0/src/inc/Endian.h | 107 -- .../libs/graphite2/graphite2-1.2.0/src/inc/Face.h | 206 -- .../graphite2/graphite2-1.2.0/src/inc/FeatureMap.h | 187 -- .../graphite2/graphite2-1.2.0/src/inc/FeatureVal.h | 68 - .../graphite2/graphite2-1.2.0/src/inc/FileFace.h | 80 - .../libs/graphite2/graphite2-1.2.0/src/inc/Font.h | 89 - .../graphite2/graphite2-1.2.0/src/inc/GlyphCache.h | 93 - .../graphite2/graphite2-1.2.0/src/inc/GlyphFace.h | 83 - .../libs/graphite2/graphite2-1.2.0/src/inc/List.h | 155 -- .../graphite2/graphite2-1.2.0/src/inc/Machine.h | 197 -- .../libs/graphite2/graphite2-1.2.0/src/inc/Main.h | 75 - .../graphite2/graphite2-1.2.0/src/inc/NameTable.h | 65 - .../libs/graphite2/graphite2-1.2.0/src/inc/Pass.h | 97 - .../graphite2/graphite2-1.2.0/src/inc/Position.h | 59 - .../libs/graphite2/graphite2-1.2.0/src/inc/Rule.h | 307 --- .../graphite2/graphite2-1.2.0/src/inc/SegCache.h | 320 ---- .../graphite2-1.2.0/src/inc/SegCacheEntry.h | 121 -- .../graphite2-1.2.0/src/inc/SegCacheStore.h | 127 -- .../graphite2/graphite2-1.2.0/src/inc/Segment.h | 270 --- .../libs/graphite2/graphite2-1.2.0/src/inc/Silf.h | 126 -- .../libs/graphite2/graphite2-1.2.0/src/inc/Slot.h | 167 -- .../graphite2/graphite2-1.2.0/src/inc/Sparse.h | 147 -- .../graphite2/graphite2-1.2.0/src/inc/TtfTypes.h | 419 ----- .../graphite2/graphite2-1.2.0/src/inc/TtfUtil.h | 206 -- .../graphite2/graphite2-1.2.0/src/inc/UtfCodec.h | 207 -- .../libs/graphite2/graphite2-1.2.0/src/inc/bits.h | 87 - .../libs/graphite2/graphite2-1.2.0/src/inc/debug.h | 78 - .../libs/graphite2/graphite2-1.2.0/src/inc/json.h | 165 -- .../graphite2-1.2.0/src/inc/locale2lcid.h | 444 ----- .../graphite2-1.2.0/src/inc/opcode_table.h | 120 -- .../graphite2/graphite2-1.2.0/src/inc/opcodes.h | 644 ------- .../libs/graphite2/graphite2-1.2.0/src/json.cpp | 126 -- .../graphite2/graphite2-1.2.1-PATCHES/ChangeLog | 22 + .../graphite2/graphite2-1.2.1-PATCHES/TL-Changes | 10 + .../patch-01-case-sensitive | 14 + .../graphite2/graphite2-1.2.1/.hg_archival.txt | 4 + Build/source/libs/graphite2/graphite2-1.2.1/.hgeol | 15 + .../libs/graphite2/graphite2-1.2.1/.hgignore | 34 + .../source/libs/graphite2/graphite2-1.2.1/.hgtags | 27 + .../libs/graphite2/graphite2-1.2.1/CMakeLists.txt | 73 + .../source/libs/graphite2/graphite2-1.2.1/COPYING | 26 + .../libs/graphite2/graphite2-1.2.1/ChangeLog | 96 + .../libs/graphite2/graphite2-1.2.1/Graphite.cmake | 104 + .../source/libs/graphite2/graphite2-1.2.1/LICENSE | 510 +++++ .../source/libs/graphite2/graphite2-1.2.1/Todo.txt | 9 + .../libs/graphite2/graphite2-1.2.1/graphite2.pc.in | 7 + .../graphite2-1.2.1/include/graphite2/Font.h | 389 ++++ .../graphite2-1.2.1/include/graphite2/Log.h | 85 + .../graphite2-1.2.1/include/graphite2/Segment.h | 420 +++++ .../graphite2-1.2.1/include/graphite2/Types.h | 69 + .../libs/graphite2/graphite2-1.2.1/src/Bidi.cpp | 578 ++++++ .../graphite2/graphite2-1.2.1/src/CMakeLists.txt | 139 ++ .../graphite2/graphite2-1.2.1/src/CachedFace.cpp | 127 ++ .../graphite2/graphite2-1.2.1/src/CmapCache.cpp | 152 ++ .../libs/graphite2/graphite2-1.2.1/src/Code.cpp | 609 ++++++ .../libs/graphite2/graphite2-1.2.1/src/Face.cpp | 254 +++ .../graphite2/graphite2-1.2.1/src/FeatureMap.cpp | 279 +++ .../graphite2/graphite2-1.2.1/src/FileFace.cpp | 111 ++ .../libs/graphite2/graphite2-1.2.1/src/Font.cpp | 61 + .../graphite2/graphite2-1.2.1/src/GlyphCache.cpp | 337 ++++ .../graphite2/graphite2-1.2.1/src/GlyphFace.cpp | 48 + .../graphite2/graphite2-1.2.1/src/Justifier.cpp | 267 +++ .../graphite2/graphite2-1.2.1/src/NameTable.cpp | 222 +++ .../libs/graphite2/graphite2-1.2.1/src/Pass.cpp | 589 ++++++ .../libs/graphite2/graphite2-1.2.1/src/Rule.cpp | 31 + .../graphite2/graphite2-1.2.1/src/SegCache.cpp | 224 +++ .../graphite2-1.2.1/src/SegCacheEntry.cpp | 106 ++ .../graphite2-1.2.1/src/SegCacheStore.cpp | 47 + .../libs/graphite2/graphite2-1.2.1/src/Segment.cpp | 453 +++++ .../libs/graphite2/graphite2-1.2.1/src/Silf.cpp | 385 ++++ .../libs/graphite2/graphite2-1.2.1/src/Slot.cpp | 418 +++++ .../libs/graphite2/graphite2-1.2.1/src/Sparse.cpp | 60 + .../libs/graphite2/graphite2-1.2.1/src/TtfUtil.cpp | 1980 +++++++++++++++++++ .../graphite2/graphite2-1.2.1/src/UtfCodec.cpp | 45 + .../graphite2/graphite2-1.2.1/src/call_machine.cpp | 135 ++ .../graphite2-1.2.1/src/direct_machine.cpp | 117 ++ .../libs/graphite2/graphite2-1.2.1/src/files.mk | 115 ++ .../graphite2/graphite2-1.2.1/src/gr_char_info.cpp | 65 + .../libs/graphite2/graphite2-1.2.1/src/gr_face.cpp | 255 +++ .../graphite2/graphite2-1.2.1/src/gr_features.cpp | 138 ++ .../libs/graphite2/graphite2-1.2.1/src/gr_font.cpp | 72 + .../graphite2/graphite2-1.2.1/src/gr_logging.cpp | 193 ++ .../graphite2/graphite2-1.2.1/src/gr_segment.cpp | 174 ++ .../libs/graphite2/graphite2-1.2.1/src/gr_slot.cpp | 173 ++ .../graphite2/graphite2-1.2.1/src/inc/CachedFace.h | 56 + .../graphite2/graphite2-1.2.1/src/inc/CharInfo.h | 67 + .../graphite2/graphite2-1.2.1/src/inc/CmapCache.h | 82 + .../libs/graphite2/graphite2-1.2.1/src/inc/Code.h | 175 ++ .../graphite2/graphite2-1.2.1/src/inc/Endian.h | 107 ++ .../libs/graphite2/graphite2-1.2.1/src/inc/Face.h | 206 ++ .../graphite2/graphite2-1.2.1/src/inc/FeatureMap.h | 184 ++ .../graphite2/graphite2-1.2.1/src/inc/FeatureVal.h | 68 + .../graphite2/graphite2-1.2.1/src/inc/FileFace.h | 80 + .../libs/graphite2/graphite2-1.2.1/src/inc/Font.h | 89 + .../graphite2/graphite2-1.2.1/src/inc/GlyphCache.h | 92 + .../graphite2/graphite2-1.2.1/src/inc/GlyphFace.h | 83 + .../libs/graphite2/graphite2-1.2.1/src/inc/List.h | 155 ++ .../graphite2/graphite2-1.2.1/src/inc/Machine.h | 197 ++ .../libs/graphite2/graphite2-1.2.1/src/inc/Main.h | 87 + .../graphite2/graphite2-1.2.1/src/inc/NameTable.h | 65 + .../libs/graphite2/graphite2-1.2.1/src/inc/Pass.h | 96 + .../graphite2/graphite2-1.2.1/src/inc/Position.h | 59 + .../libs/graphite2/graphite2-1.2.1/src/inc/Rule.h | 307 +++ .../graphite2/graphite2-1.2.1/src/inc/SegCache.h | 320 ++++ .../graphite2-1.2.1/src/inc/SegCacheEntry.h | 121 ++ .../graphite2-1.2.1/src/inc/SegCacheStore.h | 127 ++ .../graphite2/graphite2-1.2.1/src/inc/Segment.h | 270 +++ .../libs/graphite2/graphite2-1.2.1/src/inc/Silf.h | 126 ++ .../libs/graphite2/graphite2-1.2.1/src/inc/Slot.h | 169 ++ .../graphite2/graphite2-1.2.1/src/inc/Sparse.h | 157 ++ .../graphite2/graphite2-1.2.1/src/inc/TtfTypes.h | 419 +++++ .../graphite2/graphite2-1.2.1/src/inc/TtfUtil.h | 206 ++ .../graphite2/graphite2-1.2.1/src/inc/UtfCodec.h | 207 ++ .../libs/graphite2/graphite2-1.2.1/src/inc/bits.h | 90 + .../libs/graphite2/graphite2-1.2.1/src/inc/debug.h | 78 + .../libs/graphite2/graphite2-1.2.1/src/inc/json.h | 165 ++ .../graphite2-1.2.1/src/inc/locale2lcid.h | 444 +++++ .../graphite2-1.2.1/src/inc/opcode_table.h | 120 ++ .../graphite2/graphite2-1.2.1/src/inc/opcodes.h | 644 +++++++ .../libs/graphite2/graphite2-1.2.1/src/json.cpp | 126 ++ Build/source/libs/graphite2/version.ac | 4 +- 180 files changed, 16936 insertions(+), 16867 deletions(-) delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0-PATCHES/ChangeLog delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0-PATCHES/TL-Changes delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0-PATCHES/patch-01-case-sensitive delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0-PATCHES/patch-02-attribute-hot delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/.hg_archival.txt delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/.hgeol delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/.hgignore delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/.hgtags delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/CMakeLists.txt delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/COPYING delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/ChangeLog delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/Graphite.cmake delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/LICENSE delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/Todo.txt delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/graphite2.pc.in delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/include/graphite2/Font.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/include/graphite2/Log.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/include/graphite2/Segment.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/include/graphite2/Types.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/Bidi.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/CMakeLists.txt delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/CachedFace.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/CmapCache.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/Code.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/Face.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/FeatureMap.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/FileFace.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/Font.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/GlyphCache.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/GlyphFace.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/Justifier.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/NameTable.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/Pass.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/Rule.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/SegCache.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/SegCacheEntry.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/SegCacheStore.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/Segment.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/Silf.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/Slot.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/Sparse.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/TtfUtil.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/UtfCodec.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/call_machine.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/direct_machine.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/files.mk delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/gr_char_info.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/gr_face.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/gr_features.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/gr_font.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/gr_logging.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/gr_segment.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/gr_slot.cpp delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/CachedFace.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/CharInfo.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/CmapCache.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Code.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Endian.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Face.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/FeatureMap.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/FeatureVal.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/FileFace.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Font.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/GlyphCache.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/GlyphFace.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/List.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Machine.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Main.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/NameTable.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Pass.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Position.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Rule.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/SegCache.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/SegCacheEntry.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/SegCacheStore.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Segment.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Silf.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Slot.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Sparse.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/TtfTypes.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/TtfUtil.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/UtfCodec.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/bits.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/debug.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/json.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/locale2lcid.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/opcode_table.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/inc/opcodes.h delete mode 100644 Build/source/libs/graphite2/graphite2-1.2.0/src/json.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1-PATCHES/ChangeLog create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1-PATCHES/TL-Changes create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1-PATCHES/patch-01-case-sensitive create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/.hg_archival.txt create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/.hgeol create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/.hgignore create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/.hgtags create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/CMakeLists.txt create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/COPYING create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/ChangeLog create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/Graphite.cmake create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/LICENSE create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/Todo.txt create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/graphite2.pc.in create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/include/graphite2/Font.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/include/graphite2/Log.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/include/graphite2/Segment.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/include/graphite2/Types.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/Bidi.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/CMakeLists.txt create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/CachedFace.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/CmapCache.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/Code.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/Face.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/FeatureMap.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/FileFace.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/Font.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/GlyphCache.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/GlyphFace.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/Justifier.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/NameTable.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/Pass.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/Rule.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/SegCache.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/SegCacheEntry.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/SegCacheStore.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/Segment.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/Silf.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/Slot.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/Sparse.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/TtfUtil.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/UtfCodec.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/call_machine.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/direct_machine.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/files.mk create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/gr_char_info.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/gr_face.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/gr_features.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/gr_font.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/gr_logging.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/gr_segment.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/gr_slot.cpp create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/CachedFace.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/CharInfo.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/CmapCache.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Code.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Endian.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Face.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/FeatureMap.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/FeatureVal.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/FileFace.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Font.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/GlyphCache.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/GlyphFace.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/List.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Machine.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Main.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/NameTable.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Pass.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Position.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Rule.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/SegCache.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/SegCacheEntry.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/SegCacheStore.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Segment.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Silf.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Slot.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Sparse.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/TtfTypes.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/TtfUtil.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/UtfCodec.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/bits.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/debug.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/json.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/locale2lcid.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/opcode_table.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/inc/opcodes.h create mode 100644 Build/source/libs/graphite2/graphite2-1.2.1/src/json.cpp (limited to 'Build/source/libs/graphite2') diff --git a/Build/source/libs/graphite2/ChangeLog b/Build/source/libs/graphite2/ChangeLog index e722a758ce5..35edee406b5 100644 --- a/Build/source/libs/graphite2/ChangeLog +++ b/Build/source/libs/graphite2/ChangeLog @@ -1,3 +1,8 @@ +2012-12-04 Peter Breitenlohner + + Import graphite2-1.2.1. + * version.ac: Adjust. + 2013-01-29 Peter Breitenlohner * Makefile.am: Allow subdir-objects. diff --git a/Build/source/libs/graphite2/configure b/Build/source/libs/graphite2/configure index 8d7af740dbb..bfcefac07d2 100755 --- a/Build/source/libs/graphite2/configure +++ b/Build/source/libs/graphite2/configure @@ -1,6 +1,6 @@ #! /bin/sh # Guess values for system-dependent variables and create Makefiles. -# Generated by GNU Autoconf 2.69 for graphite2 for TeX Live 1.2.0. +# Generated by GNU Autoconf 2.69 for graphite2 for TeX Live 1.2.1. # # Report bugs to . # @@ -590,12 +590,12 @@ MAKEFLAGS= # Identity of this package. PACKAGE_NAME='graphite2 for TeX Live' PACKAGE_TARNAME='graphite2-for-tex-live' -PACKAGE_VERSION='1.2.0' -PACKAGE_STRING='graphite2 for TeX Live 1.2.0' +PACKAGE_VERSION='1.2.1' +PACKAGE_STRING='graphite2 for TeX Live 1.2.1' PACKAGE_BUGREPORT='tex-k@tug.org' PACKAGE_URL='' -ac_unique_file="graphite2-1.2.0/graphite2.pc.in" +ac_unique_file="graphite2-1.2.1/graphite2.pc.in" # Factoring default headers for most tests. ac_includes_default="\ #include @@ -1339,7 +1339,7 @@ if test "$ac_init_help" = "long"; then # Omit some internal or obsolete options to make the list less imposing. # This message is too long to be a string in the A/UX 3.1 sh. cat <<_ACEOF -\`configure' configures graphite2 for TeX Live 1.2.0 to adapt to many kinds of systems. +\`configure' configures graphite2 for TeX Live 1.2.1 to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... @@ -1410,7 +1410,7 @@ fi if test -n "$ac_init_help"; then case $ac_init_help in - short | recursive ) echo "Configuration of graphite2 for TeX Live 1.2.0:";; + short | recursive ) echo "Configuration of graphite2 for TeX Live 1.2.1:";; esac cat <<\_ACEOF @@ -1524,7 +1524,7 @@ fi test -n "$ac_init_help" && exit $ac_status if $ac_init_version; then cat <<\_ACEOF -graphite2 for TeX Live configure 1.2.0 +graphite2 for TeX Live configure 1.2.1 generated by GNU Autoconf 2.69 Copyright (C) 2012 Free Software Foundation, Inc. @@ -1923,7 +1923,7 @@ cat >config.log <<_ACEOF This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. -It was created by graphite2 for TeX Live $as_me 1.2.0, which was +It was created by graphite2 for TeX Live $as_me 1.2.1, which was generated by GNU Autoconf 2.69. Invocation command line was $ $0 $@ @@ -3787,7 +3787,7 @@ fi # Define the identity of the package. PACKAGE='graphite2-for-tex-live' - VERSION='1.2.0' + VERSION='1.2.1' cat >>confdefs.h <<_ACEOF @@ -15983,7 +15983,7 @@ $as_echo "#define GRAPHITE2_NTRACING 1" >>confdefs.h fi -GRAPHITE2_TREE=graphite2-1.2.0 +GRAPHITE2_TREE=graphite2-1.2.1 ac_config_files="$ac_config_files Makefile include/graphite2/Makefile" @@ -16551,7 +16551,7 @@ cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # report actual input values of CONFIG_FILES etc. instead of their # values after options handling. ac_log=" -This file was extended by graphite2 for TeX Live $as_me 1.2.0, which was +This file was extended by graphite2 for TeX Live $as_me 1.2.1, which was generated by GNU Autoconf 2.69. Invocation command line was CONFIG_FILES = $CONFIG_FILES @@ -16617,7 +16617,7 @@ _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`" ac_cs_version="\\ -graphite2 for TeX Live config.status 1.2.0 +graphite2 for TeX Live config.status 1.2.1 configured by $0, generated by GNU Autoconf 2.69, with options \\"\$ac_cs_config\\" diff --git a/Build/source/libs/graphite2/graphite2-1.2.0-PATCHES/ChangeLog b/Build/source/libs/graphite2/graphite2-1.2.0-PATCHES/ChangeLog deleted file mode 100644 index 83602914a2a..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0-PATCHES/ChangeLog +++ /dev/null @@ -1,14 +0,0 @@ -2012-12-06 Peter Breitenlohner - - * patch-03-old-gcc (removed): No longer needed since HarfBuzz - requires gcc-4.x. - -2012-12-04 Peter Breitenlohner - - Imported graphite-1.2.0 source tree from: - http://sourceforge.net/projects/silgraphite/files/graphite2/ - - * patch-01-case-sensitive (new): Windows.h => windows.h. - * patch-02-attribute-hot (new): Test for gcc-4.3 or better. - * patch-03-old-gcc (new): Allow to build with, e.g., gcc-3.4. - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0-PATCHES/TL-Changes b/Build/source/libs/graphite2/graphite2-1.2.0-PATCHES/TL-Changes deleted file mode 100644 index 21e4d312e90..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0-PATCHES/TL-Changes +++ /dev/null @@ -1,10 +0,0 @@ -Changes applied to the graphite-1.2.0/ tree as obtained from: - http://sourceforge.net/projects/silgraphite/files/graphite2/ - -Removed unused dirs: - contrib - debian-src - doc - gr2fonttest - tests - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0-PATCHES/patch-01-case-sensitive b/Build/source/libs/graphite2/graphite2-1.2.0-PATCHES/patch-01-case-sensitive deleted file mode 100644 index aa2986c38cf..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0-PATCHES/patch-01-case-sensitive +++ /dev/null @@ -1,14 +0,0 @@ - Required for case-sensitive filesystems. - -diff -ur graphite2-1.2.0.orig/src/gr_logging.cpp graphite2-1.2.0/src/gr_logging.cpp ---- graphite2-1.2.0.orig/src/gr_logging.cpp 2012-09-21 10:39:40.000000000 +0200 -+++ graphite2-1.2.0/src/gr_logging.cpp 2012-12-04 12:19:51.657709606 +0100 -@@ -33,7 +33,7 @@ - #include "inc/Segment.h" - - #if defined _WIN32 --#include "Windows.h" -+#include "windows.h" - #endif - - using namespace graphite2; diff --git a/Build/source/libs/graphite2/graphite2-1.2.0-PATCHES/patch-02-attribute-hot b/Build/source/libs/graphite2/graphite2-1.2.0-PATCHES/patch-02-attribute-hot deleted file mode 100644 index 1eaa4a69d4e..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0-PATCHES/patch-02-attribute-hot +++ /dev/null @@ -1,14 +0,0 @@ - The attribute requires in gcc-4.3 or better. - -diff -ur graphite2-1.2.0.orig/src/inc/Machine.h graphite2-1.2.0/src/inc/Machine.h ---- graphite2-1.2.0.orig/src/inc/Machine.h 2012-09-21 10:39:40.000000000 +0200 -+++ graphite2-1.2.0/src/inc/Machine.h 2012-12-04 13:10:33.000000000 +0100 -@@ -36,7 +36,7 @@ - #include "inc/Main.h" - - #if defined(__GNUC__) --#if defined(__clang__) -+#if defined(__clang__) || (__GNUC__ * 100 + __GNUC_MINOR__) < 403 - #define HOT - #if defined(__x86_64) - #define REGPARM(n) __attribute__((regparm(n))) diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/.hg_archival.txt b/Build/source/libs/graphite2/graphite2-1.2.0/.hg_archival.txt deleted file mode 100644 index 0e511bd458c..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/.hg_archival.txt +++ /dev/null @@ -1,5 +0,0 @@ -repo: 999e2033695c3bcf2f65d611737ac9008805bd58 -node: 8d2a85a546653a795d39cab287a1965a785cfbf8 -branch: default -latesttag: 1.2.0 -latesttagdistance: 1 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/.hgeol b/Build/source/libs/graphite2/graphite2-1.2.0/.hgeol deleted file mode 100644 index 5eb1fc19d0f..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/.hgeol +++ /dev/null @@ -1,15 +0,0 @@ -[patterns] -**.c = native -**.cfg = native -**.cpp = native -**.gdh = native -**.h = native -**.json = native -**.log = native -**.pdf = BIN -**.sh = native -**.txt = native -**.ttf = BIN - -[repository] -native=LF diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/.hgignore b/Build/source/libs/graphite2/graphite2-1.2.0/.hgignore deleted file mode 100644 index 5934da4b3c8..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/.hgignore +++ /dev/null @@ -1,34 +0,0 @@ -syntax:glob -*~ -*.bak -m4 -autom4te.cache -config -configure -config.status -config.log -aclocal.m4 -libtool -Makefile.in -Makefile -msvs9 -vs9 -nmake* -*.o -*.lo -*.Plo -*.swp -*.la -*.kdev4 -.cproject -.project -.pydevproject - -syntax:regexp -\.libs/ -\.deps/ -\.externalToolBuilders -build*/ -release/ -debug/ -dev/ diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/.hgtags b/Build/source/libs/graphite2/graphite2-1.2.0/.hgtags deleted file mode 100644 index 164d8ba9a73..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/.hgtags +++ /dev/null @@ -1,27 +0,0 @@ -c36cd69f32ac9daace9f8784063567d81328e778 base -e0db725d6db85c49389176f2ee460366f080c023 Release 0.9 -3a92b51d7167e16c31b963924bd01964d6eb7e63 r0.9.1 -5369cdd121206c950113de37f4886152aa86cc98 0.9.2 -3ec0de96c2229e975b1452f9a92c4ab3845c0ad2 0.9.3 -50901246031365c63fb826a18a5ca52099201d93 0.9.4 -b8a64c4a89f5d742553a7cc3cfddb6b3e08e1fa0 1.0.0 -bedb05f72d56f24ca0fc333fd14eabb1ec553902 1.0.1 -bedb05f72d56f24ca0fc333fd14eabb1ec553902 1.0.1 -0000000000000000000000000000000000000000 1.0.1 -0000000000000000000000000000000000000000 1.0.1 -01df4f7cc7b0f31f8490b4246b298ac10d92675e 1.0.1 -0fa690ff089ce0bc382a553cc01c0b721fbdee5c 1.0.2 -0fa690ff089ce0bc382a553cc01c0b721fbdee5c 1.0.2 -b10bcaf1302411513a5961d1854ff8c02e5ad5e6 1.0.2 -8795e344f7964bdf8ef4607004f01b94c41e5775 1.0.3 -8795e344f7964bdf8ef4607004f01b94c41e5775 1.0.3 -0000000000000000000000000000000000000000 1.0.3 -0000000000000000000000000000000000000000 1.0.3 -f148746a0d99d2f9bc050906ce78815565a0d0b4 1.0.3 -afdc9c2e4cf341560dfcb985b66e52793d1987af 1.1.0 -afdc9c2e4cf341560dfcb985b66e52793d1987af 1.1.0 -22dfbf9cd047667eef87602eacf2ac1e84ec20d7 1.1.0 -e095cd8b635aa985c8054717761555b6d46dbdb6 1.1.1 -1ffaabe61f501b7a0b9217f4b82f21ac6a7af212 1.1.2 -d8c8ce7898a9e73a9cb11c25b9ff6a198fdf8d80 1.1.3 -fb4b0c347a953f6aa656a4e414f8e42e91c00c2b 1.2.0 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/CMakeLists.txt b/Build/source/libs/graphite2/graphite2-1.2.0/CMakeLists.txt deleted file mode 100644 index 043a9f4e8ec..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/CMakeLists.txt +++ /dev/null @@ -1,73 +0,0 @@ -CMAKE_MINIMUM_REQUIRED(VERSION 2.8.0 FATAL_ERROR) -cmake_policy(SET CMP0012 NEW) -include(TestBigEndian) - -project(graphite2) -set(CMAKE_MODULE_PATH ${PROJECT_SOURCE_DIR}) -if (NOT CMAKE_BUILD_TYPE) - set_property(CACHE CMAKE_BUILD_TYPE PROPERTY VALUE Release) -endif (NOT CMAKE_BUILD_TYPE) -#if (CMAKE_BUILD_TYPE STREQUAL ClangASN) -# add_definitions(-faddress-sanitizer -fno-omit-frame-pointer) -# set_property(CACHE CMAKE_C_COMPILER PROPERTY VALUE clang) -# set_property(CACHE CMAKE_CXX_COMPILER PROPERTY VALUE clang) -#endif (CMAKE_BUILD_TYPE STREQUAL ClangASN) - -enable_language(CXX C) - -include_directories(${PROJECT_SOURCE_DIR}/include) -if (CMAKE_BUILD_TYPE STREQUAL ClangASN) - add_definitions(-faddress-sanitizer -fno-omit-frame-pointer) -endif (CMAKE_BUILD_TYPE STREQUAL ClangASN) - -enable_testing() - -set(GRAPHITE2_VM_TYPE auto CACHE STRING "Choose the type of vm machine: Auto, Direct or Call.") -option(GRAPHITE2_NSEGCACHE "Compile out the gr_*_with_seg_cache APIs") -option(GRAPHITE2_NFILEFACE "Compile out the gr_make_file_face* APIs") -option(GRAPHITE2_NTRACING "Compile out log segment tracing capability") - - -message(STATUS "Build: " ${CMAKE_BUILD_TYPE}) -string(REPLACE "ON" "disabled" _SEGCACHE_SUPPORT ${GRAPHITE2_NSEGCACHE}) -string(REPLACE "OFF" "enabled" _SEGCACHE_SUPPORT ${_SEGCACHE_SUPPORT}) -string(REPLACE "ON" "disabled" _FILEFACE_SUPPORT ${GRAPHITE2_NFILEFACE}) -string(REPLACE "OFF" "enabled" _FILEFACE_SUPPORT ${_FILEFACE_SUPPORT}) -string(REPLACE "ON" "disabled" _TRACING_SUPPORT ${GRAPHITE2_NTRACING}) -string(REPLACE "OFF" "enabled" _TRACING_SUPPORT ${_TRACING_SUPPORT}) -message(STATUS "Segment Cache support: " ${_SEGCACHE_SUPPORT}) -message(STATUS "File Face support: " ${_FILEFACE_SUPPORT}) -message(STATUS "Tracing support: " ${_TRACING_SUPPORT}) - -string(TOLOWER ${GRAPHITE2_VM_TYPE} GRAPHITE2_VM_TYPE) -if (NOT GRAPHITE2_VM_TYPE MATCHES "auto|direct|call") - message(SEND_ERROR "unrecognised vm machine type: ${GRAPHITE2_VM_TYPE}. Only Auto, Direct or Call are available") -endif (NOT GRAPHITE2_VM_TYPE MATCHES "auto|direct|call") -if (GRAPHITE2_VM_TYPE STREQUAL "auto") - if (CMAKE_BUILD_TYPE MATCHES "[Rr]el(ease|[Ww]ith[Dd]eb[Ii]nfo)") - set(GRAPHITE2_VM_TYPE "direct") - else(CMAKE_BUILD_TYPE MATCHES "[Rr]el(ease|[Ww]ith[Dd]eb[Ii]nfo)") - set(GRAPHITE2_VM_TYPE "call") - endif(CMAKE_BUILD_TYPE MATCHES "[Rr]el(ease|[Ww]ith[Dd]eb[Ii]nfo)") -endif (GRAPHITE2_VM_TYPE STREQUAL "auto") -if (GRAPHITE2_VM_TYPE STREQUAL "direct" AND NOT (CMAKE_COMPILER_IS_GNUCXX OR CMAKE_BASE_NAME STREQUAL "clang++")) - message(WARNING "vm machine type direct can only be built using GCC") - set(GRAPHITE2_VM_TYPE "call") -endif (GRAPHITE2_VM_TYPE STREQUAL "direct" AND NOT (CMAKE_COMPILER_IS_GNUCXX OR CMAKE_BASE_NAME STREQUAL "clang++")) -message(STATUS "Using vm machine type: ${GRAPHITE2_VM_TYPE}") - -add_subdirectory(src) -add_subdirectory(tests) -add_subdirectory(doc) -if (NOT (GRAPHITE2_NSEGCACHE OR GRAPHITE2_NFILEFACE)) - add_subdirectory(gr2fonttest) -endif (NOT (GRAPHITE2_NSEGCACHE OR GRAPHITE2_NFILEFACE)) - -set(version 2.1.0) -set(libdir ${CMAKE_INSTALL_PREFIX}/lib${LIB_SUFFIX}) -set(includedir ${CMAKE_INSTALL_PREFIX}/include) - -configure_file(graphite2.pc.in graphite2.pc) - -install(FILES ${PROJECT_BINARY_DIR}/graphite2.pc DESTINATION lib${LIB_SUFFIX}/pkgconfig) - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/COPYING b/Build/source/libs/graphite2/graphite2-1.2.0/COPYING deleted file mode 100644 index d40f2d84587..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/COPYING +++ /dev/null @@ -1,26 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - - Alternatively, you may use this library under the terms of the Mozilla - Public License (http://mozilla.org/MPL) or under the GNU General Public - License, as published by the Free Sofware Foundation; either version - 2 of the license or (at your option) any later version. -*/ diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/ChangeLog b/Build/source/libs/graphite2/graphite2-1.2.0/ChangeLog deleted file mode 100644 index 03629e97f80..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/ChangeLog +++ /dev/null @@ -1,89 +0,0 @@ -1.2.0 - . API Changes: - . Added Windows friendly gr_start_logging and gr_stop_logging, now per face - . Added gr_make_face_with_ops, gr_make_face_with_seg_cache_and_ops - . Added gr_make_font_with_ops - . Added gr_face_is_char_supported - . Added gr_face_info to give info to apps about face capabilities - . Deprecated gr_make_face, gr_make_face_with_seg_cache, gr_make_font_with_advance_fn - . Deprecated graphite_start_logging and graphite_stop_logging - . These functions are stubbed now and do nothing, but do compile and link. - . Bump API version to 3 - . Add C# wrapper to contrib - . Handle justification information in a font and do something useful with it - . Builds clang clean (has done for a while) - . Bug fixes - . Windows build and bug fixes - . Add extra information to json debug output - . Added windows build documentation - . Added freetype sample code and test - -1.1.3 - . Default build has GRAPHITE2_COMPARE_RENDERER to OFF to reduce dependencies - . Builds on Mac with clang - . Debug output improvements - . Tidy up perl wrappers - . Fuzz tester improvements - . Various bug fixes for bad font handling -1.1.2 - . Support feature ids < 4 chars when space padded for inclusion in FF 14. - . More fuzztesting and removal of causes of valgrind bad reads and sigabrts - . Remove contrib/android into its own repo (http://hg.palaso.org/grandroid) - . Update comparerenderer to latest harfbuzzng api -1.1.1 - . Missing Log.h included - . perl wrappers updated -1.1.0 - . Refactored debug output to use json - . Renamed VM_MACHINE_TYPE to GRAPHITE2_VM_TYPE - . Renamed DISABLE_SEGCACHE to GRAPHITE2_NSEGCACE - . Renamed DISBALE_FILE_FACE to GRAPHITE2_NFILEFACE - . Renamed ENABLE_COMPARE_RENDERER to GRAPHTIE2_COMPARE_RENDERER - . Renamed DOXYGEN_CONFIG to GRAPHITE2_DOXYGEN_CONFIG - . Renamed GR2_CUSTOM_HEADER to GRAPHITE2_CUSTOM_HEADER - . Renamed GR2_EXPORTING to GRAPHITE2_EXPORTING - . Added GRAPHITE2_STATIC for static only builds - . Added GRAPHITE2_NTRACING to compile out tracing code - . Documented GRAPHITE2_{EXPORTING,STATIC,NTRACING} in hacking.txt - . Bump libtool version to 2.1.0 - . dumb font rendering works - . slot user attributes are now signed rather than unsigned - . add support for long class maps - . Rename perl library to avoid nameclash on Windows - . Various robustness fixes - . Moved internal .h files into src/inc - . Parallelise fuzztest - . General build improvements, particularly on Windows - -1.0.3 - . Fix UTF16 surrogate support - . script and lang tags may be space padded or null padded - . Remove need for WORDS_BIGENDIAN, do it all automatically - . Remove all #include . Use CLASS_NEW_DELETE instead. - . Fix comparerenderer to work with current hbng - . Add valgrind to fuzztest to ensure good memory use at all times - . Fix new fuzztest exposed bugs. - . Fix bugs exposed by Mozilla security review - . Add continuous integration build on Windows support - -1.0.2 - . Fix Windows build - . Comparerenderer uses hbng enforcing ot rendering - . Add Bidi .hasChar support and refactor mirroring code - . Make cmake default Release rather than debug - . Don't compile in a boat load of TtfUtil that isn't used, saving 15% of binary - . Chase the FSF around its latest office moves - . WORDS_BIGENDIAN is set at the top so tests now pass on ppc, etc. - . More words in the manual - -1.0.1 - . Release is the default build in cmake now. - . Refactor cmake build to not rebuild things so much. - . Include a missing file - . Remove -nostdlibs, making gcc happy everywhere - . Update comparerenderer to latest hbng interface - . Add changelog - -1.0.0 - . First major release of perfect code! - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/Graphite.cmake b/Build/source/libs/graphite2/graphite2-1.2.0/Graphite.cmake deleted file mode 100644 index b6fe7cfc66e..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/Graphite.cmake +++ /dev/null @@ -1,99 +0,0 @@ -include(GetPrerequisites) - -function(nolib_test LIBNAME OBJECTFILE) - string(REGEX REPLACE "[][^$.*+?|()-]" "\\\\\\0" LIBNAME_REGEX ${LIBNAME}) - if (${CMAKE_SYSTEM_NAME} STREQUAL "Darwin") - add_test(NAME nolib-${LIBNAME}-${PROJECT_NAME} - COMMAND otool -L ${OBJECTFILE}) - set_tests_properties(nolib-${LIBNAME}-${PROJECT_NAME} PROPERTIES - FAIL_REGULAR_EXPRESSION "${CMAKE_SHARED_LIBRARY_PREFIX}${LIBNAME_REGEX}[.0-9]+${CMAKE_SHARED_LIBRARY_SUFFIX}") - else (${CMAKE_SYSTEM_NAME} STREQUAL "Darwin") - add_test(NAME nolib-${LIBNAME}-${PROJECT_NAME} - COMMAND readelf --dynamic ${OBJECTFILE}) - set_tests_properties(nolib-${LIBNAME}-${PROJECT_NAME} PROPERTIES - FAIL_REGULAR_EXPRESSION "0x[0-9a-f]+ \\(NEEDED\\)[ \\t]+Shared library: \\[${CMAKE_SHARED_LIBRARY_PREFIX}${LIBNAME_REGEX}${CMAKE_SHARED_LIBRARY_SUFFIX}.*\\]") - endif (${CMAKE_SYSTEM_NAME} STREQUAL "Darwin") -endfunction(nolib_test) - - -MACRO(GET_TARGET_PROPERTY_WITH_DEFAULT _variable _target _property _default_value) - GET_TARGET_PROPERTY (${_variable} ${_target} ${_property}) - IF (${_variable} MATCHES NOTFOUND) - SET (${_variable} ${_default_value}) - ENDIF (${_variable} MATCHES NOTFOUND) -ENDMACRO (GET_TARGET_PROPERTY_WITH_DEFAULT) - - -FUNCTION(CREATE_LIBTOOL_FILE _target _install_DIR) - GET_TARGET_PROPERTY(_target_location ${_target} LOCATION) - GET_TARGET_PROPERTY_WITH_DEFAULT(_target_static_lib ${_target} STATIC_LIB "") - GET_TARGET_PROPERTY_WITH_DEFAULT(_target_dependency_libs ${_target} LT_DEPENDENCY_LIBS "") - GET_TARGET_PROPERTY_WITH_DEFAULT(_target_current ${_target} LT_VERSION_CURRENT 0) - GET_TARGET_PROPERTY_WITH_DEFAULT(_target_age ${_target} LT_VERSION_AGE 0) - GET_TARGET_PROPERTY_WITH_DEFAULT(_target_revision ${_target} LT_VERSION_REVISION 0) - GET_TARGET_PROPERTY_WITH_DEFAULT(_target_installed ${_target} LT_INSTALLED yes) - GET_TARGET_PROPERTY_WITH_DEFAULT(_target_shouldnotlink ${_target} LT_SHOULDNOTLINK yes) - GET_TARGET_PROPERTY_WITH_DEFAULT(_target_dlopen ${_target} LT_DLOPEN "") - GET_TARGET_PROPERTY_WITH_DEFAULT(_target_dlpreopen ${_target} LT_DLPREOPEN "") - GET_FILENAME_COMPONENT(_lanamewe ${_target_location} NAME_WE) - GET_FILENAME_COMPONENT(_soname ${_target_location} NAME) - SET(_laname ${PROJECT_BINARY_DIR}/${_lanamewe}.la) - FILE(WRITE ${_laname} "# ${_lanamewe}.la - a libtool library file\n") - FILE(APPEND ${_laname} "# Generated by CMake ${CMAKE_VERSION} (like GNU libtool)\n") - FILE(APPEND ${_laname} "\n# Please DO NOT delete this file!\n# It is necessary for linking the library with libtool.\n\n" ) - FILE(APPEND ${_laname} "# The name that we can dlopen(3).\n") - FILE(APPEND ${_laname} "dlname='${_soname}'\n\n") - FILE(APPEND ${_laname} "# Names of this library.\n") - FILE(APPEND ${_laname} "library_names='${_soname}.${_target_current}.${_target_age}.${_target_revision} ${_soname}.${_target_current} ${_soname}'\n\n") - FILE(APPEND ${_laname} "# The name of the static archive.\n") - FILE(APPEND ${_laname} "old_library='${_target_static_lib}'\n\n") - FILE(APPEND ${_laname} "# Libraries that this one depends upon.\n") - FILE(APPEND ${_laname} "dependency_libs='${_target_dependency_libs}'\n\n") - FILE(APPEND ${_laname} "# Names of additional weak libraries provided by this library\n") - FILE(APPEND ${_laname} "weak_library_names=\n\n") - FILE(APPEND ${_laname} "# Version information for ${_laname}.\n") - FILE(APPEND ${_laname} "current=${_target_current}\n") - FILE(APPEND ${_laname} "age=${_target_age}\n") - FILE(APPEND ${_laname} "revision=${_target_revision}\n\n") - FILE(APPEND ${_laname} "# Is this an already installed library?\n") - FILE(APPEND ${_laname} "installed=${_target_installed}\n\n") - FILE(APPEND ${_laname} "# Should we warn about portability when linking against -modules?\n") - FILE(APPEND ${_laname} "shouldnotlink=${_target_shouldnotlink}\n\n") - FILE(APPEND ${_laname} "# Files to dlopen/dlpreopen\n") - FILE(APPEND ${_laname} "dlopen='${_target_dlopen}'\n") - FILE(APPEND ${_laname} "dlpreopen='${_target_dlpreopen}'\n\n") - FILE(APPEND ${_laname} "# Directory that this library needs to be installed in:\n") - FILE(APPEND ${_laname} "libdir='${CMAKE_INSTALL_PREFIX}${_install_DIR}'\n") - INSTALL( FILES ${_laname} DESTINATION ${CMAKE_INSTALL_PREFIX}${_install_DIR}) -ENDFUNCTION(CREATE_LIBTOOL_FILE) - - -function(fonttest TESTNAME FONTFILE) - if (EXISTS ${PROJECT_SOURCE_DIR}/standards/${TESTNAME}${CMAKE_SYSTEM_NAME}.log) - set(PLATFORM_TEST_SUFFIX ${CMAKE_SYSTEM_NAME}) - endif (EXISTS ${PROJECT_SOURCE_DIR}/standards/${TESTNAME}${CMAKE_SYSTEM_NAME}.log) - if (NOT (GRAPHITE2_NSEGCACHE OR GRAPHITE2_NFILEFACE)) - add_test(NAME ${TESTNAME} COMMAND $ -trace ${PROJECT_BINARY_DIR}/${TESTNAME}.json -log ${PROJECT_BINARY_DIR}/${TESTNAME}.log ${PROJECT_SOURCE_DIR}/fonts/${FONTFILE} -codes ${ARGN}) - set_tests_properties(${TESTNAME} PROPERTIES TIMEOUT 3) - add_test(NAME ${TESTNAME}Output COMMAND ${CMAKE_COMMAND} -E compare_files ${PROJECT_BINARY_DIR}/${TESTNAME}.log ${PROJECT_SOURCE_DIR}/standards/${TESTNAME}${PLATFORM_TEST_SUFFIX}.log) - if (NOT GRAPHITE2_NTRACING) - add_test(NAME ${TESTNAME}Debug COMMAND python ${PROJECT_SOURCE_DIR}/jsoncmp ${PROJECT_BINARY_DIR}/${TESTNAME}.json ${PROJECT_SOURCE_DIR}/standards/${TESTNAME}.json) - set_tests_properties(${TESTNAME}Debug PROPERTIES DEPENDS ${TESTNAME}) - endif (NOT GRAPHITE2_NTRACING) - set_tests_properties(${TESTNAME}Output PROPERTIES DEPENDS ${TESTNAME}) - endif (NOT (GRAPHITE2_NSEGCACHE OR GRAPHITE2_NFILEFACE)) -endfunction(fonttest) - - -function(feattest TESTNAME FONTFILE) - if (EXISTS ${PROJECT_SOURCE_DIR}/standards/${TESTNAME}${CMAKE_SYSTEM_NAME}.log) - set(PLATFORM_TEST_SUFFIX ${CMAKE_SYSTEM_NAME}) - endif (EXISTS ${PROJECT_SOURCE_DIR}/standards/${TESTNAME}${CMAKE_SYSTEM_NAME}.log) - if (NOT (GRAPHITE2_NSEGCACHE OR GRAPHITE2_NFILEFACE)) - add_test(NAME ${TESTNAME} COMMAND $ -log ${PROJECT_BINARY_DIR}/${TESTNAME}.log ${PROJECT_SOURCE_DIR}/fonts/${FONTFILE}) - set_tests_properties(${TESTNAME} PROPERTIES TIMEOUT 3) - add_test(NAME ${TESTNAME}Output COMMAND ${CMAKE_COMMAND} -E compare_files ${PROJECT_BINARY_DIR}/${TESTNAME}.log ${PROJECT_SOURCE_DIR}/standards/${TESTNAME}${PLATFORM_TEST_SUFFIX}.log) - set_tests_properties(${TESTNAME}Output PROPERTIES DEPENDS ${TESTNAME}) - endif (NOT (GRAPHITE2_NSEGCACHE OR GRAPHITE2_NFILEFACE)) -endfunction(feattest) - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/LICENSE b/Build/source/libs/graphite2/graphite2-1.2.0/LICENSE deleted file mode 100644 index 2d2d780e601..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/LICENSE +++ /dev/null @@ -1,510 +0,0 @@ - - GNU LESSER GENERAL PUBLIC LICENSE - Version 2.1, February 1999 - - Copyright (C) 1991, 1999 Free Software Foundation, Inc. - 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - Everyone is permitted to copy and distribute verbatim copies - of this license document, but changing it is not allowed. - -[This is the first released version of the Lesser GPL. It also counts - as the successor of the GNU Library Public License, version 2, hence - the version number 2.1.] - - Preamble - - The licenses for most software are designed to take away your -freedom to share and change it. By contrast, the GNU General Public -Licenses are intended to guarantee your freedom to share and change -free software--to make sure the software is free for all its users. - - This license, the Lesser General Public License, applies to some -specially designated software packages--typically libraries--of the -Free Software Foundation and other authors who decide to use it. You -can use it too, but we suggest you first think carefully about whether -this license or the ordinary General Public License is the better -strategy to use in any particular case, based on the explanations -below. - - When we speak of free software, we are referring to freedom of use, -not price. Our General Public Licenses are designed to make sure that -you have the freedom to distribute copies of free software (and charge -for this service if you wish); that you receive source code or can get -it if you want it; that you can change the software and use pieces of -it in new free programs; and that you are informed that you can do -these things. - - To protect your rights, we need to make restrictions that forbid -distributors to deny you these rights or to ask you to surrender these -rights. These restrictions translate to certain responsibilities for -you if you distribute copies of the library or if you modify it. - - For example, if you distribute copies of the library, whether gratis -or for a fee, you must give the recipients all the rights that we gave -you. You must make sure that they, too, receive or can get the source -code. If you link other code with the library, you must provide -complete object files to the recipients, so that they can relink them -with the library after making changes to the library and recompiling -it. And you must show them these terms so they know their rights. - - We protect your rights with a two-step method: (1) we copyright the -library, and (2) we offer you this license, which gives you legal -permission to copy, distribute and/or modify the library. - - To protect each distributor, we want to make it very clear that -there is no warranty for the free library. Also, if the library is -modified by someone else and passed on, the recipients should know -that what they have is not the original version, so that the original -author's reputation will not be affected by problems that might be -introduced by others. - - Finally, software patents pose a constant threat to the existence of -any free program. We wish to make sure that a company cannot -effectively restrict the users of a free program by obtaining a -restrictive license from a patent holder. Therefore, we insist that -any patent license obtained for a version of the library must be -consistent with the full freedom of use specified in this license. - - Most GNU software, including some libraries, is covered by the -ordinary GNU General Public License. This license, the GNU Lesser -General Public License, applies to certain designated libraries, and -is quite different from the ordinary General Public License. We use -this license for certain libraries in order to permit linking those -libraries into non-free programs. - - When a program is linked with a library, whether statically or using -a shared library, the combination of the two is legally speaking a -combined work, a derivative of the original library. The ordinary -General Public License therefore permits such linking only if the -entire combination fits its criteria of freedom. The Lesser General -Public License permits more lax criteria for linking other code with -the library. - - We call this license the "Lesser" General Public License because it -does Less to protect the user's freedom than the ordinary General -Public License. It also provides other free software developers Less -of an advantage over competing non-free programs. These disadvantages -are the reason we use the ordinary General Public License for many -libraries. However, the Lesser license provides advantages in certain -special circumstances. - - For example, on rare occasions, there may be a special need to -encourage the widest possible use of a certain library, so that it -becomes a de-facto standard. To achieve this, non-free programs must -be allowed to use the library. A more frequent case is that a free -library does the same job as widely used non-free libraries. In this -case, there is little to gain by limiting the free library to free -software only, so we use the Lesser General Public License. - - In other cases, permission to use a particular library in non-free -programs enables a greater number of people to use a large body of -free software. For example, permission to use the GNU C Library in -non-free programs enables many more people to use the whole GNU -operating system, as well as its variant, the GNU/Linux operating -system. - - Although the Lesser General Public License is Less protective of the -users' freedom, it does ensure that the user of a program that is -linked with the Library has the freedom and the wherewithal to run -that program using a modified version of the Library. - - The precise terms and conditions for copying, distribution and -modification follow. Pay close attention to the difference between a -"work based on the library" and a "work that uses the library". The -former contains code derived from the library, whereas the latter must -be combined with the library in order to run. - - GNU LESSER GENERAL PUBLIC LICENSE - TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION - - 0. This License Agreement applies to any software library or other -program which contains a notice placed by the copyright holder or -other authorized party saying it may be distributed under the terms of -this Lesser General Public License (also called "this License"). -Each licensee is addressed as "you". - - A "library" means a collection of software functions and/or data -prepared so as to be conveniently linked with application programs -(which use some of those functions and data) to form executables. - - The "Library", below, refers to any such software library or work -which has been distributed under these terms. A "work based on the -Library" means either the Library or any derivative work under -copyright law: that is to say, a work containing the Library or a -portion of it, either verbatim or with modifications and/or translated -straightforwardly into another language. (Hereinafter, translation is -included without limitation in the term "modification".) - - "Source code" for a work means the preferred form of the work for -making modifications to it. For a library, complete source code means -all the source code for all modules it contains, plus any associated -interface definition files, plus the scripts used to control -compilation and installation of the library. - - Activities other than copying, distribution and modification are not -covered by this License; they are outside its scope. The act of -running a program using the Library is not restricted, and output from -such a program is covered only if its contents constitute a work based -on the Library (independent of the use of the Library in a tool for -writing it). Whether that is true depends on what the Library does -and what the program that uses the Library does. - - 1. You may copy and distribute verbatim copies of the Library's -complete source code as you receive it, in any medium, provided that -you conspicuously and appropriately publish on each copy an -appropriate copyright notice and disclaimer of warranty; keep intact -all the notices that refer to this License and to the absence of any -warranty; and distribute a copy of this License along with the -Library. - - You may charge a fee for the physical act of transferring a copy, -and you may at your option offer warranty protection in exchange for a -fee. - - 2. You may modify your copy or copies of the Library or any portion -of it, thus forming a work based on the Library, and copy and -distribute such modifications or work under the terms of Section 1 -above, provided that you also meet all of these conditions: - - a) The modified work must itself be a software library. - - b) You must cause the files modified to carry prominent notices - stating that you changed the files and the date of any change. - - c) You must cause the whole of the work to be licensed at no - charge to all third parties under the terms of this License. - - d) If a facility in the modified Library refers to a function or a - table of data to be supplied by an application program that uses - the facility, other than as an argument passed when the facility - is invoked, then you must make a good faith effort to ensure that, - in the event an application does not supply such function or - table, the facility still operates, and performs whatever part of - its purpose remains meaningful. - - (For example, a function in a library to compute square roots has - a purpose that is entirely well-defined independent of the - application. Therefore, Subsection 2d requires that any - application-supplied function or table used by this function must - be optional: if the application does not supply it, the square - root function must still compute square roots.) - -These requirements apply to the modified work as a whole. If -identifiable sections of that work are not derived from the Library, -and can be reasonably considered independent and separate works in -themselves, then this License, and its terms, do not apply to those -sections when you distribute them as separate works. But when you -distribute the same sections as part of a whole which is a work based -on the Library, the distribution of the whole must be on the terms of -this License, whose permissions for other licensees extend to the -entire whole, and thus to each and every part regardless of who wrote -it. - -Thus, it is not the intent of this section to claim rights or contest -your rights to work written entirely by you; rather, the intent is to -exercise the right to control the distribution of derivative or -collective works based on the Library. - -In addition, mere aggregation of another work not based on the Library -with the Library (or with a work based on the Library) on a volume of -a storage or distribution medium does not bring the other work under -the scope of this License. - - 3. You may opt to apply the terms of the ordinary GNU General Public -License instead of this License to a given copy of the Library. To do -this, you must alter all the notices that refer to this License, so -that they refer to the ordinary GNU General Public License, version 2, -instead of to this License. (If a newer version than version 2 of the -ordinary GNU General Public License has appeared, then you can specify -that version instead if you wish.) Do not make any other change in -these notices. - - Once this change is made in a given copy, it is irreversible for -that copy, so the ordinary GNU General Public License applies to all -subsequent copies and derivative works made from that copy. - - This option is useful when you wish to copy part of the code of -the Library into a program that is not a library. - - 4. You may copy and distribute the Library (or a portion or -derivative of it, under Section 2) in object code or executable form -under the terms of Sections 1 and 2 above provided that you accompany -it with the complete corresponding machine-readable source code, which -must be distributed under the terms of Sections 1 and 2 above on a -medium customarily used for software interchange. - - If distribution of object code is made by offering access to copy -from a designated place, then offering equivalent access to copy the -source code from the same place satisfies the requirement to -distribute the source code, even though third parties are not -compelled to copy the source along with the object code. - - 5. A program that contains no derivative of any portion of the -Library, but is designed to work with the Library by being compiled or -linked with it, is called a "work that uses the Library". Such a -work, in isolation, is not a derivative work of the Library, and -therefore falls outside the scope of this License. - - However, linking a "work that uses the Library" with the Library -creates an executable that is a derivative of the Library (because it -contains portions of the Library), rather than a "work that uses the -library". The executable is therefore covered by this License. -Section 6 states terms for distribution of such executables. - - When a "work that uses the Library" uses material from a header file -that is part of the Library, the object code for the work may be a -derivative work of the Library even though the source code is not. -Whether this is true is especially significant if the work can be -linked without the Library, or if the work is itself a library. The -threshold for this to be true is not precisely defined by law. - - If such an object file uses only numerical parameters, data -structure layouts and accessors, and small macros and small inline -functions (ten lines or less in length), then the use of the object -file is unrestricted, regardless of whether it is legally a derivative -work. (Executables containing this object code plus portions of the -Library will still fall under Section 6.) - - Otherwise, if the work is a derivative of the Library, you may -distribute the object code for the work under the terms of Section 6. -Any executables containing that work also fall under Section 6, -whether or not they are linked directly with the Library itself. - - 6. As an exception to the Sections above, you may also combine or -link a "work that uses the Library" with the Library to produce a -work containing portions of the Library, and distribute that work -under terms of your choice, provided that the terms permit -modification of the work for the customer's own use and reverse -engineering for debugging such modifications. - - You must give prominent notice with each copy of the work that the -Library is used in it and that the Library and its use are covered by -this License. You must supply a copy of this License. If the work -during execution displays copyright notices, you must include the -copyright notice for the Library among them, as well as a reference -directing the user to the copy of this License. Also, you must do one -of these things: - - a) Accompany the work with the complete corresponding - machine-readable source code for the Library including whatever - changes were used in the work (which must be distributed under - Sections 1 and 2 above); and, if the work is an executable linked - with the Library, with the complete machine-readable "work that - uses the Library", as object code and/or source code, so that the - user can modify the Library and then relink to produce a modified - executable containing the modified Library. (It is understood - that the user who changes the contents of definitions files in the - Library will not necessarily be able to recompile the application - to use the modified definitions.) - - b) Use a suitable shared library mechanism for linking with the - Library. A suitable mechanism is one that (1) uses at run time a - copy of the library already present on the user's computer system, - rather than copying library functions into the executable, and (2) - will operate properly with a modified version of the library, if - the user installs one, as long as the modified version is - interface-compatible with the version that the work was made with. - - c) Accompany the work with a written offer, valid for at least - three years, to give the same user the materials specified in - Subsection 6a, above, for a charge no more than the cost of - performing this distribution. - - d) If distribution of the work is made by offering access to copy - from a designated place, offer equivalent access to copy the above - specified materials from the same place. - - e) Verify that the user has already received a copy of these - materials or that you have already sent this user a copy. - - For an executable, the required form of the "work that uses the -Library" must include any data and utility programs needed for -reproducing the executable from it. However, as a special exception, -the materials to be distributed need not include anything that is -normally distributed (in either source or binary form) with the major -components (compiler, kernel, and so on) of the operating system on -which the executable runs, unless that component itself accompanies -the executable. - - It may happen that this requirement contradicts the license -restrictions of other proprietary libraries that do not normally -accompany the operating system. Such a contradiction means you cannot -use both them and the Library together in an executable that you -distribute. - - 7. You may place library facilities that are a work based on the -Library side-by-side in a single library together with other library -facilities not covered by this License, and distribute such a combined -library, provided that the separate distribution of the work based on -the Library and of the other library facilities is otherwise -permitted, and provided that you do these two things: - - a) Accompany the combined library with a copy of the same work - based on the Library, uncombined with any other library - facilities. This must be distributed under the terms of the - Sections above. - - b) Give prominent notice with the combined library of the fact - that part of it is a work based on the Library, and explaining - where to find the accompanying uncombined form of the same work. - - 8. You may not copy, modify, sublicense, link with, or distribute -the Library except as expressly provided under this License. Any -attempt otherwise to copy, modify, sublicense, link with, or -distribute the Library is void, and will automatically terminate your -rights under this License. However, parties who have received copies, -or rights, from you under this License will not have their licenses -terminated so long as such parties remain in full compliance. - - 9. You are not required to accept this License, since you have not -signed it. However, nothing else grants you permission to modify or -distribute the Library or its derivative works. These actions are -prohibited by law if you do not accept this License. Therefore, by -modifying or distributing the Library (or any work based on the -Library), you indicate your acceptance of this License to do so, and -all its terms and conditions for copying, distributing or modifying -the Library or works based on it. - - 10. Each time you redistribute the Library (or any work based on the -Library), the recipient automatically receives a license from the -original licensor to copy, distribute, link with or modify the Library -subject to these terms and conditions. You may not impose any further -restrictions on the recipients' exercise of the rights granted herein. -You are not responsible for enforcing compliance by third parties with -this License. - - 11. If, as a consequence of a court judgment or allegation of patent -infringement or for any other reason (not limited to patent issues), -conditions are imposed on you (whether by court order, agreement or -otherwise) that contradict the conditions of this License, they do not -excuse you from the conditions of this License. If you cannot -distribute so as to satisfy simultaneously your obligations under this -License and any other pertinent obligations, then as a consequence you -may not distribute the Library at all. For example, if a patent -license would not permit royalty-free redistribution of the Library by -all those who receive copies directly or indirectly through you, then -the only way you could satisfy both it and this License would be to -refrain entirely from distribution of the Library. - -If any portion of this section is held invalid or unenforceable under -any particular circumstance, the balance of the section is intended to -apply, and the section as a whole is intended to apply in other -circumstances. - -It is not the purpose of this section to induce you to infringe any -patents or other property right claims or to contest validity of any -such claims; this section has the sole purpose of protecting the -integrity of the free software distribution system which is -implemented by public license practices. Many people have made -generous contributions to the wide range of software distributed -through that system in reliance on consistent application of that -system; it is up to the author/donor to decide if he or she is willing -to distribute software through any other system and a licensee cannot -impose that choice. - -This section is intended to make thoroughly clear what is believed to -be a consequence of the rest of this License. - - 12. If the distribution and/or use of the Library is restricted in -certain countries either by patents or by copyrighted interfaces, the -original copyright holder who places the Library under this License -may add an explicit geographical distribution limitation excluding those -countries, so that distribution is permitted only in or among -countries not thus excluded. In such case, this License incorporates -the limitation as if written in the body of this License. - - 13. The Free Software Foundation may publish revised and/or new -versions of the Lesser General Public License from time to time. -Such new versions will be similar in spirit to the present version, -but may differ in detail to address new problems or concerns. - -Each version is given a distinguishing version number. If the Library -specifies a version number of this License which applies to it and -"any later version", you have the option of following the terms and -conditions either of that version or of any later version published by -the Free Software Foundation. If the Library does not specify a -license version number, you may choose any version ever published by -the Free Software Foundation. - - 14. If you wish to incorporate parts of the Library into other free -programs whose distribution conditions are incompatible with these, -write to the author to ask for permission. For software which is -copyrighted by the Free Software Foundation, write to the Free -Software Foundation; we sometimes make exceptions for this. Our -decision will be guided by the two goals of preserving the free status -of all derivatives of our free software and of promoting the sharing -and reuse of software generally. - - NO WARRANTY - - 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO -WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. -EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR -OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY -KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE -IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE -LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME -THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. - - 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN -WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY -AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU -FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR -CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE -LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING -RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A -FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF -SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH -DAMAGES. - - END OF TERMS AND CONDITIONS - - How to Apply These Terms to Your New Libraries - - If you develop a new library, and you want it to be of the greatest -possible use to the public, we recommend making it free software that -everyone can redistribute and change. You can do so by permitting -redistribution under these terms (or, alternatively, under the terms -of the ordinary General Public License). - - To apply these terms, attach the following notices to the library. -It is safest to attach them to the start of each source file to most -effectively convey the exclusion of warranty; and each file should -have at least the "copyright" line and a pointer to where the full -notice is found. - - - - Copyright (C) - - This library is free software; you can redistribute it and/or - modify it under the terms of the GNU Lesser General Public - License as published by the Free Software Foundation; either - version 2.1 of the License, or (at your option) any later version. - - This library 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 for more details. - - You should have received a copy of the GNU Lesser General Public - License along with this library; if not, write to the Free Software - Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - -Also add information on how to contact you by electronic and paper mail. - -You should also get your employer (if you work as a programmer) or -your school, if any, to sign a "copyright disclaimer" for the library, -if necessary. Here is a sample; alter the names: - - Yoyodyne, Inc., hereby disclaims all copyright interest in the - library `Frob' (a library for tweaking knobs) written by James - Random Hacker. - - , 1 April 1990 - Ty Coon, President of Vice - -That's all there is to it! - - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/Todo.txt b/Build/source/libs/graphite2/graphite2-1.2.0/Todo.txt deleted file mode 100644 index 52f7509f87a..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/Todo.txt +++ /dev/null @@ -1,9 +0,0 @@ -Changes to make to the API when we are forced to change it: - -* add font table deletion function ptr so that the app doesn't have to - manage a collection of font tables - -Other stuff we should do - -* Change logging generation id to be a magic extra user attribute. This allows for use within justification logging. Also add [ ] around the whoe log to bring the fragments together. - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/graphite2.pc.in b/Build/source/libs/graphite2/graphite2-1.2.0/graphite2.pc.in deleted file mode 100644 index a4f19b39ce4..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/graphite2.pc.in +++ /dev/null @@ -1,7 +0,0 @@ - -Name: Graphite2 -Description: Font rendering engine for Complex Scripts -Version: ${version} -Libs: -L${libdir} -lgraphite2 -Cflags: -I${includedir} - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/include/graphite2/Font.h b/Build/source/libs/graphite2/graphite2-1.2.0/include/graphite2/Font.h deleted file mode 100644 index 39e4dcf7a19..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/include/graphite2/Font.h +++ /dev/null @@ -1,389 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - - Alternatively, the contents of this file may be used under the terms - of the Mozilla Public License (http://mozilla.org/MPL) or the GNU - General Public License, as published by the Free Software Foundation, - either version 2 of the License or (at your option) any later version. -*/ -#pragma once - -#include "graphite2/Types.h" - -#define GR2_VERSION_MAJOR 1 -#define GR2_VERSION_MINOR 2 -#define GR2_VERSION_BUGFIX 0 - -#ifdef __cplusplus -extern "C" -{ -#endif - -typedef struct gr_face gr_face; -typedef struct gr_font gr_font; -typedef struct gr_feature_ref gr_feature_ref; -typedef struct gr_feature_val gr_feature_val; - -/** -* Returns version information on this engine -*/ -GR2_API void gr_engine_version(int *nMajor, int *nMinor, int *nBugFix); - -/** -* The Face Options allow the application to require that certain tables are -* read during face construction. This may be of concern if the appFaceHandle -* used in the gr_get_table_fn may change. -* The values can be combined -*/ -enum gr_face_options { - /** No preload, no cmap caching, fail if the graphite tables are invalid */ - gr_face_default = 0, - /** Dumb rendering will be enabled if the graphite tables are invalid */ - gr_face_dumbRendering = 1, - /** preload glyphs at construction time */ - gr_face_preloadGlyphs = 2, - /** Cache the lookup from code point to glyph ID at construction time */ - gr_face_cacheCmap = 4, - /** Preload everything */ - gr_face_preloadAll = 6 -}; - -/** Holds information about a particular Graphite silf table that has been loaded */ -struct gr_faceinfo { - gr_uint16 extra_ascent; /**< The extra_ascent in the GDL, in design units */ - gr_uint16 extra_descent; /**< The extra_descent in the GDL, in design units */ - gr_uint16 upem; /**< The design units for the font */ - enum gr_space_contextuals { - gr_space_unknown = 0, /**< no information is known. */ - gr_space_none = 1, /**< the space character never occurs in any rules. */ - gr_space_left_only = 2, /**< the space character only occurs as the first element in a rule. */ - gr_space_right_only = 3, /**< the space character only occurs as the last element in a rule. */ - gr_space_either_only = 4, /**< the space character only occurs as the only element in a rule. */ - gr_space_both = 5, /**< the space character may occur as the first or last element of a rule. */ - gr_space_cross = 6 /**< the space character occurs in a rule not as a first or last element. */ - } space_contextuals; - unsigned int has_bidi_pass : 1; /**< the table specifies that a bidirectional pass should run */ - unsigned int line_ends : 1; /**< there are line end contextuals somewhere */ - unsigned int justifies : 1; /**< there are .justify properties set somewhere on some glyphs */ -}; - -typedef struct gr_faceinfo gr_faceinfo; - -/** type describing function to retrieve font table information - * - * @return a pointer to the table in memory. The pointed to memory must exist as - * long as the gr_face which makes the call. - * @param appFaceHandle is the unique information passed to gr_make_face() - * @param name is a 32bit tag to the table name. - * @param len returned by this function to say how long the table is in memory. - */ -typedef const void *(*gr_get_table_fn)(const void* appFaceHandle, unsigned int name, size_t *len); - -/** type describing function to release any resources allocated by the above get_table table function - * - * @param appFaceHandle is the unique information passed to gr_make_face() - * @param pointer to table memory returned by get_table. - */ -typedef void (*gr_release_table_fn)(const void* appFaceHandle, const void *table_buffer); - -/** struct housing function pointers to manage font table buffers for the graphite engine. */ -struct gr_face_ops -{ - /** size in bytes of this structure */ - size_t size; - /** a pointer to a function to request a table from the client. */ - gr_get_table_fn get_table; - /** is a pointer to a function to notify the client the a table can be released. - * This can be NULL to signify that the client does not wish to do any release handling. */ - gr_release_table_fn release_table; -}; -typedef struct gr_face_ops gr_face_ops; - -/** Create a gr_face object given application information and a table functions. - * - * @return gr_face or NULL if the font fails to load for some reason. - * @param appFaceHandle This is application specific information that is passed - * to the getTable function. The appFaceHandle must stay - * alive as long as the gr_face is alive. - * @param face_ops Pointer to face specific callback structure for table - * management. Must stay alive for the duration of the - * call only. - * @param faceOptions Bitfield describing various options. See enum gr_face_options for details. - */ -GR2_API gr_face* gr_make_face_with_ops(const void* appFaceHandle/*non-NULL*/, const gr_face_ops *face_ops, unsigned int faceOptions); - -/** Create a gr_face object given application information and a getTable function. This function is deprecated as of v1.2.0 in - * favour of gr_make_face_with_ops. - * - * @return gr_face or NULL if the font fails to load for some reason. - * @param appFaceHandle This is application specific information that is passed - * to the getTable function. The appFaceHandle must stay - * alive as long as the gr_face is alive. - * @param getTable Callback function to get table data. - * @param faceOptions Bitfield describing various options. See enum gr_face_options for details. - */ -GR2_API gr_face* gr_make_face(const void* appFaceHandle/*non-NULL*/, gr_get_table_fn getTable, unsigned int faceOptions); - -//#ifndef GRAPHITE2_NSEGCACHE -/** Create a gr_face object given application information, with subsegmental caching support - * - * @return gr_face or NULL if the font fails to load. - * @param appFaceHandle is a pointer to application specific information that is passed to getTable. - * This may not be NULL and must stay alive as long as the gr_face is alive. - * @param face_ops Pointer to face specific callback structure for table management. Must stay - * alive for the duration of the call only. - * @param segCacheMaxSize How large the segment cache is. - * @param faceOptions Bitfield of values from enum gr_face_options - */ -GR2_API gr_face* gr_make_face_with_seg_cache_and_ops(const void* appFaceHandle, const gr_face_ops *face_ops, unsigned int segCacheMaxSize, unsigned int faceOptions); - -/** Create a gr_face object given application information, with subsegmental caching support. - * This function is deprecated as of v1.2.0 in favour of gr_make_face_with_seg_cache_and_ops. - * - * @return gr_face or NULL if the font fails to load. - * @param appFaceHandle is a pointer to application specific information that is passed to getTable. - * This may not be NULL and must stay alive as long as the gr_face is alive. - * @param getTable The function graphite calls to access font table data - * @param segCacheMaxSize How large the segment cache is. - * @param faceOptions Bitfield of values from enum gr_face_options - */ -GR2_API gr_face* gr_make_face_with_seg_cache(const void* appFaceHandle, gr_get_table_fn getTable, unsigned int segCacheMaxSize, unsigned int faceOptions); -//#endif - -/** Convert a tag in a string into a gr_uint32 - * - * @return gr_uint32 tag, zero padded - * @param str a nul terminated string of which at most the first 4 characters are read - */ -GR2_API gr_uint32 gr_str_to_tag(const char *str); - -/** Convert a gr_uint32 tag into a string - * - * @param tag contains the tag to convert - * @param str is a pointer to a char array of at least size 4 bytes. The first 4 bytes of this array - * will be overwritten by this function. No nul is appended. - */ -GR2_API void gr_tag_to_str(gr_uint32 tag, char *str); - -/** Get feature values for a given language or default - * - * @return a copy of the default feature values for a given language. The application must call - * gr_featureval_destroy() to free this object when done. - * @param pFace The font face to get feature values from - * @param langname The language tag to get feature values for. If there is no such language or - * langname is 0, the default feature values for the font are returned. - * langname is right 0 padded and assumes lowercase. Thus the en langauge - * would be 0x656E0000. Langname may also be space padded, thus 0x656E2020. - */ -GR2_API gr_feature_val* gr_face_featureval_for_lang(const gr_face* pFace, gr_uint32 langname); - -/** Get feature reference for a given feature id from a face - * - * @return a feature reference corresponding to the given id. This data is part of the gr_face and - * will be freed when the face is destroyed. - * @param pFace Font face to get information on. - * @param featId Feature id tag to get reference to. - */ -GR2_API const gr_feature_ref* gr_face_find_fref(const gr_face* pFace, gr_uint32 featId); - -/** Returns number of feature references in a face **/ -GR2_API gr_uint16 gr_face_n_fref(const gr_face* pFace); - -/** Returns feature reference at given index in face **/ -GR2_API const gr_feature_ref* gr_face_fref(const gr_face* pFace, gr_uint16 i); - -/** Return number of languages the face knows about **/ -GR2_API unsigned short gr_face_n_languages(const gr_face* pFace); - -/** Returns a language id corresponding to a language of given index in the face **/ -GR2_API gr_uint32 gr_face_lang_by_index(const gr_face* pFace, gr_uint16 i); - -/** Destroy the given face and free its memory **/ -GR2_API void gr_face_destroy(gr_face *face); - -/** Returns the number of glyphs in the face **/ -GR2_API unsigned short gr_face_n_glyphs(const gr_face* pFace); - -/** Returns a faceinfo for the face and script **/ -GR2_API const gr_faceinfo *gr_face_info(const gr_face *pFace, gr_uint32 script); - -/** Returns whether the font supports a given Unicode character - * - * @return true if the character is supported. - * @param pFace face to test within - * @param usv Unicode Scalar Value of character to test - * @param script Tag of script for selecting which set of pseudo glyphs to test. May be NULL. - */ -GR2_API int gr_face_is_char_supported(const gr_face *pFace, gr_uint32 usv, gr_uint32 script); - -#ifndef GRAPHITE2_NFILEFACE -/** Create gr_face from a font file - * - * @return gr_face that accesses a font file directly. Returns NULL on failure. - * @param filename Full path and filename to font file - * @param faceOptions Bitfile from enum gr_face_options to control face options. - */ -GR2_API gr_face* gr_make_file_face(const char *filename, unsigned int faceOptions); - -//#ifndef GRAPHITE2_NSEGCACHE -/** Create gr_face from a font file, with subsegment caching support. - * - * @return gr_face that accesses a font file directly. Returns NULL on failure. - * @param filename Full path and filename to font file - * @param segCacheMaxSize Specifies how big to make the cache in segments. - * @param faceOptions Bitfield from enum gr_face_options to control face options. - */ -GR2_API gr_face* gr_make_file_face_with_seg_cache(const char *filename, unsigned int segCacheMaxSize, unsigned int faceOptions); -//#endif -#endif // !GRAPHITE2_NFILEFACE - -/** Create a font from a face - * - * @return gr_font Call font_destroy to free this font - * @param ppm Resolution of the font in pixels per em - * @param face Face this font corresponds to. This must stay alive as long as the font is alive. - */ -GR2_API gr_font* gr_make_font(float ppm, const gr_face *face); - -/** query function to find the hinted advance of a glyph - * - * @param appFontHandle is the unique information passed to gr_make_font_with_advance() - * @param glyphid is the glyph to retireve the hinted advance for. - */ -typedef float (*gr_advance_fn)(const void* appFontHandle, gr_uint16 glyphid); - -/** struct housing function pointers to manage font hinted metrics for the - * graphite engine. */ -struct gr_font_ops -{ - /** size of the structure in bytes to allow for future extensibility */ - size_t size; - /** a pointer to a function to retrieve the hinted - * advance width of a glyph which the font cannot - * provide without client assistance. This can be - * NULL to signify no horizontal hinted metrics are necessary. */ - gr_advance_fn glyph_advance_x; - /** a pointer to a function to retrieve the hinted - * advance height of a glyph which the font cannot - * provide without client assistance. This can be - * NULL to signify no horizontal hinted metrics are necessary. */ - gr_advance_fn glyph_advance_y; -}; -typedef struct gr_font_ops gr_font_ops; - -/** Creates a font with hinted advance width query functions - * - * @return gr_font to be destroyed via font_destroy - * @param ppm size of font in pixels per em - * @param appFontHandle font specific information that must stay alive as long - * as the font does - * @param font_ops pointer font specific callback structure for hinted metrics. - * Must stay alive for the duration of the call. - * @param face the face this font corresponds to. Must stay alive as long as - * the font does. - */ -GR2_API gr_font* gr_make_font_with_ops(float ppm, const void* appFontHandle, const gr_font_ops * font_ops, const gr_face *face); - -/** Creates a font with hinted advance width query function. - * This function is deprecated. Use gr_make_font_with_ops instead. - * - * @return gr_font to be destroyed via font_destroy - * @param ppm size of font in pixels per em - * @param appFontHandle font specific information that must stay alive as long - * as the font does - * @param getAdvance callback function reference that returns horizontal advance in pixels for a glyph. - * Must stay alive for the duration of the call. - * @param face the face this font corresponds to. Must stay alive as long as - * the font does. - */ -GR2_API gr_font* gr_make_font_with_advance_fn(float ppm, const void* appFontHandle, gr_advance_fn getAdvance, const gr_face *face); - -/** Free a font **/ -GR2_API void gr_font_destroy(gr_font *font); - -/** get a feature value - * - * @return value of specific feature or 0 if any problems. - * @param pfeatureref gr_feature_ref to the feature - * @param feats gr_feature_val containing all the values - */ -GR2_API gr_uint16 gr_fref_feature_value(const gr_feature_ref* pfeatureref, const gr_feature_val* feats); - -/** set a feature value - * - * @return false if there were any problems (value out of range, etc.) - * @param pfeatureref gr_feature_ref to the feature - * @param val value to set the feature to - * @param pDest the gr_feature_val containing all the values for all the features - */ -GR2_API int gr_fref_set_feature_value(const gr_feature_ref* pfeatureref, gr_uint16 val, gr_feature_val* pDest); - -/** Returns the id tag for a gr_feature_ref **/ -GR2_API gr_uint32 gr_fref_id(const gr_feature_ref* pfeatureref); - -/** Returns number of values a feature may take, given a gr_feature_ref **/ -GR2_API gr_uint16 gr_fref_n_values(const gr_feature_ref* pfeatureref); - -/** Returns the value associated with a particular value in a feature - * - * @return value - * @param pfeatureref gr_feature_ref of the feature of interest - * @param settingno Index up to the return value of gr_fref_n_values() of the value - */ -GR2_API gr_int16 gr_fref_value(const gr_feature_ref* pfeatureref, gr_uint16 settingno); - -/** Returns a string of the UI name of a feature - * - * @return string of the UI name, in the encoding form requested. Call gr_label_destroy() after use. - * @param pfeatureref gr_feature_ref of the feature - * @param langId This is a pointer since the face may not support a string in the requested - * language. The actual language of the string is returned in langId - * @param utf Encoding form for the string - * @param length Used to return the length of the string returned in bytes. - */ -GR2_API void* gr_fref_label(const gr_feature_ref* pfeatureref, gr_uint16 *langId, enum gr_encform utf, gr_uint32 *length); - -/** Return a UI string for a possible value of a feature - * - * @return string of the UI name, in the encoding form requested. nul terminated. Call gr_label_destroy() - * after use. - * @param pfeatureref gr_feature_ref of the feature - * @param settingno Value setting index - * @param langId This is a pointer to the requested language. The requested language id is - * replaced by the actual language id of the string returned. - * @param utf Encoding form for the string - * @param length Returns the length of the string returned in bytes. - */ -GR2_API void* gr_fref_value_label(const gr_feature_ref* pfeatureref, gr_uint16 settingno/*rather than a value*/, gr_uint16 *langId, enum gr_encform utf, gr_uint32 *length); - -/** Destroy a previously returned label string **/ -GR2_API void gr_label_destroy(void * label); - -/** Copies a gr_feature_val **/ -GR2_API gr_feature_val* gr_featureval_clone(const gr_feature_val* pfeatures); - -/** Destroys a gr_feature_val **/ -GR2_API void gr_featureval_destroy(gr_feature_val *pfeatures); - -#ifdef __cplusplus -} -#endif - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/include/graphite2/Log.h b/Build/source/libs/graphite2/graphite2-1.2.0/include/graphite2/Log.h deleted file mode 100644 index d1c6f0fe36f..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/include/graphite2/Log.h +++ /dev/null @@ -1,85 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - - Alternatively, the contents of this file may be used under the terms - of the Mozilla Public License (http://mozilla.org/MPL) or the GNU - General Public License, as published by the Free Software Foundation, - either version 2 of the License or (at your option) any later version. -*/ -#pragma once - -#include -#include -#include - -#ifdef __cplusplus -extern "C" -{ -#endif - -/** deprecated mechanism that doesn't do anything now. */ -typedef enum { - GRLOG_NONE = 0x0, - GRLOG_FACE = 0x01, - GRLOG_SEGMENT = 0x02, - GRLOG_PASS = 0x04, - GRLOG_CACHE = 0x08, - - GRLOG_OPCODE = 0x80, - GRLOG_ALL = 0xFF -} GrLogMask; - -/** Start logging all segment creation and updates on the provided face. This - * is logged to a JSON file, see "Segment JSON Schema.txt" for a precise - * definition of the file - * - * @return true if the file was successfully created and logging is correctly - * initialised. - * @param face the gr_face whose segments you want to log to the given file - * @param log_path a utf8 encoded file name and path to log to. - */ -GR2_API bool gr_start_logging(gr_face * face, const char *log_path); - - -/** Stop logging on the given face. This will close the log file created by - * gr_start_logging. - * - * @param face the gr_face whose segments you want to stop logging - */ -GR2_API void gr_stop_logging(gr_face * face); - -/** Start logging to a FILE object. - * This function is deprecated as of 1.2.0, use the _face versions instead. - * - * @return True on success - * @param logfile FILE reference to output logging to - * @param mask What aspects of logging to report (ignored) - */ -GR2_API bool graphite_start_logging(FILE * logFile, GrLogMask mask); //may not do anthing if disabled in the implementation of the engine. - -/** Stop logging to a FILE object. - * This function is deprecated as of 1.2.0, use the _face versions instead. - */ -GR2_API void graphite_stop_logging(); - -#ifdef __cplusplus -} -#endif diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/include/graphite2/Segment.h b/Build/source/libs/graphite2/graphite2-1.2.0/include/graphite2/Segment.h deleted file mode 100644 index 051c8ed7783..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/include/graphite2/Segment.h +++ /dev/null @@ -1,400 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - - Alternatively, the contents of this file may be used under the terms - of the Mozilla Public License (http://mozilla.org/MPL) or the GNU - General Public License, as published by the Free Software Foundation, - either version 2 of the License or (at your option) any later version. -*/ -#pragma once - -#include "graphite2/Types.h" -#include "graphite2/Font.h" - -#ifdef __cplusplus -extern "C" -{ -#endif - -enum gr_break_weight { - gr_breakNone = 0, - /* after break weights */ - gr_breakWhitespace = 10, - gr_breakWord = 15, - gr_breakIntra = 20, - gr_breakLetter = 30, - gr_breakClip = 40, - /* before break weights */ - gr_breakBeforeWhitespace = -10, - gr_breakBeforeWord = -15, - gr_breakBeforeIntra = -20, - gr_breakBeforeLetter = -30, - gr_breakBeforeClip = -40 -}; - -enum gr_justFlags { - /// Indicates that this segment is a complete line - gr_justCompleteLine = 0, - /// Indicates that the start of the slot list is not at the start of a line - gr_justStartInline = 1, - /// Indicates that the end of the slot list is not at the end of a line - gr_justEndInline = 2 -}; - -/** Used for looking up slot attributes. Most are already available in other functions **/ -enum gr_attrCode { - /// adjusted glyph advance in x direction in design units - gr_slatAdvX = 0, - /// adjusted glyph advance in y direction (usually 0) in design units - gr_slatAdvY, - /// returns 0. Deprecated. - gr_slatAttTo, - /// This slot attaches to its parent at the given design units in the x direction - gr_slatAttX, - /// This slot attaches to its parent at the given design units in the y direction - gr_slatAttY, - /// This slot attaches to its parent at the given glyph point (not implemented) - gr_slatAttGpt, - /// x-direction adjustment from the given glyph point (not implemented) - gr_slatAttXOff, - /// y-direction adjustment from the given glyph point (not implemented) - gr_slatAttYOff, - /// Where on this glyph should align with the attachment point on the parent glyph in the x-direction. - gr_slatAttWithX, - /// Where on this glyph should align with the attachment point on the parent glyph in the y-direction - gr_slatAttWithY, - /// Which glyph point on this glyph should align with the attachment point on the parent glyph (not implemented). - gr_slatWithGpt, - /// Adjustment to gr_slatWithGpt in x-direction (not implemented) - gr_slatAttWithXOff, - /// Adjustment to gr_slatWithGpt in y-direction (not implemented) - gr_slatAttWithYOff, - /// Attach at given nesting level (not implemented) - gr_slatAttLevel, - /// Line break breakweight for this glyph - gr_slatBreak, - /// Ligature component reference (not implemented) - gr_slatCompRef, - /// bidi directionality of this glyph (not implemented) - gr_slatDir, - /// Whether insertion is allowed before this glyph - gr_slatInsert, - /// Final positioned position of this glyph relative to its parent in x-direction in pixels - gr_slatPosX, - /// Final positioned position of this glyph relative to its parent in y-direction in pixels - gr_slatPosY, - /// Amount to shift glyph by in x-direction design units - gr_slatShiftX, - /// Amount to shift glyph by in y-direction design units - gr_slatShiftY, - /// attribute user1 - gr_slatUserDefnV1, - /// not implemented - gr_slatMeasureSol, - /// not implemented - gr_slatMeasureEol, - /// Amount this slot can stretch (not implemented) - gr_slatJStretch, - /// Amount this slot can shrink (not implemented) - gr_slatJShrink, - /// Granularity by which this slot can stretch or shrink (not implemented) - gr_slatJStep, - /// Justification weight for this glyph (not implemented) - gr_slatJWeight, - /// Amount this slot mush shrink or stretch in design units - gr_slatJWidth, - /// SubSegment split point - gr_slatSegSplit = gr_slatJStretch + 29, - /// User defined attribute, see subattr for user attr number - gr_slatUserDefn, - - /// not implemented - gr_slatMax, - /// not implemented - gr_slatNoEffect = gr_slatMax + 1 -}; - -enum gr_bidirtl { - /// Underlying paragraph direction is RTL - gr_rtl = 1, - /// Set this to not run the bidi pass internally, even if the font asks for it. - /// This presumes that the segment is in a single direction. - gr_nobidi = 2, - /// Disable auto mirroring for rtl text - gr_nomirror = 4 -}; - -typedef struct gr_char_info gr_char_info; -typedef struct gr_segment gr_segment; -typedef struct gr_slot gr_slot; - -/** Returns Unicode character for a charinfo. - * - * @param p Pointer to charinfo to return information on. - */ -GR2_API unsigned int gr_cinfo_unicode_char(const gr_char_info* p/*not NULL*/); - -/** Returns breakweight for a charinfo. - * - * @return Breakweight is a number between -50 and 50 indicating the cost of a - * break before or after this character. - * @param p Pointer to charinfo to return information on. - */ -GR2_API int gr_cinfo_break_weight(const gr_char_info* p/*not NULL*/); - -/** Returns the slot index that after this character is after in the slot stream - * - * @return after slot index between 0 and gr_seg_n_slots() - * @param p Pointer to charinfo to return information on. - */ -GR2_API int gr_cinfo_after(const gr_char_info* p/*not NULL*/); - -/** Returns the slot index that before this character is before in the slot stream - * - * @return before slot index between 0 and gr_seg_n_slots() - * @param p Pointer to charinfo to return information on. - */ -GR2_API int gr_cinfo_before(const gr_char_info* p/*not NULL*/); - -/** Returns the code unit index of this character in the input string - * - * @return code unit index between 0 and the end of the string - * @param p Pointer to charinfo to return information on. - */ -GR2_API size_t gr_cinfo_base(const gr_char_info* p/*not NULL*/); - -/** Returns the number of unicode characters in a string. - * - * @return number of characters in the string - * @param enc Specifies the type of data in the string: utf8, utf16, utf32 - * @param buffer_begin The start of the string - * @param buffer_end Measure up to the first nul or when end is reached, whichever is earliest. - * This parameter may be NULL. - * @param pError If there is a structural fault in the string, the location is returned - * in this variable. If no error occurs, pError will contain NULL. NULL - * may be passed for pError if no such information is required. - */ -GR2_API size_t gr_count_unicode_characters(enum gr_encform enc, const void* buffer_begin, const void* buffer_end, const void** pError); - -/** Creates and returns a segment. - * - * @return a segment that needs seg_destroy called on it. May return NULL if bad problems - * in segment processing. - * @param font Gives the size of the font in pixels per em for final positioning. If - * NULL, positions are returned in design units, i.e. at a ppm of the upem - * of the face. - * @param face The face containing all the non-size dependent information. - * @param script This is a tag containing a script identifier that is used to choose - * which graphite table within the font to use. Maybe 0. Tag may be 4 chars - * NULL padded in LSBs or space padded in LSBs. - * @param pFeats Pointer to a feature values to be used for the segment. Only one - * feature values may be used for a segment. If NULL the default features - * for the font will be used. - * @param enc Specifies what encoding form the string is in (utf8, utf16, utf32) - * @param pStart Start of the string - * @param nChars Number of unicode characters to process in the string. The string will - * be processed either up to the first NULL or until nChars have been - * processed. nChars is also used to initialise the internal memory - * allocations of the segment. So it is wise not to make nChars too much - * greater than the actual number of characters being processed. - * @param dir Specifies whether the segment is processed right to left (1) or left to - * right (0) and whether to run the internal bidi pass, if a font requests it. - * See enum gr_bidirtl for details. - */ -GR2_API gr_segment* gr_make_seg(const gr_font* font, const gr_face* face, gr_uint32 script, const gr_feature_val* pFeats, enum gr_encform enc, const void* pStart, size_t nChars, int dir); - -/** Destroys a segment, freeing the memory. - * - * @param p The segment to destroy - */ -GR2_API void gr_seg_destroy(gr_segment* p); - -/** Returns the advance for the whole segment. - * - * Returns the width of the segment up to the next glyph origin after the segment - */ -GR2_API float gr_seg_advance_X(const gr_segment* pSeg/*not NULL*/); - -/** Returns the height advance for the segment. **/ -GR2_API float gr_seg_advance_Y(const gr_segment* pSeg/*not NULL*/); - -/** Returns the number of gr_char_infos in the segment. **/ -GR2_API unsigned int gr_seg_n_cinfo(const gr_segment* pSeg/*not NULL*/); - -/** Returns a gr_char_info at a given index in the segment. **/ -GR2_API const gr_char_info* gr_seg_cinfo(const gr_segment* pSeg/*not NULL*/, unsigned int index/*must be - -typedef unsigned char gr_uint8; -typedef gr_uint8 gr_byte; -typedef signed char gr_int8; -typedef unsigned short gr_uint16; -typedef short gr_int16; -typedef unsigned int gr_uint32; -typedef int gr_int32; - -enum gr_encform { - gr_utf8 = 1/*sizeof(uint8)*/, gr_utf16 = 2/*sizeof(uint16)*/, gr_utf32 = 4/*sizeof(uint32)*/ -}; - -// Definitions for library publicly exported symbols -#if defined _WIN32 || defined __CYGWIN__ - #if defined GRAPHITE2_STATIC - #define GR2_API - #elif defined GRAPHITE2_EXPORTING - #if defined __GNUC__ - #define GR2_API __attribute__((dllexport)) - #else - #define GR2_API __declspec(dllexport) - #endif - #else - #if defined __GNUC__ - #define GR2_API __attribute__((dllimport)) - #else - #define GR2_API __declspec(dllimport) - #endif - #endif - #define GR2_LOCAL -#else - #if __GNUC__ >= 4 - #define GR2_API __attribute__ ((visibility("default"))) - #define GR2_LOCAL __attribute__ ((visibility("hidden"))) - #else - #define GR2_API - #define GR2_LOCAL - #endif -#endif diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/Bidi.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/Bidi.cpp deleted file mode 100644 index b612a81e647..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/Bidi.cpp +++ /dev/null @@ -1,578 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include "inc/Main.h" -#include "inc/Slot.h" -#include "inc/Segment.h" - -using namespace graphite2; - -enum DirCode { // Hungarian: dirc - Unk = -1, - N = 0, // other neutrals (default) - ON - L = 1, // left-to-right, strong - L - R = 2, // right-to-left, strong - R - AL = 3, // Arabic letter, right-to-left, strong, AR - EN = 4, // European number, left-to-right, weak - EN - ES = 5, // European separator, left-to-right, weak - ES - ET = 6, // European number terminator, left-to-right, weak - ET - AN = 7, // Arabic number, left-to-right, weak - AN - CS = 8, // Common number separator, left-to-right, weak - CS - WS = 9, // white space, neutral - WS - BN = 10, // boundary neutral - BN - - LRO = 11, // LTR override - RLO = 12, // RTL override - LRE = 13, // LTR embedding - RLE = 14, // RTL embedding - PDF = 15, // pop directional format - NSM = 16, // non-space mark - - ON = N -}; - -enum DirMask { - Nmask = 1, - Lmask = 2, - Rmask = 4, - ALmask = 8, - ENmask = 0x10, - ESmask = 0x20, - ETmask = 0x40, - ANmask = 0x80, - CSmask = 0x100, - WSmask = 0x200, - BNmask = 0x400, - LROmask = 0x800, - RLOmask = 0x1000, - LREmask = 0x2000, - RLEmask = 0x4000, - PDFmask = 0x8000, - NSMmask = 0x10000 -}; - -unsigned int bidi_class_map[] = { 0, 1, 2, 5, 4, 8, 9, 3, 7, 0, 0, 0, 0, 0, 0, 0, 6 }; -// Algorithms based on Unicode reference standard code. Thanks Asmus Freitag. -#define MAX_LEVEL 61 - -Slot *resolveExplicit(int level, int dir, Slot *s, int nNest = 0) -{ - int nLastValid = nNest; - Slot *res = NULL; - for ( ; s && !res; s = s->next()) - { - int cls = s->getBidiClass(); - switch(cls) - { - case LRO: - case LRE: - nNest++; - if (level & 1) - s->setBidiLevel(level + 1); - else - s->setBidiLevel(level + 2); - if (s->getBidiLevel() > MAX_LEVEL) - s->setBidiLevel(level); - else - { - s = resolveExplicit(s->getBidiLevel(), (cls == LRE ? N : L), s->next(), nNest); - nNest--; - if (s) continue; else break; - } - cls = BN; - s->setBidiClass(cls); - break; - - case RLO: - case RLE: - nNest++; - if (level & 1) - s->setBidiLevel(level + 2); - else - s->setBidiLevel(level + 1); - if (s->getBidiLevel() > MAX_LEVEL) - s->setBidiLevel(level); - else - { - s = resolveExplicit(s->getBidiLevel(), (cls == RLE ? N : R), s->next(), nNest); - nNest--; - if (s) continue; else break; - } - cls = BN; - s->setBidiClass(cls); - break; - - case PDF: - cls = BN; - s->setBidiClass(cls); - if (nNest) - { - if (nLastValid < nNest) - --nNest; - else - res = s; - } - break; - } - - if (dir != N) - cls = dir; - if (s) - { - s->setBidiLevel(level); - if (s->getBidiClass() != BN) - s->setBidiClass(cls); - } - else - break; - } - return res; -} - -// === RESOLVE WEAK TYPES ================================================ - -enum bidi_state // possible states -{ - xa, // arabic letter - xr, // right leter - xl, // left letter - - ao, // arabic lett. foll by ON - ro, // right lett. foll by ON - lo, // left lett. foll by ON - - rt, // ET following R - lt, // ET following L - - cn, // EN, AN following AL - ra, // arabic number foll R - re, // european number foll R - la, // arabic number foll L - le, // european number foll L - - ac, // CS following cn - rc, // CS following ra - rs, // CS,ES following re - lc, // CS following la - ls, // CS,ES following le - - ret, // ET following re - let, // ET following le -} ; - -enum bidi_state_mask -{ - xamask = 1, - xrmask = 2, - xlmask = 4, - aomask = 8, - romask = 0x10, - lomask = 0x20, - rtmask = 0x40, - ltmask = 0x80, - cnmask = 0x100, - ramask = 0x200, - remask = 0x400, - lamask = 0x800, - lemask = 0x1000, - acmask = 0x2000, - rcmask = 0x4000, - rsmask = 0x8000, - lcmask = 0x10000, - lsmask = 0x20000, - retmask = 0x40000, - letmask = 0x80000 -}; - -const bidi_state stateWeak[][10] = -{ - // N, L, R, AN, EN, AL,NSM, CS, ES, ET, -{ /*xa*/ ao, xl, xr, cn, cn, xa, xa, ao, ao, ao, /* arabic letter */ }, -{ /*xr*/ ro, xl, xr, ra, re, xa, xr, ro, ro, rt, /* right letter */ }, -{ /*xl*/ lo, xl, xr, la, le, xa, xl, lo, lo, lt, /* left letter */ }, - -{ /*ao*/ ao, xl, xr, cn, cn, xa, ao, ao, ao, ao, /* arabic lett. foll by ON*/ }, -{ /*ro*/ ro, xl, xr, ra, re, xa, ro, ro, ro, rt, /* right lett. foll by ON */ }, -{ /*lo*/ lo, xl, xr, la, le, xa, lo, lo, lo, lt, /* left lett. foll by ON */ }, - -{ /*rt*/ ro, xl, xr, ra, re, xa, rt, ro, ro, rt, /* ET following R */ }, -{ /*lt*/ lo, xl, xr, la, le, xa, lt, lo, lo, lt, /* ET following L */ }, - -{ /*cn*/ ao, xl, xr, cn, cn, xa, cn, ac, ao, ao, /* EN, AN following AL */ }, -{ /*ra*/ ro, xl, xr, ra, re, xa, ra, rc, ro, rt, /* arabic number foll R */ }, -{ /*re*/ ro, xl, xr, ra, re, xa, re, rs, rs,ret, /* european number foll R */ }, -{ /*la*/ lo, xl, xr, la, le, xa, la, lc, lo, lt, /* arabic number foll L */ }, -{ /*le*/ lo, xl, xr, la, le, xa, le, ls, ls,let, /* european number foll L */ }, - -{ /*ac*/ ao, xl, xr, cn, cn, xa, ao, ao, ao, ao, /* CS following cn */ }, -{ /*rc*/ ro, xl, xr, ra, re, xa, ro, ro, ro, rt, /* CS following ra */ }, -{ /*rs*/ ro, xl, xr, ra, re, xa, ro, ro, ro, rt, /* CS,ES following re */ }, -{ /*lc*/ lo, xl, xr, la, le, xa, lo, lo, lo, lt, /* CS following la */ }, -{ /*ls*/ lo, xl, xr, la, le, xa, lo, lo, lo, lt, /* CS,ES following le */ }, - -{ /*ret*/ ro, xl, xr, ra, re, xa,ret, ro, ro,ret, /* ET following re */ }, -{ /*let*/ lo, xl, xr, la, le, xa,let, lo, lo,let, /* ET following le */ }, - - -}; - -enum bidi_action // possible actions -{ - // primitives - IX = 0x100, // increment - XX = 0xF, // no-op - - // actions - xxx = (XX << 4) + XX, // no-op - xIx = IX + xxx, // increment run - xxN = (XX << 4) + ON, // set current to N - xxE = (XX << 4) + EN, // set current to EN - xxA = (XX << 4) + AN, // set current to AN - xxR = (XX << 4) + R, // set current to R - xxL = (XX << 4) + L, // set current to L - Nxx = (ON << 4) + 0xF, // set run to neutral - Axx = (AN << 4) + 0xF, // set run to AN - ExE = (EN << 4) + EN, // set run to EN, set current to EN - NIx = (ON << 4) + 0xF + IX, // set run to N, increment - NxN = (ON << 4) + ON, // set run to N, set current to N - NxR = (ON << 4) + R, // set run to N, set current to R - NxE = (ON << 4) + EN, // set run to N, set current to EN - - AxA = (AN << 4) + AN, // set run to AN, set current to AN - NxL = (ON << 4) + L, // set run to N, set current to L - LxL = (L << 4) + L, // set run to L, set current to L -}; - - -const bidi_action actionWeak[][10] = -{ - // N,.. L, R, AN, EN, AL, NSM, CS,..ES, ET, -{ /*xa*/ xxx, xxx, xxx, xxx, xxA, xxR, xxR, xxN, xxN, xxN, /* arabic letter */ }, -{ /*xr*/ xxx, xxx, xxx, xxx, xxE, xxR, xxR, xxN, xxN, xIx, /* right leter */ }, -{ /*xl*/ xxx, xxx, xxx, xxx, xxL, xxR, xxL, xxN, xxN, xIx, /* left letter */ }, - -{ /*ao*/ xxx, xxx, xxx, xxx, xxA, xxR, xxN, xxN, xxN, xxN, /* arabic lett. foll by ON */ }, -{ /*ro*/ xxx, xxx, xxx, xxx, xxE, xxR, xxN, xxN, xxN, xIx, /* right lett. foll by ON */ }, -{ /*lo*/ xxx, xxx, xxx, xxx, xxL, xxR, xxN, xxN, xxN, xIx, /* left lett. foll by ON */ }, - -{ /*rt*/ Nxx, Nxx, Nxx, Nxx, ExE, NxR, xIx, NxN, NxN, xIx, /* ET following R */ }, -{ /*lt*/ Nxx, Nxx, Nxx, Nxx, LxL, NxR, xIx, NxN, NxN, xIx, /* ET following L */ }, - -{ /*cn*/ xxx, xxx, xxx, xxx, xxA, xxR, xxA, xIx, xxN, xxN, /* EN, AN following AL */ }, -{ /*ra*/ xxx, xxx, xxx, xxx, xxE, xxR, xxA, xIx, xxN, xIx, /* arabic number foll R */ }, -{ /*re*/ xxx, xxx, xxx, xxx, xxE, xxR, xxE, xIx, xIx, xxE, /* european number foll R */ }, -{ /*la*/ xxx, xxx, xxx, xxx, xxL, xxR, xxA, xIx, xxN, xIx, /* arabic number foll L */ }, -{ /*le*/ xxx, xxx, xxx, xxx, xxL, xxR, xxL, xIx, xIx, xxL, /* european number foll L */ }, - -{ /*ac*/ Nxx, Nxx, Nxx, Axx, AxA, NxR, NxN, NxN, NxN, NxN, /* CS following cn */ }, -{ /*rc*/ Nxx, Nxx, Nxx, Axx, NxE, NxR, NxN, NxN, NxN, NIx, /* CS following ra */ }, -{ /*rs*/ Nxx, Nxx, Nxx, Nxx, ExE, NxR, NxN, NxN, NxN, NIx, /* CS,ES following re */ }, -{ /*lc*/ Nxx, Nxx, Nxx, Axx, NxL, NxR, NxN, NxN, NxN, NIx, /* CS following la */ }, -{ /*ls*/ Nxx, Nxx, Nxx, Nxx, LxL, NxR, NxN, NxN, NxN, NIx, /* CS,ES following le */ }, - -{ /*ret*/xxx, xxx, xxx, xxx, xxE, xxR, xxE, xxN, xxN, xxE, /* ET following re */ }, -{ /*let*/xxx, xxx, xxx, xxx, xxL, xxR, xxL, xxN, xxN, xxL, /* ET following le */ }, -}; - -inline uint8 GetDeferredType(bidi_action a) { return (a >> 4) & 0xF; } -inline uint8 GetResolvedType(bidi_action a) { return a & 0xF; } -inline DirCode EmbeddingDirection(int l) { return l & 1 ? R : L; } -inline bool IsDeferredState(bidi_state a) { return 0 != ((1 << a) & (rtmask | ltmask | acmask | rcmask | rsmask | lcmask | lsmask)); } -inline bool IsModifiedClass(DirCode a) { return 0 != ((1 << a) & (ALmask | NSMmask | ESmask | CSmask | ETmask | ENmask)); } - -void SetDeferredRunClass(Slot *s, Slot *sRun, int nval) -{ - if (!sRun || s == sRun) return; - for (Slot *p = s->prev(); p != sRun; p = p->prev()) - p->setBidiClass(nval); -} - -void resolveWeak(int baseLevel, Slot *s) -{ - int state = (baseLevel & 1) ? xr : xl; - int cls; - int level = baseLevel; - Slot *sRun = NULL; - Slot *sLast = s; - - for ( ; s; s = s->next()) - { - sLast = s; - cls = s->getBidiClass(); - if (cls == BN) - { - s->setBidiLevel(level); - if (!s->next() && level != baseLevel) - s->setBidiClass(EmbeddingDirection(level)); - else if (s->next() && level != s->next()->getBidiLevel() && s->next()->getBidiClass() != BN) - { - int newLevel = s->next()->getBidiLevel(); - if (level > newLevel) - newLevel = level; - s->setBidiLevel(newLevel); - s->setBidiClass(EmbeddingDirection(newLevel)); - level = s->next()->getBidiLevel(); - } - else - continue; - } - - bidi_action action = actionWeak[state][bidi_class_map[cls]]; - int clsRun = GetDeferredType(action); - if (clsRun != XX) - { - SetDeferredRunClass(s, sRun, clsRun); - sRun = NULL; - } - int clsNew = GetResolvedType(action); - if (clsNew != XX) - s->setBidiClass(clsNew); - if (!sRun && (IX & action)) - sRun = s->prev(); - state = stateWeak[state][bidi_class_map[cls]]; - } - - cls = EmbeddingDirection(level); - int clsRun = GetDeferredType(actionWeak[state][bidi_class_map[cls]]); - if (clsRun != XX) - SetDeferredRunClass(sLast, sRun, clsRun); -} - -// Neutrals -enum neutral_action -{ - // action to resolve previous input - nL = L, // resolve EN to L - En = 3 << 4, // resolve neutrals run to embedding level direction - Rn = R << 4, // resolve neutrals run to strong right - Ln = L << 4, // resolved neutrals run to strong left - In = (1<<8), // increment count of deferred neutrals - LnL = (1<<4)+L, // set run and EN to L -}; - -int GetDeferredNeutrals(int action, int level) -{ - action = (action >> 4) & 0xF; - if (action == (En >> 4)) - return EmbeddingDirection(level); - else - return action; -} - -int GetResolvedNeutrals(int action) -{ - action = action & 0xF; - if (action == In) - return 0; - else - return action; -} - -// state values -enum neutral_state -{ - // new temporary class - r, // R and characters resolved to R - l, // L and characters resolved to L - rn, // N preceded by right - ln, // N preceded by left - a, // AN preceded by left (the abbrev 'la' is used up above) - na, // N preceeded by a -} ; - -const uint8 neutral_class_map[] = { 0, 1, 2, 0, 4, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0 }; - -const int actionNeutrals[][5] = -{ -// N, L, R, AN, EN, = cls - // state = -{ In, 0, 0, 0, 0, }, // r right -{ In, 0, 0, 0, L, }, // l left - -{ In, En, Rn, Rn, Rn, }, // rn N preceded by right -{ In, Ln, En, En, LnL, }, // ln N preceded by left - -{ In, 0, 0, 0, L, }, // a AN preceded by left -{ In, En, Rn, Rn, En, }, // na N preceded by a -} ; - -const int stateNeutrals[][5] = -{ -// N, L, R, AN, EN = cls - // state = -{ rn, l, r, r, r, }, // r right -{ ln, l, r, a, l, }, // l left - -{ rn, l, r, r, r, }, // rn N preceded by right -{ ln, l, r, a, l, }, // ln N preceded by left - -{ na, l, r, a, l, }, // a AN preceded by left -{ na, l, r, a, l, }, // na N preceded by la -} ; - -void resolveNeutrals(int baseLevel, Slot *s) -{ - int state = baseLevel ? r : l; - int cls; - Slot *sRun = NULL; - Slot *sLast = s; - int level = baseLevel; - - for ( ; s; s = s->next()) - { - sLast = s; - cls = s->getBidiClass(); - if (cls == BN) - { - if (sRun) - sRun = sRun->prev(); - continue; - } - - int action = actionNeutrals[state][neutral_class_map[cls]]; - int clsRun = GetDeferredNeutrals(action, level); - if (clsRun != N) - { - SetDeferredRunClass(s, sRun, clsRun); - sRun = NULL; - } - int clsNew = GetResolvedNeutrals(action); - if (clsNew != N) - s->setBidiClass(clsNew); - if (!sRun && (action & In)) - sRun = s->prev(); - state = stateNeutrals[state][neutral_class_map[cls]]; - level = s->getBidiLevel(); - } - cls = EmbeddingDirection(level); - int clsRun = GetDeferredNeutrals(actionNeutrals[state][neutral_class_map[cls]], level); - if (clsRun != N) - SetDeferredRunClass(sLast, sRun, clsRun); -} - -const int addLevel[][4] = -{ - // L, R, AN, EN = cls - // level = -/* even */ { 0, 1, 2, 2, }, // EVEN -/* odd */ { 1, 0, 1, 1, }, // ODD - -}; - -void resolveImplicit(Slot *s, Segment *seg, uint8 aMirror) -{ - bool rtl = seg->dir() & 1; - for ( ; s; s = s->next()) - { - int cls = s->getBidiClass(); - if (cls == BN) - continue; - else if (cls == AN) - cls = AL; - if (cls < 5 && cls > 0) - { - int level = s->getBidiLevel(); - level += addLevel[level & 1][cls - 1]; - s->setBidiLevel(level); - if (aMirror) - { - int hasChar = seg->glyphAttr(s->gid(), aMirror + 1); - if ( ((level & 1) && (!(seg->dir() & 4) || !hasChar)) - || ((rtl ^ (level & 1)) && (seg->dir() & 4) && hasChar) ) - { - unsigned short g = seg->glyphAttr(s->gid(), aMirror); - if (g) s->setGlyph(seg, g); - } - } - } - } -} - -void resolveWhitespace(int baseLevel, Segment *seg, uint8 aBidi, Slot *s) -{ - for ( ; s; s = s->prev()) - { - int cls = seg->glyphAttr(s->gid(), aBidi); - if (cls == WS) - s->setBidiLevel(baseLevel); - else - break; - } -} - - -inline -Slot * join(int level, Slot * a, Slot * b) -{ - if (!a) return b; - if (level & 1) { Slot * const t = a; a = b; b = t; } - Slot * const t = b->prev(); - a->prev()->next(b); b->prev(a->prev()); // splice middle - t->next(a); a->prev(t); // splice ends - return a; -} - - -Slot * span(Slot * & cs, const bool rtl) -{ - Slot * r = cs, * re = cs; cs = cs->next(); - if (rtl) - { - Slot * t = r->next(); r->next(r->prev()); r->prev(t); - for (int l = r->getBidiLevel(); cs && l == cs->getBidiLevel(); cs = cs->prev()) - { - re = cs; - t = cs->next(); cs->next(cs->prev()); cs->prev(t); - } - r->next(re); - re->prev(r); - r = re; - } - else - { - for (int l = r->getBidiLevel(); cs && l == cs->getBidiLevel(); cs = cs->next()) - re = cs; - r->prev(re); - re->next(r); - } - if (cs) cs->prev(0); - return r; -} - - -Slot *resolveOrder(Slot * & cs, const bool reordered, const int level) -{ - Slot * r = 0; - int ls; - while (cs && level <= (ls = cs->getBidiLevel() - reordered)) - { - r = join(level, r, level >= ls - ? span(cs, level & 1) - : resolveOrder(cs, reordered, level+1)); - } - return r; -} - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/CMakeLists.txt b/Build/source/libs/graphite2/graphite2-1.2.0/src/CMakeLists.txt deleted file mode 100644 index 1b485463555..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/CMakeLists.txt +++ /dev/null @@ -1,139 +0,0 @@ -# GRAPHITE2 LICENSING -# -# Copyright 2010, SIL International -# All rights reserved. -# -# This library is free software; you can redistribute it and/or modify -# it under the terms of the GNU Lesser General Public License as published -# by the Free Software Foundation; either version 2.1 of License, or -# (at your option) any later version. -# -# This program 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 for more details. -# -# You should also have received a copy of the GNU Lesser General Public -# License along with this library in the file named "LICENSE". -# If not, write to the Free Software Foundation, 51 Franklin Street, -# Suite 500, Boston, MA 02110-1335, USA or visit their web page on the -# internet at http://www.fsf.org/licenses/lgpl.html. - -CMAKE_MINIMUM_REQUIRED(VERSION 2.8.0 FATAL_ERROR) -project(graphite2_core) -cmake_policy(SET CMP0012 NEW) -INCLUDE(CheckCXXSourceCompiles) - -set(GRAPHITE_API_CURRENT 3) -set(GRAPHITE_API_REVISION 0) -set(GRAPHITE_API_AGE 1) -set(GRAPHITE_VERSION ${GRAPHITE_API_CURRENT}.${GRAPHITE_API_REVISION}.${GRAPHITE_API_AGE}) -set(GRAPHITE_SO_VERSION ${GRAPHITE_API_CURRENT}) - -include(TestBigEndian) - -include_directories(${PROJECT_SOURCE_DIR}) - -set(SEGCACHE SegCache.cpp SegCacheEntry.cpp SegCacheStore.cpp) -if (GRAPHITE2_NSEGCACHE) - add_definitions(-DGRAPHITE2_NSEGCACHE) - set(SEGCACHE) -endif (GRAPHITE2_NSEGCACHE) - -set(FILEFACE FileFace.cpp) -if (GRAPHITE2_NFILEFACE) - add_definitions(-DGRAPHITE2_NFILEFACE) - set(FILEFACE) -endif (GRAPHITE2_NFILEFACE) - -set(TRACING json.cpp) -if (GRAPHITE2_NTRACING) - add_definitions(-DGRAPHITE2_NTRACING) - set(TRACING) -endif (GRAPHITE2_NTRACING) - - -set(GRAPHITE_HEADERS - ../include/graphite2/Font.h - ../include/graphite2/Segment.h - ../include/graphite2/Types.h - ../include/graphite2/Log.h - ) - -file(GLOB PRIVATE_HEADERS inc/*.h) - -add_library(graphite2 SHARED - ${GRAPHITE2_VM_TYPE}_machine.cpp - gr_char_info.cpp - gr_features.cpp - gr_face.cpp - gr_font.cpp - gr_logging.cpp - gr_segment.cpp - gr_slot.cpp - Bidi.cpp - CachedFace.cpp - CmapCache.cpp - Code.cpp - Face.cpp - FeatureMap.cpp - Font.cpp - GlyphFace.cpp - GlyphCache.cpp - Justifier.cpp - NameTable.cpp - Pass.cpp - Rule.cpp - Segment.cpp - Silf.cpp - Slot.cpp - Sparse.cpp - TtfUtil.cpp - UtfCodec.cpp - ${FILEFACE} - ${SEGCACHE} - ${TRACING}) - -set_target_properties(graphite2 PROPERTIES PUBLIC_HEADER "${GRAPHITE_HEADERS}" - SOVERSION ${GRAPHITE_SO_VERSION} - VERSION ${GRAPHITE_VERSION} - LT_VERSION_CURRENT ${GRAPHITE_API_CURRENT} - LT_VERSION_REVISION ${GRAPHITE_API_REVISION} - LT_VERSION_AGE ${GRAPHITE_API_AGE}) - -if (${CMAKE_SYSTEM_NAME} STREQUAL "Linux") - set_target_properties(graphite2 PROPERTIES - COMPILE_FLAGS "-Wall -Wextra -Wno-unknown-pragmas -Wendif-labels -Wshadow -Wctor-dtor-privacy -Wnon-virtual-dtor -fdiagnostics-show-option -fno-rtti -fno-exceptions -fvisibility=hidden -fvisibility-inlines-hidden -fno-stack-protector" - LINK_FLAGS "-nodefaultlibs" - LINKER_LANGUAGE C) - if (${CMAKE_CXX_COMPILER} MATCHES ".*mingw.*") - target_link_libraries(graphite2 kernel32 msvcr90 mingw32 gcc user32) - else (${CMAKE_CXX_COMPILER} MATCHES ".*mingw.*") - target_link_libraries(graphite2 c gcc) - include(Graphite) - nolib_test(stdc++ $) - endif (${CMAKE_CXX_COMPILER} MATCHES ".*mingw.*") - set(CMAKE_CXX_IMPLICIT_LINK_LIBRARIES "") - CREATE_LIBTOOL_FILE(graphite2 "/lib${LIB_SUFFIX}") -endif (${CMAKE_SYSTEM_NAME} STREQUAL "Linux") - -if (${CMAKE_SYSTEM_NAME} STREQUAL "Darwin") - set_target_properties(graphite2 PROPERTIES - COMPILE_FLAGS "-Wall -Wextra -Wno-unknown-pragmas -Wendif-labels -Wshadow -Wno-ctor-dtor-privacy -Wno-non-virtual-dtor -fdiagnostics-show-option -fno-rtti -fno-exceptions -fvisibility=hidden -fvisibility-inlines-hidden -fno-stack-protector" - LINK_FLAGS "-nodefaultlibs" - LINKER_LANGUAGE C) - target_link_libraries(graphite2 c) - include(Graphite) - nolib_test(stdc++ $) - set(CMAKE_CXX_IMPLICIT_LINK_LIBRARIES "") - CREATE_LIBTOOL_FILE(graphite2 "/lib${LIB_SUFFIX}") -endif (${CMAKE_SYSTEM_NAME} STREQUAL "Darwin") - -if (${CMAKE_SYSTEM_NAME} STREQUAL "Windows") - set_target_properties(graphite2 PROPERTIES - COMPILE_DEFINITIONS "_SCL_SECURE_NO_WARNINGS;_CRT_SECURE_NO_WARNINGS;UNICODE;GRAPHITE2_EXPORTING") -endif (${CMAKE_SYSTEM_NAME} STREQUAL "Windows") - - -install(TARGETS graphite2 EXPORT graphite2 LIBRARY DESTINATION lib${LIB_SUFFIX} ARCHIVE DESTINATION lib${LIB_SUFFIX} PUBLIC_HEADER DESTINATION include/graphite2 RUNTIME DESTINATION bin) -install(EXPORT graphite2 DESTINATION share/graphite2 NAMESPACE gr2_) diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/CachedFace.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/CachedFace.cpp deleted file mode 100644 index 3642768854b..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/CachedFace.cpp +++ /dev/null @@ -1,127 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ - -#ifndef GRAPHITE2_NSEGCACHE - -#include -#include "inc/CachedFace.h" -#include "inc/SegCacheStore.h" - - -using namespace graphite2; - -CachedFace::CachedFace(const void* appFaceHandle/*non-NULL*/, const gr_face_ops & ops) -: Face(appFaceHandle, ops), m_cacheStore(0) -{ -} - -CachedFace::~CachedFace() -{ - delete m_cacheStore; -} - -bool CachedFace::setupCache(unsigned int cacheSize) -{ - m_cacheStore = new SegCacheStore(*this, m_numSilf, cacheSize); - return bool(m_cacheStore); -} - - -bool CachedFace::runGraphite(Segment *seg, const Silf *pSilf) const -{ - assert(pSilf); - pSilf->runGraphite(seg, 0, pSilf->substitutionPass()); - - unsigned int silfIndex = 0; - for (; silfIndex < m_numSilf && &(m_silfs[silfIndex]) != pSilf; ++silfIndex); - if (silfIndex == m_numSilf) return false; - SegCache * const segCache = m_cacheStore->getOrCreate(silfIndex, seg->getFeatures(0)); - if (!segCache) - return false; - - assert(m_cacheStore); - // find where the segment can be broken - Slot * subSegStartSlot = seg->first(); - Slot * subSegEndSlot = subSegStartSlot; - uint16 cmapGlyphs[eMaxSpliceSize]; - int subSegStart = 0; - for (unsigned int i = 0; i < seg->charInfoCount(); ++i) - { - const unsigned int length = i - subSegStart + 1; - if (length < eMaxSpliceSize) - cmapGlyphs[length-1] = subSegEndSlot->gid(); - else return false; - const bool spaceOnly = m_cacheStore->isSpaceGlyph(subSegEndSlot->gid()); - // at this stage the character to slot mapping is still 1 to 1 - const int breakWeight = seg->charinfo(i)->breakWeight(), - nextBreakWeight = (i + 1 < seg->charInfoCount())? - seg->charinfo(i+1)->breakWeight() : 0; - const uint8 f = seg->charinfo(i)->flags(); - if (((spaceOnly - || (breakWeight > 0 && breakWeight <= gr_breakWord) - || i + 1 == seg->charInfoCount() - || ((nextBreakWeight < 0 && nextBreakWeight >= gr_breakBeforeWord) - || (subSegEndSlot->next() && m_cacheStore->isSpaceGlyph(subSegEndSlot->next()->gid())))) - && f != 1) - || f == 2) - { - // record the next slot before any splicing - Slot * nextSlot = subSegEndSlot->next(); - // spaces should be left untouched by graphite rules in any sane font - if (!spaceOnly) - { - // found a break position, check for a cache of the sub sequence - const SegCacheEntry * entry = segCache->find(cmapGlyphs, length); - // TODO disable cache for words at start/end of line with contextuals - if (!entry) - { - SegmentScopeState scopeState = seg->setScope(subSegStartSlot, subSegEndSlot, length); - pSilf->runGraphite(seg, pSilf->substitutionPass(), pSilf->numPasses()); - if (length < eMaxSpliceSize) - { - seg->associateChars(); - entry = segCache->cache(m_cacheStore, cmapGlyphs, length, seg, subSegStart); - } - seg->removeScope(scopeState); - } - else - seg->splice(subSegStart, length, subSegStartSlot, subSegEndSlot, - entry->first(), entry->glyphLength()); - } - subSegStartSlot = subSegEndSlot = nextSlot; - subSegStart = i + 1; - } - else - { - subSegEndSlot = subSegEndSlot->next(); - } - } - return true; -} - -#endif - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/CmapCache.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/CmapCache.cpp deleted file mode 100644 index c5e4be0366f..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/CmapCache.cpp +++ /dev/null @@ -1,152 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ - -#include "inc/Main.h" -#include "inc/CmapCache.h" -#include "inc/Face.h" -#include "inc/TtfTypes.h" -#include "inc/TtfUtil.h" - - -using namespace graphite2; - -const void * bmp_subtable(const Face::Table & cmap) -{ - const void * stbl; - if (TtfUtil::CheckCmapSubtable4(stbl = TtfUtil::FindCmapSubtable(cmap, 3, 1, cmap.size())) - || TtfUtil::CheckCmapSubtable4(stbl = TtfUtil::FindCmapSubtable(cmap, 0, 3, cmap.size())) - || TtfUtil::CheckCmapSubtable4(stbl = TtfUtil::FindCmapSubtable(cmap, 0, 2, cmap.size())) - || TtfUtil::CheckCmapSubtable4(stbl = TtfUtil::FindCmapSubtable(cmap, 0, 1, cmap.size())) - || TtfUtil::CheckCmapSubtable4(stbl = TtfUtil::FindCmapSubtable(cmap, 0, 0, cmap.size()))) - return stbl; - return 0; -} - -const void * smp_subtable(const Face::Table & cmap) -{ - const void * stbl; - if (TtfUtil::CheckCmapSubtable12(stbl = TtfUtil::FindCmapSubtable(cmap, 3, 10, cmap.size())) - || TtfUtil::CheckCmapSubtable12(stbl = TtfUtil::FindCmapSubtable(cmap, 0, 4, cmap.size()))) - return stbl; - return 0; -} - -template -bool cache_subtable(uint16 * blocks[], const void * cst, const unsigned int limit) -{ - int rangeKey = 0; - uint32 codePoint = NextCodePoint(cst, 0, &rangeKey), - prevCodePoint = 0; - while (codePoint != limit) - { - unsigned int block = codePoint >> 8; - if (!blocks[block]) - { - blocks[block] = grzeroalloc(0x100); - if (!blocks[block]) - return false; - } - blocks[block][codePoint & 0xFF] = LookupCodePoint(cst, codePoint, rangeKey); - // prevent infinite loop - if (codePoint <= prevCodePoint) - codePoint = prevCodePoint + 1; - prevCodePoint = codePoint; - codePoint = NextCodePoint(cst, codePoint, &rangeKey); - } - return true; -} - - -CachedCmap::CachedCmap(const Face & face) -: m_isBmpOnly(true), - m_blocks(0) -{ - const Face::Table cmap(face, Tag::cmap); - if (!cmap) return; - - const void * bmp_cmap = bmp_subtable(cmap); - const void * smp_cmap = smp_subtable(cmap); - m_isBmpOnly = !smp_cmap; - - m_blocks = grzeroalloc(m_isBmpOnly ? 0x100 : 0x1100); - if (m_blocks && smp_cmap) - { - if (!cache_subtable(m_blocks, smp_cmap, 0x10FFFF)) - return; - } - - if (m_blocks && bmp_cmap) - { - if (!cache_subtable(m_blocks, bmp_cmap, 0xFFFF)) - return; - } -} - -CachedCmap::~CachedCmap() throw() -{ - unsigned int numBlocks = (m_isBmpOnly)? 0x100 : 0x1100; - for (unsigned int i = 0; i < numBlocks; i++) - free(m_blocks[i]); - free(m_blocks); -} - -uint16 CachedCmap::operator [] (const uint32 usv) const throw() -{ - if ((m_isBmpOnly && usv > 0xFFFF) || (usv > 0x10FFFF)) - return 0; - const uint32 block = 0xFFFF & (usv >> 8); - if (m_blocks[block]) - return m_blocks[block][usv & 0xFF]; - return 0; -}; - -CachedCmap::operator bool() const throw() -{ - return m_blocks != 0; -} - - -DirectCmap::DirectCmap(const Face & face) -: _cmap(face, Tag::cmap), - _smp(smp_subtable(_cmap)), - _bmp(bmp_subtable(_cmap)) -{ -} - -uint16 DirectCmap::operator [] (const uint32 usv) const throw() -{ - return usv > 0xFFFF - ? (_smp ? TtfUtil::CmapSubtable12Lookup(_smp, usv, 0) : 0) - : TtfUtil::CmapSubtable4Lookup(_bmp, usv, 0); -} - -DirectCmap::operator bool () const throw() -{ - return _cmap && _bmp; -} - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/Code.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/Code.cpp deleted file mode 100644 index 01f9d511e95..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/Code.cpp +++ /dev/null @@ -1,609 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -// This class represents loaded graphite stack machine code. It performs -// basic sanity checks, on the incoming code to prevent more obvious problems -// from crashing graphite. -// Author: Tim Eves - -#include -#include -#include -#include -#include "graphite2/Segment.h" -#include "inc/Code.h" -#include "inc/Face.h" -#include "inc/GlyphFace.h" -#include "inc/GlyphCache.h" -#include "inc/Machine.h" -#include "inc/Rule.h" -#include "inc/Silf.h" - -#include - -#ifdef NDEBUG -#ifdef __GNUC__ -#pragma GCC diagnostic ignored "-Wunused-parameter" -#endif -#endif - - -using namespace graphite2; -using namespace vm; - -namespace { - -inline bool is_return(const instr i) { - const opcode_t * opmap = Machine::getOpcodeTable(); - const instr pop_ret = *opmap[POP_RET].impl, - ret_zero = *opmap[RET_ZERO].impl, - ret_true = *opmap[RET_TRUE].impl; - return i == pop_ret || i == ret_zero || i == ret_true; -} - -struct context -{ - context(uint8 ref=0) : codeRef(ref) {flags.changed=false; flags.referenced=false; flags.inserted=false;} - struct { - uint8 changed:1, - referenced:1, - inserted:1; - } flags; - uint8 codeRef; -}; - -} // end namespace - - -class Machine::Code::decoder -{ -public: - struct limits; - struct analysis - { - uint8 slotref; - context contexts[256]; - byte max_ref; - - analysis() : slotref(0), max_ref(0) {}; - void set_ref(int index) throw(); - void set_changed(int index) throw(); - - }; - - decoder(const limits & lims, Code &code) throw(); - - bool load(const byte * bc_begin, const byte * bc_end); - void apply_analysis(instr * const code, instr * code_end); - byte max_ref() { return _analysis.max_ref; } - int pre_context() const { return _pre_context; } - -private: - opcode fetch_opcode(const byte * bc); - void analyse_opcode(const opcode, const int8 * const dp) throw(); - bool emit_opcode(opcode opc, const byte * & bc); - bool validate_opcode(const opcode opc, const byte * const bc); - bool valid_upto(const uint16 limit, const uint16 x) const throw(); - void failure(const status_t s) const throw() { _code.failure(s); } - - Code & _code; - int _pre_context; - uint16 _rule_length; - instr * _instr; - byte * _data; - const limits & _max; - analysis _analysis; -}; - - -struct Machine::Code::decoder::limits -{ - const byte * const bytecode; - const uint8 pre_context; - const uint16 rule_length, - classes, - glyf_attrs, - features; - const byte attrid[gr_slatMax]; -}; - -inline Machine::Code::decoder::decoder(const limits & lims, Code &code) throw() -: _code(code), - _pre_context(code._constraint ? 0 : lims.pre_context), - _rule_length(code._constraint ? 1 : lims.rule_length), - _instr(code._code), _data(code._data), _max(lims) -{ } - - - -Machine::Code::Code(bool is_constraint, const byte * bytecode_begin, const byte * const bytecode_end, - uint8 pre_context, uint16 rule_length, const Silf & silf, const Face & face) - : _code(0), _data(0), _data_size(0), _instr_count(0), _max_ref(0), _status(loaded), - _constraint(is_constraint), _modify(false), _delete(false), _own(true) -{ - assert(bytecode_begin != 0); - if (bytecode_begin == bytecode_end) - { - ::new (this) Code(); - return; - } - assert(bytecode_end > bytecode_begin); - const opcode_t * op_to_fn = Machine::getOpcodeTable(); - - // Allocate code and dat target buffers, these sizes are a worst case - // estimate. Once we know their real sizes the we'll shrink them. - _code = static_cast(malloc((bytecode_end - bytecode_begin) - * sizeof(instr))); - _data = static_cast(malloc((bytecode_end - bytecode_begin) - * sizeof(byte))); - - if (!_code || !_data) { - failure(alloc_failed); - return; - } - - const decoder::limits lims = { - bytecode_end, - pre_context, - rule_length, - silf.numClasses(), - face.glyphs().numAttrs(), - face.numFeatures(), - {1,1,1,1,1,1,1,1, - 1,1,1,1,1,1,1,255, - 1,1,1,1,1,1,1,1, - 1,1,1,1,1,1,0,0, - 0,0,0,0,0,0,0,0, - 0,0,0,0,0,0,0,0, - 0,0,0,0,0,0,0, silf.numUser()} - }; - - decoder dec(lims, *this); - if(!dec.load(bytecode_begin, bytecode_end)) - return; - - // Is this an empty program? - if (_instr_count == 0) - { - release_buffers(); - ::new (this) Code(); - return; - } - - // When we reach the end check we've terminated it correctly - if (!is_return(_code[_instr_count-1])) { - failure(missing_return); - return; - } - - assert((_constraint && immutable()) || !_constraint); - dec.apply_analysis(_code, _code + _instr_count); - _max_ref = dec.max_ref(); - - // Now we know exactly how much code and data the program really needs - // realloc the buffers to exactly the right size so we don't waste any - // memory. - assert((bytecode_end - bytecode_begin) >= std::ptrdiff_t(_instr_count)); - assert((bytecode_end - bytecode_begin) >= std::ptrdiff_t(_data_size)); - _code = static_cast(realloc(_code, (_instr_count+1)*sizeof(instr))); - _data = static_cast(realloc(_data, _data_size*sizeof(byte))); - - // Make this RET_ZERO, we should never reach this but just in case ... - _code[_instr_count] = op_to_fn[RET_ZERO].impl[_constraint]; - - if (!_code) - failure(alloc_failed); -} - -Machine::Code::~Code() throw () -{ - if (_own) - release_buffers(); -} - - -bool Machine::Code::decoder::load(const byte * bc, const byte * bc_end) -{ - while (bc < bc_end) - { - const opcode opc = fetch_opcode(bc++); - if (opc == vm::MAX_OPCODE) - return false; - - analyse_opcode(opc, reinterpret_cast(bc)); - - if (!emit_opcode(opc, bc)) - return false; - } - - return bool(_code); -} - -// Validation check and fixups. -// - -opcode Machine::Code::decoder::fetch_opcode(const byte * bc) -{ - const opcode opc = opcode(*bc++); - - // Do some basic sanity checks based on what we know about the opcode - if (!validate_opcode(opc, bc)) return MAX_OPCODE; - - // And check it's arguments as far as possible - switch (opc) - { - case NOP : - case PUSH_BYTE : - case PUSH_BYTEU : - case PUSH_SHORT : - case PUSH_SHORTU : - case PUSH_LONG : - case ADD : - case SUB : - case MUL : - case DIV : - case MIN_ : - case MAX_ : - case NEG : - case TRUNC8 : - case TRUNC16 : - case COND : - case AND : - case OR : - case NOT : - case EQUAL : - case NOT_EQ : - case LESS : - case GTR : - case LESS_EQ : - case GTR_EQ : - break; - case NEXT : - case NEXT_N : // runtime checked - case COPY_NEXT : - ++_pre_context; - break; - case PUT_GLYPH_8BIT_OBS : - valid_upto(_max.classes, bc[0]); - break; - case PUT_SUBS_8BIT_OBS : - valid_upto(_rule_length, _pre_context + int8(bc[0])); - valid_upto(_max.classes, bc[1]); - valid_upto(_max.classes, bc[2]); - break; - case PUT_COPY : - valid_upto(_rule_length, _pre_context + int8(bc[0])); - break; - case INSERT : - --_pre_context; - break; - case DELETE : - break; - case ASSOC : - for (uint8 num = bc[0]; num; --num) - valid_upto(_rule_length, _pre_context + int8(bc[num])); - break; - case CNTXT_ITEM : - valid_upto(_max.rule_length, _max.pre_context + int8(bc[0])); - if (bc + 2 + bc[1] >= _max.bytecode) failure(jump_past_end); - if (_pre_context != 0) failure(nested_context_item); - break; - case ATTR_SET : - case ATTR_ADD : - case ATTR_SUB : - case ATTR_SET_SLOT : - valid_upto(gr_slatMax, bc[0]); - break; - case IATTR_SET_SLOT : - if (valid_upto(gr_slatMax, bc[0])) - valid_upto(_max.attrid[bc[0]], bc[1]); - break; - case PUSH_SLOT_ATTR : - valid_upto(gr_slatMax, bc[0]); - valid_upto(_rule_length, _pre_context + int8(bc[1])); - break; - case PUSH_GLYPH_ATTR_OBS : - valid_upto(_max.glyf_attrs, bc[0]); - valid_upto(_rule_length, _pre_context + int8(bc[1])); - break; - case PUSH_GLYPH_METRIC : - valid_upto(kgmetDescent, bc[0]); - valid_upto(_rule_length, _pre_context + int8(bc[1])); - // level: dp[2] no check necessary - break; - case PUSH_FEAT : - valid_upto(_max.features, bc[0]); - valid_upto(_rule_length, _pre_context + int8(bc[1])); - break; - case PUSH_ATT_TO_GATTR_OBS : - valid_upto(_max.glyf_attrs, bc[0]); - valid_upto(_rule_length, _pre_context + int8(bc[1])); - break; - case PUSH_ATT_TO_GLYPH_METRIC : - valid_upto(kgmetDescent, bc[0]); - valid_upto(_rule_length, _pre_context + int8(bc[1])); - // level: dp[2] no check necessary - break; - case PUSH_ISLOT_ATTR : - if (valid_upto(gr_slatMax, bc[0])) - { - valid_upto(_rule_length, _pre_context + int8(bc[1])); - valid_upto(_max.attrid[bc[0]], bc[2]); - } - break; - case PUSH_IGLYPH_ATTR :// not implemented - case POP_RET : - case RET_ZERO : - case RET_TRUE : - break; - case IATTR_SET : - case IATTR_ADD : - case IATTR_SUB : - if (valid_upto(gr_slatMax, bc[0])) - valid_upto(_max.attrid[bc[0]], bc[1]); - break; - case PUSH_PROC_STATE : // dummy: dp[0] no check necessary - case PUSH_VERSION : - break; - case PUT_SUBS : - valid_upto(_rule_length, _pre_context + int8(bc[0])); - valid_upto(_max.classes, uint16(bc[1]<< 8) | bc[2]); - valid_upto(_max.classes, uint16(bc[3]<< 8) | bc[4]); - break; - case PUT_SUBS2 : // not implemented - case PUT_SUBS3 : // not implemented - break; - case PUT_GLYPH : - valid_upto(_max.classes, uint16(bc[0]<< 8) | bc[1]); - break; - case PUSH_GLYPH_ATTR : - case PUSH_ATT_TO_GLYPH_ATTR : - valid_upto(_max.glyf_attrs, uint16(bc[0]<< 8) | bc[1]); - valid_upto(_rule_length, _pre_context + int8(bc[2])); - break; - default: - failure(invalid_opcode); - break; - } - - return bool(_code) ? opc : MAX_OPCODE; -} - - -void Machine::Code::decoder::analyse_opcode(const opcode opc, const int8 * arg) throw() -{ - if (_code._constraint) return; - - switch (opc) - { - case DELETE : - _code._delete = true; - break; - case PUT_GLYPH_8BIT_OBS : - case PUT_GLYPH : - _code._modify = true; - _analysis.set_changed(_analysis.slotref); - break; - case NEXT : - case COPY_NEXT : - if (!_analysis.contexts[_analysis.slotref].flags.inserted) - ++_analysis.slotref; - _analysis.contexts[_analysis.slotref] = context(_code._instr_count+1); - if (_analysis.slotref > _analysis.max_ref) _analysis.max_ref = _analysis.slotref; - break; - case INSERT : - _analysis.contexts[_analysis.slotref].flags.inserted = true; - _code._modify = true; - break; - case PUT_SUBS_8BIT_OBS : // slotref on 1st parameter - case PUT_SUBS : - _code._modify = true; - _analysis.set_changed(_analysis.slotref); - // no break - case PUT_COPY : - { - if (arg[0] != 0) { _analysis.set_changed(_analysis.slotref); _code._modify = true; } - if (arg[0] <= 0 && -arg[0] <= _analysis.slotref - _analysis.contexts[_analysis.slotref].flags.inserted) - _analysis.set_ref(_analysis.slotref + arg[0] - _analysis.contexts[_analysis.slotref].flags.inserted); - else if (_analysis.slotref + arg[0] > _analysis.max_ref) _analysis.max_ref = _analysis.slotref + arg[0]; - break; - } - case PUSH_ATT_TO_GATTR_OBS : // slotref on 2nd parameter - if (_code._constraint) return; - // no break - case PUSH_GLYPH_ATTR_OBS : - case PUSH_SLOT_ATTR : - case PUSH_GLYPH_METRIC : - case PUSH_ATT_TO_GLYPH_METRIC : - case PUSH_ISLOT_ATTR : - case PUSH_FEAT : - if (arg[1] <= 0 && -arg[1] <= _analysis.slotref - _analysis.contexts[_analysis.slotref].flags.inserted) - _analysis.set_ref(_analysis.slotref + arg[1] - _analysis.contexts[_analysis.slotref].flags.inserted); - else if (_analysis.slotref + arg[1] > _analysis.max_ref) _analysis.max_ref = _analysis.slotref + arg[1]; - break; - case PUSH_ATT_TO_GLYPH_ATTR : - if (_code._constraint) return; - // no break - case PUSH_GLYPH_ATTR : - if (arg[2] <= 0 && -arg[2] <= _analysis.slotref - _analysis.contexts[_analysis.slotref].flags.inserted) - _analysis.set_ref(_analysis.slotref + arg[2] - _analysis.contexts[_analysis.slotref].flags.inserted); - else if (_analysis.slotref + arg[2] > _analysis.max_ref) _analysis.max_ref = _analysis.slotref + arg[2]; - break; - case ASSOC : // slotrefs in varargs - break; - default: - break; - } -} - - -bool Machine::Code::decoder::emit_opcode(opcode opc, const byte * & bc) -{ - const opcode_t * op_to_fn = Machine::getOpcodeTable(); - const opcode_t & op = op_to_fn[opc]; - if (op.impl[_code._constraint] == 0) - { - failure(unimplemented_opcode_used); - return false; - } - - const size_t param_sz = op.param_sz == VARARGS ? bc[0] + 1 : op.param_sz; - - // Add this instruction - *_instr++ = op.impl[_code._constraint]; - ++_code._instr_count; - - // Grab the parameters - if (param_sz) { - memcpy(_data, bc, param_sz * sizeof(byte)); - bc += param_sz; - _data += param_sz; - _code._data_size += param_sz; - } - - // recursively decode a context item so we can split the skip into - // instruction and data portions. - if (opc == CNTXT_ITEM) - { - assert(_pre_context == 0); - _pre_context = _max.pre_context + int8(_data[-2]); - _rule_length = _max.rule_length; - - const size_t ctxt_start = _code._instr_count; - byte & instr_skip = _data[-1]; - byte & data_skip = *_data++; - ++_code._data_size; - - if (load(bc, bc + instr_skip)) - { - bc += instr_skip; - data_skip = instr_skip - (_code._instr_count - ctxt_start); - instr_skip = _code._instr_count - ctxt_start; - - _rule_length = 1; - _pre_context = 0; - } - } - - return bool(_code); -} - - -void Machine::Code::decoder::apply_analysis(instr * const code, instr * code_end) -{ - // insert TEMP_COPY commands for slots that need them (that change and are referenced later) - int tempcount = 0; - if (_code._constraint) return; - - const instr temp_copy = Machine::getOpcodeTable()[TEMP_COPY].impl[0]; - for (const context * c = _analysis.contexts, * const ce = c + _analysis.slotref; c != ce; ++c) - { - if (!c->flags.referenced || !c->flags.changed) continue; - - instr * const tip = code + c->codeRef + tempcount; - memmove(tip+1, tip, (code_end - tip) * sizeof(instr)); - *tip = temp_copy; - ++code_end; - ++tempcount; - } - - _code._instr_count = code_end - code; -} - - -inline -bool Machine::Code::decoder::validate_opcode(const opcode opc, const byte * const bc) -{ - if (opc >= MAX_OPCODE) - { - failure(invalid_opcode); - return false; - } - const opcode_t & op = Machine::getOpcodeTable()[opc]; - const size_t param_sz = op.param_sz == VARARGS ? bc[0] + 1 : op.param_sz; - if (bc + param_sz > _max.bytecode) - { - failure(arguments_exhausted); - return false; - } - return true; -} - - -bool Machine::Code::decoder::valid_upto(const uint16 limit, const uint16 x) const throw() -{ - const bool t = x < limit; - if (!t) failure(out_of_range_data); - return t; -} - - -inline -void Machine::Code::failure(const status_t s) throw() { - release_buffers(); - _status = s; -} - - -inline -void Machine::Code::decoder::analysis::set_ref(const int index) throw() { - contexts[index].flags.referenced = true; - if (index > max_ref) max_ref = index; -} - - -inline -void Machine::Code::decoder::analysis::set_changed(const int index) throw() { - contexts[index].flags.changed = true; - if (index > max_ref) max_ref = index; -} - - -void Machine::Code::release_buffers() throw() -{ - free(_code); - free(_data); - _code = 0; - _data = 0; - _own = false; -} - - -int32 Machine::Code::run(Machine & m, slotref * & map) const -{ - assert(_own); - assert(*this); // Check we are actually runnable - - if (m.slotMap().size() <= size_t(_max_ref + m.slotMap().context())) - { - m._status = Machine::slot_offset_out_bounds; -// return (m.slotMap().end() - map); - return 1; - } - - return m.run(_code, _data, map); -} - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/Face.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/Face.cpp deleted file mode 100644 index 4566025de92..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/Face.cpp +++ /dev/null @@ -1,254 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include -#include "graphite2/Segment.h" -#include "inc/CmapCache.h" -#include "inc/debug.h" -#include "inc/Endian.h" -#include "inc/Face.h" -#include "inc/FileFace.h" -#include "inc/GlyphFace.h" -#include "inc/json.h" -#include "inc/SegCacheStore.h" -#include "inc/Segment.h" -#include "inc/NameTable.h" - - -using namespace graphite2; - -Face::Face(const void* appFaceHandle/*non-NULL*/, const gr_face_ops & ops) -: m_appFaceHandle(appFaceHandle), - m_pFileFace(NULL), - m_pGlyphFaceCache(NULL), - m_cmap(NULL), - m_pNames(NULL), - m_logger(NULL), - m_silfs(NULL), - m_numSilf(0), - m_ascent(0), - m_descent(0) -{ - memset(&m_ops, 0, sizeof m_ops); - memcpy(&m_ops, &ops, std::min(sizeof m_ops, ops.size)); -} - - -Face::~Face() -{ - setLogger(0); - delete m_pGlyphFaceCache; - delete m_cmap; - delete[] m_silfs; -#ifndef GRAPHITE2_NFILEFACE - delete m_pFileFace; -#endif - delete m_pNames; -} - -float Face::default_glyph_advance(const void* font_ptr, gr_uint16 glyphid) -{ - const Font & font = *reinterpret_cast(font_ptr); - - return font.face().glyphs().glyph(glyphid)->theAdvance().x * font.scale(); -} - -bool Face::readGlyphs(uint32 faceOptions) -{ - if (faceOptions & gr_face_cacheCmap) - m_cmap = new CachedCmap(*this); - else - m_cmap = new DirectCmap(*this); - - m_pGlyphFaceCache = new GlyphCache(*this, faceOptions); - if (!m_pGlyphFaceCache - || m_pGlyphFaceCache->numGlyphs() == 0 - || m_pGlyphFaceCache->unitsPerEm() == 0 - || !m_cmap || !*m_cmap) - return false; - - if (faceOptions & gr_face_preloadGlyphs) - nameTable(); // preload the name table along with the glyphs, heh. - - return true; -} - -bool Face::readGraphite(const Table & silf) -{ - const byte * p = silf; - if (!p) return false; - - const uint32 version = be::read(p); - if (version < 0x00020000) return false; - if (version >= 0x00030000) - be::skip(p); // compilerVersion - m_numSilf = be::read(p); - be::skip(p); // reserved - - bool havePasses = false; - m_silfs = new Silf[m_numSilf]; - for (int i = 0; i < m_numSilf; i++) - { - const uint32 offset = be::read(p), - next = i == m_numSilf - 1 ? silf.size() : be::peek(p); - if (next > silf.size() || offset >= next) - return false; - - if (!m_silfs[i].readGraphite(silf + offset, next - offset, *this, version)) - return false; - - if (m_silfs[i].numPasses()) - havePasses = true; - } - - return havePasses; -} - -bool Face::readFeatures() -{ - return m_Sill.readFace(*this); -} - -bool Face::runGraphite(Segment *seg, const Silf *aSilf) const -{ -#if !defined GRAPHITE2_NTRACING - json * dbgout = logger(); - if (dbgout) - { - *dbgout << json::object - << "id" << objectid(seg) - << "passes" << json::array; - } -#endif - - bool res = aSilf->runGraphite(seg, 0, aSilf->justificationPass()); - res &= aSilf->runGraphite(seg, aSilf->positionPass(), aSilf->numPasses()); - -#if !defined GRAPHITE2_NTRACING - if (dbgout) -{ - *dbgout << json::item - << json::close // Close up the passes array - << "output" << json::array; - for(Slot * s = seg->first(); s; s = s->next()) - *dbgout << dslot(seg, s); - seg->finalise(0); // Call this here to fix up charinfo back indexes. - *dbgout << json::close - << "advance" << seg->advance() - << "chars" << json::array; - for(size_t i = 0, n = seg->charInfoCount(); i != n; ++i) - *dbgout << json::flat << *seg->charinfo(i); - *dbgout << json::close // Close up the chars array - << json::close; // Close up the segment object - } -#endif - - return res; -} - -void Face::setLogger(FILE * log_file GR_MAYBE_UNUSED) -{ -#if !defined GRAPHITE2_NTRACING - delete m_logger; - m_logger = log_file ? new json(log_file) : 0; -#endif -} - -const Silf *Face::chooseSilf(uint32 script) const -{ - if (m_numSilf == 0) - return NULL; - else if (m_numSilf == 1 || script == 0) - return m_silfs; - else // do more work here - return m_silfs; -} - -uint16 Face::findPseudo(uint32 uid) const -{ - return (m_numSilf) ? m_silfs[0].findPseudo(uid) : 0; -} - -uint16 Face::getGlyphMetric(uint16 gid, uint8 metric) const -{ - switch (metrics(metric)) - { - case kgmetAscent : return m_ascent; - case kgmetDescent : return m_descent; - default: return glyphs().glyph(gid)->getMetric(metric); - } -} - -void Face::takeFileFace(FileFace* pFileFace GR_MAYBE_UNUSED/*takes ownership*/) -{ -#ifndef GRAPHITE2_NFILEFACE - if (m_pFileFace==pFileFace) - return; - - delete m_pFileFace; - m_pFileFace = pFileFace; -#endif -} - -NameTable * Face::nameTable() const -{ - if (m_pNames) return m_pNames; - const Table name(*this, Tag::name); - if (name) - m_pNames = new NameTable(name, name.size()); - return m_pNames; -} - -uint16 Face::languageForLocale(const char * locale) const -{ - nameTable(); - if (m_pNames) - return m_pNames->getLanguageId(locale); - return 0; -} - -Face::Table::Table(const Face & face, const Tag n) throw() -: _f(&face) -{ - size_t sz = 0; - _p = reinterpret_cast((*_f->m_ops.get_table)(_f->m_appFaceHandle, n, &sz)); - _sz = uint32(sz); - if (!TtfUtil::CheckTable(n, _p, _sz)) - { - this->~Table(); // Make sure we release the table buffer even if the table filed it's checks - _p = 0; _sz = 0; - } -} - -Face::Table & Face::Table::operator = (const Table & rhs) throw() -{ - if (_p == rhs._p) return *this; - - this->~Table(); - new (this) Table(rhs); - return *this; -} - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/FeatureMap.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/FeatureMap.cpp deleted file mode 100644 index c625950b8a8..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/FeatureMap.cpp +++ /dev/null @@ -1,279 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include - -#include "inc/Main.h" -#include "inc/bits.h" -#include "inc/Endian.h" -#include "inc/FeatureMap.h" -#include "inc/FeatureVal.h" -#include "graphite2/Font.h" -#include "inc/TtfUtil.h" -#include -#include "inc/Face.h" - - -using namespace graphite2; - -namespace -{ - static int cmpNameAndFeatures(const void *ap, const void *bp) - { - const NameAndFeatureRef & a = *static_cast(ap), - & b = *static_cast(bp); - return (a < b ? -1 : (b < a ? 1 : 0)); - } - - const size_t FEAT_HEADER = sizeof(uint32) + 2*sizeof(uint16) + sizeof(uint32), - FEATURE_SIZE = sizeof(uint32) - + 2*sizeof(uint16) - + sizeof(uint32) - + 2*sizeof(uint16), - FEATURE_SETTING_SIZE = sizeof(int16) + sizeof(uint16); - - uint16 readFeatureSettings(const byte * p, FeatureSetting * s, size_t num_settings) - { - uint16 max_val = 0; - for (FeatureSetting * const end = s + num_settings; s != end; ++s) - { - const int16 value = be::read(p); - ::new (s) FeatureSetting(value, be::read(p)); - if (uint16(value) > max_val) max_val = value; - } - - return max_val; - } -} - -FeatureRef::FeatureRef(const Face & face, - unsigned short & bits_offset, uint32 max_val, - uint32 name, uint16 uiName, uint16 flags, - FeatureSetting *settings, uint16 num_set) throw() -: m_pFace(&face), - m_nameValues(settings), - m_mask(mask_over_val(max_val)), - m_max(max_val), - m_id(name), - m_nameid(uiName), - m_flags(flags), - m_numSet(num_set) -{ - const uint8 need_bits = bit_set_count(m_mask); - m_index = (bits_offset + need_bits) / SIZEOF_CHUNK; - if (m_index > bits_offset / SIZEOF_CHUNK) - bits_offset = m_index*SIZEOF_CHUNK; - m_bits = bits_offset % SIZEOF_CHUNK; - bits_offset += need_bits; - m_mask <<= m_bits; -} - -FeatureRef::~FeatureRef() throw() -{ - free(m_nameValues); -} - -bool FeatureMap::readFeats(const Face & face) -{ - const Face::Table feat(face, TtfUtil::Tag::Feat); - const byte * p = feat; - if (!p) return true; - if (feat.size() < FEAT_HEADER) return false; - - const byte *const feat_start = p, - *const feat_end = p + feat.size(); - - const uint32 version = be::read(p); - m_numFeats = be::read(p); - be::skip(p); - be::skip(p); - - // Sanity checks - if (m_numFeats == 0) return true; - if (version < 0x00010000 || - p + m_numFeats*FEATURE_SIZE > feat_end) - { //defensive - m_numFeats = 0; - return false; - } - - m_feats = new FeatureRef [m_numFeats]; - uint16 * const defVals = gralloc(m_numFeats); - unsigned short bits = 0; //to cause overflow on first Feature - - for (int i = 0, ie = m_numFeats; i != ie; i++) - { - const uint32 label = version < 0x00020000 ? be::read(p) : be::read(p); - const uint16 num_settings = be::read(p); - if (version >= 0x00020000) - be::skip(p); - const byte * const feat_setts = feat_start + be::read(p); - const uint16 flags = be::read(p), - uiName = be::read(p); - - if (feat_setts + num_settings * FEATURE_SETTING_SIZE > feat_end) - { - free(defVals); - return false; - } - - FeatureSetting *uiSet; - uint32 maxVal; - if (num_settings != 0) - { - uiSet = gralloc(num_settings); - maxVal = readFeatureSettings(feat_setts, uiSet, num_settings); - defVals[i] = uiSet[0].value(); - } - else - { - uiSet = 0; - maxVal = 0xffffffff; - defVals[i] = 0; - } - - ::new (m_feats + i) FeatureRef (face, bits, maxVal, - label, uiName, flags, - uiSet, num_settings); - } - m_defaultFeatures = new Features(bits/(sizeof(uint32)*8) + 1, *this); - m_pNamedFeats = new NameAndFeatureRef[m_numFeats]; - for (int i = 0; i < m_numFeats; ++i) - { - m_feats[i].applyValToFeature(defVals[i], *m_defaultFeatures); - m_pNamedFeats[i] = m_feats+i; - } - - free(defVals); - - qsort(m_pNamedFeats, m_numFeats, sizeof(NameAndFeatureRef), &cmpNameAndFeatures); - - return true; -} - -bool SillMap::readFace(const Face & face) -{ - if (!m_FeatureMap.readFeats(face)) return false; - if (!readSill(face)) return false; - return true; -} - - -bool SillMap::readSill(const Face & face) -{ - const Face::Table sill(face, TtfUtil::Tag::Sill); - const byte *pSill = sill; - - if (!pSill) return true; - if (sill.size() < 12) return false; - if (be::read(pSill) != 0x00010000UL) return false; - m_numLanguages = be::read(pSill); - m_langFeats = new LangFeaturePair[m_numLanguages]; - if (!m_langFeats || !m_FeatureMap.m_numFeats) { m_numLanguages = 0; return true; } //defensive - - pSill += 6; // skip the fast search - if (sill.size() < m_numLanguages * 8U + 12) return false; - - for (int i = 0; i < m_numLanguages; i++) - { - uint32 langid = be::read(pSill); - uint16 numSettings = be::read(pSill); - uint16 offset = be::read(pSill); - if (offset + 8U * numSettings > sill.size() && numSettings > 0) return false; - Features* feats = new Features(*m_FeatureMap.m_defaultFeatures); - const byte *pLSet = sill + offset; - - // Apply langauge specific settings - for (int j = 0; j < numSettings; j++) - { - uint32 name = be::read(pLSet); - uint16 val = be::read(pLSet); - pLSet += 2; - const FeatureRef* pRef = m_FeatureMap.findFeatureRef(name); - if (pRef) pRef->applyValToFeature(val, *feats); - } - // Add the language id feature which is always feature id 1 - const FeatureRef* pRef = m_FeatureMap.findFeatureRef(1); - if (pRef) pRef->applyValToFeature(langid, *feats); - - m_langFeats[i].m_lang = langid; - m_langFeats[i].m_pFeatures = feats; - } - return true; -} - - -Features* SillMap::cloneFeatures(uint32 langname/*0 means default*/) const -{ - if (langname) - { - // the number of languages in a font is usually small e.g. 8 in Doulos - // so this loop is not very expensive - for (uint16 i = 0; i < m_numLanguages; i++) - { - if (m_langFeats[i].m_lang == langname) - return new Features(*m_langFeats[i].m_pFeatures); - } - } - return new Features (*m_FeatureMap.m_defaultFeatures); -} - - - -const FeatureRef *FeatureMap::findFeatureRef(uint32 name) const -{ - NameAndFeatureRef *it; - - for (it = m_pNamedFeats; it < m_pNamedFeats + m_numFeats; ++it) - if (it->m_name == name) - return it->m_pFRef; - return NULL; -} - -bool FeatureRef::applyValToFeature(uint32 val, Features & pDest) const -{ - if (val>maxVal() || !m_pFace) - return false; - if (pDest.m_pMap==NULL) - pDest.m_pMap = &m_pFace->theSill().theFeatureMap(); - else - if (pDest.m_pMap!=&m_pFace->theSill().theFeatureMap()) - return false; //incompatible - pDest.reserve(m_index); - pDest[m_index] &= ~m_mask; - pDest[m_index] |= (uint32(val) << m_bits); - return true; -} - -uint32 FeatureRef::getFeatureVal(const Features& feats) const -{ - if (m_index < feats.size() && &m_pFace->theSill().theFeatureMap()==feats.m_pMap) - return (feats[m_index] & m_mask) >> m_bits; - else - return 0; -} - - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/FileFace.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/FileFace.cpp deleted file mode 100644 index 1e37763fb6a..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/FileFace.cpp +++ /dev/null @@ -1,118 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include -//#include "graphite2/Segment.h" -//#include "inc/CmapCache.h" -//#include "inc/Endian.h" -#include "inc/FileFace.h" -//#include "inc/GlyphFace.h" -//#include "inc/SegCacheStore.h" -//#include "inc/Segment.h" -//#include "inc/NameTable.h" - - -using namespace graphite2; - -#ifndef GRAPHITE2_NFILEFACE - -FileFace::FileFace(const char *filename) -: _file(fopen(filename, "rb")), - _file_len(0), - _header_tbl(NULL), - _table_dir(NULL) -{ - if (!_file) return; - - if (fseek(_file, 0, SEEK_END)) return; - _file_len = ftell(_file); - if (fseek(_file, 0, SEEK_SET)) return; - - size_t tbl_offset, tbl_len; - - // Get the header. - if (!TtfUtil::GetHeaderInfo(tbl_offset, tbl_len)) return; - if (fseek(_file, tbl_offset, SEEK_SET)) return; - _header_tbl = (TtfUtil::Sfnt::OffsetSubTable*)gralloc(tbl_len); - if (_header_tbl) - { - if (fread(_header_tbl, 1, tbl_len, _file) != tbl_len) return; - if (!TtfUtil::CheckHeader(_header_tbl)) return; - } - - // Get the table directory - if (!TtfUtil::GetTableDirInfo(_header_tbl, tbl_offset, tbl_len)) return; - _table_dir = (TtfUtil::Sfnt::OffsetSubTable::Entry*)gralloc(tbl_len); - if (fseek(_file, tbl_offset, SEEK_SET)) return; - if (_table_dir) - if (fread(_table_dir, 1, tbl_len, _file) != tbl_len) return; -} - -FileFace::~FileFace() -{ - free(_table_dir); - free(_header_tbl); - if (_file) - fclose(_file); -} - - -const void *FileFace::get_table_fn(const void* appFaceHandle, unsigned int name, size_t *len) -{ - if (appFaceHandle == 0) return 0; - const FileFace & file_face = *static_cast(appFaceHandle); - - char *tbl; - size_t tbl_offset, tbl_len; - if (!TtfUtil::GetTableInfo(name, file_face._header_tbl, file_face._table_dir, tbl_offset, tbl_len)) - return 0; - - if (tbl_offset + tbl_len > file_face._file_len - || fseek(file_face._file, tbl_offset, SEEK_SET) != 0) - return 0; - - tbl = gralloc(tbl_len); - if (fread(tbl, 1, tbl_len, file_face._file) != tbl_len) - { - free(tbl); - return 0; - } - - if (len) *len = tbl_len; - return tbl; -} - -void FileFace::rel_table_fn(const void* appFaceHandle, const void *table_buffer) -{ - if (appFaceHandle == 0) return; - - free(const_cast(table_buffer)); -} - -const gr_face_ops FileFace::ops = { sizeof FileFace::ops, &FileFace::get_table_fn, &FileFace::rel_table_fn }; - - -#endif //!GRAPHITE2_NFILEFACE diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/Font.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/Font.cpp deleted file mode 100644 index b090bb0fa80..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/Font.cpp +++ /dev/null @@ -1,62 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include -#include "inc/Face.h" -#include "inc/Font.h" -#include "inc/GlyphCache.h" - -using namespace graphite2; - -Font::Font(float ppm, const Face & f, const void * appFontHandle, const gr_font_ops * ops) -: m_appFontHandle(appFontHandle ? appFontHandle : this), - m_face(f), - m_scale(ppm / f.glyphs().unitsPerEm()), - m_hinted(appFontHandle && ops && (ops->glyph_advance_x || ops->glyph_advance_y)) -{ - memset(&m_ops, 0, sizeof m_ops); - if (m_hinted) - memcpy(&m_ops, ops, std::min(sizeof m_ops, ops->size)); - else - m_ops.glyph_advance_x = &Face::default_glyph_advance; - - size_t nGlyphs = f.glyphs().numGlyphs(); - m_advances = gralloc(nGlyphs); - if (m_advances) - { - for (float *advp = m_advances; nGlyphs; --nGlyphs, ++advp) - *advp = INVALID_ADVANCE; - } -} - - -/*virtual*/ Font::~Font() -{ - free(m_advances); -} - - - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/GlyphCache.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/GlyphCache.cpp deleted file mode 100644 index 7f304479281..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/GlyphCache.cpp +++ /dev/null @@ -1,344 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include - -#include "graphite2/Font.h" - -#include "inc/Main.h" -#include "inc/Face.h" //for the tags -#include "inc/GlyphCache.h" -#include "inc/GlyphFace.h" -#include "inc/Endian.h" - -using namespace graphite2; - -namespace -{ - class glat_iterator : public std::iterator > - { - public: - glat_iterator(const void * glat=0) : _p(reinterpret_cast(glat)), _n(0) {} - - glat_iterator & operator ++ () { ++_v.first; --_n; _p += sizeof(uint16); if (_n == -1) { _p -= 2; _v.first = *_p++; _n = *_p++; } return *this; } - glat_iterator operator ++ (int) { glat_iterator tmp(*this); operator++(); return tmp; } - - bool operator == (const glat_iterator & rhs) { return _p >= rhs._p || _p + _n*sizeof(uint16) > rhs._p; } - bool operator != (const glat_iterator & rhs) { return !operator==(rhs); } - - value_type operator * () const { - if (_n==0) { _v.first = *_p++; _n = *_p++; } - _v.second = be::peek(_p); - return _v; - } - const value_type * operator ->() const { operator * (); return &_v; } - - protected: - mutable const byte * _p; - mutable value_type _v; - mutable int _n; - }; - - class glat2_iterator : public glat_iterator - { - public: - glat2_iterator(const void * glat) : glat_iterator(glat) {} - - glat2_iterator & operator ++ () { ++_v.first; --_n; _p += sizeof(uint16); if (_n == -1) { _p -= sizeof(uint16)*2; _v.first = be::read(_p); _n = be::read(_p); } return *this; } - glat2_iterator operator ++ (int) { glat2_iterator tmp(*this); operator++(); return tmp; } - - value_type operator * () const { - if (_n==0) { _v.first = be::read(_p); _n = be::read(_p); } - _v.second = be::peek(_p); - return _v; - } - const value_type * operator ->() const { operator * (); return &_v; } - }; -} - - -class GlyphCache::Loader -{ -public: - Loader(const Face & face, const bool dumb_font); //return result indicates success. Do not use if failed. - - operator bool () const throw(); - unsigned short int units_per_em() const throw(); - unsigned short int num_glyphs() const throw(); - unsigned short int num_attrs() const throw(); - - const GlyphFace * read_glyph(unsigned short gid, GlyphFace &) const throw(); - - CLASS_NEW_DELETE; -private: - Face::Table _head, - _hhea, - _hmtx, - _glyf, - _loca, - m_pGlat, - m_pGloc; - - bool _long_fmt; - unsigned short _num_glyphs_graphics, //i.e. boundary box and advance - _num_glyphs_attributes, - _num_attrs; // number of glyph attributes per glyph -}; - - - -GlyphCache::GlyphCache(const Face & face, const uint32 face_options) -: _glyph_loader(new Loader(face, bool(face_options & gr_face_dumbRendering))), - _glyphs(_glyph_loader && *_glyph_loader ? grzeroalloc(_glyph_loader->num_glyphs()) : 0), - _num_glyphs(_glyphs ? _glyph_loader->num_glyphs() : 0), - _num_attrs(_glyphs ? _glyph_loader->num_attrs() : 0), - _upem(_glyphs ? _glyph_loader->units_per_em() : 0) -{ - if ((face_options & gr_face_preloadGlyphs) && _glyph_loader && _glyphs) - { - GlyphFace * const glyphs = new GlyphFace [_num_glyphs]; - if (!glyphs) - return; - - // The 0 glyph is definately required. - _glyphs[0] = _glyph_loader->read_glyph(0, glyphs[0]); - - // glyphs[0] has the same address as the glyphs array just allocated, - // thus assigning the &glyphs[0] to _glyphs[0] means _glyphs[0] points - // to the entire array. - const GlyphFace * loaded = _glyphs[0]; - for (uint16 gid = 1; loaded && gid != _num_glyphs; ++gid) - _glyphs[gid] = loaded = _glyph_loader->read_glyph(gid, glyphs[gid]); - - if (!loaded) - { - _glyphs[0] = 0; - delete [] glyphs; - } - delete _glyph_loader; - _glyph_loader = 0; - } - - if (_glyphs && glyph(0) == 0) - { - free(_glyphs); - _glyphs = 0; - _num_glyphs = _num_attrs = _upem = 0; - } -} - - -GlyphCache::~GlyphCache() -{ - if (_glyphs) - { - if (_glyph_loader) - { - const GlyphFace * * g = _glyphs; - for(unsigned short n = _num_glyphs; n; --n, ++g) - delete *g; - } - else - delete [] _glyphs[0]; - free(_glyphs); - } - delete _glyph_loader; -} - -const GlyphFace *GlyphCache::glyph(unsigned short glyphid) const //result may be changed by subsequent call with a different glyphid -{ - const GlyphFace * & p = _glyphs[glyphid]; - if (p == 0 && _glyph_loader) - { - GlyphFace * g = new GlyphFace(); - if (g) p = _glyph_loader->read_glyph(glyphid, *g); - } - return p; -} - -uint16 GlyphCache::glyphAttr(uint16 gid, uint16 gattr) const -{ - const GlyphFace * p = glyphSafe(gid); - - return p && gattr < _num_attrs ? p->attrs()[gattr] : 0; -} - - - -GlyphCache::Loader::Loader(const Face & face, const bool dumb_font) -: _head(face, Tag::head), - _hhea(face, Tag::hhea), - _hmtx(face, Tag::hmtx), - _glyf(face, Tag::glyf), - _loca(face, Tag::loca), - _long_fmt(false), - _num_glyphs_graphics(0), - _num_glyphs_attributes(0), - _num_attrs(0) -{ - if (!operator bool()) - return; - - const Face::Table maxp = Face::Table(face, Tag::maxp); - if (!maxp) { _head = Face::Table(); return; } - - _num_glyphs_graphics = TtfUtil::GlyphCount(maxp); - // This will fail if the number of glyphs is wildly out of range. - if (TtfUtil::LocaLookup(_num_glyphs_graphics-1, _loca, _loca.size(), _head) == size_t(-1)) - { - _head = Face::Table(); - return; - } - - if (!dumb_font) - { - if ((m_pGlat = Face::Table(face, Tag::Glat)) == NULL - || (m_pGloc = Face::Table(face, Tag::Gloc)) == NULL - || m_pGloc.size() < 6) - { - _head = Face::Table(); - return; - } - const byte * p = m_pGloc; - const int version = be::read(p); - const uint16 flags = be::read(p); - _num_attrs = be::read(p); - // We can accurately calculate the number of attributed glyphs by - // subtracting the length of the attribids array (numAttribs long if present) - // and dividing by either 2 or 4 depending on shor or lonf format - _long_fmt = flags & 1; - _num_glyphs_attributes = (m_pGloc.size() - - (p - m_pGloc) - - sizeof(uint16)*(flags & 0x2 ? _num_attrs : 0)) - / (_long_fmt ? sizeof(uint32) : sizeof(uint16)) - 1; - - if (version != 0x00010000 - || _num_attrs == 0 || _num_attrs > 0x1000 // is this hard limit appropriate? - || _num_glyphs_graphics > _num_glyphs_attributes) - { - _head = Face::Table(); - return; - } - } -} - -inline -GlyphCache::Loader::operator bool () const throw() -{ - return _head && _hhea && _hmtx && _glyf && _loca; -} - -inline -unsigned short int GlyphCache::Loader::units_per_em() const throw() -{ - return _head ? TtfUtil::DesignUnits(_head) : 0; -} - -inline -unsigned short int GlyphCache::Loader::num_glyphs() const throw() -{ - return std::max(_num_glyphs_graphics, _num_glyphs_attributes); -} - -inline -unsigned short int GlyphCache::Loader::num_attrs() const throw() -{ - return _num_attrs; -} - -const GlyphFace * GlyphCache::Loader::read_glyph(unsigned short glyphid, GlyphFace & glyph) const throw() -{ - Rect bbox; - Position advance; - - if (glyphid < _num_glyphs_graphics) - { - int nLsb, xMin, yMin, xMax, yMax; - unsigned int nAdvWid; - size_t locidx = TtfUtil::LocaLookup(glyphid, _loca, _loca.size(), _head); - void *pGlyph = TtfUtil::GlyfLookup(_glyf, locidx, _glyf.size()); - if (TtfUtil::HorMetrics(glyphid, _hmtx, _hmtx.size(), _hhea, nLsb, nAdvWid)) - advance = Position(static_cast(nAdvWid), 0); - - if (pGlyph && TtfUtil::GlyfBox(pGlyph, xMin, yMin, xMax, yMax)) - bbox = Rect(Position(static_cast(xMin), static_cast(yMin)), - Position(static_cast(xMax), static_cast(yMax))); - } - - if (glyphid < _num_glyphs_attributes) - { - const byte * gloc = m_pGloc; - size_t glocs = 0, gloce = 0; - - be::skip(gloc); - be::skip(gloc,2); - if (_long_fmt) - { - be::skip(gloc, glyphid); - glocs = be::read(gloc); - gloce = be::peek(gloc); - } - else - { - be::skip(gloc, glyphid); - glocs = be::read(gloc); - gloce = be::peek(gloc); - } - - if (glocs >= m_pGlat.size() && gloce > m_pGlat.size()) - return 0; - - const uint32 glat_version = be::peek(m_pGlat); - if (glat_version < 0x00020000) - { - if (gloce - glocs < 2*sizeof(byte)+sizeof(uint16) - || gloce - glocs > _num_attrs*(2*sizeof(byte)+sizeof(uint16))) - { - return 0; - } - - new (&glyph) GlyphFace(bbox, advance, glat_iterator(m_pGlat + glocs), glat_iterator(m_pGlat + gloce)); - } - else - { - if (gloce - glocs < 3*sizeof(uint16) - || gloce - glocs > _num_attrs*3*sizeof(uint16)) - { - return 0; - } - - new (&glyph) GlyphFace(bbox, advance, glat2_iterator(m_pGlat + glocs), glat2_iterator(m_pGlat + gloce)); - } - - if (glyph.attrs().size() > _num_attrs) - { - glyph.~GlyphFace(); - return 0; - } - } - - return &glyph; -} diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/GlyphFace.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/GlyphFace.cpp deleted file mode 100644 index 9fc11b2157e..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/GlyphFace.cpp +++ /dev/null @@ -1,48 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include "inc/GlyphFace.h" - - -using namespace graphite2; - -uint16 GlyphFace::getMetric(uint8 metric) const -{ - switch (metrics(metric)) - { - case kgmetLsb : return static_cast(m_bbox.bl.x); - case kgmetRsb : return static_cast(m_advance.x - m_bbox.tr.x); - case kgmetBbTop : return static_cast(m_bbox.tr.y); - case kgmetBbBottom : return static_cast(m_bbox.bl.y); - case kgmetBbLeft : return static_cast(m_bbox.bl.x); - case kgmetBbRight : return static_cast(m_bbox.tr.x); - case kgmetBbHeight : return static_cast(m_bbox.tr.y - m_bbox.bl.y); - case kgmetBbWidth : return static_cast(m_bbox.tr.x - m_bbox.bl.x); - case kgmetAdvWidth : return static_cast(m_advance.x); - case kgmetAdvHeight : return static_cast(m_advance.y); - default : return 0; - } -} diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/Justifier.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/Justifier.cpp deleted file mode 100644 index fc667dca1ab..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/Justifier.cpp +++ /dev/null @@ -1,267 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ - -#include "inc/Segment.h" -#include "graphite2/Font.h" -#include "inc/debug.h" -#include "inc/CharInfo.h" -#include "inc/Slot.h" -#include "inc/Main.h" -#include - -using namespace graphite2; - -class JustifyTotal { -public: - JustifyTotal() : m_numGlyphs(0), m_tStretch(0), m_tShrink(0), m_tStep(0), m_tWeight(0) {} - void accumulate(Slot *s, Segment *seg, int level); - int weight() const { return m_tWeight; } - - CLASS_NEW_DELETE - -private: - int m_numGlyphs; - int m_tStretch; - int m_tShrink; - int m_tStep; - int m_tWeight; -}; - -void JustifyTotal::accumulate(Slot *s, Segment *seg, int level) -{ - ++m_numGlyphs; - m_tStretch += s->getJustify(seg, level, 0); - m_tShrink += s->getJustify(seg, level, 1); - m_tStep += s->getJustify(seg, level, 2); - m_tWeight += s->getJustify(seg, level, 3); -} - -float Segment::justify(Slot *pSlot, const Font *font, float width, GR_MAYBE_UNUSED justFlags flags, Slot *pFirst, Slot *pLast) -{ - Slot *s, *end; - float currWidth = 0.0; - const float scale = font ? font->scale() : 1.0f; - Position res; - - if (width < 0 && !(silf()->flags())) - return width; - - if (!pFirst) pFirst = pSlot; - while (!pFirst->isBase()) pFirst = pFirst->attachedTo(); - if (!pLast) pLast = last(); - while (!pLast->isBase()) pLast = pLast->attachedTo(); - const float base = pFirst->origin().x / scale; - width = width / scale; - if ((flags & gr_justEndInline) == 0) - { - do { - Rect bbox = theGlyphBBoxTemporary(pLast->glyph()); - if (bbox.bl.x != 0. || bbox.bl.y != 0. || bbox.tr.x != 0. || bbox.tr.y == 0.) - break; - pLast = pLast->prev(); - } while (pLast != pFirst); - } - - end = pLast->nextSibling(); - pFirst = pFirst->nextSibling(); - - int icount = 0; - int numLevels = silf()->numJustLevels(); - if (!numLevels) - { - for (s = pSlot; s != end; s = s->next()) - { - CharInfo *c = charinfo(s->before()); - if (isWhitespace(c->unicodeChar())) - { - s->setJustify(this, 0, 3, 1); - s->setJustify(this, 0, 2, 1); - s->setJustify(this, 0, 0, -1); - ++icount; - } - } - if (!icount) - { - for (s = pSlot; s != end; s = s->nextSibling()) - { - s->setJustify(this, 0, 3, 1); - s->setJustify(this, 0, 2, 1); - s->setJustify(this, 0, 0, -1); - } - } - ++numLevels; - } - - JustifyTotal *stats = new JustifyTotal[numLevels]; - for (s = pFirst; s != end; s = s->nextSibling()) - { - float w = s->origin().x / scale + s->advance() - base; - if (w > currWidth) currWidth = w; - for (int j = 0; j < numLevels; ++j) - stats[j].accumulate(s, this, j); - s->just(0); - } - - for (int i = (width < 0.0) ? -1 : numLevels - 1; i >= 0; --i) - { - float diff; - float error = 0.; - float diffpw; - int tWeight = stats[i].weight(); - - do { - error = 0.; - diff = width - currWidth; - diffpw = diff / tWeight; - tWeight = 0; - for (s = pFirst; s != end; s = s->nextSibling()) // don't include final glyph - { - int w = s->getJustify(this, i, 3); - float pref = diffpw * w + error; - int step = s->getJustify(this, i, 2); - if (!step) step = 1; // handle lazy font developers - if (pref > 0) - { - float max = uint16(s->getJustify(this, i, 0)); - if (i == 0) max -= s->just(); - if (pref > max) pref = max; - else tWeight += w; - } - else - { - float max = uint16(s->getJustify(this, i, 1)); - if (i == 0) max += s->just(); - if (-pref > max) pref = -max; - else tWeight += w; - } - int actual = step ? int(pref / step) * step : int(pref); - - if (actual) - { - error += diffpw * w - actual; - if (i == 0) - s->just(s->just() + actual); - else - s->setJustify(this, i, 4, actual); - } - } - currWidth += diff - error; - } while (i == 0 && int(abs(error)) > 0 && tWeight); - } - - Slot *oldFirst = m_first; - Slot *oldLast = m_last; - if (silf()->flags() & 1) - { - m_first = pSlot = addLineEnd(pSlot); - m_last = pLast = addLineEnd(end); - } - else - { - m_first = pSlot; - m_last = pLast; - } - - // run justification passes here -#if !defined GRAPHITE2_NTRACING - json * const dbgout = m_face->logger(); - if (dbgout) - *dbgout << json::object - << "justifies" << objectid(this) - << "passes" << json::array; -#endif - - if (m_silf->justificationPass() != m_silf->positionPass() && (width >= 0. || (silf()->flags() & 1))) - m_silf->runGraphite(this, m_silf->justificationPass(), m_silf->positionPass()); - -#if !defined GRAPHITE2_NTRACING - if (dbgout) - { - *dbgout << json::item << json::close; // Close up the passes array - positionSlots(NULL, pSlot, pLast); - Slot *lEnd = pLast->nextSibling(); - *dbgout << "output" << json::array; - for(Slot * t = pSlot; t != lEnd; t = t->next()) - *dbgout << dslot(this, t); - *dbgout << json::close << json::close; - } -#endif - - res = positionSlots(font, pSlot, pLast); - - if (silf()->flags() & 1) - { - delLineEnd(m_first); - delLineEnd(m_last); - } - m_first = oldFirst; - m_last = oldLast; - return res.x; -} - -Slot *Segment::addLineEnd(Slot *nSlot) -{ - Slot *eSlot = newSlot(); - const uint16 gid = silf()->endLineGlyphid(); - const GlyphFace * theGlyph = m_face->glyphs().glyphSafe(gid); - eSlot->setGlyph(this, gid, theGlyph); - if (nSlot) - { - eSlot->next(nSlot); - eSlot->prev(nSlot->prev()); - nSlot->prev(eSlot); - eSlot->before(nSlot->before()); - if (eSlot->prev()) - eSlot->after(eSlot->prev()->after()); - else - eSlot->after(nSlot->before()); - } - else - { - nSlot = m_last; - eSlot->prev(nSlot); - nSlot->next(eSlot); - eSlot->after(eSlot->prev()->after()); - eSlot->before(nSlot->after()); - } - return eSlot; -} - -void Segment::delLineEnd(Slot *s) -{ - Slot *nSlot = s->next(); - if (nSlot) - { - nSlot->prev(s->prev()); - if (s->prev()) - s->prev()->next(nSlot); - } - else - s->prev()->next(NULL); - freeSlot(s); -} - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/NameTable.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/NameTable.cpp deleted file mode 100644 index d29b92bc40e..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/NameTable.cpp +++ /dev/null @@ -1,222 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include "inc/Main.h" -#include "inc/Endian.h" - -#include "inc/NameTable.h" -#include "inc/UtfCodec.h" - -using namespace graphite2; - -NameTable::NameTable(const void* data, size_t length, uint16 platformId, uint16 encodingID) - : m_platformId(0), m_encodingId(0), m_languageCount(0), - m_platformOffset(0), m_platformLastRecord(0), m_nameDataLength(0), - m_table(0), m_nameData(NULL) -{ - void *pdata = malloc(length); - if (!pdata) return; - memcpy(pdata, data, length); - m_table = reinterpret_cast(pdata); - - if ((length > sizeof(TtfUtil::Sfnt::FontNames)) && - (length > sizeof(TtfUtil::Sfnt::FontNames) + - sizeof(TtfUtil::Sfnt::NameRecord) * ( be::swap(m_table->count) - 1))) - { - uint16 offset = be::swap(m_table->string_offset); - m_nameData = reinterpret_cast(pdata) + offset; - setPlatformEncoding(platformId, encodingID); - m_nameDataLength = length - offset; - } - else - { - free(const_cast(m_table)); - m_table = NULL; - } -} - -uint16 NameTable::setPlatformEncoding(uint16 platformId, uint16 encodingID) -{ - if (!m_nameData) return 0; - uint16 i = 0; - uint16 count = be::swap(m_table->count); - for (; i < count; i++) - { - if (be::swap(m_table->name_record[i].platform_id) == platformId && - be::swap(m_table->name_record[i].platform_specific_id) == encodingID) - { - m_platformOffset = i; - break; - } - } - while ((++i < count) && - (be::swap(m_table->name_record[i].platform_id) == platformId) && - (be::swap(m_table->name_record[i].platform_specific_id) == encodingID)) - { - m_platformLastRecord = i; - } - m_encodingId = encodingID; - m_platformId = platformId; - return 0; -} - -void* NameTable::getName(uint16& languageId, uint16 nameId, gr_encform enc, uint32& length) -{ - uint16 anyLang = 0; - uint16 enUSLang = 0; - uint16 bestLang = 0; - if (!m_table) - { - languageId = 0; - length = 0; - return NULL; - } - for (uint16 i = m_platformOffset; i <= m_platformLastRecord; i++) - { - if (be::swap(m_table->name_record[i].name_id) == nameId) - { - uint16 langId = be::swap(m_table->name_record[i].language_id); - if (langId == languageId) - { - bestLang = i; - break; - } - // MS language tags have the language in the lower byte, region in the higher - else if ((langId & 0xFF) == (languageId & 0xFF)) - { - bestLang = i; - } - else if (langId == 0x409) - { - enUSLang = i; - } - else - { - anyLang = i; - } - } - } - if (!bestLang) - { - if (enUSLang) bestLang = enUSLang; - else - { - bestLang = anyLang; - if (!anyLang) - { - languageId = 0; - length = 0; - return NULL; - } - } - } - const TtfUtil::Sfnt::NameRecord & nameRecord = m_table->name_record[bestLang]; - languageId = be::swap(nameRecord.language_id); - uint16 utf16Length = be::swap(nameRecord.length); - uint16 offset = be::swap(nameRecord.offset); - if(offset + utf16Length > m_nameDataLength) - { - languageId = 0; - length = 0; - return NULL; - } - utf16Length >>= 1; // in utf16 units - utf16::codeunit_t * utf16Name = gralloc(utf16Length); - const uint8* pName = m_nameData + offset; - for (size_t i = 0; i < utf16Length; i++) - { - utf16Name[i] = be::read(pName); - } - switch (enc) - { - case gr_utf8: - { - utf8::codeunit_t* uniBuffer = gralloc(3 * utf16Length + 1); - utf8::iterator d = uniBuffer; - for (utf16::const_iterator s = utf16Name, e = utf16Name + utf16Length; s != e; ++s, ++d) - *d = *s; - length = d - uniBuffer; - uniBuffer[length] = 0; - return uniBuffer; - } - case gr_utf16: - length = utf16Length; - return utf16Name; - case gr_utf32: - { - utf32::codeunit_t * uniBuffer = gralloc(utf16Length + 1); - utf32::iterator d = uniBuffer; - for (utf16::const_iterator s = utf16Name, e = utf16Name + utf16Length; s != e; ++s, ++d) - *d = *s; - length = d - uniBuffer; - uniBuffer[length] = 0; - return uniBuffer; - } - } - length = 0; - return NULL; -} - -uint16 NameTable::getLanguageId(const char * bcp47Locale) -{ - size_t localeLength = strlen(bcp47Locale); - uint16 localeId = m_locale2Lang.getMsId(bcp47Locale); - if (m_table && (be::swap(m_table->format) == 1)) - { - const uint8 * pLangEntries = reinterpret_cast(m_table) + - sizeof(TtfUtil::Sfnt::FontNames) - + sizeof(TtfUtil::Sfnt::NameRecord) * ( be::swap(m_table->count) - 1); - uint16 numLangEntries = be::read(pLangEntries); - const TtfUtil::Sfnt::LangTagRecord * langTag = - reinterpret_cast(pLangEntries); - if (pLangEntries + numLangEntries * sizeof(TtfUtil::Sfnt::LangTagRecord) <= m_nameData) - { - for (uint16 i = 0; i < numLangEntries; i++) - { - uint16 offset = be::swap(langTag[i].offset); - uint16 length = be::swap(langTag[i].length); - if ((offset + length <= m_nameDataLength) && (length == 2 * localeLength)) - { - const uint8* pName = m_nameData + offset; - bool match = true; - for (size_t j = 0; j < localeLength; j++) - { - uint16 code = be::read(pName); - if ((code > 0x7F) || (code != bcp47Locale[j])) - { - match = false; - break; - } - } - if (match) - return 0x8000 + i; - } - } - } - } - return localeId; -} - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/Pass.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/Pass.cpp deleted file mode 100644 index 51fabc8e8b0..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/Pass.cpp +++ /dev/null @@ -1,586 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include "inc/Main.h" -#include "inc/debug.h" -#include "inc/Endian.h" -#include "inc/Pass.h" -#include -#include -#include -#include "inc/Segment.h" -#include "inc/Code.h" -#include "inc/Rule.h" - -using namespace graphite2; -using vm::Machine; -typedef Machine::Code Code; - - -Pass::Pass() -: m_silf(0), - m_cols(0), - m_rules(0), - m_ruleMap(0), - m_startStates(0), - m_sTable(0), - m_states(0), - m_flags(0), - m_iMaxLoop(0), - m_numGlyphs(0), - m_numRules(0), - m_sRows(0), - m_sTransition(0), - m_sSuccess(0), - m_sColumns(0), - m_minPreCtxt(0), - m_maxPreCtxt(0) -{ -} - -Pass::~Pass() -{ - free(m_cols); - free(m_startStates); - free(m_sTable); - free(m_states); - free(m_ruleMap); - - delete [] m_rules; -} - -bool Pass::readPass(const byte * const pass_start, size_t pass_length, size_t subtable_base, const Face & face) -{ - const byte * p = pass_start, - * const pass_end = p + pass_length; - size_t numRanges; - - if (pass_length < 40) return false; - // Read in basic values - m_flags = be::read(p); - m_iMaxLoop = be::read(p); - be::skip(p,2); // skip maxContext & maxBackup - m_numRules = be::read(p); - be::skip(p); // fsmOffset - not sure why we would want this - const byte * const pcCode = pass_start + be::read(p) - subtable_base, - * const rcCode = pass_start + be::read(p) - subtable_base, - * const aCode = pass_start + be::read(p) - subtable_base; - be::skip(p); - m_sRows = be::read(p); - m_sTransition = be::read(p); - m_sSuccess = be::read(p); - m_sColumns = be::read(p); - numRanges = be::read(p); - be::skip(p, 3); // skip searchRange, entrySelector & rangeShift. - assert(p - pass_start == 40); - // Perform some sanity checks. - if ( m_sTransition > m_sRows - || m_sSuccess > m_sRows - || m_sSuccess + m_sTransition < m_sRows - || numRanges == 0) - return false; - - if (p + numRanges * 6 - 4 > pass_end) return false; - m_numGlyphs = be::peek(p + numRanges * 6 - 4) + 1; - // Calculate the start of various arrays. - const byte * const ranges = p; - be::skip(p, numRanges*3); - const byte * const o_rule_map = p; - be::skip(p, m_sSuccess + 1); - - // More sanity checks - if (reinterpret_cast(o_rule_map + m_sSuccess*sizeof(uint16)) > pass_end - || p > pass_end) - return false; - const size_t numEntries = be::peek(o_rule_map + m_sSuccess*sizeof(uint16)); - const byte * const rule_map = p; - be::skip(p, numEntries); - - if (p + 2*sizeof(uint8) > pass_end) return false; - m_minPreCtxt = be::read(p); - m_maxPreCtxt = be::read(p); - if (m_minPreCtxt > m_maxPreCtxt) return false; - const byte * const start_states = p; - be::skip(p, m_maxPreCtxt - m_minPreCtxt + 1); - const uint16 * const sort_keys = reinterpret_cast(p); - be::skip(p, m_numRules); - const byte * const precontext = p; - be::skip(p, m_numRules); - be::skip(p); // skip reserved byte - - if (p + sizeof(uint16) > pass_end) return false; - const size_t pass_constraint_len = be::read(p); - const uint16 * const o_constraint = reinterpret_cast(p); - be::skip(p, m_numRules + 1); - const uint16 * const o_actions = reinterpret_cast(p); - be::skip(p, m_numRules + 1); - const byte * const states = p; - be::skip(p, m_sTransition*m_sColumns); - be::skip(p); // skip reserved byte - if (p != pcCode || p >= pass_end) return false; - be::skip(p, pass_constraint_len); - if (p != rcCode || p >= pass_end - || size_t(rcCode - pcCode) != pass_constraint_len) return false; - be::skip(p, be::peek(o_constraint + m_numRules)); - if (p != aCode || p >= pass_end) return false; - be::skip(p, be::peek(o_actions + m_numRules)); - - // We should be at the end or within the pass - if (p > pass_end) return false; - - // Load the pass constraint if there is one. - if (pass_constraint_len) - { - m_cPConstraint = vm::Machine::Code(true, pcCode, pcCode + pass_constraint_len, - precontext[0], be::peek(sort_keys), *m_silf, face); - if (!m_cPConstraint) return false; - } - if (!readRanges(ranges, numRanges)) return false; - if (!readRules(rule_map, numEntries, precontext, sort_keys, - o_constraint, rcCode, o_actions, aCode, face)) return false; - return readStates(start_states, states, o_rule_map); -} - - -bool Pass::readRules(const byte * rule_map, const size_t num_entries, - const byte *precontext, const uint16 * sort_key, - const uint16 * o_constraint, const byte *rc_data, - const uint16 * o_action, const byte * ac_data, - const Face & face) -{ - const byte * const ac_data_end = ac_data + be::peek(o_action + m_numRules); - const byte * const rc_data_end = rc_data + be::peek(o_constraint + m_numRules); - - if (!(m_rules = new Rule [m_numRules])) return false; - precontext += m_numRules; - sort_key += m_numRules; - o_constraint += m_numRules; - o_action += m_numRules; - - // Load rules. - const byte * ac_begin = 0, * rc_begin = 0, - * ac_end = ac_data + be::peek(o_action), - * rc_end = rc_data + be::peek(o_constraint); - Rule * r = m_rules + m_numRules - 1; - for (size_t n = m_numRules; n; --n, --r, ac_end = ac_begin, rc_end = rc_begin) - { - r->preContext = *--precontext; - r->sort = be::peek(--sort_key); -#ifndef NDEBUG - r->rule_idx = n - 1; -#endif - if (r->sort > 63 || r->preContext >= r->sort || r->preContext > m_maxPreCtxt || r->preContext < m_minPreCtxt) - return false; - ac_begin = ac_data + be::peek(--o_action); - rc_begin = *--o_constraint ? rc_data + be::peek(o_constraint) : rc_end; - - if (ac_begin > ac_end || ac_begin > ac_data_end || ac_end > ac_data_end - || rc_begin > rc_end || rc_begin > rc_data_end || rc_end > rc_data_end) - return false; - r->action = new vm::Machine::Code(false, ac_begin, ac_end, r->preContext, r->sort, *m_silf, face); - r->constraint = new vm::Machine::Code(true, rc_begin, rc_end, r->preContext, r->sort, *m_silf, face); - - if (!r->action || !r->constraint - || r->action->status() != Code::loaded - || r->constraint->status() != Code::loaded - || !r->constraint->immutable()) - return false; - } - - // Load the rule entries map - RuleEntry * re = m_ruleMap = gralloc(num_entries); - for (size_t n = num_entries; n; --n, ++re) - { - const ptrdiff_t rn = be::read(rule_map); - if (rn >= m_numRules) return false; - re->rule = m_rules + rn; - } - - return true; -} - -static int cmpRuleEntry(const void *a, const void *b) { return (*(RuleEntry *)a < *(RuleEntry *)b ? -1 : - (*(RuleEntry *)b < *(RuleEntry *)a ? 1 : 0)); } - -bool Pass::readStates(const byte * starts, const byte *states, const byte * o_rule_map) -{ - m_startStates = gralloc(m_maxPreCtxt - m_minPreCtxt + 1); - m_states = gralloc(m_sRows); - m_sTable = gralloc(m_sTransition * m_sColumns); - - if (!m_startStates || !m_states || !m_sTable) return false; - // load start states - for (State * * s = m_startStates, - * * const s_end = s + m_maxPreCtxt - m_minPreCtxt + 1; s != s_end; ++s) - { - *s = m_states + be::read(starts); - if (*s < m_states || *s >= m_states + m_sRows) return false; // true; - } - - // load state transition table. - for (State * * t = m_sTable, - * * const t_end = t + m_sTransition*m_sColumns; t != t_end; ++t) - { - *t = m_states + be::read(states); - if (*t < m_states || *t >= m_states + m_sRows) return false; - } - - State * s = m_states, - * const transitions_end = m_states + m_sTransition, - * const success_begin = m_states + m_sRows - m_sSuccess; - const RuleEntry * rule_map_end = m_ruleMap + be::peek(o_rule_map + m_sSuccess*sizeof(uint16)); - for (size_t n = m_sRows; n; --n, ++s) - { - s->transitions = s < transitions_end ? m_sTable + (s-m_states)*m_sColumns : 0; - RuleEntry * const begin = s < success_begin ? 0 : m_ruleMap + be::read(o_rule_map), - * const end = s < success_begin ? 0 : m_ruleMap + be::peek(o_rule_map); - - if (begin >= rule_map_end || end > rule_map_end || begin > end) - return false; - s->rules = begin; - s->rules_end = (end - begin <= FiniteStateMachine::MAX_RULES)? end : - begin + FiniteStateMachine::MAX_RULES; - qsort(begin, end - begin, sizeof(RuleEntry), &cmpRuleEntry); - } - - return true; -} - -bool Pass::readRanges(const byte * ranges, size_t num_ranges) -{ - m_cols = gralloc(m_numGlyphs); - memset(m_cols, 0xFF, m_numGlyphs * sizeof(uint16)); - for (size_t n = num_ranges; n; --n) - { - const uint16 first = be::read(ranges), - last = be::read(ranges), - col = be::read(ranges); - uint16 *p; - - if (first > last || last >= m_numGlyphs || col >= m_sColumns) - return false; - - for (p = m_cols + first; p <= m_cols + last; ) - *p++ = col; - } - return true; -} - - -void Pass::runGraphite(Machine & m, FiniteStateMachine & fsm) const -{ - Slot *s = m.slotMap().segment.first(); - if (!s || !testPassConstraint(m)) return; - Slot *currHigh = s->next(); - -#if !defined GRAPHITE2_NTRACING - if (fsm.dbgout) *fsm.dbgout << "rules" << json::array; - json::closer rules_array_closer(fsm.dbgout); -#endif - - m.slotMap().highwater(currHigh); - int lc = m_iMaxLoop; - do - { - findNDoRule(s, m, fsm); - if (s && (m.slotMap().highpassed() || s == m.slotMap().highwater() || --lc == 0)) { - if (!lc) - { -// if (dbgout) *dbgout << json::item << json::flat << rule_event(-1, s, 1); - s = m.slotMap().highwater(); - } - lc = m_iMaxLoop; - if (s) - m.slotMap().highwater(s->next()); - } - } while (s); -} - -inline uint16 Pass::glyphToCol(const uint16 gid) const -{ - return gid < m_numGlyphs ? m_cols[gid] : 0xffffU; -} - -bool Pass::runFSM(FiniteStateMachine& fsm, Slot * slot) const -{ - fsm.reset(slot, m_maxPreCtxt); - if (fsm.slots.context() < m_minPreCtxt) - return false; - - const State * state = m_startStates[m_maxPreCtxt - fsm.slots.context()]; - do - { - fsm.slots.pushSlot(slot); - if (fsm.slots.size() >= SlotMap::MAX_SLOTS) return false; - const uint16 col = glyphToCol(slot->gid()); - if (col == 0xffffU || !state->is_transition()) return true; - - state = state->transitions[col]; - if (state->is_success()) - fsm.rules.accumulate_rules(*state); - - slot = slot->next(); - } while (state != m_states && slot); - - fsm.slots.pushSlot(slot); - return true; -} - -#if !defined GRAPHITE2_NTRACING - -inline -Slot * input_slot(const SlotMap & slots, const int n) -{ - Slot * s = slots[slots.context() + n]; - if (!s->isCopied()) return s; - - return s->prev() ? s->prev()->next() : (s->next() ? s->next()->prev() : slots.segment.last()); -} - -inline -Slot * output_slot(const SlotMap & slots, const int n) -{ - Slot * s = slots[slots.context() + n - 1]; - return s ? s->next() : slots.segment.first(); -} - -#endif //!defined GRAPHITE2_NTRACING - -void Pass::findNDoRule(Slot * & slot, Machine &m, FiniteStateMachine & fsm) const -{ - assert(slot); - - if (runFSM(fsm, slot)) - { - // Search for the first rule which passes the constraint - const RuleEntry * r = fsm.rules.begin(), - * const re = fsm.rules.end(); - while (r != re && !testConstraint(*r->rule, m)) ++r; - -#if !defined GRAPHITE2_NTRACING - if (fsm.dbgout) - { - if (fsm.rules.size() != 0) - { - *fsm.dbgout << json::item << json::object; - dumpRuleEventConsidered(fsm, *r); - if (r != re) - { - const int adv = doAction(r->rule->action, slot, m); - dumpRuleEventOutput(fsm, *r->rule, slot); - if (r->rule->action->deletes()) fsm.slots.collectGarbage(); - adjustSlot(adv, slot, fsm.slots); - *fsm.dbgout << "cursor" << objectid(dslot(&fsm.slots.segment, slot)) - << json::close; // Close RuelEvent object - - return; - } - else - { - *fsm.dbgout << json::close // close "considered" array - << "output" << json::null - << "cursor" << objectid(dslot(&fsm.slots.segment, slot->next())) - << json::close; - } - } - } - else -#endif - { - if (r != re) - { - const int adv = doAction(r->rule->action, slot, m); - if (r->rule->action->deletes()) fsm.slots.collectGarbage(); - adjustSlot(adv, slot, fsm.slots); - return; - } - } - } - - slot = slot->next(); -} - -#if !defined GRAPHITE2_NTRACING - -void Pass::dumpRuleEventConsidered(const FiniteStateMachine & fsm, const RuleEntry & re) const -{ - *fsm.dbgout << "considered" << json::array; - for (const RuleEntry *r = fsm.rules.begin(); r != &re; ++r) - { - if (r->rule->preContext > fsm.slots.context()) continue; - *fsm.dbgout << json::flat << json::object - << "id" << r->rule - m_rules - << "failed" << true - << "input" << json::flat << json::object - << "start" << objectid(dslot(&fsm.slots.segment, input_slot(fsm.slots, -r->rule->preContext))) - << "length" << r->rule->sort - << json::close // close "input" - << json::close; // close Rule object - } -} - - -void Pass::dumpRuleEventOutput(const FiniteStateMachine & fsm, const Rule & r, Slot * const last_slot) const -{ - *fsm.dbgout << json::item << json::flat << json::object - << "id" << &r - m_rules - << "failed" << false - << "input" << json::flat << json::object - << "start" << objectid(dslot(&fsm.slots.segment, input_slot(fsm.slots, 0))) - << "length" << r.sort - r.preContext - << json::close // close "input" - << json::close // close Rule object - << json::close // close considered array - << "output" << json::object - << "range" << json::flat << json::object - << "start" << objectid(dslot(&fsm.slots.segment, input_slot(fsm.slots, 0))) - << "end" << objectid(dslot(&fsm.slots.segment, last_slot)) - << json::close // close "input" - << "slots" << json::array; - const Position rsb_prepos = last_slot ? last_slot->origin() : fsm.slots.segment.advance(); - fsm.slots.segment.positionSlots(0); - - for(Slot * slot = output_slot(fsm.slots, 0); slot != last_slot; slot = slot->next()) - *fsm.dbgout << dslot(&fsm.slots.segment, slot); - *fsm.dbgout << json::close // close "slots" - << "postshift" << (last_slot ? last_slot->origin() : fsm.slots.segment.advance()) - rsb_prepos - << json::close; // close "output" object - -} - -#endif - - -inline -bool Pass::testPassConstraint(Machine & m) const -{ - if (!m_cPConstraint) return true; - - assert(m_cPConstraint.constraint()); - - m.slotMap().reset(*m.slotMap().segment.first(), 0); - m.slotMap().pushSlot(m.slotMap().segment.first()); - vm::slotref * map = m.slotMap().begin(); - const uint32 ret = m_cPConstraint.run(m, map); - -#if !defined GRAPHITE2_NTRACING - json * const dbgout = m.slotMap().segment.getFace()->logger(); - if (dbgout) - *dbgout << "constraint" << (ret && m.status() == Machine::finished); -#endif - - return ret && m.status() == Machine::finished; -} - - -bool Pass::testConstraint(const Rule & r, Machine & m) const -{ - const uint16 curr_context = m.slotMap().context(); - if (unsigned(r.sort - r.preContext) > m.slotMap().size() - curr_context - || curr_context - r.preContext < 0) return false; - if (!*r.constraint) return true; - assert(r.constraint->constraint()); - - vm::slotref * map = m.slotMap().begin() + curr_context - r.preContext; - for (int n = r.sort; n && map; --n, ++map) - { - if (!*map) continue; - const int32 ret = r.constraint->run(m, map); - if (!ret || m.status() != Machine::finished) - return false; - } - - return true; -} - - -void SlotMap::collectGarbage() -{ - for(Slot **s = begin(), *const *const se = end() - 1; s != se; ++s) { - Slot *& slot = *s; - if(slot->isDeleted() || slot->isCopied()) - segment.freeSlot(slot); - } -} - - - -int Pass::doAction(const Code *codeptr, Slot * & slot_out, vm::Machine & m) const -{ - assert(codeptr); - if (!*codeptr) return 0; - SlotMap & smap = m.slotMap(); - vm::slotref * map = &smap[smap.context()]; - smap.highpassed(false); - - int32 ret = codeptr->run(m, map); - - if (m.status() != Machine::finished) - { - slot_out = NULL; - smap.highwater(0); - return 0; - } - - slot_out = *map; - return ret; -} - - -void Pass::adjustSlot(int delta, Slot * & slot_out, SlotMap & smap) const -{ - if (delta < 0) - { - if (!slot_out) - { - slot_out = smap.segment.last(); - ++delta; - if (smap.highpassed() && !smap.highwater()) - smap.highpassed(false); - } - while (++delta <= 0 && slot_out) - { - if (smap.highpassed() && smap.highwater() == slot_out) - smap.highpassed(false); - slot_out = slot_out->prev(); - } - } - else if (delta > 0) - { - if (!slot_out) - { - slot_out = smap.segment.first(); - --delta; - } - while (--delta >= 0 && slot_out) - { - slot_out = slot_out->next(); - if (slot_out == smap.highwater() && slot_out) - smap.highpassed(true); - } - } -} - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/Rule.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/Rule.cpp deleted file mode 100644 index afdab495f53..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/Rule.cpp +++ /dev/null @@ -1,31 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ - -#include "inc/Rule.h" -#include "inc/Segment.h" - -using namespace graphite2; diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/SegCache.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/SegCache.cpp deleted file mode 100644 index 446dfbec43f..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/SegCache.cpp +++ /dev/null @@ -1,224 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ - -#include "inc/Main.h" -#include "inc/TtfTypes.h" -#include "inc/TtfUtil.h" -#include "inc/SegCache.h" -#include "inc/SegCacheEntry.h" -#include "inc/SegCacheStore.h" -#include "inc/CmapCache.h" - - -using namespace graphite2; - -#ifndef GRAPHITE2_NSEGCACHE - -SegCache::SegCache(const SegCacheStore * store, const Features & feats) -: m_prefixLength(ePrefixLength), - m_maxCachedSegLength(eMaxSpliceSize), - m_segmentCount(0), - m_features(feats), - m_totalAccessCount(0l), m_totalMisses(0l), - m_purgeFactor(1.0f / (ePurgeFactor * store->maxSegmentCount())) -{ - m_prefixes.raw = grzeroalloc(store->maxCmapGid() + 2); - m_prefixes.range[SEG_CACHE_MIN_INDEX] = SEG_CACHE_UNSET_INDEX; - m_prefixes.range[SEG_CACHE_MAX_INDEX] = SEG_CACHE_UNSET_INDEX; -} - -void SegCache::freeLevel(SegCacheStore * store, SegCachePrefixArray prefixes, size_t level) -{ - for (size_t i = 0; i < store->maxCmapGid(); i++) - { - if (prefixes.array[i].raw) - { - if (level + 1 < ePrefixLength) - freeLevel(store, prefixes.array[i], level + 1); - else - { - SegCachePrefixEntry * prefixEntry = prefixes.prefixEntries[i]; - delete prefixEntry; - } - } - } - free(prefixes.raw); -} - -void SegCache::clear(SegCacheStore * store) -{ - freeLevel(store, m_prefixes, 0); - m_prefixes.raw = NULL; -} - -SegCache::~SegCache() -{ - assert(m_prefixes.raw == NULL); -} - -SegCacheEntry* SegCache::cache(SegCacheStore * store, const uint16* cmapGlyphs, size_t length, Segment * seg, size_t charOffset) -{ - uint16 pos = 0; - if (!length) return NULL; - assert(length < m_maxCachedSegLength); - SegCachePrefixArray pArray = m_prefixes; - while (pos + 1 < m_prefixLength) - { - uint16 gid = (pos < length)? cmapGlyphs[pos] : 0; - if (!pArray.array[gid].raw) - { - pArray.array[gid].raw = grzeroalloc(store->maxCmapGid() + 2); - if (!pArray.array[gid].raw) - return NULL; // malloc failed - if (pArray.range[SEG_CACHE_MIN_INDEX] == SEG_CACHE_UNSET_INDEX) - { - pArray.range[SEG_CACHE_MIN_INDEX] = gid; - pArray.range[SEG_CACHE_MAX_INDEX] = gid; - } - else - { - if (gid < pArray.range[SEG_CACHE_MIN_INDEX]) - pArray.range[SEG_CACHE_MIN_INDEX] = gid; - else if (gid > pArray.range[SEG_CACHE_MAX_INDEX]) - pArray.range[SEG_CACHE_MAX_INDEX] = gid; - } - } - pArray = pArray.array[gid]; - ++pos; - } - uint16 gid = (pos < length)? cmapGlyphs[pos] : 0; - SegCachePrefixEntry * prefixEntry = pArray.prefixEntries[gid]; - if (!prefixEntry) - { - prefixEntry = new SegCachePrefixEntry(); - pArray.prefixEntries[gid] = prefixEntry; - if (pArray.range[SEG_CACHE_MIN_INDEX] == SEG_CACHE_UNSET_INDEX) - { - pArray.range[SEG_CACHE_MIN_INDEX] = gid; - pArray.range[SEG_CACHE_MAX_INDEX] = gid; - } - else - { - if (gid < pArray.range[SEG_CACHE_MIN_INDEX]) - pArray.range[SEG_CACHE_MIN_INDEX] = gid; - else if (gid > pArray.range[SEG_CACHE_MAX_INDEX]) - pArray.range[SEG_CACHE_MAX_INDEX] = gid; - } - } - if (!prefixEntry) return NULL; - // if the cache is full run a purge - this is slow, since it walks the tree - if (m_segmentCount + 1 > store->maxSegmentCount()) - { - purge(store); - assert(m_segmentCount < store->maxSegmentCount()); - } - SegCacheEntry * pEntry = prefixEntry->cache(cmapGlyphs, length, seg, charOffset, m_totalAccessCount); - if (pEntry) ++m_segmentCount; - return pEntry; -} - -void SegCache::purge(SegCacheStore * store) -{ - unsigned long long minAccessCount = static_cast(m_totalAccessCount * m_purgeFactor + 1); - if (minAccessCount < 2) minAccessCount = 2; - unsigned long long oldAccessTime = m_totalAccessCount - store->maxSegmentCount() / eAgeFactor; - purgeLevel(store, m_prefixes, 0, minAccessCount, oldAccessTime); -} - -void SegCache::purgeLevel(SegCacheStore * store, SegCachePrefixArray prefixes, size_t level, - unsigned long long minAccessCount, unsigned long long oldAccessTime) -{ - if (prefixes.range[SEG_CACHE_MIN_INDEX] == SEG_CACHE_UNSET_INDEX) return; - size_t maxGlyphCached = prefixes.range[SEG_CACHE_MAX_INDEX]; - for (size_t i = prefixes.range[SEG_CACHE_MIN_INDEX]; i <= maxGlyphCached; i++) - { - if (prefixes.array[i].raw) - { - if (level + 1 < ePrefixLength) - purgeLevel(store, prefixes.array[i], level + 1, minAccessCount, oldAccessTime); - else - { - SegCachePrefixEntry * prefixEntry = prefixes.prefixEntries[i]; - m_segmentCount -= prefixEntry->purge(minAccessCount, - oldAccessTime, m_totalAccessCount); - } - } - } -} - -uint32 SegCachePrefixEntry::purge(unsigned long long minAccessCount, - unsigned long long oldAccessTime, - unsigned long long currentTime) -{ - // ignore the purge request if another has been done recently - //if (m_lastPurge > oldAccessTime) - // return 0; - - uint32 totalPurged = 0; - // real length is length + 1 in this loop - for (uint16 length = 0; length < eMaxSpliceSize; length++) - { - if (m_entryCounts[length] == 0) - continue; - uint16 purgeCount = 0; - uint16 newIndex = 0; - for (uint16 j = 0; j < m_entryCounts[length]; j++) - { - SegCacheEntry & tempEntry = m_entries[length][j]; - // purge entries with a low access count which haven't been - // accessed recently - if (tempEntry.accessCount() <= minAccessCount && - tempEntry.lastAccess() <= oldAccessTime) - { - tempEntry.clear(); - ++purgeCount; - } - else - { - memcpy(m_entries[length] + newIndex++, m_entries[length] + j, sizeof(SegCacheEntry)); - } - } - if (purgeCount == m_entryCounts[length]) - { - assert(newIndex == 0); - m_entryCounts[length] = 0; - m_entryBSIndex[length] = 0; - free(m_entries[length]); - m_entries[length] = NULL; - } - else if (purgeCount > 0) - { - assert(m_entryCounts[length] == newIndex + purgeCount); - m_entryCounts[length] = newIndex; - } - totalPurged += purgeCount; - } - m_lastPurge = currentTime; - return totalPurged; -} - -#endif diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/SegCacheEntry.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/SegCacheEntry.cpp deleted file mode 100644 index 5e87646185a..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/SegCacheEntry.cpp +++ /dev/null @@ -1,106 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ - -#ifndef GRAPHITE2_NSEGCACHE - -#include "inc/Main.h" -#include "inc/Slot.h" -#include "inc/Segment.h" -#include "inc/SegCache.h" -#include "inc/SegCacheEntry.h" - - -using namespace graphite2; - -SegCacheEntry::SegCacheEntry(const uint16* cmapGlyphs, size_t length, Segment * seg, size_t charOffset, long long cacheTime) - : m_glyphLength(0), m_unicode(gralloc(length)), m_glyph(NULL), - m_attr(NULL), m_justs(NULL), - m_accessCount(0), m_lastAccess(cacheTime) -{ - for (uint16 i = 0; i < length; i++) - { - m_unicode[i] = cmapGlyphs[i]; - } - const size_t glyphCount = seg->slotCount(), - sizeof_sjust = SlotJustify::size_of(seg->silf()->numJustLevels()); - size_t num_justs = 0, - justs_pos = 0; - if (seg->hasJustification()) - { - for (const Slot * s = seg->first(); s; s = s->next()) - { - if (s->m_justs == 0) continue; - ++num_justs; - } - m_justs = gralloc(sizeof_sjust * num_justs); - } - const Slot * slot = seg->first(); - m_glyph = new Slot[glyphCount]; - m_attr = gralloc(glyphCount * seg->numAttrs()); - m_glyphLength = glyphCount; - Slot * slotCopy = m_glyph; - m_glyph->prev(NULL); - - uint16 pos = 0; - while (slot) - { - slotCopy->userAttrs(m_attr + pos * seg->numAttrs()); - slotCopy->m_justs = m_justs ? reinterpret_cast(m_justs + justs_pos++ * sizeof_sjust) : 0; - slotCopy->set(*slot, -static_cast(charOffset), seg->numAttrs(), seg->silf()->numJustLevels()); - slotCopy->index(pos); - if (slot->firstChild()) - slotCopy->m_child = m_glyph + slot->firstChild()->index(); - if (slot->attachedTo()) - slotCopy->attachTo(m_glyph + slot->attachedTo()->index()); - if (slot->nextSibling()) - slotCopy->m_sibling = m_glyph + slot->nextSibling()->index(); - slot = slot->next(); - ++slotCopy; - ++pos; - if (slot) - { - slotCopy->prev(slotCopy-1); - (slotCopy-1)->next(slotCopy); - } - } -} - - -void SegCacheEntry::clear() -{ - free(m_unicode); - free(m_attr); - free(m_justs); - delete [] m_glyph; - m_unicode = NULL; - m_glyph = NULL; - m_glyphLength = 0; - m_attr = NULL; -} - -#endif - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/SegCacheStore.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/SegCacheStore.cpp deleted file mode 100644 index 236fb707ffa..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/SegCacheStore.cpp +++ /dev/null @@ -1,47 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ - -#ifndef GRAPHITE2_NSEGCACHE - -#include "inc/SegCacheStore.h" -#include "inc/Face.h" - - -using namespace graphite2; - -SegCacheStore::SegCacheStore(const Face & face, unsigned int numSilf, size_t maxSegments) -: m_caches(new SilfSegCache[numSilf]), - m_numSilf(numSilf), - m_maxSegments(maxSegments), - m_maxCmapGid(face.glyphs().numGlyphs()), - m_spaceGid(face.cmap()[0x20]), - m_zwspGid(face.cmap()[0x200B]) -{ -} - -#endif - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/Segment.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/Segment.cpp deleted file mode 100644 index 8b54198b023..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/Segment.cpp +++ /dev/null @@ -1,453 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include "inc/UtfCodec.h" -#include -#include - -#include "inc/bits.h" -#include "inc/Segment.h" -#include "graphite2/Font.h" -#include "inc/CharInfo.h" -#include "inc/debug.h" -#include "inc/Slot.h" -#include "inc/Main.h" -#include "inc/CmapCache.h" -#include "graphite2/Segment.h" - - -using namespace graphite2; - -Segment::Segment(unsigned int numchars, const Face* face, uint32 script, int textDir) -: m_freeSlots(NULL), - m_freeJustifies(NULL), - m_charinfo(new CharInfo[numchars]), - m_face(face), - m_silf(face->chooseSilf(script)), - m_first(NULL), - m_last(NULL), - m_bufSize(numchars + 10), - m_numGlyphs(numchars), - m_numCharinfo(numchars), - m_defaultOriginal(0), - m_dir(textDir) -{ - freeSlot(newSlot()); - m_bufSize = log_binary(numchars)+1; -} - -Segment::~Segment() -{ - for (SlotRope::iterator i = m_slots.begin(); i != m_slots.end(); ++i) - free(*i); - for (AttributeRope::iterator j = m_userAttrs.begin(); j != m_userAttrs.end(); ++j) - free(*j); - delete[] m_charinfo; -} - -#ifndef GRAPHITE2_NSEGCACHE -SegmentScopeState Segment::setScope(Slot * firstSlot, Slot * lastSlot, size_t subLength) -{ - SegmentScopeState state; - state.numGlyphsOutsideScope = m_numGlyphs - subLength; - state.realFirstSlot = m_first; - state.slotBeforeScope = firstSlot->prev(); - state.slotAfterScope = lastSlot->next(); - state.realLastSlot = m_last; - firstSlot->prev(NULL); - lastSlot->next(NULL); - assert(m_defaultOriginal == 0); - m_defaultOriginal = firstSlot->original(); - m_numGlyphs = subLength; - m_first = firstSlot; - m_last = lastSlot; - return state; -} - -void Segment::removeScope(SegmentScopeState & state) -{ - m_numGlyphs = state.numGlyphsOutsideScope + m_numGlyphs; - if (state.slotBeforeScope) - { - state.slotBeforeScope->next(m_first); - m_first->prev(state.slotBeforeScope); - m_first = state.realFirstSlot; - } - if (state.slotAfterScope) - { - state.slotAfterScope->prev(m_last); - m_last->next(state.slotAfterScope); - m_last = state.realLastSlot; - } - m_defaultOriginal = 0; -} - - -void Segment::append(const Segment &other) -{ - Rect bbox = other.m_bbox + m_advance; - - m_slots.insert(m_slots.end(), other.m_slots.begin(), other.m_slots.end()); - CharInfo* pNewCharInfo = new CharInfo[m_numCharinfo+other.m_numCharinfo]; //since CharInfo has no constructor, this doesn't do much - for (unsigned int i=0 ; inext(other.m_first); - other.m_last->prev(m_last); - m_userAttrs.insert(m_userAttrs.end(), other.m_userAttrs.begin(), other.m_userAttrs.end()); - - delete[] m_charinfo; - m_charinfo = pNewCharInfo; - pNewCharInfo += m_numCharinfo ; - for (unsigned int i=0 ; iglyphs().glyphSafe(gid); - if (theGlyph) - { - m_charinfo[id].breakWeight(theGlyph->attrs()[m_silf->aBreak()]); - } - else - { - m_charinfo[id].breakWeight(0); - } - - aSlot->child(NULL); - aSlot->setGlyph(this, gid, theGlyph); - aSlot->originate(id); - aSlot->before(id); - aSlot->after(id); - if (m_last) m_last->next(aSlot); - aSlot->prev(m_last); - m_last = aSlot; - if (!m_first) m_first = aSlot; -} - -Slot *Segment::newSlot() -{ - if (!m_freeSlots) - { - int numUser = m_silf->numUser(); -#if !defined GRAPHITE2_NTRACING - if (m_face->logger()) ++numUser; -#endif - Slot *newSlots = grzeroalloc(m_bufSize); - int16 *newAttrs = grzeroalloc(numUser * m_bufSize); - newSlots[0].userAttrs(newAttrs); - for (size_t i = 1; i < m_bufSize - 1; i++) - { - newSlots[i].next(newSlots + i + 1); - newSlots[i].userAttrs(newAttrs + i * numUser); - } - newSlots[m_bufSize - 1].userAttrs(newAttrs + (m_bufSize - 1) * numUser); - newSlots[m_bufSize - 1].next(NULL); - m_slots.push_back(newSlots); - m_userAttrs.push_back(newAttrs); - m_freeSlots = (m_bufSize > 1)? newSlots + 1 : NULL; - return newSlots; - } - Slot *res = m_freeSlots; - m_freeSlots = m_freeSlots->next(); - res->next(NULL); - return res; -} - -void Segment::freeSlot(Slot *aSlot) -{ - if (m_last == aSlot) m_last = aSlot->prev(); - if (m_first == aSlot) m_first = aSlot->next(); - // reset the slot incase it is reused - ::new (aSlot) Slot; - memset(aSlot->userAttrs(), 0, m_silf->numUser() * sizeof(int16)); - // Update generation counter for debug -#if !defined GRAPHITE2_NTRACING - if (m_face->logger()) - ++aSlot->userAttrs()[m_silf->numUser()]; -#endif - // update next pointer - if (!m_freeSlots) - aSlot->next(NULL); - else - aSlot->next(m_freeSlots); - m_freeSlots = aSlot; -} - -SlotJustify *Segment::newJustify() -{ - if (!m_freeJustifies) - { - const size_t justSize = SlotJustify::size_of(m_silf->numJustLevels()); - byte *justs = grzeroalloc(justSize * m_bufSize); - for (int i = m_bufSize - 2; i >= 0; --i) - { - SlotJustify *p = reinterpret_cast(justs + justSize * i); - SlotJustify *next = reinterpret_cast(justs + justSize * (i + 1)); - p->next = next; - } - m_freeJustifies = (SlotJustify *)justs; - m_justifies.push_back(m_freeJustifies); - } - SlotJustify *res = m_freeJustifies; - m_freeJustifies = m_freeJustifies->next; - res->next = NULL; - return res; -} - -void Segment::freeJustify(SlotJustify *aJustify) -{ - int numJust = m_silf->numJustLevels(); - if (m_silf->numJustLevels() <= 0) numJust = 1; - aJustify->next = m_freeJustifies; - memset(aJustify->values, 0, numJust*SlotJustify::NUMJUSTPARAMS*sizeof(int16)); - m_freeJustifies = aJustify; -} - -#ifndef GRAPHITE2_NSEGCACHE -void Segment::splice(size_t offset, size_t length, Slot * const startSlot, - Slot * endSlot, const Slot * srcSlot, - const size_t numGlyphs) -{ - extendLength(numGlyphs - length); - // remove any extra - if (numGlyphs < length) - { - Slot * end = endSlot->next(); - do - { - endSlot = endSlot->prev(); - freeSlot(endSlot->next()); - } while (numGlyphs < --length); - endSlot->next(end); - if (end) - end->prev(endSlot); - } - else - { - // insert extra slots if needed - while (numGlyphs > length) - { - Slot * extra = newSlot(); - extra->prev(endSlot); - extra->next(endSlot->next()); - endSlot->next(extra); - if (extra->next()) - extra->next()->prev(extra); - if (m_last == endSlot) - m_last = extra; - endSlot = extra; - ++length; - } - } - - endSlot = endSlot->next(); - assert(numGlyphs == length); - Slot * indexmap[eMaxSpliceSize*3]; - assert(numGlyphs < sizeof indexmap/sizeof *indexmap); - Slot * slot = startSlot; - for (uint16 i=0; i < numGlyphs; slot = slot->next(), ++i) - indexmap[i] = slot; - - slot = startSlot; - for (slot=startSlot; slot != endSlot; slot = slot->next(), srcSlot = srcSlot->next()) - { - slot->set(*srcSlot, offset, m_silf->numUser(), m_silf->numJustLevels()); - if (srcSlot->attachedTo()) slot->attachTo(indexmap[srcSlot->attachedTo()->index()]); - if (srcSlot->nextSibling()) slot->m_sibling = indexmap[srcSlot->nextSibling()->index()]; - if (srcSlot->firstChild()) slot->m_child = indexmap[srcSlot->firstChild()->index()]; - } -} -#endif // GRAPHITE2_NSEGCACHE - -void Segment::linkClusters(Slot *s, Slot * end) -{ - end = end->next(); - - for (; s != end && !s->isBase(); s = s->next()); - Slot * ls = s; - - if (m_dir & 1) - { - for (; s != end; s = s->next()) - { - if (!s->isBase()) continue; - - s->sibling(ls); - ls = s; - } - } - else - { - for (; s != end; s = s->next()) - { - if (!s->isBase()) continue; - - ls->sibling(s); - ls = s; - } - } -} - -Position Segment::positionSlots(const Font *font, Slot * iStart, Slot * iEnd) -{ - Position currpos(0., 0.); - Rect bbox; - float clusterMin = 0.; - - if (!iStart) iStart = m_first; - if (!iEnd) iEnd = m_last; - - if (m_dir & 1) - { - for (Slot * s = iEnd, * const end = iStart->prev(); s && s != end; s = s->prev()) - { - if (s->isBase()) - currpos = s->finalise(this, font, currpos, bbox, 0, clusterMin = currpos.x); - } - } - else - { - for (Slot * s = iStart, * const end = iEnd->next(); s && s != end; s = s->next()) - { - if (s->isBase()) - currpos = s->finalise(this, font, currpos, bbox, 0, clusterMin = currpos.x); - } - } - return currpos; -} - - -void Segment::associateChars() -{ - int i = 0; - for (Slot * s = m_first; s; s->index(i++), s = s->next()) - { - int j = s->before(); - if (j < 0) continue; - - for (const int after = s->after(); j <= after; ++j) - { - CharInfo & c = *charinfo(j); - if (c.before() == -1 || i < c.before()) c.before(i); - if (c.after() < i) c.after(i); - } - } -} - - -template -inline void process_utf_data(Segment & seg, const Face & face, const int fid, utf_iter c, size_t n_chars) -{ - const Cmap & cmap = face.cmap(); - int slotid = 0; - - const typename utf_iter::codeunit_type * const base = c; - for (; n_chars; --n_chars, ++c, ++slotid) - { - const uint32 usv = *c; - uint16 gid = cmap[usv]; - if (!gid) gid = face.findPseudo(usv); - seg.appendSlot(slotid, usv, gid, fid, c - base); - } -} - - -void Segment::read_text(const Face *face, const Features* pFeats/*must not be NULL*/, gr_encform enc, const void* pStart, size_t nChars) -{ - assert(face); - assert(pFeats); - - switch (enc) - { - case gr_utf8: process_utf_data(*this, *face, addFeatures(*pFeats), utf8::const_iterator(pStart), nChars); break; - case gr_utf16: process_utf_data(*this, *face, addFeatures(*pFeats), utf16::const_iterator(pStart), nChars); break; - case gr_utf32: process_utf_data(*this, *face, addFeatures(*pFeats), utf32::const_iterator(pStart), nChars); break; - } -} - -void Segment::prepare_pos(const Font * /*font*/) -{ - // copy key changeable metrics into slot (if any); -} - -Slot *resolveExplicit(int level, int dir, Slot *s, int nNest = 0); -void resolveWeak(int baseLevel, Slot *s); -void resolveNeutrals(int baseLevel, Slot *s); -void resolveImplicit(Slot *s, Segment *seg, uint8 aMirror); -void resolveWhitespace(int baseLevel, Segment *seg, uint8 aBidi, Slot *s); -Slot *resolveOrder(Slot * & s, const bool reordered, const int level = 0); - -void Segment::bidiPass(uint8 aBidi, int paradir, uint8 aMirror) -{ - if (slotCount() == 0) - return; - - Slot *s; - int baseLevel = paradir ? 1 : 0; - unsigned int bmask = 0; - for (s = first(); s; s = s->next()) - { - unsigned int bAttr = glyphAttr(s->gid(), aBidi); - s->setBidiClass((bAttr <= 16) * bAttr); - bmask |= (1 << s->getBidiClass()); - s->setBidiLevel(baseLevel); - } - if (bmask & (paradir ? 0x92 : 0x9C)) - { - if (bmask & 0xF800) - resolveExplicit(baseLevel, 0, first(), 0); - if (bmask & 0x10178) - resolveWeak(baseLevel, first()); - if (bmask & 0x361) - resolveNeutrals(baseLevel, first()); - resolveImplicit(first(), this, aMirror); - resolveWhitespace(baseLevel, this, aBidi, last()); - s = resolveOrder(s = first(), baseLevel != 0); - first(s); last(s->prev()); - s->prev()->next(0); s->prev(0); - } - else if (!(dir() & 4) && baseLevel && aMirror) - { - for (s = first(); s; s = s->next()) - { - unsigned short g = glyphAttr(s->gid(), aMirror); - if (g) s->setGlyph(this, g); - } - } -} - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/Silf.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/Silf.cpp deleted file mode 100644 index 96d78e77549..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/Silf.cpp +++ /dev/null @@ -1,385 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include -#include "graphite2/Segment.h" -#include "inc/debug.h" -#include "inc/Endian.h" -#include "inc/Silf.h" -#include "inc/Segment.h" -#include "inc/Rule.h" - - -using namespace graphite2; - -namespace { static const uint32 ERROROFFSET = 0xFFFFFFFF; } - -Silf::Silf() throw() -: m_passes(0), - m_pseudos(0), - m_classOffsets(0), - m_classData(0), - m_justs(0), - m_numPasses(0), - m_numJusts(0), - m_sPass(0), - m_pPass(0), - m_jPass(0), - m_bPass(0), - m_flags(0), - m_aPseudo(0), - m_aBreak(0), - m_aUser(0), - m_aBidi(0), - m_aMirror(0), - m_iMaxComp(0), - m_aLig(0), - m_numPseudo(0), - m_nClass(0), - m_nLinear(0), - m_gEndLine(0) -{ - memset(&m_silfinfo, 0, sizeof m_silfinfo); -} - -Silf::~Silf() throw() -{ - releaseBuffers(); -} - -void Silf::releaseBuffers() throw() -{ - delete [] m_passes; - delete [] m_pseudos; - free(m_classOffsets); - free(m_classData); - free(m_justs); - m_passes= 0; - m_pseudos = 0; - m_classOffsets = 0; - m_classData = 0; - m_justs = 0; -} - - -bool Silf::readGraphite(const byte * const silf_start, size_t lSilf, const Face& face, uint32 version) -{ - const byte * p = silf_start, - * const silf_end = p + lSilf; - - if (version >= 0x00030000) - { - if (lSilf < 28) { releaseBuffers(); return false; } - be::skip(p); // ruleVersion - be::skip(p,2); // passOffset & pseudosOffset - } - else if (lSilf < 20) { releaseBuffers(); return false; } - const uint16 maxGlyph = be::read(p); - m_silfinfo.extra_ascent = be::read(p); - m_silfinfo.extra_descent = be::read(p); - m_numPasses = be::read(p); - m_sPass = be::read(p); - m_pPass = be::read(p); - m_jPass = be::read(p); - m_bPass = be::read(p); - m_flags = be::read(p); - be::skip(p,2); // max{Pre,Post}Context. - m_aPseudo = be::read(p); - m_aBreak = be::read(p); - m_aBidi = be::read(p); - m_aMirror = be::read(p); - be::skip(p); // skip reserved stuff - - // Read Justification levels. - m_numJusts = be::read(p); - if (maxGlyph >= face.glyphs().numGlyphs() - || p + m_numJusts * 8 >= silf_end) { releaseBuffers(); return false; } - m_justs = gralloc(m_numJusts); - for (uint8 i = 0; i < m_numJusts; i++) - { - ::new(m_justs + i) Justinfo(p[0], p[1], p[2], p[3]); - be::skip(p,8); - } - - if (p + sizeof(uint16) + sizeof(uint8)*8 >= silf_end) { releaseBuffers(); return false; } - m_aLig = be::read(p); - m_aUser = be::read(p); - m_iMaxComp = be::read(p); - be::skip(p,5); // direction and 4 reserved bytes - be::skip(p, be::read(p)); // don't need critical features yet - be::skip(p); // reserved - if (p >= silf_end) { releaseBuffers(); return false; } - be::skip(p, be::read(p)); // don't use scriptTag array. - m_gEndLine = be::read(p); // lbGID - if (p >= silf_end) { releaseBuffers(); return false; } - const byte * o_passes = p, - * const passes_start = silf_start + be::read(p); - - const size_t num_attrs = face.glyphs().numAttrs(); - if (m_aPseudo >= num_attrs - || m_aBreak >= num_attrs - || m_aBidi >= num_attrs - || m_aMirror>= num_attrs - || m_numPasses > 128 || passes_start >= silf_end - || m_pPass < m_sPass || m_pPass > m_numPasses || m_sPass > m_numPasses - || m_jPass < m_pPass || m_jPass > m_numPasses - || (m_bPass != 0xFF && (m_bPass < m_jPass || m_bPass > m_numPasses)) - || m_aLig > 127) { releaseBuffers(); return false; } - be::skip(p, m_numPasses); - if (p + sizeof(uint16) >= passes_start) { releaseBuffers(); return false; } - m_numPseudo = be::read(p); - be::skip(p, 3); // searchPseudo, pseudoSelector, pseudoShift - if (p + m_numPseudo*(sizeof(uint32) + sizeof(uint16)) >= passes_start) { - releaseBuffers(); return false; - } - m_pseudos = new Pseudo[m_numPseudo]; - for (int i = 0; i < m_numPseudo; i++) - { - m_pseudos[i].uid = be::read(p); - m_pseudos[i].gid = be::read(p); - } - - const size_t clen = readClassMap(p, passes_start - p, version); - if (clen == ERROROFFSET || p + clen > passes_start) { releaseBuffers(); return false; } - - m_passes = new Pass[m_numPasses]; - for (size_t i = 0; i < m_numPasses; ++i) - { - const byte * const pass_start = silf_start + be::read(o_passes), - * const pass_end = silf_start + be::peek(o_passes); - if (pass_start > pass_end || pass_end > silf_end) { - releaseBuffers(); return false; - } - - m_passes[i].init(this); - if (!m_passes[i].readPass(pass_start, pass_end - pass_start, pass_start - silf_start, face)) - { - releaseBuffers(); - return false; - } - } - - // fill in gr_faceinfo - m_silfinfo.upem = face.glyphs().unitsPerEm(); - m_silfinfo.has_bidi_pass = (m_bPass != 0xFF); - m_silfinfo.justifies = (m_numJusts != 0) || (m_jPass < m_pPass); - m_silfinfo.line_ends = (m_flags & 1); - m_silfinfo.space_contextuals = gr_faceinfo::gr_space_contextuals((m_flags >> 2) & 0x7); - return true; -} - -template inline uint32 Silf::readClassOffsets(const byte *&p, size_t data_len) -{ - const T cls_off = 2*sizeof(uint16) + sizeof(T)*(m_nClass+1); - const size_t max_off = (be::peek(p + sizeof(T)*m_nClass) - cls_off)/sizeof(uint16); - // Check that the last+1 offset is less than or equal to the class map length. - if (be::peek(p) != cls_off || max_off > (data_len - cls_off)/sizeof(uint16)) - return ERROROFFSET; - - // Read in all the offsets. - m_classOffsets = gralloc(m_nClass+1); - for (uint32 * o = m_classOffsets, * const o_end = o + m_nClass + 1; o != o_end; ++o) - { - *o = (be::read(p) - cls_off)/sizeof(uint16); - if (*o > max_off) - return ERROROFFSET; - } - return max_off; -} - -size_t Silf::readClassMap(const byte *p, size_t data_len, uint32 version) -{ - if (data_len < sizeof(uint16)*2) return ERROROFFSET; - - m_nClass = be::read(p); - m_nLinear = be::read(p); - - // Check that numLinear < numClass, - // that there is at least enough data for numClasses offsets. - if (m_nLinear > m_nClass - || (m_nClass + 1) * (version >= 0x00040000 ? sizeof(uint32) : sizeof(uint16))> (data_len - 4)) - return ERROROFFSET; - - - uint32 max_off; - if (version >= 0x00040000) - max_off = readClassOffsets(p, data_len); - else - max_off = readClassOffsets(p, data_len); - - if (max_off == ERROROFFSET) return ERROROFFSET; - - // Check the linear offsets are sane, these must be monotonically increasing. - for (const uint32 *o = m_classOffsets, * const o_end = o + m_nLinear; o != o_end; ++o) - if (o[0] > o[1]) - return ERROROFFSET; - - // Fortunately the class data is all uint16s so we can decode these now - m_classData = gralloc(max_off); - for (uint16 *d = m_classData, * const d_end = d + max_off; d != d_end; ++d) - *d = be::read(p); - - // Check the lookup class invariants for each non-linear class - for (const uint32 *o = m_classOffsets + m_nLinear, * const o_end = m_classOffsets + m_nClass; o != o_end; ++o) - { - const uint16 * lookup = m_classData + *o; - if (*o > max_off - 4 // LookupClass doesn't stretch over max_off - || lookup[0] == 0 // A LookupClass with no looks is a suspicious thing ... - || lookup[0] > (max_off - *o - 4)/2 // numIDs lookup pairs fits within (start of LookupClass' lookups array, max_off] - || lookup[3] != lookup[0] - lookup[1]) // rangeShift: numIDs - searchRange - return ERROROFFSET; - } - - return max_off; -} - -uint16 Silf::findPseudo(uint32 uid) const -{ - for (int i = 0; i < m_numPseudo; i++) - if (m_pseudos[i].uid == uid) return m_pseudos[i].gid; - return 0; -} - -uint16 Silf::findClassIndex(uint16 cid, uint16 gid) const -{ - if (cid > m_nClass) return -1; - - const uint16 * cls = m_classData + m_classOffsets[cid]; - if (cid < m_nLinear) // output class being used for input, shouldn't happen - { - for (unsigned int i = 0, n = m_classOffsets[cid + 1]; i < n; ++i, ++cls) - if (*cls == gid) return i; - return -1; - } - else - { - const uint16 * min = cls + 4, // lookups array - * max = min + cls[0]*2; // lookups aray is numIDs (cls[0]) uint16 pairs long - do - { - const uint16 * p = min + (-2 & ((max-min)/2)); - if (p[0] > gid) max = p; - else min = p; - } - while (max - min > 2); - return min[0] == gid ? min[1] : -1; - } -} - -uint16 Silf::getClassGlyph(uint16 cid, unsigned int index) const -{ - if (cid > m_nClass) return 0; - - uint32 loc = m_classOffsets[cid]; - if (cid < m_nLinear) - { - if (index < m_classOffsets[cid + 1] - loc) - return m_classData[index + loc]; - } - else // input class being used for output. Shouldn't happen - { - for (unsigned int i = loc + 4; i < m_classOffsets[cid + 1]; i += 2) - if (m_classData[i + 1] == index) return m_classData[i]; - } - return 0; -} - - -bool Silf::runGraphite(Segment *seg, uint8 firstPass, uint8 lastPass) const -{ - assert(seg != 0); - SlotMap map(*seg); - FiniteStateMachine fsm(map, seg->getFace()->logger()); - vm::Machine m(map); - unsigned int initSize = seg->slotCount(); -#if !defined GRAPHITE2_NTRACING - json * const dbgout = seg->getFace()->logger(); -#endif - - if (lastPass == 0) - { - if (firstPass == lastPass) - return true; - lastPass = m_numPasses; - } - - for (size_t i = firstPass; i < lastPass; ++i) - { - // bidi and mirroring - if (i == m_bPass) - { -#if !defined GRAPHITE2_NTRACING - if (dbgout) - { - *dbgout << json::item << json::object - << "id" << -1 - << "slots" << json::array; - seg->positionSlots(0); - for(Slot * s = seg->first(); s; s = s->next()) - *dbgout << dslot(seg, s); - *dbgout << json::close - << "rules" << json::array << json::close - << json::close; - } -#endif - - if (!(seg->dir() & 2)) - seg->bidiPass(m_aBidi, seg->dir() & 1, m_aMirror); - else if (m_aMirror) - { - Slot * s; - for (s = seg->first(); s; s = s->next()) - { - unsigned short g = seg->glyphAttr(s->gid(), m_aMirror); - if (g && (!(seg->dir() & 4) || !seg->glyphAttr(s->gid(), m_aMirror + 1))) - s->setGlyph(seg, g); - } - } - } - -#if !defined GRAPHITE2_NTRACING - if (dbgout) - { - *dbgout << json::item << json::object - << "id" << i+1 - << "slots" << json::array; - seg->positionSlots(0); - for(Slot * s = seg->first(); s; s = s->next()) - *dbgout << dslot(seg, s); - *dbgout << json::close; - } -#endif - - // test whether to reorder, prepare for positioning - m_passes[i].runGraphite(m, fsm); - // only subsitution passes can change segment length, cached subsegments are short for their text - if (m.status() != vm::Machine::finished - || (i < m_pPass && (seg->slotCount() > initSize * MAX_SEG_GROWTH_FACTOR - || (seg->slotCount() && seg->slotCount() * MAX_SEG_GROWTH_FACTOR < initSize)))) - return false; - } - return true; -} diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/Slot.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/Slot.cpp deleted file mode 100644 index f78fee73264..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/Slot.cpp +++ /dev/null @@ -1,388 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include "inc/Segment.h" -#include "inc/Slot.h" -#include "inc/Silf.h" -#include "inc/CharInfo.h" -#include "inc/Rule.h" - - -using namespace graphite2; - -Slot::Slot() : - m_next(NULL), m_prev(NULL), - m_glyphid(0), m_realglyphid(0), m_original(0), m_before(0), m_after(0), - m_index(0), m_parent(NULL), m_child(NULL), m_sibling(NULL), - m_position(0, 0), m_shift(0, 0), m_advance(-1, -1), - m_attach(0, 0), m_with(0, 0), m_just(0.), - m_flags(0), m_attLevel(0), m_bidiCls(0), m_bidiLevel(0), m_justs(NULL) - // Do not set m_userAttr since it is set *before* new is called since this - // is used as a positional new to reset the GrSlot -{ -} - -// take care, this does not copy any of the GrSlot pointer fields -void Slot::set(const Slot & orig, int charOffset, size_t numUserAttr, size_t justLevels) -{ - // leave m_next and m_prev unchanged - m_glyphid = orig.m_glyphid; - m_realglyphid = orig.m_realglyphid; - m_original = orig.m_original + charOffset; - m_before = orig.m_before + charOffset; - m_after = orig.m_after + charOffset; - m_parent = NULL; - m_child = NULL; - m_sibling = NULL; - m_position = orig.m_position; - m_shift = orig.m_shift; - m_advance = orig.m_advance; - m_attach = orig.m_attach; - m_with = orig.m_with; - m_flags = orig.m_flags; - m_attLevel = orig.m_attLevel; - m_bidiCls = orig.m_bidiCls; - m_bidiLevel = orig.m_bidiLevel; - if (m_userAttr && orig.m_userAttr) - { - memcpy(m_userAttr, orig.m_userAttr, numUserAttr * sizeof(*m_userAttr)); - } - if (m_justs && orig.m_justs) - { - memcpy(m_justs, orig.m_justs, SlotJustify::size_of(justLevels)); - } -} - -void Slot::update(int /*numGrSlots*/, int numCharInfo, Position &relpos) -{ - m_before += numCharInfo; - m_after += numCharInfo; - m_position = m_position + relpos; -} - -Position Slot::finalise(const Segment *seg, const Font *font, Position & base, Rect & bbox, uint8 attrLevel, float & clusterMin) -{ - if (attrLevel && m_attLevel > attrLevel) return Position(0, 0); - float scale = 1.0; - Position shift = m_shift + Position(m_just, 0); - float tAdvance = m_advance.x + m_just; - const GlyphFace * glyphFace = seg->getFace()->glyphs().glyphSafe(glyph()); - if (font) - { - scale = font->scale(); - shift *= scale; - if (font->isHinted() && glyphFace) - tAdvance = (m_advance.x - glyphFace->theAdvance().x + m_just) * scale + font->advance(m_glyphid); - else - tAdvance *= scale; - } - Position res; - - m_position = base + shift; - if (!m_parent) - { - res = base + Position(tAdvance, m_advance.y * scale); - clusterMin = base.x; - } - else - { - float tAdv; - m_position += (m_attach - m_with) * scale; - tAdv = m_advance.x >= 0.5 ? m_position.x + tAdvance - shift.x : 0.f; - res = Position(tAdv, 0); - if ((m_advance.x >= 0.5 || m_position.x < 0) && m_position.x < clusterMin) clusterMin = m_position.x; - } - - if (glyphFace) - { - Rect ourBbox = glyphFace->theBBox() * scale + m_position; - bbox = bbox.widen(ourBbox); - } - - if (m_child && m_child != this && m_child->attachedTo() == this) - { - Position tRes = m_child->finalise(seg, font, m_position, bbox, attrLevel, clusterMin); - if ((!m_parent || m_advance.x >= 0.5) && tRes.x > res.x) res = tRes; - } - - if (m_parent && m_sibling && m_sibling != this && m_sibling->attachedTo() == m_parent) - { - Position tRes = m_sibling->finalise(seg, font, base, bbox, attrLevel, clusterMin); - if (tRes.x > res.x) res = tRes; - } - - if (!m_parent && clusterMin < base.x) - { - Position adj = Position(base.x - clusterMin, 0.); - res += adj; - m_position += adj; - if (m_child) m_child->floodShift(adj); - } - return res; -} - -uint32 Slot::clusterMetric(const Segment *seg, uint8 metric, uint8 attrLevel) -{ - Position base; - Rect bbox = seg->theGlyphBBoxTemporary(gid()); - float clusterMin = 0.; - Position res = finalise(seg, NULL, base, bbox, attrLevel, clusterMin); - - switch (metrics(metric)) - { - case kgmetLsb : - return static_cast(bbox.bl.x); - case kgmetRsb : - return static_cast(res.x - bbox.tr.x); - case kgmetBbTop : - return static_cast(bbox.tr.y); - case kgmetBbBottom : - return static_cast(bbox.bl.y); - case kgmetBbLeft : - return static_cast(bbox.bl.x); - case kgmetBbRight : - return static_cast(bbox.tr.x); - case kgmetBbWidth : - return static_cast(bbox.tr.x - bbox.bl.x); - case kgmetBbHeight : - return static_cast(bbox.tr.y - bbox.bl.y); - case kgmetAdvWidth : - return static_cast(res.x); - case kgmetAdvHeight : - return static_cast(res.y); - default : - return 0; - } -} - -int Slot::getAttr(const Segment *seg, attrCode ind, uint8 subindex) const -{ - if (!this) return 0; - if (ind == gr_slatUserDefnV1) - { - ind = gr_slatUserDefn; - subindex = 0; - } - else if (ind >= gr_slatJStretch && ind < gr_slatJStretch + 20 && ind != gr_slatJWidth) - { - int indx = ind - gr_slatJStretch; - return getJustify(seg, indx / 5, indx % 5); - } - - switch (ind) - { - case gr_slatAdvX : return int(m_advance.x); - case gr_slatAdvY : return int(m_advance.y); - case gr_slatAttTo : return m_parent ? 1 : 0; - case gr_slatAttX : return int(m_attach.x); - case gr_slatAttY : return int(m_attach.y); - case gr_slatAttXOff : - case gr_slatAttYOff : return 0; - case gr_slatAttWithX : return int(m_with.x); - case gr_slatAttWithY : return int(m_with.y); - case gr_slatAttWithXOff: - case gr_slatAttWithYOff:return 0; - case gr_slatAttLevel : return m_attLevel; - case gr_slatBreak : return seg->charinfo(m_original)->breakWeight(); - case gr_slatCompRef : return 0; - case gr_slatDir : return seg->dir(); - case gr_slatInsert : return isInsertBefore(); - case gr_slatPosX : return int(m_position.x); // but need to calculate it - case gr_slatPosY : return int(m_position.y); - case gr_slatShiftX : return int(m_shift.x); - case gr_slatShiftY : return int(m_shift.y); - case gr_slatMeasureSol: return -1; // err what's this? - case gr_slatMeasureEol: return -1; - case gr_slatJWidth: return m_just; - case gr_slatUserDefn : return m_userAttr[subindex]; - case gr_slatSegSplit : return seg->charinfo(m_original)->flags() & 3; - default : return 0; - } -} - -void Slot::setAttr(Segment *seg, attrCode ind, uint8 subindex, int16 value, const SlotMap & map) -{ - if (!this) return; - if (ind == gr_slatUserDefnV1) - { - ind = gr_slatUserDefn; - subindex = 0; - } - else if (ind >= gr_slatJStretch && ind < gr_slatJStretch + 20 && ind != gr_slatJWidth) - { - int indx = ind - gr_slatJStretch; - return setJustify(seg, indx / 5, indx % 5, value); - } - - switch (ind) - { - case gr_slatAdvX : m_advance.x = value; break; - case gr_slatAdvY : m_advance.y = value; break; - case gr_slatAttTo : - { - const uint16 idx = uint16(value); - if (idx < map.size() && map[idx]) - { - Slot *other = map[idx]; - if (other != this && other->child(this)) - { - attachTo(other); - if (((seg->dir() & 1) != 0) ^ (idx > subindex)) - m_with = Position(advance(), 0); - else // normal match to previous root - m_attach = Position(other->advance(), 0); - } - } - break; - } - case gr_slatAttX : m_attach.x = value; break; - case gr_slatAttY : m_attach.y = value; break; - case gr_slatAttXOff : - case gr_slatAttYOff : break; - case gr_slatAttWithX : m_with.x = value; break; - case gr_slatAttWithY : m_with.y = value; break; - case gr_slatAttWithXOff : - case gr_slatAttWithYOff : break; - case gr_slatAttLevel : - m_attLevel = byte(value); - break; - case gr_slatBreak : - seg->charinfo(m_original)->breakWeight(value); - break; - case gr_slatCompRef : break; // not sure what to do here - case gr_slatDir : break; // read only - case gr_slatInsert : - markInsertBefore(value? true : false); - break; - case gr_slatPosX : break; // can't set these here - case gr_slatPosY : break; - case gr_slatShiftX : m_shift.x = value; break; - case gr_slatShiftY : m_shift.y = value; break; - case gr_slatMeasureSol : break; - case gr_slatMeasureEol : break; - case gr_slatJWidth : just(value); break; - case gr_slatSegSplit : seg->charinfo(m_original)->addflags(value & 3); break; - case gr_slatUserDefn : m_userAttr[subindex] = value; break; - default : - break; - } -} - -int Slot::getJustify(const Segment *seg, uint8 level, uint8 subindex) const -{ - if (level && level >= seg->silf()->numJustLevels()) return 0; - - if (m_justs) - return m_justs->values[level * SlotJustify::NUMJUSTPARAMS + subindex]; - - if (level >= seg->silf()->numJustLevels()) return 0; - Justinfo *jAttrs = seg->silf()->justAttrs() + level; - - switch (subindex) { - case 0 : return seg->glyphAttr(gid(), jAttrs->attrStretch()); - case 1 : return seg->glyphAttr(gid(), jAttrs->attrShrink()); - case 2 : return seg->glyphAttr(gid(), jAttrs->attrStep()); - case 3 : return seg->glyphAttr(gid(), jAttrs->attrWeight()); - case 4 : return 0; // not been set yet, so clearly 0 - default: return 0; - } -} - -void Slot::setJustify(Segment *seg, uint8 level, uint8 subindex, int16 value) -{ - if (level >= seg->silf()->numJustLevels()) return; - if (!m_justs) - { - SlotJustify *j = seg->newJustify(); - j->LoadSlot(this, seg); - m_justs = j; - } - m_justs->values[level * SlotJustify::NUMJUSTPARAMS + subindex] = value; -} - -bool Slot::child(Slot *ap) -{ - if (this == ap) return false; - else if (ap == m_child) return true; - else if (!m_child) - m_child = ap; - else - return m_child->sibling(ap); - return true; -} - -bool Slot::sibling(Slot *ap) -{ - if (this == ap) return false; - else if (ap == m_sibling) return true; - else if (!m_sibling || !ap) - m_sibling = ap; - else - return m_sibling->sibling(ap); - return true; -} - -void Slot::setGlyph(Segment *seg, uint16 glyphid, const GlyphFace * theGlyph) -{ - m_glyphid = glyphid; - if (!theGlyph) - { - theGlyph = seg->getFace()->glyphs().glyphSafe(glyphid); - if (!theGlyph) - { - m_realglyphid = 0; - m_advance = Position(0.,0.); - return; - } - } - m_realglyphid = theGlyph->attrs()[seg->silf()->aPseudo()]; - if (m_realglyphid) - { - const GlyphFace *aGlyph = seg->getFace()->glyphs().glyphSafe(m_realglyphid); - if (aGlyph) theGlyph = aGlyph; - } - m_advance = Position(theGlyph->theAdvance().x, 0.); -} - -void Slot::floodShift(Position adj) -{ - m_position += adj; - if (m_child) m_child->floodShift(adj); - if (m_sibling) m_sibling->floodShift(adj); -} - -void SlotJustify::LoadSlot(const Slot *s, const Segment *seg) -{ - for (int i = seg->silf()->numJustLevels() - 1; i >= 0; --i) - { - Justinfo *justs = seg->silf()->justAttrs() + i; - int16 *v = values + i * NUMJUSTPARAMS; - v[0] = seg->glyphAttr(s->gid(), justs->attrStretch()); - v[1] = seg->glyphAttr(s->gid(), justs->attrShrink()); - v[2] = seg->glyphAttr(s->gid(), justs->attrStep()); - v[3] = seg->glyphAttr(s->gid(), justs->attrWeight()); - } -} diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/Sparse.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/Sparse.cpp deleted file mode 100644 index 64675a2939d..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/Sparse.cpp +++ /dev/null @@ -1,59 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include -#include "inc/Sparse.h" -#include "inc/bits.h" - -using namespace graphite2; - - -sparse::~sparse() throw() -{ - free(m_array.values); -} - - -sparse::mapped_type sparse::operator [] (const key_type k) const throw() -{ - const chunk & c = m_array.map[k/SIZEOF_CHUNK]; - const mask_t m = c.mask >> (SIZEOF_CHUNK - 1 - (k%SIZEOF_CHUNK)); - const mapped_type g = m & 1; - - return g*m_array.values[g*(c.offset + bit_set_count(m >> 1))]; -} - - -size_t sparse::size() const throw() -{ - size_t n = m_nchunks, - s = 0; - - for (const chunk *ci=m_array.map; n; --n, ++ci) - s += bit_set_count(ci->mask); - - return s; -} diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/TtfUtil.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/TtfUtil.cpp deleted file mode 100644 index dbd1d5bb274..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/TtfUtil.cpp +++ /dev/null @@ -1,1982 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -/*--------------------------------------------------------------------*//*:Ignore this sentence. - -File: TtfUtil.cpp -Responsibility: Alan Ward -Last reviewed: Not yet. - -Description - Implements the methods for TtfUtil class. This file should remain portable to any C++ - environment by only using standard C++ and the TTF structurs defined in Tt.h. --------------------------------------------------------------------------------*//*:End Ignore*/ - - -/*********************************************************************************************** - Include files -***********************************************************************************************/ -// Language headers -//#include -#include -#include -#include -#include -#include -//#include -// Platform headers -// Module headers -#include "inc/TtfUtil.h" -#include "inc/TtfTypes.h" -#include "inc/Endian.h" - -/*********************************************************************************************** - Forward declarations -***********************************************************************************************/ - -/*********************************************************************************************** - Local Constants and static variables -***********************************************************************************************/ -namespace -{ - // max number of components allowed in composite glyphs - const int kMaxGlyphComponents = 8; - - template - inline float fixed_to_float(const T f) { - return float(f)/float(2^R); - } - -/*---------------------------------------------------------------------------------------------- - Table of standard Postscript glyph names. From Martin Hosken. Disagress with ttfdump.exe ----------------------------------------------------------------------------------------------*/ -#ifdef ALL_TTFUTILS - const int kcPostNames = 258; - - const char * rgPostName[kcPostNames] = { - ".notdef", ".null", "nonmarkingreturn", "space", "exclam", "quotedbl", "numbersign", - "dollar", "percent", "ampersand", "quotesingle", "parenleft", - "parenright", "asterisk", "plus", "comma", "hyphen", "period", "slash", - "zero", "one", "two", "three", "four", "five", "six", "seven", "eight", - "nine", "colon", "semicolon", "less", "equal", "greater", "question", - "at", "A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M", - "N", "O", "P", "Q", "R", "S", "T", "U", "V", "W", "X", "Y", "Z", - "bracketleft", "backslash", "bracketright", "asciicircum", - "underscore", "grave", "a", "b", "c", "d", "e", "f", "g", "h", "i", - "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", - "x", "y", "z", "braceleft", "bar", "braceright", "asciitilde", - "Adieresis", "Aring", "Ccedilla", "Eacute", "Ntilde", "Odieresis", - "Udieresis", "aacute", "agrave", "acircumflex", "adieresis", "atilde", - "aring", "ccedilla", "eacute", "egrave", "ecircumflex", "edieresis", - "iacute", "igrave", "icircumflex", "idieresis", "ntilde", "oacute", - "ograve", "ocircumflex", "odieresis", "otilde", "uacute", "ugrave", - "ucircumflex", "udieresis", "dagger", "degree", "cent", "sterling", - "section", "bullet", "paragraph", "germandbls", "registered", - "copyright", "trademark", "acute", "dieresis", "notequal", "AE", - "Oslash", "infinity", "plusminus", "lessequal", "greaterequal", "yen", - "mu", "partialdiff", "summation", "product", "pi", "integral", - "ordfeminine", "ordmasculine", "Omega", "ae", "oslash", "questiondown", - "exclamdown", "logicalnot", "radical", "florin", "approxequal", - "Delta", "guillemotleft", "guillemotright", "ellipsis", "nonbreakingspace", - "Agrave", "Atilde", "Otilde", "OE", "oe", "endash", "emdash", - "quotedblleft", "quotedblright", "quoteleft", "quoteright", "divide", - "lozenge", "ydieresis", "Ydieresis", "fraction", "currency", - "guilsinglleft", "guilsinglright", "fi", "fl", "daggerdbl", "periodcentered", - "quotesinglbase", "quotedblbase", "perthousand", "Acircumflex", - "Ecircumflex", "Aacute", "Edieresis", "Egrave", "Iacute", - "Icircumflex", "Idieresis", "Igrave", "Oacute", "Ocircumflex", - "apple", "Ograve", "Uacute", "Ucircumflex", "Ugrave", "dotlessi", - "circumflex", "tilde", "macron", "breve", "dotaccent", "ring", - "cedilla", "hungarumlaut", "ogonek", "caron", "Lslash", "lslash", - "Scaron", "scaron", "Zcaron", "zcaron", "brokenbar", "Eth", "eth", - "Yacute", "yacute", "Thorn", "thorn", "minus", "multiply", - "onesuperior", "twosuperior", "threesuperior", "onehalf", "onequarter", - "threequarters", "franc", "Gbreve", "gbreve", "Idotaccent", "Scedilla", - "scedilla", "Cacute", "cacute", "Ccaron", "ccaron", - "dcroat" }; -#endif - -} // end of namespace - -/*********************************************************************************************** - Methods -***********************************************************************************************/ - -/* Note on error processing: The code guards against bad glyph ids being used to look up data -in open ended tables (loca, hmtx). If the glyph id comes from a cmap this shouldn't happen -but it seems prudent to check for user errors here. The code does assume that data obtained -from the TTF file is valid otherwise (though the CheckTable method seeks to check for -obvious problems that might accompany a change in table versions). For example an invalid -offset in the loca table which could exceed the size of the glyf table is NOT trapped. -Likewise if numberOf_LongHorMetrics in the hhea table is wrong, this will NOT be trapped, -which could cause a lookup in the hmtx table to exceed the table length. Of course, TTF tables -that are completely corrupt will cause unpredictable results. */ - -/* Note on composite glyphs: Glyphs that have components that are themselves composites -are not supported. IsDeepComposite can be used to test for this. False is returned from many -of the methods in this cases. It is unclear how to build composite glyphs in some cases, -so this code represents my best guess until test cases can be found. See notes on the high- -level GlyfPoints method. */ -namespace graphite2 -{ -namespace TtfUtil -{ - - -/*---------------------------------------------------------------------------------------------- - Get offset and size of the offset table needed to find table directory. - Return true if success, false otherwise. - lSize excludes any table directory entries. -----------------------------------------------------------------------------------------------*/ -bool GetHeaderInfo(size_t & lOffset, size_t & lSize) -{ - lOffset = 0; - lSize = offsetof(Sfnt::OffsetSubTable, table_directory); - assert(sizeof(uint32) + 4*sizeof (uint16) == lSize); - return true; -} - -/*---------------------------------------------------------------------------------------------- - Check the offset table for expected data. - Return true if success, false otherwise. -----------------------------------------------------------------------------------------------*/ -bool CheckHeader(const void * pHdr) -{ - const Sfnt::OffsetSubTable * pOffsetTable - = reinterpret_cast(pHdr); - - return pHdr && be::swap(pOffsetTable->scaler_type) == Sfnt::OffsetSubTable::TrueTypeWin; -} - -/*---------------------------------------------------------------------------------------------- - Get offset and size of the table directory. - Return true if successful, false otherwise. -----------------------------------------------------------------------------------------------*/ -bool GetTableDirInfo(const void * pHdr, size_t & lOffset, size_t & lSize) -{ - const Sfnt::OffsetSubTable * pOffsetTable - = reinterpret_cast(pHdr); - - lOffset = offsetof(Sfnt::OffsetSubTable, table_directory); - lSize = be::swap(pOffsetTable->num_tables) - * sizeof(Sfnt::OffsetSubTable::Entry); - - return true; -} - - -/*---------------------------------------------------------------------------------------------- - Get offset and size of the specified table. - Return true if successful, false otherwise. On false, offset and size will be 0. -----------------------------------------------------------------------------------------------*/ -bool GetTableInfo(const Tag TableTag, const void * pHdr, const void * pTableDir, - size_t & lOffset, size_t & lSize) -{ - const Sfnt::OffsetSubTable * pOffsetTable - = reinterpret_cast(pHdr); - const size_t num_tables = be::swap(pOffsetTable->num_tables); - const Sfnt::OffsetSubTable::Entry - * entry_itr = reinterpret_cast( - pTableDir), - * const dir_end = entry_itr + num_tables; - - if (num_tables > 40) - return false; - - for (;entry_itr != dir_end; ++entry_itr) // 40 - safe guard - { - if (be::swap(entry_itr->tag) == TableTag) - { - lOffset = be::swap(entry_itr->offset); - lSize = be::swap(entry_itr->length); - return true; - } - } - - return false; -} - -/*---------------------------------------------------------------------------------------------- - Check the specified table. Tests depend on the table type. - Return true if successful, false otherwise. -----------------------------------------------------------------------------------------------*/ -bool CheckTable(const Tag TableId, const void * pTable, size_t lTableSize) -{ - using namespace Sfnt; - - if (pTable == 0) return false; - - switch(TableId) - { - case Tag::cmap: // cmap - { - const Sfnt::CharacterCodeMap * const pCmap - = reinterpret_cast(pTable); - return be::swap(pCmap->version) == 0; - } - - case Tag::head: // head - { - const Sfnt::FontHeader * const pHead - = reinterpret_cast(pTable); - bool r = be::swap(pHead->version) == OneFix - && be::swap(pHead->magic_number) == FontHeader::MagicNumber - && be::swap(pHead->glyph_data_format) - == FontHeader::GlypDataFormat - && (be::swap(pHead->index_to_loc_format) - == FontHeader::ShortIndexLocFormat - || be::swap(pHead->index_to_loc_format) - == FontHeader::LongIndexLocFormat) - && sizeof(FontHeader) <= lTableSize; - return r; - } - - case Tag::post: // post - { - const Sfnt::PostScriptGlyphName * const pPost - = reinterpret_cast(pTable); - const fixed format = be::swap(pPost->format); - bool r = format == PostScriptGlyphName::Format1 - || format == PostScriptGlyphName::Format2 - || format == PostScriptGlyphName::Format3 - || format == PostScriptGlyphName::Format25; - return r; - } - - case Tag::hhea: // hhea - { - const Sfnt::HorizontalHeader * pHhea = - reinterpret_cast(pTable); - bool r = be::swap(pHhea->version) == OneFix - && be::swap(pHhea->metric_data_format) == 0 - && sizeof (Sfnt::HorizontalHeader) <= lTableSize; - return r; - } - - case Tag::maxp: // maxp - { - const Sfnt::MaximumProfile * pMaxp = - reinterpret_cast(pTable); - bool r = be::swap(pMaxp->version) == OneFix - && sizeof(Sfnt::MaximumProfile) <= lTableSize; - return r; - } - - case Tag::OS_2: // OS/2 - { - const Sfnt::Compatibility * pOs2 - = reinterpret_cast(pTable); - if (be::swap(pOs2->version) == 0) - { // OS/2 table version 1 size -// if (sizeof(Sfnt::Compatibility) -// - sizeof(uint32)*2 - sizeof(int16)*2 -// - sizeof(uint16)*3 <= lTableSize) - if (sizeof(Sfnt::Compatibility0) <= lTableSize) - return true; - } - else if (be::swap(pOs2->version) == 1) - { // OS/2 table version 2 size -// if (sizeof(Sfnt::Compatibility) -// - sizeof(int16) *2 -// - sizeof(uint16)*3 <= lTableSize) - if (sizeof(Sfnt::Compatibility1) <= lTableSize) - return true; - } - else if (be::swap(pOs2->version) == 2) - { // OS/2 table version 3 size - if (sizeof(Sfnt::Compatibility2) <= lTableSize) - return true; - } - else if (be::swap(pOs2->version) == 3 || be::swap(pOs2->version) == 4) - { // OS/2 table version 4 size - version 4 changed the meaning of some fields which we don't use - if (sizeof(Sfnt::Compatibility3) <= lTableSize) - return true; - } - else - return false; - break; - } - - case Tag::name: - { - const Sfnt::FontNames * pName - = reinterpret_cast(pTable); - return be::swap(pName->format) == 0; - } - - default: - break; - } - - return true; -} - -/*---------------------------------------------------------------------------------------------- - Return the number of glyphs in the font. Should never be less than zero. - - Note: this method is not currently used by the Graphite engine. -----------------------------------------------------------------------------------------------*/ -size_t GlyphCount(const void * pMaxp) -{ - const Sfnt::MaximumProfile * pTable = - reinterpret_cast(pMaxp); - return be::swap(pTable->num_glyphs); -} - -#ifdef ALL_TTFUTILS -/*---------------------------------------------------------------------------------------------- - Return the maximum number of components for any composite glyph in the font. - - Note: this method is not currently used by the Graphite engine. -----------------------------------------------------------------------------------------------*/ -size_t MaxCompositeComponentCount(const void * pMaxp) -{ - const Sfnt::MaximumProfile * pTable = - reinterpret_cast(pMaxp); - return be::swap(pTable->max_component_elements); -} - -/*---------------------------------------------------------------------------------------------- - Composite glyphs can be composed of glyphs that are themselves composites. - This method returns the maximum number of levels like this for any glyph in the font. - A non-composite glyph has a level of 1. - - Note: this method is not currently used by the Graphite engine. -----------------------------------------------------------------------------------------------*/ -size_t MaxCompositeLevelCount(const void * pMaxp) -{ - const Sfnt::MaximumProfile * pTable = - reinterpret_cast(pMaxp); - return be::swap(pTable->max_component_depth); -} - -/*---------------------------------------------------------------------------------------------- - Return the number of glyphs in the font according to a differt source. - Should never be less than zero. Return -1 on failure. - - Note: this method is not currently used by the Graphite engine. -----------------------------------------------------------------------------------------------*/ -size_t LocaGlyphCount(size_t lLocaSize, const void * pHead) //throw(std::domain_error) -{ - - const Sfnt::FontHeader * pTable - = reinterpret_cast(pHead); - - if (be::swap(pTable->index_to_loc_format) - == Sfnt::FontHeader::ShortIndexLocFormat) - // loca entries are two bytes and have been divided by two - return (lLocaSize >> 1) - 1; - - if (be::swap(pTable->index_to_loc_format) - == Sfnt::FontHeader::LongIndexLocFormat) - // loca entries are four bytes - return (lLocaSize >> 2) - 1; - - return -1; - //throw std::domain_error("head table in inconsistent state. The font may be corrupted"); -} -#endif - -/*---------------------------------------------------------------------------------------------- - Return the design units the font is designed with -----------------------------------------------------------------------------------------------*/ -int DesignUnits(const void * pHead) -{ - const Sfnt::FontHeader * pTable = - reinterpret_cast(pHead); - - return be::swap(pTable->units_per_em); -} - -#ifdef ALL_TTFUTILS -/*---------------------------------------------------------------------------------------------- - Return the checksum from the head table, which serves as a unique identifer for the font. -----------------------------------------------------------------------------------------------*/ -int HeadTableCheckSum(const void * pHead) -{ - const Sfnt::FontHeader * pTable = - reinterpret_cast(pHead); - - return be::swap(pTable->check_sum_adjustment); -} - -/*---------------------------------------------------------------------------------------------- - Return the create time from the head table. This consists of a 64-bit integer, which - we return here as two 32-bit integers. - - Note: this method is not currently used by the Graphite engine. -----------------------------------------------------------------------------------------------*/ -void HeadTableCreateTime(const void * pHead, - unsigned int * pnDateBC, unsigned int * pnDateAD) -{ - const Sfnt::FontHeader * pTable = - reinterpret_cast(pHead); - - *pnDateBC = be::swap(pTable->created[0]); - *pnDateAD = be::swap(pTable->created[1]); -} - -/*---------------------------------------------------------------------------------------------- - Return the modify time from the head table.This consists of a 64-bit integer, which - we return here as two 32-bit integers. - - Note: this method is not currently used by the Graphite engine. -----------------------------------------------------------------------------------------------*/ -void HeadTableModifyTime(const void * pHead, - unsigned int * pnDateBC, unsigned int *pnDateAD) -{ - const Sfnt::FontHeader * pTable = - reinterpret_cast(pHead); - - *pnDateBC = be::swap(pTable->modified[0]); - *pnDateAD = be::swap(pTable->modified[1]); -} - -/*---------------------------------------------------------------------------------------------- - Return true if the font is italic. -----------------------------------------------------------------------------------------------*/ -bool IsItalic(const void * pHead) -{ - const Sfnt::FontHeader * pTable = - reinterpret_cast(pHead); - - return ((be::swap(pTable->mac_style) & 0x00000002) != 0); -} - -/*---------------------------------------------------------------------------------------------- - Return the ascent for the font -----------------------------------------------------------------------------------------------*/ -int FontAscent(const void * pOs2) -{ - const Sfnt::Compatibility * pTable = reinterpret_cast(pOs2); - - return be::swap(pTable->win_ascent); -} - -/*---------------------------------------------------------------------------------------------- - Return the descent for the font -----------------------------------------------------------------------------------------------*/ -int FontDescent(const void * pOs2) -{ - const Sfnt::Compatibility * pTable = reinterpret_cast(pOs2); - - return be::swap(pTable->win_descent); -} - -/*---------------------------------------------------------------------------------------------- - Get the bold and italic style bits. - Return true if successful. false otherwise. - In addition to checking the OS/2 table, one could also check - the head table's macStyle field (overridden by the OS/2 table on Win) - the sub-family name in the name table (though this can contain oblique, dark, etc too) -----------------------------------------------------------------------------------------------*/ -bool FontOs2Style(const void *pOs2, bool & fBold, bool & fItalic) -{ - const Sfnt::Compatibility * pTable = reinterpret_cast(pOs2); - - fBold = (be::swap(pTable->fs_selection) & Sfnt::Compatibility::Bold) != 0; - fItalic = (be::swap(pTable->fs_selection) & Sfnt::Compatibility::Italic) != 0; - - return true; -} -#endif - -/*---------------------------------------------------------------------------------------------- - Method for searching name table. -----------------------------------------------------------------------------------------------*/ -bool GetNameInfo(const void * pName, int nPlatformId, int nEncodingId, - int nLangId, int nNameId, size_t & lOffset, size_t & lSize) -{ - lOffset = 0; - lSize = 0; - - const Sfnt::FontNames * pTable = reinterpret_cast(pName); - uint16 cRecord = be::swap(pTable->count); - uint16 nRecordOffset = be::swap(pTable->string_offset); - const Sfnt::NameRecord * pRecord = reinterpret_cast(pTable + 1); - - for (int i = 0; i < cRecord; ++i) - { - if (be::swap(pRecord->platform_id) == nPlatformId && - be::swap(pRecord->platform_specific_id) == nEncodingId && - be::swap(pRecord->language_id) == nLangId && - be::swap(pRecord->name_id) == nNameId) - { - lOffset = be::swap(pRecord->offset) + nRecordOffset; - lSize = be::swap(pRecord->length); - return true; - } - pRecord++; - } - - return false; -} - -#ifdef ALL_TTFUTILS -/*---------------------------------------------------------------------------------------------- - Return all the lang-IDs that have data for the given name-IDs. Assume that there is room - in the return array (langIdList) for 128 items. The purpose of this method is to return - a list of all possible lang-IDs. -----------------------------------------------------------------------------------------------*/ -int GetLangsForNames(const void * pName, int nPlatformId, int nEncodingId, - int * nameIdList, int cNameIds, short * langIdList) -{ - const Sfnt::FontNames * pTable = reinterpret_cast(pName); - int cLangIds = 0; - uint16 cRecord = be::swap(pTable->count); - if (cRecord > 127) return cLangIds; - //uint16 nRecordOffset = swapw(pTable->stringOffset); - const Sfnt::NameRecord * pRecord = reinterpret_cast(pTable + 1); - - for (int i = 0; i < cRecord; ++i) - { - if (be::swap(pRecord->platform_id) == nPlatformId && - be::swap(pRecord->platform_specific_id) == nEncodingId) - { - bool fNameFound = false; - int nLangId = be::swap(pRecord->language_id); - int nNameId = be::swap(pRecord->name_id); - for (int j = 0; j < cNameIds; j++) - { - if (nNameId == nameIdList[j]) - { - fNameFound = true; - break; - } - } - if (fNameFound) - { - // Add it if it's not there. - int ilang; - for (ilang = 0; ilang < cLangIds; ilang++) - if (langIdList[ilang] == nLangId) - break; - if (ilang >= cLangIds) - { - langIdList[cLangIds] = short(nLangId); - cLangIds++; - } - if (cLangIds == 128) - return cLangIds; - } - } - pRecord++; - } - - return cLangIds; -} - -/*---------------------------------------------------------------------------------------------- - Get the offset and size of the font family name in English for the MS Platform with Unicode - writing system. The offset is within the pName data. The string is double byte with MSB - first. -----------------------------------------------------------------------------------------------*/ -bool Get31EngFamilyInfo(const void * pName, size_t & lOffset, size_t & lSize) -{ - return GetNameInfo(pName, Sfnt::NameRecord::Microsoft, 1, 1033, - Sfnt::NameRecord::Family, lOffset, lSize); -} - -/*---------------------------------------------------------------------------------------------- - Get the offset and size of the full font name in English for the MS Platform with Unicode - writing system. The offset is within the pName data. The string is double byte with MSB - first. - - Note: this method is not currently used by the Graphite engine. -----------------------------------------------------------------------------------------------*/ -bool Get31EngFullFontInfo(const void * pName, size_t & lOffset, size_t & lSize) -{ - return GetNameInfo(pName, Sfnt::NameRecord::Microsoft, 1, 1033, - Sfnt::NameRecord::Fullname, lOffset, lSize); -} - -/*---------------------------------------------------------------------------------------------- - Get the offset and size of the font family name in English for the MS Platform with Symbol - writing system. The offset is within the pName data. The string is double byte with MSB - first. -----------------------------------------------------------------------------------------------*/ -bool Get30EngFamilyInfo(const void * pName, size_t & lOffset, size_t & lSize) -{ - return GetNameInfo(pName, Sfnt::NameRecord::Microsoft, 0, 1033, - Sfnt::NameRecord::Family, lOffset, lSize); -} - -/*---------------------------------------------------------------------------------------------- - Get the offset and size of the full font name in English for the MS Platform with Symbol - writing system. The offset is within the pName data. The string is double byte with MSB - first. - - Note: this method is not currently used by the Graphite engine. -----------------------------------------------------------------------------------------------*/ -bool Get30EngFullFontInfo(const void * pName, size_t & lOffset, size_t & lSize) -{ - return GetNameInfo(pName, Sfnt::NameRecord::Microsoft, 0, 1033, - Sfnt::NameRecord::Fullname, lOffset, lSize); -} - -/*---------------------------------------------------------------------------------------------- - Return the Glyph ID for a given Postscript name. This method finds the first glyph which - matches the requested Postscript name. Ideally every glyph should have a unique Postscript - name (except for special names such as .notdef), but this is not always true. - On failure return value less than zero. - -1 - table search failed - -2 - format 3 table (no Postscript glyph info) - -3 - other failures - - Note: this method is not currently used by the Graphite engine. -----------------------------------------------------------------------------------------------*/ -int PostLookup(const void * pPost, size_t lPostSize, const void * pMaxp, - const char * pPostName) -{ - using namespace Sfnt; - - const Sfnt::PostScriptGlyphName * pTable - = reinterpret_cast(pPost); - fixed format = be::swap(pTable->format); - - if (format == PostScriptGlyphName::Format3) - { // format 3 - no Postscript glyph info in font - return -2; - } - - // search for given Postscript name among the standard names - int iPostName = -1; // index in standard names - for (int i = 0; i < kcPostNames; i++) - { - if (!strcmp(pPostName, rgPostName[i])) - { - iPostName = i; - break; - } - } - - if (format == PostScriptGlyphName::Format1) - { // format 1 - use standard Postscript names - return iPostName; - } - - if (format == PostScriptGlyphName::Format25) - { - if (iPostName == -1) - return -1; - - const PostScriptGlyphName25 * pTable25 - = static_cast(pTable); - int cnGlyphs = GlyphCount(pMaxp); - for (gid16 nGlyphId = 0; nGlyphId < cnGlyphs && nGlyphId < kcPostNames; - nGlyphId++) - { // glyph_name_index25 contains bytes so no byte swapping needed - // search for first glyph id that uses the standard name - if (nGlyphId + pTable25->offset[nGlyphId] == iPostName) - return nGlyphId; - } - } - - if (format == PostScriptGlyphName::Format2) - { // format 2 - const PostScriptGlyphName2 * pTable2 - = static_cast(pTable); - - int cnGlyphs = be::swap(pTable2->number_of_glyphs); - - if (iPostName != -1) - { // did match a standard name, look for first glyph id mapped to that name - for (gid16 nGlyphId = 0; nGlyphId < cnGlyphs; nGlyphId++) - { - if (be::swap(pTable2->glyph_name_index[nGlyphId]) == iPostName) - return nGlyphId; - } - return -1; // no glyph with this standard name - } - - else - { // did not match a standard name, search font specific names - size_t nStrSizeGoal = strlen(pPostName); - const char * pFirstGlyphName = reinterpret_cast( - &pTable2->glyph_name_index[0] + cnGlyphs); - const char * pGlyphName = pFirstGlyphName; - int iInNames = 0; // index in font specific names - bool fFound = false; - const char * const endOfTable - = reinterpret_cast(pTable2) + lPostSize; - while (pGlyphName < endOfTable && !fFound) - { // search Pascal strings for first matching name - size_t nStringSize = size_t(*pGlyphName); - if (nStrSizeGoal != nStringSize || - strncmp(pGlyphName + 1, pPostName, nStringSize)) - { // did not match - ++iInNames; - pGlyphName += nStringSize + 1; - } - else - { // did match - fFound = true; - } - } - if (!fFound) - return -1; // no font specific name matches request - - iInNames += kcPostNames; - for (gid16 nGlyphId = 0; nGlyphId < cnGlyphs; nGlyphId++) - { // search for first glyph id that maps to the found string index - if (be::swap(pTable2->glyph_name_index[nGlyphId]) == iInNames) - return nGlyphId; - } - return -1; // no glyph mapped to this index (very strange) - } - } - - return -3; -} - -/*---------------------------------------------------------------------------------------------- - Convert a Unicode character string from big endian (MSB first, Motorola) format to little - endian (LSB first, Intel) format. - nSize is the number of Unicode characters in the string. It should not include any - terminating null. If nSize is 0, it is assumed the string is null terminated. nSize - defaults to 0. - Return true if successful, false otherwise. -----------------------------------------------------------------------------------------------*/ -void SwapWString(void * pWStr, size_t nSize /* = 0 */) //throw (std::invalid_argument) -{ - if (pWStr == 0) - { -// throw std::invalid_argument("null pointer given"); - return; - } - - uint16 * pStr = reinterpret_cast(pWStr); - uint16 * const pStrEnd = pStr + (nSize == 0 ? wcslen((const wchar_t*)pStr) : nSize); - - for (; pStr != pStrEnd; ++pStr) - *pStr = be::swap(*pStr); -// std::transform(pStr, pStrEnd, pStr, read); - -// for (int i = 0; i < nSize; i++) -// { // swap the wide characters in the string -// pStr[i] = utf16(be::swap(uint16(pStr[i]))); -// } -} -#endif - -/*---------------------------------------------------------------------------------------------- - Get the left-side bearing and and advance width based on the given tables and Glyph ID - Return true if successful, false otherwise. On false, one or both value could be INT_MIN -----------------------------------------------------------------------------------------------*/ -bool HorMetrics(gid16 nGlyphId, const void * pHmtx, size_t lHmtxSize, const void * pHhea, - int & nLsb, unsigned int & nAdvWid) -{ - const Sfnt::HorizontalMetric * phmtx = - reinterpret_cast(pHmtx); - - const Sfnt::HorizontalHeader * phhea = - reinterpret_cast(pHhea); - - size_t cLongHorMetrics = be::swap(phhea->num_long_hor_metrics); - if (nGlyphId < cLongHorMetrics) - { // glyph id is acceptable - if (nGlyphId * sizeof(Sfnt::HorizontalMetric) >= lHmtxSize) return false; - nAdvWid = be::swap(phmtx[nGlyphId].advance_width); - nLsb = be::swap(phmtx[nGlyphId].left_side_bearing); - } - else - { - // guard against bad glyph id - size_t lLsbOffset = sizeof(Sfnt::HorizontalMetric) * cLongHorMetrics + - sizeof(int16) * (nGlyphId - cLongHorMetrics); // offset in bytes - // We test like this as LsbOffset is an offset not a length. - if (lLsbOffset > lHmtxSize - sizeof(int16)) - { - nLsb = 0; - return false; - } - nAdvWid = be::swap(phmtx[cLongHorMetrics - 1].advance_width); - nLsb = be::peek(reinterpret_cast(phmtx) + lLsbOffset); - } - - return true; -} - -/*---------------------------------------------------------------------------------------------- - Return a pointer to the requested cmap subtable. By default find the Microsoft Unicode - subtable. Pass nEncoding as -1 to find first table that matches only nPlatformId. - Return NULL if the subtable cannot be found. -----------------------------------------------------------------------------------------------*/ -const void * FindCmapSubtable(const void * pCmap, int nPlatformId, /* =3 */ int nEncodingId, /* = 1 */ size_t length) -{ - const Sfnt::CharacterCodeMap * pTable = reinterpret_cast(pCmap); - uint16 csuPlatforms = be::swap(pTable->num_subtables); - if (length && (sizeof(Sfnt::CharacterCodeMap) + 8 * (csuPlatforms - 1) > length)) - return NULL; - for (int i = 0; i < csuPlatforms; i++) - { - if (be::swap(pTable->encoding[i].platform_id) == nPlatformId && - (nEncodingId == -1 || be::swap(pTable->encoding[i].platform_specific_id) == nEncodingId)) - { - uint32 offset = be::swap(pTable->encoding[i].offset); - const uint8 * pRtn = reinterpret_cast(pCmap) + offset; - if (length) - { - if (offset > length) return NULL; - uint16 format = be::read(pRtn); - if (format == 4) - { - uint16 subTableLength = be::peek(pRtn); - if (i + 1 == csuPlatforms) - { - if (subTableLength > length - offset) - return NULL; - } - else if (subTableLength > be::swap(pTable->encoding[i+1].offset)) - return NULL; - } - if (format == 12) - { - uint32 subTableLength = be::peek(pRtn); - if (i + 1 == csuPlatforms) - { - if (subTableLength > length - offset) - return NULL; - } - else if (subTableLength > be::swap(pTable->encoding[i+1].offset)) - return NULL; - } - } - return reinterpret_cast(pCmap) + offset; - } - } - - return 0; -} - -/*---------------------------------------------------------------------------------------------- - Check the Microsoft Unicode subtable for expected values -----------------------------------------------------------------------------------------------*/ -bool CheckCmapSubtable4(const void * pCmapSubtable4) -{ - if (!pCmapSubtable4) return false; - const Sfnt::CmapSubTable * pTable = reinterpret_cast(pCmapSubtable4); - // Bob H says ome freeware TT fonts have version 1 (eg, CALIGULA.TTF) - // so don't check subtable version. 21 Mar 2002 spec changes version to language. - if (be::swap(pTable->format) != 4) return false; - const Sfnt::CmapSubTableFormat4 * pTable4 = reinterpret_cast(pCmapSubtable4); - uint16 length = be::swap(pTable4->length); - if (length < sizeof(Sfnt::CmapSubTableFormat4)) - return false; - uint16 nRanges = be::swap(pTable4->seg_count_x2) >> 1; - if (length < sizeof(Sfnt::CmapSubTableFormat4) + 4 * nRanges * sizeof(uint16)) - return false; - // check last range is properly terminated - uint16 chEnd = be::peek(pTable4->end_code + nRanges - 1); - return (chEnd == 0xFFFF); -} - -/*---------------------------------------------------------------------------------------------- - Return the Glyph ID for the given Unicode ID in the Microsoft Unicode subtable. - (Actually this code only depends on subtable being format 4.) - Return 0 if the Unicode ID is not in the subtable. -----------------------------------------------------------------------------------------------*/ -gid16 CmapSubtable4Lookup(const void * pCmapSubtabel4, unsigned int nUnicodeId, int rangeKey) -{ - const Sfnt::CmapSubTableFormat4 * pTable = reinterpret_cast(pCmapSubtabel4); - - uint16 nSeg = be::swap(pTable->seg_count_x2) >> 1; - - uint16 n; - const uint16 * pLeft, * pMid; - uint16 cMid, chStart, chEnd; - - if (rangeKey) - { - pMid = &(pTable->end_code[rangeKey]); - chEnd = be::peek(pMid); - n = rangeKey; - } - else - { - // Binary search of the endCode[] array - pLeft = &(pTable->end_code[0]); - n = nSeg; - while (n > 0) - { - cMid = n >> 1; // Pick an element in the middle - pMid = pLeft + cMid; - chEnd = be::peek(pMid); - if (nUnicodeId <= chEnd) - { - if (cMid == 0 || nUnicodeId > be::peek(pMid -1)) - break; // Must be this seg or none! - n = cMid; // Continue on left side, omitting mid point - } - else - { - pLeft = pMid + 1; // Continue on right side, omitting mid point - n -= (cMid + 1); - } - } - - if (!n) - return 0; - } - - // Ok, we're down to one segment and pMid points to the endCode element - // Either this is it or none is. - - chStart = be::peek(pMid += nSeg + 1); - if (chEnd >= nUnicodeId && nUnicodeId >= chStart) - { - // Found correct segment. Find Glyph Id - int16 idDelta = be::peek(pMid += nSeg); - uint16 idRangeOffset = be::peek(pMid += nSeg); - - if (idRangeOffset == 0) - return (uint16)(idDelta + nUnicodeId); // must use modulus 2^16 - - // Look up value in glyphIdArray - size_t offset = (nUnicodeId - chStart) + (idRangeOffset >> 1) + - (reinterpret_cast(pMid) - reinterpret_cast(pTable)); - if (offset * 2 >= pTable->length) - return 0; - gid16 nGlyphId = be::peek(pMid + (nUnicodeId - chStart) + (idRangeOffset >> 1)); - // If this value is 0, return 0. Else add the idDelta - return nGlyphId ? nGlyphId + idDelta : 0; - } - - return 0; -} - -/*---------------------------------------------------------------------------------------------- - Return the next Unicode value in the cmap. Pass 0 to obtain the first item. - Returns 0xFFFF as the last item. - pRangeKey is an optional key that is used to optimize the search; its value is the range - in which the character is found. -----------------------------------------------------------------------------------------------*/ -unsigned int CmapSubtable4NextCodepoint(const void *pCmap31, unsigned int nUnicodeId, int * pRangeKey) -{ - const Sfnt::CmapSubTableFormat4 * pTable = reinterpret_cast(pCmap31); - - uint16 nRange = be::swap(pTable->seg_count_x2) >> 1; - - uint32 nUnicodePrev = (uint32)nUnicodeId; - - const uint16 * pStartCode = &(pTable->end_code[0]) - + nRange // length of end code array - + 1; // reserved word - - if (nUnicodePrev == 0) - { - // return the first codepoint. - if (pRangeKey) - *pRangeKey = 0; - return be::peek(pStartCode); - } - else if (nUnicodePrev >= 0xFFFF) - { - if (pRangeKey) - *pRangeKey = nRange - 1; - return 0xFFFF; - } - - int iRange = (pRangeKey) ? *pRangeKey : 0; - // Just in case we have a bad key: - while (iRange > 0 && be::peek(pStartCode + iRange) > nUnicodePrev) - iRange--; - while (be::peek(pTable->end_code + iRange) < nUnicodePrev) - iRange++; - - // Now iRange is the range containing nUnicodePrev. - unsigned int nStartCode = be::peek(pStartCode + iRange); - unsigned int nEndCode = be::peek(pTable->end_code + iRange); - - if (nStartCode > nUnicodePrev) - // Oops, nUnicodePrev is not in the cmap! Adjust so we get a reasonable - // answer this time around. - nUnicodePrev = nStartCode - 1; - - if (nEndCode > nUnicodePrev) - { - // Next is in the same range; it is the next successive codepoint. - if (pRangeKey) - *pRangeKey = iRange; - return nUnicodePrev + 1; - } - - // Otherwise the next codepoint is the first one in the next range. - // There is guaranteed to be a next range because there must be one that - // ends with 0xFFFF. - if (pRangeKey) - *pRangeKey = iRange + 1; - return be::peek(pStartCode + iRange + 1); -} - -/*---------------------------------------------------------------------------------------------- - Check the Microsoft UCS-4 subtable for expected values. -----------------------------------------------------------------------------------------------*/ -bool CheckCmapSubtable12(const void *pCmapSubtable12) -{ - if (!pCmapSubtable12) return false; - const Sfnt::CmapSubTable * pTable = reinterpret_cast(pCmapSubtable12); - if (be::swap(pTable->format) != 12) - return false; - const Sfnt::CmapSubTableFormat12 * pTable12 = reinterpret_cast(pCmapSubtable12); - uint32 length = be::swap(pTable12->length); - if (length < sizeof(Sfnt::CmapSubTableFormat12)) - return false; - - return (length == (sizeof(Sfnt::CmapSubTableFormat12) + (be::swap(pTable12->num_groups) - 1) - * sizeof(uint32) * 3)); -} - -/*---------------------------------------------------------------------------------------------- - Return the Glyph ID for the given Unicode ID in the Microsoft UCS-4 subtable. - (Actually this code only depends on subtable being format 12.) - Return 0 if the Unicode ID is not in the subtable. -----------------------------------------------------------------------------------------------*/ -gid16 CmapSubtable12Lookup(const void * pCmap310, unsigned int uUnicodeId, int rangeKey) -{ - const Sfnt::CmapSubTableFormat12 * pTable = reinterpret_cast(pCmap310); - - //uint32 uLength = be::swap(pTable->length); //could use to test for premature end of table - uint32 ucGroups = be::swap(pTable->num_groups); - - for (unsigned int i = rangeKey; i < ucGroups; i++) - { - uint32 uStartCode = be::swap(pTable->group[i].start_char_code); - uint32 uEndCode = be::swap(pTable->group[i].end_char_code); - if (uUnicodeId >= uStartCode && uUnicodeId <= uEndCode) - { - uint32 uDiff = uUnicodeId - uStartCode; - uint32 uStartGid = be::swap(pTable->group[i].start_glyph_id); - return static_cast(uStartGid + uDiff); - } - } - - return 0; -} - -/*---------------------------------------------------------------------------------------------- - Return the next Unicode value in the cmap. Pass 0 to obtain the first item. - Returns 0x10FFFF as the last item. - pRangeKey is an optional key that is used to optimize the search; its value is the range - in which the character is found. -----------------------------------------------------------------------------------------------*/ -unsigned int CmapSubtable12NextCodepoint(const void *pCmap310, unsigned int nUnicodeId, int * pRangeKey) -{ - const Sfnt::CmapSubTableFormat12 * pTable = reinterpret_cast(pCmap310); - - int nRange = be::swap(pTable->num_groups); - - uint32 nUnicodePrev = (uint32)nUnicodeId; - - if (nUnicodePrev == 0) - { - // return the first codepoint. - if (pRangeKey) - *pRangeKey = 0; - return be::swap(pTable->group[0].start_char_code); - } - else if (nUnicodePrev >= 0x10FFFF) - { - if (pRangeKey) - *pRangeKey = nRange; - return 0x10FFFF; - } - - int iRange = (pRangeKey) ? *pRangeKey : 0; - // Just in case we have a bad key: - while (iRange > 0 && be::swap(pTable->group[iRange].start_char_code) > nUnicodePrev) - iRange--; - while (be::swap(pTable->group[iRange].end_char_code) < nUnicodePrev) - iRange++; - - // Now iRange is the range containing nUnicodePrev. - - unsigned int nStartCode = be::swap(pTable->group[iRange].start_char_code); - unsigned int nEndCode = be::swap(pTable->group[iRange].end_char_code); - - if (nStartCode > nUnicodePrev) - // Oops, nUnicodePrev is not in the cmap! Adjust so we get a reasonable - // answer this time around. - nUnicodePrev = nStartCode - 1; - - if (nEndCode > nUnicodePrev) - { - // Next is in the same range; it is the next successive codepoint. - if (pRangeKey) - *pRangeKey = iRange; - return nUnicodePrev + 1; - } - - // Otherwise the next codepoint is the first one in the next range, or 10FFFF if we're done. - if (pRangeKey) - *pRangeKey = iRange + 1; - return (iRange + 1 >= nRange) ? 0x10FFFF : be::swap(pTable->group[iRange + 1].start_char_code); -} - -/*---------------------------------------------------------------------------------------------- - Return the offset stored in the loca table for the given Glyph ID. - (This offset is into the glyf table.) - Return -1 if the lookup failed. - Technically this method should return an unsigned long but it is unlikely the offset will - exceed 2^31. -----------------------------------------------------------------------------------------------*/ -size_t LocaLookup(gid16 nGlyphId, - const void * pLoca, size_t lLocaSize, - const void * pHead) // throw (std::out_of_range) -{ - const Sfnt::FontHeader * pTable = reinterpret_cast(pHead); - - // CheckTable verifies the index_to_loc_format is valid - if (be::swap(pTable->index_to_loc_format) == Sfnt::FontHeader::ShortIndexLocFormat) - { // loca entries are two bytes and have been divided by two - if (nGlyphId < (lLocaSize >> 1) - 1) // allow sentinel value to be accessed - { - const uint16 * pShortTable = reinterpret_cast(pLoca); - return (be::peek(pShortTable + nGlyphId) << 1); - } - } - - if (be::swap(pTable->index_to_loc_format) == Sfnt::FontHeader::LongIndexLocFormat) - { // loca entries are four bytes - if (nGlyphId < (lLocaSize >> 2) - 1) - { - const uint32 * pLongTable = reinterpret_cast(pLoca); - return be::peek(pLongTable + nGlyphId); - } - } - - // only get here if glyph id was bad - return -1; - //throw std::out_of_range("glyph id out of range for font"); -} - -/*---------------------------------------------------------------------------------------------- - Return a pointer into the glyf table based on the given offset (from LocaLookup). - Return NULL on error. -----------------------------------------------------------------------------------------------*/ -void * GlyfLookup(const void * pGlyf, size_t nGlyfOffset, size_t nTableLen) -{ - const uint8 * pByte = reinterpret_cast(pGlyf); - if (nGlyfOffset == size_t(-1) || nGlyfOffset >= nTableLen) - return NULL; - return const_cast(pByte + nGlyfOffset); -} - -/*---------------------------------------------------------------------------------------------- - Get the bounding box coordinates for a simple glyf entry (non-composite). - Return true if successful, false otherwise. -----------------------------------------------------------------------------------------------*/ -bool GlyfBox(const void * pSimpleGlyf, int & xMin, int & yMin, - int & xMax, int & yMax) -{ - const Sfnt::Glyph * pGlyph = reinterpret_cast(pSimpleGlyf); - - xMin = be::swap(pGlyph->x_min); - yMin = be::swap(pGlyph->y_min); - xMax = be::swap(pGlyph->x_max); - yMax = be::swap(pGlyph->y_max); - - return true; -} - -#ifdef ALL_TTFUTILS -/*---------------------------------------------------------------------------------------------- - Return the number of contours for a simple glyf entry (non-composite) - Returning -1 means this is a composite glyph -----------------------------------------------------------------------------------------------*/ -int GlyfContourCount(const void * pSimpleGlyf) -{ - const Sfnt::Glyph * pGlyph = reinterpret_cast(pSimpleGlyf); - return be::swap(pGlyph->number_of_contours); // -1 means composite glyph -} - -/*---------------------------------------------------------------------------------------------- - Get the point numbers for the end points of the glyph contours for a simple - glyf entry (non-composite). - cnPointsTotal - count of contours from GlyfContourCount(); (same as number of end points) - prgnContourEndPoints - should point to a buffer large enough to hold cnPoints integers - cnPoints - count of points placed in above range - Return true if successful, false otherwise. - False could indicate a multi-level composite glyphs. -----------------------------------------------------------------------------------------------*/ -bool GlyfContourEndPoints(const void * pSimpleGlyf, int * prgnContourEndPoint, - int cnPointsTotal, int & cnPoints) -{ - const Sfnt::SimpleGlyph * pGlyph = reinterpret_cast(pSimpleGlyf); - - int cContours = be::swap(pGlyph->number_of_contours); - if (cContours < 0) - return false; // this method isn't supposed handle composite glyphs - - for (int i = 0; i < cContours && i < cnPointsTotal; i++) - { - prgnContourEndPoint[i] = be::swap(pGlyph->end_pts_of_contours[i]); - } - - cnPoints = cContours; - return true; -} - -/*---------------------------------------------------------------------------------------------- - Get the points for a simple glyf entry (non-composite) - cnPointsTotal - count of points from largest end point obtained from GlyfContourEndPoints - prgnX & prgnY - should point to buffers large enough to hold cnPointsTotal integers - The ranges are parallel so that coordinates for point(n) are found at offset n in both - ranges. This is raw point data with relative coordinates. - prgbFlag - should point to a buffer a large enough to hold cnPointsTotal bytes - This range is parallel to the prgnX & prgnY - cnPoints - count of points placed in above ranges - Return true if successful, false otherwise. - False could indicate a composite glyph -----------------------------------------------------------------------------------------------*/ -bool GlyfPoints(const void * pSimpleGlyf, int * prgnX, int * prgnY, - char * prgbFlag, int cnPointsTotal, int & cnPoints) -{ - using namespace Sfnt; - - const Sfnt::SimpleGlyph * pGlyph = reinterpret_cast(pSimpleGlyf); - int cContours = be::swap(pGlyph->number_of_contours); - // return false for composite glyph - if (cContours <= 0) - return false; - int cPts = be::swap(pGlyph->end_pts_of_contours[cContours - 1]) + 1; - if (cPts > cnPointsTotal) - return false; - - // skip over bounding box data & point to byte count of instructions (hints) - const uint8 * pbGlyph = reinterpret_cast - (&pGlyph->end_pts_of_contours[cContours]); - - // skip over hints & point to first flag - int cbHints = be::swap(*(uint16 *)pbGlyph); - pbGlyph += sizeof(uint16); - pbGlyph += cbHints; - - // load flags & point to first x coordinate - int iFlag = 0; - while (iFlag < cPts) - { - if (!(*pbGlyph & SimpleGlyph::Repeat)) - { // flag isn't repeated - prgbFlag[iFlag] = (char)*pbGlyph; - pbGlyph++; - iFlag++; - } - else - { // flag is repeated; count specified by next byte - char chFlag = (char)*pbGlyph; - pbGlyph++; - int cFlags = (int)*pbGlyph; - pbGlyph++; - prgbFlag[iFlag] = chFlag; - iFlag++; - for (int i = 0; i < cFlags; i++) - { - prgbFlag[iFlag + i] = chFlag; - } - iFlag += cFlags; - } - } - if (iFlag != cPts) - return false; - - // load x coordinates - iFlag = 0; - while (iFlag < cPts) - { - if (prgbFlag[iFlag] & SimpleGlyph::XShort) - { - prgnX[iFlag] = *pbGlyph; - if (!(prgbFlag[iFlag] & SimpleGlyph::XIsPos)) - { - prgnX[iFlag] = -prgnX[iFlag]; - } - pbGlyph++; - } - else - { - if (prgbFlag[iFlag] & SimpleGlyph::XIsSame) - { - prgnX[iFlag] = 0; - // do NOT increment pbGlyph - } - else - { - prgnX[iFlag] = be::swap(*(int16 *)pbGlyph); - pbGlyph += sizeof(int16); - } - } - iFlag++; - } - - // load y coordinates - iFlag = 0; - while (iFlag < cPts) - { - if (prgbFlag[iFlag] & SimpleGlyph::YShort) - { - prgnY[iFlag] = *pbGlyph; - if (!(prgbFlag[iFlag] & SimpleGlyph::YIsPos)) - { - prgnY[iFlag] = -prgnY[iFlag]; - } - pbGlyph++; - } - else - { - if (prgbFlag[iFlag] & SimpleGlyph::YIsSame) - { - prgnY[iFlag] = 0; - // do NOT increment pbGlyph - } - else - { - prgnY[iFlag] = be::swap(*(int16 *)pbGlyph); - pbGlyph += sizeof(int16); - } - } - iFlag++; - } - - cnPoints = cPts; - return true; -} - -/*---------------------------------------------------------------------------------------------- - Fill prgnCompId with the component Glyph IDs from pSimpleGlyf. - Client must allocate space before calling. - pSimpleGlyf - assumed to point to a composite glyph - cCompIdTotal - the number of elements in prgnCompId - cCompId - the total number of Glyph IDs stored in prgnCompId - Return true if successful, false otherwise - False could indicate a non-composite glyph or the input array was not big enough -----------------------------------------------------------------------------------------------*/ -bool GetComponentGlyphIds(const void * pSimpleGlyf, int * prgnCompId, - size_t cnCompIdTotal, size_t & cnCompId) -{ - using namespace Sfnt; - - if (GlyfContourCount(pSimpleGlyf) >= 0) - return false; - - const Sfnt::SimpleGlyph * pGlyph = reinterpret_cast(pSimpleGlyf); - // for a composite glyph, the special data begins here - const uint8 * pbGlyph = reinterpret_cast(&pGlyph->end_pts_of_contours[0]); - - uint16 GlyphFlags; - size_t iCurrentComp = 0; - do - { - GlyphFlags = be::swap(*((uint16 *)pbGlyph)); - pbGlyph += sizeof(uint16); - prgnCompId[iCurrentComp++] = be::swap(*((uint16 *)pbGlyph)); - pbGlyph += sizeof(uint16); - if (iCurrentComp >= cnCompIdTotal) - return false; - int nOffset = 0; - nOffset += GlyphFlags & CompoundGlyph::Arg1Arg2Words ? 4 : 2; - nOffset += GlyphFlags & CompoundGlyph::HaveScale ? 2 : 0; - nOffset += GlyphFlags & CompoundGlyph::HaveXAndYScale ? 4 : 0; - nOffset += GlyphFlags & CompoundGlyph::HaveTwoByTwo ? 8 : 0; - pbGlyph += nOffset; - } while (GlyphFlags & CompoundGlyph::MoreComponents); - - cnCompId = iCurrentComp; - - return true; -} - -/*---------------------------------------------------------------------------------------------- - Return info on how a component glyph is to be placed - pSimpleGlyph - assumed to point to a composite glyph - nCompId - glyph id for component of interest - bOffset - if true, a & b are the x & y offsets for this component - if false, b is the point on this component that is attaching to point a on the - preceding glyph - Return true if successful, false otherwise - False could indicate a non-composite glyph or that component wasn't found -----------------------------------------------------------------------------------------------*/ -bool GetComponentPlacement(const void * pSimpleGlyf, int nCompId, - bool fOffset, int & a, int & b) -{ - using namespace Sfnt; - - if (GlyfContourCount(pSimpleGlyf) >= 0) - return false; - - const Sfnt::SimpleGlyph * pGlyph = reinterpret_cast(pSimpleGlyf); - // for a composite glyph, the special data begins here - const uint8 * pbGlyph = reinterpret_cast(&pGlyph->end_pts_of_contours[0]); - - uint16 GlyphFlags; - do - { - GlyphFlags = be::swap(*((uint16 *)pbGlyph)); - pbGlyph += sizeof(uint16); - if (be::swap(*((uint16 *)pbGlyph)) == nCompId) - { - pbGlyph += sizeof(uint16); // skip over glyph id of component - fOffset = (GlyphFlags & CompoundGlyph::ArgsAreXYValues) == CompoundGlyph::ArgsAreXYValues; - - if (GlyphFlags & CompoundGlyph::Arg1Arg2Words ) - { - a = be::swap(*(int16 *)pbGlyph); - pbGlyph += sizeof(int16); - b = be::swap(*(int16 *)pbGlyph); - pbGlyph += sizeof(int16); - } - else - { // args are signed bytes - a = *pbGlyph++; - b = *pbGlyph++; - } - return true; - } - pbGlyph += sizeof(uint16); // skip over glyph id of component - int nOffset = 0; - nOffset += GlyphFlags & CompoundGlyph::Arg1Arg2Words ? 4 : 2; - nOffset += GlyphFlags & CompoundGlyph::HaveScale ? 2 : 0; - nOffset += GlyphFlags & CompoundGlyph::HaveXAndYScale ? 4 : 0; - nOffset += GlyphFlags & CompoundGlyph::HaveTwoByTwo ? 8 : 0; - pbGlyph += nOffset; - } while (GlyphFlags & CompoundGlyph::MoreComponents); - - // didn't find requested component - fOffset = true; - a = 0; - b = 0; - return false; -} - -/*---------------------------------------------------------------------------------------------- - Return info on how a component glyph is to be transformed - pSimpleGlyph - assumed to point to a composite glyph - nCompId - glyph id for component of interest - flt11, flt11, flt11, flt11 - a 2x2 matrix giving the transform - bTransOffset - whether to transform the offset from above method - The spec is unclear about the meaning of this flag - Currently - initialize to true for MS rasterizer and false for Mac rasterizer, then - on return it will indicate whether transform should apply to offset (MSDN CD 10/99) - Return true if successful, false otherwise - False could indicate a non-composite glyph or that component wasn't found -----------------------------------------------------------------------------------------------*/ -bool GetComponentTransform(const void * pSimpleGlyf, int nCompId, - float & flt11, float & flt12, float & flt21, float & flt22, - bool & fTransOffset) -{ - using namespace Sfnt; - - if (GlyfContourCount(pSimpleGlyf) >= 0) - return false; - - const Sfnt::SimpleGlyph * pGlyph = reinterpret_cast(pSimpleGlyf); - // for a composite glyph, the special data begins here - const uint8 * pbGlyph = reinterpret_cast(&pGlyph->end_pts_of_contours[0]); - - uint16 GlyphFlags; - do - { - GlyphFlags = be::swap(*((uint16 *)pbGlyph)); - pbGlyph += sizeof(uint16); - if (be::swap(*((uint16 *)pbGlyph)) == nCompId) - { - pbGlyph += sizeof(uint16); // skip over glyph id of component - pbGlyph += GlyphFlags & CompoundGlyph::Arg1Arg2Words ? 4 : 2; // skip over placement data - - if (fTransOffset) // MS rasterizer - fTransOffset = !(GlyphFlags & CompoundGlyph::UnscaledOffset); - else // Apple rasterizer - fTransOffset = (GlyphFlags & CompoundGlyph::ScaledOffset) != 0; - - if (GlyphFlags & CompoundGlyph::HaveScale) - { - flt11 = fixed_to_float<14>(be::swap(*(uint16 *)pbGlyph)); - pbGlyph += sizeof(uint16); - flt12 = 0; - flt21 = 0; - flt22 = flt11; - } - else if (GlyphFlags & CompoundGlyph::HaveXAndYScale) - { - flt11 = fixed_to_float<14>(be::swap(*(uint16 *)pbGlyph)); - pbGlyph += sizeof(uint16); - flt12 = 0; - flt21 = 0; - flt22 = fixed_to_float<14>(be::swap(*(uint16 *)pbGlyph)); - pbGlyph += sizeof(uint16); - } - else if (GlyphFlags & CompoundGlyph::HaveTwoByTwo) - { - flt11 = fixed_to_float<14>(be::swap(*(uint16 *)pbGlyph)); - pbGlyph += sizeof(uint16); - flt12 = fixed_to_float<14>(be::swap(*(uint16 *)pbGlyph)); - pbGlyph += sizeof(uint16); - flt21 = fixed_to_float<14>(be::swap(*(uint16 *)pbGlyph)); - pbGlyph += sizeof(uint16); - flt22 = fixed_to_float<14>(be::swap(*(uint16 *)pbGlyph)); - pbGlyph += sizeof(uint16); - } - else - { // identity transform - flt11 = 1.0; - flt12 = 0.0; - flt21 = 0.0; - flt22 = 1.0; - } - return true; - } - pbGlyph += sizeof(uint16); // skip over glyph id of component - int nOffset = 0; - nOffset += GlyphFlags & CompoundGlyph::Arg1Arg2Words ? 4 : 2; - nOffset += GlyphFlags & CompoundGlyph::HaveScale ? 2 : 0; - nOffset += GlyphFlags & CompoundGlyph::HaveXAndYScale ? 4 : 0; - nOffset += GlyphFlags & CompoundGlyph::HaveTwoByTwo ? 8 : 0; - pbGlyph += nOffset; - } while (GlyphFlags & CompoundGlyph::MoreComponents); - - // didn't find requested component - fTransOffset = false; - flt11 = 1; - flt12 = 0; - flt21 = 0; - flt22 = 1; - return false; -} -#endif - -/*---------------------------------------------------------------------------------------------- - Return a pointer into the glyf table based on the given tables and Glyph ID - Since this method doesn't check for spaces, it is good to call IsSpace before using it. - Return NULL on error. -----------------------------------------------------------------------------------------------*/ -void * GlyfLookup(gid16 nGlyphId, const void * pGlyf, const void * pLoca, - size_t lGlyfSize, size_t lLocaSize, const void * pHead) -{ - // test for valid glyph id - // CheckTable verifies the index_to_loc_format is valid - - const Sfnt::FontHeader * pTable - = reinterpret_cast(pHead); - - if (be::swap(pTable->index_to_loc_format) == Sfnt::FontHeader::ShortIndexLocFormat) - { // loca entries are two bytes (and have been divided by two) - if (nGlyphId >= (lLocaSize >> 1) - 1) // don't allow nGlyphId to access sentinel - { -// throw std::out_of_range("glyph id out of range for font"); - return NULL; - } - } - if (be::swap(pTable->index_to_loc_format) == Sfnt::FontHeader::LongIndexLocFormat) - { // loca entries are four bytes - if (nGlyphId >= (lLocaSize >> 2) - 1) - { -// throw std::out_of_range("glyph id out of range for font"); - return NULL; - } - } - - long lGlyfOffset = LocaLookup(nGlyphId, pLoca, lLocaSize, pHead); - void * pSimpleGlyf = GlyfLookup(pGlyf, lGlyfOffset, lGlyfSize); // invalid loca offset returns null - return pSimpleGlyf; -} - -#ifdef ALL_TTFUTILS -/*---------------------------------------------------------------------------------------------- - Determine if a particular Glyph ID has any data in the glyf table. If it is white space, - there will be no glyf data, though there will be metric data in hmtx, etc. -----------------------------------------------------------------------------------------------*/ -bool IsSpace(gid16 nGlyphId, const void * pLoca, size_t lLocaSize, const void * pHead) -{ - size_t lGlyfOffset = LocaLookup(nGlyphId, pLoca, lLocaSize, pHead); - - // the +1 should always work because there is a sentinel value at the end of the loca table - size_t lNextGlyfOffset = LocaLookup(nGlyphId + 1, pLoca, lLocaSize, pHead); - - return (lNextGlyfOffset - lGlyfOffset) == 0; -} - -/*---------------------------------------------------------------------------------------------- - Determine if a particular Glyph ID is a multi-level composite. -----------------------------------------------------------------------------------------------*/ -bool IsDeepComposite(gid16 nGlyphId, const void * pGlyf, const void * pLoca, - size_t lGlyfSize, long lLocaSize, const void * pHead) -{ - if (IsSpace(nGlyphId, pLoca, lLocaSize, pHead)) {return false;} - - void * pSimpleGlyf = GlyfLookup(nGlyphId, pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); - if (pSimpleGlyf == NULL) - return false; // no way to really indicate an error occured here - - if (GlyfContourCount(pSimpleGlyf) >= 0) - return false; - - int rgnCompId[kMaxGlyphComponents]; // assumes only a limited number of glyph components - size_t cCompIdTotal = kMaxGlyphComponents; - size_t cCompId = 0; - - if (!GetComponentGlyphIds(pSimpleGlyf, rgnCompId, cCompIdTotal, cCompId)) - return false; - - for (size_t i = 0; i < cCompId; i++) - { - pSimpleGlyf = GlyfLookup(static_cast(rgnCompId[i]), - pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); - if (pSimpleGlyf == NULL) {return false;} - - if (GlyfContourCount(pSimpleGlyf) < 0) - return true; - } - - return false; -} - -/*---------------------------------------------------------------------------------------------- - Get the bounding box coordinates based on the given tables and Glyph ID - Handles both simple and composite glyphs. - Return true if successful, false otherwise. On false, all point values will be INT_MIN - False may indicate a white space glyph -----------------------------------------------------------------------------------------------*/ -bool GlyfBox(gid16 nGlyphId, const void * pGlyf, const void * pLoca, - size_t lGlyfSize, size_t lLocaSize, const void * pHead, int & xMin, int & yMin, int & xMax, int & yMax) -{ - xMin = yMin = xMax = yMax = INT_MIN; - - if (IsSpace(nGlyphId, pLoca, lLocaSize, pHead)) {return false;} - - void * pSimpleGlyf = GlyfLookup(nGlyphId, pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); - if (pSimpleGlyf == NULL) {return false;} - - return GlyfBox(pSimpleGlyf, xMin, yMin, xMax, yMax); -} - -/*---------------------------------------------------------------------------------------------- - Get the number of contours based on the given tables and Glyph ID - Handles both simple and composite glyphs. - Return true if successful, false otherwise. On false, cnContours will be INT_MIN - False may indicate a white space glyph or a multi-level composite glyph. -----------------------------------------------------------------------------------------------*/ -bool GlyfContourCount(gid16 nGlyphId, const void * pGlyf, const void * pLoca, - size_t lGlyfSize, size_t lLocaSize, const void * pHead, size_t & cnContours) -{ - cnContours = static_cast(INT_MIN); - - if (IsSpace(nGlyphId, pLoca, lLocaSize, pHead)) {return false;} - - void * pSimpleGlyf = GlyfLookup(nGlyphId, pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); - if (pSimpleGlyf == NULL) {return false;} - - int cRtnContours = GlyfContourCount(pSimpleGlyf); - if (cRtnContours >= 0) - { - cnContours = size_t(cRtnContours); - return true; - } - - //handle composite glyphs - - int rgnCompId[kMaxGlyphComponents]; // assumes no glyph will be made of more than 8 components - size_t cCompIdTotal = kMaxGlyphComponents; - size_t cCompId = 0; - - if (!GetComponentGlyphIds(pSimpleGlyf, rgnCompId, cCompIdTotal, cCompId)) - return false; - - cRtnContours = 0; - int cTmp = 0; - for (size_t i = 0; i < cCompId; i++) - { - if (IsSpace(static_cast(rgnCompId[i]), pLoca, lLocaSize, pHead)) {return false;} - pSimpleGlyf = GlyfLookup(static_cast(rgnCompId[i]), - pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); - if (pSimpleGlyf == 0) {return false;} - // return false on multi-level composite - if ((cTmp = GlyfContourCount(pSimpleGlyf)) < 0) - return false; - cRtnContours += cTmp; - } - - cnContours = size_t(cRtnContours); - return true; -} - -/*---------------------------------------------------------------------------------------------- - Get the point numbers for the end points of the glyph contours based on the given tables - and Glyph ID - Handles both simple and composite glyphs. - cnPoints - count of contours from GlyfContourCount (same as number of end points) - prgnContourEndPoints - should point to a buffer large enough to hold cnPoints integers - Return true if successful, false otherwise. On false, all end points are INT_MIN - False may indicate a white space glyph or a multi-level composite glyph. -----------------------------------------------------------------------------------------------*/ -bool GlyfContourEndPoints(gid16 nGlyphId, const void * pGlyf, const void * pLoca, - size_t lGlyfSize, size_t lLocaSize, const void * pHead, - int * prgnContourEndPoint, size_t cnPoints) -{ - memset(prgnContourEndPoint, 0xFF, cnPoints * sizeof(int)); - // std::fill_n(prgnContourEndPoint, cnPoints, INT_MIN); - - if (IsSpace(nGlyphId, pLoca, lLocaSize, pHead)) {return false;} - - void * pSimpleGlyf = GlyfLookup(nGlyphId, pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); - if (pSimpleGlyf == NULL) {return false;} - - int cContours = GlyfContourCount(pSimpleGlyf); - int cActualPts = 0; - if (cContours > 0) - return GlyfContourEndPoints(pSimpleGlyf, prgnContourEndPoint, cnPoints, cActualPts); - - // handle composite glyphs - - int rgnCompId[kMaxGlyphComponents]; // assumes no glyph will be made of more than 8 components - size_t cCompIdTotal = kMaxGlyphComponents; - size_t cCompId = 0; - - if (!GetComponentGlyphIds(pSimpleGlyf, rgnCompId, cCompIdTotal, cCompId)) - return false; - - int * prgnCurrentEndPoint = prgnContourEndPoint; - int cCurrentPoints = cnPoints; - int nPrevPt = 0; - for (size_t i = 0; i < cCompId; i++) - { - if (IsSpace(static_cast(rgnCompId[i]), pLoca, lLocaSize, pHead)) {return false;} - pSimpleGlyf = GlyfLookup(static_cast(rgnCompId[i]), pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); - if (pSimpleGlyf == NULL) {return false;} - // returns false on multi-level composite - if (!GlyfContourEndPoints(pSimpleGlyf, prgnCurrentEndPoint, cCurrentPoints, cActualPts)) - return false; - // points in composite are numbered sequentially as components are added - // must adjust end point numbers for new point numbers - for (int j = 0; j < cActualPts; j++) - prgnCurrentEndPoint[j] += nPrevPt; - nPrevPt = prgnCurrentEndPoint[cActualPts - 1] + 1; - - prgnCurrentEndPoint += cActualPts; - cCurrentPoints -= cActualPts; - } - - return true; -} - -/*---------------------------------------------------------------------------------------------- - Get the points for a glyph based on the given tables and Glyph ID - Handles both simple and composite glyphs. - cnPoints - count of points from largest end point obtained from GlyfContourEndPoints - prgnX & prgnY - should point to buffers large enough to hold cnPoints integers - The ranges are parallel so that coordinates for point(n) are found at offset n in - both ranges. These points are in absolute coordinates. - prgfOnCurve - should point to a buffer a large enough to hold cnPoints bytes (bool) - This range is parallel to the prgnX & prgnY - Return true if successful, false otherwise. On false, all points may be INT_MIN - False may indicate a white space glyph, a multi-level composite, or a corrupt font - // TODO: doesn't support composite glyphs whose components are themselves components - It's not clear from the TTF spec when the transforms should be applied. Should the - transform be done before or after attachment point calcs? (current code - before) - Should the transform be applied to other offsets? (currently - no; however commented - out code is in place so that if CompoundGlyph::UnscaledOffset on the MS rasterizer is - clear (typical) then yes, and if CompoundGlyph::ScaledOffset on the Apple rasterizer is - clear (typical?) then no). See GetComponentTransform. - It's also unclear where point numbering with attachment poinst starts - (currently - first point number is relative to whole glyph, second point number is - relative to current glyph). -----------------------------------------------------------------------------------------------*/ -bool GlyfPoints(gid16 nGlyphId, const void * pGlyf, - const void * pLoca, size_t lGlyfSize, size_t lLocaSize, const void * pHead, - const int * /*prgnContourEndPoint*/, size_t /*cnEndPoints*/, - int * prgnX, int * prgnY, bool * prgfOnCurve, size_t cnPoints) -{ - memset(prgnX, 0x7F, cnPoints * sizeof(int)); - memset(prgnY, 0x7F, cnPoints * sizeof(int)); - - if (IsSpace(nGlyphId, pLoca, lLocaSize, pHead)) - return false; - - void * pSimpleGlyf = GlyfLookup(nGlyphId, pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); - if (pSimpleGlyf == NULL) - return false; - - int cContours = GlyfContourCount(pSimpleGlyf); - int cActualPts; - if (cContours > 0) - { - if (!GlyfPoints(pSimpleGlyf, prgnX, prgnY, (char *)prgfOnCurve, cnPoints, cActualPts)) - return false; - CalcAbsolutePoints(prgnX, prgnY, cnPoints); - SimplifyFlags((char *)prgfOnCurve, cnPoints); - return true; - } - - // handle composite glyphs - int rgnCompId[kMaxGlyphComponents]; // assumes no glyph will be made of more than 8 components - size_t cCompIdTotal = kMaxGlyphComponents; - size_t cCompId = 0; - - // this will fail if there are more components than there is room for - if (!GetComponentGlyphIds(pSimpleGlyf, rgnCompId, cCompIdTotal, cCompId)) - return false; - - int * prgnCurrentX = prgnX; - int * prgnCurrentY = prgnY; - char * prgbCurrentFlag = (char *)prgfOnCurve; // converting bool to char should be safe - int cCurrentPoints = cnPoints; - bool fOffset = true, fTransOff = true; - int a, b; - float flt11, flt12, flt21, flt22; - // int * prgnPrevX = prgnX; // in case first att pt number relative to preceding glyph - // int * prgnPrevY = prgnY; - for (size_t i = 0; i < cCompId; i++) - { - if (IsSpace(static_cast(rgnCompId[i]), pLoca, lLocaSize, pHead)) {return false;} - void * pCompGlyf = GlyfLookup(static_cast(rgnCompId[i]), pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); - if (pCompGlyf == NULL) {return false;} - // returns false on multi-level composite - if (!GlyfPoints(pCompGlyf, prgnCurrentX, prgnCurrentY, prgbCurrentFlag, - cCurrentPoints, cActualPts)) - return false; - if (!GetComponentPlacement(pSimpleGlyf, rgnCompId[i], fOffset, a, b)) - return false; - if (!GetComponentTransform(pSimpleGlyf, rgnCompId[i], - flt11, flt12, flt21, flt22, fTransOff)) - return false; - bool fIdTrans = flt11 == 1.0 && flt12 == 0.0 && flt21 == 0.0 && flt22 == 1.0; - - // convert points to absolute coordinates - // do before transform and attachment point placement are applied - CalcAbsolutePoints(prgnCurrentX, prgnCurrentY, cActualPts); - - // apply transform - see main method note above - // do before attachment point calcs - if (!fIdTrans) - for (int j = 0; j < cActualPts; j++) - { - int x = prgnCurrentX[j]; // store before transform applied - int y = prgnCurrentY[j]; - prgnCurrentX[j] = (int)(x * flt11 + y * flt12); - prgnCurrentY[j] = (int)(x * flt21 + y * flt22); - } - - // apply placement - see main method note above - int nXOff, nYOff; - if (fOffset) // explicit x & y offsets - { - /* ignore fTransOff for now - if (fTransOff && !fIdTrans) - { // transform x & y offsets - nXOff = (int)(a * flt11 + b * flt12); - nYOff = (int)(a * flt21 + b * flt22); - } - else */ - { // don't transform offset - nXOff = a; - nYOff = b; - } - } - else // attachment points - { // in case first point is relative to preceding glyph and second relative to current - // nXOff = prgnPrevX[a] - prgnCurrentX[b]; - // nYOff = prgnPrevY[a] - prgnCurrentY[b]; - // first point number relative to whole composite, second relative to current glyph - nXOff = prgnX[a] - prgnCurrentX[b]; - nYOff = prgnY[a] - prgnCurrentY[b]; - } - for (int j = 0; j < cActualPts; j++) - { - prgnCurrentX[j] += nXOff; - prgnCurrentY[j] += nYOff; - } - - // prgnPrevX = prgnCurrentX; - // prgnPrevY = prgnCurrentY; - prgnCurrentX += cActualPts; - prgnCurrentY += cActualPts; - prgbCurrentFlag += cActualPts; - cCurrentPoints -= cActualPts; - } - - SimplifyFlags((char *)prgfOnCurve, cnPoints); - - return true; -} - -/*---------------------------------------------------------------------------------------------- - Simplify the meaning of flags to just indicate whether point is on-curve or off-curve. ----------------------------------------------------------------------------------------------*/ -bool SimplifyFlags(char * prgbFlags, int cnPoints) -{ - for (int i = 0; i < cnPoints; i++) - prgbFlags[i] = static_cast(prgbFlags[i] & Sfnt::SimpleGlyph::OnCurve); - return true; -} - -/*---------------------------------------------------------------------------------------------- - Convert relative point coordinates to absolute coordinates - Points are stored in the font such that they are offsets from one another except for the - first point of a glyph. ----------------------------------------------------------------------------------------------*/ -bool CalcAbsolutePoints(int * prgnX, int * prgnY, int cnPoints) -{ - int nX = prgnX[0]; - int nY = prgnY[0]; - for (int i = 1; i < cnPoints; i++) - { - prgnX[i] += nX; - nX = prgnX[i]; - prgnY[i] += nY; - nY = prgnY[i]; - } - - return true; -} -#endif - -/*---------------------------------------------------------------------------------------------- - Return the length of the 'name' table in bytes. - Currently used. ----------------------------------------------------------------------------------------------*/ -#if 0 -size_t NameTableLength(const byte * pTable) -{ - byte * pb = (const_cast(pTable)) + 2; // skip format - size_t cRecords = *pb++ << 8; cRecords += *pb++; - int dbStringOffset0 = (*pb++) << 8; dbStringOffset0 += *pb++; - int dbMaxStringOffset = 0; - for (size_t irec = 0; irec < cRecords; irec++) - { - int nPlatform = (*pb++) << 8; nPlatform += *pb++; - int nEncoding = (*pb++) << 8; nEncoding += *pb++; - int nLanguage = (*pb++) << 8; nLanguage += *pb++; - int nName = (*pb++) << 8; nName += *pb++; - int cbStringLen = (*pb++) << 8; cbStringLen += *pb++; - int dbStringOffset = (*pb++) << 8; dbStringOffset += *pb++; - if (dbMaxStringOffset < dbStringOffset + cbStringLen) - dbMaxStringOffset = dbStringOffset + cbStringLen; - } - return dbStringOffset0 + dbMaxStringOffset; -} -#endif - -} // end of namespace TtfUtil -} // end of namespace graphite diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/UtfCodec.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/UtfCodec.cpp deleted file mode 100644 index ca3c0c0a700..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/UtfCodec.cpp +++ /dev/null @@ -1,45 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include "inc/UtfCodec.h" -//using namespace graphite2; - -namespace graphite2 { - -} - -using namespace graphite2; - -const int8 _utf_codec<8>::sz_lut[16] = -{ - 1,1,1,1,1,1,1,1, // 1 byte - 0,0,0,0, // trailing byte - 2,2, // 2 bytes - 3, // 3 bytes - 4 // 4 bytes -}; - -const byte _utf_codec<8>::mask_lut[5] = {0x7f, 0xff, 0x3f, 0x1f, 0x0f}; diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/call_machine.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/call_machine.cpp deleted file mode 100644 index f06f43cbda3..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/call_machine.cpp +++ /dev/null @@ -1,135 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -// This call threaded interpreter implmentation for machine.h -// Author: Tim Eves - -// Build either this interpreter or the direct_machine implementation. -// The call threaded interpreter is portable across compilers and -// architectures as well as being useful to debug (you can set breakpoints on -// opcodes) but is slower that the direct threaded interpreter by a factor of 2 - -#include -#include -#include -#include "inc/Machine.h" -#include "inc/Segment.h" -#include "inc/Slot.h" -#include "inc/Rule.h" - -// Disable the unused parameter warning as th compiler is mistaken since dp -// is always updated (even if by 0) on every opcode. -#ifdef __GNUC__ -#pragma GCC diagnostic ignored "-Wunused-parameter" -#endif - -#define registers const byte * & dp, vm::Machine::stack_t * & sp, \ - vm::Machine::stack_t * const sb, regbank & reg - -// These are required by opcodes.h and should not be changed -#define STARTOP(name) bool name(registers) REGPARM(4);\ - bool name(registers) { -#define ENDOP return (sp - sb)/Machine::STACK_MAX==0; \ - } - -#define EXIT(status) { push(status); return false; } - -// This is required by opcode_table.h -#define do_(name) instr(name) - - -using namespace graphite2; -using namespace vm; - -struct regbank { - slotref is; - slotref * map; - SlotMap & smap; - slotref * const map_base; - const instr * & ip; - int8 flags; -}; - -typedef bool (* ip_t)(registers); - -// Pull in the opcode definitions -// We pull these into a private namespace so these otherwise common names dont -// pollute the toplevel namespace. -namespace { -#define smap reg.smap -#define seg smap.segment -#define is reg.is -#define ip reg.ip -#define map reg.map -#define mapb reg.map_base -#define flags reg.flags - -#include "inc/opcodes.h" - -#undef smap -#undef seg -#undef is -#undef ip -#undef map -#undef mapb -#undef flags -} - -Machine::stack_t Machine::run(const instr * program, - const byte * data, - slotref * & map) - -{ - assert(program != 0); - - // Declare virtual machine registers - const instr * ip = program-1; - const byte * dp = data; - stack_t * sp = _stack + Machine::STACK_GUARD, - * const sb = sp; - regbank reg = {*map, map, _map, _map.begin()+_map.context(), ip, 0}; - - // Run the program - while ((reinterpret_cast(*++ip))(dp, sp, sb, reg)) {} - const stack_t ret = sp == _stack+STACK_GUARD+1 ? *sp-- : 0; - - check_final_stack(sp); - map = reg.map; - *map = reg.is; - return ret; -} - -// Pull in the opcode table -namespace { -#include "inc/opcode_table.h" -} - -const opcode_t * Machine::getOpcodeTable() throw() -{ - return opcode_table; -} - - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/direct_machine.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/direct_machine.cpp deleted file mode 100644 index 09709c30336..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/direct_machine.cpp +++ /dev/null @@ -1,117 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -// This direct threaded interpreter implmentation for machine.h -// Author: Tim Eves - -// Build either this interpreter or the call_machine implementation. -// The direct threaded interpreter is relies upon a gcc feature called -// labels-as-values so is only portable to compilers that support the -// extension (gcc only as far as I know) however it should build on any -// architecture gcc supports. -// This is twice as fast as the call threaded model and is likely faster on -// inorder processors with short pipelines and little branch prediction such -// as the ARM and possibly Atom chips. - - -#include -#include -#include "inc/Machine.h" -#include "inc/Segment.h" -#include "inc/Slot.h" -#include "inc/Rule.h" - -#define STARTOP(name) name: { -#define ENDOP }; goto *((sp - sb)/Machine::STACK_MAX ? &&end : *++ip); -#define EXIT(status) { push(status); goto end; } - -#define do_(name) &&name - - -using namespace graphite2; -using namespace vm; - -namespace { - -const void * direct_run(const bool get_table_mode, - const instr * program, - const byte * data, - Machine::stack_t * stack, - slotref * & __map, - SlotMap * __smap=0) -{ - // We need to define and return to opcode table from within this function - // other inorder to take the addresses of the instruction bodies. - #include "inc/opcode_table.h" - if (get_table_mode) - return opcode_table; - - // Declare virtual machine registers - const instr * ip = program; - const byte * dp = data; - Machine::stack_t * sp = stack + Machine::STACK_GUARD, - * const sb = sp; - SlotMap & smap = *__smap; - Segment & seg = smap.segment; - slotref is = *__map, - * map = __map, - * const mapb = smap.begin()+smap.context(); - int8 flags = 0; - - // start the program - goto **ip; - - // Pull in the opcode definitions - #include "inc/opcodes.h" - - end: - __map = map; - *__map = is; - return sp; -} - -} - -const opcode_t * Machine::getOpcodeTable() throw() -{ - slotref * dummy; - return static_cast(direct_run(true, 0, 0, 0, dummy, 0)); -} - - -Machine::stack_t Machine::run(const instr * program, - const byte * data, - slotref * & is) -{ - assert(program != 0); - - const stack_t *sp = static_cast( - direct_run(false, program, data, _stack, is, &_map)); - const stack_t ret = sp == _stack+STACK_GUARD+1 ? *sp-- : 0; - check_final_stack(sp); - return ret; -} - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/files.mk b/Build/source/libs/graphite2/graphite2-1.2.0/src/files.mk deleted file mode 100644 index 358acef62df..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/files.mk +++ /dev/null @@ -1,115 +0,0 @@ -# GRAPHITE2 LICENSING -# -# Copyright 2010, SIL International -# All rights reserved. -# -# This library is free software; you can redistribute it and/or modify -# it under the terms of the GNU Lesser General Public License as published -# by the Free Software Foundation; either version 2.1 of License, or -# (at your option) any later version. -# -# This program 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 for more details. -# -# You should also have received a copy of the GNU Lesser General Public -# License along with this library in the file named "LICENSE". -# If not, write to the Free Software Foundation, 51 Franklin Street, -# Suite 500, Boston, MA 02110-1335, USA or visit their web page on the -# internet at http://www.fsf.org/licenses/lgpl.html. -# -# Alternatively, the contents of this file may be used under the terms of the -# Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -# License, as published by the Free Software Foundation, either version 2 -# of the License or (at your option) any later version. - -# Makefile helper file for those wanting to build Graphite2 using make -# The including makefile should set the following variables -# _NS Prefix to all variables this file creates (namespace) -# $(_NS)_MACHINE Set to direct or call. Set to direct if using gcc else -# set to call -# $(_NS)_BASE path to root of graphite2 project -# -# Returns: -# $(_NS)_SOURCES List of source files (with .cpp extension) -# $(_NS)_PRIVATE_HEADERS List of private header files (with .h extension) -# $(_NS)_PUBLIC_HEADERS List of public header files (with .h extension) - - -$(_NS)_SOURCES = \ - $($(_NS)_BASE)/src/$($(_NS)_MACHINE)_machine.cpp \ - $($(_NS)_BASE)/src/gr_char_info.cpp \ - $($(_NS)_BASE)/src/gr_face.cpp \ - $($(_NS)_BASE)/src/gr_features.cpp \ - $($(_NS)_BASE)/src/gr_font.cpp \ - $($(_NS)_BASE)/src/gr_logging.cpp \ - $($(_NS)_BASE)/src/gr_segment.cpp \ - $($(_NS)_BASE)/src/gr_slot.cpp \ - $($(_NS)_BASE)/src/json.cpp \ - $($(_NS)_BASE)/src/Bidi.cpp \ - $($(_NS)_BASE)/src/CachedFace.cpp \ - $($(_NS)_BASE)/src/CmapCache.cpp \ - $($(_NS)_BASE)/src/Code.cpp \ - $($(_NS)_BASE)/src/Face.cpp \ - $($(_NS)_BASE)/src/FeatureMap.cpp \ - $($(_NS)_BASE)/src/FileFace.cpp \ - $($(_NS)_BASE)/src/Font.cpp \ - $($(_NS)_BASE)/src/GlyphCache.cpp \ - $($(_NS)_BASE)/src/GlyphFace.cpp \ - $($(_NS)_BASE)/src/Justifier.cpp \ - $($(_NS)_BASE)/src/NameTable.cpp \ - $($(_NS)_BASE)/src/Pass.cpp \ - $($(_NS)_BASE)/src/SegCache.cpp \ - $($(_NS)_BASE)/src/SegCacheEntry.cpp \ - $($(_NS)_BASE)/src/SegCacheStore.cpp \ - $($(_NS)_BASE)/src/Segment.cpp \ - $($(_NS)_BASE)/src/Silf.cpp \ - $($(_NS)_BASE)/src/Slot.cpp \ - $($(_NS)_BASE)/src/Sparse.cpp \ - $($(_NS)_BASE)/src/TtfUtil.cpp \ - $($(_NS)_BASE)/src/UtfCodec.cpp - -$(_NS)_PRIVATE_HEADERS = \ - $($(_NS)_BASE)/src/inc/bits.h \ - $($(_NS)_BASE)/src/inc/debug.h \ - $($(_NS)_BASE)/src/inc/json.h \ - $($(_NS)_BASE)/src/inc/CachedFace.h \ - $($(_NS)_BASE)/src/inc/CharInfo.h \ - $($(_NS)_BASE)/src/inc/CmapCache.h \ - $($(_NS)_BASE)/src/inc/Code.h \ - $($(_NS)_BASE)/src/inc/Endian.h \ - $($(_NS)_BASE)/src/inc/Face.h \ - $($(_NS)_BASE)/src/inc/FeatureMap.h \ - $($(_NS)_BASE)/src/inc/FeatureVal.h \ - $($(_NS)_BASE)/src/inc/FileFace.h \ - $($(_NS)_BASE)/src/inc/Font.h \ - $($(_NS)_BASE)/src/inc/GlyphCache.h \ - $($(_NS)_BASE)/src/inc/GlyphFace.h \ - $($(_NS)_BASE)/src/inc/List.h \ - $($(_NS)_BASE)/src/inc/locale2lcid.h \ - $($(_NS)_BASE)/src/inc/Machine.h \ - $($(_NS)_BASE)/src/inc/Main.h \ - $($(_NS)_BASE)/src/inc/NameTable.h \ - $($(_NS)_BASE)/src/inc/opcode_table.h \ - $($(_NS)_BASE)/src/inc/opcodes.h \ - $($(_NS)_BASE)/src/inc/Pass.h \ - $($(_NS)_BASE)/src/inc/Position.h \ - $($(_NS)_BASE)/src/inc/Rule.h \ - $($(_NS)_BASE)/src/inc/SegCache.h \ - $($(_NS)_BASE)/src/inc/SegCacheEntry.h \ - $($(_NS)_BASE)/src/inc/SegCacheStore.h \ - $($(_NS)_BASE)/src/inc/Segment.h \ - $($(_NS)_BASE)/src/inc/Silf.h \ - $($(_NS)_BASE)/src/inc/Slot.h \ - $($(_NS)_BASE)/src/inc/Sparse.h \ - $($(_NS)_BASE)/src/inc/TtfTypes.h \ - $($(_NS)_BASE)/src/inc/TtfUtil.h \ - $($(_NS)_BASE)/src/inc/UtfCodec.h - -$(_NS)_PUBLIC_HEADERS = \ - $($(_NS)_BASE)/include/graphite2/Font.h \ - $($(_NS)_BASE)/include/graphite2/Log.h \ - $($(_NS)_BASE)/include/graphite2/Segment.h \ - $($(_NS)_BASE)/include/graphite2/Types.h - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_char_info.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_char_info.cpp deleted file mode 100644 index ebcb68e593f..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_char_info.cpp +++ /dev/null @@ -1,65 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include -#include "graphite2/Segment.h" -#include "inc/CharInfo.h" - -extern "C" -{ - -unsigned int gr_cinfo_unicode_char(const gr_char_info* p/*not NULL*/) -{ - assert(p); - return p->unicodeChar(); -} - - -int gr_cinfo_break_weight(const gr_char_info* p/*not NULL*/) -{ - assert(p); - return p->breakWeight(); -} - -int gr_cinfo_after(const gr_char_info *p/*not NULL*/) -{ - assert(p); - return p->after(); -} - -int gr_cinfo_before(const gr_char_info *p/*not NULL*/) -{ - assert(p); - return p->before(); -} - -size_t gr_cinfo_base(const gr_char_info *p/*not NULL*/) -{ - assert(p); - return p->base(); -} - -} // extern "C" diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_face.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_face.cpp deleted file mode 100644 index e0f24335522..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_face.cpp +++ /dev/null @@ -1,255 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include "graphite2/Font.h" -#include "inc/Face.h" -#include "inc/FileFace.h" -#include "inc/GlyphCache.h" -#include "inc/CachedFace.h" -#include "inc/CmapCache.h" -#include "inc/Silf.h" - -using namespace graphite2; - -namespace -{ - bool load_face(Face & face, unsigned int options) - { - Face::Table silf(face, Tag::Silf); - if (silf) options &= ~gr_face_dumbRendering; - else if (!(options & gr_face_dumbRendering)) - return false; - - if (!face.readGlyphs(options)) - return false; - - return silf ? face.readFeatures() && face.readGraphite(silf) - : options & gr_face_dumbRendering; - } -} - -extern "C" { - -gr_face* gr_make_face_with_ops(const void* appFaceHandle/*non-NULL*/, const gr_face_ops *ops, unsigned int faceOptions) - //the appFaceHandle must stay alive all the time when the gr_face is alive. When finished with the gr_face, call destroy_face -{ - if (ops == 0) return 0; - - Face *res = new Face(appFaceHandle, *ops); - if (res && load_face(*res, faceOptions)) - return static_cast(res); - - delete res; - return 0; -} - -gr_face* gr_make_face(const void* appFaceHandle/*non-NULL*/, gr_get_table_fn tablefn, unsigned int faceOptions) -{ - const gr_face_ops ops = {sizeof(gr_face_ops), tablefn, NULL}; - return gr_make_face_with_ops(appFaceHandle, &ops, faceOptions); -} - -#ifndef GRAPHITE2_NSEGCACHE -gr_face* gr_make_face_with_seg_cache_and_ops(const void* appFaceHandle/*non-NULL*/, const gr_face_ops *ops, unsigned int cacheSize, unsigned int faceOptions) - //the appFaceHandle must stay alive all the time when the GrFace is alive. When finished with the GrFace, call destroy_face -{ - if (ops == 0) return 0; - - CachedFace *res = new CachedFace(appFaceHandle, *ops); - if (res && load_face(*res, faceOptions) - && res->setupCache(cacheSize)) - return static_cast(static_cast(res)); - - delete res; - return 0; -} - -gr_face* gr_make_face_with_seg_cache(const void* appFaceHandle/*non-NULL*/, gr_get_table_fn getTable, unsigned int cacheSize, unsigned int faceOptions) -{ - const gr_face_ops ops = {sizeof(gr_face_ops), getTable, NULL}; - return gr_make_face_with_seg_cache_and_ops(appFaceHandle, &ops, cacheSize, faceOptions); -} -#endif - -gr_uint32 gr_str_to_tag(const char *str) -{ - uint32 res = 0; - int i = strlen(str); - if (i > 4) i = 4; - while (--i >= 0) - res = (res >> 8) + (str[i] << 24); - return res; -} - -void gr_tag_to_str(gr_uint32 tag, char *str) -{ - int i = 4; - while (--i >= 0) - { - str[i] = tag & 0xFF; - tag >>= 8; - } -} - -inline -uint32 zeropad(const uint32 x) -{ - if (x == 0x20202020) return 0; - if ((x & 0x00FFFFFF) == 0x00202020) return x & 0xFF000000; - if ((x & 0x0000FFFF) == 0x00002020) return x & 0xFFFF0000; - if ((x & 0x000000FF) == 0x00000020) return x & 0xFFFFFF00; - return x; -} - -gr_feature_val* gr_face_featureval_for_lang(const gr_face* pFace, gr_uint32 langname/*0 means clone default*/) //clones the features. if none for language, clones the default -{ - assert(pFace); - zeropad(langname); - return static_cast(pFace->theSill().cloneFeatures(langname)); -} - - -const gr_feature_ref* gr_face_find_fref(const gr_face* pFace, gr_uint32 featId) //When finished with the FeatureRef, call destroy_FeatureRef -{ - assert(pFace); - zeropad(featId); - const FeatureRef* pRef = pFace->featureById(featId); - return static_cast(pRef); -} - -unsigned short gr_face_n_fref(const gr_face* pFace) -{ - assert(pFace); - return pFace->numFeatures(); -} - -const gr_feature_ref* gr_face_fref(const gr_face* pFace, gr_uint16 i) //When finished with the FeatureRef, call destroy_FeatureRef -{ - assert(pFace); - const FeatureRef* pRef = pFace->feature(i); - return static_cast(pRef); -} - -unsigned short gr_face_n_languages(const gr_face* pFace) -{ - assert(pFace); - return pFace->theSill().numLanguages(); -} - -gr_uint32 gr_face_lang_by_index(const gr_face* pFace, gr_uint16 i) -{ - assert(pFace); - return pFace->theSill().getLangName(i); -} - - -void gr_face_destroy(gr_face *face) -{ - delete face; -} - - -gr_uint16 gr_face_name_lang_for_locale(gr_face *face, const char * locale) -{ - if (face) - { - return face->languageForLocale(locale); - } - return 0; -} - -unsigned short gr_face_n_glyphs(const gr_face* pFace) -{ - return pFace->glyphs().numGlyphs(); -} - -const gr_faceinfo *gr_face_info(const gr_face *pFace, gr_uint32 script) -{ - if (!pFace) return 0; - const Silf *silf = pFace->chooseSilf(script); - if (silf) return silf->silfInfo(); - return 0; -} - -int gr_face_is_char_supported(const gr_face* pFace, gr_uint32 usv, gr_uint32 script) -{ - const Cmap & cmap = pFace->cmap(); - gr_uint16 gid = cmap[usv]; - if (!gid) - { - const Silf * silf = pFace->chooseSilf(script); - gid = silf->findPseudo(usv); - } - return (gid != 0); -} - -#ifndef GRAPHITE2_NFILEFACE -gr_face* gr_make_file_face(const char *filename, unsigned int faceOptions) -{ - FileFace* pFileFace = new FileFace(filename); - if (*pFileFace) - { - gr_face* pRes = gr_make_face_with_ops(pFileFace, &FileFace::ops, faceOptions); - if (pRes) - { - pRes->takeFileFace(pFileFace); //takes ownership - return pRes; - } - } - - //error when loading - - delete pFileFace; - return NULL; -} - -#ifndef GRAPHITE2_NSEGCACHE -gr_face* gr_make_file_face_with_seg_cache(const char* filename, unsigned int segCacheMaxSize, unsigned int faceOptions) //returns NULL on failure. //TBD better error handling - //when finished with, call destroy_face -{ - FileFace* pFileFace = new FileFace(filename); - if (*pFileFace) - { - gr_face * pRes = gr_make_face_with_seg_cache_and_ops(pFileFace, &FileFace::ops, segCacheMaxSize, faceOptions); - if (pRes) - { - pRes->takeFileFace(pFileFace); //takes ownership - return pRes; - } - } - - //error when loading - - delete pFileFace; - return NULL; -} -#endif -#endif //!GRAPHITE2_NFILEFACE - - -} // extern "C" - - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_features.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_features.cpp deleted file mode 100644 index 63c5564ffdd..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_features.cpp +++ /dev/null @@ -1,138 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include "graphite2/Font.h" -#include "inc/Face.h" -#include "inc/FeatureMap.h" -#include "inc/FeatureVal.h" -#include "inc/NameTable.h" - -using namespace graphite2; - -extern "C" { - - -gr_uint16 gr_fref_feature_value(const gr_feature_ref* pfeatureref, const gr_feature_val* feats) //returns 0 if either pointer is NULL -{ - if (!pfeatureref || !feats) return 0; - - return pfeatureref->getFeatureVal(*feats); -} - - -int gr_fref_set_feature_value(const gr_feature_ref* pfeatureref, gr_uint16 val, gr_feature_val* pDest) -{ - if (!pfeatureref || !pDest) return 0; - - return pfeatureref->applyValToFeature(val, *pDest); -} - - -gr_uint32 gr_fref_id(const gr_feature_ref* pfeatureref) //returns 0 if pointer is NULL -{ - if (!pfeatureref) - return 0; - - return pfeatureref->getId(); -} - - -gr_uint16 gr_fref_n_values(const gr_feature_ref* pfeatureref) -{ - if(!pfeatureref) - return 0; - return pfeatureref->getNumSettings(); -} - - -gr_int16 gr_fref_value(const gr_feature_ref* pfeatureref, gr_uint16 settingno) -{ - if(!pfeatureref || (settingno >= pfeatureref->getNumSettings())) - { - return 0; - } - return pfeatureref->getSettingValue(settingno); -} - - -void* gr_fref_label(const gr_feature_ref* pfeatureref, gr_uint16 *langId, gr_encform utf, gr_uint32 *length) -{ - if(!pfeatureref || !pfeatureref->getFace()) - { - langId = 0; - length = 0; - return NULL; - } - uint16 label = pfeatureref->getNameId(); - NameTable * names = pfeatureref->getFace()->nameTable(); - if (!names) - { - langId = 0; - length = 0; - return NULL; - } - return names->getName(*langId, label, utf, *length); -} - - -void* gr_fref_value_label(const gr_feature_ref*pfeatureref, gr_uint16 setting, - gr_uint16 *langId, gr_encform utf, gr_uint32 *length) -{ - if(!pfeatureref || (setting >= pfeatureref->getNumSettings()) || !pfeatureref->getFace()) - { - langId = 0; - length = 0; - return NULL; - } - uint16 label = pfeatureref->getSettingName(setting); - NameTable * names = pfeatureref->getFace()->nameTable(); - if (!names) - { - langId = 0; - length = 0; - return NULL; - } - return names->getName(*langId, label, utf, *length); -} - - -void gr_label_destroy(void * label) -{ - free(label); -} - -gr_feature_val* gr_featureval_clone(const gr_feature_val* pfeatures/*may be NULL*/) -{ //When finished with the Features, call features_destroy - return static_cast(pfeatures ? new Features(*pfeatures) : new Features); -} - -void gr_featureval_destroy(gr_feature_val *p) -{ - delete p; -} - - -} // extern "C" diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_font.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_font.cpp deleted file mode 100644 index 22e4ec9c157..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_font.cpp +++ /dev/null @@ -1,72 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include "graphite2/Font.h" -#include "inc/Font.h" - - -using namespace graphite2; - -extern "C" { - -void gr_engine_version(int *nMajor, int *nMinor, int *nBugFix) -{ - if (nMajor) *nMajor = GR2_VERSION_MAJOR; - if (nMinor) *nMinor = GR2_VERSION_MINOR; - if (nBugFix) *nBugFix = GR2_VERSION_BUGFIX; -} - -gr_font* gr_make_font(float ppm/*pixels per em*/, const gr_face *face) -{ - return gr_make_font_with_advance_fn(ppm, 0, 0, face); -} - - -gr_font* gr_make_font_with_ops(float ppm/*pixels per em*/, const void* appFontHandle/*non-NULL*/, const gr_font_ops * font_ops, const gr_face * face/*needed for scaling*/) -{ //the appFontHandle must stay alive all the time when the gr_font is alive. When finished with the gr_font, call destroy_gr_font - if (face == 0) return 0; - - Font * const res = new Font(ppm, *face, appFontHandle, font_ops); - return static_cast(res); -} - -gr_font* gr_make_font_with_advance_fn(float ppm/*pixels per em*/, const void* appFontHandle/*non-NULL*/, gr_advance_fn getAdvance, const gr_face * face/*needed for scaling*/) -{ - const gr_font_ops ops = {sizeof(gr_font_ops), getAdvance, NULL}; - return gr_make_font_with_ops(ppm, appFontHandle, &ops, face); -} - -void gr_font_destroy(gr_font *font) -{ - delete font; -} - - -} // extern "C" - - - - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_logging.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_logging.cpp deleted file mode 100644 index 2fa6d128b1d..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_logging.cpp +++ /dev/null @@ -1,193 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include - -#include "graphite2/Log.h" -#include "inc/debug.h" -#include "inc/CharInfo.h" -#include "inc/Slot.h" -#include "inc/Segment.h" - -#if defined _WIN32 -#include "windows.h" -#endif - -using namespace graphite2; - - -extern "C" { - - -bool gr_start_logging(gr_face * face, const char *log_path) -{ - if (!face || !log_path) return false; - -#if !defined GRAPHITE2_NTRACING - gr_stop_logging(face); -#if defined _WIN32 - int n = MultiByteToWideChar(CP_UTF8, MB_ERR_INVALID_CHARS, log_path, -1, 0, 0); - if (n == 0 || n > MAX_PATH - 12) return false; - - LPWSTR wlog_path = gralloc(n); - FILE *log = 0; - if (wlog_path && MultiByteToWideChar(CP_UTF8, MB_ERR_INVALID_CHARS, log_path, -1, wlog_path, n)) - log = _wfopen(wlog_path, L"wt"); - - free(wlog_path); -#else - FILE *log = fopen(log_path, "wt"); -#endif - if (!log) return false; - - face->setLogger(log); - if (!face->logger()) return false; - - *face->logger() << json::array; - return true; -#else - return false; -#endif -} - -bool graphite_start_logging(FILE * /* log */, GrLogMask /* mask */) -{ -//#if !defined GRAPHITE2_NTRACING -// graphite_stop_logging(); -// -// if (!log) return false; -// -// dbgout = new json(log); -// if (!dbgout) return false; -// -// *dbgout << json::array; -// return true; -//#else - return false; -//#endif -} - -void gr_stop_logging(gr_face * face) -{ - if (!face) return; - -#if !defined GRAPHITE2_NTRACING - if (face->logger()) - { - FILE * log = face->logger()->stream(); - face->setLogger(0); - fclose(log); - } -#endif -} - -void graphite_stop_logging() -{ -// if (dbgout) delete dbgout; -// dbgout = 0; -} - -} // extern "C" - -#if !defined GRAPHITE2_NTRACING - -json & graphite2::operator << (json & j, const CharInfo & ci) throw() -{ - return j << json::object - << "offset" << ci.base() - << "unicode" << ci.unicodeChar() - << "break" << ci.breakWeight() - << "flags" << ci.flags() - << "slot" << json::flat << json::object - << "before" << ci.before() - << "after" << ci.after() - << json::close - << json::close; -} - - -json & graphite2::operator << (json & j, const dslot & ds) throw() -{ - assert(ds.first); - assert(ds.second); - const Segment & seg = *ds.first; - const Slot & s = *ds.second; - - j << json::object - << "id" << objectid(ds) - << "gid" << s.gid() - << "charinfo" << json::flat << json::object - << "original" << s.original() - << "before" << s.before() - << "after" << s.after() - << json::close - << "origin" << s.origin() - << "shift" << Position(float(s.getAttr(0, gr_slatShiftX, 0)), - float(s.getAttr(0, gr_slatShiftY, 0))) - << "advance" << s.advancePos() - << "insert" << s.isInsertBefore() - << "break" << s.getAttr(&seg, gr_slatBreak, 0); - if (s.just() > 0) - j << "justification" << s.just(); - if (s.getBidiLevel() > 0) - j << "bidi" << s.getBidiLevel(); - if (!s.isBase()) - j << "parent" << json::flat << json::object - << "id" << objectid(dslot(&seg, s.attachedTo())) - << "level" << s.getAttr(0, gr_slatAttLevel, 0) - << "offset" << s.attachOffset() - << json::close; - j << "user" << json::flat << json::array; - for (int n = 0; n!= seg.numAttrs(); ++n) - j << s.userAttrs()[n]; - j << json::close; - if (s.firstChild()) - { - j << "children" << json::flat << json::array; - for (const Slot *c = s.firstChild(); c; c = c->nextSibling()) - j << objectid(dslot(&seg, c)); - j << json::close; - } - return j << json::close; -} - - -graphite2::objectid::objectid(const dslot & ds) throw() -{ - const Slot * const p = ds.second; - uint32 s = reinterpret_cast(p); - sprintf(name, "%.4x-%.2x-%.4hx", uint16(s >> 16), uint16(p ? p->userAttrs()[ds.first->silf()->numUser()] : 0), uint16(s)); - name[sizeof name-1] = 0; -} - -graphite2::objectid::objectid(const Segment * const p) throw() -{ - uint32 s = reinterpret_cast(p); - sprintf(name, "%.4x-%.2x-%.4hx", uint16(s >> 16), 0, uint16(s)); - name[sizeof name-1] = 0; -} - -#endif diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_segment.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_segment.cpp deleted file mode 100644 index 6eca66b4a0b..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_segment.cpp +++ /dev/null @@ -1,174 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include "graphite2/Segment.h" -#include "inc/UtfCodec.h" -#include "inc/Segment.h" - -using namespace graphite2; - -namespace -{ - - gr_segment* makeAndInitialize(const Font *font, const Face *face, uint32 script, const Features* pFeats/*must not be NULL*/, gr_encform enc, const void* pStart, size_t nChars, int dir) - { - if (script == 0x20202020) script = 0; - else if ((script & 0x00FFFFFF) == 0x00202020) script = script & 0xFF000000; - else if ((script & 0x0000FFFF) == 0x00002020) script = script & 0xFFFF0000; - else if ((script & 0x000000FF) == 0x00000020) script = script & 0xFFFFFF00; - // if (!font) return NULL; - Segment* pRes=new Segment(nChars, face, script, dir); - - pRes->read_text(face, pFeats, enc, pStart, nChars); - if (!pRes->runGraphite()) - { - delete pRes; - return NULL; - } - // run the line break passes - // run the substitution passes - pRes->prepare_pos(font); - // run the positioning passes - pRes->finalise(font); - - return static_cast(pRes); - } - - -} - - -template -inline size_t count_unicode_chars(utf_iter first, const utf_iter last, const void **error) -{ - size_t n_chars = 0; - uint32 usv = 0; - - if (last) - { - for (;first != last; ++first, ++n_chars) - if ((usv = *first) == 0 || first.error()) break; - } - else - { - while ((usv = *first) != 0 && !first.error()) - { - ++first; - ++n_chars; - } - } - - if (error) *error = first.error() ? first : 0; - return n_chars; -} - -extern "C" { - -size_t gr_count_unicode_characters(gr_encform enc, const void* buffer_begin, const void* buffer_end/*don't go on or past end, If NULL then ignored*/, const void** pError) //Also stops on nul. Any nul is not in the count -{ - assert(buffer_begin); - - switch (enc) - { - case gr_utf8: return count_unicode_chars(buffer_begin, buffer_end, pError); break; - case gr_utf16: return count_unicode_chars(buffer_begin, buffer_end, pError); break; - case gr_utf32: return count_unicode_chars(buffer_begin, buffer_end, pError); break; - default: return 0; - } -} - - -gr_segment* gr_make_seg(const gr_font *font, const gr_face *face, gr_uint32 script, const gr_feature_val* pFeats, gr_encform enc, const void* pStart, size_t nChars, int dir) -{ - const gr_feature_val * tmp_feats = 0; - if (pFeats == 0) - pFeats = tmp_feats = static_cast(face->theSill().cloneFeatures(0)); - gr_segment * seg = makeAndInitialize(font, face, script, pFeats, enc, pStart, nChars, dir); - delete tmp_feats; - - return seg; -} - - -void gr_seg_destroy(gr_segment* p) -{ - delete p; -} - - -float gr_seg_advance_X(const gr_segment* pSeg/*not NULL*/) -{ - assert(pSeg); - return pSeg->advance().x; -} - - -float gr_seg_advance_Y(const gr_segment* pSeg/*not NULL*/) -{ - assert(pSeg); - return pSeg->advance().y; -} - - -unsigned int gr_seg_n_cinfo(const gr_segment* pSeg/*not NULL*/) -{ - assert(pSeg); - return pSeg->charInfoCount(); -} - - -const gr_char_info* gr_seg_cinfo(const gr_segment* pSeg/*not NULL*/, unsigned int index/*must be (pSeg->charinfo(index)); -} - -unsigned int gr_seg_n_slots(const gr_segment* pSeg/*not NULL*/) -{ - assert(pSeg); - return pSeg->slotCount(); -} - -const gr_slot* gr_seg_first_slot(gr_segment* pSeg/*not NULL*/) -{ - assert(pSeg); - return static_cast(pSeg->first()); -} - -const gr_slot* gr_seg_last_slot(gr_segment* pSeg/*not NULL*/) -{ - assert(pSeg); - return static_cast(pSeg->last()); -} - -float gr_seg_justify(gr_segment* pSeg/*not NULL*/, const gr_slot* pSlot/*not NULL*/, const gr_font *pFont, double width, enum gr_justFlags flags, const gr_slot *pFirst, const gr_slot *pLast) -{ - assert(pSeg); - assert(pSlot); - return pSeg->justify(const_cast(pSlot), pFont, float(width), justFlags(flags), const_cast(pFirst), const_cast(pLast)); -} - -} // extern "C" diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_slot.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_slot.cpp deleted file mode 100644 index c615e40ffe5..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/gr_slot.cpp +++ /dev/null @@ -1,173 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#include "graphite2/Segment.h" -#include "inc/Segment.h" -#include "inc/Slot.h" -#include "inc/Font.h" - - -extern "C" { - - -const gr_slot* gr_slot_next_in_segment(const gr_slot* p/*not NULL*/) -{ - assert(p); - return static_cast(p->next()); -} - -const gr_slot* gr_slot_prev_in_segment(const gr_slot* p/*not NULL*/) -{ - assert(p); - return static_cast(p->prev()); -} - -const gr_slot* gr_slot_attached_to(const gr_slot* p/*not NULL*/) //returns NULL iff base. If called repeatedly on result, will get to a base -{ - assert(p); - return static_cast(p->attachedTo()); -} - - -const gr_slot* gr_slot_first_attachment(const gr_slot* p/*not NULL*/) //returns NULL iff no attachments. -{ //if slot_first_attachment(p) is not NULL, then slot_attached_to(slot_first_attachment(p))==p. - assert(p); - return static_cast(p->firstChild()); -} - - -const gr_slot* gr_slot_next_sibling_attachment(const gr_slot* p/*not NULL*/) //returns NULL iff no more attachments. -{ //if slot_next_sibling_attachment(p) is not NULL, then slot_attached_to(slot_next_sibling_attachment(p))==slot_attached_to(p). - assert(p); - return static_cast(p->nextSibling()); -} - - -unsigned short gr_slot_gid(const gr_slot* p/*not NULL*/) -{ - assert(p); - return p->glyph(); -} - - -float gr_slot_origin_X(const gr_slot* p/*not NULL*/) -{ - assert(p); - return p->origin().x; -} - - -float gr_slot_origin_Y(const gr_slot* p/*not NULL*/) -{ - assert(p); - return p->origin().y; -} - - -float gr_slot_advance_X(const gr_slot* p/*not NULL*/, const gr_face *face, const gr_font *font) -{ - assert(p); - float scale = 1.0; - float res = p->advance(); - if (font) - { - scale = font->scale(); - if (face && font->isHinted()) - res = (res - face->glyphs().glyph(p->gid())->theAdvance().x) * scale + font->advance(p->gid()); - else - res = res * scale; - } - return res; -} - -float gr_slot_advance_Y(const gr_slot *p/*not NULL*/, const gr_face *face, const gr_font *font) -{ - assert(p); - float res = p->advancePos().y; - if (font && (face || !face)) - return res * font->scale(); - else - return res; -} - -int gr_slot_before(const gr_slot* p/*not NULL*/) -{ - assert(p); - return p->before(); -} - - -int gr_slot_after(const gr_slot* p/*not NULL*/) -{ - assert(p); - return p->after(); -} - -unsigned int gr_slot_index(const gr_slot *p/*not NULL*/) -{ - assert(p); - return p->index(); -} - -int gr_slot_attr(const gr_slot* p/*not NULL*/, const gr_segment* pSeg/*not NULL*/, gr_attrCode index, gr_uint8 subindex) -{ - assert(p); - return p->getAttr(pSeg, index, subindex); -} - - -int gr_slot_can_insert_before(const gr_slot* p/*not NULL*/) -{ - assert(p); - return (p->isInsertBefore())? 1 : 0; -} - - -int gr_slot_original(const gr_slot* p/*not NULL*/) -{ - assert(p); - return p->original(); -} - -void gr_slot_linebreak_before(gr_slot* p/*not NULL*/) -{ - assert(p); - gr_slot *prev = (gr_slot *)p->prev(); - prev->sibling(NULL); - prev->next(NULL); - p->prev(NULL); -} - -#if 0 //what should this be -size_t id(const gr_slot* p/*not NULL*/) -{ - return (size_t)p->id(); -} -#endif - - -} // extern "C" - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/CachedFace.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/CachedFace.h deleted file mode 100644 index 53674754ee2..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/CachedFace.h +++ /dev/null @@ -1,56 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - -#ifndef GRAPHITE2_NSEGCACHE - -#include "inc/Face.h" - -namespace graphite2 { - -class SegCacheStore; -class SegCache; - -class CachedFace : public Face -{ - CachedFace(const CachedFace &); - CachedFace & operator = (const CachedFace &); - -public: - CachedFace(const void* appFaceHandle/*non-NULL*/, const gr_face_ops & ops); - bool setupCache(unsigned int cacheSize); - virtual ~CachedFace(); - virtual bool runGraphite(Segment *seg, const Silf *silf) const; - SegCacheStore * cacheStore() { return m_cacheStore; } -private: - SegCacheStore * m_cacheStore; -}; - -} // namespace graphite2 - -#endif - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/CharInfo.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/CharInfo.h deleted file mode 100644 index 2debaf73477..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/CharInfo.h +++ /dev/null @@ -1,67 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once -#include "inc/Main.h" - - -namespace graphite2 { - -class CharInfo -{ - -public: - CharInfo() : m_char(0), m_before(-1), m_after(0), m_base(0), m_featureid(0), m_break(0), m_flags(0) {} - void init(int cid) { m_char = cid; } - unsigned int unicodeChar() const { return m_char; } - void feats(int offset) { m_featureid = offset; } - int fid() const { return m_featureid; } - int breakWeight() const { return m_break; } - void breakWeight(int val) { m_break = val; } - int after() const { return m_after; } - void after(int val) { m_after = val; } - int before() const { return m_before; } - void before(int val) { m_before = val; } - size_t base() const { return m_base; } - void base(size_t offset) { m_base = offset; } - void addflags(uint8 val) { m_flags |= val; } - uint8 flags() const { return m_flags; } - - CLASS_NEW_DELETE -private: - int m_char; // Unicode character from character stream - int m_before; // slot index before us, comes before - int m_after; // slot index after us, comes after - size_t m_base; // offset into input string corresponding to this charinfo - uint8 m_featureid; // index into features list in the segment - int8 m_break; // breakweight coming from lb table - uint8 m_flags; // 0,1 segment split. -}; - -} // namespace graphite2 - -struct gr_char_info : public graphite2::CharInfo {}; - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/CmapCache.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/CmapCache.h deleted file mode 100644 index a7df78ea568..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/CmapCache.h +++ /dev/null @@ -1,82 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - -#include "inc/Main.h" -#include "inc/Face.h" - -namespace graphite2 { - -class Face; - -class Cmap -{ -public: - - virtual ~Cmap() throw() {} - - virtual uint16 operator [] (const uint32) const throw() { return 0; } - - virtual operator bool () const throw() { return false; } - - CLASS_NEW_DELETE; -}; - -class DirectCmap : public Cmap -{ - DirectCmap(const DirectCmap &); - DirectCmap & operator = (const DirectCmap &); - -public: - DirectCmap(const Face &); - virtual uint16 operator [] (const uint32 usv) const throw(); - virtual operator bool () const throw(); - - CLASS_NEW_DELETE; -private: - const Face::Table _cmap; - const void * _smp, - * _bmp; -}; - -class CachedCmap : public Cmap -{ - CachedCmap(const CachedCmap &); - CachedCmap & operator = (const CachedCmap &); - -public: - CachedCmap(const Face &); - virtual ~CachedCmap() throw(); - virtual uint16 operator [] (const uint32 usv) const throw(); - virtual operator bool () const throw(); - CLASS_NEW_DELETE; -private: - bool m_isBmpOnly; - uint16 ** m_blocks; -}; - -} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Code.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Code.h deleted file mode 100644 index d9539b0da24..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Code.h +++ /dev/null @@ -1,175 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -// This class represents loaded graphite stack machine code. It performs -// basic sanity checks, on the incoming code to prevent more obvious problems -// from crashing graphite. -// Author: Tim Eves - -#pragma once - -#include -#include -#include "inc/Main.h" -#include "inc/Machine.h" - -namespace graphite2 { - -class Silf; -class Face; - -namespace vm { - -class Machine::Code -{ -public: - enum status_t - { - loaded, - alloc_failed, - invalid_opcode, - unimplemented_opcode_used, - out_of_range_data, - jump_past_end, - arguments_exhausted, - missing_return, - nested_context_item - }; - -private: - class decoder; - - instr * _code; - byte * _data; - size_t _data_size, - _instr_count; - byte _max_ref; - mutable status_t _status; - bool _constraint, - _modify, - _delete; - mutable bool _own; - - void release_buffers() throw (); - void failure(const status_t) throw(); - -public: - Code() throw(); - Code(bool is_constraint, const byte * bytecode_begin, const byte * const bytecode_end, - uint8 pre_context, uint16 rule_length, const Silf &, const Face &); - Code(const Machine::Code &) throw(); - ~Code() throw(); - - Code & operator=(const Code &rhs) throw(); - operator bool () const throw(); - status_t status() const throw(); - bool constraint() const throw(); - size_t dataSize() const throw(); - size_t instructionCount() const throw(); - bool immutable() const throw(); - bool deletes() const throw(); - size_t maxRef() const throw(); - - int32 run(Machine &m, slotref * & map) const; - - CLASS_NEW_DELETE; -}; - -inline Machine::Code::Code() throw() -: _code(0), _data(0), _data_size(0), _instr_count(0), _max_ref(0), - _status(loaded), _constraint(false), _modify(false),_delete(false), - _own(false) -{ -} - -inline Machine::Code::Code(const Machine::Code &obj) throw () - : _code(obj._code), - _data(obj._data), - _data_size(obj._data_size), - _instr_count(obj._instr_count), - _max_ref(obj._max_ref), - _status(obj._status), - _constraint(obj._constraint), - _modify(obj._modify), - _delete(obj._delete), - _own(obj._own) -{ - obj._own = false; -} - -inline Machine::Code & Machine::Code::operator=(const Machine::Code &rhs) throw() { - if (_instr_count > 0) - release_buffers(); - _code = rhs._code; - _data = rhs._data; - _data_size = rhs._data_size; - _instr_count = rhs._instr_count; - _status = rhs._status; - _constraint = rhs._constraint; - _modify = rhs._modify; - _delete = rhs._delete; - _own = rhs._own; - rhs._own = false; - return *this; -} - -inline Machine::Code::operator bool () const throw () { - return _code && status() == loaded; -} - -inline Machine::Code::status_t Machine::Code::status() const throw() { - return _status; -} - -inline bool Machine::Code::constraint() const throw() { - return _constraint; -} - -inline size_t Machine::Code::dataSize() const throw() { - return _data_size; -} - -inline size_t Machine::Code::instructionCount() const throw() { - return _instr_count; -} - -inline bool Machine::Code::immutable() const throw() -{ - return !(_delete || _modify); -} - -inline bool Machine::Code::deletes() const throw() -{ - return _delete; -} - -inline size_t Machine::Code::maxRef() const throw() -{ - return _max_ref; -} - -} // namespace vm -} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Endian.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Endian.h deleted file mode 100644 index 16ff79f5519..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Endian.h +++ /dev/null @@ -1,107 +0,0 @@ -/*----------------------------------------------------------------------------- -Copyright (C) 2011 SIL International -Responsibility: Tim Eves - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. - -Description: -A set of fast template based decoders for decoding values of any C integer -type up to long int size laid out with most significant byte first or least -significant byte first (aka big endian or little endian). These are CPU -byte order agnostic and will function the same regardless of the CPUs native -byte order. -Being template based means if the either le or be class is not used then -template code of unused functions will not be instantiated by the compiler -and thus shouldn't cause any overhead. ------------------------------------------------------------------------------*/ -#include - -#pragma once - - -class be -{ - template - inline static unsigned long int _peek(const unsigned char * p) { - return _peek(p) << (S/2)*8 | _peek(p+S/2); - } -public: - template - inline static T peek(const void * p) { - return T(_peek(static_cast(p))); - } - - template - inline static T read(const unsigned char * &p) { - const T r = T(_peek(p)); - p += sizeof r; - return r; - } - - template - inline static T swap(const T x) { - return T(_peek(reinterpret_cast(&x))); - } - - template - inline static void skip(const unsigned char * &p, size_t n=1) { - p += sizeof(T)*n; - } -}; - -template<> -inline unsigned long int be::_peek<1>(const unsigned char * p) { return *p; } - - -class le -{ - template - inline static unsigned long int _peek(const unsigned char * p) { - return _peek(p) | _peek(p+S/2) << (S/2)*8; - } -public: - template - inline static T peek(const void * p) { - return T(_peek(static_cast(p))); - } - - template - inline static T read(const unsigned char * &p) { - const T r = T(_peek(p)); - p += sizeof r; - return r; - } - - template - inline static T swap(const T x) { - return T(_peek(reinterpret_cast(&x))); - } - - template - inline static void skip(const unsigned char * &p, size_t n=1) { - p += sizeof(T)*n; - } -}; - -template<> -inline unsigned long int le::_peek<1>(const unsigned char * p) { return *p; } - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Face.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Face.h deleted file mode 100644 index d84ea92fc07..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Face.h +++ /dev/null @@ -1,206 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - -#include - -#include "graphite2/Font.h" - -#include "inc/Main.h" -#include "inc/FeatureMap.h" -#include "inc/TtfUtil.h" -#include "inc/Silf.h" - -namespace graphite2 { - -class Cmap; -class FileFace; -class GlyphCache; -class NameTable; -class json; - -using TtfUtil::Tag; - -// These are the actual tags, as distinct from the consecutive IDs in TtfUtil.h - -class Face -{ - // Prevent any kind of copying - Face(const Face&); - Face& operator=(const Face&); - -public: - class Table; - static float default_glyph_advance(const void* face_ptr, gr_uint16 glyphid); - - Face(const void* appFaceHandle/*non-NULL*/, const gr_face_ops & ops); - virtual ~Face(); - - virtual bool runGraphite(Segment *seg, const Silf *silf) const; - -public: - bool readGlyphs(uint32 faceOptions); - bool readGraphite(const Table & silf); - bool readFeatures(); - void takeFileFace(FileFace* pFileFace/*takes ownership*/); - - const SillMap & theSill() const; - const GlyphCache & glyphs() const; - Cmap & cmap() const; - NameTable * nameTable() const; - void setLogger(FILE *log_file); - json * logger() const throw(); - - const Silf * chooseSilf(uint32 script) const; - uint16 languageForLocale(const char * locale) const; - - // Features - uint16 numFeatures() const; - const FeatureRef * featureById(uint32 id) const; - const FeatureRef * feature(uint16 index) const; - - // Glyph related - uint16 getGlyphMetric(uint16 gid, uint8 metric) const; - uint16 findPseudo(uint32 uid) const; - - CLASS_NEW_DELETE; -private: - SillMap m_Sill; - gr_face_ops m_ops; - const void * m_appFaceHandle; // non-NULL - FileFace * m_pFileFace; //owned - mutable GlyphCache * m_pGlyphFaceCache; // owned - never NULL - mutable Cmap * m_cmap; // cmap cache if available - mutable NameTable * m_pNames; - mutable json * m_logger; -protected: - Silf * m_silfs; // silf subtables. - uint16 m_numSilf; // num silf subtables in the silf table -private: - uint16 m_ascent, - m_descent; -}; - - - -inline -const SillMap & Face::theSill() const -{ - return m_Sill; -} - -inline -uint16 Face::numFeatures() const -{ - return m_Sill.theFeatureMap().numFeats(); -} - -inline -const FeatureRef * Face::featureById(uint32 id) const -{ - return m_Sill.theFeatureMap().findFeatureRef(id); -} - -inline -const FeatureRef *Face::feature(uint16 index) const -{ - return m_Sill.theFeatureMap().feature(index); -} - -inline -const GlyphCache & Face::glyphs() const -{ - return *m_pGlyphFaceCache; -} - -inline -Cmap & Face::cmap() const -{ - return *m_cmap; -}; - -inline -json * Face::logger() const throw() -{ - return m_logger; -} - - - -class Face::Table -{ - const Face * _f; - mutable const byte * _p; - uint32 _sz; - -public: - Table() throw(); - Table(const Face & face, const Tag n) throw(); - Table(const Table & rhs) throw(); - ~Table() throw(); - - operator const byte * () const throw(); - - Table & operator = (const Table & rhs) throw(); - size_t size() const throw(); -}; - -inline -Face::Table::Table() throw() -: _f(0), _p(0), _sz(0) -{ -} - -inline -Face::Table::Table(const Table & rhs) throw() -: _f(rhs._f), _p(rhs._p), _sz(rhs._sz) -{ - rhs._p = 0; -} - -inline -Face::Table::~Table() throw() -{ - if (_p && _f->m_ops.release_table) - (*_f->m_ops.release_table)(_f->m_appFaceHandle, _p); -} - -inline -Face::Table::operator const byte * () const throw() -{ - return _p; -} - -inline -size_t Face::Table::size() const throw() -{ - return _sz; -} - -} // namespace graphite2 - -struct gr_face : public graphite2::Face {}; diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/FeatureMap.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/FeatureMap.h deleted file mode 100644 index ffc58c9b19a..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/FeatureMap.h +++ /dev/null @@ -1,187 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once -// #include -// #include "graphite2/Types.h" -//#include "graphite2/Font.h" -#include "inc/Main.h" -#include "inc/FeatureVal.h" - -namespace graphite2 { - -// Forward declarations for implmentation types -class FeatureMap; -class Face; - - -class FeatureSetting -{ -public: - FeatureSetting(int16 theValue, uint16 labelId) : m_label(labelId), m_value(theValue) {}; - uint16 label() const { return m_label; } - int16 value() const { return m_value; } - - CLASS_NEW_DELETE; -private: - FeatureSetting(const FeatureSetting & fs) : m_label(fs.m_label), m_value(fs.m_value) {}; - - uint16 m_label; - int16 m_value; -}; - -class FeatureRef -{ - typedef uint32 chunk_t; - static const uint8 SIZEOF_CHUNK = sizeof(chunk_t)*8; - -public: - FeatureRef() : m_nameValues(0) {} - FeatureRef(const Face & face, unsigned short & bits_offset, uint32 max_val, - uint32 name, uint16 uiName, uint16 flags, - FeatureSetting *settings, uint16 num_set) throw(); - ~FeatureRef() throw(); - - bool applyValToFeature(uint32 val, Features& pDest) const; //defined in GrFaceImp.h - void maskFeature(Features & pDest) const { - if (m_index < pDest.size()) //defensive - pDest[m_index] |= m_mask; - } - - uint32 getFeatureVal(const Features& feats) const; //defined in GrFaceImp.h - - uint32 getId() const { return m_id; } - uint16 getNameId() const { return m_nameid; } - uint16 getNumSettings() const { return m_numSet; } - uint16 getSettingName(uint16 index) const { return m_nameValues[index].label(); } - int16 getSettingValue(uint16 index) const { return m_nameValues[index].value(); } - uint32 maxVal() const { return m_max; } - const Face* getFace() const { return m_pFace;} - const FeatureMap* getFeatureMap() const;// { return m_pFace;} - - CLASS_NEW_DELETE; -private: - FeatureRef(const FeatureRef & rhs); - - const Face * m_pFace; //not NULL - FeatureSetting * m_nameValues; // array of name table ids for feature values - chunk_t m_mask, // bit mask to get the value from the vector - m_max; // max value the value can take - uint32 m_id; // feature identifier/name - uint16 m_nameid, // Name table id for feature name - m_flags, // feature flags (unused at the moment but read from the font) - m_numSet; // number of values (number of entries in m_nameValues) - byte m_bits, // how many bits to shift the value into place - m_index; // index into the array to find the ulong to mask - -private: //unimplemented - FeatureRef& operator=(const FeatureRef&); -}; - - -class NameAndFeatureRef -{ - public: - NameAndFeatureRef(uint32 name = 0) : m_name(name) , m_pFRef(NULL){} - NameAndFeatureRef(const FeatureRef* p/*not NULL*/) : m_name(p->getId()), m_pFRef(p) {} - - bool operator<(const NameAndFeatureRef& rhs) const //orders by m_name - { return m_name -#include -#include "inc/Main.h" -#include "inc/List.h" - -namespace graphite2 { - -class FeatureRef; -class FeatureMap; - -class FeatureVal : public Vector -{ -public: - FeatureVal() : m_pMap(0) { } - FeatureVal(int num, const FeatureMap & pMap) : Vector(num), m_pMap(&pMap) {} - FeatureVal(const FeatureVal & rhs) : Vector(rhs), m_pMap(rhs.m_pMap) {} - - FeatureVal & operator = (const FeatureVal & rhs) { Vector::operator = (rhs); m_pMap = rhs.m_pMap; return *this; } - - bool operator ==(const FeatureVal & b) const - { - size_t n = size(); - if (n != b.size()) return false; - - for(const_iterator l = begin(), r = b.begin(); n && *l == *r; --n, ++l, ++r); - - return n == 0; - } - - CLASS_NEW_DELETE -private: - friend class FeatureRef; //so that FeatureRefs can manipulate m_vec directly - const FeatureMap* m_pMap; -}; - -typedef FeatureVal Features; - -} // namespace graphite2 - - -struct gr_feature_val : public graphite2::FeatureVal {}; diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/FileFace.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/FileFace.h deleted file mode 100644 index 05e56d64543..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/FileFace.h +++ /dev/null @@ -1,80 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - -//#include "inc/FeatureMap.h" -//#include "inc/GlyphsCache.h" -//#include "inc/Silf.h" - -#ifndef GRAPHITE2_NFILEFACE - -#include -#include - -#include "graphite2/Font.h" - -#include "inc/Main.h" -#include "inc/TtfTypes.h" -#include "inc/TtfUtil.h" - -namespace graphite2 { - - -class FileFace -{ - static const void * get_table_fn(const void* appFaceHandle, unsigned int name, size_t *len); - static void rel_table_fn(const void* appFaceHandle, const void *table_buffer); - -public: - static const gr_face_ops ops; - - FileFace(const char *filename); - ~FileFace(); - - operator bool () const throw(); - CLASS_NEW_DELETE; - -private: //defensive - FILE * _file; - size_t _file_len; - - TtfUtil::Sfnt::OffsetSubTable * _header_tbl; - TtfUtil::Sfnt::OffsetSubTable::Entry * _table_dir; - - FileFace(const FileFace&); - FileFace& operator=(const FileFace&); -}; - -inline -FileFace::operator bool() const throw() -{ - return _file && _header_tbl && _table_dir; -} - -} // namespace graphite2 - -#endif //!GRAPHITE2_NFILEFACE diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Font.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Font.h deleted file mode 100644 index 650bc7cd8c4..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Font.h +++ /dev/null @@ -1,89 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once -#include -#include "graphite2/Font.h" -#include "inc/Main.h" -#include "inc/Face.h" - -namespace graphite2 { - -#define INVALID_ADVANCE -1e38f // can't be a static const because non-integral - -class Font -{ -public: - Font(float ppm, const Face & face, const void * appFontHandle=0, const gr_font_ops * ops=0); - virtual ~Font(); - - float advance(unsigned short glyphid) const; - float scale() const; - bool isHinted() const; - const Face & face() const; - - CLASS_NEW_DELETE; -private: - gr_font_ops m_ops; - const void * const m_appFontHandle; - float * m_advances; // One advance per glyph in pixels. Nan if not defined - const Face & m_face; - float m_scale; // scales from design units to ppm - bool m_hinted; - - Font(const Font&); - Font& operator=(const Font&); -}; - -inline -float Font::advance(unsigned short glyphid) const -{ - if (m_advances[glyphid] == INVALID_ADVANCE) - m_advances[glyphid] = (*m_ops.glyph_advance_x)(m_appFontHandle, glyphid); - return m_advances[glyphid]; -} - -inline -float Font::scale() const -{ - return m_scale; -} - -inline -bool Font::isHinted() const -{ - return m_hinted; -} - -inline -const Face & Font::face() const -{ - return m_face; -} - -} // namespace graphite2 - -struct gr_font : public graphite2::Font {}; diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/GlyphCache.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/GlyphCache.h deleted file mode 100644 index 4f000dca698..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/GlyphCache.h +++ /dev/null @@ -1,93 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - - -#include "graphite2/Font.h" -#include "inc/Main.h" - -namespace graphite2 { - -class Face; -class FeatureVal; -class GlyphFace; -class Segment; - -class GlyphCache -{ - class Loader; - - GlyphCache(const GlyphCache&); - GlyphCache& operator=(const GlyphCache&); - -public: - GlyphCache(const Face & face, const uint32 face_options); - ~GlyphCache(); - - size_t numGlyphs() const throw(); - size_t numAttrs() const throw(); - size_t unitsPerEm() const throw(); - - const GlyphFace *glyph(unsigned short glyphid) const; //result may be changed by subsequent call with a different glyphid - const GlyphFace *glyphSafe(unsigned short glyphid) const; - uint16 glyphAttr(uint16 gid, uint16 gattr) const; - - CLASS_NEW_DELETE; - -private: - const Loader * _glyph_loader; - const GlyphFace * * _glyphs; - unsigned short _num_glyphs, - _num_attrs, - _upem; -}; - -inline -size_t GlyphCache::numGlyphs() const throw() -{ - return _num_glyphs; -} - -inline -size_t GlyphCache::numAttrs() const throw() -{ - return _num_attrs; -} - -inline -size_t GlyphCache::unitsPerEm() const throw() -{ - return _upem; -} - -inline -const GlyphFace *GlyphCache::glyphSafe(unsigned short glyphid) const -{ - return glyphid < _num_glyphs ? glyph(glyphid) : NULL; -} - -} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/GlyphFace.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/GlyphFace.h deleted file mode 100644 index 89ed5aea91a..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/GlyphFace.h +++ /dev/null @@ -1,83 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - -#include "inc/Main.h" -#include "inc/Position.h" -#include "inc/Sparse.h" - -namespace graphite2 { - -enum metrics { - kgmetLsb = 0, kgmetRsb, - kgmetBbTop, kgmetBbBottom, kgmetBbLeft, kgmetBbRight, - kgmetBbHeight, kgmetBbWidth, - kgmetAdvWidth, kgmetAdvHeight, - kgmetAscent, kgmetDescent -}; - - -class GlyphFace -{ -public: - GlyphFace(); - template - GlyphFace(const Rect & bbox, const Position & adv, I first, const I last); - - const Position & theAdvance() const; - const Rect & theBBox() const { return m_bbox; } - const sparse & attrs() const { return m_attrs; } - uint16 getMetric(uint8 metric) const; - - CLASS_NEW_DELETE; -private: - Rect m_bbox; // bounding box metrics in design units - Position m_advance; // Advance width and height in design units - sparse m_attrs; -}; - - -// Inlines: class GlyphFace -// -inline -GlyphFace::GlyphFace() -{} - -template -GlyphFace::GlyphFace(const Rect & bbox, const Position & adv, I first, const I last) -: m_bbox(bbox), - m_advance(adv), - m_attrs(first, last) -{ -} - -inline -const Position & GlyphFace::theAdvance() const { - return m_advance; -} - -} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/List.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/List.h deleted file mode 100644 index f99036912d8..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/List.h +++ /dev/null @@ -1,155 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ - -// designed to have a limited subset of the std::vector api -#pragma once - -#include -#include -#include -#include -#include - - -namespace graphite2 { - -template -inline -ptrdiff_t distance(T* first, T* last) { return last-first; } - - -template -class Vector -{ - T * m_first, *m_last, *m_end; -public: - typedef T & reference; - typedef const T & const_reference; - typedef T * iterator; - typedef const T * const_iterator; - - Vector() : m_first(0), m_last(0), m_end(0) {} - Vector(size_t n, const T& value = T()) : m_first(0), m_last(0), m_end(0) { insert(begin(), n, value); } - Vector(const Vector &rhs) : m_first(0), m_last(0), m_end(0) { insert(begin(), rhs.begin(), rhs.end()); } - template - Vector(I first, const I last) : m_first(0), m_last(0), m_end(0) { insert(begin(), first, last); } - ~Vector() { clear(); free(m_first); } - - iterator begin() { return m_first; } - const_iterator begin() const { return m_first; } - - iterator end() { return m_last; } - const_iterator end() const { return m_last; } - - bool empty() const { return m_first == m_last; } - size_t size() const { return m_last - m_first; } - size_t capacity() const{ return m_end - m_first; } - - void reserve(size_t n); - - reference front() { assert(size() > 0); return *begin(); } - const_reference front() const { assert(size() > 0); return *begin(); } - reference back() { assert(size() > 0); return *(end()-1); } - const_reference back() const { assert(size() > 0); return *(end()-1); } - - Vector & operator = (const Vector & rhs) { assign(rhs.begin(), rhs.end()); return *this; } - reference operator [] (size_t n) { assert(size() > n); return m_first[n]; } - const_reference operator [] (size_t n) const { assert(size() > n); return m_first[n]; } - - void assign(size_t n, const T& u) { clear(); insert(begin(), n, u); } - void assign(const_iterator first, const_iterator last) { clear(); insert(begin(), first, last); } - iterator insert(iterator p, const T & x) { p = _insert_default(p, 1); *p = x; return p; } - void insert(iterator p, size_t n, const T & x); - void insert(iterator p, const_iterator first, const_iterator last); - void pop_back() { assert(size() > 0); --m_last; } - void push_back(const T &v) { if (m_last == m_end) reserve(size()+1); new (m_last++) T(v); } - - void clear() { erase(begin(), end()); } - iterator erase(iterator p) { return erase(p, p+1); } - iterator erase(iterator first, iterator last); - -private: - iterator _insert_default(iterator p, size_t n); -}; - -template -inline -void Vector::reserve(size_t n) -{ - if (n > capacity()) - { - const ptrdiff_t sz = size(); - m_first = static_cast(realloc(m_first, n*sizeof(T))); - m_last = m_first + sz; - m_end = m_first + n; - } -} - -template -inline -typename Vector::iterator Vector::_insert_default(iterator p, size_t n) -{ - assert(begin() <= p && p <= end()); - const ptrdiff_t i = p - begin(); - reserve((size() + n + 7) >> 3 << 3); - p = begin() + i; - // Move tail if there is one - if (p != end()) memmove(p + n, p, distance(p,end())*sizeof(T)); - m_last += n; - return p; -} - -template -inline -void Vector::insert(iterator p, size_t n, const T & x) -{ - p = _insert_default(p, n); - // Copy in elements - for (; n; --n, ++p) { new (p) T(x); } -} - -template -inline -void Vector::insert(iterator p, const_iterator first, const_iterator last) -{ - p = _insert_default(p, distance(first, last)); - // Copy in elements - for (;first != last; ++first, ++p) { new (p) T(*first); } -} - -template -inline -typename Vector::iterator Vector::erase(iterator first, iterator last) -{ - for (iterator e = first; e != last; ++e) e->~T(); - const size_t sz = distance(first, last); - if (m_last != last) memmove(first, last, distance(last,end())*sizeof(T)); - m_last -= sz; - return first; -} - -} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Machine.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Machine.h deleted file mode 100644 index 72a7e761681..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Machine.h +++ /dev/null @@ -1,197 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -// This general interpreter interface. -// Author: Tim Eves - -// Build one of direct_machine.cpp or call_machine.cpp to implement this -// interface. - -#pragma once -#include -#include -#include "inc/Main.h" - -#if defined(__GNUC__) -#if defined(__clang__) || (__GNUC__ * 100 + __GNUC_MINOR__) < 403 -#define HOT -#if defined(__x86_64) -#define REGPARM(n) __attribute__((regparm(n))) -#else -#define REGPARM(n) -#endif -#else -#define HOT __attribute__((hot)) -#if defined(__x86_64) -#define REGPARM(n) __attribute__((hot, regparm(n))) -#else -#define REGPARM(n) -#endif -#endif -#else -#define HOT -#define REGPARM(n) -#endif - -namespace graphite2 { - -// Forward declarations -class Segment; -class Slot; -class SlotMap; - - -namespace vm -{ - - -typedef void * instr; -typedef Slot * slotref; - -enum {VARARGS = 0xff, MAX_NAME_LEN=32}; - -enum opcode { - NOP = 0, - - PUSH_BYTE, PUSH_BYTEU, PUSH_SHORT, PUSH_SHORTU, PUSH_LONG, - - ADD, SUB, MUL, DIV, - MIN_, MAX_, - NEG, - TRUNC8, TRUNC16, - - COND, - - AND, OR, NOT, - EQUAL, NOT_EQ, - LESS, GTR, LESS_EQ, GTR_EQ, - - NEXT, NEXT_N, COPY_NEXT, - PUT_GLYPH_8BIT_OBS, PUT_SUBS_8BIT_OBS, PUT_COPY, - INSERT, DELETE, - ASSOC, - CNTXT_ITEM, - - ATTR_SET, ATTR_ADD, ATTR_SUB, - ATTR_SET_SLOT, - IATTR_SET_SLOT, - PUSH_SLOT_ATTR, PUSH_GLYPH_ATTR_OBS, - PUSH_GLYPH_METRIC, PUSH_FEAT, - PUSH_ATT_TO_GATTR_OBS, PUSH_ATT_TO_GLYPH_METRIC, - PUSH_ISLOT_ATTR, - - PUSH_IGLYPH_ATTR, // not implemented - - POP_RET, RET_ZERO, RET_TRUE, - IATTR_SET, IATTR_ADD, IATTR_SUB, - PUSH_PROC_STATE, PUSH_VERSION, - PUT_SUBS, PUT_SUBS2, PUT_SUBS3, - PUT_GLYPH, PUSH_GLYPH_ATTR, PUSH_ATT_TO_GLYPH_ATTR, - MAX_OPCODE, - // private opcodes for internal use only, comes after all other on disk opcodes - TEMP_COPY = MAX_OPCODE -}; - -struct opcode_t -{ - instr impl[2]; - uint8 param_sz; - char name[MAX_NAME_LEN]; -}; - - -class Machine -{ -public: - typedef int32 stack_t; - static size_t const STACK_ORDER = 10, - STACK_MAX = 1 << STACK_ORDER, - STACK_GUARD = 2; - - class Code; - - enum status_t { - finished = 0, - stack_underflow, - stack_not_empty, - stack_overflow, - slot_offset_out_bounds - }; - - Machine(SlotMap &) throw(); - static const opcode_t * getOpcodeTable() throw(); - - CLASS_NEW_DELETE; - - SlotMap & slotMap() const throw(); - status_t status() const throw(); - operator bool () const throw(); - -private: - void check_final_stack(const stack_t * const sp); - stack_t run(const instr * program, const byte * data, - slotref * & map) HOT; - - SlotMap & _map; - stack_t _stack[STACK_MAX + 2*STACK_GUARD]; - status_t _status; -}; - -inline Machine::Machine(SlotMap & map) throw() -: _map(map), _status(finished) -{ - // Initialise stack guard +1 entries as the stack pointer points to the - // current top of stack, hence the first push will never write entry 0. - // Initialising the guard space like this is unnecessary and is only - // done to keep valgrind happy during fuzz testing. Hopefully loop - // unrolling will flatten this. - for (size_t n = STACK_GUARD + 1; n; --n) _stack[n-1] = 0; -} - -inline SlotMap& Machine::slotMap() const throw() -{ - return _map; -} - -inline Machine::status_t Machine::status() const throw() -{ - return _status; -} - -inline void Machine::check_final_stack(const int32 * const sp) -{ - stack_t const * const base = _stack + STACK_GUARD, - * const limit = base + STACK_MAX; - if (sp < base) _status = stack_underflow; // This should be impossible now. - else if (sp >= limit) _status = stack_overflow; // So should this. - else if (sp != base) _status = stack_not_empty; -} - -} // namespace vm -} // namespace graphite2 - - - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Main.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Main.h deleted file mode 100644 index 6ddaf37dfaf..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Main.h +++ /dev/null @@ -1,75 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - -#include -#include "graphite2/Types.h" - -#ifdef GRAPHITE2_CUSTOM_HEADER -#include GRAPHITE2_CUSTOM_HEADER -#endif - -namespace graphite2 { - -typedef gr_uint8 uint8; -typedef gr_uint8 byte; -typedef gr_uint16 uint16; -typedef gr_uint32 uint32; -typedef gr_int8 int8; -typedef gr_int16 int16; -typedef gr_int32 int32; -typedef size_t uintptr; - -// typesafe wrapper around malloc for simple types -// use free(pointer) to deallocate -template T * gralloc(size_t n) -{ - return reinterpret_cast(malloc(sizeof(T) * n)); -} - -template T * grzeroalloc(size_t n) -{ - return reinterpret_cast(calloc(n, sizeof(T))); -} - -} // namespace graphite2 - -#define CLASS_NEW_DELETE \ - void * operator new (size_t size){ return malloc(size);} \ - void * operator new (size_t, void * p) throw() { return p; } \ - void * operator new[] (size_t size) {return malloc(size);} \ - void * operator new[] (size_t, void * p) throw() { return p; } \ - void operator delete (void * p) throw() { free(p);} \ - void operator delete (void *, void *) throw() {} \ - void operator delete[] (void * p)throw() { free(p); } \ - void operator delete[] (void *, void *) throw() {} - -#ifdef __GNUC__ -#define GR_MAYBE_UNUSED __attribute__((unused)) -#else -#define GR_MAYBE_UNUSED -#endif diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/NameTable.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/NameTable.h deleted file mode 100644 index 0fdbeb4d85f..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/NameTable.h +++ /dev/null @@ -1,65 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - -#include -#include "inc/TtfTypes.h" -#include "inc/locale2lcid.h" - -namespace graphite2 { - -class NameTable -{ - NameTable(const NameTable &); - NameTable & operator = (const NameTable &); - -public: - NameTable(const void * data, size_t length, uint16 platfromId=3, uint16 encodingID = 1); - ~NameTable() { free(const_cast(m_table)); } - enum eNameFallback { - eNoFallback = 0, - eEnUSFallbackOnly = 1, - eEnOrAnyFallback = 2 - }; - uint16 setPlatformEncoding(uint16 platfromId=3, uint16 encodingID = 1); - void * getName(uint16 & languageId, uint16 nameId, gr_encform enc, uint32 & length); - uint16 getLanguageId(const char * bcp47Locale); - - CLASS_NEW_DELETE -private: - uint16 m_platformId; - uint16 m_encodingId; - uint16 m_languageCount; - uint16 m_platformOffset; // offset of first NameRecord with for platform 3, encoding 1 - uint16 m_platformLastRecord; - uint16 m_nameDataLength; - const TtfUtil::Sfnt::FontNames * m_table; - const uint8 * m_nameData; - Locale2Lang m_locale2Lang; -}; - -} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Pass.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Pass.h deleted file mode 100644 index 64d071636d5..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Pass.h +++ /dev/null @@ -1,97 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - -#include -#include "inc/Code.h" - -namespace graphite2 { - -class Segment; -class Face; -class Silf; -struct Rule; -struct RuleEntry; -struct State; -class FiniteStateMachine; - -class Pass -{ -public: - Pass(); - ~Pass(); - - bool readPass(const byte * pPass, size_t pass_length, size_t subtable_base, const Face & face); - void runGraphite(vm::Machine & m, FiniteStateMachine & fsm) const; - void init(Silf *silf) { m_silf = silf; } - byte spaceContextuals() const { return (m_flags & 0x0E) >> 1; } - - CLASS_NEW_DELETE -private: - void findNDoRule(Slot* & iSlot, vm::Machine &, FiniteStateMachine& fsm) const; - int doAction(const vm::Machine::Code* codeptr, Slot * & slot_out, vm::Machine &) const; - bool testPassConstraint(vm::Machine & m) const; - bool testConstraint(const Rule & r, vm::Machine &) const; - bool readFSM(const byte* p, const byte*const pass_start, const size_t max_offset); - bool readRules(const byte * rule_map, const size_t num_entries, - const byte *precontext, const uint16 * sort_key, - const uint16 * o_constraint, const byte *constraint_data, - const uint16 * o_action, const byte * action_data, - const Face &); - bool readStates(const byte * starts, const byte * states, const byte * o_rule_map); - bool readRanges(const byte * ranges, size_t num_ranges); - uint16 glyphToCol(const uint16 gid) const; - bool runFSM(FiniteStateMachine & fsm, Slot * slot) const; - void dumpRuleEventConsidered(const FiniteStateMachine & fsm, const RuleEntry & re) const; - void dumpRuleEventOutput(const FiniteStateMachine & fsm, const Rule & r, Slot * os) const; - void adjustSlot(int delta, Slot * & slot_out, SlotMap &) const; - const Silf* m_silf; - uint16 * m_cols; - Rule * m_rules; // rules - RuleEntry * m_ruleMap; - State * * m_startStates; // prectxt length - State * * m_sTable; - State * m_states; - - byte m_flags; - byte m_iMaxLoop; - uint16 m_numGlyphs; - uint16 m_numRules; - uint16 m_sRows; - uint16 m_sTransition; - uint16 m_sSuccess; - uint16 m_sColumns; - byte m_minPreCtxt; - byte m_maxPreCtxt; - vm::Machine::Code m_cPConstraint; - -private: //defensive - Pass(const Pass&); - Pass& operator=(const Pass&); -}; - -} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Position.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Position.h deleted file mode 100644 index c6f1b755644..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Position.h +++ /dev/null @@ -1,59 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - -namespace graphite2 { - -class Position -{ -public: - Position() : x(0), y(0) { } - Position(const float inx, const float iny) : x(inx), y(iny) {} - Position operator + (const Position& a) const { return Position(x + a.x, y + a.y); } - Position operator - (const Position& a) const { return Position(x - a.x, y - a.y); } - Position operator * (const float m) const { return Position(x * m, y * m); } - Position &operator += (const Position &a) { x += a.x; y += a.y; return *this; } - Position &operator *= (const float m) { x *= m; y *= m; return *this; } - - float x; - float y; -}; - -class Rect -{ -public : - Rect() {} - Rect(const Position& botLeft, const Position& topRight): bl(botLeft), tr(topRight) {} - Rect widen(const Rect& other) { return Rect(Position(bl.x > other.bl.x ? other.bl.x : bl.x, bl.y > other.bl.y ? other.bl.y : bl.y), Position(tr.x > other.tr.x ? tr.x : other.tr.x, tr.y > other.tr.y ? tr.y : other.tr.y)); } - Rect operator + (const Position &a) const { return Rect(Position(bl.x + a.x, bl.y + a.y), Position(tr.x + a.x, tr.y + a.y)); } - Rect operator * (float m) const { return Rect(Position(bl.x, bl.y) * m, Position(tr.x, tr.y) * m); } - - Position bl; - Position tr; -}; - -} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Rule.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Rule.h deleted file mode 100644 index 69442658e4d..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Rule.h +++ /dev/null @@ -1,307 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ - -#pragma once - -#include "inc/Code.h" -#include "inc/Slot.h" - -namespace graphite2 { - -struct Rule { - const vm::Machine::Code * constraint, - * action; - unsigned short sort; - byte preContext; -#ifndef NDEBUG - uint16 rule_idx; -#endif - - Rule() : constraint(0), action(0), sort(0), preContext(0) {} - ~Rule(); - - CLASS_NEW_DELETE; - -private: - Rule(const Rule &); - Rule & operator = (const Rule &); -}; - -inline Rule::~Rule() -{ - delete constraint; - delete action; -} - - -struct RuleEntry -{ - const Rule * rule; - - inline - bool operator < (const RuleEntry &r) const - { - const unsigned short lsort = rule->sort, rsort = r.rule->sort; - return lsort > rsort || (lsort == rsort && rule < r.rule); - } - - inline - bool operator == (const RuleEntry &r) const - { - return rule == r.rule; - } -}; - - -struct State -{ - const RuleEntry * rules, - * rules_end; - const State * const * transitions; - - size_t size() const; - bool is_success() const; - bool is_transition() const; -}; - -inline -size_t State::size() const -{ - return rules_end - rules; -} - -inline -bool State::is_success() const -{ - return (rules != NULL); -} - -inline -bool State::is_transition() const -{ - return (transitions != NULL); -} - - -class SlotMap -{ -public: - enum {MAX_SLOTS=64}; - SlotMap(Segment & seg); - - Slot * * begin(); - Slot * * end(); - size_t size() const; - unsigned short context() const; - void reset(Slot &, unsigned short); - - Slot * const & operator[](int n) const; - Slot * & operator [] (int); - void pushSlot(Slot * const slot); - void collectGarbage(); - - Slot * highwater() { return m_highwater; } - void highwater(Slot *s) { m_highwater = s; m_highpassed = false; } - bool highpassed() const { return m_highpassed; } - void highpassed(bool v) { m_highpassed = v; } - - Segment & segment; -private: - Slot * m_slot_map[MAX_SLOTS+1]; - unsigned short m_size; - unsigned short m_precontext; - Slot * m_highwater; - bool m_highpassed; -}; - - -class FiniteStateMachine -{ -public: - enum {MAX_RULES=128}; - -private: - class Rules - { - public: - Rules(); - void clear(); - const RuleEntry * begin() const; - const RuleEntry * end() const; - size_t size() const; - - void accumulate_rules(const State &state); - - private: - RuleEntry * m_begin, - * m_end, - m_rules[MAX_RULES*2]; - }; - -public: - FiniteStateMachine(SlotMap & map, json * logger); - void reset(Slot * & slot, const short unsigned int max_pre_ctxt); - - Rules rules; - SlotMap & slots; - json * const dbgout; -}; - - -inline -FiniteStateMachine::FiniteStateMachine(SlotMap& map, json * logger) -: slots(map), - dbgout(logger) -{ -} - -inline -void FiniteStateMachine::reset(Slot * & slot, const short unsigned int max_pre_ctxt) -{ - rules.clear(); - int ctxt = 0; - for (; ctxt != max_pre_ctxt && slot->prev(); ++ctxt, slot = slot->prev()); - slots.reset(*slot, ctxt); -} - -inline -FiniteStateMachine::Rules::Rules() - : m_begin(m_rules), m_end(m_rules) -{ -} - -inline -void FiniteStateMachine::Rules::clear() -{ - m_end = m_begin; -} - -inline -const RuleEntry * FiniteStateMachine::Rules::begin() const -{ - return m_begin; -} - -inline -const RuleEntry * FiniteStateMachine::Rules::end() const -{ - return m_end; -} - -inline -size_t FiniteStateMachine::Rules::size() const -{ - return m_end - m_begin; -} - -inline -void FiniteStateMachine::Rules::accumulate_rules(const State &state) -{ - // Only bother if there are rules in the State object. - if (state.size() == 0) return; - - // Merge the new sorted rules list into the current sorted result set. - const RuleEntry * lre = begin(), * rre = state.rules; - RuleEntry * out = m_rules + (m_begin == m_rules)*MAX_RULES; - const RuleEntry * lrend = out + MAX_RULES; - m_begin = out; - while (lre != end() && out != lrend) - { - if (*lre < *rre) *out++ = *lre++; - else if (*rre < *lre) { *out++ = *rre++; } - else { *out++ = *lre++; ++rre; } - - if (rre == state.rules_end) - { - while (lre != end() && out != lrend) { *out++ = *lre++; } - m_end = out; - return; - } - } - while (rre != state.rules_end && out != lrend) { *out++ = *rre++; } - m_end = out; -} - -inline -SlotMap::SlotMap(Segment & seg) -: segment(seg), m_size(0), m_precontext(0), m_highwater(0), m_highpassed(false) -{ - m_slot_map[0] = 0; -} - -inline -Slot * * SlotMap::begin() -{ - return &m_slot_map[1]; // allow map to go 1 before slot_map when inserting - // at start of segment. -} - -inline -Slot * * SlotMap::end() -{ - return m_slot_map + m_size + 1; -} - -inline -size_t SlotMap::size() const -{ - return m_size; -} - -inline -short unsigned int SlotMap::context() const -{ - return m_precontext; -} - -inline -void SlotMap::reset(Slot & slot, short unsigned int ctxt) -{ - m_size = 0; - m_precontext = ctxt; - *m_slot_map = slot.prev(); -} - -inline -void SlotMap::pushSlot(Slot*const slot) -{ - m_slot_map[m_size++ + 1] = slot; -} - -inline -Slot * const & SlotMap::operator[](int n) const -{ - return m_slot_map[n + 1]; -} - -inline -Slot * & SlotMap::operator[](int n) -{ - return m_slot_map[n + 1]; -} - -} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/SegCache.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/SegCache.h deleted file mode 100644 index ac09966589c..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/SegCache.h +++ /dev/null @@ -1,320 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - -#ifndef GRAPHITE2_NSEGCACHE - -#include -#include "inc/Main.h" -#include "inc/Slot.h" -#include "inc/FeatureVal.h" -#include "inc/SegCacheEntry.h" -#include "inc/Segment.h" - -namespace graphite2 { - -class SegCache; -class SegCacheEntry; -class SegCacheStore; - -/** - * SegPrefixEntry stores lists of word/syllable segments - * with one list for each word length. The prefix size should be chosen so that - * these list sizes stay small since they will be searched iteratively. - */ -class SegCachePrefixEntry -{ - SegCachePrefixEntry(const SegCachePrefixEntry &); - SegCachePrefixEntry & operator = (const SegCachePrefixEntry &); - -public: - SegCachePrefixEntry() : m_lastPurge(0) - { - memset(m_entryCounts, 0, sizeof m_entryCounts); - memset(m_entryBSIndex, 0, sizeof m_entryBSIndex); - memset(m_entries, 0, sizeof m_entries); - } - - ~SegCachePrefixEntry() - { - for (size_t j = 0; j < eMaxSpliceSize; j++) - { - if (m_entryCounts[j]) - { - assert(m_entries[j]); - for (size_t k = 0; k < m_entryCounts[j]; k++) - m_entries[j][k].clear(); - - free(m_entries[j]); - } - } - } - const SegCacheEntry * find(const uint16 * cmapGlyphs, size_t length) const - { - if (length <= ePrefixLength) - { - assert(m_entryCounts[length-1] <= 1); - if (m_entries[length-1]) - return m_entries[length-1]; - return NULL; - } - SegCacheEntry * entry = NULL; - findPosition(cmapGlyphs, length, &entry); - return entry; - } - SegCacheEntry * cache(const uint16* cmapGlyphs, size_t length, Segment * seg, size_t charOffset, unsigned long long totalAccessCount) - { - size_t listSize = m_entryBSIndex[length-1]? (m_entryBSIndex[length-1] << 1) - 1 : 0; - SegCacheEntry * newEntries = NULL; - if (m_entryCounts[length-1] + 1u > listSize) - { - if (m_entryCounts[length-1] == 0) - { - listSize = 1; - } - else - { - // the problem comes when you get incremental numeric ids in a large doc - if (listSize >= eMaxSuffixCount) - return NULL; - listSize = (m_entryBSIndex[length-1] << 2) - 1; - } - newEntries = gralloc(listSize); - if (!newEntries) - { - return NULL; - } - } - - uint16 insertPos = 0; - if (m_entryCounts[length-1] > 0) - { - insertPos = findPosition(cmapGlyphs, length, NULL); - if (!newEntries) - { - // same buffer, shift entries up - memmove(m_entries[length-1] + insertPos + 1, m_entries[length-1] + insertPos, - sizeof(SegCacheEntry) * (m_entryCounts[length-1] - insertPos)); - } - else - { - memcpy(newEntries, m_entries[length-1], sizeof(SegCacheEntry) * (insertPos)); - memcpy(newEntries + insertPos + 1, m_entries[length-1] + insertPos, - sizeof(SegCacheEntry) * (m_entryCounts[length-1] - insertPos)); - - free(m_entries[length-1]); - m_entries[length-1] = newEntries; - assert (m_entryBSIndex[length-1]); - m_entryBSIndex[length-1] <<= 1; - } - } - else - { - m_entryBSIndex[length-1] = 1; - m_entries[length-1] = newEntries; - } - m_entryCounts[length-1] += 1; - new (m_entries[length-1] + insertPos) - SegCacheEntry(cmapGlyphs, length, seg, charOffset, totalAccessCount); - return m_entries[length-1] + insertPos; - } - uint32 purge(unsigned long long minAccessCount, unsigned long long oldAccessTime, - unsigned long long currentTime); - CLASS_NEW_DELETE -private: - uint16 findPosition(const uint16 * cmapGlyphs, uint16 length, SegCacheEntry ** entry) const - { - int dir = 0; - if (m_entryCounts[length-1] == 0) - { - if (entry) *entry = NULL; - return 0; - } - else if (m_entryCounts[length-1] == 1) - { - // optimize single entry case - for (int i = ePrefixLength; i < length; i++) - { - if (cmapGlyphs[i] > m_entries[length-1][0].m_unicode[i]) - { - return 1; - } - else if (cmapGlyphs[i] < m_entries[length-1][0].m_unicode[i]) - { - return 0; - } - } - if (entry) - *entry = m_entries[length-1]; - return 0; - } - uint16 searchIndex = m_entryBSIndex[length-1] - 1; - uint16 stepSize = m_entryBSIndex[length-1] >> 1; - size_t prevIndex = searchIndex; - do - { - dir = 0; - if (searchIndex >= m_entryCounts[length-1]) - { - dir = -1; - searchIndex -= stepSize; - stepSize >>= 1; - } - else - { - for (int i = ePrefixLength; i < length; i++) - { - if (cmapGlyphs[i] > m_entries[length-1][searchIndex].m_unicode[i]) - { - dir = 1; - searchIndex += stepSize; - stepSize >>= 1; - break; - } - else if (cmapGlyphs[i] < m_entries[length-1][searchIndex].m_unicode[i]) - { - dir = -1; - searchIndex -= stepSize; - stepSize >>= 1; - break; - } - } - } - if (prevIndex == searchIndex) - break; - prevIndex = searchIndex; - } while (dir != 0); - if (entry) - { - if (dir == 0) - *entry = m_entries[length-1] + searchIndex; - else - *entry = NULL; - } - else - { - // if entry is null, then this is for inserting a new value, which - // shouldn't already be in the cache - assert(dir != 0); - if (dir > 0) - ++searchIndex; - } - return searchIndex; - } - /** m_entries is a null terminated list of entries */ - uint16 m_entryCounts[eMaxSpliceSize]; - uint16 m_entryBSIndex[eMaxSpliceSize]; - SegCacheEntry * m_entries[eMaxSpliceSize]; - unsigned long long m_lastPurge; -}; - - -#define SEG_CACHE_MIN_INDEX (store->maxCmapGid()) -#define SEG_CACHE_MAX_INDEX (store->maxCmapGid()+1u) -#define SEG_CACHE_UNSET_INDEX (store->maxCmapGid()+2u) - -union SegCachePrefixArray -{ - void ** raw; - SegCachePrefixArray * array; - SegCachePrefixEntry ** prefixEntries; - uintptr * range; -}; - -class SegCache -{ -public: - SegCache(const SegCacheStore * store, const Features& features); - ~SegCache(); - - const SegCacheEntry * find(const uint16 * cmapGlyphs, size_t length) const; - SegCacheEntry * cache(SegCacheStore * store, const uint16 * cmapGlyphs, size_t length, Segment * seg, size_t charOffset); - void purge(SegCacheStore * store); - - long long totalAccessCount() const { return m_totalAccessCount; } - size_t segmentCount() const { return m_segmentCount; } - const Features & features() const { return m_features; } - void clear(SegCacheStore * store); - - CLASS_NEW_DELETE -private: - void freeLevel(SegCacheStore * store, SegCachePrefixArray prefixes, size_t level); - void purgeLevel(SegCacheStore * store, SegCachePrefixArray prefixes, size_t level, - unsigned long long minAccessCount, unsigned long long oldAccessTime); - - uint16 m_prefixLength; - uint16 m_maxCachedSegLength; - size_t m_segmentCount; - SegCachePrefixArray m_prefixes; - Features m_features; - mutable unsigned long long m_totalAccessCount; - mutable unsigned long long m_totalMisses; - float m_purgeFactor; -}; - -inline const SegCacheEntry * SegCache::find(const uint16 * cmapGlyphs, size_t length) const -{ - uint16 pos = 0; - if (!length || length > eMaxSpliceSize) return NULL; - SegCachePrefixArray pEntry = m_prefixes.array[cmapGlyphs[0]]; - while (++pos < m_prefixLength - 1) - { - if (!pEntry.raw) - { - ++m_totalMisses; - return NULL; - } - pEntry = pEntry.array[(pos < length)? cmapGlyphs[pos] : 0]; - } - if (!pEntry.raw) - { - ++m_totalMisses; - return NULL; - } - SegCachePrefixEntry * prefixEntry = pEntry.prefixEntries[(pos < length)? cmapGlyphs[pos] : 0]; - if (!prefixEntry) - { - ++m_totalMisses; - return NULL; - } - const SegCacheEntry * entry = prefixEntry->find(cmapGlyphs, length); - if (entry) - { - ++m_totalAccessCount; - entry->accessed(m_totalAccessCount); - } - else - { - ++m_totalMisses; - } - return entry; -} - -} // namespace graphite2 - -#endif - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/SegCacheEntry.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/SegCacheEntry.h deleted file mode 100644 index 9a7d930677c..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/SegCacheEntry.h +++ /dev/null @@ -1,121 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - -#ifndef GRAPHITE2_NSEGCACHE - -#include "inc/Main.h" -#include "inc/Slot.h" - -namespace graphite2 { - -class Segment; -class Slot; -class SegCacheEntry; -class SegCachePrefixEntry; - -enum SegCacheParameters { - /** number of characters used in initial prefix tree */ - ePrefixLength = 2, - /** Segments more recent than maxSegmentCount() / eAgeFactor are kept */ - eAgeFactor = 4, - /** Segments are purged according to the formular: - * accessCount < (totalAccesses)/(ePurgeFactor * maxSegments) */ - ePurgeFactor = 5, - /** Maximum number of Segments to store which have the same - * prefix. Needed to prevent unique identifiers flooding the cache */ - eMaxSuffixCount = 15 - -}; - -class SegCacheCharInfo -{ -public: - uint16 m_unicode; - uint16 m_before; - uint16 m_after; -}; - -/** - * SegCacheEntry stores the result of running the engine for specific unicode - * code points in the typical mid-line situation. - */ -class SegCacheEntry -{ - // Prevent any implict copying; - SegCacheEntry(const SegCacheEntry &); - SegCacheEntry & operator = (const SegCacheEntry &); - - friend class SegCachePrefixEntry; -public: - SegCacheEntry() : - m_glyphLength(0), m_unicode(NULL), m_glyph(NULL), m_attr(NULL), m_justs(0), - m_accessCount(0), m_lastAccess(0) - {} - SegCacheEntry(const uint16 * cmapGlyphs, size_t length, Segment * seg, size_t charOffset, long long cacheTime); - ~SegCacheEntry() { clear(); }; - void clear(); - size_t glyphLength() const { return m_glyphLength; } - const Slot * first() const { return m_glyph; } - const Slot * last() const { return m_glyph + (m_glyphLength - 1); } - - /** Total number of times this entry has been accessed since creation */ - unsigned long long accessCount() const { return m_accessCount; } - /** "time" of last access where "time" is measured in accesses to the cache owning this entry */ - void accessed(unsigned long long cacheTime) const - { - m_lastAccess = cacheTime; ++m_accessCount; - }; - - int compareRank(const SegCacheEntry & entry) const - { - if (m_accessCount > entry.m_accessCount) return 1; - else if (m_accessCount < entry.m_accessCount) return 1; - else if (m_lastAccess > entry.m_lastAccess) return 1; - else if (m_lastAccess < entry.m_lastAccess) return -1; - return 0; - } - unsigned long long lastAccess() const { return m_lastAccess; }; - - CLASS_NEW_DELETE; -private: - - size_t m_glyphLength; - /** glyph ids resulting from cmap mapping from unicode to glyph before substitution - * the length of this array is determined by the position in the SegCachePrefixEntry */ - uint16 * m_unicode; - /** slots after shapping and positioning */ - Slot * m_glyph; - int16 * m_attr; - byte * m_justs; - mutable unsigned long long m_accessCount; - mutable unsigned long long m_lastAccess; -}; - -} // namespace graphite2 - -#endif diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/SegCacheStore.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/SegCacheStore.h deleted file mode 100644 index 1e6a6e216e7..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/SegCacheStore.h +++ /dev/null @@ -1,127 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - -#ifndef GRAPHITE2_NSEGCACHE - -#include "inc/Main.h" -#include "inc/CmapCache.h" -#include "inc/SegCache.h" - -namespace graphite2 { - -class SegCache; -class Face; - -class SilfSegCache -{ - SilfSegCache(const SilfSegCache &); - SilfSegCache & operator = (const SilfSegCache &); - -public: - SilfSegCache() : m_caches(NULL), m_cacheCount(0) {}; - ~SilfSegCache() - { - assert(m_caches == NULL); - } - void clear(SegCacheStore * cacheStore) - { - for (size_t i = 0; i < m_cacheCount; i++) - { - m_caches[i]->clear(cacheStore); - delete m_caches[i]; - } - free(m_caches); - m_caches = NULL; - m_cacheCount = 0; - } - SegCache * getOrCreate(SegCacheStore * cacheStore, const Features & features) - { - for (size_t i = 0; i < m_cacheCount; i++) - { - if (m_caches[i]->features() == features) - return m_caches[i]; - } - SegCache ** newData = gralloc(m_cacheCount+1); - if (newData) - { - if (m_cacheCount > 0) - { - memcpy(newData, m_caches, sizeof(SegCache*) * m_cacheCount); - free(m_caches); - } - m_caches = newData; - m_caches[m_cacheCount] = new SegCache(cacheStore, features); - m_cacheCount++; - return m_caches[m_cacheCount - 1]; - } - return NULL; - } - CLASS_NEW_DELETE -private: - SegCache ** m_caches; - size_t m_cacheCount; -}; - -class SegCacheStore -{ - SegCacheStore(const SegCacheStore &); - SegCacheStore & operator = (const SegCacheStore &); - -public: - SegCacheStore(const Face & face, unsigned int numSilf, size_t maxSegments); - ~SegCacheStore() - { - for (size_t i = 0; i < m_numSilf; i++) - { - m_caches[i].clear(this); - } - delete [] m_caches; - m_caches = NULL; - } - SegCache * getOrCreate(unsigned int i, const Features & features) - { - return m_caches[i].getOrCreate(this, features); - } - bool isSpaceGlyph(uint16 gid) const { return (gid == m_spaceGid) || (gid == m_zwspGid); } - uint16 maxCmapGid() const { return m_maxCmapGid; } - uint32 maxSegmentCount() const { return m_maxSegments; }; - - CLASS_NEW_DELETE -private: - SilfSegCache * m_caches; - uint8 m_numSilf; - uint32 m_maxSegments; - uint16 m_maxCmapGid; - uint16 m_spaceGid; - uint16 m_zwspGid; -}; - -} // namespace graphite2 - -#endif - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Segment.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Segment.h deleted file mode 100644 index a2ff6d08482..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Segment.h +++ /dev/null @@ -1,270 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - -#include "inc/Main.h" - -#include - -#include "inc/CharInfo.h" -#include "inc/Face.h" -#include "inc/FeatureVal.h" -#include "inc/GlyphCache.h" -#include "inc/GlyphFace.h" -//#include "inc/Silf.h" -#include "inc/Slot.h" -#include "inc/Position.h" -#include "inc/List.h" - -#define MAX_SEG_GROWTH_FACTOR 256 - -namespace graphite2 { - -typedef Vector FeatureList; -typedef Vector SlotRope; -typedef Vector AttributeRope; -typedef Vector JustifyRope; - -#ifndef GRAPHITE2_NSEGCACHE -class SegmentScopeState; -#endif -class Font; -class Segment; -class Silf; - -enum SpliceParam { -/** sub-Segments longer than this are not cached - * (in Unicode code points) */ - eMaxSpliceSize = 96 -}; - -enum justFlags { - gr_justStartInline = 1, - gr_justEndInline = 2 -}; - -class SegmentScopeState -{ -private: - friend class Segment; - Slot * realFirstSlot; - Slot * slotBeforeScope; - Slot * slotAfterScope; - Slot * realLastSlot; - size_t numGlyphsOutsideScope; -}; - -class Segment -{ - // Prevent copying of any kind. - Segment(const Segment&); - Segment& operator=(const Segment&); - -public: - unsigned int slotCount() const { return m_numGlyphs; } //one slot per glyph - void extendLength(int num) { m_numGlyphs += num; } - Position advance() const { return m_advance; } - bool runGraphite() { if (m_silf) return m_face->runGraphite(this, m_silf); else return true;}; - void chooseSilf(uint32 script) { m_silf = m_face->chooseSilf(script); } - const Silf *silf() const { return m_silf; } - unsigned int charInfoCount() const { return m_numCharinfo; } - const CharInfo *charinfo(unsigned int index) const { return index < m_numCharinfo ? m_charinfo + index : NULL; } - CharInfo *charinfo(unsigned int index) { return index < m_numCharinfo ? m_charinfo + index : NULL; } - int8 dir() const { return m_dir; } - - Segment(unsigned int numchars, const Face* face, uint32 script, int dir); - ~Segment(); -#ifndef GRAPHITE2_NSEGCACHE - SegmentScopeState setScope(Slot * firstSlot, Slot * lastSlot, size_t subLength); - void removeScope(SegmentScopeState & state); - void append(const Segment &other); - void splice(size_t offset, size_t length, Slot * const startSlot, - Slot * endSlot, const Slot * srcSlot, - const size_t numGlyphs); -#endif - Slot *first() { return m_first; } - void first(Slot *p) { m_first = p; } - Slot *last() { return m_last; } - void last(Slot *p) { m_last = p; } - void appendSlot(int i, int cid, int gid, int fid, size_t coffset); - Slot *newSlot(); - void freeSlot(Slot *); - SlotJustify *newJustify(); - void freeJustify(SlotJustify *aJustify); - Position positionSlots(const Font *font, Slot *first=0, Slot *last=0); - void associateChars(); - void linkClusters(Slot *first, Slot *last); - uint16 getClassGlyph(uint16 cid, uint16 offset) const { return m_silf->getClassGlyph(cid, offset); } - uint16 findClassIndex(uint16 cid, uint16 gid) const { return m_silf->findClassIndex(cid, gid); } - int addFeatures(const Features& feats) { m_feats.push_back(feats); return m_feats.size() - 1; } - uint32 getFeature(int index, uint8 findex) const { const FeatureRef* pFR=m_face->theSill().theFeatureMap().featureRef(findex); if (!pFR) return 0; else return pFR->getFeatureVal(m_feats[index]); } - void dir(int8 val) { m_dir = val; } - uint16 glyphAttr(uint16 gid, uint16 gattr) const { return m_face->glyphs().glyphAttr(gid, gattr); } - uint16 getGlyphMetric(Slot *iSlot, uint8 metric, uint8 attrLevel) const; - float glyphAdvance(uint16 gid) const { return m_face->glyphs().glyph(gid)->theAdvance().x; } - const Rect &theGlyphBBoxTemporary(uint16 gid) const { return m_face->glyphs().glyph(gid)->theBBox(); } //warning value may become invalid when another glyph is accessed - Slot *findRoot(Slot *is) const { return is->attachedTo() ? findRoot(is->attachedTo()) : is; } - int numAttrs() const { return m_silf->numUser(); } - int defaultOriginal() const { return m_defaultOriginal; } - const Face * getFace() const { return m_face; } - const Features & getFeatures(unsigned int /*charIndex*/) { assert(m_feats.size() == 1); return m_feats[0]; } - void bidiPass(uint8 aBidi, int paradir, uint8 aMirror); - Slot *addLineEnd(Slot *nSlot); - void delLineEnd(Slot *s); - bool hasJustification() const { return m_justifies.size() != 0; } - - bool isWhitespace(const int cid) const; - - CLASS_NEW_DELETE - -public: //only used by: GrSegment* makeAndInitialize(const GrFont *font, const GrFace *face, uint32 script, const FeaturesHandle& pFeats/*must not be IsNull*/, encform enc, const void* pStart, size_t nChars, int dir); - void read_text(const Face *face, const Features* pFeats/*must not be NULL*/, gr_encform enc, const void*pStart, size_t nChars); - void prepare_pos(const Font *font); - void finalise(const Font *font); - float justify(Slot *pSlot, const Font *font, float width, enum justFlags flags, Slot *pFirst, Slot *pLast); - -private: - Rect m_bbox; // ink box of the segment - Position m_advance; // whole segment advance - SlotRope m_slots; // std::vector of slot buffers - AttributeRope m_userAttrs; // std::vector of userAttrs buffers - JustifyRope m_justifies; // Slot justification info buffers - FeatureList m_feats; // feature settings referenced by charinfos in this segment - Slot * m_freeSlots; // linked list of free slots - SlotJustify * m_freeJustifies; // Slot justification blocks free list - CharInfo * m_charinfo; // character info, one per input character - const Face * m_face; // GrFace - const Silf * m_silf; - Slot * m_first; // first slot in segment - Slot * m_last; // last slot in segment - unsigned int m_bufSize, // how big a buffer to create when need more slots - m_numGlyphs, - m_numCharinfo; // size of the array and number of input characters - int m_defaultOriginal; // number of whitespace chars in the string - int8 m_dir; -}; - - - -inline -void Segment::finalise(const Font *font) -{ - if (!m_first) return; - - m_advance = positionSlots(font); - associateChars(); - linkClusters(m_first, m_last); -} - -inline -uint16 Segment::getGlyphMetric(Slot *iSlot, uint8 metric, uint8 attrLevel) const { - if (attrLevel > 0) - { - Slot *is = findRoot(iSlot); - return is->clusterMetric(this, metric, attrLevel); - } - else - return m_face->getGlyphMetric(iSlot->gid(), metric); -} - -inline -bool Segment::isWhitespace(const int cid) const -{ - return ((cid >= 0x0009) * (cid <= 0x000D) - + (cid == 0x0020) - + (cid == 0x0085) - + (cid == 0x00A0) - + (cid == 0x1680) - + (cid == 0x180E) - + (cid >= 0x2000) * (cid <= 0x200A) - + (cid == 0x2028) - + (cid == 0x2029) - + (cid == 0x202F) - + (cid == 0x205F) - + (cid == 0x3000)) != 0; -} - -//inline -//bool Segment::isWhitespace(const int cid) const -//{ -// switch (cid >> 8) -// { -// case 0x00: -// switch (cid) -// { -// case 0x09: -// case 0x0A: -// case 0x0B: -// case 0x0C: -// case 0x0D: -// case 0x20: -// return true; -// default: -// break; -// } -// break; -// case 0x16: -// return cid == 0x1680; -// break; -// case 0x18: -// return cid == 0x180E; -// break; -// case 0x20: -// switch (cid) -// { -// case 0x00: -// case 0x01: -// case 0x02: -// case 0x03: -// case 0x04: -// case 0x05: -// case 0x06: -// case 0x07: -// case 0x08: -// case 0x09: -// case 0x0A: -// case 0x28: -// case 0x29: -// case 0x2F: -// case 0x5F: -// return true -// default: -// break; -// } -// break; -// case 0x30: -// return cid == 0x3000; -// break; -// } -// -// return false; -//} - -} // namespace graphite2 - -struct gr_segment : public graphite2::Segment {}; - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Silf.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Silf.h deleted file mode 100644 index 72459077708..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Silf.h +++ /dev/null @@ -1,126 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - -#include "graphite2/Font.h" -#include "inc/Main.h" -#include "inc/Pass.h" - -namespace graphite2 { - -class Face; -class Segment; -class FeatureVal; -class VMScratch; - -class Pseudo -{ -public: - uint32 uid; - uint32 gid; - CLASS_NEW_DELETE; -}; - -class Justinfo -{ -public: - Justinfo(uint8 stretch, uint8 shrink, uint8 step, uint8 weight) : - m_astretch(stretch), m_ashrink(shrink), m_astep(step), - m_aweight(weight) {}; - uint8 attrStretch() const { return m_astretch; } - uint8 attrShrink() const { return m_ashrink; } - uint8 attrStep() const { return m_astep; } - uint8 attrWeight() const { return m_aweight; } - -private: - uint8 m_astretch; - uint8 m_ashrink; - uint8 m_astep; - uint8 m_aweight; -}; - -class Silf -{ - // Prevent copying - Silf(const Silf&); - Silf& operator=(const Silf&); - -public: - Silf() throw(); - ~Silf() throw(); - - bool readGraphite(const byte * const pSilf, size_t lSilf, const Face &face, uint32 version); - bool runGraphite(Segment *seg, uint8 firstPass=0, uint8 lastPass=0) const; - uint16 findClassIndex(uint16 cid, uint16 gid) const; - uint16 getClassGlyph(uint16 cid, unsigned int index) const; - uint16 findPseudo(uint32 uid) const; - size_t numUser() const { return m_aUser; } - uint8 aPseudo() const { return m_aPseudo; } - uint8 aBreak() const { return m_aBreak; } - uint8 aMirror() const {return m_aMirror; } - uint8 substitutionPass() const { return m_sPass; } - uint8 positionPass() const { return m_pPass; } - uint8 justificationPass() const { return m_jPass; } - uint8 bidiPass() const { return m_bPass; } - size_t numPasses() const { return m_numPasses; } - size_t maxCompPerLig() const { return m_iMaxComp; } - size_t numClasses() const { return m_nClass; } - uint8 flags() const { return m_flags; } - size_t numJustLevels() const { return m_numJusts; } - Justinfo *justAttrs() const { return m_justs; } - uint16 endLineGlyphid() const { return m_gEndLine; } - const gr_faceinfo *silfInfo() const { return &m_silfinfo; } - - CLASS_NEW_DELETE; - -private: - size_t readClassMap(const byte *p, size_t data_len, uint32 version); - template inline uint32 readClassOffsets(const byte *&p, size_t data_len); - - Pass * m_passes; - Pseudo * m_pseudos; - uint32 * m_classOffsets; - uint16 * m_classData; - Justinfo * m_justs; - uint8 m_numPasses; - uint8 m_numJusts; - uint8 m_sPass, m_pPass, m_jPass, m_bPass, - m_flags; - - uint8 m_aPseudo, m_aBreak, m_aUser, m_aBidi, m_aMirror, - m_iMaxComp; - uint16 m_aLig, - m_numPseudo, - m_nClass, - m_nLinear, - m_gEndLine; - gr_faceinfo m_silfinfo; - - void releaseBuffers() throw(); -}; - -} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Slot.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Slot.h deleted file mode 100644 index 285d7f10567..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Slot.h +++ /dev/null @@ -1,167 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - -#include "graphite2/Types.h" -#include "graphite2/Segment.h" -#include "inc/Main.h" -#include "inc/Font.h" -#include "inc/Position.h" - - - -namespace graphite2 { - -typedef gr_attrCode attrCode; - -class GlyphFace; -class Segment; -class SegCacheEntry; - -struct SlotJustify -{ - static const int NUMJUSTPARAMS = 5; - - SlotJustify(const SlotJustify &); - SlotJustify & operator = (const SlotJustify &); - -public: - static size_t size_of(size_t levels) { return sizeof(SlotJustify) + ((levels > 1 ? levels : 1)*NUMJUSTPARAMS - 1)*sizeof(int16); } - - void LoadSlot(const Slot *s, const Segment *seg); - - SlotJustify *next; - int16 values[1]; -}; - -class Slot -{ - enum Flag - { - DELETED = 1, - INSERTED = 2, - COPIED = 4, - POSITIONED = 8, - ATTACHED = 16 - }; - -public: - struct iterator; - - unsigned short gid() const { return m_glyphid; } - Position origin() const { return m_position; } - float advance() const { return m_advance.x; } - Position advancePos() const { return m_advance; } - int before() const { return m_before; } - int after() const { return m_after; } - uint32 index() const { return m_index; } - void index(uint32 val) { m_index = val; } - - Slot(); - void set(const Slot & slot, int charOffset, size_t numUserAttr, size_t justLevels); - Slot *next() const { return m_next; } - void next(Slot *s) { m_next = s; } - Slot *prev() const { return m_prev; } - void prev(Slot *s) { m_prev = s; } - uint16 glyph() const { return m_realglyphid ? m_realglyphid : m_glyphid; } - void setGlyph(Segment *seg, uint16 glyphid, const GlyphFace * theGlyph = NULL); - void setRealGid(uint16 realGid) { m_realglyphid = realGid; } - void adjKern(const Position &pos) { m_shift = m_shift + pos; m_advance = m_advance + pos; } - void origin(const Position &pos) { m_position = pos + m_shift; } - void originate(int ind) { m_original = ind; } - int original() const { return m_original; } - void before(int ind) { m_before = ind; } - void after(int ind) { m_after = ind; } - bool isBase() const { return (!m_parent); } - void update(int numSlots, int numCharInfo, Position &relpos); - Position finalise(const Segment* seg, const Font* font, Position & base, Rect & bbox, uint8 attrLevel, float & clusterMin); - bool isDeleted() const { return (m_flags & DELETED) ? true : false; } - void markDeleted(bool state) { if (state) m_flags |= DELETED; else m_flags &= ~DELETED; } - bool isCopied() const { return (m_flags & COPIED) ? true : false; } - void markCopied(bool state) { if (state) m_flags |= COPIED; else m_flags &= ~COPIED; } - bool isPositioned() const { return (m_flags & POSITIONED) ? true : false; } - void markPositioned(bool state) { if (state) m_flags |= POSITIONED; else m_flags &= ~POSITIONED; } - bool isInsertBefore() const { return !(m_flags & INSERTED); } - uint8 getBidiLevel() const { return m_bidiLevel; } - void setBidiLevel(uint8 level) { m_bidiLevel = level; } - uint8 getBidiClass() const { return m_bidiCls; } - void setBidiClass(uint8 cls) { m_bidiCls = cls; } - int16 *userAttrs() const { return m_userAttr; } - void userAttrs(int16 *p) { m_userAttr = p; } - void markInsertBefore(bool state) { if (!state) m_flags |= INSERTED; else m_flags &= ~INSERTED; } - void setAttr(Segment* seg, attrCode ind, uint8 subindex, int16 val, const SlotMap & map); - int getAttr(const Segment *seg, attrCode ind, uint8 subindex) const; - int getJustify(const Segment *seg, uint8 level, uint8 subindex) const; - void setJustify(Segment *seg, uint8 level, uint8 subindex, int16 value); - bool isLocalJustify() const { return m_justs != NULL; }; - void attachTo(Slot *ap) { m_parent = ap; } - Slot *attachedTo() const { return m_parent; } - Position attachOffset() const { return m_attach - m_with; } - Slot* firstChild() const { return m_child; } - bool child(Slot *ap); - Slot* nextSibling() const { return m_sibling; } - bool sibling(Slot *ap); - uint32 clusterMetric(const Segment* seg, uint8 metric, uint8 attrLevel); - void positionShift(Position a) { m_position += a; } - void floodShift(Position adj); - float just() const { return m_just; } - void just(float j) { m_just = j; } - - CLASS_NEW_DELETE - -private: - Slot *m_next; // linked list of slots - Slot *m_prev; - unsigned short m_glyphid; // glyph id - uint16 m_realglyphid; - uint32 m_original; // charinfo that originated this slot (e.g. for feature values) - uint32 m_before; // charinfo index of before association - uint32 m_after; // charinfo index of after association - uint32 m_index; // slot index given to this slot during finalising - Slot *m_parent; // index to parent we are attached to - Slot *m_child; // index to first child slot that attaches to us - Slot *m_sibling; // index to next child that attaches to our parent - Position m_position; // absolute position of glyph - Position m_shift; // .shift slot attribute - Position m_advance; // .advance slot attribute - Position m_attach; // attachment point on us - Position m_with; // attachment point position on parent - float m_just; // Justification inserted space - uint8 m_flags; // holds bit flags - byte m_attLevel; // attachment level - byte m_bidiCls; // bidirectional class - byte m_bidiLevel; // bidirectional level - int16 *m_userAttr; // pointer to user attributes - SlotJustify *m_justs; // pointer to justification parameters - - friend class SegCacheEntry; - friend class Segment; -}; - -} // namespace graphite2 - -struct gr_slot : public graphite2::Slot {}; diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Sparse.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Sparse.h deleted file mode 100644 index 2eca5b6161c..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/Sparse.h +++ /dev/null @@ -1,147 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once -#include -#include - -#include "inc/Main.h" - -namespace graphite2 { - - - -class sparse -{ -public: - typedef uint16 key_type; - typedef uint16 mapped_type; - typedef std::pair value_type; - -private: - typedef unsigned long mask_t; - - static const unsigned char SIZEOF_CHUNK = (sizeof(mask_t) - sizeof(key_type))*8; - - struct chunk - { - mask_t mask:SIZEOF_CHUNK; - key_type offset; - }; - - sparse(const sparse &); - sparse & operator = (const sparse &); - -public: - template - sparse(I first, const I last); - sparse() throw(); - ~sparse() throw(); - - operator bool () const throw(); - mapped_type operator [] (const key_type k) const throw(); - - size_t size() const throw(); - - size_t _sizeof() const throw(); - - CLASS_NEW_DELETE; - -private: - union { - chunk * map; - mapped_type * values; - } m_array; - key_type m_nchunks; -}; - - -inline -sparse::sparse() throw() : m_nchunks(0) -{ - m_array.map = 0; -} - - -template -sparse::sparse(I attr, const I last) -: m_nchunks(0) -{ - m_array.map = 0; - - // Find the maximum extent of the key space. - size_t n_values=0; - for (I i = attr; i != last; ++i, ++n_values) - { - const key_type k = (*i).first / SIZEOF_CHUNK; - if (k >= m_nchunks) m_nchunks = k+1; - } - if (m_nchunks == 0) return; - - m_array.values = grzeroalloc((m_nchunks*sizeof(chunk) + sizeof(mapped_type)/2) - / sizeof(mapped_type) - + n_values*sizeof(mapped_type)); - - if (m_array.values == 0) - { - free(m_array.values); m_array.map=0; - return; - } - - chunk * ci = m_array.map; - ci->offset = (m_nchunks*sizeof(chunk) + sizeof(mapped_type)-1)/sizeof(mapped_type); - mapped_type * vi = m_array.values + ci->offset; - for (; attr != last; ++attr, ++vi) - { - const typename std::iterator_traits::value_type v = *attr; - chunk * const ci_ = m_array.map + v.first/SIZEOF_CHUNK; - - if (ci != ci_) - { - ci = ci_; - ci->offset = vi - m_array.values; - } - - ci->mask |= 1UL << (SIZEOF_CHUNK - 1 - (v.first % SIZEOF_CHUNK)); - *vi = v.second; - } -} - - -inline -sparse::operator bool () const throw() -{ - return m_array.map != 0; -} - - -inline -size_t sparse::_sizeof() const throw() -{ - return sizeof(sparse) + size()*sizeof(mapped_type) + m_nchunks*sizeof(chunk); -} - -} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/TtfTypes.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/TtfTypes.h deleted file mode 100644 index 49ffa39229e..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/TtfTypes.h +++ /dev/null @@ -1,419 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once -/*--------------------------------------------------------------------*//*:Ignore this sentence. - -File: TtfTypes.h -Responsibility: Tim Eves -Last reviewed: Not yet. - -Description: -Provides types required to represent the TTF basic types. --------------------------------------------------------------------------------*//*:End Ignore*/ - - -//********************************************************************************************** -// Include files -//********************************************************************************************** -namespace graphite2 -{ -namespace TtfUtil -{ -//********************************************************************************************** -// Forward declarations -//********************************************************************************************** - - -//********************************************************************************************** -// Type declarations -//********************************************************************************************** -typedef unsigned char uint8; -typedef uint8 byte; -typedef signed char int8; -typedef unsigned short uint16; -typedef short int16; -typedef unsigned int uint32; -typedef int int32; - -typedef int16 short_frac; -typedef int32 fixed; -typedef int16 fword; -typedef uint16 ufword; -typedef int16 f2dot14; -typedef uint32 long_date_time[2]; - -//********************************************************************************************** -// Constants and enum types -//**********************************************************************************************/ -enum -{ - OneFix = 1<<16 -}; - -//********************************************************************************************** -// Table declarations -//********************************************************************************************** -namespace Sfnt -{ -#pragma pack(1) // We need this or the structure members aren't alligned - // correctly. Fortunately this form of pragma is supposed - // to be recongnised by VS C++ too (at least according to - // MSDN). - - struct OffsetSubTable - { - uint32 scaler_type; - uint16 num_tables, - search_range, - entry_selector, - range_shift; - struct Entry - { - uint32 tag, - checksum, - offset, - length; - } table_directory[1]; - - enum ScalerType - { - TrueTypeMac = 0x74727565U, - TrueTypeWin = 0x00010000U, - Type1 = 0x74797031U - }; - }; - - - - - struct CharacterCodeMap - { - uint16 version, - num_subtables; - struct - { - uint16 platform_id, - platform_specific_id; - uint32 offset; - } encoding[1]; - }; - - struct CmapSubTable - { - uint16 format, - length, - language; - }; - - struct CmapSubTableFormat4 : CmapSubTable - { - uint16 seg_count_x2, - search_range, - entry_selector, - range_shift, - end_code[1]; - // There are arrarys after this which need their - // start positions calculated since end_code is - // seg_count uint16s long. - }; - - struct CmapSubTableFormat12 - { - fixed format; - uint32 length, - language, - num_groups; - struct - { - uint32 start_char_code, - end_char_code, - start_glyph_id; - } group[1]; - }; - - - - struct FontHeader - { - fixed version, - font_revision; - uint32 check_sum_adjustment, - magic_number; - uint16 flags, - units_per_em; - long_date_time created, - modified; - fword x_min, - y_min, - x_max, - y_max; - uint16 mac_style, - lowest_rec_ppem; - int16 font_direction_hint, - index_to_loc_format, - glyph_data_format; - enum - { - MagicNumber = 0x5F0F3CF5, - GlypDataFormat = 0 - }; - enum {ShortIndexLocFormat, LongIndexLocFormat}; - }; - - - - - struct PostScriptGlyphName - { - fixed format, - italic_angle; - fword underline_position, - underline_thickness; - uint32 is_fixed_pitch, - min_mem_type42, - max_mem_type42, - min_mem_type1, - max_mem_type1; - enum - { - Format1 = 0x10000, - Format2 = 0x20000, - Format25 = 0x28000, - Format3 = 0x30000, - Format4 = 0x40000 - }; - }; - - struct PostScriptGlyphName2 : PostScriptGlyphName - { - uint16 number_of_glyphs, - glyph_name_index[1]; - }; - - struct PostScriptGlyphName25 : PostScriptGlyphName - { - uint16 number_of_glyphs; - int8 offset[1]; - }; - - struct PostScriptGlyphName3 : PostScriptGlyphName {}; - - struct PostScriptGlyphName4 : PostScriptGlyphName - { - uint16 glyph_to_char_map[1]; - }; - - - struct HorizontalHeader - { - fixed version; - fword ascent, - descent, - line_gap; - ufword advance_width_max; - fword min_left_side_bearing, - max_left_side_bearing, - x_max_element; - int16 caret_slope_rise, - caret_slope_run; - fword caret_offset; - int16 reserved[4], - metric_data_format; - uint16 num_long_hor_metrics; - }; - - struct MaximumProfile - { - fixed version; - uint16 num_glyphs, - max_points, - max_contours, - max_component_points, - max_component_contours, - max_zones, - max_twilight_points, - max_storage, - max_function_defs, - max_instruction_defs, - max_stack_elements, - max_size_of_instructions, - max_component_elements, - max_component_depth; - }; - - - typedef byte Panose[10]; - - struct Compatibility0 - { - uint16 version; - int16 x_avg_char_width; - uint16 weight_class, - width_class; - int16 fs_type, - y_subscript_x_size, - y_subscript_y_size, - y_subscript_x_offset, - y_subscript_y_offset, - y_superscript_x_size, - y_superscript_y_size, - y_superscript_x_offset, - y_superscript_y_offset, - y_strikeout_size, - y_strikeout_position, - family_class; - Panose panose; - uint32 unicode_range[4]; - int8 ach_vend_id[4]; - uint16 fs_selection, - fs_first_char_index, - fs_last_char_index, // Acording to Apple's spec this is where v0 should end - typo_ascender, - typo_descender, - type_linegap, - win_ascent, - win_descent; - - enum - { - Italic =0x01, - Underscore=0x02, - Negative =0x04, - Outlined =0x08, - StrikeOut =0x10, - Bold =0x20 - }; - }; - - struct Compatibility1 : Compatibility0 - { - uint32 codepage_range[2]; - }; - - struct Compatibility2 : Compatibility1 - { - int16 x_height, - cap_height; - uint16 default_char, - break_char, - max_context; - }; - - struct Compatibility3 : Compatibility2 {}; - - typedef Compatibility3 Compatibility; - - - struct NameRecord - { - uint16 platform_id, - platform_specific_id, - language_id, - name_id, - length, - offset; - enum {Unicode, Mactintosh, Reserved, Microsoft}; - enum - { - Copyright, Family, Subfamily, UniqueSubfamily, - Fullname, Version, PostScript - }; - }; - - struct LangTagRecord - { - uint16 length, - offset; - }; - - struct FontNames - { - uint16 format, - count, - string_offset; - NameRecord name_record[1]; - }; - - - struct HorizontalMetric - { - uint16 advance_width; - int16 left_side_bearing; - }; - - - struct Glyph - { - int16 number_of_contours; - fword x_min, - y_min, - x_max, - y_max; - }; - - struct SimpleGlyph : Glyph - { - uint16 end_pts_of_contours[1]; - enum - { - OnCurve = 0x01, - XShort = 0x02, - YShort = 0x04, - Repeat = 0x08, - XIsSame = 0x10, - XIsPos = 0x10, - YIsSame = 0x20, - YIsPos = 0x20 - }; - }; - - struct CompoundGlyph : Glyph - { - uint16 flags, - glyph_index; - enum - { - Arg1Arg2Words = 0x01, - ArgsAreXYValues = 0x02, - RoundXYToGrid = 0x04, - HaveScale = 0x08, - MoreComponents = 0x20, - HaveXAndYScale = 0x40, - HaveTwoByTwo = 0x80, - HaveInstructions = 0x100, - UseMyMetrics = 0x200, - OverlapCompund = 0x400, - ScaledOffset = 0x800, - UnscaledOffset = 0x1000 - }; - }; - -#pragma pack() -} // end of namespace Sfnt - -} // end of namespace TtfUtil -} // end of namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/TtfUtil.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/TtfUtil.h deleted file mode 100644 index 7fafb69cf29..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/TtfUtil.h +++ /dev/null @@ -1,206 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once -/*--------------------------------------------------------------------*//*:Ignore this sentence. - -File: TtfUtil.h -Responsibility: Alan Ward -Last reviewed: Not yet. - -Description: - Utility class for handling TrueType font files. -----------------------------------------------------------------------------------------------*/ - - -#include - -namespace graphite2 -{ -namespace TtfUtil -{ - -typedef long fontTableId32; -typedef unsigned short gid16; - -#define TTF_TAG(a,b,c,d) ((a << 24UL) + (b << 16UL) + (c << 8UL) + (d)) - -// Enumeration used to specify a table in a TTF file -class Tag -{ - unsigned long _v; -public: - Tag(const char n[5]) throw() : _v(TTF_TAG(n[0],n[1],n[2],n[3])) {} - Tag(const unsigned long tag) throw() : _v(tag) {} - - operator unsigned long () const throw () { return _v; } - - enum - { - Feat = TTF_TAG('F','e','a','t'), - Glat = TTF_TAG('G','l','a','t'), - Gloc = TTF_TAG('G','l','o','c'), - Sile = TTF_TAG('S','i','l','e'), - Silf = TTF_TAG('S','i','l','f'), - Sill = TTF_TAG('S','i','l','l'), - cmap = TTF_TAG('c','m','a','p'), - cvt = TTF_TAG('c','v','t',' '), - cryp = TTF_TAG('c','r','y','p'), - head = TTF_TAG('h','e','a','d'), - fpgm = TTF_TAG('f','p','g','m'), - gdir = TTF_TAG('g','d','i','r'), - glyf = TTF_TAG('g','l','y','f'), - hdmx = TTF_TAG('h','d','m','x'), - hhea = TTF_TAG('h','h','e','a'), - hmtx = TTF_TAG('h','m','t','x'), - loca = TTF_TAG('l','o','c','a'), - kern = TTF_TAG('k','e','r','n'), - LTSH = TTF_TAG('L','T','S','H'), - maxp = TTF_TAG('m','a','x','p'), - name = TTF_TAG('n','a','m','e'), - OS_2 = TTF_TAG('O','S','/','2'), - post = TTF_TAG('p','o','s','t'), - prep = TTF_TAG('p','r','e','p') - }; -}; - -/*---------------------------------------------------------------------------------------------- - Class providing utility methods to parse a TrueType font file (TTF). - Callling application handles all file input and memory allocation. - Assumes minimal knowledge of TTF file format. -----------------------------------------------------------------------------------------------*/ - ////////////////////////////////// tools to find & check TTF tables - bool GetHeaderInfo(size_t & lOffset, size_t & lSize); - bool CheckHeader(const void * pHdr); - bool GetTableDirInfo(const void * pHdr, size_t & lOffset, size_t & lSize); - bool GetTableInfo(const Tag TableTag, const void * pHdr, const void * pTableDir, - size_t & lOffset, size_t & lSize); - bool CheckTable(const Tag TableId, const void * pTable, size_t lTableSize); - - ////////////////////////////////// simple font wide info - size_t GlyphCount(const void * pMaxp); -#ifdef ALL_TTFUTILS - size_t MaxCompositeComponentCount(const void * pMaxp); - size_t MaxCompositeLevelCount(const void * pMaxp); - size_t LocaGlyphCount(size_t lLocaSize, const void * pHead); // throw (std::domain_error); -#endif - int DesignUnits(const void * pHead); -#ifdef ALL_TTFUTILS - int HeadTableCheckSum(const void * pHead); - void HeadTableCreateTime(const void * pHead, unsigned int * pnDateBC, unsigned int * pnDateAD); - void HeadTableModifyTime(const void * pHead, unsigned int * pnDateBC, unsigned int * pnDateAD); - bool IsItalic(const void * pHead); - int FontAscent(const void * pOs2); - int FontDescent(const void * pOs2); - bool FontOs2Style(const void *pOs2, bool & fBold, bool & fItalic); - bool Get31EngFamilyInfo(const void * pName, size_t & lOffset, size_t & lSize); - bool Get31EngFullFontInfo(const void * pName, size_t & lOffset, size_t & lSize); - bool Get30EngFamilyInfo(const void * pName, size_t & lOffset, size_t & lSize); - bool Get30EngFullFontInfo(const void * pName, size_t & lOffset, size_t & lSize); - int PostLookup(const void * pPost, size_t lPostSize, const void * pMaxp, - const char * pPostName); -#endif - - ////////////////////////////////// utility methods helpful for name table - bool GetNameInfo(const void * pName, int nPlatformId, int nEncodingId, - int nLangId, int nNameId, size_t & lOffset, size_t & lSize); - //size_t NameTableLength(const byte * pTable); -#ifdef ALL_TTFUTILS - int GetLangsForNames(const void * pName, int nPlatformId, int nEncodingId, - int *nameIdList, int cNameIds, short *langIdList); - void SwapWString(void * pWStr, size_t nSize = 0); // throw (std::invalid_argument); -#endif - - ////////////////////////////////// cmap lookup tools - const void * FindCmapSubtable(const void * pCmap, int nPlatformId = 3, - int nEncodingId = 1, size_t length = 0); - bool CheckCmapSubtable4(const void * pCmap31); - gid16 CmapSubtable4Lookup(const void * pCmapSubtabel4, unsigned int nUnicodeId, int rangeKey = 0); - unsigned int CmapSubtable4NextCodepoint(const void *pCmap31, unsigned int nUnicodeId, - int * pRangeKey = 0); - bool CheckCmapSubtable12(const void *pCmap310); - gid16 CmapSubtable12Lookup(const void * pCmap310, unsigned int uUnicodeId, int rangeKey = 0); - unsigned int CmapSubtable12NextCodepoint(const void *pCmap310, unsigned int nUnicodeId, - int * pRangeKey = 0); - - ///////////////////////////////// horizontal metric data for a glyph - bool HorMetrics(gid16 nGlyphId, const void * pHmtx, size_t lHmtxSize, - const void * pHhea, int & nLsb, unsigned int & nAdvWid); - - ////////////////////////////////// primitives for loca and glyf lookup - size_t LocaLookup(gid16 nGlyphId, const void * pLoca, size_t lLocaSize, - const void * pHead); // throw (std::out_of_range); - void * GlyfLookup(const void * pGlyf, size_t lGlyfOffset, size_t lTableLen); - - ////////////////////////////////// primitves for simple glyph data - bool GlyfBox(const void * pSimpleGlyf, int & xMin, int & yMin, - int & xMax, int & yMax); - -#ifdef ALL_TTFUTILS - int GlyfContourCount(const void * pSimpleGlyf); - bool GlyfContourEndPoints(const void * pSimpleGlyf, int * prgnContourEndPoint, - int cnPointsTotal, size_t & cnPoints); - bool GlyfPoints(const void * pSimpleGlyf, int * prgnX, int * prgnY, - char * prgbFlag, int cnPointsTotal, int & cnPoints); - - // primitive to find the glyph ids in a composite glyph - bool GetComponentGlyphIds(const void * pSimpleGlyf, int * prgnCompId, - size_t cnCompIdTotal, size_t & cnCompId); - // primitive to find the placement data for a component in a composite glyph - bool GetComponentPlacement(const void * pSimpleGlyf, int nCompId, - bool fOffset, int & a, int & b); - // primitive to find the transform data for a component in a composite glyph - bool GetComponentTransform(const void * pSimpleGlyf, int nCompId, - float & flt11, float & flt12, float & flt21, float & flt22, bool & fTransOffset); -#endif - - ////////////////////////////////// operate on composite or simple glyph (auto glyf lookup) - void * GlyfLookup(gid16 nGlyphId, const void * pGlyf, const void * pLoca, - size_t lGlyfSize, size_t lLocaSize, const void * pHead); // primitive used by below methods - -#ifdef ALL_TTFUTILS - // below are primary user methods for handling glyf data - bool IsSpace(gid16 nGlyphId, const void * pLoca, size_t lLocaSize, const void * pHead); - bool IsDeepComposite(gid16 nGlyphId, const void * pGlyf, const void * pLoca, - size_t lGlyfSize, size_t lLocaSize, const void * pHead); - - bool GlyfBox(gid16 nGlyphId, const void * pGlyf, const void * pLoca, size_t lGlyfSize, size_t lLocaSize, - const void * pHead, int & xMin, int & yMin, int & xMax, int & yMax); - bool GlyfContourCount(gid16 nGlyphId, const void * pGlyf, const void * pLoca, - size_t lGlyfSize, size_t lLocaSize, const void *pHead, size_t & cnContours); - bool GlyfContourEndPoints(gid16 nGlyphId, const void * pGlyf, const void * pLoca, - size_t lGlyfSize, size_t lLocaSize, const void * pHead, int * prgnContourEndPoint, size_t cnPoints); - bool GlyfPoints(gid16 nGlyphId, const void * pGlyf, const void * pLoca, - size_t lGlyfSize, size_t lLocaSize, const void * pHead, const int * prgnContourEndPoint, size_t cnEndPoints, - int * prgnX, int * prgnY, bool * prgfOnCurve, size_t cnPoints); - - // utitily method used by high-level GlyfPoints - bool SimplifyFlags(char * prgbFlags, int cnPoints); - bool CalcAbsolutePoints(int * prgnX, int * prgnY, int cnPoints); -#endif - -} // end of namespace TtfUtil -} // end of namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/UtfCodec.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/UtfCodec.h deleted file mode 100644 index 1a49179aafa..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/UtfCodec.h +++ /dev/null @@ -1,207 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - -#include -#include "inc/Main.h" - -namespace graphite2 { - -typedef uint32 uchar_t; - -template -struct _utf_codec -{ - typedef uchar_t codeunit_t; - - static void put(codeunit_t * cp, const uchar_t , int8 & len) throw(); - static uchar_t get(const codeunit_t * cp, int8 & len) throw(); -}; - - -template <> -struct _utf_codec<32> -{ -private: - static const uchar_t limit = 0x110000; -public: - typedef uint32 codeunit_t; - - inline - static void put(codeunit_t * cp, const uchar_t usv, int8 & l) throw() - { - *cp = usv; l = 1; - } - - inline - static uchar_t get(const codeunit_t * cp, int8 & l) throw() - { - if (cp[0] < limit) { l = 1; return cp[0]; } - else { l = -1; return 0xFFFD; } - } -}; - - -template <> -struct _utf_codec<16> -{ -private: - static const int32 lead_offset = 0xD800 - (0x10000 >> 10); - static const int32 surrogate_offset = 0x10000 - (0xD800 << 10) - 0xDC00; -public: - typedef uint16 codeunit_t; - - inline - static void put(codeunit_t * cp, const uchar_t usv, int8 & l) throw() - { - if (usv < 0x10000) { l = 1; cp[0] = codeunit_t(usv); } - else - { - cp[0] = codeunit_t(lead_offset + (usv >> 10)); - cp[1] = codeunit_t(0xDC00 + (usv & 0x3FF)); - l = 2; - } - } - - inline - static uchar_t get(const codeunit_t * cp, int8 & l) throw() - { - const uint32 uh = cp[0]; - l = 1; - - if (0xD800 > uh || uh > 0xDFFF) { return uh; } - const uint32 ul = cp[1]; - if (uh > 0xDBFF || 0xDC00 > ul || ul > 0xDFFF) { l = -1; return 0xFFFD; } - ++l; - return (uh<<10) + ul + surrogate_offset; - } -}; - - -template <> -struct _utf_codec<8> -{ -private: - static const int8 sz_lut[16]; - static const byte mask_lut[5]; - - -public: - typedef uint8 codeunit_t; - - inline - static void put(codeunit_t * cp, const uchar_t usv, int8 & l) throw() - { - if (usv < 0x80) {l = 1; cp[0] = usv; return; } - if (usv < 0x0800) {l = 2; cp[0] = 0xC0 + (usv >> 6); cp[1] = 0x80 + (usv & 0x3F); return; } - if (usv < 0x10000) {l = 3; cp[0] = 0xE0 + (usv >> 12); cp[1] = 0x80 + ((usv >> 6) & 0x3F); cp[2] = 0x80 + (usv & 0x3F); return; } - else {l = 4; cp[0] = 0xF0 + (usv >> 18); cp[1] = 0x80 + ((usv >> 12) & 0x3F); cp[2] = 0x80 + ((usv >> 6) & 0x3F); cp[3] = 0x80 + (usv & 0x3F); return; } - } - - inline - static uchar_t get(const codeunit_t * cp, int8 & l) throw() - { - const int8 seq_sz = sz_lut[*cp >> 4]; - uchar_t u = *cp & mask_lut[seq_sz]; - l = 1; - bool toolong = false; - - switch(seq_sz) { - case 4: u <<= 6; u |= *++cp & 0x3F; if (*cp >> 6 != 2) break; ++l; toolong = (u < 0x10); // no break - case 3: u <<= 6; u |= *++cp & 0x3F; if (*cp >> 6 != 2) break; ++l; toolong |= (u < 0x20); // no break - case 2: u <<= 6; u |= *++cp & 0x3F; if (*cp >> 6 != 2) break; ++l; toolong |= (u < 0x80); // no break - case 1: break; - case 0: l = -1; return 0xFFFD; - } - - if (l != seq_sz || toolong) - { - l = -l; - return 0xFFFD; - } - return u; - } -}; - - -template -class _utf_iterator -{ - typedef _utf_codec codec; - - C * cp; - mutable int8 sl; - -public: - typedef C codeunit_type; - typedef uchar_t value_type; - typedef uchar_t * pointer; - - class reference - { - const _utf_iterator & _i; - - reference(const _utf_iterator & i): _i(i) {} - public: - operator value_type () const throw () { return codec::get(_i.cp, _i.sl); } - reference & operator = (const value_type usv) throw() { codec::put(_i.cp, usv, _i.sl); return *this; } - - friend class _utf_iterator; - }; - - - _utf_iterator(const void * us=0) : cp(reinterpret_cast(const_cast(us))), sl(1) { } - - _utf_iterator & operator ++ () { cp += abs(sl); return *this; } - _utf_iterator operator ++ (int) { _utf_iterator tmp(*this); operator++(); return tmp; } - - bool operator == (const _utf_iterator & rhs) const throw() { return cp >= rhs.cp; } - bool operator != (const _utf_iterator & rhs) const throw() { return !operator==(rhs); } - - reference operator * () const throw() { return *this; } - pointer operator ->() const throw() { return &operator *(); } - - operator codeunit_type * () const throw() { return cp; } - - bool error() const throw() { return sl < 1; } -}; - -template -struct utf -{ - typedef typename _utf_codec::codeunit_t codeunit_t; - - typedef _utf_iterator iterator; - typedef _utf_iterator const_iterator; -}; - - -typedef utf utf32; -typedef utf utf16; -typedef utf utf8; - -} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/bits.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/bits.h deleted file mode 100644 index aec2a005fed..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/bits.h +++ /dev/null @@ -1,87 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once - -template -inline unsigned int bit_set_count(T v) -{ - v = v - ((v >> 1) & T(~T(0)/3)); // temp - v = (v & T(~T(0)/15*3)) + ((v >> 2) & T(~T(0)/15*3)); // temp - v = (v + (v >> 4)) & T(~T(0)/255*15); // temp - return (T)(v * T(~T(0)/255)) >> (sizeof(T)-1)*8; // count -} - - -template -inline unsigned long _mask_over_val(unsigned long v) -{ - v = _mask_over_val(v); - v |= v >> S*4; - return v; -} - -template<> -inline unsigned long _mask_over_val<1>(unsigned long v) -{ - v |= v >> 1; - v |= v >> 2; - v |= v >> 4; - return v; -} - -template -inline T mask_over_val(T v) -{ - return _mask_over_val(v); -} - -template -inline unsigned long next_highest_power2(T v) -{ - return _mask_over_val(v-1)+1; -} - -template -inline unsigned int log_binary(T v) -{ - return bit_set_count(mask_over_val(v))-1; -} - -template -inline T haszero(const T x) -{ - return (x - T(~T(0)/255)) & ~x & T(~T(0)/255*128); -} - -template -inline T zerobytes(const T x, unsigned char n) -{ - const T t = T(~T(0)/255*n); - return T((haszero(x^t) >> 7)*n); -} - - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/debug.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/debug.h deleted file mode 100644 index 6c733c6a5a4..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/debug.h +++ /dev/null @@ -1,78 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -// debug.h -// -// Created on: 22 Dec 2011 -// Author: tim - -#pragma once - -#if !defined GRAPHITE2_NTRACING - -#include -#include "inc/json.h" -#include "inc/Position.h" - -namespace graphite2 -{ - -class CharInfo; -class Segment; -class Slot; - -typedef std::pair dslot; -struct objectid -{ - char name[16]; - objectid(const dslot &) throw(); - objectid(const Segment * const p) throw(); -}; - -json & operator << (json & j, const Position &) throw(); -json & operator << (json & j, const CharInfo &) throw(); -json & operator << (json & j, const dslot &) throw(); -json & operator << (json & j, const objectid &) throw(); - - -inline -json & operator << (json & j, const Position & p) throw() -{ - return j << json::flat << json::array << p.x << p.y << json::close; -} - - -inline -json & operator << (json & j, const objectid & sid) throw() -{ - return j << sid.name; -} - - -} // namespace graphite2 - -#endif //!defined GRAPHITE2_NTRACING - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/json.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/json.h deleted file mode 100644 index 80ff5b5cbf8..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/json.h +++ /dev/null @@ -1,165 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -// JSON pretty printer for graphite font debug output logging. -// Created on: 15 Dec 2011 -// Author: Tim Eves - -#pragma once -#include "inc/Main.h" -#include -#include - -namespace graphite2 { - -class json -{ - // Prevent copying - json(const json &); - json & operator = (const json &); - - typedef void (*_context_t)(json &); - class _null_t {}; - - FILE * const _stream; - char _contexts[128], // context stack - * _context, // current context (top of stack) - * _flatten; // if !0 points to context above which - // pretty printed output should occur. - - void context(const char current) throw(); - void indent(const int d=0) throw(); - void push_context(const char, const char) throw(); - void pop_context() throw(); - -public: - class closer; - - typedef const char * string; - typedef double number; - typedef long signed int integer; - typedef bool boolean; - static const _null_t null; - - static void flat(json &) throw(); - static void close(json &) throw(); - static void object(json &) throw(); - static void array(json &) throw(); - static void item(json &) throw(); - - json(FILE * stream) throw(); - ~json() throw (); - - FILE * stream() const throw(); - - json & operator << (string) throw(); - json & operator << (number) throw(); - json & operator << (integer) throw(); - json & operator << (long unsigned int d) throw(); - json & operator << (boolean) throw(); - json & operator << (_null_t) throw(); - json & operator << (_context_t) throw(); - - operator bool() const throw(); - bool good() const throw(); - bool eof() const throw(); - - CLASS_NEW_DELETE; -}; - -class json::closer -{ - // Prevent copying. - closer(const closer &); - closer & operator = (const closer &); - - json * const _j; -public: - closer(json * const j) : _j(j) {} - ~closer() throw() { if (_j) *_j << close; } -}; - -inline -json::json(FILE * s) throw() -: _stream(s), _context(_contexts), _flatten(0) -{ - if (good()) - fflush(s); -} - - -inline -json::~json() throw () -{ - while (_context > _contexts) pop_context(); -} - -inline -FILE * json::stream() const throw() { return _stream; } - - -inline -json & json::operator << (json::_context_t ctxt) throw() -{ - ctxt(*this); - return *this; -} - -inline -json & operator << (json & j, signed char d) throw() { return j << json::integer(d); } - -inline -json & operator << (json & j, short signed int d) throw() { return j << json::integer(d); } - -inline -json & operator << (json & j, signed int d) throw() { return j << json::integer(d); } - -inline -json & operator << (json & j, unsigned char d) throw() { return j << json::integer(d); } - -inline -json & operator << (json & j, short unsigned int d) throw() { return j << json::integer(d); } - -inline -json & operator << (json & j, unsigned int d) throw() { return j << json::integer(d); } - -inline -json & operator << (json & j, char c) throw () -{ - const char str[2] = {c,0}; - return j << str; -} - -inline -json::operator bool() const throw() { return good(); } - -inline -bool json::good() const throw() { return _stream && ferror(_stream) == 0; } - -inline -bool json::eof() const throw() { return feof(_stream) != 0; } - -} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/locale2lcid.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/locale2lcid.h deleted file mode 100644 index fc2d384b444..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/locale2lcid.h +++ /dev/null @@ -1,444 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once -#include -#include - -#include "inc/Main.h" - - -namespace graphite2 { - -struct IsoLangEntry -{ - unsigned short mnLang; - const char maLangStr[4]; - const char maCountry[3]; -}; - -// Windows Language ID, Locale ISO-639 language, country code as used in -// naming table of OpenType fonts -const IsoLangEntry LANG_ENTRIES[] = { - { 0x0401, "ar","SA" }, // Arabic Saudi Arabia - { 0x0402, "bg","BG" }, // Bulgarian Bulgaria - { 0x0403, "ca","ES" }, // Catalan Catalan - { 0x0404, "zh","TW" }, // Chinese Taiwan - { 0x0405, "cs","CZ" }, // Czech Czech Republic - { 0x0406, "da","DK" }, // Danish Denmark - { 0x0407, "de","DE" }, // German Germany - { 0x0408, "el","GR" }, // Greek Greece - { 0x0409, "en","US" }, // English United States - { 0x040A, "es","ES" }, // Spanish (Traditional Sort) Spain - { 0x040B, "fi","FI" }, // Finnish Finland - { 0x040C, "fr","FR" }, // French France - { 0x040D, "he","IL" }, // Hebrew Israel - { 0x040E, "hu","HU" }, // Hungarian Hungary - { 0x040F, "is","IS" }, // Icelandic Iceland - { 0x0410, "it","IT" }, // Italian Italy - { 0x0411, "jp","JP" }, // Japanese Japan - { 0x0412, "ko","KR" }, // Korean Korea - { 0x0413, "nl","NL" }, // Dutch Netherlands - { 0x0414, "no","NO" }, // Norwegian (Bokmal) Norway - { 0x0415, "pl","PL" }, // Polish Poland - { 0x0416, "pt","BR" }, // Portuguese Brazil - { 0x0417, "rm","CH" }, // Romansh Switzerland - { 0x0418, "ro","RO" }, // Romanian Romania - { 0x0419, "ru","RU" }, // Russian Russia - { 0x041A, "hr","HR" }, // Croatian Croatia - { 0x041B, "sk","SK" }, // Slovak Slovakia - { 0x041C, "sq","AL" }, // Albanian Albania - { 0x041D, "sv","SE" }, // Swedish Sweden - { 0x041E, "th","TH" }, // Thai Thailand - { 0x041F, "tr","TR" }, // Turkish Turkey - { 0x0420, "ur","PK" }, // Urdu Islamic Republic of Pakistan - { 0x0421, "id","ID" }, // Indonesian Indonesia - { 0x0422, "uk","UA" }, // Ukrainian Ukraine - { 0x0423, "be","BY" }, // Belarusian Belarus - { 0x0424, "sl","SI" }, // Slovenian Slovenia - { 0x0425, "et","EE" }, // Estonian Estonia - { 0x0426, "lv","LV" }, // Latvian Latvia - { 0x0427, "lt","LT" }, // Lithuanian Lithuania - { 0x0428, "tg","TJ" }, // Tajik (Cyrillic) Tajikistan - { 0x042A, "vi","VN" }, // Vietnamese Vietnam - { 0x042B, "hy","AM" }, // Armenian Armenia - { 0x042C, "az","AZ" }, // Azeri (Latin) Azerbaijan - { 0x042D, "eu","" }, // Basque Basque - { 0x042E, "hsb","DE" }, // Upper Sorbian Germany - { 0x042F, "mk","MK" }, // Macedonian (FYROM) Former Yugoslav Republic of Macedonia - { 0x0432, "tn","ZA" }, // Setswana South Africa - { 0x0434, "xh","ZA" }, // isiXhosa South Africa - { 0x0435, "zu","ZA" }, // isiZulu South Africa - { 0x0436, "af","ZA" }, // Afrikaans South Africa - { 0x0437, "ka","GE" }, // Georgian Georgia - { 0x0438, "fo","FO" }, // Faroese Faroe Islands - { 0x0439, "hi","IN" }, // Hindi India - { 0x043A, "mt","MT" }, // Maltese Malta - { 0x043B, "se","NO" }, // Sami (Northern) Norway - { 0x043E, "ms","MY" }, // Malay Malaysia - { 0x043F, "kk","KZ" }, // Kazakh Kazakhstan - { 0x0440, "ky","KG" }, // Kyrgyz Kyrgyzstan - { 0x0441, "sw","KE" }, // Kiswahili Kenya - { 0x0442, "tk","TM" }, // Turkmen Turkmenistan - { 0x0443, "uz","UZ" }, // Uzbek (Latin) Uzbekistan - { 0x0444, "tt","RU" }, // Tatar Russia - { 0x0445, "bn","IN" }, // Bengali India - { 0x0446, "pa","IN" }, // Punjabi India - { 0x0447, "gu","IN" }, // Gujarati India - { 0x0448, "or","IN" }, // Oriya India - { 0x0448, "wo","SN" }, // Wolof Senegal - { 0x0449, "ta","IN" }, // Tamil India - { 0x044A, "te","IN" }, // Telugu India - { 0x044B, "kn","IN" }, // Kannada India - { 0x044C, "ml","IN" }, // Malayalam India - { 0x044D, "as","IN" }, // Assamese India - { 0x044E, "mr","IN" }, // Marathi India - { 0x044F, "sa","IN" }, // Sanskrit India - { 0x0450, "mn","MN" }, // Mongolian (Cyrillic) Mongolia - { 0x0451, "bo","CN" }, // Tibetan PRC - { 0x0452, "cy","GB" }, // Welsh United Kingdom - { 0x0453, "km","KH" }, // Khmer Cambodia - { 0x0454, "lo","LA" }, // Lao Lao P.D.R. - { 0x0455, "my","MM" }, // Burmese Myanmar - not listed in Microsoft docs anymore - { 0x0456, "gl","ES" }, // Galician Galician - { 0x0457, "kok","IN" }, // Konkani India - { 0x045A, "syr","TR" }, // Syriac Syria - { 0x045B, "si","LK" }, // Sinhala Sri Lanka - { 0x045D, "iu","CA" }, // Inuktitut Canada - { 0x045E, "am","ET" }, // Amharic Ethiopia - { 0x0461, "ne","NP" }, // Nepali Nepal - { 0x0462, "fy","NL" }, // Frisian Netherlands - { 0x0463, "ps","AF" }, // Pashto Afghanistan - { 0x0464, "fil","PH" }, // Filipino Philippines - { 0x0465, "dv","MV" }, // Divehi Maldives - { 0x0468, "ha","NG" }, // Hausa (Latin) Nigeria - { 0x046A, "yo","NG" }, // Yoruba Nigeria - { 0x046B, "qu","BO" }, // Quechua Bolivia - { 0x046C, "st","ZA" }, // Sesotho sa Leboa South Africa - { 0x046D, "ba","RU" }, // Bashkir Russia - { 0x046E, "lb","LU" }, // Luxembourgish Luxembourg - { 0x046F, "kl","GL" }, // Greenlandic Greenland - { 0x0470, "ig","NG" }, // Igbo Nigeria - { 0x0478, "ii","CN" }, // Yi PRC - { 0x047A, "arn","CL" }, // Mapudungun Chile - { 0x047C, "moh","CA" }, // Mohawk Mohawk - { 0x047E, "br","FR" }, // Breton France - { 0x0480, "ug","CN" }, // Uighur PRC - { 0x0481, "mi","NZ" }, // Maori New Zealand - { 0x0482, "oc","FR" }, // Occitan France - { 0x0483, "co","FR" }, // Corsican France - { 0x0484, "gsw","FR" }, // Alsatian France - { 0x0485, "sah","RU" }, // Yakut Russia - { 0x0486, "qut","GT" }, // K'iche Guatemala - { 0x0487, "rw","RW" }, // Kinyarwanda Rwanda - { 0x048C, "gbz","AF" }, // Dari Afghanistan - { 0x0801, "ar","IQ" }, // Arabic Iraq - { 0x0804, "zn","CH" }, // Chinese People's Republic of China - { 0x0807, "de","CH" }, // German Switzerland - { 0x0809, "en","GB" }, // English United Kingdom - { 0x080A, "es","MX" }, // Spanish Mexico - { 0x080C, "fr","BE" }, // French Belgium - { 0x0810, "it","CH" }, // Italian Switzerland - { 0x0813, "nl","BE" }, // Dutch Belgium - { 0x0814, "nn","NO" }, // Norwegian (Nynorsk) Norway - { 0x0816, "pt","PT" }, // Portuguese Portugal - { 0x081A, "sh","RS" }, // Serbian (Latin) Serbia - { 0x081D, "sv","FI" }, // Sweden Finland - { 0x082C, "az","AZ" }, // Azeri (Cyrillic) Azerbaijan - { 0x082E, "dsb","DE" }, // Lower Sorbian Germany - { 0x083B, "se","SE" }, // Sami (Northern) Sweden - { 0x083C, "ga","IE" }, // Irish Ireland - { 0x083E, "ms","BN" }, // Malay Brunei Darussalam - { 0x0843, "uz","UZ" }, // Uzbek (Cyrillic) Uzbekistan - { 0x0845, "bn","BD" }, // Bengali Bangladesh - { 0x0850, "mn","MN" }, // Mongolian (Traditional) People's Republic of China - { 0x085D, "iu","CA" }, // Inuktitut (Latin) Canada - { 0x085F, "ber","DZ" }, // Tamazight (Latin) Algeria - { 0x086B, "es","EC" }, // Quechua Ecuador - { 0x0C01, "ar","EG" }, // Arabic Egypt - { 0x0C04, "zh","HK" }, // Chinese Hong Kong S.A.R. - { 0x0C07, "de","AT" }, // German Austria - { 0x0C09, "en","AU" }, // English Australia - { 0x0C0A, "es","ES" }, // Spanish (Modern Sort) Spain - { 0x0C0C, "fr","CA" }, // French Canada - { 0x0C1A, "sr","CS" }, // Serbian (Cyrillic) Serbia - { 0x0C3B, "se","FI" }, // Sami (Northern) Finland - { 0x0C6B, "qu","PE" }, // Quechua Peru - { 0x1001, "ar","LY" }, // Arabic Libya - { 0x1004, "zh","SG" }, // Chinese Singapore - { 0x1007, "de","LU" }, // German Luxembourg - { 0x1009, "en","CA" }, // English Canada - { 0x100A, "es","GT" }, // Spanish Guatemala - { 0x100C, "fr","CH" }, // French Switzerland - { 0x101A, "hr","BA" }, // Croatian (Latin) Bosnia and Herzegovina - { 0x103B, "smj","NO" }, // Sami (Lule) Norway - { 0x1401, "ar","DZ" }, // Arabic Algeria - { 0x1404, "zh","MO" }, // Chinese Macao S.A.R. - { 0x1407, "de","LI" }, // German Liechtenstein - { 0x1409, "en","NZ" }, // English New Zealand - { 0x140A, "es","CR" }, // Spanish Costa Rica - { 0x140C, "fr","LU" }, // French Luxembourg - { 0x141A, "bs","BA" }, // Bosnian (Latin) Bosnia and Herzegovina - { 0x143B, "smj","SE" }, // Sami (Lule) Sweden - { 0x1801, "ar","MA" }, // Arabic Morocco - { 0x1809, "en","IE" }, // English Ireland - { 0x180A, "es","PA" }, // Spanish Panama - { 0x180C, "fr","MC" }, // French Principality of Monoco - { 0x181A, "sh","BA" }, // Serbian (Latin) Bosnia and Herzegovina - { 0x183B, "sma","NO" }, // Sami (Southern) Norway - { 0x1C01, "ar","TN" }, // Arabic Tunisia - { 0x1C09, "en","ZA" }, // English South Africa - { 0x1C0A, "es","DO" }, // Spanish Dominican Republic - { 0x1C1A, "sr","BA" }, // Serbian (Cyrillic) Bosnia and Herzegovina - { 0x1C3B, "sma","SE" }, // Sami (Southern) Sweden - { 0x2001, "ar","OM" }, // Arabic Oman - { 0x2009, "en","JM" }, // English Jamaica - { 0x200A, "es","VE" }, // Spanish Venezuela - { 0x201A, "bs","BA" }, // Bosnian (Cyrillic) Bosnia and Herzegovina - { 0x203B, "sms","FI" }, // Sami (Skolt) Finland - { 0x2401, "ar","YE" }, // Arabic Yemen - { 0x2409, "en","BS" }, // English Caribbean - { 0x240A, "es","CO" }, // Spanish Colombia - { 0x243B, "smn","FI" }, // Sami (Inari) Finland - { 0x2801, "ar","SY" }, // Arabic Syria - { 0x2809, "en","BZ" }, // English Belize - { 0x280A, "es","PE" }, // Spanish Peru - { 0x2C01, "ar","JO" }, // Arabic Jordan - { 0x2C09, "en","TT" }, // English Trinidad and Tobago - { 0x2C0A, "es","AR" }, // Spanish Argentina - { 0x3001, "ar","LB" }, // Arabic Lebanon - { 0x3009, "en","ZW" }, // English Zimbabwe - { 0x300A, "es","EC" }, // Spanish Ecuador - { 0x3401, "ar","KW" }, // Arabic Kuwait - { 0x3409, "en","PH" }, // English Republic of the Philippines - { 0x340A, "es","CL" }, // Spanish Chile - { 0x3801, "ar","AE" }, // Arabic U.A.E. - { 0x380A, "es","UY" }, // Spanish Uruguay - { 0x3C01, "ar","BH" }, // Arabic Bahrain - { 0x3C0A, "es","PY" }, // Spanish Paraguay - { 0x4001, "ar","QA" }, // Arabic Qatar - { 0x4009, "en","IN" }, // English India - { 0x400A, "es","BO" }, // Spanish Bolivia - { 0x4409, "en","MY" }, // English Malaysia - { 0x440A, "es","SV" }, // Spanish El Salvador - { 0x4809, "en","SG" }, // English Singapore - { 0x480A, "es","HN" }, // Spanish Honduras - { 0x4C0A, "es","NI" }, // Spanish Nicaragua - { 0x500A, "es","PR" }, // Spanish Puerto Rico - { 0x540A, "es","US" } // Spanish United States -}; - -class Locale2Lang -{ - Locale2Lang(const Locale2Lang &); - Locale2Lang & operator = (const Locale2Lang &); - -public: - Locale2Lang() : mSeedPosition(128) - { - memset((void*)mLangLookup, 0, sizeof(mLangLookup)); - // create a tri lookup on first 2 letters of language code - static const int maxIndex = sizeof(LANG_ENTRIES)/sizeof(IsoLangEntry); - for (int i = 0; i < maxIndex; i++) - { - size_t a = LANG_ENTRIES[i].maLangStr[0] - 'a'; - size_t b = LANG_ENTRIES[i].maLangStr[1] - 'a'; - if (mLangLookup[a][b]) - { - const IsoLangEntry ** old = mLangLookup[a][b]; - int len = 1; - while (old[len]) len++; - len += 2; - mLangLookup[a][b] = gralloc(len); - mLangLookup[a][b][--len] = NULL; - mLangLookup[a][b][--len] = &LANG_ENTRIES[i]; - while (--len >= 0) - { - assert(len >= 0); - mLangLookup[a][b][len] = old[len]; - } - free(old); - } - else - { - mLangLookup[a][b] = gralloc(2); - mLangLookup[a][b][1] = NULL; - mLangLookup[a][b][0] = &LANG_ENTRIES[i]; - } - } - while (2 * mSeedPosition < maxIndex) - mSeedPosition *= 2; - }; - ~Locale2Lang() - { - for (int i = 0; i != 26; ++i) - for (int j = 0; j != 26; ++j) - free(mLangLookup[i][j]); - } - unsigned short getMsId(const char * locale) const - { - size_t length = strlen(locale); - size_t langLength = length; - const char * language = locale; - const char * script = NULL; - const char * region = NULL; - size_t regionLength = 0; - const char * dash = strchr(locale, '-'); - if (dash && (dash != locale)) - { - langLength = (dash - locale); - size_t nextPartLength = length - langLength - 1; - if (nextPartLength >= 2) - { - script = ++dash; - dash = strchr(dash, '-'); - if (dash) - { - nextPartLength = (dash - script); - region = ++dash; - } - if (nextPartLength == 2 && - (locale[langLength+1] > 0x40) && (locale[langLength+1] < 0x5B) && - (locale[langLength+2] > 0x40) && (locale[langLength+2] < 0x5B)) - { - region = script; - regionLength = nextPartLength; - script = NULL; - } - else if (nextPartLength == 4) - { - if (dash) - { - dash = strchr(dash, '-'); - if (dash) - { - nextPartLength = (dash - region); - } - else - { - nextPartLength = langLength - (region - locale); - } - regionLength = nextPartLength; - } - } - } - } - size_t a = 'e' - 'a'; - size_t b = 'n' - 'a'; - unsigned short langId = 0; - int i = 0; - switch (langLength) - { - case 2: - { - a = language[0] - 'a'; - b = language[1] - 'a'; - if ((a < 26) && (b < 26) && mLangLookup[a][b]) - { - while (mLangLookup[a][b][i]) - { - if (mLangLookup[a][b][i]->maLangStr[2] != '\0') - { - ++i; - continue; - } - if (region && (strncmp(mLangLookup[a][b][i]->maCountry, region, regionLength) == 0)) - { - langId = mLangLookup[a][b][i]->mnLang; - break; - } - else if (langId == 0) - { - // possible fallback code - langId = mLangLookup[a][b][i]->mnLang; - } - ++i; - } - } - } - break; - case 3: - { - a = language[0] - 'a'; - b = language[1] - 'a'; - if (mLangLookup[a][b]) - { - while (mLangLookup[a][b][i]) - { - if (mLangLookup[a][b][i]->maLangStr[2] != language[2]) - { - ++i; - continue; - } - if (strcmp(mLangLookup[a][b][i]->maCountry, region) == 0) - { - langId = mLangLookup[a][b][i]->mnLang; - break; - } - else if (langId == 0) - { - // possible fallback code - langId = mLangLookup[a][b][i]->mnLang; - } - ++i; - } - } - } - break; - default: - break; - } - if (langId == 0) langId = 0x409; - return langId; - } - const IsoLangEntry * findEntryById(unsigned short langId) const - { - static const int maxIndex = sizeof(LANG_ENTRIES)/sizeof(IsoLangEntry); - int window = mSeedPosition; - int guess = mSeedPosition - 1; - while (LANG_ENTRIES[guess].mnLang != langId) - { - window /= 2; - if (window == 0) return NULL; - guess += (LANG_ENTRIES[guess].mnLang > langId)? -window : window; - while (guess >= maxIndex) - { - window /= 2; - guess -= window; - assert(window); - } - } - return &LANG_ENTRIES[guess]; - } - - CLASS_NEW_DELETE; - -private: - const IsoLangEntry ** mLangLookup[26][26]; - int mSeedPosition; -}; - -} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/opcode_table.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/opcode_table.h deleted file mode 100644 index efab472a207..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/opcode_table.h +++ /dev/null @@ -1,120 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -// This file will be pulled into and integrated into a machine implmentation -// DO NOT build directly -#pragma once - -#define do2(n) do_(n) ,do_(n) -#define NILOP 0U - -// types or parameters are: (.. is inclusive) -// number - any byte -// output_class - 0 .. silf.m_nClass -// input_class - 0 .. silf.m_nClass -// sattrnum - 0 .. 29 (gr_slatJWidth) , 55 (gr_slatUserDefn) -// attrid - 0 .. silf.numUser() where sattrnum == 55; 0..silf.m_iMaxComp where sattrnum == 15 otherwise 0 -// gattrnum - 0 .. face->getGlyphFaceCache->numAttrs() -// gmetric - 0 .. 11 (kgmetDescent) -// featidx - 0 .. face.numFeatures() -// level - any byte -static const opcode_t opcode_table[] = -{ - {{do2(nop)}, 0, "NOP"}, - - {{do2(push_byte)}, 1, "PUSH_BYTE"}, // number - {{do2(push_byte_u)}, 1, "PUSH_BYTE_U"}, // number - {{do2(push_short)}, 2, "PUSH_SHORT"}, // number number - {{do2(push_short_u)}, 2, "PUSH_SHORT_U"}, // number number - {{do2(push_long)}, 4, "PUSH_LONG"}, // number number number number - - {{do2(add)}, 0, "ADD"}, - {{do2(sub)}, 0, "SUB"}, - {{do2(mul)}, 0, "MUL"}, - {{do2(div_)}, 0, "DIV"}, - {{do2(min)}, 0, "MIN"}, - {{do2(max)}, 0, "MAX"}, - {{do2(neg)}, 0, "NEG"}, - {{do2(trunc8)}, 0, "TRUNC8"}, - {{do2(trunc16)}, 0, "TRUNC16"}, - - {{do2(cond)}, 0, "COND"}, - {{do2(and_)}, 0, "AND"}, // 0x10 - {{do2(or_)}, 0, "OR"}, - {{do2(not_)}, 0, "NOT"}, - {{do2(equal)}, 0, "EQUAL"}, - {{do2(not_eq_)}, 0, "NOT_EQ"}, - {{do2(less)}, 0, "LESS"}, - {{do2(gtr)}, 0, "GTR"}, - {{do2(less_eq)}, 0, "LESS_EQ"}, - {{do2(gtr_eq)}, 0, "GTR_EQ"}, // 0x18 - - {{do_(next), NILOP}, 0, "NEXT"}, - {{do_(next_n), NILOP}, 1, "NEXT_N"}, // number <= smap.end - map - {{do_(next), NILOP}, 0, "COPY_NEXT"}, - {{do_(put_glyph_8bit_obs), NILOP}, 1, "PUT_GLYPH_8BIT_OBS"}, // output_class - {{do_(put_subs_8bit_obs), NILOP}, 3, "PUT_SUBS_8BIT_OBS"}, // slot input_class output_class - {{do_(put_copy), NILOP}, 1, "PUT_COPY"}, // slot - {{do_(insert), NILOP}, 0, "INSERT"}, - {{do_(delete_), NILOP}, 0, "DELETE"}, // 0x20 - {{do_(assoc), NILOP}, VARARGS, "ASSOC"}, - {{NILOP ,do_(cntxt_item)}, 2, "CNTXT_ITEM"}, // slot offset - - {{do_(attr_set), NILOP}, 1, "ATTR_SET"}, // sattrnum - {{do_(attr_add), NILOP}, 1, "ATTR_ADD"}, // sattrnum - {{do_(attr_sub), NILOP}, 1, "ATTR_SUB"}, // sattrnum - {{do_(attr_set_slot), NILOP}, 1, "ATTR_SET_SLOT"}, // sattrnum - {{do_(iattr_set_slot), NILOP}, 2, "IATTR_SET_SLOT"}, // sattrnum attrid - {{do2(push_slot_attr)}, 2, "PUSH_SLOT_ATTR"}, // sattrnum slot - {{do2(push_glyph_attr_obs)}, 2, "PUSH_GLYPH_ATTR_OBS"}, // gattrnum slot - {{do2(push_glyph_metric)}, 3, "PUSH_GLYPH_METRIC"}, // gmetric slot level - {{do2(push_feat)}, 2, "PUSH_FEAT"}, // featidx slot - - {{do2(push_att_to_gattr_obs)}, 2, "PUSH_ATT_TO_GATTR_OBS"}, // gattrnum slot - {{do2(push_att_to_glyph_metric)}, 3, "PUSH_ATT_TO_GLYPH_METRIC"}, // gmetric slot level - {{do2(push_islot_attr)}, 3, "PUSH_ISLOT_ATTR"}, // sattrnum slot attrid - - {{NILOP,NILOP}, 3, "PUSH_IGLYPH_ATTR"}, - - {{do2(pop_ret)}, 0, "POP_RET"}, // 0x30 - {{do2(ret_zero)}, 0, "RET_ZERO"}, - {{do2(ret_true)}, 0, "RET_TRUE"}, - - {{do_(iattr_set), NILOP}, 2, "IATTR_SET"}, // sattrnum attrid - {{do_(iattr_add), NILOP}, 2, "IATTR_ADD"}, // sattrnum attrid - {{do_(iattr_sub), NILOP}, 2, "IATTR_SUB"}, // sattrnum attrid - {{do2(push_proc_state)}, 1, "PUSH_PROC_STATE"}, // dummy - {{do2(push_version)}, 0, "PUSH_VERSION"}, - {{do_(put_subs), NILOP}, 5, "PUT_SUBS"}, // slot input_class input_class output_class output_class - {{NILOP,NILOP}, 0, "PUT_SUBS2"}, - {{NILOP,NILOP}, 0, "PUT_SUBS3"}, - {{do_(put_glyph), NILOP}, 2, "PUT_GLYPH"}, // output_class output_class - {{do2(push_glyph_attr)}, 3, "PUSH_GLYPH_ATTR"}, // gattrnum gattrnum slot - {{do2(push_att_to_glyph_attr)}, 3, "PUSH_ATT_TO_GLYPH_ATTR"}, // gattrnum gattrnum slot - // private internal private opcodes for internal use only, comes after all other on disk opcodes. - {{do_(temp_copy), NILOP}, 0, "TEMP_COPY"} -}; - diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/opcodes.h b/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/opcodes.h deleted file mode 100644 index 6127c8ff359..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/inc/opcodes.h +++ /dev/null @@ -1,644 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -#pragma once -// This file will be pulled into and integrated into a machine implmentation -// DO NOT build directly and under no circumstances every #include headers in -// here or you will break the direct_machine. -// -// Implementers' notes -// ================== -// You have access to a few primitives and the full C++ code: -// declare_params(n) Tells the interpreter how many bytes of parameter -// space to claim for this instruction uses and -// initialises the param pointer. You *must* before the -// first use of param. -// use_params(n) Claim n extra bytes of param space beyond what was -// claimed using delcare_param. -// param A const byte pointer for the parameter space claimed by -// this instruction. -// binop(op) Implement a binary operation on the stack using the -// specified C++ operator. -// NOT_IMPLEMENTED Any instruction body containing this will exit the -// program with an assertion error. Instructions that are -// not implemented should also be marked NILOP in the -// opcodes tables this will cause the code class to spot -// them in a live code stream and throw a runtime_error -// instead. -// push(n) Push the value n onto the stack. -// pop() Pop the top most value and return it. -// -// You have access to the following named fast 'registers': -// sp = The pointer to the current top of stack, the last value -// pushed. -// seg = A reference to the Segment this code is running over. -// is = The current slot index -// isb = The original base slot index at the start of this rule -// isf = The first positioned slot -// isl = The last positioned slot -// ip = The current instruction pointer -// endPos = Position of advance of last cluster - - -// #define NOT_IMPLEMENTED assert(false) -#define NOT_IMPLEMENTED - -#define binop(op) const int32 a = pop(); *sp = int32(*sp) op a -#define use_params(n) dp += n - -#define declare_params(n) const byte * param = dp; \ - use_params(n); - -#define push(n) { *++sp = n; } -#define pop() (*sp--) -#define slotat(x) (map[(x)]) -#define DIE { is=seg.last(); EXIT(1); } -#define POSITIONED 1 - -STARTOP(nop) - do {} while (0); -ENDOP - -STARTOP(push_byte) - declare_params(1); - push(int8(*param)); -ENDOP - -STARTOP(push_byte_u) - declare_params(1); - push(uint8(*param)); -ENDOP - -STARTOP(push_short) - declare_params(2); - const int16 r = int16(param[0]) << 8 - | uint8(param[1]); - push(r); -ENDOP - -STARTOP(push_short_u) - declare_params(2); - const uint16 r = uint16(param[0]) << 8 - | uint8(param[1]); - push(r); -ENDOP - -STARTOP(push_long) - declare_params(4); - const int32 r = int32(param[0]) << 24 - | uint32(param[1]) << 16 - | uint32(param[2]) << 8 - | uint8(param[3]); - push(r); -ENDOP - -STARTOP(add) - binop(+); -ENDOP - -STARTOP(sub) - binop(-); -ENDOP - -STARTOP(mul) - binop(*); -ENDOP - -STARTOP(div_) - if (*sp == 0) DIE; - binop(/); -ENDOP - -STARTOP(min) - const int32 a = pop(), b = *sp; - if (a < b) *sp = a; -ENDOP - -STARTOP(max) - const int32 a = pop(), b = *sp; - if (a > b) *sp = a; -ENDOP - -STARTOP(neg) - *sp = uint32(-int32(*sp)); -ENDOP - -STARTOP(trunc8) - *sp = uint8(*sp); -ENDOP - -STARTOP(trunc16) - *sp = uint16(*sp); -ENDOP - -STARTOP(cond) - const uint32 f = pop(), t = pop(), c = pop(); - push(c ? t : f); -ENDOP - -STARTOP(and_) - binop(&&); -ENDOP - -STARTOP(or_) - binop(||); -ENDOP - -STARTOP(not_) - *sp = !*sp; -ENDOP - -STARTOP(equal) - binop(==); -ENDOP - -STARTOP(not_eq_) - binop(!=); -ENDOP - -STARTOP(less) - binop(<); -ENDOP - -STARTOP(gtr) - binop(>); -ENDOP - -STARTOP(less_eq) - binop(<=); -ENDOP - -STARTOP(gtr_eq) - binop(>=); -ENDOP - -STARTOP(next) - if (map - &smap[0] >= int(smap.size())) DIE - if (is) - { - if (is == smap.highwater()) - smap.highpassed(true); - is = is->next(); - } - ++map; -ENDOP - -STARTOP(next_n) - use_params(1); - NOT_IMPLEMENTED; - //declare_params(1); - //const size_t num = uint8(*param); -ENDOP - -//STARTOP(copy_next) -// if (is) is = is->next(); -// ++map; -// ENDOP - -STARTOP(put_glyph_8bit_obs) - declare_params(1); - const unsigned int output_class = uint8(*param); - is->setGlyph(&seg, seg.getClassGlyph(output_class, 0)); -ENDOP - -STARTOP(put_subs_8bit_obs) - declare_params(3); - const int slot_ref = int8(param[0]); - const unsigned int input_class = uint8(param[1]), - output_class = uint8(param[2]); - uint16 index; - slotref slot = slotat(slot_ref); - if (slot) - { - index = seg.findClassIndex(input_class, slot->gid()); - is->setGlyph(&seg, seg.getClassGlyph(output_class, index)); - } -ENDOP - -STARTOP(put_copy) - declare_params(1); - const int slot_ref = int8(*param); - if (is && (slot_ref ||is != *map)) - { - int16 *tempUserAttrs = is->userAttrs(); - slotref ref = slotat(slot_ref); - if (ref) - { - memcpy(tempUserAttrs, ref->userAttrs(), seg.numAttrs() * sizeof(uint16)); - Slot *prev = is->prev(); - Slot *next = is->next(); - memcpy(is, slotat(slot_ref), sizeof(Slot)); - is->userAttrs(tempUserAttrs); - is->next(next); - is->prev(prev); - is->sibling(NULL); - } - is->markCopied(false); - is->markDeleted(false); - } -ENDOP - -STARTOP(insert) - Slot *newSlot = seg.newSlot(); - Slot *iss = is; - while (iss && iss->isDeleted()) iss = iss->next(); - if (!iss) - { - if (seg.last()) - { - seg.last()->next(newSlot); - newSlot->prev(seg.last()); - newSlot->before(seg.last()->before()); - seg.last(newSlot); - } - else - { - seg.first(newSlot); - seg.last(newSlot); - } - } - else if (iss->prev()) - { - iss->prev()->next(newSlot); - newSlot->prev(iss->prev()); - newSlot->before(iss->prev()->after()); - } - else - { - newSlot->prev(NULL); - newSlot->before(iss->before()); - seg.first(newSlot); - } - newSlot->next(iss); - if (iss) - { - iss->prev(newSlot); - newSlot->originate(iss->original()); - newSlot->after(iss->before()); - } - else if (newSlot->prev()) - { - newSlot->originate(newSlot->prev()->original()); - newSlot->after(newSlot->prev()->after()); - } - else - { - newSlot->originate(seg.defaultOriginal()); - } - is = newSlot; - seg.extendLength(1); - if (map != &smap[-1]) - --map; -ENDOP - -STARTOP(delete_) - if (!is) DIE - is->markDeleted(true); - if (is->prev()) - is->prev()->next(is->next()); - else - seg.first(is->next()); - - if (is->next()) - is->next()->prev(is->prev()); - else - seg.last(is->prev()); - - if (is == smap.highwater()) - smap.highwater(is->next()); - if (is->prev()) - is = is->prev(); - seg.extendLength(-1); -ENDOP - -STARTOP(assoc) - declare_params(1); - unsigned int num = uint8(*param); - const int8 * assocs = reinterpret_cast(param+1); - use_params(num); - int max = -1; - int min = -1; - - while (num-- > 0) - { - int sr = *assocs++; - slotref ts = slotat(sr); - if (ts && (min == -1 || ts->before() < min)) min = ts->before(); - if (ts && ts->after() > max) max = ts->after(); - } - if (min > -1) // implies max > -1 - { - is->before(min); - is->after(max); - } -ENDOP - -STARTOP(cntxt_item) - // It turns out this is a cunningly disguised condition forward jump. - declare_params(3); - const int is_arg = int8(param[0]); - const size_t iskip = uint8(param[1]), - dskip = uint8(param[2]); - - if (mapb + is_arg != map) - { - ip += iskip; - dp += dskip; - push(true); - } -ENDOP - -STARTOP(attr_set) - declare_params(1); - const attrCode slat = attrCode(uint8(*param)); - const int val = int(pop()); - is->setAttr(&seg, slat, 0, val, smap); -ENDOP - -STARTOP(attr_add) - declare_params(1); - const attrCode slat = attrCode(uint8(*param)); - const int val = int(pop()); - if ((slat == gr_slatPosX || slat == gr_slatPosY) && (flags & POSITIONED) == 0) - { - seg.positionSlots(0, *smap.begin(), *(smap.end()-1)); - flags |= POSITIONED; - } - int res = is->getAttr(&seg, slat, 0); - is->setAttr(&seg, slat, 0, val + res, smap); -ENDOP - -STARTOP(attr_sub) - declare_params(1); - const attrCode slat = attrCode(uint8(*param)); - const int val = int(pop()); - if ((slat == gr_slatPosX || slat == gr_slatPosY) && (flags & POSITIONED) == 0) - { - seg.positionSlots(0, *smap.begin(), *(smap.end()-1)); - flags |= POSITIONED; - } - int res = is->getAttr(&seg, slat, 0); - is->setAttr(&seg, slat, 0, res - val, smap); -ENDOP - -STARTOP(attr_set_slot) - declare_params(1); - const attrCode slat = attrCode(uint8(*param)); - const int offset = (map - smap.begin())*int(slat == gr_slatAttTo); - const int val = int(pop()) + offset; - is->setAttr(&seg, slat, offset, val, smap); -ENDOP - -STARTOP(iattr_set_slot) - declare_params(2); - const attrCode slat = attrCode(uint8(param[0])); - const size_t idx = uint8(param[1]); - const int val = int(pop()) + (map - smap.begin())*int(slat == gr_slatAttTo); - is->setAttr(&seg, slat, idx, val, smap); -ENDOP - -STARTOP(push_slot_attr) - declare_params(2); - const attrCode slat = attrCode(uint8(param[0])); - const int slot_ref = int8(param[1]); - if ((slat == gr_slatPosX || slat == gr_slatPosY) && (flags & POSITIONED) == 0) - { - seg.positionSlots(0, *smap.begin(), *(smap.end()-1)); - flags |= POSITIONED; - } - slotref slot = slotat(slot_ref); - if (slot) - { - int res = slot->getAttr(&seg, slat, 0); - push(res); - } -ENDOP - -STARTOP(push_glyph_attr_obs) - declare_params(2); - const unsigned int glyph_attr = uint8(param[0]); - const int slot_ref = int8(param[1]); - slotref slot = slotat(slot_ref); - if (slot) - push(seg.glyphAttr(slot->gid(), glyph_attr)); -ENDOP - -STARTOP(push_glyph_metric) - declare_params(3); - const unsigned int glyph_attr = uint8(param[0]); - const int slot_ref = int8(param[1]); - const signed int attr_level = uint8(param[2]); - slotref slot = slotat(slot_ref); - if (slot) - push(seg.getGlyphMetric(slot, glyph_attr, attr_level)); -ENDOP - -STARTOP(push_feat) - declare_params(2); - const unsigned int feat = uint8(param[0]); - const int slot_ref = int8(param[1]); - slotref slot = slotat(slot_ref); - if (slot) - { - uint8 fid = seg.charinfo(slot->original())->fid(); - push(seg.getFeature(fid, feat)); - } -ENDOP - -STARTOP(push_att_to_gattr_obs) - declare_params(2); - const unsigned int glyph_attr = uint8(param[0]); - const int slot_ref = int8(param[1]); - slotref slot = slotat(slot_ref); - if (slot) - { - slotref att = slot->attachedTo(); - if (att) slot = att; - push(seg.glyphAttr(slot->gid(), glyph_attr)); - } -ENDOP - -STARTOP(push_att_to_glyph_metric) - declare_params(3); - const unsigned int glyph_attr = uint8(param[0]); - const int slot_ref = int8(param[1]); - const signed int attr_level = uint8(param[2]); - slotref slot = slotat(slot_ref); - if (slot) - { - slotref att = slot->attachedTo(); - if (att) slot = att; - push(seg.getGlyphMetric(slot, glyph_attr, attr_level)); - } -ENDOP - -STARTOP(push_islot_attr) - declare_params(3); - const attrCode slat = attrCode(uint8(param[0])); - const int slot_ref = int8(param[1]), - idx = uint8(param[2]); - if ((slat == gr_slatPosX || slat == gr_slatPosY) && (flags & POSITIONED) == 0) - { - seg.positionSlots(0, *smap.begin(), *(smap.end()-1)); - flags |= POSITIONED; - } - slotref slot = slotat(slot_ref); - if (slot) - { - int res = slot->getAttr(&seg, slat, idx); - push(res); - } -ENDOP - -#if 0 -STARTOP(push_iglyph_attr) // not implemented - NOT_IMPLEMENTED; -ENDOP -#endif - -STARTOP(pop_ret) - const uint32 ret = pop(); - EXIT(ret); -ENDOP - -STARTOP(ret_zero) - EXIT(0); -ENDOP - -STARTOP(ret_true) - EXIT(1); -ENDOP - -STARTOP(iattr_set) - declare_params(2); - const attrCode slat = attrCode(uint8(param[0])); - const size_t idx = uint8(param[1]); - const int val = int(pop()); - is->setAttr(&seg, slat, idx, val, smap); -ENDOP - -STARTOP(iattr_add) - declare_params(2); - const attrCode slat = attrCode(uint8(param[0])); - const size_t idx = uint8(param[1]); - const int val = int(pop()); - if ((slat == gr_slatPosX || slat == gr_slatPosY) && (flags & POSITIONED) == 0) - { - seg.positionSlots(0, *smap.begin(), *(smap.end()-1)); - flags |= POSITIONED; - } - int res = is->getAttr(&seg, slat, idx); - is->setAttr(&seg, slat, idx, val + res, smap); -ENDOP - -STARTOP(iattr_sub) - declare_params(2); - const attrCode slat = attrCode(uint8(param[0])); - const size_t idx = uint8(param[1]); - const int val = int(pop()); - if ((slat == gr_slatPosX || slat == gr_slatPosY) && (flags & POSITIONED) == 0) - { - seg.positionSlots(0, *smap.begin(), *(smap.end()-1)); - flags |= POSITIONED; - } - int res = is->getAttr(&seg, slat, idx); - is->setAttr(&seg, slat, idx, res - val, smap); -ENDOP - -STARTOP(push_proc_state) - use_params(1); - push(1); -ENDOP - -STARTOP(push_version) - push(0x00030000); -ENDOP - -STARTOP(put_subs) - declare_params(5); - const int slot_ref = int8(param[0]); - const unsigned int input_class = uint8(param[1]) << 8 - | uint8(param[2]); - const unsigned int output_class = uint8(param[3]) << 8 - | uint8(param[4]); - slotref slot = slotat(slot_ref); - if (slot) - { - int index = seg.findClassIndex(input_class, slot->gid()); - is->setGlyph(&seg, seg.getClassGlyph(output_class, index)); - } -ENDOP - -#if 0 -STARTOP(put_subs2) // not implemented - NOT_IMPLEMENTED; -ENDOP - -STARTOP(put_subs3) // not implemented - NOT_IMPLEMENTED; -ENDOP -#endif - -STARTOP(put_glyph) - declare_params(2); - const unsigned int output_class = uint8(param[0]) << 8 - | uint8(param[1]); - is->setGlyph(&seg, seg.getClassGlyph(output_class, 0)); -ENDOP - -STARTOP(push_glyph_attr) - declare_params(3); - const unsigned int glyph_attr = uint8(param[0]) << 8 - | uint8(param[1]); - const int slot_ref = int8(param[2]); - slotref slot = slotat(slot_ref); - if (slot) - push(seg.glyphAttr(slot->gid(), glyph_attr)); -ENDOP - -STARTOP(push_att_to_glyph_attr) - declare_params(3); - const unsigned int glyph_attr = uint8(param[0]) << 8 - | uint8(param[1]); - const int slot_ref = int8(param[2]); - slotref slot = slotat(slot_ref); - if (slot) - { - slotref att = slot->attachedTo(); - if (att) slot = att; - push(seg.glyphAttr(slot->gid(), glyph_attr)); - } -ENDOP - -STARTOP(temp_copy) - slotref newSlot = seg.newSlot(); - int16 *tempUserAttrs = newSlot->userAttrs(); - memcpy(newSlot, is, sizeof(Slot)); - memcpy(tempUserAttrs, is->userAttrs(), seg.numAttrs() * sizeof(uint16)); - newSlot->userAttrs(tempUserAttrs); - newSlot->markCopied(true); - *map = newSlot; -ENDOP diff --git a/Build/source/libs/graphite2/graphite2-1.2.0/src/json.cpp b/Build/source/libs/graphite2/graphite2-1.2.0/src/json.cpp deleted file mode 100644 index c10037f3afe..00000000000 --- a/Build/source/libs/graphite2/graphite2-1.2.0/src/json.cpp +++ /dev/null @@ -1,126 +0,0 @@ -/* GRAPHITE2 LICENSING - - Copyright 2010, SIL International - All rights reserved. - - This library is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published - by the Free Software Foundation; either version 2.1 of License, or - (at your option) any later version. - - This program 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 for more details. - - You should also have received a copy of the GNU Lesser General Public - License along with this library in the file named "LICENSE". - If not, write to the Free Software Foundation, 51 Franklin Street, - Suite 500, Boston, MA 02110-1335, USA or visit their web page on the - internet at http://www.fsf.org/licenses/lgpl.html. - -Alternatively, the contents of this file may be used under the terms of the -Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public -License, as published by the Free Software Foundation, either version 2 -of the License or (at your option) any later version. -*/ -// JSON debug logging -// Author: Tim Eves - -#if !defined GRAPHITE2_NTRACING - -#include -#include "inc/json.h" - -using namespace graphite2; - -namespace -{ - enum - { - seq = ',', - obj='}', member=':', empty_obj='{', - arr=']', empty_arr='[' - }; -} - -const json::_null_t json::null = {}; - -inline -void json::context(const char current) throw() -{ - fprintf(_stream, "%c", *_context); - indent(); - *_context = current; -} - - -void json::indent(const int d) throw() -{ - if (*_context == member || (_flatten && _flatten < _context)) - fputc(' ', _stream); - else - fprintf(_stream, "\n%*s", 4*int(_context - _contexts + d), ""); -} - - -inline -void json::push_context(const char prefix, const char suffix) throw() -{ - assert(_context - _contexts < ptrdiff_t(sizeof _contexts)); - - if (_context == _contexts) - *_context = suffix; - else - context(suffix); - *++_context = prefix; -} - - -void json::pop_context() throw() -{ - assert(_context > _contexts); - - if (*_context == seq) indent(-1); - else fputc(*_context, _stream); - - fputc(*--_context, _stream); - if (_context == _contexts) fputc('\n', _stream); - fflush(_stream); - - if (_flatten >= _context) _flatten = 0; - *_context = seq; -} - - -// These four functions cannot be inlined as pointers to these -// functions are needed for operator << (_context_t) to work. -void json::flat(json & j) throw() { if (!j._flatten) j._flatten = j._context; } -void json::close(json & j) throw() { j.pop_context(); } -void json::object(json & j) throw() { j.push_context('{', '}'); } -void json::array(json & j) throw() { j.push_context('[', ']'); } -void json::item(json & j) throw() -{ - while (j._context > j._contexts+1 && j._context[-1] != arr) - j.pop_context(); -} - - -json & json::operator << (json::string s) throw() -{ - const char ctxt = _context[-1] == obj ? *_context == member ? seq : member : seq; - context(ctxt); - fprintf(_stream, "\"%s\"", s); - if (ctxt == member) fputc(' ', _stream); - - return *this; -} - -json & json::operator << (json::number f) throw() { context(seq); fprintf(_stream, "%g", f); return *this; } -json & json::operator << (json::integer d) throw() { context(seq); fprintf(_stream, "%ld", d); return *this; } -json & json::operator << (long unsigned d) throw() { context(seq); fprintf(_stream, "%ld", d); return *this; } -json & json::operator << (json::boolean b) throw() { context(seq); fputs(b ? "true" : "false", _stream); return *this; } -json & json::operator << (json::_null_t) throw() { context(seq); fputs("null",_stream); return *this; } - -#endif - diff --git a/Build/source/libs/graphite2/graphite2-1.2.1-PATCHES/ChangeLog b/Build/source/libs/graphite2/graphite2-1.2.1-PATCHES/ChangeLog new file mode 100644 index 00000000000..52de1e7063e --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1-PATCHES/ChangeLog @@ -0,0 +1,22 @@ +2013-03-07 Peter Breitenlohner + + Imported graphite2-1.2.1 source tree from: + http://sourceforge.net/projects/silgraphite/files/graphite2/ + + * patch-02-attribute-hot (removed): Now in graphite2-1.2.1. + * patch-01-case-sensitive: Adapted. + +2012-12-06 Peter Breitenlohner + + * patch-03-old-gcc (removed): No longer needed since HarfBuzz + requires gcc-4.x. + +2012-12-04 Peter Breitenlohner + + Imported graphite2-1.2.0 source tree from: + http://sourceforge.net/projects/silgraphite/files/graphite2/ + + * patch-01-case-sensitive (new): Windows.h => windows.h. + * patch-02-attribute-hot (new): Test for gcc-4.3 or better. + * patch-03-old-gcc (new): Allow to build with, e.g., gcc-3.4. + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1-PATCHES/TL-Changes b/Build/source/libs/graphite2/graphite2-1.2.1-PATCHES/TL-Changes new file mode 100644 index 00000000000..e1c90c4155c --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1-PATCHES/TL-Changes @@ -0,0 +1,10 @@ +Changes applied to the graphite2-1.2.1/ tree as obtained from: + http://sourceforge.net/projects/silgraphite/files/graphite2/ + +Removed unused dirs: + contrib + debian-src + doc + gr2fonttest + tests + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1-PATCHES/patch-01-case-sensitive b/Build/source/libs/graphite2/graphite2-1.2.1-PATCHES/patch-01-case-sensitive new file mode 100644 index 00000000000..8aa3e1af313 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1-PATCHES/patch-01-case-sensitive @@ -0,0 +1,14 @@ + Required for case-sensitive filesystems. + +diff -ur graphite2-1.2.1.orig/src/gr_logging.cpp graphite2-1.2.1/src/gr_logging.cpp +--- graphite2-1.2.1.orig/src/gr_logging.cpp 2013-02-27 20:32:04.000000000 +0100 ++++ graphite2-1.2.1/src/gr_logging.cpp 2013-03-07 15:26:32.000000000 +0100 +@@ -33,7 +33,7 @@ + #include "inc/Segment.h" + + #if defined _WIN32 +-#include "Windows.h" ++#include "windows.h" + #endif + + using namespace graphite2; diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/.hg_archival.txt b/Build/source/libs/graphite2/graphite2-1.2.1/.hg_archival.txt new file mode 100644 index 00000000000..039e20ac0da --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/.hg_archival.txt @@ -0,0 +1,4 @@ +repo: 999e2033695c3bcf2f65d611737ac9008805bd58 +node: 9ca2c8c1469f6107cd366e4be2035ce0dfa09b65 +branch: default +tag: 1.2.1 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/.hgeol b/Build/source/libs/graphite2/graphite2-1.2.1/.hgeol new file mode 100644 index 00000000000..5eb1fc19d0f --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/.hgeol @@ -0,0 +1,15 @@ +[patterns] +**.c = native +**.cfg = native +**.cpp = native +**.gdh = native +**.h = native +**.json = native +**.log = native +**.pdf = BIN +**.sh = native +**.txt = native +**.ttf = BIN + +[repository] +native=LF diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/.hgignore b/Build/source/libs/graphite2/graphite2-1.2.1/.hgignore new file mode 100644 index 00000000000..5934da4b3c8 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/.hgignore @@ -0,0 +1,34 @@ +syntax:glob +*~ +*.bak +m4 +autom4te.cache +config +configure +config.status +config.log +aclocal.m4 +libtool +Makefile.in +Makefile +msvs9 +vs9 +nmake* +*.o +*.lo +*.Plo +*.swp +*.la +*.kdev4 +.cproject +.project +.pydevproject + +syntax:regexp +\.libs/ +\.deps/ +\.externalToolBuilders +build*/ +release/ +debug/ +dev/ diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/.hgtags b/Build/source/libs/graphite2/graphite2-1.2.1/.hgtags new file mode 100644 index 00000000000..164d8ba9a73 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/.hgtags @@ -0,0 +1,27 @@ +c36cd69f32ac9daace9f8784063567d81328e778 base +e0db725d6db85c49389176f2ee460366f080c023 Release 0.9 +3a92b51d7167e16c31b963924bd01964d6eb7e63 r0.9.1 +5369cdd121206c950113de37f4886152aa86cc98 0.9.2 +3ec0de96c2229e975b1452f9a92c4ab3845c0ad2 0.9.3 +50901246031365c63fb826a18a5ca52099201d93 0.9.4 +b8a64c4a89f5d742553a7cc3cfddb6b3e08e1fa0 1.0.0 +bedb05f72d56f24ca0fc333fd14eabb1ec553902 1.0.1 +bedb05f72d56f24ca0fc333fd14eabb1ec553902 1.0.1 +0000000000000000000000000000000000000000 1.0.1 +0000000000000000000000000000000000000000 1.0.1 +01df4f7cc7b0f31f8490b4246b298ac10d92675e 1.0.1 +0fa690ff089ce0bc382a553cc01c0b721fbdee5c 1.0.2 +0fa690ff089ce0bc382a553cc01c0b721fbdee5c 1.0.2 +b10bcaf1302411513a5961d1854ff8c02e5ad5e6 1.0.2 +8795e344f7964bdf8ef4607004f01b94c41e5775 1.0.3 +8795e344f7964bdf8ef4607004f01b94c41e5775 1.0.3 +0000000000000000000000000000000000000000 1.0.3 +0000000000000000000000000000000000000000 1.0.3 +f148746a0d99d2f9bc050906ce78815565a0d0b4 1.0.3 +afdc9c2e4cf341560dfcb985b66e52793d1987af 1.1.0 +afdc9c2e4cf341560dfcb985b66e52793d1987af 1.1.0 +22dfbf9cd047667eef87602eacf2ac1e84ec20d7 1.1.0 +e095cd8b635aa985c8054717761555b6d46dbdb6 1.1.1 +1ffaabe61f501b7a0b9217f4b82f21ac6a7af212 1.1.2 +d8c8ce7898a9e73a9cb11c25b9ff6a198fdf8d80 1.1.3 +fb4b0c347a953f6aa656a4e414f8e42e91c00c2b 1.2.0 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/CMakeLists.txt b/Build/source/libs/graphite2/graphite2-1.2.1/CMakeLists.txt new file mode 100644 index 00000000000..c142371f063 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/CMakeLists.txt @@ -0,0 +1,73 @@ +CMAKE_MINIMUM_REQUIRED(VERSION 2.8.0 FATAL_ERROR) +cmake_policy(SET CMP0012 NEW) +include(TestBigEndian) + +project(graphite2) +set(CMAKE_MODULE_PATH ${PROJECT_SOURCE_DIR}) +if (NOT CMAKE_BUILD_TYPE) + set_property(CACHE CMAKE_BUILD_TYPE PROPERTY VALUE Release) +endif (NOT CMAKE_BUILD_TYPE) +#if (CMAKE_BUILD_TYPE STREQUAL ClangASN) +# add_definitions(-faddress-sanitizer -fno-omit-frame-pointer) +# set_property(CACHE CMAKE_C_COMPILER PROPERTY VALUE clang) +# set_property(CACHE CMAKE_CXX_COMPILER PROPERTY VALUE clang) +#endif (CMAKE_BUILD_TYPE STREQUAL ClangASN) + +enable_language(CXX C) + +include_directories(${PROJECT_SOURCE_DIR}/include) +if (CMAKE_BUILD_TYPE STREQUAL ClangASN) + add_definitions(-faddress-sanitizer -fno-omit-frame-pointer) +endif (CMAKE_BUILD_TYPE STREQUAL ClangASN) + +enable_testing() + +set(GRAPHITE2_VM_TYPE auto CACHE STRING "Choose the type of vm machine: Auto, Direct or Call.") +option(GRAPHITE2_NSEGCACHE "Compile out the gr_*_with_seg_cache APIs") +option(GRAPHITE2_NFILEFACE "Compile out the gr_make_file_face* APIs") +option(GRAPHITE2_NTRACING "Compile out log segment tracing capability") + + +message(STATUS "Build: " ${CMAKE_BUILD_TYPE}) +string(REPLACE "ON" "disabled" _SEGCACHE_SUPPORT ${GRAPHITE2_NSEGCACHE}) +string(REPLACE "OFF" "enabled" _SEGCACHE_SUPPORT ${_SEGCACHE_SUPPORT}) +string(REPLACE "ON" "disabled" _FILEFACE_SUPPORT ${GRAPHITE2_NFILEFACE}) +string(REPLACE "OFF" "enabled" _FILEFACE_SUPPORT ${_FILEFACE_SUPPORT}) +string(REPLACE "ON" "disabled" _TRACING_SUPPORT ${GRAPHITE2_NTRACING}) +string(REPLACE "OFF" "enabled" _TRACING_SUPPORT ${_TRACING_SUPPORT}) +message(STATUS "Segment Cache support: " ${_SEGCACHE_SUPPORT}) +message(STATUS "File Face support: " ${_FILEFACE_SUPPORT}) +message(STATUS "Tracing support: " ${_TRACING_SUPPORT}) + +string(TOLOWER ${GRAPHITE2_VM_TYPE} GRAPHITE2_VM_TYPE) +if (NOT GRAPHITE2_VM_TYPE MATCHES "auto|direct|call") + message(SEND_ERROR "unrecognised vm machine type: ${GRAPHITE2_VM_TYPE}. Only Auto, Direct or Call are available") +endif (NOT GRAPHITE2_VM_TYPE MATCHES "auto|direct|call") +if (GRAPHITE2_VM_TYPE STREQUAL "auto") + if (CMAKE_BUILD_TYPE MATCHES "[Rr]el(ease|[Ww]ith[Dd]eb[Ii]nfo)") + set(GRAPHITE2_VM_TYPE "direct") + else(CMAKE_BUILD_TYPE MATCHES "[Rr]el(ease|[Ww]ith[Dd]eb[Ii]nfo)") + set(GRAPHITE2_VM_TYPE "call") + endif(CMAKE_BUILD_TYPE MATCHES "[Rr]el(ease|[Ww]ith[Dd]eb[Ii]nfo)") +endif (GRAPHITE2_VM_TYPE STREQUAL "auto") +if (GRAPHITE2_VM_TYPE STREQUAL "direct" AND NOT (CMAKE_COMPILER_IS_GNUCXX OR CMAKE_BASE_NAME STREQUAL "clang++")) + message(WARNING "vm machine type direct can only be built using GCC") + set(GRAPHITE2_VM_TYPE "call") +endif (GRAPHITE2_VM_TYPE STREQUAL "direct" AND NOT (CMAKE_COMPILER_IS_GNUCXX OR CMAKE_BASE_NAME STREQUAL "clang++")) +message(STATUS "Using vm machine type: ${GRAPHITE2_VM_TYPE}") + +add_subdirectory(src) +add_subdirectory(tests) +add_subdirectory(doc) +if (NOT (GRAPHITE2_NSEGCACHE OR GRAPHITE2_NFILEFACE)) + add_subdirectory(gr2fonttest) +endif (NOT (GRAPHITE2_NSEGCACHE OR GRAPHITE2_NFILEFACE)) + +set(version 3.0.1) +set(libdir ${CMAKE_INSTALL_PREFIX}/lib${LIB_SUFFIX}) +set(includedir ${CMAKE_INSTALL_PREFIX}/include) + +configure_file(graphite2.pc.in graphite2.pc) + +install(FILES ${PROJECT_BINARY_DIR}/graphite2.pc DESTINATION lib${LIB_SUFFIX}/pkgconfig) + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/COPYING b/Build/source/libs/graphite2/graphite2-1.2.1/COPYING new file mode 100644 index 00000000000..d40f2d84587 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/COPYING @@ -0,0 +1,26 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + + Alternatively, you may use this library under the terms of the Mozilla + Public License (http://mozilla.org/MPL) or under the GNU General Public + License, as published by the Free Sofware Foundation; either version + 2 of the license or (at your option) any later version. +*/ diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/ChangeLog b/Build/source/libs/graphite2/graphite2-1.2.1/ChangeLog new file mode 100644 index 00000000000..f6cd4b369f0 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/ChangeLog @@ -0,0 +1,96 @@ +1.2.1 + . Bug fixes: + . Allow glyph reattachment + . Allow signed glyph attributes + . Various build problems with MacOS, old gcc versions, etc. + . Various overrun read errors fixed + +1.2.0 + . API Changes: + . Added Windows friendly gr_start_logging and gr_stop_logging, now per face + . Added gr_make_face_with_ops, gr_make_face_with_seg_cache_and_ops + . Added gr_make_font_with_ops + . Added gr_face_is_char_supported + . Added gr_face_info to give info to apps about face capabilities + . Deprecated gr_make_face, gr_make_face_with_seg_cache, gr_make_font_with_advance_fn + . Deprecated graphite_start_logging and graphite_stop_logging + . These functions are stubbed now and do nothing, but do compile and link. + . Bump API version to 3 + . Add C# wrapper to contrib + . Handle justification information in a font and do something useful with it + . Builds clang clean (has done for a while) + . Bug fixes + . Windows build and bug fixes + . Add extra information to json debug output + . Added windows build documentation + . Added freetype sample code and test + +1.1.3 + . Default build has GRAPHITE2_COMPARE_RENDERER to OFF to reduce dependencies + . Builds on Mac with clang + . Debug output improvements + . Tidy up perl wrappers + . Fuzz tester improvements + . Various bug fixes for bad font handling +1.1.2 + . Support feature ids < 4 chars when space padded for inclusion in FF 14. + . More fuzztesting and removal of causes of valgrind bad reads and sigabrts + . Remove contrib/android into its own repo (http://hg.palaso.org/grandroid) + . Update comparerenderer to latest harfbuzzng api +1.1.1 + . Missing Log.h included + . perl wrappers updated +1.1.0 + . Refactored debug output to use json + . Renamed VM_MACHINE_TYPE to GRAPHITE2_VM_TYPE + . Renamed DISABLE_SEGCACHE to GRAPHITE2_NSEGCACE + . Renamed DISBALE_FILE_FACE to GRAPHITE2_NFILEFACE + . Renamed ENABLE_COMPARE_RENDERER to GRAPHTIE2_COMPARE_RENDERER + . Renamed DOXYGEN_CONFIG to GRAPHITE2_DOXYGEN_CONFIG + . Renamed GR2_CUSTOM_HEADER to GRAPHITE2_CUSTOM_HEADER + . Renamed GR2_EXPORTING to GRAPHITE2_EXPORTING + . Added GRAPHITE2_STATIC for static only builds + . Added GRAPHITE2_NTRACING to compile out tracing code + . Documented GRAPHITE2_{EXPORTING,STATIC,NTRACING} in hacking.txt + . Bump libtool version to 2.1.0 + . dumb font rendering works + . slot user attributes are now signed rather than unsigned + . add support for long class maps + . Rename perl library to avoid nameclash on Windows + . Various robustness fixes + . Moved internal .h files into src/inc + . Parallelise fuzztest + . General build improvements, particularly on Windows + +1.0.3 + . Fix UTF16 surrogate support + . script and lang tags may be space padded or null padded + . Remove need for WORDS_BIGENDIAN, do it all automatically + . Remove all #include . Use CLASS_NEW_DELETE instead. + . Fix comparerenderer to work with current hbng + . Add valgrind to fuzztest to ensure good memory use at all times + . Fix new fuzztest exposed bugs. + . Fix bugs exposed by Mozilla security review + . Add continuous integration build on Windows support + +1.0.2 + . Fix Windows build + . Comparerenderer uses hbng enforcing ot rendering + . Add Bidi .hasChar support and refactor mirroring code + . Make cmake default Release rather than debug + . Don't compile in a boat load of TtfUtil that isn't used, saving 15% of binary + . Chase the FSF around its latest office moves + . WORDS_BIGENDIAN is set at the top so tests now pass on ppc, etc. + . More words in the manual + +1.0.1 + . Release is the default build in cmake now. + . Refactor cmake build to not rebuild things so much. + . Include a missing file + . Remove -nostdlibs, making gcc happy everywhere + . Update comparerenderer to latest hbng interface + . Add changelog + +1.0.0 + . First major release of perfect code! + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/Graphite.cmake b/Build/source/libs/graphite2/graphite2-1.2.1/Graphite.cmake new file mode 100644 index 00000000000..54f765aded7 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/Graphite.cmake @@ -0,0 +1,104 @@ +include(GetPrerequisites) + +function(nolib_test LIBNAME OBJECTFILE) + string(REGEX REPLACE "[][^$.*+?|()-]" "\\\\\\0" LIBNAME_REGEX ${LIBNAME}) + if (${CMAKE_SYSTEM_NAME} STREQUAL "Darwin") + add_test(NAME nolib-${LIBNAME}-${PROJECT_NAME} + COMMAND otool -L ${OBJECTFILE}) + set_tests_properties(nolib-${LIBNAME}-${PROJECT_NAME} PROPERTIES + FAIL_REGULAR_EXPRESSION "${CMAKE_SHARED_LIBRARY_PREFIX}${LIBNAME_REGEX}[.0-9]+${CMAKE_SHARED_LIBRARY_SUFFIX}") + else (${CMAKE_SYSTEM_NAME} STREQUAL "Darwin") + add_test(NAME nolib-${LIBNAME}-${PROJECT_NAME} + COMMAND readelf --dynamic ${OBJECTFILE}) + set_tests_properties(nolib-${LIBNAME}-${PROJECT_NAME} PROPERTIES + FAIL_REGULAR_EXPRESSION "0x[0-9a-f]+ \\(NEEDED\\)[ \\t]+Shared library: \\[${CMAKE_SHARED_LIBRARY_PREFIX}${LIBNAME_REGEX}${CMAKE_SHARED_LIBRARY_SUFFIX}.*\\]") + endif (${CMAKE_SYSTEM_NAME} STREQUAL "Darwin") +endfunction(nolib_test) + + +MACRO(GET_TARGET_PROPERTY_WITH_DEFAULT _variable _target _property _default_value) + GET_TARGET_PROPERTY (${_variable} ${_target} ${_property}) + IF (${_variable} MATCHES NOTFOUND) + SET (${_variable} ${_default_value}) + ENDIF (${_variable} MATCHES NOTFOUND) +ENDMACRO (GET_TARGET_PROPERTY_WITH_DEFAULT) + + +FUNCTION(CREATE_LIBTOOL_FILE _target _install_DIR) + GET_TARGET_PROPERTY(_target_location ${_target} LOCATION) + GET_TARGET_PROPERTY_WITH_DEFAULT(_target_static_lib ${_target} STATIC_LIB "") + GET_TARGET_PROPERTY_WITH_DEFAULT(_target_dependency_libs ${_target} LT_DEPENDENCY_LIBS "") + GET_TARGET_PROPERTY_WITH_DEFAULT(_target_current ${_target} LT_VERSION_CURRENT 0) + GET_TARGET_PROPERTY_WITH_DEFAULT(_target_age ${_target} LT_VERSION_AGE 0) + GET_TARGET_PROPERTY_WITH_DEFAULT(_target_revision ${_target} LT_VERSION_REVISION 0) + GET_TARGET_PROPERTY_WITH_DEFAULT(_target_installed ${_target} LT_INSTALLED yes) + GET_TARGET_PROPERTY_WITH_DEFAULT(_target_shouldnotlink ${_target} LT_SHOULDNOTLINK no) + GET_TARGET_PROPERTY_WITH_DEFAULT(_target_dlopen ${_target} LT_DLOPEN "") + GET_TARGET_PROPERTY_WITH_DEFAULT(_target_dlpreopen ${_target} LT_DLPREOPEN "") + GET_FILENAME_COMPONENT(_lanamewe ${_target_location} NAME_WE) + GET_FILENAME_COMPONENT(_soname ${_target_location} NAME) + GET_FILENAME_COMPONENT(_soext ${_target_location} EXT) + SET(_laname ${PROJECT_BINARY_DIR}/${_lanamewe}.la) + FILE(WRITE ${_laname} "# ${_lanamewe}.la - a libtool library file\n") + FILE(APPEND ${_laname} "# Generated by CMake ${CMAKE_VERSION} (like GNU libtool)\n") + FILE(APPEND ${_laname} "\n# Please DO NOT delete this file!\n# It is necessary for linking the library with libtool.\n\n" ) + FILE(APPEND ${_laname} "# The name that we can dlopen(3).\n") + FILE(APPEND ${_laname} "dlname='${_soname}'\n\n") + FILE(APPEND ${_laname} "# Names of this library.\n") + if (${CMAKE_SYSTEM_NAME} STREQUAL "Darwin") + FILE(APPEND ${_laname} "library_names='${_lanamwe}.${_target_current}.${_target_revision}.${_target_age}.${_soext} ${_lanamewe}.${_target_current}.${_soext} ${_soname}'\n\n") + else (${CMAKE_SYSTEM_NAME} STREQUAL "Darwin") + FILE(APPEND ${_laname} "library_names='${_soname}.${_target_current}.${_target_revision}.${_target_age} ${_soname}.${_target_current} ${_soname}'\n\n") + endif (${CMAKE_SYSTEM_NAME} STREQUAL "Darwin") + FILE(APPEND ${_laname} "# The name of the static archive.\n") + FILE(APPEND ${_laname} "old_library='${_target_static_lib}'\n\n") + FILE(APPEND ${_laname} "# Libraries that this one depends upon.\n") + FILE(APPEND ${_laname} "dependency_libs='${_target_dependency_libs}'\n\n") + FILE(APPEND ${_laname} "# Names of additional weak libraries provided by this library\n") + FILE(APPEND ${_laname} "weak_library_names=\n\n") + FILE(APPEND ${_laname} "# Version information for ${_lanamewe}.\n") + FILE(APPEND ${_laname} "current=${_target_current}\n") + FILE(APPEND ${_laname} "age=${_target_age}\n") + FILE(APPEND ${_laname} "revision=${_target_revision}\n\n") + FILE(APPEND ${_laname} "# Is this an already installed library?\n") + FILE(APPEND ${_laname} "installed=${_target_installed}\n\n") + FILE(APPEND ${_laname} "# Should we warn about portability when linking against -modules?\n") + FILE(APPEND ${_laname} "shouldnotlink=${_target_shouldnotlink}\n\n") + FILE(APPEND ${_laname} "# Files to dlopen/dlpreopen\n") + FILE(APPEND ${_laname} "dlopen='${_target_dlopen}'\n") + FILE(APPEND ${_laname} "dlpreopen='${_target_dlpreopen}'\n\n") + FILE(APPEND ${_laname} "# Directory that this library needs to be installed in:\n") + FILE(APPEND ${_laname} "libdir='${CMAKE_INSTALL_PREFIX}${_install_DIR}'\n") + INSTALL( FILES ${_laname} DESTINATION ${CMAKE_INSTALL_PREFIX}${_install_DIR}) +ENDFUNCTION(CREATE_LIBTOOL_FILE) + + +function(fonttest TESTNAME FONTFILE) + if (EXISTS ${PROJECT_SOURCE_DIR}/standards/${TESTNAME}${CMAKE_SYSTEM_NAME}.log) + set(PLATFORM_TEST_SUFFIX ${CMAKE_SYSTEM_NAME}) + endif (EXISTS ${PROJECT_SOURCE_DIR}/standards/${TESTNAME}${CMAKE_SYSTEM_NAME}.log) + if (NOT (GRAPHITE2_NSEGCACHE OR GRAPHITE2_NFILEFACE)) + add_test(NAME ${TESTNAME} COMMAND $ -trace ${PROJECT_BINARY_DIR}/${TESTNAME}.json -log ${PROJECT_BINARY_DIR}/${TESTNAME}.log ${PROJECT_SOURCE_DIR}/fonts/${FONTFILE} -codes ${ARGN}) + set_tests_properties(${TESTNAME} PROPERTIES TIMEOUT 3) + add_test(NAME ${TESTNAME}Output COMMAND ${CMAKE_COMMAND} -E compare_files ${PROJECT_BINARY_DIR}/${TESTNAME}.log ${PROJECT_SOURCE_DIR}/standards/${TESTNAME}${PLATFORM_TEST_SUFFIX}.log) + if (NOT GRAPHITE2_NTRACING) + add_test(NAME ${TESTNAME}Debug COMMAND python ${PROJECT_SOURCE_DIR}/jsoncmp ${PROJECT_BINARY_DIR}/${TESTNAME}.json ${PROJECT_SOURCE_DIR}/standards/${TESTNAME}.json) + set_tests_properties(${TESTNAME}Debug PROPERTIES DEPENDS ${TESTNAME}) + endif (NOT GRAPHITE2_NTRACING) + set_tests_properties(${TESTNAME}Output PROPERTIES DEPENDS ${TESTNAME}) + endif (NOT (GRAPHITE2_NSEGCACHE OR GRAPHITE2_NFILEFACE)) +endfunction(fonttest) + + +function(feattest TESTNAME FONTFILE) + if (EXISTS ${PROJECT_SOURCE_DIR}/standards/${TESTNAME}${CMAKE_SYSTEM_NAME}.log) + set(PLATFORM_TEST_SUFFIX ${CMAKE_SYSTEM_NAME}) + endif (EXISTS ${PROJECT_SOURCE_DIR}/standards/${TESTNAME}${CMAKE_SYSTEM_NAME}.log) + if (NOT (GRAPHITE2_NSEGCACHE OR GRAPHITE2_NFILEFACE)) + add_test(NAME ${TESTNAME} COMMAND $ -log ${PROJECT_BINARY_DIR}/${TESTNAME}.log ${PROJECT_SOURCE_DIR}/fonts/${FONTFILE}) + set_tests_properties(${TESTNAME} PROPERTIES TIMEOUT 3) + add_test(NAME ${TESTNAME}Output COMMAND ${CMAKE_COMMAND} -E compare_files ${PROJECT_BINARY_DIR}/${TESTNAME}.log ${PROJECT_SOURCE_DIR}/standards/${TESTNAME}${PLATFORM_TEST_SUFFIX}.log) + set_tests_properties(${TESTNAME}Output PROPERTIES DEPENDS ${TESTNAME}) + endif (NOT (GRAPHITE2_NSEGCACHE OR GRAPHITE2_NFILEFACE)) +endfunction(feattest) + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/LICENSE b/Build/source/libs/graphite2/graphite2-1.2.1/LICENSE new file mode 100644 index 00000000000..2d2d780e601 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/LICENSE @@ -0,0 +1,510 @@ + + GNU LESSER GENERAL PUBLIC LICENSE + Version 2.1, February 1999 + + Copyright (C) 1991, 1999 Free Software Foundation, Inc. + 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + +[This is the first released version of the Lesser GPL. It also counts + as the successor of the GNU Library Public License, version 2, hence + the version number 2.1.] + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +Licenses are intended to guarantee your freedom to share and change +free software--to make sure the software is free for all its users. + + This license, the Lesser General Public License, applies to some +specially designated software packages--typically libraries--of the +Free Software Foundation and other authors who decide to use it. You +can use it too, but we suggest you first think carefully about whether +this license or the ordinary General Public License is the better +strategy to use in any particular case, based on the explanations +below. + + When we speak of free software, we are referring to freedom of use, +not price. Our General Public Licenses are designed to make sure that +you have the freedom to distribute copies of free software (and charge +for this service if you wish); that you receive source code or can get +it if you want it; that you can change the software and use pieces of +it in new free programs; and that you are informed that you can do +these things. + + To protect your rights, we need to make restrictions that forbid +distributors to deny you these rights or to ask you to surrender these +rights. These restrictions translate to certain responsibilities for +you if you distribute copies of the library or if you modify it. + + For example, if you distribute copies of the library, whether gratis +or for a fee, you must give the recipients all the rights that we gave +you. You must make sure that they, too, receive or can get the source +code. If you link other code with the library, you must provide +complete object files to the recipients, so that they can relink them +with the library after making changes to the library and recompiling +it. And you must show them these terms so they know their rights. + + We protect your rights with a two-step method: (1) we copyright the +library, and (2) we offer you this license, which gives you legal +permission to copy, distribute and/or modify the library. + + To protect each distributor, we want to make it very clear that +there is no warranty for the free library. Also, if the library is +modified by someone else and passed on, the recipients should know +that what they have is not the original version, so that the original +author's reputation will not be affected by problems that might be +introduced by others. + + Finally, software patents pose a constant threat to the existence of +any free program. We wish to make sure that a company cannot +effectively restrict the users of a free program by obtaining a +restrictive license from a patent holder. Therefore, we insist that +any patent license obtained for a version of the library must be +consistent with the full freedom of use specified in this license. + + Most GNU software, including some libraries, is covered by the +ordinary GNU General Public License. This license, the GNU Lesser +General Public License, applies to certain designated libraries, and +is quite different from the ordinary General Public License. We use +this license for certain libraries in order to permit linking those +libraries into non-free programs. + + When a program is linked with a library, whether statically or using +a shared library, the combination of the two is legally speaking a +combined work, a derivative of the original library. The ordinary +General Public License therefore permits such linking only if the +entire combination fits its criteria of freedom. The Lesser General +Public License permits more lax criteria for linking other code with +the library. + + We call this license the "Lesser" General Public License because it +does Less to protect the user's freedom than the ordinary General +Public License. It also provides other free software developers Less +of an advantage over competing non-free programs. These disadvantages +are the reason we use the ordinary General Public License for many +libraries. However, the Lesser license provides advantages in certain +special circumstances. + + For example, on rare occasions, there may be a special need to +encourage the widest possible use of a certain library, so that it +becomes a de-facto standard. To achieve this, non-free programs must +be allowed to use the library. A more frequent case is that a free +library does the same job as widely used non-free libraries. In this +case, there is little to gain by limiting the free library to free +software only, so we use the Lesser General Public License. + + In other cases, permission to use a particular library in non-free +programs enables a greater number of people to use a large body of +free software. For example, permission to use the GNU C Library in +non-free programs enables many more people to use the whole GNU +operating system, as well as its variant, the GNU/Linux operating +system. + + Although the Lesser General Public License is Less protective of the +users' freedom, it does ensure that the user of a program that is +linked with the Library has the freedom and the wherewithal to run +that program using a modified version of the Library. + + The precise terms and conditions for copying, distribution and +modification follow. Pay close attention to the difference between a +"work based on the library" and a "work that uses the library". The +former contains code derived from the library, whereas the latter must +be combined with the library in order to run. + + GNU LESSER GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License Agreement applies to any software library or other +program which contains a notice placed by the copyright holder or +other authorized party saying it may be distributed under the terms of +this Lesser General Public License (also called "this License"). +Each licensee is addressed as "you". + + A "library" means a collection of software functions and/or data +prepared so as to be conveniently linked with application programs +(which use some of those functions and data) to form executables. + + The "Library", below, refers to any such software library or work +which has been distributed under these terms. A "work based on the +Library" means either the Library or any derivative work under +copyright law: that is to say, a work containing the Library or a +portion of it, either verbatim or with modifications and/or translated +straightforwardly into another language. (Hereinafter, translation is +included without limitation in the term "modification".) + + "Source code" for a work means the preferred form of the work for +making modifications to it. For a library, complete source code means +all the source code for all modules it contains, plus any associated +interface definition files, plus the scripts used to control +compilation and installation of the library. + + Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running a program using the Library is not restricted, and output from +such a program is covered only if its contents constitute a work based +on the Library (independent of the use of the Library in a tool for +writing it). Whether that is true depends on what the Library does +and what the program that uses the Library does. + + 1. You may copy and distribute verbatim copies of the Library's +complete source code as you receive it, in any medium, provided that +you conspicuously and appropriately publish on each copy an +appropriate copyright notice and disclaimer of warranty; keep intact +all the notices that refer to this License and to the absence of any +warranty; and distribute a copy of this License along with the +Library. + + You may charge a fee for the physical act of transferring a copy, +and you may at your option offer warranty protection in exchange for a +fee. + + 2. You may modify your copy or copies of the Library or any portion +of it, thus forming a work based on the Library, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + a) The modified work must itself be a software library. + + b) You must cause the files modified to carry prominent notices + stating that you changed the files and the date of any change. + + c) You must cause the whole of the work to be licensed at no + charge to all third parties under the terms of this License. + + d) If a facility in the modified Library refers to a function or a + table of data to be supplied by an application program that uses + the facility, other than as an argument passed when the facility + is invoked, then you must make a good faith effort to ensure that, + in the event an application does not supply such function or + table, the facility still operates, and performs whatever part of + its purpose remains meaningful. + + (For example, a function in a library to compute square roots has + a purpose that is entirely well-defined independent of the + application. Therefore, Subsection 2d requires that any + application-supplied function or table used by this function must + be optional: if the application does not supply it, the square + root function must still compute square roots.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Library, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Library, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote +it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Library. + +In addition, mere aggregation of another work not based on the Library +with the Library (or with a work based on the Library) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may opt to apply the terms of the ordinary GNU General Public +License instead of this License to a given copy of the Library. To do +this, you must alter all the notices that refer to this License, so +that they refer to the ordinary GNU General Public License, version 2, +instead of to this License. (If a newer version than version 2 of the +ordinary GNU General Public License has appeared, then you can specify +that version instead if you wish.) Do not make any other change in +these notices. + + Once this change is made in a given copy, it is irreversible for +that copy, so the ordinary GNU General Public License applies to all +subsequent copies and derivative works made from that copy. + + This option is useful when you wish to copy part of the code of +the Library into a program that is not a library. + + 4. You may copy and distribute the Library (or a portion or +derivative of it, under Section 2) in object code or executable form +under the terms of Sections 1 and 2 above provided that you accompany +it with the complete corresponding machine-readable source code, which +must be distributed under the terms of Sections 1 and 2 above on a +medium customarily used for software interchange. + + If distribution of object code is made by offering access to copy +from a designated place, then offering equivalent access to copy the +source code from the same place satisfies the requirement to +distribute the source code, even though third parties are not +compelled to copy the source along with the object code. + + 5. A program that contains no derivative of any portion of the +Library, but is designed to work with the Library by being compiled or +linked with it, is called a "work that uses the Library". Such a +work, in isolation, is not a derivative work of the Library, and +therefore falls outside the scope of this License. + + However, linking a "work that uses the Library" with the Library +creates an executable that is a derivative of the Library (because it +contains portions of the Library), rather than a "work that uses the +library". The executable is therefore covered by this License. +Section 6 states terms for distribution of such executables. + + When a "work that uses the Library" uses material from a header file +that is part of the Library, the object code for the work may be a +derivative work of the Library even though the source code is not. +Whether this is true is especially significant if the work can be +linked without the Library, or if the work is itself a library. The +threshold for this to be true is not precisely defined by law. + + If such an object file uses only numerical parameters, data +structure layouts and accessors, and small macros and small inline +functions (ten lines or less in length), then the use of the object +file is unrestricted, regardless of whether it is legally a derivative +work. (Executables containing this object code plus portions of the +Library will still fall under Section 6.) + + Otherwise, if the work is a derivative of the Library, you may +distribute the object code for the work under the terms of Section 6. +Any executables containing that work also fall under Section 6, +whether or not they are linked directly with the Library itself. + + 6. As an exception to the Sections above, you may also combine or +link a "work that uses the Library" with the Library to produce a +work containing portions of the Library, and distribute that work +under terms of your choice, provided that the terms permit +modification of the work for the customer's own use and reverse +engineering for debugging such modifications. + + You must give prominent notice with each copy of the work that the +Library is used in it and that the Library and its use are covered by +this License. You must supply a copy of this License. If the work +during execution displays copyright notices, you must include the +copyright notice for the Library among them, as well as a reference +directing the user to the copy of this License. Also, you must do one +of these things: + + a) Accompany the work with the complete corresponding + machine-readable source code for the Library including whatever + changes were used in the work (which must be distributed under + Sections 1 and 2 above); and, if the work is an executable linked + with the Library, with the complete machine-readable "work that + uses the Library", as object code and/or source code, so that the + user can modify the Library and then relink to produce a modified + executable containing the modified Library. (It is understood + that the user who changes the contents of definitions files in the + Library will not necessarily be able to recompile the application + to use the modified definitions.) + + b) Use a suitable shared library mechanism for linking with the + Library. A suitable mechanism is one that (1) uses at run time a + copy of the library already present on the user's computer system, + rather than copying library functions into the executable, and (2) + will operate properly with a modified version of the library, if + the user installs one, as long as the modified version is + interface-compatible with the version that the work was made with. + + c) Accompany the work with a written offer, valid for at least + three years, to give the same user the materials specified in + Subsection 6a, above, for a charge no more than the cost of + performing this distribution. + + d) If distribution of the work is made by offering access to copy + from a designated place, offer equivalent access to copy the above + specified materials from the same place. + + e) Verify that the user has already received a copy of these + materials or that you have already sent this user a copy. + + For an executable, the required form of the "work that uses the +Library" must include any data and utility programs needed for +reproducing the executable from it. However, as a special exception, +the materials to be distributed need not include anything that is +normally distributed (in either source or binary form) with the major +components (compiler, kernel, and so on) of the operating system on +which the executable runs, unless that component itself accompanies +the executable. + + It may happen that this requirement contradicts the license +restrictions of other proprietary libraries that do not normally +accompany the operating system. Such a contradiction means you cannot +use both them and the Library together in an executable that you +distribute. + + 7. You may place library facilities that are a work based on the +Library side-by-side in a single library together with other library +facilities not covered by this License, and distribute such a combined +library, provided that the separate distribution of the work based on +the Library and of the other library facilities is otherwise +permitted, and provided that you do these two things: + + a) Accompany the combined library with a copy of the same work + based on the Library, uncombined with any other library + facilities. This must be distributed under the terms of the + Sections above. + + b) Give prominent notice with the combined library of the fact + that part of it is a work based on the Library, and explaining + where to find the accompanying uncombined form of the same work. + + 8. You may not copy, modify, sublicense, link with, or distribute +the Library except as expressly provided under this License. Any +attempt otherwise to copy, modify, sublicense, link with, or +distribute the Library is void, and will automatically terminate your +rights under this License. However, parties who have received copies, +or rights, from you under this License will not have their licenses +terminated so long as such parties remain in full compliance. + + 9. You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Library or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Library (or any work based on the +Library), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Library or works based on it. + + 10. Each time you redistribute the Library (or any work based on the +Library), the recipient automatically receives a license from the +original licensor to copy, distribute, link with or modify the Library +subject to these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties with +this License. + + 11. If, as a consequence of a court judgment or allegation of patent +infringement or for any other reason (not limited to patent issues), +conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot +distribute so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you +may not distribute the Library at all. For example, if a patent +license would not permit royalty-free redistribution of the Library by +all those who receive copies directly or indirectly through you, then +the only way you could satisfy both it and this License would be to +refrain entirely from distribution of the Library. + +If any portion of this section is held invalid or unenforceable under +any particular circumstance, the balance of the section is intended to +apply, and the section as a whole is intended to apply in other +circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + + 12. If the distribution and/or use of the Library is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Library under this License +may add an explicit geographical distribution limitation excluding those +countries, so that distribution is permitted only in or among +countries not thus excluded. In such case, this License incorporates +the limitation as if written in the body of this License. + + 13. The Free Software Foundation may publish revised and/or new +versions of the Lesser General Public License from time to time. +Such new versions will be similar in spirit to the present version, +but may differ in detail to address new problems or concerns. + +Each version is given a distinguishing version number. If the Library +specifies a version number of this License which applies to it and +"any later version", you have the option of following the terms and +conditions either of that version or of any later version published by +the Free Software Foundation. If the Library does not specify a +license version number, you may choose any version ever published by +the Free Software Foundation. + + 14. If you wish to incorporate parts of the Library into other free +programs whose distribution conditions are incompatible with these, +write to the author to ask for permission. For software which is +copyrighted by the Free Software Foundation, write to the Free +Software Foundation; we sometimes make exceptions for this. Our +decision will be guided by the two goals of preserving the free status +of all derivatives of our free software and of promoting the sharing +and reuse of software generally. + + NO WARRANTY + + 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO +WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. +EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR +OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY +KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE +LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME +THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN +WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY +AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU +FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR +CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE +LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING +RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A +FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF +SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH +DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Libraries + + If you develop a new library, and you want it to be of the greatest +possible use to the public, we recommend making it free software that +everyone can redistribute and change. You can do so by permitting +redistribution under these terms (or, alternatively, under the terms +of the ordinary General Public License). + + To apply these terms, attach the following notices to the library. +It is safest to attach them to the start of each source file to most +effectively convey the exclusion of warranty; and each file should +have at least the "copyright" line and a pointer to where the full +notice is found. + + + + Copyright (C) + + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2.1 of the License, or (at your option) any later version. + + This library 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 for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA + +Also add information on how to contact you by electronic and paper mail. + +You should also get your employer (if you work as a programmer) or +your school, if any, to sign a "copyright disclaimer" for the library, +if necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the + library `Frob' (a library for tweaking knobs) written by James + Random Hacker. + + , 1 April 1990 + Ty Coon, President of Vice + +That's all there is to it! + + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/Todo.txt b/Build/source/libs/graphite2/graphite2-1.2.1/Todo.txt new file mode 100644 index 00000000000..52f7509f87a --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/Todo.txt @@ -0,0 +1,9 @@ +Changes to make to the API when we are forced to change it: + +* add font table deletion function ptr so that the app doesn't have to + manage a collection of font tables + +Other stuff we should do + +* Change logging generation id to be a magic extra user attribute. This allows for use within justification logging. Also add [ ] around the whoe log to bring the fragments together. + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/graphite2.pc.in b/Build/source/libs/graphite2/graphite2-1.2.1/graphite2.pc.in new file mode 100644 index 00000000000..a4f19b39ce4 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/graphite2.pc.in @@ -0,0 +1,7 @@ + +Name: Graphite2 +Description: Font rendering engine for Complex Scripts +Version: ${version} +Libs: -L${libdir} -lgraphite2 +Cflags: -I${includedir} + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/include/graphite2/Font.h b/Build/source/libs/graphite2/graphite2-1.2.1/include/graphite2/Font.h new file mode 100644 index 00000000000..7fc3e6ee8b7 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/include/graphite2/Font.h @@ -0,0 +1,389 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + + Alternatively, the contents of this file may be used under the terms + of the Mozilla Public License (http://mozilla.org/MPL) or the GNU + General Public License, as published by the Free Software Foundation, + either version 2 of the License or (at your option) any later version. +*/ +#pragma once + +#include "graphite2/Types.h" + +#define GR2_VERSION_MAJOR 1 +#define GR2_VERSION_MINOR 2 +#define GR2_VERSION_BUGFIX 1 + +#ifdef __cplusplus +extern "C" +{ +#endif + +typedef struct gr_face gr_face; +typedef struct gr_font gr_font; +typedef struct gr_feature_ref gr_feature_ref; +typedef struct gr_feature_val gr_feature_val; + +/** +* Returns version information on this engine +*/ +GR2_API void gr_engine_version(int *nMajor, int *nMinor, int *nBugFix); + +/** +* The Face Options allow the application to require that certain tables are +* read during face construction. This may be of concern if the appFaceHandle +* used in the gr_get_table_fn may change. +* The values can be combined +*/ +enum gr_face_options { + /** No preload, no cmap caching, fail if the graphite tables are invalid */ + gr_face_default = 0, + /** Dumb rendering will be enabled if the graphite tables are invalid */ + gr_face_dumbRendering = 1, + /** preload glyphs at construction time */ + gr_face_preloadGlyphs = 2, + /** Cache the lookup from code point to glyph ID at construction time */ + gr_face_cacheCmap = 4, + /** Preload everything */ + gr_face_preloadAll = gr_face_preloadGlyphs | gr_face_cacheCmap +}; + +/** Holds information about a particular Graphite silf table that has been loaded */ +struct gr_faceinfo { + gr_uint16 extra_ascent; /**< The extra_ascent in the GDL, in design units */ + gr_uint16 extra_descent; /**< The extra_descent in the GDL, in design units */ + gr_uint16 upem; /**< The design units for the font */ + enum gr_space_contextuals { + gr_space_unknown = 0, /**< no information is known. */ + gr_space_none = 1, /**< the space character never occurs in any rules. */ + gr_space_left_only = 2, /**< the space character only occurs as the first element in a rule. */ + gr_space_right_only = 3, /**< the space character only occurs as the last element in a rule. */ + gr_space_either_only = 4, /**< the space character only occurs as the only element in a rule. */ + gr_space_both = 5, /**< the space character may occur as the first or last element of a rule. */ + gr_space_cross = 6 /**< the space character occurs in a rule not as a first or last element. */ + } space_contextuals; + unsigned int has_bidi_pass : 1; /**< the table specifies that a bidirectional pass should run */ + unsigned int line_ends : 1; /**< there are line end contextuals somewhere */ + unsigned int justifies : 1; /**< there are .justify properties set somewhere on some glyphs */ +}; + +typedef struct gr_faceinfo gr_faceinfo; + +/** type describing function to retrieve font table information + * + * @return a pointer to the table in memory. The pointed to memory must exist as + * long as the gr_face which makes the call. + * @param appFaceHandle is the unique information passed to gr_make_face() + * @param name is a 32bit tag to the table name. + * @param len returned by this function to say how long the table is in memory. + */ +typedef const void *(*gr_get_table_fn)(const void* appFaceHandle, unsigned int name, size_t *len); + +/** type describing function to release any resources allocated by the above get_table table function + * + * @param appFaceHandle is the unique information passed to gr_make_face() + * @param pointer to table memory returned by get_table. + */ +typedef void (*gr_release_table_fn)(const void* appFaceHandle, const void *table_buffer); + +/** struct housing function pointers to manage font table buffers for the graphite engine. */ +struct gr_face_ops +{ + /** size in bytes of this structure */ + size_t size; + /** a pointer to a function to request a table from the client. */ + gr_get_table_fn get_table; + /** is a pointer to a function to notify the client the a table can be released. + * This can be NULL to signify that the client does not wish to do any release handling. */ + gr_release_table_fn release_table; +}; +typedef struct gr_face_ops gr_face_ops; + +/** Create a gr_face object given application information and a table functions. + * + * @return gr_face or NULL if the font fails to load for some reason. + * @param appFaceHandle This is application specific information that is passed + * to the getTable function. The appFaceHandle must stay + * alive as long as the gr_face is alive. + * @param face_ops Pointer to face specific callback structure for table + * management. Must stay alive for the duration of the + * call only. + * @param faceOptions Bitfield describing various options. See enum gr_face_options for details. + */ +GR2_API gr_face* gr_make_face_with_ops(const void* appFaceHandle/*non-NULL*/, const gr_face_ops *face_ops, unsigned int faceOptions); + +/** Create a gr_face object given application information and a getTable function. This function is deprecated as of v1.2.0 in + * favour of gr_make_face_with_ops. + * + * @return gr_face or NULL if the font fails to load for some reason. + * @param appFaceHandle This is application specific information that is passed + * to the getTable function. The appFaceHandle must stay + * alive as long as the gr_face is alive. + * @param getTable Callback function to get table data. + * @param faceOptions Bitfield describing various options. See enum gr_face_options for details. + */ +GR2_API gr_face* gr_make_face(const void* appFaceHandle/*non-NULL*/, gr_get_table_fn getTable, unsigned int faceOptions); + +//#ifndef GRAPHITE2_NSEGCACHE +/** Create a gr_face object given application information, with subsegmental caching support + * + * @return gr_face or NULL if the font fails to load. + * @param appFaceHandle is a pointer to application specific information that is passed to getTable. + * This may not be NULL and must stay alive as long as the gr_face is alive. + * @param face_ops Pointer to face specific callback structure for table management. Must stay + * alive for the duration of the call only. + * @param segCacheMaxSize How large the segment cache is. + * @param faceOptions Bitfield of values from enum gr_face_options + */ +GR2_API gr_face* gr_make_face_with_seg_cache_and_ops(const void* appFaceHandle, const gr_face_ops *face_ops, unsigned int segCacheMaxSize, unsigned int faceOptions); + +/** Create a gr_face object given application information, with subsegmental caching support. + * This function is deprecated as of v1.2.0 in favour of gr_make_face_with_seg_cache_and_ops. + * + * @return gr_face or NULL if the font fails to load. + * @param appFaceHandle is a pointer to application specific information that is passed to getTable. + * This may not be NULL and must stay alive as long as the gr_face is alive. + * @param getTable The function graphite calls to access font table data + * @param segCacheMaxSize How large the segment cache is. + * @param faceOptions Bitfield of values from enum gr_face_options + */ +GR2_API gr_face* gr_make_face_with_seg_cache(const void* appFaceHandle, gr_get_table_fn getTable, unsigned int segCacheMaxSize, unsigned int faceOptions); +//#endif + +/** Convert a tag in a string into a gr_uint32 + * + * @return gr_uint32 tag, zero padded + * @param str a nul terminated string of which at most the first 4 characters are read + */ +GR2_API gr_uint32 gr_str_to_tag(const char *str); + +/** Convert a gr_uint32 tag into a string + * + * @param tag contains the tag to convert + * @param str is a pointer to a char array of at least size 4 bytes. The first 4 bytes of this array + * will be overwritten by this function. No nul is appended. + */ +GR2_API void gr_tag_to_str(gr_uint32 tag, char *str); + +/** Get feature values for a given language or default + * + * @return a copy of the default feature values for a given language. The application must call + * gr_featureval_destroy() to free this object when done. + * @param pFace The font face to get feature values from + * @param langname The language tag to get feature values for. If there is no such language or + * langname is 0, the default feature values for the font are returned. + * langname is right 0 padded and assumes lowercase. Thus the en langauge + * would be 0x656E0000. Langname may also be space padded, thus 0x656E2020. + */ +GR2_API gr_feature_val* gr_face_featureval_for_lang(const gr_face* pFace, gr_uint32 langname); + +/** Get feature reference for a given feature id from a face + * + * @return a feature reference corresponding to the given id. This data is part of the gr_face and + * will be freed when the face is destroyed. + * @param pFace Font face to get information on. + * @param featId Feature id tag to get reference to. + */ +GR2_API const gr_feature_ref* gr_face_find_fref(const gr_face* pFace, gr_uint32 featId); + +/** Returns number of feature references in a face **/ +GR2_API gr_uint16 gr_face_n_fref(const gr_face* pFace); + +/** Returns feature reference at given index in face **/ +GR2_API const gr_feature_ref* gr_face_fref(const gr_face* pFace, gr_uint16 i); + +/** Return number of languages the face knows about **/ +GR2_API unsigned short gr_face_n_languages(const gr_face* pFace); + +/** Returns a language id corresponding to a language of given index in the face **/ +GR2_API gr_uint32 gr_face_lang_by_index(const gr_face* pFace, gr_uint16 i); + +/** Destroy the given face and free its memory **/ +GR2_API void gr_face_destroy(gr_face *face); + +/** Returns the number of glyphs in the face **/ +GR2_API unsigned short gr_face_n_glyphs(const gr_face* pFace); + +/** Returns a faceinfo for the face and script **/ +GR2_API const gr_faceinfo *gr_face_info(const gr_face *pFace, gr_uint32 script); + +/** Returns whether the font supports a given Unicode character + * + * @return true if the character is supported. + * @param pFace face to test within + * @param usv Unicode Scalar Value of character to test + * @param script Tag of script for selecting which set of pseudo glyphs to test. May be NULL. + */ +GR2_API int gr_face_is_char_supported(const gr_face *pFace, gr_uint32 usv, gr_uint32 script); + +#ifndef GRAPHITE2_NFILEFACE +/** Create gr_face from a font file + * + * @return gr_face that accesses a font file directly. Returns NULL on failure. + * @param filename Full path and filename to font file + * @param faceOptions Bitfile from enum gr_face_options to control face options. + */ +GR2_API gr_face* gr_make_file_face(const char *filename, unsigned int faceOptions); + +//#ifndef GRAPHITE2_NSEGCACHE +/** Create gr_face from a font file, with subsegment caching support. + * + * @return gr_face that accesses a font file directly. Returns NULL on failure. + * @param filename Full path and filename to font file + * @param segCacheMaxSize Specifies how big to make the cache in segments. + * @param faceOptions Bitfield from enum gr_face_options to control face options. + */ +GR2_API gr_face* gr_make_file_face_with_seg_cache(const char *filename, unsigned int segCacheMaxSize, unsigned int faceOptions); +//#endif +#endif // !GRAPHITE2_NFILEFACE + +/** Create a font from a face + * + * @return gr_font Call font_destroy to free this font + * @param ppm Resolution of the font in pixels per em + * @param face Face this font corresponds to. This must stay alive as long as the font is alive. + */ +GR2_API gr_font* gr_make_font(float ppm, const gr_face *face); + +/** query function to find the hinted advance of a glyph + * + * @param appFontHandle is the unique information passed to gr_make_font_with_advance() + * @param glyphid is the glyph to retireve the hinted advance for. + */ +typedef float (*gr_advance_fn)(const void* appFontHandle, gr_uint16 glyphid); + +/** struct housing function pointers to manage font hinted metrics for the + * graphite engine. */ +struct gr_font_ops +{ + /** size of the structure in bytes to allow for future extensibility */ + size_t size; + /** a pointer to a function to retrieve the hinted + * advance width of a glyph which the font cannot + * provide without client assistance. This can be + * NULL to signify no horizontal hinted metrics are necessary. */ + gr_advance_fn glyph_advance_x; + /** a pointer to a function to retrieve the hinted + * advance height of a glyph which the font cannot + * provide without client assistance. This can be + * NULL to signify no horizontal hinted metrics are necessary. */ + gr_advance_fn glyph_advance_y; +}; +typedef struct gr_font_ops gr_font_ops; + +/** Creates a font with hinted advance width query functions + * + * @return gr_font to be destroyed via font_destroy + * @param ppm size of font in pixels per em + * @param appFontHandle font specific information that must stay alive as long + * as the font does + * @param font_ops pointer font specific callback structure for hinted metrics. + * Must stay alive for the duration of the call. + * @param face the face this font corresponds to. Must stay alive as long as + * the font does. + */ +GR2_API gr_font* gr_make_font_with_ops(float ppm, const void* appFontHandle, const gr_font_ops * font_ops, const gr_face *face); + +/** Creates a font with hinted advance width query function. + * This function is deprecated. Use gr_make_font_with_ops instead. + * + * @return gr_font to be destroyed via font_destroy + * @param ppm size of font in pixels per em + * @param appFontHandle font specific information that must stay alive as long + * as the font does + * @param getAdvance callback function reference that returns horizontal advance in pixels for a glyph. + * Must stay alive for the duration of the call. + * @param face the face this font corresponds to. Must stay alive as long as + * the font does. + */ +GR2_API gr_font* gr_make_font_with_advance_fn(float ppm, const void* appFontHandle, gr_advance_fn getAdvance, const gr_face *face); + +/** Free a font **/ +GR2_API void gr_font_destroy(gr_font *font); + +/** get a feature value + * + * @return value of specific feature or 0 if any problems. + * @param pfeatureref gr_feature_ref to the feature + * @param feats gr_feature_val containing all the values + */ +GR2_API gr_uint16 gr_fref_feature_value(const gr_feature_ref* pfeatureref, const gr_feature_val* feats); + +/** set a feature value + * + * @return false if there were any problems (value out of range, etc.) + * @param pfeatureref gr_feature_ref to the feature + * @param val value to set the feature to + * @param pDest the gr_feature_val containing all the values for all the features + */ +GR2_API int gr_fref_set_feature_value(const gr_feature_ref* pfeatureref, gr_uint16 val, gr_feature_val* pDest); + +/** Returns the id tag for a gr_feature_ref **/ +GR2_API gr_uint32 gr_fref_id(const gr_feature_ref* pfeatureref); + +/** Returns number of values a feature may take, given a gr_feature_ref **/ +GR2_API gr_uint16 gr_fref_n_values(const gr_feature_ref* pfeatureref); + +/** Returns the value associated with a particular value in a feature + * + * @return value + * @param pfeatureref gr_feature_ref of the feature of interest + * @param settingno Index up to the return value of gr_fref_n_values() of the value + */ +GR2_API gr_int16 gr_fref_value(const gr_feature_ref* pfeatureref, gr_uint16 settingno); + +/** Returns a string of the UI name of a feature + * + * @return string of the UI name, in the encoding form requested. Call gr_label_destroy() after use. + * @param pfeatureref gr_feature_ref of the feature + * @param langId This is a pointer since the face may not support a string in the requested + * language. The actual language of the string is returned in langId + * @param utf Encoding form for the string + * @param length Used to return the length of the string returned in bytes. + */ +GR2_API void* gr_fref_label(const gr_feature_ref* pfeatureref, gr_uint16 *langId, enum gr_encform utf, gr_uint32 *length); + +/** Return a UI string for a possible value of a feature + * + * @return string of the UI name, in the encoding form requested. nul terminated. Call gr_label_destroy() + * after use. + * @param pfeatureref gr_feature_ref of the feature + * @param settingno Value setting index + * @param langId This is a pointer to the requested language. The requested language id is + * replaced by the actual language id of the string returned. + * @param utf Encoding form for the string + * @param length Returns the length of the string returned in bytes. + */ +GR2_API void* gr_fref_value_label(const gr_feature_ref* pfeatureref, gr_uint16 settingno/*rather than a value*/, gr_uint16 *langId, enum gr_encform utf, gr_uint32 *length); + +/** Destroy a previously returned label string **/ +GR2_API void gr_label_destroy(void * label); + +/** Copies a gr_feature_val **/ +GR2_API gr_feature_val* gr_featureval_clone(const gr_feature_val* pfeatures); + +/** Destroys a gr_feature_val **/ +GR2_API void gr_featureval_destroy(gr_feature_val *pfeatures); + +#ifdef __cplusplus +} +#endif + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/include/graphite2/Log.h b/Build/source/libs/graphite2/graphite2-1.2.1/include/graphite2/Log.h new file mode 100644 index 00000000000..d1c6f0fe36f --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/include/graphite2/Log.h @@ -0,0 +1,85 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + + Alternatively, the contents of this file may be used under the terms + of the Mozilla Public License (http://mozilla.org/MPL) or the GNU + General Public License, as published by the Free Software Foundation, + either version 2 of the License or (at your option) any later version. +*/ +#pragma once + +#include +#include +#include + +#ifdef __cplusplus +extern "C" +{ +#endif + +/** deprecated mechanism that doesn't do anything now. */ +typedef enum { + GRLOG_NONE = 0x0, + GRLOG_FACE = 0x01, + GRLOG_SEGMENT = 0x02, + GRLOG_PASS = 0x04, + GRLOG_CACHE = 0x08, + + GRLOG_OPCODE = 0x80, + GRLOG_ALL = 0xFF +} GrLogMask; + +/** Start logging all segment creation and updates on the provided face. This + * is logged to a JSON file, see "Segment JSON Schema.txt" for a precise + * definition of the file + * + * @return true if the file was successfully created and logging is correctly + * initialised. + * @param face the gr_face whose segments you want to log to the given file + * @param log_path a utf8 encoded file name and path to log to. + */ +GR2_API bool gr_start_logging(gr_face * face, const char *log_path); + + +/** Stop logging on the given face. This will close the log file created by + * gr_start_logging. + * + * @param face the gr_face whose segments you want to stop logging + */ +GR2_API void gr_stop_logging(gr_face * face); + +/** Start logging to a FILE object. + * This function is deprecated as of 1.2.0, use the _face versions instead. + * + * @return True on success + * @param logfile FILE reference to output logging to + * @param mask What aspects of logging to report (ignored) + */ +GR2_API bool graphite_start_logging(FILE * logFile, GrLogMask mask); //may not do anthing if disabled in the implementation of the engine. + +/** Stop logging to a FILE object. + * This function is deprecated as of 1.2.0, use the _face versions instead. + */ +GR2_API void graphite_stop_logging(); + +#ifdef __cplusplus +} +#endif diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/include/graphite2/Segment.h b/Build/source/libs/graphite2/graphite2-1.2.1/include/graphite2/Segment.h new file mode 100644 index 00000000000..580f83763f9 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/include/graphite2/Segment.h @@ -0,0 +1,420 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + + Alternatively, the contents of this file may be used under the terms + of the Mozilla Public License (http://mozilla.org/MPL) or the GNU + General Public License, as published by the Free Software Foundation, + either version 2 of the License or (at your option) any later version. +*/ +#pragma once + +#include "graphite2/Types.h" +#include "graphite2/Font.h" + +#ifdef __cplusplus +extern "C" +{ +#endif + +enum gr_break_weight { + gr_breakNone = 0, + /* after break weights */ + gr_breakWhitespace = 10, + gr_breakWord = 15, + gr_breakIntra = 20, + gr_breakLetter = 30, + gr_breakClip = 40, + /* before break weights */ + gr_breakBeforeWhitespace = -10, + gr_breakBeforeWord = -15, + gr_breakBeforeIntra = -20, + gr_breakBeforeLetter = -30, + gr_breakBeforeClip = -40 +}; + +enum gr_justFlags { + /// Indicates that this segment is a complete line + gr_justCompleteLine = 0, + /// Indicates that the start of the slot list is not at the start of a line + gr_justStartInline = 1, + /// Indicates that the end of the slot list is not at the end of a line + gr_justEndInline = 2 +}; + +/** Used for looking up slot attributes. Most are already available in other functions **/ +enum gr_attrCode { + /// adjusted glyph advance in x direction in design units + gr_slatAdvX = 0, + /// adjusted glyph advance in y direction (usually 0) in design units + gr_slatAdvY, + /// returns 0. Deprecated. + gr_slatAttTo, + /// This slot attaches to its parent at the given design units in the x direction + gr_slatAttX, + /// This slot attaches to its parent at the given design units in the y direction + gr_slatAttY, + /// This slot attaches to its parent at the given glyph point (not implemented) + gr_slatAttGpt, + /// x-direction adjustment from the given glyph point (not implemented) + gr_slatAttXOff, + /// y-direction adjustment from the given glyph point (not implemented) + gr_slatAttYOff, + /// Where on this glyph should align with the attachment point on the parent glyph in the x-direction. + gr_slatAttWithX, + /// Where on this glyph should align with the attachment point on the parent glyph in the y-direction + gr_slatAttWithY, + /// Which glyph point on this glyph should align with the attachment point on the parent glyph (not implemented). + gr_slatWithGpt, + /// Adjustment to gr_slatWithGpt in x-direction (not implemented) + gr_slatAttWithXOff, + /// Adjustment to gr_slatWithGpt in y-direction (not implemented) + gr_slatAttWithYOff, + /// Attach at given nesting level (not implemented) + gr_slatAttLevel, + /// Line break breakweight for this glyph + gr_slatBreak, + /// Ligature component reference (not implemented) + gr_slatCompRef, + /// bidi directionality of this glyph (not implemented) + gr_slatDir, + /// Whether insertion is allowed before this glyph + gr_slatInsert, + /// Final positioned position of this glyph relative to its parent in x-direction in pixels + gr_slatPosX, + /// Final positioned position of this glyph relative to its parent in y-direction in pixels + gr_slatPosY, + /// Amount to shift glyph by in x-direction design units + gr_slatShiftX, + /// Amount to shift glyph by in y-direction design units + gr_slatShiftY, + /// attribute user1 + gr_slatUserDefnV1, + /// not implemented + gr_slatMeasureSol, + /// not implemented + gr_slatMeasureEol, + /// Amount this slot can stretch (not implemented) + gr_slatJStretch, + /// Amount this slot can shrink (not implemented) + gr_slatJShrink, + /// Granularity by which this slot can stretch or shrink (not implemented) + gr_slatJStep, + /// Justification weight for this glyph (not implemented) + gr_slatJWeight, + /// Amount this slot mush shrink or stretch in design units + gr_slatJWidth, + /// SubSegment split point + gr_slatSegSplit = gr_slatJStretch + 29, + /// User defined attribute, see subattr for user attr number + gr_slatUserDefn, + + /// not implemented + gr_slatMax, + /// not implemented + gr_slatNoEffect = gr_slatMax + 1 +}; + +enum gr_bidirtl { + /// Underlying paragraph direction is RTL + gr_rtl = 1, + /// Set this to not run the bidi pass internally, even if the font asks for it. + /// This presumes that the segment is in a single direction. + gr_nobidi = 2, + /// Disable auto mirroring for rtl text + gr_nomirror = 4 +}; + +typedef struct gr_char_info gr_char_info; +typedef struct gr_segment gr_segment; +typedef struct gr_slot gr_slot; + +/** Returns Unicode character for a charinfo. + * + * @param p Pointer to charinfo to return information on. + */ +GR2_API unsigned int gr_cinfo_unicode_char(const gr_char_info* p/*not NULL*/); + +/** Returns breakweight for a charinfo. + * + * @return Breakweight is a number between -50 and 50 indicating the cost of a + * break before or after this character. If the value < 0, the absolute value + * is this character's contribution to the overall breakweight before it. If the value + * > 0, then the value is this character's contribution to the overall breakweight after it. + * The overall breakweight between two characters is the maximum of the breakweight + * contributions from the characters either side of it. If a character makes no + * contribution to the breakweight on one side of it, the contribution is considered + * to be 0. + * @param p Pointer to charinfo to return information on. + */ +GR2_API int gr_cinfo_break_weight(const gr_char_info* p/*not NULL*/); + +/** Returns the slot index that after this character is after in the slot stream + * + * In effect each character is associated with a set of slots and this returns + * the index of the last slot in the segment this character is associated with. + * + * @return after slot index between 0 and gr_seg_n_slots() + * @param p Pointer to charinfo to return information on. + */ +GR2_API int gr_cinfo_after(const gr_char_info* p/*not NULL*/); + +/** Returns the slot index that before this character is before in the slot stream + * + * In effect each character is associated with a set of slots and this returns + * the index of the first slot in the segment this character is associated with. + * + * @return before slot index between 0 and gr_seg_n_slots() + * @param p Pointer to charinfo to return information on. + */ +GR2_API int gr_cinfo_before(const gr_char_info* p/*not NULL*/); + +/** Returns the code unit index of this character in the input string + * + * @return code unit index between 0 and the end of the string + * @param p Pointer to charinfo to return information on. + */ +GR2_API size_t gr_cinfo_base(const gr_char_info* p/*not NULL*/); + +/** Returns the number of unicode characters in a string. + * + * @return number of characters in the string + * @param enc Specifies the type of data in the string: utf8, utf16, utf32 + * @param buffer_begin The start of the string + * @param buffer_end Measure up to the first nul or when end is reached, whichever is earliest. + * This parameter may be NULL. + * @param pError If there is a structural fault in the string, the location is returned + * in this variable. If no error occurs, pError will contain NULL. NULL + * may be passed for pError if no such information is required. + */ +GR2_API size_t gr_count_unicode_characters(enum gr_encform enc, const void* buffer_begin, const void* buffer_end, const void** pError); + +/** Creates and returns a segment. + * + * @return a segment that needs seg_destroy called on it. May return NULL if bad problems + * in segment processing. + * @param font Gives the size of the font in pixels per em for final positioning. If + * NULL, positions are returned in design units, i.e. at a ppm of the upem + * of the face. + * @param face The face containing all the non-size dependent information. + * @param script This is a tag containing a script identifier that is used to choose + * which graphite table within the font to use. Maybe 0. Tag may be 4 chars + * NULL padded in LSBs or space padded in LSBs. + * @param pFeats Pointer to a feature values to be used for the segment. Only one + * feature values may be used for a segment. If NULL the default features + * for the font will be used. + * @param enc Specifies what encoding form the string is in (utf8, utf16, utf32) + * @param pStart Start of the string + * @param nChars Number of unicode characters to process in the string. The string will + * be processed either up to the first NULL or until nChars have been + * processed. nChars is also used to initialise the internal memory + * allocations of the segment. So it is wise not to make nChars too much + * greater than the actual number of characters being processed. + * @param dir Specifies whether the segment is processed right to left (1) or left to + * right (0) and whether to run the internal bidi pass, if a font requests it. + * See enum gr_bidirtl for details. + */ +GR2_API gr_segment* gr_make_seg(const gr_font* font, const gr_face* face, gr_uint32 script, const gr_feature_val* pFeats, enum gr_encform enc, const void* pStart, size_t nChars, int dir); + +/** Destroys a segment, freeing the memory. + * + * @param p The segment to destroy + */ +GR2_API void gr_seg_destroy(gr_segment* p); + +/** Returns the advance for the whole segment. + * + * Returns the width of the segment up to the next glyph origin after the segment + */ +GR2_API float gr_seg_advance_X(const gr_segment* pSeg/*not NULL*/); + +/** Returns the height advance for the segment. **/ +GR2_API float gr_seg_advance_Y(const gr_segment* pSeg/*not NULL*/); + +/** Returns the number of gr_char_infos in the segment. **/ +GR2_API unsigned int gr_seg_n_cinfo(const gr_segment* pSeg/*not NULL*/); + +/** Returns a gr_char_info at a given index in the segment. **/ +GR2_API const gr_char_info* gr_seg_cinfo(const gr_segment* pSeg/*not NULL*/, unsigned int index/*must be + +typedef unsigned char gr_uint8; +typedef gr_uint8 gr_byte; +typedef signed char gr_int8; +typedef unsigned short gr_uint16; +typedef short gr_int16; +typedef unsigned int gr_uint32; +typedef int gr_int32; + +enum gr_encform { + gr_utf8 = 1/*sizeof(uint8)*/, gr_utf16 = 2/*sizeof(uint16)*/, gr_utf32 = 4/*sizeof(uint32)*/ +}; + +// Definitions for library publicly exported symbols +#if defined _WIN32 || defined __CYGWIN__ + #if defined GRAPHITE2_STATIC + #define GR2_API + #elif defined GRAPHITE2_EXPORTING + #if defined __GNUC__ + #define GR2_API __attribute__((dllexport)) + #else + #define GR2_API __declspec(dllexport) + #endif + #else + #if defined __GNUC__ + #define GR2_API __attribute__((dllimport)) + #else + #define GR2_API __declspec(dllimport) + #endif + #endif + #define GR2_LOCAL +#else + #if __GNUC__ >= 4 + #define GR2_API __attribute__ ((visibility("default"))) + #define GR2_LOCAL __attribute__ ((visibility("hidden"))) + #else + #define GR2_API + #define GR2_LOCAL + #endif +#endif diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/Bidi.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/Bidi.cpp new file mode 100644 index 00000000000..b612a81e647 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/Bidi.cpp @@ -0,0 +1,578 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include "inc/Main.h" +#include "inc/Slot.h" +#include "inc/Segment.h" + +using namespace graphite2; + +enum DirCode { // Hungarian: dirc + Unk = -1, + N = 0, // other neutrals (default) - ON + L = 1, // left-to-right, strong - L + R = 2, // right-to-left, strong - R + AL = 3, // Arabic letter, right-to-left, strong, AR + EN = 4, // European number, left-to-right, weak - EN + ES = 5, // European separator, left-to-right, weak - ES + ET = 6, // European number terminator, left-to-right, weak - ET + AN = 7, // Arabic number, left-to-right, weak - AN + CS = 8, // Common number separator, left-to-right, weak - CS + WS = 9, // white space, neutral - WS + BN = 10, // boundary neutral - BN + + LRO = 11, // LTR override + RLO = 12, // RTL override + LRE = 13, // LTR embedding + RLE = 14, // RTL embedding + PDF = 15, // pop directional format + NSM = 16, // non-space mark + + ON = N +}; + +enum DirMask { + Nmask = 1, + Lmask = 2, + Rmask = 4, + ALmask = 8, + ENmask = 0x10, + ESmask = 0x20, + ETmask = 0x40, + ANmask = 0x80, + CSmask = 0x100, + WSmask = 0x200, + BNmask = 0x400, + LROmask = 0x800, + RLOmask = 0x1000, + LREmask = 0x2000, + RLEmask = 0x4000, + PDFmask = 0x8000, + NSMmask = 0x10000 +}; + +unsigned int bidi_class_map[] = { 0, 1, 2, 5, 4, 8, 9, 3, 7, 0, 0, 0, 0, 0, 0, 0, 6 }; +// Algorithms based on Unicode reference standard code. Thanks Asmus Freitag. +#define MAX_LEVEL 61 + +Slot *resolveExplicit(int level, int dir, Slot *s, int nNest = 0) +{ + int nLastValid = nNest; + Slot *res = NULL; + for ( ; s && !res; s = s->next()) + { + int cls = s->getBidiClass(); + switch(cls) + { + case LRO: + case LRE: + nNest++; + if (level & 1) + s->setBidiLevel(level + 1); + else + s->setBidiLevel(level + 2); + if (s->getBidiLevel() > MAX_LEVEL) + s->setBidiLevel(level); + else + { + s = resolveExplicit(s->getBidiLevel(), (cls == LRE ? N : L), s->next(), nNest); + nNest--; + if (s) continue; else break; + } + cls = BN; + s->setBidiClass(cls); + break; + + case RLO: + case RLE: + nNest++; + if (level & 1) + s->setBidiLevel(level + 2); + else + s->setBidiLevel(level + 1); + if (s->getBidiLevel() > MAX_LEVEL) + s->setBidiLevel(level); + else + { + s = resolveExplicit(s->getBidiLevel(), (cls == RLE ? N : R), s->next(), nNest); + nNest--; + if (s) continue; else break; + } + cls = BN; + s->setBidiClass(cls); + break; + + case PDF: + cls = BN; + s->setBidiClass(cls); + if (nNest) + { + if (nLastValid < nNest) + --nNest; + else + res = s; + } + break; + } + + if (dir != N) + cls = dir; + if (s) + { + s->setBidiLevel(level); + if (s->getBidiClass() != BN) + s->setBidiClass(cls); + } + else + break; + } + return res; +} + +// === RESOLVE WEAK TYPES ================================================ + +enum bidi_state // possible states +{ + xa, // arabic letter + xr, // right leter + xl, // left letter + + ao, // arabic lett. foll by ON + ro, // right lett. foll by ON + lo, // left lett. foll by ON + + rt, // ET following R + lt, // ET following L + + cn, // EN, AN following AL + ra, // arabic number foll R + re, // european number foll R + la, // arabic number foll L + le, // european number foll L + + ac, // CS following cn + rc, // CS following ra + rs, // CS,ES following re + lc, // CS following la + ls, // CS,ES following le + + ret, // ET following re + let, // ET following le +} ; + +enum bidi_state_mask +{ + xamask = 1, + xrmask = 2, + xlmask = 4, + aomask = 8, + romask = 0x10, + lomask = 0x20, + rtmask = 0x40, + ltmask = 0x80, + cnmask = 0x100, + ramask = 0x200, + remask = 0x400, + lamask = 0x800, + lemask = 0x1000, + acmask = 0x2000, + rcmask = 0x4000, + rsmask = 0x8000, + lcmask = 0x10000, + lsmask = 0x20000, + retmask = 0x40000, + letmask = 0x80000 +}; + +const bidi_state stateWeak[][10] = +{ + // N, L, R, AN, EN, AL,NSM, CS, ES, ET, +{ /*xa*/ ao, xl, xr, cn, cn, xa, xa, ao, ao, ao, /* arabic letter */ }, +{ /*xr*/ ro, xl, xr, ra, re, xa, xr, ro, ro, rt, /* right letter */ }, +{ /*xl*/ lo, xl, xr, la, le, xa, xl, lo, lo, lt, /* left letter */ }, + +{ /*ao*/ ao, xl, xr, cn, cn, xa, ao, ao, ao, ao, /* arabic lett. foll by ON*/ }, +{ /*ro*/ ro, xl, xr, ra, re, xa, ro, ro, ro, rt, /* right lett. foll by ON */ }, +{ /*lo*/ lo, xl, xr, la, le, xa, lo, lo, lo, lt, /* left lett. foll by ON */ }, + +{ /*rt*/ ro, xl, xr, ra, re, xa, rt, ro, ro, rt, /* ET following R */ }, +{ /*lt*/ lo, xl, xr, la, le, xa, lt, lo, lo, lt, /* ET following L */ }, + +{ /*cn*/ ao, xl, xr, cn, cn, xa, cn, ac, ao, ao, /* EN, AN following AL */ }, +{ /*ra*/ ro, xl, xr, ra, re, xa, ra, rc, ro, rt, /* arabic number foll R */ }, +{ /*re*/ ro, xl, xr, ra, re, xa, re, rs, rs,ret, /* european number foll R */ }, +{ /*la*/ lo, xl, xr, la, le, xa, la, lc, lo, lt, /* arabic number foll L */ }, +{ /*le*/ lo, xl, xr, la, le, xa, le, ls, ls,let, /* european number foll L */ }, + +{ /*ac*/ ao, xl, xr, cn, cn, xa, ao, ao, ao, ao, /* CS following cn */ }, +{ /*rc*/ ro, xl, xr, ra, re, xa, ro, ro, ro, rt, /* CS following ra */ }, +{ /*rs*/ ro, xl, xr, ra, re, xa, ro, ro, ro, rt, /* CS,ES following re */ }, +{ /*lc*/ lo, xl, xr, la, le, xa, lo, lo, lo, lt, /* CS following la */ }, +{ /*ls*/ lo, xl, xr, la, le, xa, lo, lo, lo, lt, /* CS,ES following le */ }, + +{ /*ret*/ ro, xl, xr, ra, re, xa,ret, ro, ro,ret, /* ET following re */ }, +{ /*let*/ lo, xl, xr, la, le, xa,let, lo, lo,let, /* ET following le */ }, + + +}; + +enum bidi_action // possible actions +{ + // primitives + IX = 0x100, // increment + XX = 0xF, // no-op + + // actions + xxx = (XX << 4) + XX, // no-op + xIx = IX + xxx, // increment run + xxN = (XX << 4) + ON, // set current to N + xxE = (XX << 4) + EN, // set current to EN + xxA = (XX << 4) + AN, // set current to AN + xxR = (XX << 4) + R, // set current to R + xxL = (XX << 4) + L, // set current to L + Nxx = (ON << 4) + 0xF, // set run to neutral + Axx = (AN << 4) + 0xF, // set run to AN + ExE = (EN << 4) + EN, // set run to EN, set current to EN + NIx = (ON << 4) + 0xF + IX, // set run to N, increment + NxN = (ON << 4) + ON, // set run to N, set current to N + NxR = (ON << 4) + R, // set run to N, set current to R + NxE = (ON << 4) + EN, // set run to N, set current to EN + + AxA = (AN << 4) + AN, // set run to AN, set current to AN + NxL = (ON << 4) + L, // set run to N, set current to L + LxL = (L << 4) + L, // set run to L, set current to L +}; + + +const bidi_action actionWeak[][10] = +{ + // N,.. L, R, AN, EN, AL, NSM, CS,..ES, ET, +{ /*xa*/ xxx, xxx, xxx, xxx, xxA, xxR, xxR, xxN, xxN, xxN, /* arabic letter */ }, +{ /*xr*/ xxx, xxx, xxx, xxx, xxE, xxR, xxR, xxN, xxN, xIx, /* right leter */ }, +{ /*xl*/ xxx, xxx, xxx, xxx, xxL, xxR, xxL, xxN, xxN, xIx, /* left letter */ }, + +{ /*ao*/ xxx, xxx, xxx, xxx, xxA, xxR, xxN, xxN, xxN, xxN, /* arabic lett. foll by ON */ }, +{ /*ro*/ xxx, xxx, xxx, xxx, xxE, xxR, xxN, xxN, xxN, xIx, /* right lett. foll by ON */ }, +{ /*lo*/ xxx, xxx, xxx, xxx, xxL, xxR, xxN, xxN, xxN, xIx, /* left lett. foll by ON */ }, + +{ /*rt*/ Nxx, Nxx, Nxx, Nxx, ExE, NxR, xIx, NxN, NxN, xIx, /* ET following R */ }, +{ /*lt*/ Nxx, Nxx, Nxx, Nxx, LxL, NxR, xIx, NxN, NxN, xIx, /* ET following L */ }, + +{ /*cn*/ xxx, xxx, xxx, xxx, xxA, xxR, xxA, xIx, xxN, xxN, /* EN, AN following AL */ }, +{ /*ra*/ xxx, xxx, xxx, xxx, xxE, xxR, xxA, xIx, xxN, xIx, /* arabic number foll R */ }, +{ /*re*/ xxx, xxx, xxx, xxx, xxE, xxR, xxE, xIx, xIx, xxE, /* european number foll R */ }, +{ /*la*/ xxx, xxx, xxx, xxx, xxL, xxR, xxA, xIx, xxN, xIx, /* arabic number foll L */ }, +{ /*le*/ xxx, xxx, xxx, xxx, xxL, xxR, xxL, xIx, xIx, xxL, /* european number foll L */ }, + +{ /*ac*/ Nxx, Nxx, Nxx, Axx, AxA, NxR, NxN, NxN, NxN, NxN, /* CS following cn */ }, +{ /*rc*/ Nxx, Nxx, Nxx, Axx, NxE, NxR, NxN, NxN, NxN, NIx, /* CS following ra */ }, +{ /*rs*/ Nxx, Nxx, Nxx, Nxx, ExE, NxR, NxN, NxN, NxN, NIx, /* CS,ES following re */ }, +{ /*lc*/ Nxx, Nxx, Nxx, Axx, NxL, NxR, NxN, NxN, NxN, NIx, /* CS following la */ }, +{ /*ls*/ Nxx, Nxx, Nxx, Nxx, LxL, NxR, NxN, NxN, NxN, NIx, /* CS,ES following le */ }, + +{ /*ret*/xxx, xxx, xxx, xxx, xxE, xxR, xxE, xxN, xxN, xxE, /* ET following re */ }, +{ /*let*/xxx, xxx, xxx, xxx, xxL, xxR, xxL, xxN, xxN, xxL, /* ET following le */ }, +}; + +inline uint8 GetDeferredType(bidi_action a) { return (a >> 4) & 0xF; } +inline uint8 GetResolvedType(bidi_action a) { return a & 0xF; } +inline DirCode EmbeddingDirection(int l) { return l & 1 ? R : L; } +inline bool IsDeferredState(bidi_state a) { return 0 != ((1 << a) & (rtmask | ltmask | acmask | rcmask | rsmask | lcmask | lsmask)); } +inline bool IsModifiedClass(DirCode a) { return 0 != ((1 << a) & (ALmask | NSMmask | ESmask | CSmask | ETmask | ENmask)); } + +void SetDeferredRunClass(Slot *s, Slot *sRun, int nval) +{ + if (!sRun || s == sRun) return; + for (Slot *p = s->prev(); p != sRun; p = p->prev()) + p->setBidiClass(nval); +} + +void resolveWeak(int baseLevel, Slot *s) +{ + int state = (baseLevel & 1) ? xr : xl; + int cls; + int level = baseLevel; + Slot *sRun = NULL; + Slot *sLast = s; + + for ( ; s; s = s->next()) + { + sLast = s; + cls = s->getBidiClass(); + if (cls == BN) + { + s->setBidiLevel(level); + if (!s->next() && level != baseLevel) + s->setBidiClass(EmbeddingDirection(level)); + else if (s->next() && level != s->next()->getBidiLevel() && s->next()->getBidiClass() != BN) + { + int newLevel = s->next()->getBidiLevel(); + if (level > newLevel) + newLevel = level; + s->setBidiLevel(newLevel); + s->setBidiClass(EmbeddingDirection(newLevel)); + level = s->next()->getBidiLevel(); + } + else + continue; + } + + bidi_action action = actionWeak[state][bidi_class_map[cls]]; + int clsRun = GetDeferredType(action); + if (clsRun != XX) + { + SetDeferredRunClass(s, sRun, clsRun); + sRun = NULL; + } + int clsNew = GetResolvedType(action); + if (clsNew != XX) + s->setBidiClass(clsNew); + if (!sRun && (IX & action)) + sRun = s->prev(); + state = stateWeak[state][bidi_class_map[cls]]; + } + + cls = EmbeddingDirection(level); + int clsRun = GetDeferredType(actionWeak[state][bidi_class_map[cls]]); + if (clsRun != XX) + SetDeferredRunClass(sLast, sRun, clsRun); +} + +// Neutrals +enum neutral_action +{ + // action to resolve previous input + nL = L, // resolve EN to L + En = 3 << 4, // resolve neutrals run to embedding level direction + Rn = R << 4, // resolve neutrals run to strong right + Ln = L << 4, // resolved neutrals run to strong left + In = (1<<8), // increment count of deferred neutrals + LnL = (1<<4)+L, // set run and EN to L +}; + +int GetDeferredNeutrals(int action, int level) +{ + action = (action >> 4) & 0xF; + if (action == (En >> 4)) + return EmbeddingDirection(level); + else + return action; +} + +int GetResolvedNeutrals(int action) +{ + action = action & 0xF; + if (action == In) + return 0; + else + return action; +} + +// state values +enum neutral_state +{ + // new temporary class + r, // R and characters resolved to R + l, // L and characters resolved to L + rn, // N preceded by right + ln, // N preceded by left + a, // AN preceded by left (the abbrev 'la' is used up above) + na, // N preceeded by a +} ; + +const uint8 neutral_class_map[] = { 0, 1, 2, 0, 4, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0 }; + +const int actionNeutrals[][5] = +{ +// N, L, R, AN, EN, = cls + // state = +{ In, 0, 0, 0, 0, }, // r right +{ In, 0, 0, 0, L, }, // l left + +{ In, En, Rn, Rn, Rn, }, // rn N preceded by right +{ In, Ln, En, En, LnL, }, // ln N preceded by left + +{ In, 0, 0, 0, L, }, // a AN preceded by left +{ In, En, Rn, Rn, En, }, // na N preceded by a +} ; + +const int stateNeutrals[][5] = +{ +// N, L, R, AN, EN = cls + // state = +{ rn, l, r, r, r, }, // r right +{ ln, l, r, a, l, }, // l left + +{ rn, l, r, r, r, }, // rn N preceded by right +{ ln, l, r, a, l, }, // ln N preceded by left + +{ na, l, r, a, l, }, // a AN preceded by left +{ na, l, r, a, l, }, // na N preceded by la +} ; + +void resolveNeutrals(int baseLevel, Slot *s) +{ + int state = baseLevel ? r : l; + int cls; + Slot *sRun = NULL; + Slot *sLast = s; + int level = baseLevel; + + for ( ; s; s = s->next()) + { + sLast = s; + cls = s->getBidiClass(); + if (cls == BN) + { + if (sRun) + sRun = sRun->prev(); + continue; + } + + int action = actionNeutrals[state][neutral_class_map[cls]]; + int clsRun = GetDeferredNeutrals(action, level); + if (clsRun != N) + { + SetDeferredRunClass(s, sRun, clsRun); + sRun = NULL; + } + int clsNew = GetResolvedNeutrals(action); + if (clsNew != N) + s->setBidiClass(clsNew); + if (!sRun && (action & In)) + sRun = s->prev(); + state = stateNeutrals[state][neutral_class_map[cls]]; + level = s->getBidiLevel(); + } + cls = EmbeddingDirection(level); + int clsRun = GetDeferredNeutrals(actionNeutrals[state][neutral_class_map[cls]], level); + if (clsRun != N) + SetDeferredRunClass(sLast, sRun, clsRun); +} + +const int addLevel[][4] = +{ + // L, R, AN, EN = cls + // level = +/* even */ { 0, 1, 2, 2, }, // EVEN +/* odd */ { 1, 0, 1, 1, }, // ODD + +}; + +void resolveImplicit(Slot *s, Segment *seg, uint8 aMirror) +{ + bool rtl = seg->dir() & 1; + for ( ; s; s = s->next()) + { + int cls = s->getBidiClass(); + if (cls == BN) + continue; + else if (cls == AN) + cls = AL; + if (cls < 5 && cls > 0) + { + int level = s->getBidiLevel(); + level += addLevel[level & 1][cls - 1]; + s->setBidiLevel(level); + if (aMirror) + { + int hasChar = seg->glyphAttr(s->gid(), aMirror + 1); + if ( ((level & 1) && (!(seg->dir() & 4) || !hasChar)) + || ((rtl ^ (level & 1)) && (seg->dir() & 4) && hasChar) ) + { + unsigned short g = seg->glyphAttr(s->gid(), aMirror); + if (g) s->setGlyph(seg, g); + } + } + } + } +} + +void resolveWhitespace(int baseLevel, Segment *seg, uint8 aBidi, Slot *s) +{ + for ( ; s; s = s->prev()) + { + int cls = seg->glyphAttr(s->gid(), aBidi); + if (cls == WS) + s->setBidiLevel(baseLevel); + else + break; + } +} + + +inline +Slot * join(int level, Slot * a, Slot * b) +{ + if (!a) return b; + if (level & 1) { Slot * const t = a; a = b; b = t; } + Slot * const t = b->prev(); + a->prev()->next(b); b->prev(a->prev()); // splice middle + t->next(a); a->prev(t); // splice ends + return a; +} + + +Slot * span(Slot * & cs, const bool rtl) +{ + Slot * r = cs, * re = cs; cs = cs->next(); + if (rtl) + { + Slot * t = r->next(); r->next(r->prev()); r->prev(t); + for (int l = r->getBidiLevel(); cs && l == cs->getBidiLevel(); cs = cs->prev()) + { + re = cs; + t = cs->next(); cs->next(cs->prev()); cs->prev(t); + } + r->next(re); + re->prev(r); + r = re; + } + else + { + for (int l = r->getBidiLevel(); cs && l == cs->getBidiLevel(); cs = cs->next()) + re = cs; + r->prev(re); + re->next(r); + } + if (cs) cs->prev(0); + return r; +} + + +Slot *resolveOrder(Slot * & cs, const bool reordered, const int level) +{ + Slot * r = 0; + int ls; + while (cs && level <= (ls = cs->getBidiLevel() - reordered)) + { + r = join(level, r, level >= ls + ? span(cs, level & 1) + : resolveOrder(cs, reordered, level+1)); + } + return r; +} + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/CMakeLists.txt b/Build/source/libs/graphite2/graphite2-1.2.1/src/CMakeLists.txt new file mode 100644 index 00000000000..ef0f8a7b6dd --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/CMakeLists.txt @@ -0,0 +1,139 @@ +# GRAPHITE2 LICENSING +# +# Copyright 2010, SIL International +# All rights reserved. +# +# This library is free software; you can redistribute it and/or modify +# it under the terms of the GNU Lesser General Public License as published +# by the Free Software Foundation; either version 2.1 of License, or +# (at your option) any later version. +# +# This program 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 for more details. +# +# You should also have received a copy of the GNU Lesser General Public +# License along with this library in the file named "LICENSE". +# If not, write to the Free Software Foundation, 51 Franklin Street, +# Suite 500, Boston, MA 02110-1335, USA or visit their web page on the +# internet at http://www.fsf.org/licenses/lgpl.html. + +CMAKE_MINIMUM_REQUIRED(VERSION 2.8.0 FATAL_ERROR) +project(graphite2_core) +cmake_policy(SET CMP0012 NEW) +INCLUDE(CheckCXXSourceCompiles) + +set(GRAPHITE_API_CURRENT 3) +set(GRAPHITE_API_REVISION 0) +set(GRAPHITE_API_AGE 1) +set(GRAPHITE_VERSION ${GRAPHITE_API_CURRENT}.${GRAPHITE_API_REVISION}.${GRAPHITE_API_AGE}) +set(GRAPHITE_SO_VERSION ${GRAPHITE_API_CURRENT}) + +include(TestBigEndian) + +include_directories(${PROJECT_SOURCE_DIR}) + +set(SEGCACHE SegCache.cpp SegCacheEntry.cpp SegCacheStore.cpp) +if (GRAPHITE2_NSEGCACHE) + add_definitions(-DGRAPHITE2_NSEGCACHE) + set(SEGCACHE) +endif (GRAPHITE2_NSEGCACHE) + +set(FILEFACE FileFace.cpp) +if (GRAPHITE2_NFILEFACE) + add_definitions(-DGRAPHITE2_NFILEFACE) + set(FILEFACE) +endif (GRAPHITE2_NFILEFACE) + +set(TRACING json.cpp) +if (GRAPHITE2_NTRACING) + add_definitions(-DGRAPHITE2_NTRACING) + set(TRACING) +endif (GRAPHITE2_NTRACING) + + +set(GRAPHITE_HEADERS + ../include/graphite2/Font.h + ../include/graphite2/Segment.h + ../include/graphite2/Types.h + ../include/graphite2/Log.h + ) + +file(GLOB PRIVATE_HEADERS inc/*.h) + +add_library(graphite2 SHARED + ${GRAPHITE2_VM_TYPE}_machine.cpp + gr_char_info.cpp + gr_features.cpp + gr_face.cpp + gr_font.cpp + gr_logging.cpp + gr_segment.cpp + gr_slot.cpp + Bidi.cpp + CachedFace.cpp + CmapCache.cpp + Code.cpp + Face.cpp + FeatureMap.cpp + Font.cpp + GlyphFace.cpp + GlyphCache.cpp + Justifier.cpp + NameTable.cpp + Pass.cpp + Rule.cpp + Segment.cpp + Silf.cpp + Slot.cpp + Sparse.cpp + TtfUtil.cpp + UtfCodec.cpp + ${FILEFACE} + ${SEGCACHE} + ${TRACING}) + +set_target_properties(graphite2 PROPERTIES PUBLIC_HEADER "${GRAPHITE_HEADERS}" + SOVERSION ${GRAPHITE_SO_VERSION} + VERSION ${GRAPHITE_VERSION} + LT_VERSION_CURRENT ${GRAPHITE_API_CURRENT} + LT_VERSION_REVISION ${GRAPHITE_API_REVISION} + LT_VERSION_AGE ${GRAPHITE_API_AGE}) + +if (${CMAKE_SYSTEM_NAME} STREQUAL "Linux") + set_target_properties(graphite2 PROPERTIES + COMPILE_FLAGS "-Wall -Wextra -Wno-unknown-pragmas -Wendif-labels -Wshadow -Wctor-dtor-privacy -Wnon-virtual-dtor -fno-rtti -fno-exceptions -fvisibility=hidden -fvisibility-inlines-hidden -fno-stack-protector" + LINK_FLAGS "-nodefaultlibs" + LINKER_LANGUAGE C) + if (${CMAKE_CXX_COMPILER} MATCHES ".*mingw.*") + target_link_libraries(graphite2 kernel32 msvcr90 mingw32 gcc user32) + else (${CMAKE_CXX_COMPILER} MATCHES ".*mingw.*") + target_link_libraries(graphite2 c gcc) + include(Graphite) + nolib_test(stdc++ $) + endif (${CMAKE_CXX_COMPILER} MATCHES ".*mingw.*") + set(CMAKE_CXX_IMPLICIT_LINK_LIBRARIES "") + CREATE_LIBTOOL_FILE(graphite2 "/lib${LIB_SUFFIX}") +endif (${CMAKE_SYSTEM_NAME} STREQUAL "Linux") + +if (${CMAKE_SYSTEM_NAME} STREQUAL "Darwin") + set_target_properties(graphite2 PROPERTIES + COMPILE_FLAGS "-Wall -Wextra -Wno-unknown-pragmas -Wendif-labels -Wshadow -Wno-ctor-dtor-privacy -Wno-non-virtual-dtor -fno-rtti -fno-exceptions -fvisibility=hidden -fvisibility-inlines-hidden -fno-stack-protector" + LINK_FLAGS "-nodefaultlibs" + LINKER_LANGUAGE C) + target_link_libraries(graphite2 c) + include(Graphite) + nolib_test(stdc++ $) + set(CMAKE_CXX_IMPLICIT_LINK_LIBRARIES "") + CREATE_LIBTOOL_FILE(graphite2 "/lib${LIB_SUFFIX}") +endif (${CMAKE_SYSTEM_NAME} STREQUAL "Darwin") + +if (${CMAKE_SYSTEM_NAME} STREQUAL "Windows") + set_target_properties(graphite2 PROPERTIES + COMPILE_DEFINITIONS "_SCL_SECURE_NO_WARNINGS;_CRT_SECURE_NO_WARNINGS;UNICODE;GRAPHITE2_EXPORTING") +endif (${CMAKE_SYSTEM_NAME} STREQUAL "Windows") + + +install(TARGETS graphite2 EXPORT graphite2 LIBRARY DESTINATION lib${LIB_SUFFIX} ARCHIVE DESTINATION lib${LIB_SUFFIX} PUBLIC_HEADER DESTINATION include/graphite2 RUNTIME DESTINATION bin) +install(EXPORT graphite2 DESTINATION share/graphite2 NAMESPACE gr2_) diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/CachedFace.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/CachedFace.cpp new file mode 100644 index 00000000000..3642768854b --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/CachedFace.cpp @@ -0,0 +1,127 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ + +#ifndef GRAPHITE2_NSEGCACHE + +#include +#include "inc/CachedFace.h" +#include "inc/SegCacheStore.h" + + +using namespace graphite2; + +CachedFace::CachedFace(const void* appFaceHandle/*non-NULL*/, const gr_face_ops & ops) +: Face(appFaceHandle, ops), m_cacheStore(0) +{ +} + +CachedFace::~CachedFace() +{ + delete m_cacheStore; +} + +bool CachedFace::setupCache(unsigned int cacheSize) +{ + m_cacheStore = new SegCacheStore(*this, m_numSilf, cacheSize); + return bool(m_cacheStore); +} + + +bool CachedFace::runGraphite(Segment *seg, const Silf *pSilf) const +{ + assert(pSilf); + pSilf->runGraphite(seg, 0, pSilf->substitutionPass()); + + unsigned int silfIndex = 0; + for (; silfIndex < m_numSilf && &(m_silfs[silfIndex]) != pSilf; ++silfIndex); + if (silfIndex == m_numSilf) return false; + SegCache * const segCache = m_cacheStore->getOrCreate(silfIndex, seg->getFeatures(0)); + if (!segCache) + return false; + + assert(m_cacheStore); + // find where the segment can be broken + Slot * subSegStartSlot = seg->first(); + Slot * subSegEndSlot = subSegStartSlot; + uint16 cmapGlyphs[eMaxSpliceSize]; + int subSegStart = 0; + for (unsigned int i = 0; i < seg->charInfoCount(); ++i) + { + const unsigned int length = i - subSegStart + 1; + if (length < eMaxSpliceSize) + cmapGlyphs[length-1] = subSegEndSlot->gid(); + else return false; + const bool spaceOnly = m_cacheStore->isSpaceGlyph(subSegEndSlot->gid()); + // at this stage the character to slot mapping is still 1 to 1 + const int breakWeight = seg->charinfo(i)->breakWeight(), + nextBreakWeight = (i + 1 < seg->charInfoCount())? + seg->charinfo(i+1)->breakWeight() : 0; + const uint8 f = seg->charinfo(i)->flags(); + if (((spaceOnly + || (breakWeight > 0 && breakWeight <= gr_breakWord) + || i + 1 == seg->charInfoCount() + || ((nextBreakWeight < 0 && nextBreakWeight >= gr_breakBeforeWord) + || (subSegEndSlot->next() && m_cacheStore->isSpaceGlyph(subSegEndSlot->next()->gid())))) + && f != 1) + || f == 2) + { + // record the next slot before any splicing + Slot * nextSlot = subSegEndSlot->next(); + // spaces should be left untouched by graphite rules in any sane font + if (!spaceOnly) + { + // found a break position, check for a cache of the sub sequence + const SegCacheEntry * entry = segCache->find(cmapGlyphs, length); + // TODO disable cache for words at start/end of line with contextuals + if (!entry) + { + SegmentScopeState scopeState = seg->setScope(subSegStartSlot, subSegEndSlot, length); + pSilf->runGraphite(seg, pSilf->substitutionPass(), pSilf->numPasses()); + if (length < eMaxSpliceSize) + { + seg->associateChars(); + entry = segCache->cache(m_cacheStore, cmapGlyphs, length, seg, subSegStart); + } + seg->removeScope(scopeState); + } + else + seg->splice(subSegStart, length, subSegStartSlot, subSegEndSlot, + entry->first(), entry->glyphLength()); + } + subSegStartSlot = subSegEndSlot = nextSlot; + subSegStart = i + 1; + } + else + { + subSegEndSlot = subSegEndSlot->next(); + } + } + return true; +} + +#endif + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/CmapCache.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/CmapCache.cpp new file mode 100644 index 00000000000..c5e4be0366f --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/CmapCache.cpp @@ -0,0 +1,152 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ + +#include "inc/Main.h" +#include "inc/CmapCache.h" +#include "inc/Face.h" +#include "inc/TtfTypes.h" +#include "inc/TtfUtil.h" + + +using namespace graphite2; + +const void * bmp_subtable(const Face::Table & cmap) +{ + const void * stbl; + if (TtfUtil::CheckCmapSubtable4(stbl = TtfUtil::FindCmapSubtable(cmap, 3, 1, cmap.size())) + || TtfUtil::CheckCmapSubtable4(stbl = TtfUtil::FindCmapSubtable(cmap, 0, 3, cmap.size())) + || TtfUtil::CheckCmapSubtable4(stbl = TtfUtil::FindCmapSubtable(cmap, 0, 2, cmap.size())) + || TtfUtil::CheckCmapSubtable4(stbl = TtfUtil::FindCmapSubtable(cmap, 0, 1, cmap.size())) + || TtfUtil::CheckCmapSubtable4(stbl = TtfUtil::FindCmapSubtable(cmap, 0, 0, cmap.size()))) + return stbl; + return 0; +} + +const void * smp_subtable(const Face::Table & cmap) +{ + const void * stbl; + if (TtfUtil::CheckCmapSubtable12(stbl = TtfUtil::FindCmapSubtable(cmap, 3, 10, cmap.size())) + || TtfUtil::CheckCmapSubtable12(stbl = TtfUtil::FindCmapSubtable(cmap, 0, 4, cmap.size()))) + return stbl; + return 0; +} + +template +bool cache_subtable(uint16 * blocks[], const void * cst, const unsigned int limit) +{ + int rangeKey = 0; + uint32 codePoint = NextCodePoint(cst, 0, &rangeKey), + prevCodePoint = 0; + while (codePoint != limit) + { + unsigned int block = codePoint >> 8; + if (!blocks[block]) + { + blocks[block] = grzeroalloc(0x100); + if (!blocks[block]) + return false; + } + blocks[block][codePoint & 0xFF] = LookupCodePoint(cst, codePoint, rangeKey); + // prevent infinite loop + if (codePoint <= prevCodePoint) + codePoint = prevCodePoint + 1; + prevCodePoint = codePoint; + codePoint = NextCodePoint(cst, codePoint, &rangeKey); + } + return true; +} + + +CachedCmap::CachedCmap(const Face & face) +: m_isBmpOnly(true), + m_blocks(0) +{ + const Face::Table cmap(face, Tag::cmap); + if (!cmap) return; + + const void * bmp_cmap = bmp_subtable(cmap); + const void * smp_cmap = smp_subtable(cmap); + m_isBmpOnly = !smp_cmap; + + m_blocks = grzeroalloc(m_isBmpOnly ? 0x100 : 0x1100); + if (m_blocks && smp_cmap) + { + if (!cache_subtable(m_blocks, smp_cmap, 0x10FFFF)) + return; + } + + if (m_blocks && bmp_cmap) + { + if (!cache_subtable(m_blocks, bmp_cmap, 0xFFFF)) + return; + } +} + +CachedCmap::~CachedCmap() throw() +{ + unsigned int numBlocks = (m_isBmpOnly)? 0x100 : 0x1100; + for (unsigned int i = 0; i < numBlocks; i++) + free(m_blocks[i]); + free(m_blocks); +} + +uint16 CachedCmap::operator [] (const uint32 usv) const throw() +{ + if ((m_isBmpOnly && usv > 0xFFFF) || (usv > 0x10FFFF)) + return 0; + const uint32 block = 0xFFFF & (usv >> 8); + if (m_blocks[block]) + return m_blocks[block][usv & 0xFF]; + return 0; +}; + +CachedCmap::operator bool() const throw() +{ + return m_blocks != 0; +} + + +DirectCmap::DirectCmap(const Face & face) +: _cmap(face, Tag::cmap), + _smp(smp_subtable(_cmap)), + _bmp(bmp_subtable(_cmap)) +{ +} + +uint16 DirectCmap::operator [] (const uint32 usv) const throw() +{ + return usv > 0xFFFF + ? (_smp ? TtfUtil::CmapSubtable12Lookup(_smp, usv, 0) : 0) + : TtfUtil::CmapSubtable4Lookup(_bmp, usv, 0); +} + +DirectCmap::operator bool () const throw() +{ + return _cmap && _bmp; +} + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/Code.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/Code.cpp new file mode 100644 index 00000000000..01f9d511e95 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/Code.cpp @@ -0,0 +1,609 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +// This class represents loaded graphite stack machine code. It performs +// basic sanity checks, on the incoming code to prevent more obvious problems +// from crashing graphite. +// Author: Tim Eves + +#include +#include +#include +#include +#include "graphite2/Segment.h" +#include "inc/Code.h" +#include "inc/Face.h" +#include "inc/GlyphFace.h" +#include "inc/GlyphCache.h" +#include "inc/Machine.h" +#include "inc/Rule.h" +#include "inc/Silf.h" + +#include + +#ifdef NDEBUG +#ifdef __GNUC__ +#pragma GCC diagnostic ignored "-Wunused-parameter" +#endif +#endif + + +using namespace graphite2; +using namespace vm; + +namespace { + +inline bool is_return(const instr i) { + const opcode_t * opmap = Machine::getOpcodeTable(); + const instr pop_ret = *opmap[POP_RET].impl, + ret_zero = *opmap[RET_ZERO].impl, + ret_true = *opmap[RET_TRUE].impl; + return i == pop_ret || i == ret_zero || i == ret_true; +} + +struct context +{ + context(uint8 ref=0) : codeRef(ref) {flags.changed=false; flags.referenced=false; flags.inserted=false;} + struct { + uint8 changed:1, + referenced:1, + inserted:1; + } flags; + uint8 codeRef; +}; + +} // end namespace + + +class Machine::Code::decoder +{ +public: + struct limits; + struct analysis + { + uint8 slotref; + context contexts[256]; + byte max_ref; + + analysis() : slotref(0), max_ref(0) {}; + void set_ref(int index) throw(); + void set_changed(int index) throw(); + + }; + + decoder(const limits & lims, Code &code) throw(); + + bool load(const byte * bc_begin, const byte * bc_end); + void apply_analysis(instr * const code, instr * code_end); + byte max_ref() { return _analysis.max_ref; } + int pre_context() const { return _pre_context; } + +private: + opcode fetch_opcode(const byte * bc); + void analyse_opcode(const opcode, const int8 * const dp) throw(); + bool emit_opcode(opcode opc, const byte * & bc); + bool validate_opcode(const opcode opc, const byte * const bc); + bool valid_upto(const uint16 limit, const uint16 x) const throw(); + void failure(const status_t s) const throw() { _code.failure(s); } + + Code & _code; + int _pre_context; + uint16 _rule_length; + instr * _instr; + byte * _data; + const limits & _max; + analysis _analysis; +}; + + +struct Machine::Code::decoder::limits +{ + const byte * const bytecode; + const uint8 pre_context; + const uint16 rule_length, + classes, + glyf_attrs, + features; + const byte attrid[gr_slatMax]; +}; + +inline Machine::Code::decoder::decoder(const limits & lims, Code &code) throw() +: _code(code), + _pre_context(code._constraint ? 0 : lims.pre_context), + _rule_length(code._constraint ? 1 : lims.rule_length), + _instr(code._code), _data(code._data), _max(lims) +{ } + + + +Machine::Code::Code(bool is_constraint, const byte * bytecode_begin, const byte * const bytecode_end, + uint8 pre_context, uint16 rule_length, const Silf & silf, const Face & face) + : _code(0), _data(0), _data_size(0), _instr_count(0), _max_ref(0), _status(loaded), + _constraint(is_constraint), _modify(false), _delete(false), _own(true) +{ + assert(bytecode_begin != 0); + if (bytecode_begin == bytecode_end) + { + ::new (this) Code(); + return; + } + assert(bytecode_end > bytecode_begin); + const opcode_t * op_to_fn = Machine::getOpcodeTable(); + + // Allocate code and dat target buffers, these sizes are a worst case + // estimate. Once we know their real sizes the we'll shrink them. + _code = static_cast(malloc((bytecode_end - bytecode_begin) + * sizeof(instr))); + _data = static_cast(malloc((bytecode_end - bytecode_begin) + * sizeof(byte))); + + if (!_code || !_data) { + failure(alloc_failed); + return; + } + + const decoder::limits lims = { + bytecode_end, + pre_context, + rule_length, + silf.numClasses(), + face.glyphs().numAttrs(), + face.numFeatures(), + {1,1,1,1,1,1,1,1, + 1,1,1,1,1,1,1,255, + 1,1,1,1,1,1,1,1, + 1,1,1,1,1,1,0,0, + 0,0,0,0,0,0,0,0, + 0,0,0,0,0,0,0,0, + 0,0,0,0,0,0,0, silf.numUser()} + }; + + decoder dec(lims, *this); + if(!dec.load(bytecode_begin, bytecode_end)) + return; + + // Is this an empty program? + if (_instr_count == 0) + { + release_buffers(); + ::new (this) Code(); + return; + } + + // When we reach the end check we've terminated it correctly + if (!is_return(_code[_instr_count-1])) { + failure(missing_return); + return; + } + + assert((_constraint && immutable()) || !_constraint); + dec.apply_analysis(_code, _code + _instr_count); + _max_ref = dec.max_ref(); + + // Now we know exactly how much code and data the program really needs + // realloc the buffers to exactly the right size so we don't waste any + // memory. + assert((bytecode_end - bytecode_begin) >= std::ptrdiff_t(_instr_count)); + assert((bytecode_end - bytecode_begin) >= std::ptrdiff_t(_data_size)); + _code = static_cast(realloc(_code, (_instr_count+1)*sizeof(instr))); + _data = static_cast(realloc(_data, _data_size*sizeof(byte))); + + // Make this RET_ZERO, we should never reach this but just in case ... + _code[_instr_count] = op_to_fn[RET_ZERO].impl[_constraint]; + + if (!_code) + failure(alloc_failed); +} + +Machine::Code::~Code() throw () +{ + if (_own) + release_buffers(); +} + + +bool Machine::Code::decoder::load(const byte * bc, const byte * bc_end) +{ + while (bc < bc_end) + { + const opcode opc = fetch_opcode(bc++); + if (opc == vm::MAX_OPCODE) + return false; + + analyse_opcode(opc, reinterpret_cast(bc)); + + if (!emit_opcode(opc, bc)) + return false; + } + + return bool(_code); +} + +// Validation check and fixups. +// + +opcode Machine::Code::decoder::fetch_opcode(const byte * bc) +{ + const opcode opc = opcode(*bc++); + + // Do some basic sanity checks based on what we know about the opcode + if (!validate_opcode(opc, bc)) return MAX_OPCODE; + + // And check it's arguments as far as possible + switch (opc) + { + case NOP : + case PUSH_BYTE : + case PUSH_BYTEU : + case PUSH_SHORT : + case PUSH_SHORTU : + case PUSH_LONG : + case ADD : + case SUB : + case MUL : + case DIV : + case MIN_ : + case MAX_ : + case NEG : + case TRUNC8 : + case TRUNC16 : + case COND : + case AND : + case OR : + case NOT : + case EQUAL : + case NOT_EQ : + case LESS : + case GTR : + case LESS_EQ : + case GTR_EQ : + break; + case NEXT : + case NEXT_N : // runtime checked + case COPY_NEXT : + ++_pre_context; + break; + case PUT_GLYPH_8BIT_OBS : + valid_upto(_max.classes, bc[0]); + break; + case PUT_SUBS_8BIT_OBS : + valid_upto(_rule_length, _pre_context + int8(bc[0])); + valid_upto(_max.classes, bc[1]); + valid_upto(_max.classes, bc[2]); + break; + case PUT_COPY : + valid_upto(_rule_length, _pre_context + int8(bc[0])); + break; + case INSERT : + --_pre_context; + break; + case DELETE : + break; + case ASSOC : + for (uint8 num = bc[0]; num; --num) + valid_upto(_rule_length, _pre_context + int8(bc[num])); + break; + case CNTXT_ITEM : + valid_upto(_max.rule_length, _max.pre_context + int8(bc[0])); + if (bc + 2 + bc[1] >= _max.bytecode) failure(jump_past_end); + if (_pre_context != 0) failure(nested_context_item); + break; + case ATTR_SET : + case ATTR_ADD : + case ATTR_SUB : + case ATTR_SET_SLOT : + valid_upto(gr_slatMax, bc[0]); + break; + case IATTR_SET_SLOT : + if (valid_upto(gr_slatMax, bc[0])) + valid_upto(_max.attrid[bc[0]], bc[1]); + break; + case PUSH_SLOT_ATTR : + valid_upto(gr_slatMax, bc[0]); + valid_upto(_rule_length, _pre_context + int8(bc[1])); + break; + case PUSH_GLYPH_ATTR_OBS : + valid_upto(_max.glyf_attrs, bc[0]); + valid_upto(_rule_length, _pre_context + int8(bc[1])); + break; + case PUSH_GLYPH_METRIC : + valid_upto(kgmetDescent, bc[0]); + valid_upto(_rule_length, _pre_context + int8(bc[1])); + // level: dp[2] no check necessary + break; + case PUSH_FEAT : + valid_upto(_max.features, bc[0]); + valid_upto(_rule_length, _pre_context + int8(bc[1])); + break; + case PUSH_ATT_TO_GATTR_OBS : + valid_upto(_max.glyf_attrs, bc[0]); + valid_upto(_rule_length, _pre_context + int8(bc[1])); + break; + case PUSH_ATT_TO_GLYPH_METRIC : + valid_upto(kgmetDescent, bc[0]); + valid_upto(_rule_length, _pre_context + int8(bc[1])); + // level: dp[2] no check necessary + break; + case PUSH_ISLOT_ATTR : + if (valid_upto(gr_slatMax, bc[0])) + { + valid_upto(_rule_length, _pre_context + int8(bc[1])); + valid_upto(_max.attrid[bc[0]], bc[2]); + } + break; + case PUSH_IGLYPH_ATTR :// not implemented + case POP_RET : + case RET_ZERO : + case RET_TRUE : + break; + case IATTR_SET : + case IATTR_ADD : + case IATTR_SUB : + if (valid_upto(gr_slatMax, bc[0])) + valid_upto(_max.attrid[bc[0]], bc[1]); + break; + case PUSH_PROC_STATE : // dummy: dp[0] no check necessary + case PUSH_VERSION : + break; + case PUT_SUBS : + valid_upto(_rule_length, _pre_context + int8(bc[0])); + valid_upto(_max.classes, uint16(bc[1]<< 8) | bc[2]); + valid_upto(_max.classes, uint16(bc[3]<< 8) | bc[4]); + break; + case PUT_SUBS2 : // not implemented + case PUT_SUBS3 : // not implemented + break; + case PUT_GLYPH : + valid_upto(_max.classes, uint16(bc[0]<< 8) | bc[1]); + break; + case PUSH_GLYPH_ATTR : + case PUSH_ATT_TO_GLYPH_ATTR : + valid_upto(_max.glyf_attrs, uint16(bc[0]<< 8) | bc[1]); + valid_upto(_rule_length, _pre_context + int8(bc[2])); + break; + default: + failure(invalid_opcode); + break; + } + + return bool(_code) ? opc : MAX_OPCODE; +} + + +void Machine::Code::decoder::analyse_opcode(const opcode opc, const int8 * arg) throw() +{ + if (_code._constraint) return; + + switch (opc) + { + case DELETE : + _code._delete = true; + break; + case PUT_GLYPH_8BIT_OBS : + case PUT_GLYPH : + _code._modify = true; + _analysis.set_changed(_analysis.slotref); + break; + case NEXT : + case COPY_NEXT : + if (!_analysis.contexts[_analysis.slotref].flags.inserted) + ++_analysis.slotref; + _analysis.contexts[_analysis.slotref] = context(_code._instr_count+1); + if (_analysis.slotref > _analysis.max_ref) _analysis.max_ref = _analysis.slotref; + break; + case INSERT : + _analysis.contexts[_analysis.slotref].flags.inserted = true; + _code._modify = true; + break; + case PUT_SUBS_8BIT_OBS : // slotref on 1st parameter + case PUT_SUBS : + _code._modify = true; + _analysis.set_changed(_analysis.slotref); + // no break + case PUT_COPY : + { + if (arg[0] != 0) { _analysis.set_changed(_analysis.slotref); _code._modify = true; } + if (arg[0] <= 0 && -arg[0] <= _analysis.slotref - _analysis.contexts[_analysis.slotref].flags.inserted) + _analysis.set_ref(_analysis.slotref + arg[0] - _analysis.contexts[_analysis.slotref].flags.inserted); + else if (_analysis.slotref + arg[0] > _analysis.max_ref) _analysis.max_ref = _analysis.slotref + arg[0]; + break; + } + case PUSH_ATT_TO_GATTR_OBS : // slotref on 2nd parameter + if (_code._constraint) return; + // no break + case PUSH_GLYPH_ATTR_OBS : + case PUSH_SLOT_ATTR : + case PUSH_GLYPH_METRIC : + case PUSH_ATT_TO_GLYPH_METRIC : + case PUSH_ISLOT_ATTR : + case PUSH_FEAT : + if (arg[1] <= 0 && -arg[1] <= _analysis.slotref - _analysis.contexts[_analysis.slotref].flags.inserted) + _analysis.set_ref(_analysis.slotref + arg[1] - _analysis.contexts[_analysis.slotref].flags.inserted); + else if (_analysis.slotref + arg[1] > _analysis.max_ref) _analysis.max_ref = _analysis.slotref + arg[1]; + break; + case PUSH_ATT_TO_GLYPH_ATTR : + if (_code._constraint) return; + // no break + case PUSH_GLYPH_ATTR : + if (arg[2] <= 0 && -arg[2] <= _analysis.slotref - _analysis.contexts[_analysis.slotref].flags.inserted) + _analysis.set_ref(_analysis.slotref + arg[2] - _analysis.contexts[_analysis.slotref].flags.inserted); + else if (_analysis.slotref + arg[2] > _analysis.max_ref) _analysis.max_ref = _analysis.slotref + arg[2]; + break; + case ASSOC : // slotrefs in varargs + break; + default: + break; + } +} + + +bool Machine::Code::decoder::emit_opcode(opcode opc, const byte * & bc) +{ + const opcode_t * op_to_fn = Machine::getOpcodeTable(); + const opcode_t & op = op_to_fn[opc]; + if (op.impl[_code._constraint] == 0) + { + failure(unimplemented_opcode_used); + return false; + } + + const size_t param_sz = op.param_sz == VARARGS ? bc[0] + 1 : op.param_sz; + + // Add this instruction + *_instr++ = op.impl[_code._constraint]; + ++_code._instr_count; + + // Grab the parameters + if (param_sz) { + memcpy(_data, bc, param_sz * sizeof(byte)); + bc += param_sz; + _data += param_sz; + _code._data_size += param_sz; + } + + // recursively decode a context item so we can split the skip into + // instruction and data portions. + if (opc == CNTXT_ITEM) + { + assert(_pre_context == 0); + _pre_context = _max.pre_context + int8(_data[-2]); + _rule_length = _max.rule_length; + + const size_t ctxt_start = _code._instr_count; + byte & instr_skip = _data[-1]; + byte & data_skip = *_data++; + ++_code._data_size; + + if (load(bc, bc + instr_skip)) + { + bc += instr_skip; + data_skip = instr_skip - (_code._instr_count - ctxt_start); + instr_skip = _code._instr_count - ctxt_start; + + _rule_length = 1; + _pre_context = 0; + } + } + + return bool(_code); +} + + +void Machine::Code::decoder::apply_analysis(instr * const code, instr * code_end) +{ + // insert TEMP_COPY commands for slots that need them (that change and are referenced later) + int tempcount = 0; + if (_code._constraint) return; + + const instr temp_copy = Machine::getOpcodeTable()[TEMP_COPY].impl[0]; + for (const context * c = _analysis.contexts, * const ce = c + _analysis.slotref; c != ce; ++c) + { + if (!c->flags.referenced || !c->flags.changed) continue; + + instr * const tip = code + c->codeRef + tempcount; + memmove(tip+1, tip, (code_end - tip) * sizeof(instr)); + *tip = temp_copy; + ++code_end; + ++tempcount; + } + + _code._instr_count = code_end - code; +} + + +inline +bool Machine::Code::decoder::validate_opcode(const opcode opc, const byte * const bc) +{ + if (opc >= MAX_OPCODE) + { + failure(invalid_opcode); + return false; + } + const opcode_t & op = Machine::getOpcodeTable()[opc]; + const size_t param_sz = op.param_sz == VARARGS ? bc[0] + 1 : op.param_sz; + if (bc + param_sz > _max.bytecode) + { + failure(arguments_exhausted); + return false; + } + return true; +} + + +bool Machine::Code::decoder::valid_upto(const uint16 limit, const uint16 x) const throw() +{ + const bool t = x < limit; + if (!t) failure(out_of_range_data); + return t; +} + + +inline +void Machine::Code::failure(const status_t s) throw() { + release_buffers(); + _status = s; +} + + +inline +void Machine::Code::decoder::analysis::set_ref(const int index) throw() { + contexts[index].flags.referenced = true; + if (index > max_ref) max_ref = index; +} + + +inline +void Machine::Code::decoder::analysis::set_changed(const int index) throw() { + contexts[index].flags.changed = true; + if (index > max_ref) max_ref = index; +} + + +void Machine::Code::release_buffers() throw() +{ + free(_code); + free(_data); + _code = 0; + _data = 0; + _own = false; +} + + +int32 Machine::Code::run(Machine & m, slotref * & map) const +{ + assert(_own); + assert(*this); // Check we are actually runnable + + if (m.slotMap().size() <= size_t(_max_ref + m.slotMap().context())) + { + m._status = Machine::slot_offset_out_bounds; +// return (m.slotMap().end() - map); + return 1; + } + + return m.run(_code, _data, map); +} + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/Face.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/Face.cpp new file mode 100644 index 00000000000..3428aeaccf4 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/Face.cpp @@ -0,0 +1,254 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include +#include "graphite2/Segment.h" +#include "inc/CmapCache.h" +#include "inc/debug.h" +#include "inc/Endian.h" +#include "inc/Face.h" +#include "inc/FileFace.h" +#include "inc/GlyphFace.h" +#include "inc/json.h" +#include "inc/SegCacheStore.h" +#include "inc/Segment.h" +#include "inc/NameTable.h" + + +using namespace graphite2; + +Face::Face(const void* appFaceHandle/*non-NULL*/, const gr_face_ops & ops) +: m_appFaceHandle(appFaceHandle), + m_pFileFace(NULL), + m_pGlyphFaceCache(NULL), + m_cmap(NULL), + m_pNames(NULL), + m_logger(NULL), + m_silfs(NULL), + m_numSilf(0), + m_ascent(0), + m_descent(0) +{ + memset(&m_ops, 0, sizeof m_ops); + memcpy(&m_ops, &ops, min(sizeof m_ops, ops.size)); +} + + +Face::~Face() +{ + setLogger(0); + delete m_pGlyphFaceCache; + delete m_cmap; + delete[] m_silfs; +#ifndef GRAPHITE2_NFILEFACE + delete m_pFileFace; +#endif + delete m_pNames; +} + +float Face::default_glyph_advance(const void* font_ptr, gr_uint16 glyphid) +{ + const Font & font = *reinterpret_cast(font_ptr); + + return font.face().glyphs().glyph(glyphid)->theAdvance().x * font.scale(); +} + +bool Face::readGlyphs(uint32 faceOptions) +{ + if (faceOptions & gr_face_cacheCmap) + m_cmap = new CachedCmap(*this); + else + m_cmap = new DirectCmap(*this); + + m_pGlyphFaceCache = new GlyphCache(*this, faceOptions); + if (!m_pGlyphFaceCache + || m_pGlyphFaceCache->numGlyphs() == 0 + || m_pGlyphFaceCache->unitsPerEm() == 0 + || !m_cmap || !*m_cmap) + return false; + + if (faceOptions & gr_face_preloadGlyphs) + nameTable(); // preload the name table along with the glyphs. + + return true; +} + +bool Face::readGraphite(const Table & silf) +{ + const byte * p = silf; + if (!p) return false; + + const uint32 version = be::read(p); + if (version < 0x00020000) return false; + if (version >= 0x00030000) + be::skip(p); // compilerVersion + m_numSilf = be::read(p); + be::skip(p); // reserved + + bool havePasses = false; + m_silfs = new Silf[m_numSilf]; + for (int i = 0; i < m_numSilf; i++) + { + const uint32 offset = be::read(p), + next = i == m_numSilf - 1 ? silf.size() : be::peek(p); + if (next > silf.size() || offset >= next) + return false; + + if (!m_silfs[i].readGraphite(silf + offset, next - offset, *this, version)) + return false; + + if (m_silfs[i].numPasses()) + havePasses = true; + } + + return havePasses; +} + +bool Face::readFeatures() +{ + return m_Sill.readFace(*this); +} + +bool Face::runGraphite(Segment *seg, const Silf *aSilf) const +{ +#if !defined GRAPHITE2_NTRACING + json * dbgout = logger(); + if (dbgout) + { + *dbgout << json::object + << "id" << objectid(seg) + << "passes" << json::array; + } +#endif + + bool res = aSilf->runGraphite(seg, 0, aSilf->justificationPass()); + res &= aSilf->runGraphite(seg, aSilf->positionPass(), aSilf->numPasses()); + +#if !defined GRAPHITE2_NTRACING + if (dbgout) +{ + *dbgout << json::item + << json::close // Close up the passes array + << "output" << json::array; + for(Slot * s = seg->first(); s; s = s->next()) + *dbgout << dslot(seg, s); + seg->finalise(0); // Call this here to fix up charinfo back indexes. + *dbgout << json::close + << "advance" << seg->advance() + << "chars" << json::array; + for(size_t i = 0, n = seg->charInfoCount(); i != n; ++i) + *dbgout << json::flat << *seg->charinfo(i); + *dbgout << json::close // Close up the chars array + << json::close; // Close up the segment object + } +#endif + + return res; +} + +void Face::setLogger(FILE * log_file GR_MAYBE_UNUSED) +{ +#if !defined GRAPHITE2_NTRACING + delete m_logger; + m_logger = log_file ? new json(log_file) : 0; +#endif +} + +const Silf *Face::chooseSilf(uint32 script) const +{ + if (m_numSilf == 0) + return NULL; + else if (m_numSilf == 1 || script == 0) + return m_silfs; + else // do more work here + return m_silfs; +} + +uint16 Face::findPseudo(uint32 uid) const +{ + return (m_numSilf) ? m_silfs[0].findPseudo(uid) : 0; +} + +uint16 Face::getGlyphMetric(uint16 gid, uint8 metric) const +{ + switch (metrics(metric)) + { + case kgmetAscent : return m_ascent; + case kgmetDescent : return m_descent; + default: return glyphs().glyph(gid)->getMetric(metric); + } +} + +void Face::takeFileFace(FileFace* pFileFace GR_MAYBE_UNUSED/*takes ownership*/) +{ +#ifndef GRAPHITE2_NFILEFACE + if (m_pFileFace==pFileFace) + return; + + delete m_pFileFace; + m_pFileFace = pFileFace; +#endif +} + +NameTable * Face::nameTable() const +{ + if (m_pNames) return m_pNames; + const Table name(*this, Tag::name); + if (name) + m_pNames = new NameTable(name, name.size()); + return m_pNames; +} + +uint16 Face::languageForLocale(const char * locale) const +{ + nameTable(); + if (m_pNames) + return m_pNames->getLanguageId(locale); + return 0; +} + +Face::Table::Table(const Face & face, const Tag n) throw() +: _f(&face) +{ + size_t sz = 0; + _p = reinterpret_cast((*_f->m_ops.get_table)(_f->m_appFaceHandle, n, &sz)); + _sz = uint32(sz); + if (!TtfUtil::CheckTable(n, _p, _sz)) + { + this->~Table(); // Make sure we release the table buffer even if the table filed it's checks + _p = 0; _sz = 0; + } +} + +Face::Table & Face::Table::operator = (const Table & rhs) throw() +{ + if (_p == rhs._p) return *this; + + this->~Table(); + new (this) Table(rhs); + return *this; +} + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/FeatureMap.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/FeatureMap.cpp new file mode 100644 index 00000000000..aa638d5cb4c --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/FeatureMap.cpp @@ -0,0 +1,279 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include + +#include "inc/Main.h" +#include "inc/bits.h" +#include "inc/Endian.h" +#include "inc/FeatureMap.h" +#include "inc/FeatureVal.h" +#include "graphite2/Font.h" +#include "inc/TtfUtil.h" +#include +#include "inc/Face.h" + + +using namespace graphite2; + +namespace +{ + static int cmpNameAndFeatures(const void *ap, const void *bp) + { + const NameAndFeatureRef & a = *static_cast(ap), + & b = *static_cast(bp); + return (a < b ? -1 : (b < a ? 1 : 0)); + } + + const size_t FEAT_HEADER = sizeof(uint32) + 2*sizeof(uint16) + sizeof(uint32), + FEATURE_SIZE = sizeof(uint32) + + 2*sizeof(uint16) + + sizeof(uint32) + + 2*sizeof(uint16), + FEATURE_SETTING_SIZE = sizeof(int16) + sizeof(uint16); + + uint16 readFeatureSettings(const byte * p, FeatureSetting * s, size_t num_settings) + { + uint16 max_val = 0; + for (FeatureSetting * const end = s + num_settings; s != end; ++s) + { + const int16 value = be::read(p); + ::new (s) FeatureSetting(value, be::read(p)); + if (uint16(value) > max_val) max_val = value; + } + + return max_val; + } +} + +FeatureRef::FeatureRef(const Face & face, + unsigned short & bits_offset, uint32 max_val, + uint32 name, uint16 uiName, uint16 flags, + FeatureSetting *settings, uint16 num_set) throw() +: m_pFace(&face), + m_nameValues(settings), + m_mask(mask_over_val(max_val)), + m_max(max_val), + m_id(name), + m_nameid(uiName), + m_flags(flags), + m_numSet(num_set) +{ + const uint8 need_bits = bit_set_count(m_mask); + m_index = (bits_offset + need_bits) / SIZEOF_CHUNK; + if (m_index > bits_offset / SIZEOF_CHUNK) + bits_offset = m_index*SIZEOF_CHUNK; + m_bits = bits_offset % SIZEOF_CHUNK; + bits_offset += need_bits; + m_mask <<= m_bits; +} + +FeatureRef::~FeatureRef() throw() +{ + free(m_nameValues); +} + +bool FeatureMap::readFeats(const Face & face) +{ + const Face::Table feat(face, TtfUtil::Tag::Feat); + const byte * p = feat; + if (!p) return true; + if (feat.size() < FEAT_HEADER) return false; + + const byte *const feat_start = p, + *const feat_end = p + feat.size(); + + const uint32 version = be::read(p); + m_numFeats = be::read(p); + be::skip(p); + be::skip(p); + + // Sanity checks + if (m_numFeats == 0) return true; + if (version < 0x00010000 || + p + m_numFeats*FEATURE_SIZE > feat_end) + { //defensive + m_numFeats = 0; + return false; + } + + m_feats = new FeatureRef [m_numFeats]; + uint16 * const defVals = gralloc(m_numFeats); + unsigned short bits = 0; //to cause overflow on first Feature + + for (int i = 0, ie = m_numFeats; i != ie; i++) + { + const uint32 label = version < 0x00020000 ? be::read(p) : be::read(p); + const uint16 num_settings = be::read(p); + if (version >= 0x00020000) + be::skip(p); + const byte * const feat_setts = feat_start + be::read(p); + const uint16 flags = be::read(p), + uiName = be::read(p); + + if (feat_setts + num_settings * FEATURE_SETTING_SIZE > feat_end) + { + free(defVals); + return false; + } + + FeatureSetting *uiSet; + uint32 maxVal; + if (num_settings != 0) + { + uiSet = gralloc(num_settings); + maxVal = readFeatureSettings(feat_setts, uiSet, num_settings); + defVals[i] = uiSet[0].value(); + } + else + { + uiSet = 0; + maxVal = 0xffffffff; + defVals[i] = 0; + } + + ::new (m_feats + i) FeatureRef (face, bits, maxVal, + label, uiName, flags, + uiSet, num_settings); + } + m_defaultFeatures = new Features(bits/(sizeof(uint32)*8) + 1, *this); + m_pNamedFeats = new NameAndFeatureRef[m_numFeats]; + for (int i = 0; i < m_numFeats; ++i) + { + m_feats[i].applyValToFeature(defVals[i], *m_defaultFeatures); + m_pNamedFeats[i] = m_feats+i; + } + + free(defVals); + + qsort(m_pNamedFeats, m_numFeats, sizeof(NameAndFeatureRef), &cmpNameAndFeatures); + + return true; +} + +bool SillMap::readFace(const Face & face) +{ + if (!m_FeatureMap.readFeats(face)) return false; + if (!readSill(face)) return false; + return true; +} + + +bool SillMap::readSill(const Face & face) +{ + const Face::Table sill(face, TtfUtil::Tag::Sill); + const byte *p = sill; + + if (!p) return true; + if (sill.size() < 12) return false; + if (be::read(p) != 0x00010000UL) return false; + m_numLanguages = be::read(p); + m_langFeats = new LangFeaturePair[m_numLanguages]; + if (!m_langFeats || !m_FeatureMap.m_numFeats) { m_numLanguages = 0; return true; } //defensive + + p += 6; // skip the fast search + if (sill.size() < m_numLanguages * 8U + 12) return false; + + for (int i = 0; i < m_numLanguages; i++) + { + uint32 langid = be::read(p); + uint16 numSettings = be::read(p); + uint16 offset = be::read(p); + if (offset + 8U * numSettings > sill.size() && numSettings > 0) return false; + Features* feats = new Features(*m_FeatureMap.m_defaultFeatures); + const byte *pLSet = sill + offset; + + // Apply langauge specific settings + for (int j = 0; j < numSettings; j++) + { + uint32 name = be::read(pLSet); + uint16 val = be::read(pLSet); + pLSet += 2; + const FeatureRef* pRef = m_FeatureMap.findFeatureRef(name); + if (pRef) pRef->applyValToFeature(val, *feats); + } + // Add the language id feature which is always feature id 1 + const FeatureRef* pRef = m_FeatureMap.findFeatureRef(1); + if (pRef) pRef->applyValToFeature(langid, *feats); + + m_langFeats[i].m_lang = langid; + m_langFeats[i].m_pFeatures = feats; + } + return true; +} + + +Features* SillMap::cloneFeatures(uint32 langname/*0 means default*/) const +{ + if (langname) + { + // the number of languages in a font is usually small e.g. 8 in Doulos + // so this loop is not very expensive + for (uint16 i = 0; i < m_numLanguages; i++) + { + if (m_langFeats[i].m_lang == langname) + return new Features(*m_langFeats[i].m_pFeatures); + } + } + return new Features (*m_FeatureMap.m_defaultFeatures); +} + + + +const FeatureRef *FeatureMap::findFeatureRef(uint32 name) const +{ + NameAndFeatureRef *it; + + for (it = m_pNamedFeats; it < m_pNamedFeats + m_numFeats; ++it) + if (it->m_name == name) + return it->m_pFRef; + return NULL; +} + +bool FeatureRef::applyValToFeature(uint32 val, Features & pDest) const +{ + if (val>maxVal() || !m_pFace) + return false; + if (pDest.m_pMap==NULL) + pDest.m_pMap = &m_pFace->theSill().theFeatureMap(); + else + if (pDest.m_pMap!=&m_pFace->theSill().theFeatureMap()) + return false; //incompatible + pDest.reserve(m_index); + pDest[m_index] &= ~m_mask; + pDest[m_index] |= (uint32(val) << m_bits); + return true; +} + +uint32 FeatureRef::getFeatureVal(const Features& feats) const +{ + if (m_index < feats.size() && &m_pFace->theSill().theFeatureMap()==feats.m_pMap) + return (feats[m_index] & m_mask) >> m_bits; + else + return 0; +} + + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/FileFace.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/FileFace.cpp new file mode 100644 index 00000000000..dc2f017ed00 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/FileFace.cpp @@ -0,0 +1,111 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include +#include "inc/FileFace.h" + + +#ifndef GRAPHITE2_NFILEFACE + +using namespace graphite2; + +FileFace::FileFace(const char *filename) +: _file(fopen(filename, "rb")), + _file_len(0), + _header_tbl(NULL), + _table_dir(NULL) +{ + if (!_file) return; + + if (fseek(_file, 0, SEEK_END)) return; + _file_len = ftell(_file); + if (fseek(_file, 0, SEEK_SET)) return; + + size_t tbl_offset, tbl_len; + + // Get the header. + if (!TtfUtil::GetHeaderInfo(tbl_offset, tbl_len)) return; + if (fseek(_file, tbl_offset, SEEK_SET)) return; + _header_tbl = (TtfUtil::Sfnt::OffsetSubTable*)gralloc(tbl_len); + if (_header_tbl) + { + if (fread(_header_tbl, 1, tbl_len, _file) != tbl_len) return; + if (!TtfUtil::CheckHeader(_header_tbl)) return; + } + + // Get the table directory + if (!TtfUtil::GetTableDirInfo(_header_tbl, tbl_offset, tbl_len)) return; + _table_dir = (TtfUtil::Sfnt::OffsetSubTable::Entry*)gralloc(tbl_len); + if (fseek(_file, tbl_offset, SEEK_SET)) return; + if (_table_dir) + if (fread(_table_dir, 1, tbl_len, _file) != tbl_len) return; +} + +FileFace::~FileFace() +{ + free(_table_dir); + free(_header_tbl); + if (_file) + fclose(_file); +} + + +const void *FileFace::get_table_fn(const void* appFaceHandle, unsigned int name, size_t *len) +{ + if (appFaceHandle == 0) return 0; + const FileFace & file_face = *static_cast(appFaceHandle); + + char *tbl; + size_t tbl_offset, tbl_len; + if (!TtfUtil::GetTableInfo(name, file_face._header_tbl, file_face._table_dir, tbl_offset, tbl_len)) + return 0; + + if (tbl_offset + tbl_len > file_face._file_len + || fseek(file_face._file, tbl_offset, SEEK_SET) != 0) + return 0; + + tbl = gralloc(tbl_len); + if (fread(tbl, 1, tbl_len, file_face._file) != tbl_len) + { + free(tbl); + return 0; + } + + if (len) *len = tbl_len; + return tbl; +} + +void FileFace::rel_table_fn(const void* appFaceHandle, const void *table_buffer) +{ + if (appFaceHandle == 0) return; + + free(const_cast(table_buffer)); +} + +const gr_face_ops FileFace::ops = { sizeof FileFace::ops, &FileFace::get_table_fn, &FileFace::rel_table_fn }; + + +#endif //!GRAPHITE2_NFILEFACE diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/Font.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/Font.cpp new file mode 100644 index 00000000000..8860d3b58be --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/Font.cpp @@ -0,0 +1,61 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include "inc/Face.h" +#include "inc/Font.h" +#include "inc/GlyphCache.h" + +using namespace graphite2; + +Font::Font(float ppm, const Face & f, const void * appFontHandle, const gr_font_ops * ops) +: m_appFontHandle(appFontHandle ? appFontHandle : this), + m_face(f), + m_scale(ppm / f.glyphs().unitsPerEm()), + m_hinted(appFontHandle && ops && (ops->glyph_advance_x || ops->glyph_advance_y)) +{ + memset(&m_ops, 0, sizeof m_ops); + if (m_hinted) + memcpy(&m_ops, ops, min(sizeof m_ops, ops->size)); + else + m_ops.glyph_advance_x = &Face::default_glyph_advance; + + size_t nGlyphs = f.glyphs().numGlyphs(); + m_advances = gralloc(nGlyphs); + if (m_advances) + { + for (float *advp = m_advances; nGlyphs; --nGlyphs, ++advp) + *advp = INVALID_ADVANCE; + } +} + + +/*virtual*/ Font::~Font() +{ + free(m_advances); +} + + + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/GlyphCache.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/GlyphCache.cpp new file mode 100644 index 00000000000..457397b7505 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/GlyphCache.cpp @@ -0,0 +1,337 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include "graphite2/Font.h" + +#include "inc/Main.h" +#include "inc/Face.h" //for the tags +#include "inc/GlyphCache.h" +#include "inc/GlyphFace.h" +#include "inc/Endian.h" + +using namespace graphite2; + +namespace +{ + class glat_iterator : public std::iterator > + { + public: + glat_iterator(const void * glat=0) : _p(reinterpret_cast(glat)), _n(0) {} + + glat_iterator & operator ++ () { ++_v.first; --_n; _p += sizeof(uint16); if (_n == -1) { _p -= 2; _v.first = *_p++; _n = *_p++; } return *this; } + glat_iterator operator ++ (int) { glat_iterator tmp(*this); operator++(); return tmp; } + + bool operator == (const glat_iterator & rhs) { return _p >= rhs._p || _p + _n*sizeof(uint16) > rhs._p; } + bool operator != (const glat_iterator & rhs) { return !operator==(rhs); } + + value_type operator * () const { + if (_n==0) { _v.first = *_p++; _n = *_p++; } + _v.second = be::peek(_p); + return _v; + } + const value_type * operator ->() const { operator * (); return &_v; } + + protected: + mutable const byte * _p; + mutable value_type _v; + mutable int _n; + }; + + class glat2_iterator : public glat_iterator + { + public: + glat2_iterator(const void * glat) : glat_iterator(glat) {} + + glat2_iterator & operator ++ () { ++_v.first; --_n; _p += sizeof(uint16); if (_n == -1) { _p -= sizeof(uint16)*2; _v.first = be::read(_p); _n = be::read(_p); } return *this; } + glat2_iterator operator ++ (int) { glat2_iterator tmp(*this); operator++(); return tmp; } + + value_type operator * () const { + if (_n==0) { _v.first = be::read(_p); _n = be::read(_p); } + _v.second = be::peek(_p); + return _v; + } + const value_type * operator ->() const { operator * (); return &_v; } + }; +} + + +class GlyphCache::Loader +{ +public: + Loader(const Face & face, const bool dumb_font); //return result indicates success. Do not use if failed. + + operator bool () const throw(); + unsigned short int units_per_em() const throw(); + unsigned short int num_glyphs() const throw(); + unsigned short int num_attrs() const throw(); + + const GlyphFace * read_glyph(unsigned short gid, GlyphFace &) const throw(); + + CLASS_NEW_DELETE; +private: + Face::Table _head, + _hhea, + _hmtx, + _glyf, + _loca, + m_pGlat, + m_pGloc; + + bool _long_fmt; + unsigned short _num_glyphs_graphics, //i.e. boundary box and advance + _num_glyphs_attributes, + _num_attrs; // number of glyph attributes per glyph +}; + + + +GlyphCache::GlyphCache(const Face & face, const uint32 face_options) +: _glyph_loader(new Loader(face, bool(face_options & gr_face_dumbRendering))), + _glyphs(_glyph_loader && *_glyph_loader ? grzeroalloc(_glyph_loader->num_glyphs()) : 0), + _num_glyphs(_glyphs ? _glyph_loader->num_glyphs() : 0), + _num_attrs(_glyphs ? _glyph_loader->num_attrs() : 0), + _upem(_glyphs ? _glyph_loader->units_per_em() : 0) +{ + if ((face_options & gr_face_preloadGlyphs) && _glyph_loader && _glyphs) + { + GlyphFace * const glyphs = new GlyphFace [_num_glyphs]; + if (!glyphs) + return; + + // The 0 glyph is definately required. + _glyphs[0] = _glyph_loader->read_glyph(0, glyphs[0]); + + // glyphs[0] has the same address as the glyphs array just allocated, + // thus assigning the &glyphs[0] to _glyphs[0] means _glyphs[0] points + // to the entire array. + const GlyphFace * loaded = _glyphs[0]; + for (uint16 gid = 1; loaded && gid != _num_glyphs; ++gid) + _glyphs[gid] = loaded = _glyph_loader->read_glyph(gid, glyphs[gid]); + + if (!loaded) + { + _glyphs[0] = 0; + delete [] glyphs; + } + delete _glyph_loader; + _glyph_loader = 0; + } + + if (_glyphs && glyph(0) == 0) + { + free(_glyphs); + _glyphs = 0; + _num_glyphs = _num_attrs = _upem = 0; + } +} + + +GlyphCache::~GlyphCache() +{ + if (_glyphs) + { + if (_glyph_loader) + { + const GlyphFace * * g = _glyphs; + for(unsigned short n = _num_glyphs; n; --n, ++g) + delete *g; + } + else + delete [] _glyphs[0]; + free(_glyphs); + } + delete _glyph_loader; +} + +const GlyphFace *GlyphCache::glyph(unsigned short glyphid) const //result may be changed by subsequent call with a different glyphid +{ + const GlyphFace * & p = _glyphs[glyphid]; + if (p == 0 && _glyph_loader) + { + GlyphFace * g = new GlyphFace(); + if (g) p = _glyph_loader->read_glyph(glyphid, *g); + if (!p) + { + delete g; + return *_glyphs; + } + } + return p; +} + + + +GlyphCache::Loader::Loader(const Face & face, const bool dumb_font) +: _head(face, Tag::head), + _hhea(face, Tag::hhea), + _hmtx(face, Tag::hmtx), + _glyf(face, Tag::glyf), + _loca(face, Tag::loca), + _long_fmt(false), + _num_glyphs_graphics(0), + _num_glyphs_attributes(0), + _num_attrs(0) +{ + if (!operator bool()) + return; + + const Face::Table maxp = Face::Table(face, Tag::maxp); + if (!maxp) { _head = Face::Table(); return; } + + _num_glyphs_graphics = TtfUtil::GlyphCount(maxp); + // This will fail if the number of glyphs is wildly out of range. + if (TtfUtil::LocaLookup(_num_glyphs_graphics-1, _loca, _loca.size(), _head) == size_t(-1)) + { + _head = Face::Table(); + return; + } + + if (!dumb_font) + { + if ((m_pGlat = Face::Table(face, Tag::Glat)) == NULL + || (m_pGloc = Face::Table(face, Tag::Gloc)) == NULL + || m_pGloc.size() < 6) + { + _head = Face::Table(); + return; + } + const byte * p = m_pGloc; + const int version = be::read(p); + const uint16 flags = be::read(p); + _num_attrs = be::read(p); + // We can accurately calculate the number of attributed glyphs by + // subtracting the length of the attribids array (numAttribs long if present) + // and dividing by either 2 or 4 depending on shor or lonf format + _long_fmt = flags & 1; + _num_glyphs_attributes = (m_pGloc.size() + - (p - m_pGloc) + - sizeof(uint16)*(flags & 0x2 ? _num_attrs : 0)) + / (_long_fmt ? sizeof(uint32) : sizeof(uint16)) - 1; + + if (version != 0x00010000 + || _num_attrs == 0 || _num_attrs > 0x3000 // is this hard limit appropriate? + || _num_glyphs_graphics > _num_glyphs_attributes) + { + _head = Face::Table(); + return; + } + } +} + +inline +GlyphCache::Loader::operator bool () const throw() +{ + return _head && _hhea && _hmtx && _glyf && _loca; +} + +inline +unsigned short int GlyphCache::Loader::units_per_em() const throw() +{ + return _head ? TtfUtil::DesignUnits(_head) : 0; +} + +inline +unsigned short int GlyphCache::Loader::num_glyphs() const throw() +{ + return max(_num_glyphs_graphics, _num_glyphs_attributes); +} + +inline +unsigned short int GlyphCache::Loader::num_attrs() const throw() +{ + return _num_attrs; +} + +const GlyphFace * GlyphCache::Loader::read_glyph(unsigned short glyphid, GlyphFace & glyph) const throw() +{ + Rect bbox; + Position advance; + + if (glyphid < _num_glyphs_graphics) + { + int nLsb, xMin, yMin, xMax, yMax; + unsigned int nAdvWid; + size_t locidx = TtfUtil::LocaLookup(glyphid, _loca, _loca.size(), _head); + void *pGlyph = TtfUtil::GlyfLookup(_glyf, locidx, _glyf.size()); + if (TtfUtil::HorMetrics(glyphid, _hmtx, _hmtx.size(), _hhea, nLsb, nAdvWid)) + advance = Position(static_cast(nAdvWid), 0); + + if (pGlyph && TtfUtil::GlyfBox(pGlyph, xMin, yMin, xMax, yMax)) + bbox = Rect(Position(static_cast(xMin), static_cast(yMin)), + Position(static_cast(xMax), static_cast(yMax))); + } + + if (glyphid < _num_glyphs_attributes) + { + const byte * gloc = m_pGloc; + size_t glocs = 0, gloce = 0; + + be::skip(gloc); + be::skip(gloc,2); + if (_long_fmt) + { + be::skip(gloc, glyphid); + glocs = be::read(gloc); + gloce = be::peek(gloc); + } + else + { + be::skip(gloc, glyphid); + glocs = be::read(gloc); + gloce = be::peek(gloc); + } + + if (glocs >= m_pGlat.size() || gloce > m_pGlat.size()) + return 0; + + const uint32 glat_version = be::peek(m_pGlat); + if (glat_version < 0x00020000) + { + if (gloce - glocs < 2*sizeof(byte)+sizeof(uint16) + || gloce - glocs > _num_attrs*(2*sizeof(byte)+sizeof(uint16))) + { + return 0; + } + + new (&glyph) GlyphFace(bbox, advance, glat_iterator(m_pGlat + glocs), glat_iterator(m_pGlat + gloce)); + } + else + { + if (gloce - glocs < 3*sizeof(uint16) + || gloce - glocs > _num_attrs*3*sizeof(uint16)) + { + return 0; + } + + new (&glyph) GlyphFace(bbox, advance, glat2_iterator(m_pGlat + glocs), glat2_iterator(m_pGlat + gloce)); + } + + if (glyph.attrs().capacity() > _num_attrs) + return 0; + } + + return &glyph; +} diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/GlyphFace.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/GlyphFace.cpp new file mode 100644 index 00000000000..9fc11b2157e --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/GlyphFace.cpp @@ -0,0 +1,48 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include "inc/GlyphFace.h" + + +using namespace graphite2; + +uint16 GlyphFace::getMetric(uint8 metric) const +{ + switch (metrics(metric)) + { + case kgmetLsb : return static_cast(m_bbox.bl.x); + case kgmetRsb : return static_cast(m_advance.x - m_bbox.tr.x); + case kgmetBbTop : return static_cast(m_bbox.tr.y); + case kgmetBbBottom : return static_cast(m_bbox.bl.y); + case kgmetBbLeft : return static_cast(m_bbox.bl.x); + case kgmetBbRight : return static_cast(m_bbox.tr.x); + case kgmetBbHeight : return static_cast(m_bbox.tr.y - m_bbox.bl.y); + case kgmetBbWidth : return static_cast(m_bbox.tr.x - m_bbox.bl.x); + case kgmetAdvWidth : return static_cast(m_advance.x); + case kgmetAdvHeight : return static_cast(m_advance.y); + default : return 0; + } +} diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/Justifier.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/Justifier.cpp new file mode 100644 index 00000000000..fc667dca1ab --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/Justifier.cpp @@ -0,0 +1,267 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ + +#include "inc/Segment.h" +#include "graphite2/Font.h" +#include "inc/debug.h" +#include "inc/CharInfo.h" +#include "inc/Slot.h" +#include "inc/Main.h" +#include + +using namespace graphite2; + +class JustifyTotal { +public: + JustifyTotal() : m_numGlyphs(0), m_tStretch(0), m_tShrink(0), m_tStep(0), m_tWeight(0) {} + void accumulate(Slot *s, Segment *seg, int level); + int weight() const { return m_tWeight; } + + CLASS_NEW_DELETE + +private: + int m_numGlyphs; + int m_tStretch; + int m_tShrink; + int m_tStep; + int m_tWeight; +}; + +void JustifyTotal::accumulate(Slot *s, Segment *seg, int level) +{ + ++m_numGlyphs; + m_tStretch += s->getJustify(seg, level, 0); + m_tShrink += s->getJustify(seg, level, 1); + m_tStep += s->getJustify(seg, level, 2); + m_tWeight += s->getJustify(seg, level, 3); +} + +float Segment::justify(Slot *pSlot, const Font *font, float width, GR_MAYBE_UNUSED justFlags flags, Slot *pFirst, Slot *pLast) +{ + Slot *s, *end; + float currWidth = 0.0; + const float scale = font ? font->scale() : 1.0f; + Position res; + + if (width < 0 && !(silf()->flags())) + return width; + + if (!pFirst) pFirst = pSlot; + while (!pFirst->isBase()) pFirst = pFirst->attachedTo(); + if (!pLast) pLast = last(); + while (!pLast->isBase()) pLast = pLast->attachedTo(); + const float base = pFirst->origin().x / scale; + width = width / scale; + if ((flags & gr_justEndInline) == 0) + { + do { + Rect bbox = theGlyphBBoxTemporary(pLast->glyph()); + if (bbox.bl.x != 0. || bbox.bl.y != 0. || bbox.tr.x != 0. || bbox.tr.y == 0.) + break; + pLast = pLast->prev(); + } while (pLast != pFirst); + } + + end = pLast->nextSibling(); + pFirst = pFirst->nextSibling(); + + int icount = 0; + int numLevels = silf()->numJustLevels(); + if (!numLevels) + { + for (s = pSlot; s != end; s = s->next()) + { + CharInfo *c = charinfo(s->before()); + if (isWhitespace(c->unicodeChar())) + { + s->setJustify(this, 0, 3, 1); + s->setJustify(this, 0, 2, 1); + s->setJustify(this, 0, 0, -1); + ++icount; + } + } + if (!icount) + { + for (s = pSlot; s != end; s = s->nextSibling()) + { + s->setJustify(this, 0, 3, 1); + s->setJustify(this, 0, 2, 1); + s->setJustify(this, 0, 0, -1); + } + } + ++numLevels; + } + + JustifyTotal *stats = new JustifyTotal[numLevels]; + for (s = pFirst; s != end; s = s->nextSibling()) + { + float w = s->origin().x / scale + s->advance() - base; + if (w > currWidth) currWidth = w; + for (int j = 0; j < numLevels; ++j) + stats[j].accumulate(s, this, j); + s->just(0); + } + + for (int i = (width < 0.0) ? -1 : numLevels - 1; i >= 0; --i) + { + float diff; + float error = 0.; + float diffpw; + int tWeight = stats[i].weight(); + + do { + error = 0.; + diff = width - currWidth; + diffpw = diff / tWeight; + tWeight = 0; + for (s = pFirst; s != end; s = s->nextSibling()) // don't include final glyph + { + int w = s->getJustify(this, i, 3); + float pref = diffpw * w + error; + int step = s->getJustify(this, i, 2); + if (!step) step = 1; // handle lazy font developers + if (pref > 0) + { + float max = uint16(s->getJustify(this, i, 0)); + if (i == 0) max -= s->just(); + if (pref > max) pref = max; + else tWeight += w; + } + else + { + float max = uint16(s->getJustify(this, i, 1)); + if (i == 0) max += s->just(); + if (-pref > max) pref = -max; + else tWeight += w; + } + int actual = step ? int(pref / step) * step : int(pref); + + if (actual) + { + error += diffpw * w - actual; + if (i == 0) + s->just(s->just() + actual); + else + s->setJustify(this, i, 4, actual); + } + } + currWidth += diff - error; + } while (i == 0 && int(abs(error)) > 0 && tWeight); + } + + Slot *oldFirst = m_first; + Slot *oldLast = m_last; + if (silf()->flags() & 1) + { + m_first = pSlot = addLineEnd(pSlot); + m_last = pLast = addLineEnd(end); + } + else + { + m_first = pSlot; + m_last = pLast; + } + + // run justification passes here +#if !defined GRAPHITE2_NTRACING + json * const dbgout = m_face->logger(); + if (dbgout) + *dbgout << json::object + << "justifies" << objectid(this) + << "passes" << json::array; +#endif + + if (m_silf->justificationPass() != m_silf->positionPass() && (width >= 0. || (silf()->flags() & 1))) + m_silf->runGraphite(this, m_silf->justificationPass(), m_silf->positionPass()); + +#if !defined GRAPHITE2_NTRACING + if (dbgout) + { + *dbgout << json::item << json::close; // Close up the passes array + positionSlots(NULL, pSlot, pLast); + Slot *lEnd = pLast->nextSibling(); + *dbgout << "output" << json::array; + for(Slot * t = pSlot; t != lEnd; t = t->next()) + *dbgout << dslot(this, t); + *dbgout << json::close << json::close; + } +#endif + + res = positionSlots(font, pSlot, pLast); + + if (silf()->flags() & 1) + { + delLineEnd(m_first); + delLineEnd(m_last); + } + m_first = oldFirst; + m_last = oldLast; + return res.x; +} + +Slot *Segment::addLineEnd(Slot *nSlot) +{ + Slot *eSlot = newSlot(); + const uint16 gid = silf()->endLineGlyphid(); + const GlyphFace * theGlyph = m_face->glyphs().glyphSafe(gid); + eSlot->setGlyph(this, gid, theGlyph); + if (nSlot) + { + eSlot->next(nSlot); + eSlot->prev(nSlot->prev()); + nSlot->prev(eSlot); + eSlot->before(nSlot->before()); + if (eSlot->prev()) + eSlot->after(eSlot->prev()->after()); + else + eSlot->after(nSlot->before()); + } + else + { + nSlot = m_last; + eSlot->prev(nSlot); + nSlot->next(eSlot); + eSlot->after(eSlot->prev()->after()); + eSlot->before(nSlot->after()); + } + return eSlot; +} + +void Segment::delLineEnd(Slot *s) +{ + Slot *nSlot = s->next(); + if (nSlot) + { + nSlot->prev(s->prev()); + if (s->prev()) + s->prev()->next(nSlot); + } + else + s->prev()->next(NULL); + freeSlot(s); +} + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/NameTable.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/NameTable.cpp new file mode 100644 index 00000000000..d29b92bc40e --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/NameTable.cpp @@ -0,0 +1,222 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include "inc/Main.h" +#include "inc/Endian.h" + +#include "inc/NameTable.h" +#include "inc/UtfCodec.h" + +using namespace graphite2; + +NameTable::NameTable(const void* data, size_t length, uint16 platformId, uint16 encodingID) + : m_platformId(0), m_encodingId(0), m_languageCount(0), + m_platformOffset(0), m_platformLastRecord(0), m_nameDataLength(0), + m_table(0), m_nameData(NULL) +{ + void *pdata = malloc(length); + if (!pdata) return; + memcpy(pdata, data, length); + m_table = reinterpret_cast(pdata); + + if ((length > sizeof(TtfUtil::Sfnt::FontNames)) && + (length > sizeof(TtfUtil::Sfnt::FontNames) + + sizeof(TtfUtil::Sfnt::NameRecord) * ( be::swap(m_table->count) - 1))) + { + uint16 offset = be::swap(m_table->string_offset); + m_nameData = reinterpret_cast(pdata) + offset; + setPlatformEncoding(platformId, encodingID); + m_nameDataLength = length - offset; + } + else + { + free(const_cast(m_table)); + m_table = NULL; + } +} + +uint16 NameTable::setPlatformEncoding(uint16 platformId, uint16 encodingID) +{ + if (!m_nameData) return 0; + uint16 i = 0; + uint16 count = be::swap(m_table->count); + for (; i < count; i++) + { + if (be::swap(m_table->name_record[i].platform_id) == platformId && + be::swap(m_table->name_record[i].platform_specific_id) == encodingID) + { + m_platformOffset = i; + break; + } + } + while ((++i < count) && + (be::swap(m_table->name_record[i].platform_id) == platformId) && + (be::swap(m_table->name_record[i].platform_specific_id) == encodingID)) + { + m_platformLastRecord = i; + } + m_encodingId = encodingID; + m_platformId = platformId; + return 0; +} + +void* NameTable::getName(uint16& languageId, uint16 nameId, gr_encform enc, uint32& length) +{ + uint16 anyLang = 0; + uint16 enUSLang = 0; + uint16 bestLang = 0; + if (!m_table) + { + languageId = 0; + length = 0; + return NULL; + } + for (uint16 i = m_platformOffset; i <= m_platformLastRecord; i++) + { + if (be::swap(m_table->name_record[i].name_id) == nameId) + { + uint16 langId = be::swap(m_table->name_record[i].language_id); + if (langId == languageId) + { + bestLang = i; + break; + } + // MS language tags have the language in the lower byte, region in the higher + else if ((langId & 0xFF) == (languageId & 0xFF)) + { + bestLang = i; + } + else if (langId == 0x409) + { + enUSLang = i; + } + else + { + anyLang = i; + } + } + } + if (!bestLang) + { + if (enUSLang) bestLang = enUSLang; + else + { + bestLang = anyLang; + if (!anyLang) + { + languageId = 0; + length = 0; + return NULL; + } + } + } + const TtfUtil::Sfnt::NameRecord & nameRecord = m_table->name_record[bestLang]; + languageId = be::swap(nameRecord.language_id); + uint16 utf16Length = be::swap(nameRecord.length); + uint16 offset = be::swap(nameRecord.offset); + if(offset + utf16Length > m_nameDataLength) + { + languageId = 0; + length = 0; + return NULL; + } + utf16Length >>= 1; // in utf16 units + utf16::codeunit_t * utf16Name = gralloc(utf16Length); + const uint8* pName = m_nameData + offset; + for (size_t i = 0; i < utf16Length; i++) + { + utf16Name[i] = be::read(pName); + } + switch (enc) + { + case gr_utf8: + { + utf8::codeunit_t* uniBuffer = gralloc(3 * utf16Length + 1); + utf8::iterator d = uniBuffer; + for (utf16::const_iterator s = utf16Name, e = utf16Name + utf16Length; s != e; ++s, ++d) + *d = *s; + length = d - uniBuffer; + uniBuffer[length] = 0; + return uniBuffer; + } + case gr_utf16: + length = utf16Length; + return utf16Name; + case gr_utf32: + { + utf32::codeunit_t * uniBuffer = gralloc(utf16Length + 1); + utf32::iterator d = uniBuffer; + for (utf16::const_iterator s = utf16Name, e = utf16Name + utf16Length; s != e; ++s, ++d) + *d = *s; + length = d - uniBuffer; + uniBuffer[length] = 0; + return uniBuffer; + } + } + length = 0; + return NULL; +} + +uint16 NameTable::getLanguageId(const char * bcp47Locale) +{ + size_t localeLength = strlen(bcp47Locale); + uint16 localeId = m_locale2Lang.getMsId(bcp47Locale); + if (m_table && (be::swap(m_table->format) == 1)) + { + const uint8 * pLangEntries = reinterpret_cast(m_table) + + sizeof(TtfUtil::Sfnt::FontNames) + + sizeof(TtfUtil::Sfnt::NameRecord) * ( be::swap(m_table->count) - 1); + uint16 numLangEntries = be::read(pLangEntries); + const TtfUtil::Sfnt::LangTagRecord * langTag = + reinterpret_cast(pLangEntries); + if (pLangEntries + numLangEntries * sizeof(TtfUtil::Sfnt::LangTagRecord) <= m_nameData) + { + for (uint16 i = 0; i < numLangEntries; i++) + { + uint16 offset = be::swap(langTag[i].offset); + uint16 length = be::swap(langTag[i].length); + if ((offset + length <= m_nameDataLength) && (length == 2 * localeLength)) + { + const uint8* pName = m_nameData + offset; + bool match = true; + for (size_t j = 0; j < localeLength; j++) + { + uint16 code = be::read(pName); + if ((code > 0x7F) || (code != bcp47Locale[j])) + { + match = false; + break; + } + } + if (match) + return 0x8000 + i; + } + } + } + } + return localeId; +} + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/Pass.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/Pass.cpp new file mode 100644 index 00000000000..a44648a85a6 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/Pass.cpp @@ -0,0 +1,589 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include "inc/Main.h" +#include "inc/debug.h" +#include "inc/Endian.h" +#include "inc/Pass.h" +#include +#include +#include +#include "inc/Segment.h" +#include "inc/Code.h" +#include "inc/Rule.h" + +using namespace graphite2; +using vm::Machine; +typedef Machine::Code Code; + + +Pass::Pass() +: m_silf(0), + m_cols(0), + m_rules(0), + m_ruleMap(0), + m_startStates(0), + m_sTable(0), + m_states(0), + m_flags(0), + m_iMaxLoop(0), + m_numGlyphs(0), + m_numRules(0), + m_sRows(0), + m_sTransition(0), + m_sSuccess(0), + m_sColumns(0), + m_minPreCtxt(0), + m_maxPreCtxt(0) +{ +} + +Pass::~Pass() +{ + free(m_cols); + free(m_startStates); + free(m_sTable); + free(m_states); + free(m_ruleMap); + + delete [] m_rules; +} + +bool Pass::readPass(const byte * const pass_start, size_t pass_length, size_t subtable_base, const Face & face) +{ + const byte * p = pass_start, + * const pass_end = p + pass_length; + size_t numRanges; + + if (pass_length < 40) return false; + // Read in basic values + m_flags = be::read(p); + m_iMaxLoop = be::read(p); + be::skip(p,2); // skip maxContext & maxBackup + m_numRules = be::read(p); + be::skip(p); // fsmOffset - not sure why we would want this + const byte * const pcCode = pass_start + be::read(p) - subtable_base, + * const rcCode = pass_start + be::read(p) - subtable_base, + * const aCode = pass_start + be::read(p) - subtable_base; + be::skip(p); + m_sRows = be::read(p); + m_sTransition = be::read(p); + m_sSuccess = be::read(p); + m_sColumns = be::read(p); + numRanges = be::read(p); + be::skip(p, 3); // skip searchRange, entrySelector & rangeShift. + assert(p - pass_start == 40); + // Perform some sanity checks. + if ( m_sTransition > m_sRows + || m_sSuccess > m_sRows + || m_sSuccess + m_sTransition < m_sRows + || numRanges == 0) + return false; + + if (p + numRanges * 6 - 4 > pass_end) return false; + m_numGlyphs = be::peek(p + numRanges * 6 - 4) + 1; + // Calculate the start of various arrays. + const byte * const ranges = p; + be::skip(p, numRanges*3); + const byte * const o_rule_map = p; + be::skip(p, m_sSuccess + 1); + + // More sanity checks + if (reinterpret_cast(o_rule_map + m_sSuccess*sizeof(uint16)) > pass_end + || p > pass_end) + return false; + const size_t numEntries = be::peek(o_rule_map + m_sSuccess*sizeof(uint16)); + const byte * const rule_map = p; + be::skip(p, numEntries); + + if (p + 2*sizeof(uint8) > pass_end) return false; + m_minPreCtxt = be::read(p); + m_maxPreCtxt = be::read(p); + if (m_minPreCtxt > m_maxPreCtxt) return false; + const byte * const start_states = p; + be::skip(p, m_maxPreCtxt - m_minPreCtxt + 1); + const uint16 * const sort_keys = reinterpret_cast(p); + be::skip(p, m_numRules); + const byte * const precontext = p; + be::skip(p, m_numRules); + be::skip(p); // skip reserved byte + + if (p + sizeof(uint16) > pass_end) return false; + const size_t pass_constraint_len = be::read(p); + const uint16 * const o_constraint = reinterpret_cast(p); + be::skip(p, m_numRules + 1); + const uint16 * const o_actions = reinterpret_cast(p); + be::skip(p, m_numRules + 1); + const byte * const states = p; + be::skip(p, m_sTransition*m_sColumns); + be::skip(p); // skip reserved byte + if (p != pcCode || p >= pass_end) return false; + be::skip(p, pass_constraint_len); + if (p != rcCode || p >= pass_end + || size_t(rcCode - pcCode) != pass_constraint_len) return false; + be::skip(p, be::peek(o_constraint + m_numRules)); + if (p != aCode || p >= pass_end) return false; + be::skip(p, be::peek(o_actions + m_numRules)); + + // We should be at the end or within the pass + if (p > pass_end) return false; + + // Load the pass constraint if there is one. + if (pass_constraint_len) + { + m_cPConstraint = vm::Machine::Code(true, pcCode, pcCode + pass_constraint_len, + precontext[0], be::peek(sort_keys), *m_silf, face); + if (!m_cPConstraint) return false; + } + if (!readRanges(ranges, numRanges)) return false; + if (!readRules(rule_map, numEntries, precontext, sort_keys, + o_constraint, rcCode, o_actions, aCode, face)) return false; + return readStates(start_states, states, o_rule_map); +} + + +bool Pass::readRules(const byte * rule_map, const size_t num_entries, + const byte *precontext, const uint16 * sort_key, + const uint16 * o_constraint, const byte *rc_data, + const uint16 * o_action, const byte * ac_data, + const Face & face) +{ + const byte * const ac_data_end = ac_data + be::peek(o_action + m_numRules); + const byte * const rc_data_end = rc_data + be::peek(o_constraint + m_numRules); + + if (!(m_rules = new Rule [m_numRules])) return false; + precontext += m_numRules; + sort_key += m_numRules; + o_constraint += m_numRules; + o_action += m_numRules; + + // Load rules. + const byte * ac_begin = 0, * rc_begin = 0, + * ac_end = ac_data + be::peek(o_action), + * rc_end = rc_data + be::peek(o_constraint); + Rule * r = m_rules + m_numRules - 1; + for (size_t n = m_numRules; n; --n, --r, ac_end = ac_begin, rc_end = rc_begin) + { + r->preContext = *--precontext; + r->sort = be::peek(--sort_key); +#ifndef NDEBUG + r->rule_idx = n - 1; +#endif + if (r->sort > 63 || r->preContext >= r->sort || r->preContext > m_maxPreCtxt || r->preContext < m_minPreCtxt) + return false; + ac_begin = ac_data + be::peek(--o_action); + rc_begin = *--o_constraint ? rc_data + be::peek(o_constraint) : rc_end; + + if (ac_begin > ac_end || ac_begin > ac_data_end || ac_end > ac_data_end + || rc_begin > rc_end || rc_begin > rc_data_end || rc_end > rc_data_end) + return false; + r->action = new vm::Machine::Code(false, ac_begin, ac_end, r->preContext, r->sort, *m_silf, face); + r->constraint = new vm::Machine::Code(true, rc_begin, rc_end, r->preContext, r->sort, *m_silf, face); + + if (!r->action || !r->constraint + || r->action->status() != Code::loaded + || r->constraint->status() != Code::loaded + || !r->constraint->immutable()) + return false; + } + + // Load the rule entries map + RuleEntry * re = m_ruleMap = gralloc(num_entries); + for (size_t n = num_entries; n; --n, ++re) + { + const ptrdiff_t rn = be::read(rule_map); + if (rn >= m_numRules) return false; + re->rule = m_rules + rn; + } + + return true; +} + +static int cmpRuleEntry(const void *a, const void *b) { return (*(RuleEntry *)a < *(RuleEntry *)b ? -1 : + (*(RuleEntry *)b < *(RuleEntry *)a ? 1 : 0)); } + +bool Pass::readStates(const byte * starts, const byte *states, const byte * o_rule_map) +{ + m_startStates = gralloc(m_maxPreCtxt - m_minPreCtxt + 1); + m_states = gralloc(m_sRows); + m_sTable = gralloc(m_sTransition * m_sColumns); + + if (!m_startStates || !m_states || !m_sTable) return false; + // load start states + for (State * * s = m_startStates, + * * const s_end = s + m_maxPreCtxt - m_minPreCtxt + 1; s != s_end; ++s) + { + *s = m_states + be::read(starts); + if (*s < m_states || *s >= m_states + m_sRows) return false; // true; + } + + // load state transition table. + for (State * * t = m_sTable, + * * const t_end = t + m_sTransition*m_sColumns; t != t_end; ++t) + { + *t = m_states + be::read(states); + if (*t < m_states || *t >= m_states + m_sRows) return false; + } + + State * s = m_states, + * const transitions_end = m_states + m_sTransition, + * const success_begin = m_states + m_sRows - m_sSuccess; + const RuleEntry * rule_map_end = m_ruleMap + be::peek(o_rule_map + m_sSuccess*sizeof(uint16)); + for (size_t n = m_sRows; n; --n, ++s) + { + s->transitions = s < transitions_end ? m_sTable + (s-m_states)*m_sColumns : 0; + RuleEntry * const begin = s < success_begin ? 0 : m_ruleMap + be::read(o_rule_map), + * const end = s < success_begin ? 0 : m_ruleMap + be::peek(o_rule_map); + + if (begin >= rule_map_end || end > rule_map_end || begin > end) + return false; + s->rules = begin; + s->rules_end = (end - begin <= FiniteStateMachine::MAX_RULES)? end : + begin + FiniteStateMachine::MAX_RULES; + qsort(begin, end - begin, sizeof(RuleEntry), &cmpRuleEntry); + } + + return true; +} + +bool Pass::readRanges(const byte * ranges, size_t num_ranges) +{ + m_cols = gralloc(m_numGlyphs); + memset(m_cols, 0xFF, m_numGlyphs * sizeof(uint16)); + for (size_t n = num_ranges; n; --n) + { + uint16 * ci = m_cols + be::read(ranges), + * ci_end = m_cols + be::read(ranges) + 1, + col = be::read(ranges); + + if (ci >= ci_end || ci_end > m_cols+m_numGlyphs || col >= m_sColumns) + return false; + + // A glyph must only belong to one column at a time + while (ci != ci_end && *ci == 0xffff) + *ci++ = col; + + if (ci != ci_end) + return false; + } + return true; +} + + +void Pass::runGraphite(Machine & m, FiniteStateMachine & fsm) const +{ + Slot *s = m.slotMap().segment.first(); + if (!s || !testPassConstraint(m)) return; + Slot *currHigh = s->next(); + +#if !defined GRAPHITE2_NTRACING + if (fsm.dbgout) *fsm.dbgout << "rules" << json::array; + json::closer rules_array_closer(fsm.dbgout); +#endif + + m.slotMap().highwater(currHigh); + int lc = m_iMaxLoop; + do + { + findNDoRule(s, m, fsm); + if (s && (m.slotMap().highpassed() || s == m.slotMap().highwater() || --lc == 0)) { + if (!lc) + { +// if (dbgout) *dbgout << json::item << json::flat << rule_event(-1, s, 1); + s = m.slotMap().highwater(); + } + lc = m_iMaxLoop; + if (s) + m.slotMap().highwater(s->next()); + } + } while (s); +} + +inline uint16 Pass::glyphToCol(const uint16 gid) const +{ + return gid < m_numGlyphs ? m_cols[gid] : 0xffffU; +} + +bool Pass::runFSM(FiniteStateMachine& fsm, Slot * slot) const +{ + fsm.reset(slot, m_maxPreCtxt); + if (fsm.slots.context() < m_minPreCtxt) + return false; + + const State * state = m_startStates[m_maxPreCtxt - fsm.slots.context()]; + do + { + fsm.slots.pushSlot(slot); + if (fsm.slots.size() >= SlotMap::MAX_SLOTS) return false; + const uint16 col = glyphToCol(slot->gid()); + if (col == 0xffffU || !state->is_transition()) return true; + + state = state->transitions[col]; + if (state->is_success()) + fsm.rules.accumulate_rules(*state); + + slot = slot->next(); + } while (state != m_states && slot); + + fsm.slots.pushSlot(slot); + return true; +} + +#if !defined GRAPHITE2_NTRACING + +inline +Slot * input_slot(const SlotMap & slots, const int n) +{ + Slot * s = slots[slots.context() + n]; + if (!s->isCopied()) return s; + + return s->prev() ? s->prev()->next() : (s->next() ? s->next()->prev() : slots.segment.last()); +} + +inline +Slot * output_slot(const SlotMap & slots, const int n) +{ + Slot * s = slots[slots.context() + n - 1]; + return s ? s->next() : slots.segment.first(); +} + +#endif //!defined GRAPHITE2_NTRACING + +void Pass::findNDoRule(Slot * & slot, Machine &m, FiniteStateMachine & fsm) const +{ + assert(slot); + + if (runFSM(fsm, slot)) + { + // Search for the first rule which passes the constraint + const RuleEntry * r = fsm.rules.begin(), + * const re = fsm.rules.end(); + while (r != re && !testConstraint(*r->rule, m)) ++r; + +#if !defined GRAPHITE2_NTRACING + if (fsm.dbgout) + { + if (fsm.rules.size() != 0) + { + *fsm.dbgout << json::item << json::object; + dumpRuleEventConsidered(fsm, *r); + if (r != re) + { + const int adv = doAction(r->rule->action, slot, m); + dumpRuleEventOutput(fsm, *r->rule, slot); + if (r->rule->action->deletes()) fsm.slots.collectGarbage(); + adjustSlot(adv, slot, fsm.slots); + *fsm.dbgout << "cursor" << objectid(dslot(&fsm.slots.segment, slot)) + << json::close; // Close RuelEvent object + + return; + } + else + { + *fsm.dbgout << json::close // close "considered" array + << "output" << json::null + << "cursor" << objectid(dslot(&fsm.slots.segment, slot->next())) + << json::close; + } + } + } + else +#endif + { + if (r != re) + { + const int adv = doAction(r->rule->action, slot, m); + if (r->rule->action->deletes()) fsm.slots.collectGarbage(); + adjustSlot(adv, slot, fsm.slots); + return; + } + } + } + + slot = slot->next(); +} + +#if !defined GRAPHITE2_NTRACING + +void Pass::dumpRuleEventConsidered(const FiniteStateMachine & fsm, const RuleEntry & re) const +{ + *fsm.dbgout << "considered" << json::array; + for (const RuleEntry *r = fsm.rules.begin(); r != &re; ++r) + { + if (r->rule->preContext > fsm.slots.context()) continue; + *fsm.dbgout << json::flat << json::object + << "id" << r->rule - m_rules + << "failed" << true + << "input" << json::flat << json::object + << "start" << objectid(dslot(&fsm.slots.segment, input_slot(fsm.slots, -r->rule->preContext))) + << "length" << r->rule->sort + << json::close // close "input" + << json::close; // close Rule object + } +} + + +void Pass::dumpRuleEventOutput(const FiniteStateMachine & fsm, const Rule & r, Slot * const last_slot) const +{ + *fsm.dbgout << json::item << json::flat << json::object + << "id" << &r - m_rules + << "failed" << false + << "input" << json::flat << json::object + << "start" << objectid(dslot(&fsm.slots.segment, input_slot(fsm.slots, 0))) + << "length" << r.sort - r.preContext + << json::close // close "input" + << json::close // close Rule object + << json::close // close considered array + << "output" << json::object + << "range" << json::flat << json::object + << "start" << objectid(dslot(&fsm.slots.segment, input_slot(fsm.slots, 0))) + << "end" << objectid(dslot(&fsm.slots.segment, last_slot)) + << json::close // close "input" + << "slots" << json::array; + const Position rsb_prepos = last_slot ? last_slot->origin() : fsm.slots.segment.advance(); + fsm.slots.segment.positionSlots(0); + + for(Slot * slot = output_slot(fsm.slots, 0); slot != last_slot; slot = slot->next()) + *fsm.dbgout << dslot(&fsm.slots.segment, slot); + *fsm.dbgout << json::close // close "slots" + << "postshift" << (last_slot ? last_slot->origin() : fsm.slots.segment.advance()) - rsb_prepos + << json::close; // close "output" object + +} + +#endif + + +inline +bool Pass::testPassConstraint(Machine & m) const +{ + if (!m_cPConstraint) return true; + + assert(m_cPConstraint.constraint()); + + m.slotMap().reset(*m.slotMap().segment.first(), 0); + m.slotMap().pushSlot(m.slotMap().segment.first()); + vm::slotref * map = m.slotMap().begin(); + const uint32 ret = m_cPConstraint.run(m, map); + +#if !defined GRAPHITE2_NTRACING + json * const dbgout = m.slotMap().segment.getFace()->logger(); + if (dbgout) + *dbgout << "constraint" << (ret && m.status() == Machine::finished); +#endif + + return ret && m.status() == Machine::finished; +} + + +bool Pass::testConstraint(const Rule & r, Machine & m) const +{ + const uint16 curr_context = m.slotMap().context(); + if (unsigned(r.sort - r.preContext) > m.slotMap().size() - curr_context + || curr_context - r.preContext < 0) return false; + if (!*r.constraint) return true; + assert(r.constraint->constraint()); + + vm::slotref * map = m.slotMap().begin() + curr_context - r.preContext; + for (int n = r.sort; n && map; --n, ++map) + { + if (!*map) continue; + const int32 ret = r.constraint->run(m, map); + if (!ret || m.status() != Machine::finished) + return false; + } + + return true; +} + + +void SlotMap::collectGarbage() +{ + for(Slot **s = begin(), *const *const se = end() - 1; s != se; ++s) { + Slot *& slot = *s; + if(slot->isDeleted() || slot->isCopied()) + segment.freeSlot(slot); + } +} + + + +int Pass::doAction(const Code *codeptr, Slot * & slot_out, vm::Machine & m) const +{ + assert(codeptr); + if (!*codeptr) return 0; + SlotMap & smap = m.slotMap(); + vm::slotref * map = &smap[smap.context()]; + smap.highpassed(false); + + int32 ret = codeptr->run(m, map); + + if (m.status() != Machine::finished) + { + slot_out = NULL; + smap.highwater(0); + return 0; + } + + slot_out = *map; + return ret; +} + + +void Pass::adjustSlot(int delta, Slot * & slot_out, SlotMap & smap) const +{ + if (delta < 0) + { + if (!slot_out) + { + slot_out = smap.segment.last(); + ++delta; + if (smap.highpassed() && !smap.highwater()) + smap.highpassed(false); + } + while (++delta <= 0 && slot_out) + { + if (smap.highpassed() && smap.highwater() == slot_out) + smap.highpassed(false); + slot_out = slot_out->prev(); + } + } + else if (delta > 0) + { + if (!slot_out) + { + slot_out = smap.segment.first(); + --delta; + } + while (--delta >= 0 && slot_out) + { + slot_out = slot_out->next(); + if (slot_out == smap.highwater() && slot_out) + smap.highpassed(true); + } + } +} + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/Rule.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/Rule.cpp new file mode 100644 index 00000000000..afdab495f53 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/Rule.cpp @@ -0,0 +1,31 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ + +#include "inc/Rule.h" +#include "inc/Segment.h" + +using namespace graphite2; diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/SegCache.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/SegCache.cpp new file mode 100644 index 00000000000..446dfbec43f --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/SegCache.cpp @@ -0,0 +1,224 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ + +#include "inc/Main.h" +#include "inc/TtfTypes.h" +#include "inc/TtfUtil.h" +#include "inc/SegCache.h" +#include "inc/SegCacheEntry.h" +#include "inc/SegCacheStore.h" +#include "inc/CmapCache.h" + + +using namespace graphite2; + +#ifndef GRAPHITE2_NSEGCACHE + +SegCache::SegCache(const SegCacheStore * store, const Features & feats) +: m_prefixLength(ePrefixLength), + m_maxCachedSegLength(eMaxSpliceSize), + m_segmentCount(0), + m_features(feats), + m_totalAccessCount(0l), m_totalMisses(0l), + m_purgeFactor(1.0f / (ePurgeFactor * store->maxSegmentCount())) +{ + m_prefixes.raw = grzeroalloc(store->maxCmapGid() + 2); + m_prefixes.range[SEG_CACHE_MIN_INDEX] = SEG_CACHE_UNSET_INDEX; + m_prefixes.range[SEG_CACHE_MAX_INDEX] = SEG_CACHE_UNSET_INDEX; +} + +void SegCache::freeLevel(SegCacheStore * store, SegCachePrefixArray prefixes, size_t level) +{ + for (size_t i = 0; i < store->maxCmapGid(); i++) + { + if (prefixes.array[i].raw) + { + if (level + 1 < ePrefixLength) + freeLevel(store, prefixes.array[i], level + 1); + else + { + SegCachePrefixEntry * prefixEntry = prefixes.prefixEntries[i]; + delete prefixEntry; + } + } + } + free(prefixes.raw); +} + +void SegCache::clear(SegCacheStore * store) +{ + freeLevel(store, m_prefixes, 0); + m_prefixes.raw = NULL; +} + +SegCache::~SegCache() +{ + assert(m_prefixes.raw == NULL); +} + +SegCacheEntry* SegCache::cache(SegCacheStore * store, const uint16* cmapGlyphs, size_t length, Segment * seg, size_t charOffset) +{ + uint16 pos = 0; + if (!length) return NULL; + assert(length < m_maxCachedSegLength); + SegCachePrefixArray pArray = m_prefixes; + while (pos + 1 < m_prefixLength) + { + uint16 gid = (pos < length)? cmapGlyphs[pos] : 0; + if (!pArray.array[gid].raw) + { + pArray.array[gid].raw = grzeroalloc(store->maxCmapGid() + 2); + if (!pArray.array[gid].raw) + return NULL; // malloc failed + if (pArray.range[SEG_CACHE_MIN_INDEX] == SEG_CACHE_UNSET_INDEX) + { + pArray.range[SEG_CACHE_MIN_INDEX] = gid; + pArray.range[SEG_CACHE_MAX_INDEX] = gid; + } + else + { + if (gid < pArray.range[SEG_CACHE_MIN_INDEX]) + pArray.range[SEG_CACHE_MIN_INDEX] = gid; + else if (gid > pArray.range[SEG_CACHE_MAX_INDEX]) + pArray.range[SEG_CACHE_MAX_INDEX] = gid; + } + } + pArray = pArray.array[gid]; + ++pos; + } + uint16 gid = (pos < length)? cmapGlyphs[pos] : 0; + SegCachePrefixEntry * prefixEntry = pArray.prefixEntries[gid]; + if (!prefixEntry) + { + prefixEntry = new SegCachePrefixEntry(); + pArray.prefixEntries[gid] = prefixEntry; + if (pArray.range[SEG_CACHE_MIN_INDEX] == SEG_CACHE_UNSET_INDEX) + { + pArray.range[SEG_CACHE_MIN_INDEX] = gid; + pArray.range[SEG_CACHE_MAX_INDEX] = gid; + } + else + { + if (gid < pArray.range[SEG_CACHE_MIN_INDEX]) + pArray.range[SEG_CACHE_MIN_INDEX] = gid; + else if (gid > pArray.range[SEG_CACHE_MAX_INDEX]) + pArray.range[SEG_CACHE_MAX_INDEX] = gid; + } + } + if (!prefixEntry) return NULL; + // if the cache is full run a purge - this is slow, since it walks the tree + if (m_segmentCount + 1 > store->maxSegmentCount()) + { + purge(store); + assert(m_segmentCount < store->maxSegmentCount()); + } + SegCacheEntry * pEntry = prefixEntry->cache(cmapGlyphs, length, seg, charOffset, m_totalAccessCount); + if (pEntry) ++m_segmentCount; + return pEntry; +} + +void SegCache::purge(SegCacheStore * store) +{ + unsigned long long minAccessCount = static_cast(m_totalAccessCount * m_purgeFactor + 1); + if (minAccessCount < 2) minAccessCount = 2; + unsigned long long oldAccessTime = m_totalAccessCount - store->maxSegmentCount() / eAgeFactor; + purgeLevel(store, m_prefixes, 0, minAccessCount, oldAccessTime); +} + +void SegCache::purgeLevel(SegCacheStore * store, SegCachePrefixArray prefixes, size_t level, + unsigned long long minAccessCount, unsigned long long oldAccessTime) +{ + if (prefixes.range[SEG_CACHE_MIN_INDEX] == SEG_CACHE_UNSET_INDEX) return; + size_t maxGlyphCached = prefixes.range[SEG_CACHE_MAX_INDEX]; + for (size_t i = prefixes.range[SEG_CACHE_MIN_INDEX]; i <= maxGlyphCached; i++) + { + if (prefixes.array[i].raw) + { + if (level + 1 < ePrefixLength) + purgeLevel(store, prefixes.array[i], level + 1, minAccessCount, oldAccessTime); + else + { + SegCachePrefixEntry * prefixEntry = prefixes.prefixEntries[i]; + m_segmentCount -= prefixEntry->purge(minAccessCount, + oldAccessTime, m_totalAccessCount); + } + } + } +} + +uint32 SegCachePrefixEntry::purge(unsigned long long minAccessCount, + unsigned long long oldAccessTime, + unsigned long long currentTime) +{ + // ignore the purge request if another has been done recently + //if (m_lastPurge > oldAccessTime) + // return 0; + + uint32 totalPurged = 0; + // real length is length + 1 in this loop + for (uint16 length = 0; length < eMaxSpliceSize; length++) + { + if (m_entryCounts[length] == 0) + continue; + uint16 purgeCount = 0; + uint16 newIndex = 0; + for (uint16 j = 0; j < m_entryCounts[length]; j++) + { + SegCacheEntry & tempEntry = m_entries[length][j]; + // purge entries with a low access count which haven't been + // accessed recently + if (tempEntry.accessCount() <= minAccessCount && + tempEntry.lastAccess() <= oldAccessTime) + { + tempEntry.clear(); + ++purgeCount; + } + else + { + memcpy(m_entries[length] + newIndex++, m_entries[length] + j, sizeof(SegCacheEntry)); + } + } + if (purgeCount == m_entryCounts[length]) + { + assert(newIndex == 0); + m_entryCounts[length] = 0; + m_entryBSIndex[length] = 0; + free(m_entries[length]); + m_entries[length] = NULL; + } + else if (purgeCount > 0) + { + assert(m_entryCounts[length] == newIndex + purgeCount); + m_entryCounts[length] = newIndex; + } + totalPurged += purgeCount; + } + m_lastPurge = currentTime; + return totalPurged; +} + +#endif diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/SegCacheEntry.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/SegCacheEntry.cpp new file mode 100644 index 00000000000..5e87646185a --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/SegCacheEntry.cpp @@ -0,0 +1,106 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ + +#ifndef GRAPHITE2_NSEGCACHE + +#include "inc/Main.h" +#include "inc/Slot.h" +#include "inc/Segment.h" +#include "inc/SegCache.h" +#include "inc/SegCacheEntry.h" + + +using namespace graphite2; + +SegCacheEntry::SegCacheEntry(const uint16* cmapGlyphs, size_t length, Segment * seg, size_t charOffset, long long cacheTime) + : m_glyphLength(0), m_unicode(gralloc(length)), m_glyph(NULL), + m_attr(NULL), m_justs(NULL), + m_accessCount(0), m_lastAccess(cacheTime) +{ + for (uint16 i = 0; i < length; i++) + { + m_unicode[i] = cmapGlyphs[i]; + } + const size_t glyphCount = seg->slotCount(), + sizeof_sjust = SlotJustify::size_of(seg->silf()->numJustLevels()); + size_t num_justs = 0, + justs_pos = 0; + if (seg->hasJustification()) + { + for (const Slot * s = seg->first(); s; s = s->next()) + { + if (s->m_justs == 0) continue; + ++num_justs; + } + m_justs = gralloc(sizeof_sjust * num_justs); + } + const Slot * slot = seg->first(); + m_glyph = new Slot[glyphCount]; + m_attr = gralloc(glyphCount * seg->numAttrs()); + m_glyphLength = glyphCount; + Slot * slotCopy = m_glyph; + m_glyph->prev(NULL); + + uint16 pos = 0; + while (slot) + { + slotCopy->userAttrs(m_attr + pos * seg->numAttrs()); + slotCopy->m_justs = m_justs ? reinterpret_cast(m_justs + justs_pos++ * sizeof_sjust) : 0; + slotCopy->set(*slot, -static_cast(charOffset), seg->numAttrs(), seg->silf()->numJustLevels()); + slotCopy->index(pos); + if (slot->firstChild()) + slotCopy->m_child = m_glyph + slot->firstChild()->index(); + if (slot->attachedTo()) + slotCopy->attachTo(m_glyph + slot->attachedTo()->index()); + if (slot->nextSibling()) + slotCopy->m_sibling = m_glyph + slot->nextSibling()->index(); + slot = slot->next(); + ++slotCopy; + ++pos; + if (slot) + { + slotCopy->prev(slotCopy-1); + (slotCopy-1)->next(slotCopy); + } + } +} + + +void SegCacheEntry::clear() +{ + free(m_unicode); + free(m_attr); + free(m_justs); + delete [] m_glyph; + m_unicode = NULL; + m_glyph = NULL; + m_glyphLength = 0; + m_attr = NULL; +} + +#endif + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/SegCacheStore.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/SegCacheStore.cpp new file mode 100644 index 00000000000..236fb707ffa --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/SegCacheStore.cpp @@ -0,0 +1,47 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ + +#ifndef GRAPHITE2_NSEGCACHE + +#include "inc/SegCacheStore.h" +#include "inc/Face.h" + + +using namespace graphite2; + +SegCacheStore::SegCacheStore(const Face & face, unsigned int numSilf, size_t maxSegments) +: m_caches(new SilfSegCache[numSilf]), + m_numSilf(numSilf), + m_maxSegments(maxSegments), + m_maxCmapGid(face.glyphs().numGlyphs()), + m_spaceGid(face.cmap()[0x20]), + m_zwspGid(face.cmap()[0x200B]) +{ +} + +#endif + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/Segment.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/Segment.cpp new file mode 100644 index 00000000000..6893c31c9b1 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/Segment.cpp @@ -0,0 +1,453 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include "inc/UtfCodec.h" +#include +#include + +#include "inc/bits.h" +#include "inc/Segment.h" +#include "graphite2/Font.h" +#include "inc/CharInfo.h" +#include "inc/debug.h" +#include "inc/Slot.h" +#include "inc/Main.h" +#include "inc/CmapCache.h" +#include "graphite2/Segment.h" + + +using namespace graphite2; + +Segment::Segment(unsigned int numchars, const Face* face, uint32 script, int textDir) +: m_freeSlots(NULL), + m_freeJustifies(NULL), + m_charinfo(new CharInfo[numchars]), + m_face(face), + m_silf(face->chooseSilf(script)), + m_first(NULL), + m_last(NULL), + m_bufSize(numchars + 10), + m_numGlyphs(numchars), + m_numCharinfo(numchars), + m_defaultOriginal(0), + m_dir(textDir) +{ + freeSlot(newSlot()); + m_bufSize = log_binary(numchars)+1; +} + +Segment::~Segment() +{ + for (SlotRope::iterator i = m_slots.begin(); i != m_slots.end(); ++i) + free(*i); + for (AttributeRope::iterator j = m_userAttrs.begin(); j != m_userAttrs.end(); ++j) + free(*j); + delete[] m_charinfo; +} + +#ifndef GRAPHITE2_NSEGCACHE +SegmentScopeState Segment::setScope(Slot * firstSlot, Slot * lastSlot, size_t subLength) +{ + SegmentScopeState state; + state.numGlyphsOutsideScope = m_numGlyphs - subLength; + state.realFirstSlot = m_first; + state.slotBeforeScope = firstSlot->prev(); + state.slotAfterScope = lastSlot->next(); + state.realLastSlot = m_last; + firstSlot->prev(NULL); + lastSlot->next(NULL); + assert(m_defaultOriginal == 0); + m_defaultOriginal = firstSlot->original(); + m_numGlyphs = subLength; + m_first = firstSlot; + m_last = lastSlot; + return state; +} + +void Segment::removeScope(SegmentScopeState & state) +{ + m_numGlyphs = state.numGlyphsOutsideScope + m_numGlyphs; + if (state.slotBeforeScope) + { + state.slotBeforeScope->next(m_first); + m_first->prev(state.slotBeforeScope); + m_first = state.realFirstSlot; + } + if (state.slotAfterScope) + { + state.slotAfterScope->prev(m_last); + m_last->next(state.slotAfterScope); + m_last = state.realLastSlot; + } + m_defaultOriginal = 0; +} + + +void Segment::append(const Segment &other) +{ + Rect bbox = other.m_bbox + m_advance; + + m_slots.insert(m_slots.end(), other.m_slots.begin(), other.m_slots.end()); + CharInfo* pNewCharInfo = new CharInfo[m_numCharinfo+other.m_numCharinfo]; //since CharInfo has no constructor, this doesn't do much + for (unsigned int i=0 ; inext(other.m_first); + other.m_last->prev(m_last); + m_userAttrs.insert(m_userAttrs.end(), other.m_userAttrs.begin(), other.m_userAttrs.end()); + + delete[] m_charinfo; + m_charinfo = pNewCharInfo; + pNewCharInfo += m_numCharinfo ; + for (unsigned int i=0 ; iglyphs().glyphSafe(gid); + m_charinfo[id].breakWeight(theGlyph ? theGlyph->attrs()[m_silf->aBreak()] : 0); + + aSlot->child(NULL); + aSlot->setGlyph(this, gid, theGlyph); + aSlot->originate(id); + aSlot->before(id); + aSlot->after(id); + if (m_last) m_last->next(aSlot); + aSlot->prev(m_last); + m_last = aSlot; + if (!m_first) m_first = aSlot; +} + +Slot *Segment::newSlot() +{ + if (!m_freeSlots) + { + int numUser = m_silf->numUser(); +#if !defined GRAPHITE2_NTRACING + if (m_face->logger()) ++numUser; +#endif + Slot *newSlots = grzeroalloc(m_bufSize); + int16 *newAttrs = grzeroalloc(numUser * m_bufSize); + newSlots[0].userAttrs(newAttrs); + for (size_t i = 1; i < m_bufSize - 1; i++) + { + newSlots[i].next(newSlots + i + 1); + newSlots[i].userAttrs(newAttrs + i * numUser); + } + newSlots[m_bufSize - 1].userAttrs(newAttrs + (m_bufSize - 1) * numUser); + newSlots[m_bufSize - 1].next(NULL); + m_slots.push_back(newSlots); + m_userAttrs.push_back(newAttrs); + m_freeSlots = (m_bufSize > 1)? newSlots + 1 : NULL; + return newSlots; + } + Slot *res = m_freeSlots; + m_freeSlots = m_freeSlots->next(); + res->next(NULL); + return res; +} + +void Segment::freeSlot(Slot *aSlot) +{ + if (m_last == aSlot) m_last = aSlot->prev(); + if (m_first == aSlot) m_first = aSlot->next(); + if (aSlot->attachedTo()) + aSlot->attachedTo()->removeChild(aSlot); + while (aSlot->firstChild()) + { + aSlot->firstChild()->attachTo(NULL); + aSlot->removeChild(aSlot->firstChild()); + } + // reset the slot incase it is reused + ::new (aSlot) Slot; + memset(aSlot->userAttrs(), 0, m_silf->numUser() * sizeof(int16)); + // Update generation counter for debug +#if !defined GRAPHITE2_NTRACING + if (m_face->logger()) + ++aSlot->userAttrs()[m_silf->numUser()]; +#endif + // update next pointer + if (!m_freeSlots) + aSlot->next(NULL); + else + aSlot->next(m_freeSlots); + m_freeSlots = aSlot; +} + +SlotJustify *Segment::newJustify() +{ + if (!m_freeJustifies) + { + const size_t justSize = SlotJustify::size_of(m_silf->numJustLevels()); + byte *justs = grzeroalloc(justSize * m_bufSize); + for (int i = m_bufSize - 2; i >= 0; --i) + { + SlotJustify *p = reinterpret_cast(justs + justSize * i); + SlotJustify *next = reinterpret_cast(justs + justSize * (i + 1)); + p->next = next; + } + m_freeJustifies = (SlotJustify *)justs; + m_justifies.push_back(m_freeJustifies); + } + SlotJustify *res = m_freeJustifies; + m_freeJustifies = m_freeJustifies->next; + res->next = NULL; + return res; +} + +void Segment::freeJustify(SlotJustify *aJustify) +{ + int numJust = m_silf->numJustLevels(); + if (m_silf->numJustLevels() <= 0) numJust = 1; + aJustify->next = m_freeJustifies; + memset(aJustify->values, 0, numJust*SlotJustify::NUMJUSTPARAMS*sizeof(int16)); + m_freeJustifies = aJustify; +} + +#ifndef GRAPHITE2_NSEGCACHE +void Segment::splice(size_t offset, size_t length, Slot * const startSlot, + Slot * endSlot, const Slot * srcSlot, + const size_t numGlyphs) +{ + extendLength(numGlyphs - length); + // remove any extra + if (numGlyphs < length) + { + Slot * end = endSlot->next(); + do + { + endSlot = endSlot->prev(); + freeSlot(endSlot->next()); + } while (numGlyphs < --length); + endSlot->next(end); + if (end) + end->prev(endSlot); + } + else + { + // insert extra slots if needed + while (numGlyphs > length) + { + Slot * extra = newSlot(); + extra->prev(endSlot); + extra->next(endSlot->next()); + endSlot->next(extra); + if (extra->next()) + extra->next()->prev(extra); + if (m_last == endSlot) + m_last = extra; + endSlot = extra; + ++length; + } + } + + endSlot = endSlot->next(); + assert(numGlyphs == length); + Slot * indexmap[eMaxSpliceSize*3]; + assert(numGlyphs < sizeof indexmap/sizeof *indexmap); + Slot * slot = startSlot; + for (uint16 i=0; i < numGlyphs; slot = slot->next(), ++i) + indexmap[i] = slot; + + slot = startSlot; + for (slot=startSlot; slot != endSlot; slot = slot->next(), srcSlot = srcSlot->next()) + { + slot->set(*srcSlot, offset, m_silf->numUser(), m_silf->numJustLevels()); + if (srcSlot->attachedTo()) slot->attachTo(indexmap[srcSlot->attachedTo()->index()]); + if (srcSlot->nextSibling()) slot->m_sibling = indexmap[srcSlot->nextSibling()->index()]; + if (srcSlot->firstChild()) slot->m_child = indexmap[srcSlot->firstChild()->index()]; + } +} +#endif // GRAPHITE2_NSEGCACHE + +void Segment::linkClusters(Slot *s, Slot * end) +{ + end = end->next(); + + for (; s != end && !s->isBase(); s = s->next()); + Slot * ls = s; + + if (m_dir & 1) + { + for (; s != end; s = s->next()) + { + if (!s->isBase()) continue; + + s->sibling(ls); + ls = s; + } + } + else + { + for (; s != end; s = s->next()) + { + if (!s->isBase()) continue; + + ls->sibling(s); + ls = s; + } + } +} + +Position Segment::positionSlots(const Font *font, Slot * iStart, Slot * iEnd) +{ + Position currpos(0., 0.); + Rect bbox; + float clusterMin = 0.; + + if (!iStart) iStart = m_first; + if (!iEnd) iEnd = m_last; + + if (m_dir & 1) + { + for (Slot * s = iEnd, * const end = iStart->prev(); s && s != end; s = s->prev()) + { + if (s->isBase()) + currpos = s->finalise(this, font, currpos, bbox, 0, clusterMin = currpos.x); + } + } + else + { + for (Slot * s = iStart, * const end = iEnd->next(); s && s != end; s = s->next()) + { + if (s->isBase()) + currpos = s->finalise(this, font, currpos, bbox, 0, clusterMin = currpos.x); + } + } + return currpos; +} + + +void Segment::associateChars() +{ + int i = 0; + for (Slot * s = m_first; s; s->index(i++), s = s->next()) + { + int j = s->before(); + if (j < 0) continue; + + for (const int after = s->after(); j <= after; ++j) + { + CharInfo & c = *charinfo(j); + if (c.before() == -1 || i < c.before()) c.before(i); + if (c.after() < i) c.after(i); + } + } +} + + +template +inline void process_utf_data(Segment & seg, const Face & face, const int fid, utf_iter c, size_t n_chars) +{ + const Cmap & cmap = face.cmap(); + int slotid = 0; + + const typename utf_iter::codeunit_type * const base = c; + for (; n_chars; --n_chars, ++c, ++slotid) + { + const uint32 usv = *c; + uint16 gid = cmap[usv]; + if (!gid) gid = face.findPseudo(usv); + seg.appendSlot(slotid, usv, gid, fid, c - base); + } +} + + +void Segment::read_text(const Face *face, const Features* pFeats/*must not be NULL*/, gr_encform enc, const void* pStart, size_t nChars) +{ + assert(face); + assert(pFeats); + + switch (enc) + { + case gr_utf8: process_utf_data(*this, *face, addFeatures(*pFeats), utf8::const_iterator(pStart), nChars); break; + case gr_utf16: process_utf_data(*this, *face, addFeatures(*pFeats), utf16::const_iterator(pStart), nChars); break; + case gr_utf32: process_utf_data(*this, *face, addFeatures(*pFeats), utf32::const_iterator(pStart), nChars); break; + } +} + +void Segment::prepare_pos(const Font * /*font*/) +{ + // copy key changeable metrics into slot (if any); +} + +Slot *resolveExplicit(int level, int dir, Slot *s, int nNest = 0); +void resolveWeak(int baseLevel, Slot *s); +void resolveNeutrals(int baseLevel, Slot *s); +void resolveImplicit(Slot *s, Segment *seg, uint8 aMirror); +void resolveWhitespace(int baseLevel, Segment *seg, uint8 aBidi, Slot *s); +Slot *resolveOrder(Slot * & s, const bool reordered, const int level = 0); + +void Segment::bidiPass(uint8 aBidi, int paradir, uint8 aMirror) +{ + if (slotCount() == 0) + return; + + Slot *s; + int baseLevel = paradir ? 1 : 0; + unsigned int bmask = 0; + for (s = first(); s; s = s->next()) + { + unsigned int bAttr = glyphAttr(s->gid(), aBidi); + s->setBidiClass((bAttr <= 16) * bAttr); + bmask |= (1 << s->getBidiClass()); + s->setBidiLevel(baseLevel); + } + if (bmask & (paradir ? 0x92 : 0x9C)) + { + if (bmask & 0xF800) + resolveExplicit(baseLevel, 0, first(), 0); + if (bmask & 0x10178) + resolveWeak(baseLevel, first()); + if (bmask & 0x361) + resolveNeutrals(baseLevel, first()); + resolveImplicit(first(), this, aMirror); + resolveWhitespace(baseLevel, this, aBidi, last()); + s = resolveOrder(s = first(), baseLevel != 0); + first(s); last(s->prev()); + s->prev()->next(0); s->prev(0); + } + else if (!(dir() & 4) && baseLevel && aMirror) + { + for (s = first(); s; s = s->next()) + { + unsigned short g = glyphAttr(s->gid(), aMirror); + if (g) s->setGlyph(this, g); + } + } +} + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/Silf.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/Silf.cpp new file mode 100644 index 00000000000..53c13841937 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/Silf.cpp @@ -0,0 +1,385 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include +#include "graphite2/Segment.h" +#include "inc/debug.h" +#include "inc/Endian.h" +#include "inc/Silf.h" +#include "inc/Segment.h" +#include "inc/Rule.h" + + +using namespace graphite2; + +namespace { static const uint32 ERROROFFSET = 0xFFFFFFFF; } + +Silf::Silf() throw() +: m_passes(0), + m_pseudos(0), + m_classOffsets(0), + m_classData(0), + m_justs(0), + m_numPasses(0), + m_numJusts(0), + m_sPass(0), + m_pPass(0), + m_jPass(0), + m_bPass(0), + m_flags(0), + m_aPseudo(0), + m_aBreak(0), + m_aUser(0), + m_aBidi(0), + m_aMirror(0), + m_iMaxComp(0), + m_aLig(0), + m_numPseudo(0), + m_nClass(0), + m_nLinear(0), + m_gEndLine(0) +{ + memset(&m_silfinfo, 0, sizeof m_silfinfo); +} + +Silf::~Silf() throw() +{ + releaseBuffers(); +} + +void Silf::releaseBuffers() throw() +{ + delete [] m_passes; + delete [] m_pseudos; + free(m_classOffsets); + free(m_classData); + free(m_justs); + m_passes= 0; + m_pseudos = 0; + m_classOffsets = 0; + m_classData = 0; + m_justs = 0; +} + + +bool Silf::readGraphite(const byte * const silf_start, size_t lSilf, const Face& face, uint32 version) +{ + const byte * p = silf_start, + * const silf_end = p + lSilf; + + if (version >= 0x00030000) + { + if (lSilf < 28) { releaseBuffers(); return false; } + be::skip(p); // ruleVersion + be::skip(p,2); // passOffset & pseudosOffset + } + else if (lSilf < 20) { releaseBuffers(); return false; } + const uint16 maxGlyph = be::read(p); + m_silfinfo.extra_ascent = be::read(p); + m_silfinfo.extra_descent = be::read(p); + m_numPasses = be::read(p); + m_sPass = be::read(p); + m_pPass = be::read(p); + m_jPass = be::read(p); + m_bPass = be::read(p); + m_flags = be::read(p); + be::skip(p,2); // max{Pre,Post}Context. + m_aPseudo = be::read(p); + m_aBreak = be::read(p); + m_aBidi = be::read(p); + m_aMirror = be::read(p); + be::skip(p); // skip reserved stuff + + // Read Justification levels. + m_numJusts = be::read(p); + if (maxGlyph >= face.glyphs().numGlyphs() + || p + m_numJusts * 8 >= silf_end) { releaseBuffers(); return false; } + m_justs = gralloc(m_numJusts); + for (uint8 i = 0; i < m_numJusts; i++) + { + ::new(m_justs + i) Justinfo(p[0], p[1], p[2], p[3]); + be::skip(p,8); + } + + if (p + sizeof(uint16) + sizeof(uint8)*8 >= silf_end) { releaseBuffers(); return false; } + m_aLig = be::read(p); + m_aUser = be::read(p); + m_iMaxComp = be::read(p); + be::skip(p,5); // direction and 4 reserved bytes + be::skip(p, be::read(p)); // don't need critical features yet + be::skip(p); // reserved + if (p >= silf_end) { releaseBuffers(); return false; } + be::skip(p, be::read(p)); // don't use scriptTag array. + if (p + sizeof(uint16) + sizeof(uint32) >= silf_end) { releaseBuffers(); return false; } + m_gEndLine = be::read(p); // lbGID + const byte * o_passes = p, + * const passes_start = silf_start + be::read(p); + + const size_t num_attrs = face.glyphs().numAttrs(); + if (m_aPseudo >= num_attrs + || m_aBreak >= num_attrs + || m_aBidi >= num_attrs + || m_aMirror>= num_attrs + || m_numPasses > 128 || passes_start >= silf_end + || m_pPass < m_sPass || m_pPass > m_numPasses || m_sPass > m_numPasses + || m_jPass < m_pPass || m_jPass > m_numPasses + || (m_bPass != 0xFF && (m_bPass < m_jPass || m_bPass > m_numPasses)) + || m_aLig > 127) { releaseBuffers(); return false; } + be::skip(p, m_numPasses); + if (p + sizeof(uint16) >= passes_start) { releaseBuffers(); return false; } + m_numPseudo = be::read(p); + be::skip(p, 3); // searchPseudo, pseudoSelector, pseudoShift + if (p + m_numPseudo*(sizeof(uint32) + sizeof(uint16)) >= passes_start) { + releaseBuffers(); return false; + } + m_pseudos = new Pseudo[m_numPseudo]; + for (int i = 0; i < m_numPseudo; i++) + { + m_pseudos[i].uid = be::read(p); + m_pseudos[i].gid = be::read(p); + } + + const size_t clen = readClassMap(p, passes_start - p, version); + if (clen == ERROROFFSET || p + clen > passes_start) { releaseBuffers(); return false; } + + m_passes = new Pass[m_numPasses]; + for (size_t i = 0; i < m_numPasses; ++i) + { + const byte * const pass_start = silf_start + be::read(o_passes), + * const pass_end = silf_start + be::peek(o_passes); + if (pass_start > pass_end || pass_end > silf_end) { + releaseBuffers(); return false; + } + + m_passes[i].init(this); + if (!m_passes[i].readPass(pass_start, pass_end - pass_start, pass_start - silf_start, face)) + { + releaseBuffers(); + return false; + } + } + + // fill in gr_faceinfo + m_silfinfo.upem = face.glyphs().unitsPerEm(); + m_silfinfo.has_bidi_pass = (m_bPass != 0xFF); + m_silfinfo.justifies = (m_numJusts != 0) || (m_jPass < m_pPass); + m_silfinfo.line_ends = (m_flags & 1); + m_silfinfo.space_contextuals = gr_faceinfo::gr_space_contextuals((m_flags >> 2) & 0x7); + return true; +} + +template inline uint32 Silf::readClassOffsets(const byte *&p, size_t data_len) +{ + const T cls_off = 2*sizeof(uint16) + sizeof(T)*(m_nClass+1); + const size_t max_off = (be::peek(p + sizeof(T)*m_nClass) - cls_off)/sizeof(uint16); + // Check that the last+1 offset is less than or equal to the class map length. + if (be::peek(p) != cls_off || max_off > (data_len - cls_off)/sizeof(uint16)) + return ERROROFFSET; + + // Read in all the offsets. + m_classOffsets = gralloc(m_nClass+1); + for (uint32 * o = m_classOffsets, * const o_end = o + m_nClass + 1; o != o_end; ++o) + { + *o = (be::read(p) - cls_off)/sizeof(uint16); + if (*o > max_off) + return ERROROFFSET; + } + return max_off; +} + +size_t Silf::readClassMap(const byte *p, size_t data_len, uint32 version) +{ + if (data_len < sizeof(uint16)*2) return ERROROFFSET; + + m_nClass = be::read(p); + m_nLinear = be::read(p); + + // Check that numLinear < numClass, + // that there is at least enough data for numClasses offsets. + if (m_nLinear > m_nClass + || (m_nClass + 1) * (version >= 0x00040000 ? sizeof(uint32) : sizeof(uint16))> (data_len - 4)) + return ERROROFFSET; + + + uint32 max_off; + if (version >= 0x00040000) + max_off = readClassOffsets(p, data_len); + else + max_off = readClassOffsets(p, data_len); + + if (max_off == ERROROFFSET) return ERROROFFSET; + + // Check the linear offsets are sane, these must be monotonically increasing. + for (const uint32 *o = m_classOffsets, * const o_end = o + m_nLinear; o != o_end; ++o) + if (o[0] > o[1]) + return ERROROFFSET; + + // Fortunately the class data is all uint16s so we can decode these now + m_classData = gralloc(max_off); + for (uint16 *d = m_classData, * const d_end = d + max_off; d != d_end; ++d) + *d = be::read(p); + + // Check the lookup class invariants for each non-linear class + for (const uint32 *o = m_classOffsets + m_nLinear, * const o_end = m_classOffsets + m_nClass; o != o_end; ++o) + { + const uint16 * lookup = m_classData + *o; + if (*o > max_off - 4 // LookupClass doesn't stretch over max_off + || lookup[0] == 0 // A LookupClass with no looks is a suspicious thing ... + || lookup[0] > (max_off - *o - 4)/2 // numIDs lookup pairs fits within (start of LookupClass' lookups array, max_off] + || lookup[3] != lookup[0] - lookup[1]) // rangeShift: numIDs - searchRange + return ERROROFFSET; + } + + return max_off; +} + +uint16 Silf::findPseudo(uint32 uid) const +{ + for (int i = 0; i < m_numPseudo; i++) + if (m_pseudos[i].uid == uid) return m_pseudos[i].gid; + return 0; +} + +uint16 Silf::findClassIndex(uint16 cid, uint16 gid) const +{ + if (cid > m_nClass) return -1; + + const uint16 * cls = m_classData + m_classOffsets[cid]; + if (cid < m_nLinear) // output class being used for input, shouldn't happen + { + for (unsigned int i = 0, n = m_classOffsets[cid + 1]; i < n; ++i, ++cls) + if (*cls == gid) return i; + return -1; + } + else + { + const uint16 * min = cls + 4, // lookups array + * max = min + cls[0]*2; // lookups aray is numIDs (cls[0]) uint16 pairs long + do + { + const uint16 * p = min + (-2 & ((max-min)/2)); + if (p[0] > gid) max = p; + else min = p; + } + while (max - min > 2); + return min[0] == gid ? min[1] : -1; + } +} + +uint16 Silf::getClassGlyph(uint16 cid, unsigned int index) const +{ + if (cid > m_nClass) return 0; + + uint32 loc = m_classOffsets[cid]; + if (cid < m_nLinear) + { + if (index < m_classOffsets[cid + 1] - loc) + return m_classData[index + loc]; + } + else // input class being used for output. Shouldn't happen + { + for (unsigned int i = loc + 4; i < m_classOffsets[cid + 1]; i += 2) + if (m_classData[i + 1] == index) return m_classData[i]; + } + return 0; +} + + +bool Silf::runGraphite(Segment *seg, uint8 firstPass, uint8 lastPass) const +{ + assert(seg != 0); + SlotMap map(*seg); + FiniteStateMachine fsm(map, seg->getFace()->logger()); + vm::Machine m(map); + unsigned int initSize = seg->slotCount(); +#if !defined GRAPHITE2_NTRACING + json * const dbgout = seg->getFace()->logger(); +#endif + + if (lastPass == 0) + { + if (firstPass == lastPass) + return true; + lastPass = m_numPasses; + } + + for (size_t i = firstPass; i < lastPass; ++i) + { + // bidi and mirroring + if (i == m_bPass) + { +#if !defined GRAPHITE2_NTRACING + if (dbgout) + { + *dbgout << json::item << json::object + << "id" << -1 + << "slots" << json::array; + seg->positionSlots(0); + for(Slot * s = seg->first(); s; s = s->next()) + *dbgout << dslot(seg, s); + *dbgout << json::close + << "rules" << json::array << json::close + << json::close; + } +#endif + + if (!(seg->dir() & 2)) + seg->bidiPass(m_aBidi, seg->dir() & 1, m_aMirror); + else if (m_aMirror) + { + Slot * s; + for (s = seg->first(); s; s = s->next()) + { + unsigned short g = seg->glyphAttr(s->gid(), m_aMirror); + if (g && (!(seg->dir() & 4) || !seg->glyphAttr(s->gid(), m_aMirror + 1))) + s->setGlyph(seg, g); + } + } + } + +#if !defined GRAPHITE2_NTRACING + if (dbgout) + { + *dbgout << json::item << json::object + << "id" << i+1 + << "slots" << json::array; + seg->positionSlots(0); + for(Slot * s = seg->first(); s; s = s->next()) + *dbgout << dslot(seg, s); + *dbgout << json::close; + } +#endif + + // test whether to reorder, prepare for positioning + m_passes[i].runGraphite(m, fsm); + // only subsitution passes can change segment length, cached subsegments are short for their text + if (m.status() != vm::Machine::finished + || (i < m_pPass && (seg->slotCount() > initSize * MAX_SEG_GROWTH_FACTOR + || (seg->slotCount() && seg->slotCount() * MAX_SEG_GROWTH_FACTOR < initSize)))) + return false; + } + return true; +} diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/Slot.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/Slot.cpp new file mode 100644 index 00000000000..d7e07780942 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/Slot.cpp @@ -0,0 +1,418 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include "inc/Segment.h" +#include "inc/Slot.h" +#include "inc/Silf.h" +#include "inc/CharInfo.h" +#include "inc/Rule.h" + + +using namespace graphite2; + +Slot::Slot() : + m_next(NULL), m_prev(NULL), + m_glyphid(0), m_realglyphid(0), m_original(0), m_before(0), m_after(0), + m_index(0), m_parent(NULL), m_child(NULL), m_sibling(NULL), + m_position(0, 0), m_shift(0, 0), m_advance(-1, -1), + m_attach(0, 0), m_with(0, 0), m_just(0.), + m_flags(0), m_attLevel(0), m_bidiCls(0), m_bidiLevel(0), m_justs(NULL) + // Do not set m_userAttr since it is set *before* new is called since this + // is used as a positional new to reset the GrSlot +{ +} + +// take care, this does not copy any of the GrSlot pointer fields +void Slot::set(const Slot & orig, int charOffset, size_t numUserAttr, size_t justLevels) +{ + // leave m_next and m_prev unchanged + m_glyphid = orig.m_glyphid; + m_realglyphid = orig.m_realglyphid; + m_original = orig.m_original + charOffset; + m_before = orig.m_before + charOffset; + m_after = orig.m_after + charOffset; + m_parent = NULL; + m_child = NULL; + m_sibling = NULL; + m_position = orig.m_position; + m_shift = orig.m_shift; + m_advance = orig.m_advance; + m_attach = orig.m_attach; + m_with = orig.m_with; + m_flags = orig.m_flags; + m_attLevel = orig.m_attLevel; + m_bidiCls = orig.m_bidiCls; + m_bidiLevel = orig.m_bidiLevel; + if (m_userAttr && orig.m_userAttr) + { + memcpy(m_userAttr, orig.m_userAttr, numUserAttr * sizeof(*m_userAttr)); + } + if (m_justs && orig.m_justs) + { + memcpy(m_justs, orig.m_justs, SlotJustify::size_of(justLevels)); + } +} + +void Slot::update(int /*numGrSlots*/, int numCharInfo, Position &relpos) +{ + m_before += numCharInfo; + m_after += numCharInfo; + m_position = m_position + relpos; +} + +Position Slot::finalise(const Segment *seg, const Font *font, Position & base, Rect & bbox, uint8 attrLevel, float & clusterMin) +{ + if (attrLevel && m_attLevel > attrLevel) return Position(0, 0); + float scale = 1.0; + Position shift = m_shift + Position(m_just, 0); + float tAdvance = m_advance.x + m_just; + const GlyphFace * glyphFace = seg->getFace()->glyphs().glyphSafe(glyph()); + if (font) + { + scale = font->scale(); + shift *= scale; + if (font->isHinted() && glyphFace) + tAdvance = (m_advance.x - glyphFace->theAdvance().x + m_just) * scale + font->advance(m_glyphid); + else + tAdvance *= scale; + } + Position res; + + m_position = base + shift; + if (!m_parent) + { + res = base + Position(tAdvance, m_advance.y * scale); + clusterMin = base.x; + } + else + { + float tAdv; + m_position += (m_attach - m_with) * scale; + tAdv = m_advance.x >= 0.5 ? m_position.x + tAdvance - shift.x : 0.f; + res = Position(tAdv, 0); + if ((m_advance.x >= 0.5 || m_position.x < 0) && m_position.x < clusterMin) clusterMin = m_position.x; + } + + if (glyphFace) + { + Rect ourBbox = glyphFace->theBBox() * scale + m_position; + bbox = bbox.widen(ourBbox); + } + + if (m_child && m_child != this && m_child->attachedTo() == this) + { + Position tRes = m_child->finalise(seg, font, m_position, bbox, attrLevel, clusterMin); + if ((!m_parent || m_advance.x >= 0.5) && tRes.x > res.x) res = tRes; + } + + if (m_parent && m_sibling && m_sibling != this && m_sibling->attachedTo() == m_parent) + { + Position tRes = m_sibling->finalise(seg, font, base, bbox, attrLevel, clusterMin); + if (tRes.x > res.x) res = tRes; + } + + if (!m_parent && clusterMin < base.x) + { + Position adj = Position(base.x - clusterMin, 0.); + res += adj; + m_position += adj; + if (m_child) m_child->floodShift(adj); + } + return res; +} + +int32 Slot::clusterMetric(const Segment *seg, uint8 metric, uint8 attrLevel) +{ + Position base; + Rect bbox = seg->theGlyphBBoxTemporary(gid()); + float clusterMin = 0.; + Position res = finalise(seg, NULL, base, bbox, attrLevel, clusterMin); + + switch (metrics(metric)) + { + case kgmetLsb : + return static_cast(bbox.bl.x); + case kgmetRsb : + return static_cast(res.x - bbox.tr.x); + case kgmetBbTop : + return static_cast(bbox.tr.y); + case kgmetBbBottom : + return static_cast(bbox.bl.y); + case kgmetBbLeft : + return static_cast(bbox.bl.x); + case kgmetBbRight : + return static_cast(bbox.tr.x); + case kgmetBbWidth : + return static_cast(bbox.tr.x - bbox.bl.x); + case kgmetBbHeight : + return static_cast(bbox.tr.y - bbox.bl.y); + case kgmetAdvWidth : + return static_cast(res.x); + case kgmetAdvHeight : + return static_cast(res.y); + default : + return 0; + } +} + +int Slot::getAttr(const Segment *seg, attrCode ind, uint8 subindex) const +{ + if (!this) return 0; + if (ind == gr_slatUserDefnV1) + { + ind = gr_slatUserDefn; + subindex = 0; + } + else if (ind >= gr_slatJStretch && ind < gr_slatJStretch + 20 && ind != gr_slatJWidth) + { + int indx = ind - gr_slatJStretch; + return getJustify(seg, indx / 5, indx % 5); + } + + switch (ind) + { + case gr_slatAdvX : return int(m_advance.x); + case gr_slatAdvY : return int(m_advance.y); + case gr_slatAttTo : return m_parent ? 1 : 0; + case gr_slatAttX : return int(m_attach.x); + case gr_slatAttY : return int(m_attach.y); + case gr_slatAttXOff : + case gr_slatAttYOff : return 0; + case gr_slatAttWithX : return int(m_with.x); + case gr_slatAttWithY : return int(m_with.y); + case gr_slatAttWithXOff: + case gr_slatAttWithYOff:return 0; + case gr_slatAttLevel : return m_attLevel; + case gr_slatBreak : return seg->charinfo(m_original)->breakWeight(); + case gr_slatCompRef : return 0; + case gr_slatDir : return seg->dir(); + case gr_slatInsert : return isInsertBefore(); + case gr_slatPosX : return int(m_position.x); // but need to calculate it + case gr_slatPosY : return int(m_position.y); + case gr_slatShiftX : return int(m_shift.x); + case gr_slatShiftY : return int(m_shift.y); + case gr_slatMeasureSol: return -1; // err what's this? + case gr_slatMeasureEol: return -1; + case gr_slatJWidth: return m_just; + case gr_slatUserDefn : return m_userAttr[subindex]; + case gr_slatSegSplit : return seg->charinfo(m_original)->flags() & 3; + default : return 0; + } +} + +void Slot::setAttr(Segment *seg, attrCode ind, uint8 subindex, int16 value, const SlotMap & map) +{ + if (!this) return; + if (ind == gr_slatUserDefnV1) + { + ind = gr_slatUserDefn; + subindex = 0; + } + else if (ind >= gr_slatJStretch && ind < gr_slatJStretch + 20 && ind != gr_slatJWidth) + { + int indx = ind - gr_slatJStretch; + return setJustify(seg, indx / 5, indx % 5, value); + } + + switch (ind) + { + case gr_slatAdvX : m_advance.x = value; break; + case gr_slatAdvY : m_advance.y = value; break; + case gr_slatAttTo : + { + const uint16 idx = uint16(value); + if (idx < map.size() && map[idx]) + { + Slot *other = map[idx]; + if (other == this) break; + if (m_parent) m_parent->removeChild(this); + if (other->child(this)) + { + attachTo(other); + if (((seg->dir() & 1) != 0) ^ (idx > subindex)) + m_with = Position(advance(), 0); + else // normal match to previous root + m_attach = Position(other->advance(), 0); + } + } + break; + } + case gr_slatAttX : m_attach.x = value; break; + case gr_slatAttY : m_attach.y = value; break; + case gr_slatAttXOff : + case gr_slatAttYOff : break; + case gr_slatAttWithX : m_with.x = value; break; + case gr_slatAttWithY : m_with.y = value; break; + case gr_slatAttWithXOff : + case gr_slatAttWithYOff : break; + case gr_slatAttLevel : + m_attLevel = byte(value); + break; + case gr_slatBreak : + seg->charinfo(m_original)->breakWeight(value); + break; + case gr_slatCompRef : break; // not sure what to do here + case gr_slatDir : break; // read only + case gr_slatInsert : + markInsertBefore(value? true : false); + break; + case gr_slatPosX : break; // can't set these here + case gr_slatPosY : break; + case gr_slatShiftX : m_shift.x = value; break; + case gr_slatShiftY : m_shift.y = value; break; + case gr_slatMeasureSol : break; + case gr_slatMeasureEol : break; + case gr_slatJWidth : just(value); break; + case gr_slatSegSplit : seg->charinfo(m_original)->addflags(value & 3); break; + case gr_slatUserDefn : m_userAttr[subindex] = value; break; + default : + break; + } +} + +int Slot::getJustify(const Segment *seg, uint8 level, uint8 subindex) const +{ + if (level && level >= seg->silf()->numJustLevels()) return 0; + + if (m_justs) + return m_justs->values[level * SlotJustify::NUMJUSTPARAMS + subindex]; + + if (level >= seg->silf()->numJustLevels()) return 0; + Justinfo *jAttrs = seg->silf()->justAttrs() + level; + + switch (subindex) { + case 0 : return seg->glyphAttr(gid(), jAttrs->attrStretch()); + case 1 : return seg->glyphAttr(gid(), jAttrs->attrShrink()); + case 2 : return seg->glyphAttr(gid(), jAttrs->attrStep()); + case 3 : return seg->glyphAttr(gid(), jAttrs->attrWeight()); + case 4 : return 0; // not been set yet, so clearly 0 + default: return 0; + } +} + +void Slot::setJustify(Segment *seg, uint8 level, uint8 subindex, int16 value) +{ + if (level >= seg->silf()->numJustLevels()) return; + if (!m_justs) + { + SlotJustify *j = seg->newJustify(); + j->LoadSlot(this, seg); + m_justs = j; + } + m_justs->values[level * SlotJustify::NUMJUSTPARAMS + subindex] = value; +} + +bool Slot::child(Slot *ap) +{ + if (this == ap) return false; + else if (ap == m_child) return true; + else if (!m_child) + m_child = ap; + else + return m_child->sibling(ap); + return true; +} + +bool Slot::sibling(Slot *ap) +{ + if (this == ap) return false; + else if (ap == m_sibling) return true; + else if (!m_sibling || !ap) + m_sibling = ap; + else + return m_sibling->sibling(ap); + return true; +} + +bool Slot::removeChild(Slot *ap) +{ + if (this == ap || !m_child) return false; + else if (ap == m_child) + { + Slot *nSibling = m_child->nextSibling(); + m_child->sibling(NULL); + m_child = nSibling; + return true; + } + else + return m_child->removeSibling(ap); + return true; +} + +bool Slot::removeSibling(Slot *ap) +{ + if (this == ap || !m_sibling) return false; + else if (ap == m_sibling) + { + m_sibling = m_sibling->nextSibling(); + return true; + } + else + return m_sibling->removeSibling(ap); + return true; +} + +void Slot::setGlyph(Segment *seg, uint16 glyphid, const GlyphFace * theGlyph) +{ + m_glyphid = glyphid; + if (!theGlyph) + { + theGlyph = seg->getFace()->glyphs().glyphSafe(glyphid); + if (!theGlyph) + { + m_realglyphid = 0; + m_advance = Position(0.,0.); + return; + } + } + m_realglyphid = theGlyph->attrs()[seg->silf()->aPseudo()]; + if (m_realglyphid) + { + const GlyphFace *aGlyph = seg->getFace()->glyphs().glyphSafe(m_realglyphid); + if (aGlyph) theGlyph = aGlyph; + } + m_advance = Position(theGlyph->theAdvance().x, 0.); +} + +void Slot::floodShift(Position adj) +{ + m_position += adj; + if (m_child) m_child->floodShift(adj); + if (m_sibling) m_sibling->floodShift(adj); +} + +void SlotJustify::LoadSlot(const Slot *s, const Segment *seg) +{ + for (int i = seg->silf()->numJustLevels() - 1; i >= 0; --i) + { + Justinfo *justs = seg->silf()->justAttrs() + i; + int16 *v = values + i * NUMJUSTPARAMS; + v[0] = seg->glyphAttr(s->gid(), justs->attrStretch()); + v[1] = seg->glyphAttr(s->gid(), justs->attrShrink()); + v[2] = seg->glyphAttr(s->gid(), justs->attrStep()); + v[3] = seg->glyphAttr(s->gid(), justs->attrWeight()); + } +} diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/Sparse.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/Sparse.cpp new file mode 100644 index 00000000000..a3eb52a1942 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/Sparse.cpp @@ -0,0 +1,60 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include +#include "inc/Sparse.h" +#include "inc/bits.h" + +using namespace graphite2; + + +sparse::~sparse() throw() +{ + free(m_array.values); +} + + +sparse::mapped_type sparse::operator [] (const key_type k) const throw() +{ + mapped_type g = key_type(k/SIZEOF_CHUNK - m_nchunks) >> (sizeof k*8 - 1); + const chunk & c = m_array.map[g*k/SIZEOF_CHUNK]; + const mask_t m = c.mask >> (SIZEOF_CHUNK - 1 - (k%SIZEOF_CHUNK)); + g *= m & 1; + + return g*m_array.values[g*(c.offset + bit_set_count(m >> 1))]; +} + + +size_t sparse::capacity() const throw() +{ + size_t n = m_nchunks, + s = 0; + + for (const chunk *ci=m_array.map; n; --n, ++ci) + s += bit_set_count(ci->mask); + + return s; +} diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/TtfUtil.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/TtfUtil.cpp new file mode 100644 index 00000000000..9ede99e9145 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/TtfUtil.cpp @@ -0,0 +1,1980 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +/*--------------------------------------------------------------------*//*:Ignore this sentence. + +File: TtfUtil.cpp +Responsibility: Alan Ward +Last reviewed: Not yet. + +Description + Implements the methods for TtfUtil class. This file should remain portable to any C++ + environment by only using standard C++ and the TTF structurs defined in Tt.h. +-------------------------------------------------------------------------------*//*:End Ignore*/ + + +/*********************************************************************************************** + Include files +***********************************************************************************************/ +// Language headers +//#include +#include +#include +#include +#include +#include +//#include +// Platform headers +// Module headers +#include "inc/TtfUtil.h" +#include "inc/TtfTypes.h" +#include "inc/Endian.h" + +/*********************************************************************************************** + Forward declarations +***********************************************************************************************/ + +/*********************************************************************************************** + Local Constants and static variables +***********************************************************************************************/ +namespace +{ + // max number of components allowed in composite glyphs + const int kMaxGlyphComponents = 8; + + template + inline float fixed_to_float(const T f) { + return float(f)/float(2^R); + } + +/*---------------------------------------------------------------------------------------------- + Table of standard Postscript glyph names. From Martin Hosken. Disagress with ttfdump.exe +---------------------------------------------------------------------------------------------*/ +#ifdef ALL_TTFUTILS + const int kcPostNames = 258; + + const char * rgPostName[kcPostNames] = { + ".notdef", ".null", "nonmarkingreturn", "space", "exclam", "quotedbl", "numbersign", + "dollar", "percent", "ampersand", "quotesingle", "parenleft", + "parenright", "asterisk", "plus", "comma", "hyphen", "period", "slash", + "zero", "one", "two", "three", "four", "five", "six", "seven", "eight", + "nine", "colon", "semicolon", "less", "equal", "greater", "question", + "at", "A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M", + "N", "O", "P", "Q", "R", "S", "T", "U", "V", "W", "X", "Y", "Z", + "bracketleft", "backslash", "bracketright", "asciicircum", + "underscore", "grave", "a", "b", "c", "d", "e", "f", "g", "h", "i", + "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", + "x", "y", "z", "braceleft", "bar", "braceright", "asciitilde", + "Adieresis", "Aring", "Ccedilla", "Eacute", "Ntilde", "Odieresis", + "Udieresis", "aacute", "agrave", "acircumflex", "adieresis", "atilde", + "aring", "ccedilla", "eacute", "egrave", "ecircumflex", "edieresis", + "iacute", "igrave", "icircumflex", "idieresis", "ntilde", "oacute", + "ograve", "ocircumflex", "odieresis", "otilde", "uacute", "ugrave", + "ucircumflex", "udieresis", "dagger", "degree", "cent", "sterling", + "section", "bullet", "paragraph", "germandbls", "registered", + "copyright", "trademark", "acute", "dieresis", "notequal", "AE", + "Oslash", "infinity", "plusminus", "lessequal", "greaterequal", "yen", + "mu", "partialdiff", "summation", "product", "pi", "integral", + "ordfeminine", "ordmasculine", "Omega", "ae", "oslash", "questiondown", + "exclamdown", "logicalnot", "radical", "florin", "approxequal", + "Delta", "guillemotleft", "guillemotright", "ellipsis", "nonbreakingspace", + "Agrave", "Atilde", "Otilde", "OE", "oe", "endash", "emdash", + "quotedblleft", "quotedblright", "quoteleft", "quoteright", "divide", + "lozenge", "ydieresis", "Ydieresis", "fraction", "currency", + "guilsinglleft", "guilsinglright", "fi", "fl", "daggerdbl", "periodcentered", + "quotesinglbase", "quotedblbase", "perthousand", "Acircumflex", + "Ecircumflex", "Aacute", "Edieresis", "Egrave", "Iacute", + "Icircumflex", "Idieresis", "Igrave", "Oacute", "Ocircumflex", + "apple", "Ograve", "Uacute", "Ucircumflex", "Ugrave", "dotlessi", + "circumflex", "tilde", "macron", "breve", "dotaccent", "ring", + "cedilla", "hungarumlaut", "ogonek", "caron", "Lslash", "lslash", + "Scaron", "scaron", "Zcaron", "zcaron", "brokenbar", "Eth", "eth", + "Yacute", "yacute", "Thorn", "thorn", "minus", "multiply", + "onesuperior", "twosuperior", "threesuperior", "onehalf", "onequarter", + "threequarters", "franc", "Gbreve", "gbreve", "Idotaccent", "Scedilla", + "scedilla", "Cacute", "cacute", "Ccaron", "ccaron", + "dcroat" }; +#endif + +} // end of namespace + +/*********************************************************************************************** + Methods +***********************************************************************************************/ + +/* Note on error processing: The code guards against bad glyph ids being used to look up data +in open ended tables (loca, hmtx). If the glyph id comes from a cmap this shouldn't happen +but it seems prudent to check for user errors here. The code does assume that data obtained +from the TTF file is valid otherwise (though the CheckTable method seeks to check for +obvious problems that might accompany a change in table versions). For example an invalid +offset in the loca table which could exceed the size of the glyf table is NOT trapped. +Likewise if numberOf_LongHorMetrics in the hhea table is wrong, this will NOT be trapped, +which could cause a lookup in the hmtx table to exceed the table length. Of course, TTF tables +that are completely corrupt will cause unpredictable results. */ + +/* Note on composite glyphs: Glyphs that have components that are themselves composites +are not supported. IsDeepComposite can be used to test for this. False is returned from many +of the methods in this cases. It is unclear how to build composite glyphs in some cases, +so this code represents my best guess until test cases can be found. See notes on the high- +level GlyfPoints method. */ +namespace graphite2 +{ +namespace TtfUtil +{ + + +/*---------------------------------------------------------------------------------------------- + Get offset and size of the offset table needed to find table directory. + Return true if success, false otherwise. + lSize excludes any table directory entries. +----------------------------------------------------------------------------------------------*/ +bool GetHeaderInfo(size_t & lOffset, size_t & lSize) +{ + lOffset = 0; + lSize = offsetof(Sfnt::OffsetSubTable, table_directory); + assert(sizeof(uint32) + 4*sizeof (uint16) == lSize); + return true; +} + +/*---------------------------------------------------------------------------------------------- + Check the offset table for expected data. + Return true if success, false otherwise. +----------------------------------------------------------------------------------------------*/ +bool CheckHeader(const void * pHdr) +{ + const Sfnt::OffsetSubTable * pOffsetTable + = reinterpret_cast(pHdr); + + return pHdr && be::swap(pOffsetTable->scaler_type) == Sfnt::OffsetSubTable::TrueTypeWin; +} + +/*---------------------------------------------------------------------------------------------- + Get offset and size of the table directory. + Return true if successful, false otherwise. +----------------------------------------------------------------------------------------------*/ +bool GetTableDirInfo(const void * pHdr, size_t & lOffset, size_t & lSize) +{ + const Sfnt::OffsetSubTable * pOffsetTable + = reinterpret_cast(pHdr); + + lOffset = offsetof(Sfnt::OffsetSubTable, table_directory); + lSize = be::swap(pOffsetTable->num_tables) + * sizeof(Sfnt::OffsetSubTable::Entry); + + return true; +} + + +/*---------------------------------------------------------------------------------------------- + Get offset and size of the specified table. + Return true if successful, false otherwise. On false, offset and size will be 0. +----------------------------------------------------------------------------------------------*/ +bool GetTableInfo(const Tag TableTag, const void * pHdr, const void * pTableDir, + size_t & lOffset, size_t & lSize) +{ + const Sfnt::OffsetSubTable * pOffsetTable + = reinterpret_cast(pHdr); + const size_t num_tables = be::swap(pOffsetTable->num_tables); + const Sfnt::OffsetSubTable::Entry + * entry_itr = reinterpret_cast( + pTableDir), + * const dir_end = entry_itr + num_tables; + + if (num_tables > 40) + return false; + + for (;entry_itr != dir_end; ++entry_itr) // 40 - safe guard + { + if (be::swap(entry_itr->tag) == TableTag) + { + lOffset = be::swap(entry_itr->offset); + lSize = be::swap(entry_itr->length); + return true; + } + } + + return false; +} + +/*---------------------------------------------------------------------------------------------- + Check the specified table. Tests depend on the table type. + Return true if successful, false otherwise. +----------------------------------------------------------------------------------------------*/ +bool CheckTable(const Tag TableId, const void * pTable, size_t lTableSize) +{ + using namespace Sfnt; + + if (pTable == 0) return false; + + switch(TableId) + { + case Tag::cmap: // cmap + { + const Sfnt::CharacterCodeMap * const pCmap + = reinterpret_cast(pTable); + return be::swap(pCmap->version) == 0; + } + + case Tag::head: // head + { + const Sfnt::FontHeader * const pHead + = reinterpret_cast(pTable); + bool r = be::swap(pHead->version) == OneFix + && be::swap(pHead->magic_number) == FontHeader::MagicNumber + && be::swap(pHead->glyph_data_format) + == FontHeader::GlypDataFormat + && (be::swap(pHead->index_to_loc_format) + == FontHeader::ShortIndexLocFormat + || be::swap(pHead->index_to_loc_format) + == FontHeader::LongIndexLocFormat) + && sizeof(FontHeader) <= lTableSize; + return r; + } + + case Tag::post: // post + { + const Sfnt::PostScriptGlyphName * const pPost + = reinterpret_cast(pTable); + const fixed format = be::swap(pPost->format); + bool r = format == PostScriptGlyphName::Format1 + || format == PostScriptGlyphName::Format2 + || format == PostScriptGlyphName::Format3 + || format == PostScriptGlyphName::Format25; + return r; + } + + case Tag::hhea: // hhea + { + const Sfnt::HorizontalHeader * pHhea = + reinterpret_cast(pTable); + bool r = be::swap(pHhea->version) == OneFix + && be::swap(pHhea->metric_data_format) == 0 + && sizeof (Sfnt::HorizontalHeader) <= lTableSize; + return r; + } + + case Tag::maxp: // maxp + { + const Sfnt::MaximumProfile * pMaxp = + reinterpret_cast(pTable); + bool r = be::swap(pMaxp->version) == OneFix + && sizeof(Sfnt::MaximumProfile) <= lTableSize; + return r; + } + + case Tag::OS_2: // OS/2 + { + const Sfnt::Compatibility * pOs2 + = reinterpret_cast(pTable); + if (be::swap(pOs2->version) == 0) + { // OS/2 table version 1 size +// if (sizeof(Sfnt::Compatibility) +// - sizeof(uint32)*2 - sizeof(int16)*2 +// - sizeof(uint16)*3 <= lTableSize) + if (sizeof(Sfnt::Compatibility0) <= lTableSize) + return true; + } + else if (be::swap(pOs2->version) == 1) + { // OS/2 table version 2 size +// if (sizeof(Sfnt::Compatibility) +// - sizeof(int16) *2 +// - sizeof(uint16)*3 <= lTableSize) + if (sizeof(Sfnt::Compatibility1) <= lTableSize) + return true; + } + else if (be::swap(pOs2->version) == 2) + { // OS/2 table version 3 size + if (sizeof(Sfnt::Compatibility2) <= lTableSize) + return true; + } + else if (be::swap(pOs2->version) == 3 || be::swap(pOs2->version) == 4) + { // OS/2 table version 4 size - version 4 changed the meaning of some fields which we don't use + if (sizeof(Sfnt::Compatibility3) <= lTableSize) + return true; + } + else + return false; + break; + } + + case Tag::name: + { + const Sfnt::FontNames * pName + = reinterpret_cast(pTable); + return be::swap(pName->format) == 0; + } + + default: + break; + } + + return true; +} + +/*---------------------------------------------------------------------------------------------- + Return the number of glyphs in the font. Should never be less than zero. + + Note: this method is not currently used by the Graphite engine. +----------------------------------------------------------------------------------------------*/ +size_t GlyphCount(const void * pMaxp) +{ + const Sfnt::MaximumProfile * pTable = + reinterpret_cast(pMaxp); + return be::swap(pTable->num_glyphs); +} + +#ifdef ALL_TTFUTILS +/*---------------------------------------------------------------------------------------------- + Return the maximum number of components for any composite glyph in the font. + + Note: this method is not currently used by the Graphite engine. +----------------------------------------------------------------------------------------------*/ +size_t MaxCompositeComponentCount(const void * pMaxp) +{ + const Sfnt::MaximumProfile * pTable = + reinterpret_cast(pMaxp); + return be::swap(pTable->max_component_elements); +} + +/*---------------------------------------------------------------------------------------------- + Composite glyphs can be composed of glyphs that are themselves composites. + This method returns the maximum number of levels like this for any glyph in the font. + A non-composite glyph has a level of 1. + + Note: this method is not currently used by the Graphite engine. +----------------------------------------------------------------------------------------------*/ +size_t MaxCompositeLevelCount(const void * pMaxp) +{ + const Sfnt::MaximumProfile * pTable = + reinterpret_cast(pMaxp); + return be::swap(pTable->max_component_depth); +} + +/*---------------------------------------------------------------------------------------------- + Return the number of glyphs in the font according to a differt source. + Should never be less than zero. Return -1 on failure. + + Note: this method is not currently used by the Graphite engine. +----------------------------------------------------------------------------------------------*/ +size_t LocaGlyphCount(size_t lLocaSize, const void * pHead) //throw(std::domain_error) +{ + + const Sfnt::FontHeader * pTable + = reinterpret_cast(pHead); + + if (be::swap(pTable->index_to_loc_format) + == Sfnt::FontHeader::ShortIndexLocFormat) + // loca entries are two bytes and have been divided by two + return (lLocaSize >> 1) - 1; + + if (be::swap(pTable->index_to_loc_format) + == Sfnt::FontHeader::LongIndexLocFormat) + // loca entries are four bytes + return (lLocaSize >> 2) - 1; + + return -1; + //throw std::domain_error("head table in inconsistent state. The font may be corrupted"); +} +#endif + +/*---------------------------------------------------------------------------------------------- + Return the design units the font is designed with +----------------------------------------------------------------------------------------------*/ +int DesignUnits(const void * pHead) +{ + const Sfnt::FontHeader * pTable = + reinterpret_cast(pHead); + + return be::swap(pTable->units_per_em); +} + +#ifdef ALL_TTFUTILS +/*---------------------------------------------------------------------------------------------- + Return the checksum from the head table, which serves as a unique identifer for the font. +----------------------------------------------------------------------------------------------*/ +int HeadTableCheckSum(const void * pHead) +{ + const Sfnt::FontHeader * pTable = + reinterpret_cast(pHead); + + return be::swap(pTable->check_sum_adjustment); +} + +/*---------------------------------------------------------------------------------------------- + Return the create time from the head table. This consists of a 64-bit integer, which + we return here as two 32-bit integers. + + Note: this method is not currently used by the Graphite engine. +----------------------------------------------------------------------------------------------*/ +void HeadTableCreateTime(const void * pHead, + unsigned int * pnDateBC, unsigned int * pnDateAD) +{ + const Sfnt::FontHeader * pTable = + reinterpret_cast(pHead); + + *pnDateBC = be::swap(pTable->created[0]); + *pnDateAD = be::swap(pTable->created[1]); +} + +/*---------------------------------------------------------------------------------------------- + Return the modify time from the head table.This consists of a 64-bit integer, which + we return here as two 32-bit integers. + + Note: this method is not currently used by the Graphite engine. +----------------------------------------------------------------------------------------------*/ +void HeadTableModifyTime(const void * pHead, + unsigned int * pnDateBC, unsigned int *pnDateAD) +{ + const Sfnt::FontHeader * pTable = + reinterpret_cast(pHead); + + *pnDateBC = be::swap(pTable->modified[0]); + *pnDateAD = be::swap(pTable->modified[1]); +} + +/*---------------------------------------------------------------------------------------------- + Return true if the font is italic. +----------------------------------------------------------------------------------------------*/ +bool IsItalic(const void * pHead) +{ + const Sfnt::FontHeader * pTable = + reinterpret_cast(pHead); + + return ((be::swap(pTable->mac_style) & 0x00000002) != 0); +} + +/*---------------------------------------------------------------------------------------------- + Return the ascent for the font +----------------------------------------------------------------------------------------------*/ +int FontAscent(const void * pOs2) +{ + const Sfnt::Compatibility * pTable = reinterpret_cast(pOs2); + + return be::swap(pTable->win_ascent); +} + +/*---------------------------------------------------------------------------------------------- + Return the descent for the font +----------------------------------------------------------------------------------------------*/ +int FontDescent(const void * pOs2) +{ + const Sfnt::Compatibility * pTable = reinterpret_cast(pOs2); + + return be::swap(pTable->win_descent); +} + +/*---------------------------------------------------------------------------------------------- + Get the bold and italic style bits. + Return true if successful. false otherwise. + In addition to checking the OS/2 table, one could also check + the head table's macStyle field (overridden by the OS/2 table on Win) + the sub-family name in the name table (though this can contain oblique, dark, etc too) +----------------------------------------------------------------------------------------------*/ +bool FontOs2Style(const void *pOs2, bool & fBold, bool & fItalic) +{ + const Sfnt::Compatibility * pTable = reinterpret_cast(pOs2); + + fBold = (be::swap(pTable->fs_selection) & Sfnt::Compatibility::Bold) != 0; + fItalic = (be::swap(pTable->fs_selection) & Sfnt::Compatibility::Italic) != 0; + + return true; +} +#endif + +/*---------------------------------------------------------------------------------------------- + Method for searching name table. +----------------------------------------------------------------------------------------------*/ +bool GetNameInfo(const void * pName, int nPlatformId, int nEncodingId, + int nLangId, int nNameId, size_t & lOffset, size_t & lSize) +{ + lOffset = 0; + lSize = 0; + + const Sfnt::FontNames * pTable = reinterpret_cast(pName); + uint16 cRecord = be::swap(pTable->count); + uint16 nRecordOffset = be::swap(pTable->string_offset); + const Sfnt::NameRecord * pRecord = reinterpret_cast(pTable + 1); + + for (int i = 0; i < cRecord; ++i) + { + if (be::swap(pRecord->platform_id) == nPlatformId && + be::swap(pRecord->platform_specific_id) == nEncodingId && + be::swap(pRecord->language_id) == nLangId && + be::swap(pRecord->name_id) == nNameId) + { + lOffset = be::swap(pRecord->offset) + nRecordOffset; + lSize = be::swap(pRecord->length); + return true; + } + pRecord++; + } + + return false; +} + +#ifdef ALL_TTFUTILS +/*---------------------------------------------------------------------------------------------- + Return all the lang-IDs that have data for the given name-IDs. Assume that there is room + in the return array (langIdList) for 128 items. The purpose of this method is to return + a list of all possible lang-IDs. +----------------------------------------------------------------------------------------------*/ +int GetLangsForNames(const void * pName, int nPlatformId, int nEncodingId, + int * nameIdList, int cNameIds, short * langIdList) +{ + const Sfnt::FontNames * pTable = reinterpret_cast(pName); + int cLangIds = 0; + uint16 cRecord = be::swap(pTable->count); + if (cRecord > 127) return cLangIds; + //uint16 nRecordOffset = swapw(pTable->stringOffset); + const Sfnt::NameRecord * pRecord = reinterpret_cast(pTable + 1); + + for (int i = 0; i < cRecord; ++i) + { + if (be::swap(pRecord->platform_id) == nPlatformId && + be::swap(pRecord->platform_specific_id) == nEncodingId) + { + bool fNameFound = false; + int nLangId = be::swap(pRecord->language_id); + int nNameId = be::swap(pRecord->name_id); + for (int j = 0; j < cNameIds; j++) + { + if (nNameId == nameIdList[j]) + { + fNameFound = true; + break; + } + } + if (fNameFound) + { + // Add it if it's not there. + int ilang; + for (ilang = 0; ilang < cLangIds; ilang++) + if (langIdList[ilang] == nLangId) + break; + if (ilang >= cLangIds) + { + langIdList[cLangIds] = short(nLangId); + cLangIds++; + } + if (cLangIds == 128) + return cLangIds; + } + } + pRecord++; + } + + return cLangIds; +} + +/*---------------------------------------------------------------------------------------------- + Get the offset and size of the font family name in English for the MS Platform with Unicode + writing system. The offset is within the pName data. The string is double byte with MSB + first. +----------------------------------------------------------------------------------------------*/ +bool Get31EngFamilyInfo(const void * pName, size_t & lOffset, size_t & lSize) +{ + return GetNameInfo(pName, Sfnt::NameRecord::Microsoft, 1, 1033, + Sfnt::NameRecord::Family, lOffset, lSize); +} + +/*---------------------------------------------------------------------------------------------- + Get the offset and size of the full font name in English for the MS Platform with Unicode + writing system. The offset is within the pName data. The string is double byte with MSB + first. + + Note: this method is not currently used by the Graphite engine. +----------------------------------------------------------------------------------------------*/ +bool Get31EngFullFontInfo(const void * pName, size_t & lOffset, size_t & lSize) +{ + return GetNameInfo(pName, Sfnt::NameRecord::Microsoft, 1, 1033, + Sfnt::NameRecord::Fullname, lOffset, lSize); +} + +/*---------------------------------------------------------------------------------------------- + Get the offset and size of the font family name in English for the MS Platform with Symbol + writing system. The offset is within the pName data. The string is double byte with MSB + first. +----------------------------------------------------------------------------------------------*/ +bool Get30EngFamilyInfo(const void * pName, size_t & lOffset, size_t & lSize) +{ + return GetNameInfo(pName, Sfnt::NameRecord::Microsoft, 0, 1033, + Sfnt::NameRecord::Family, lOffset, lSize); +} + +/*---------------------------------------------------------------------------------------------- + Get the offset and size of the full font name in English for the MS Platform with Symbol + writing system. The offset is within the pName data. The string is double byte with MSB + first. + + Note: this method is not currently used by the Graphite engine. +----------------------------------------------------------------------------------------------*/ +bool Get30EngFullFontInfo(const void * pName, size_t & lOffset, size_t & lSize) +{ + return GetNameInfo(pName, Sfnt::NameRecord::Microsoft, 0, 1033, + Sfnt::NameRecord::Fullname, lOffset, lSize); +} + +/*---------------------------------------------------------------------------------------------- + Return the Glyph ID for a given Postscript name. This method finds the first glyph which + matches the requested Postscript name. Ideally every glyph should have a unique Postscript + name (except for special names such as .notdef), but this is not always true. + On failure return value less than zero. + -1 - table search failed + -2 - format 3 table (no Postscript glyph info) + -3 - other failures + + Note: this method is not currently used by the Graphite engine. +----------------------------------------------------------------------------------------------*/ +int PostLookup(const void * pPost, size_t lPostSize, const void * pMaxp, + const char * pPostName) +{ + using namespace Sfnt; + + const Sfnt::PostScriptGlyphName * pTable + = reinterpret_cast(pPost); + fixed format = be::swap(pTable->format); + + if (format == PostScriptGlyphName::Format3) + { // format 3 - no Postscript glyph info in font + return -2; + } + + // search for given Postscript name among the standard names + int iPostName = -1; // index in standard names + for (int i = 0; i < kcPostNames; i++) + { + if (!strcmp(pPostName, rgPostName[i])) + { + iPostName = i; + break; + } + } + + if (format == PostScriptGlyphName::Format1) + { // format 1 - use standard Postscript names + return iPostName; + } + + if (format == PostScriptGlyphName::Format25) + { + if (iPostName == -1) + return -1; + + const PostScriptGlyphName25 * pTable25 + = static_cast(pTable); + int cnGlyphs = GlyphCount(pMaxp); + for (gid16 nGlyphId = 0; nGlyphId < cnGlyphs && nGlyphId < kcPostNames; + nGlyphId++) + { // glyph_name_index25 contains bytes so no byte swapping needed + // search for first glyph id that uses the standard name + if (nGlyphId + pTable25->offset[nGlyphId] == iPostName) + return nGlyphId; + } + } + + if (format == PostScriptGlyphName::Format2) + { // format 2 + const PostScriptGlyphName2 * pTable2 + = static_cast(pTable); + + int cnGlyphs = be::swap(pTable2->number_of_glyphs); + + if (iPostName != -1) + { // did match a standard name, look for first glyph id mapped to that name + for (gid16 nGlyphId = 0; nGlyphId < cnGlyphs; nGlyphId++) + { + if (be::swap(pTable2->glyph_name_index[nGlyphId]) == iPostName) + return nGlyphId; + } + } + + { // did not match a standard name, search font specific names + size_t nStrSizeGoal = strlen(pPostName); + const char * pFirstGlyphName = reinterpret_cast( + &pTable2->glyph_name_index[0] + cnGlyphs); + const char * pGlyphName = pFirstGlyphName; + int iInNames = 0; // index in font specific names + bool fFound = false; + const char * const endOfTable + = reinterpret_cast(pTable2) + lPostSize; + while (pGlyphName < endOfTable && !fFound) + { // search Pascal strings for first matching name + size_t nStringSize = size_t(*pGlyphName); + if (nStrSizeGoal != nStringSize || + strncmp(pGlyphName + 1, pPostName, nStringSize)) + { // did not match + ++iInNames; + pGlyphName += nStringSize + 1; + } + else + { // did match + fFound = true; + } + } + if (!fFound) + return -1; // no font specific name matches request + + iInNames += kcPostNames; + for (gid16 nGlyphId = 0; nGlyphId < cnGlyphs; nGlyphId++) + { // search for first glyph id that maps to the found string index + if (be::swap(pTable2->glyph_name_index[nGlyphId]) == iInNames) + return nGlyphId; + } + return -1; // no glyph mapped to this index (very strange) + } + } + + return -3; +} + +/*---------------------------------------------------------------------------------------------- + Convert a Unicode character string from big endian (MSB first, Motorola) format to little + endian (LSB first, Intel) format. + nSize is the number of Unicode characters in the string. It should not include any + terminating null. If nSize is 0, it is assumed the string is null terminated. nSize + defaults to 0. + Return true if successful, false otherwise. +----------------------------------------------------------------------------------------------*/ +void SwapWString(void * pWStr, size_t nSize /* = 0 */) //throw (std::invalid_argument) +{ + if (pWStr == 0) + { +// throw std::invalid_argument("null pointer given"); + return; + } + + uint16 * pStr = reinterpret_cast(pWStr); + uint16 * const pStrEnd = pStr + (nSize == 0 ? wcslen((const wchar_t*)pStr) : nSize); + + for (; pStr != pStrEnd; ++pStr) + *pStr = be::swap(*pStr); +// std::transform(pStr, pStrEnd, pStr, read); + +// for (int i = 0; i < nSize; i++) +// { // swap the wide characters in the string +// pStr[i] = utf16(be::swap(uint16(pStr[i]))); +// } +} +#endif + +/*---------------------------------------------------------------------------------------------- + Get the left-side bearing and and advance width based on the given tables and Glyph ID + Return true if successful, false otherwise. On false, one or both value could be INT_MIN +----------------------------------------------------------------------------------------------*/ +bool HorMetrics(gid16 nGlyphId, const void * pHmtx, size_t lHmtxSize, const void * pHhea, + int & nLsb, unsigned int & nAdvWid) +{ + const Sfnt::HorizontalMetric * phmtx = + reinterpret_cast(pHmtx); + + const Sfnt::HorizontalHeader * phhea = + reinterpret_cast(pHhea); + + size_t cLongHorMetrics = be::swap(phhea->num_long_hor_metrics); + if (nGlyphId < cLongHorMetrics) + { // glyph id is acceptable + if (nGlyphId * sizeof(Sfnt::HorizontalMetric) >= lHmtxSize) return false; + nAdvWid = be::swap(phmtx[nGlyphId].advance_width); + nLsb = be::swap(phmtx[nGlyphId].left_side_bearing); + } + else + { + // guard against bad glyph id + size_t lLsbOffset = sizeof(Sfnt::HorizontalMetric) * cLongHorMetrics + + sizeof(int16) * (nGlyphId - cLongHorMetrics); // offset in bytes + // We test like this as LsbOffset is an offset not a length. + if (lLsbOffset > lHmtxSize - sizeof(int16)) + { + nLsb = 0; + return false; + } + nAdvWid = be::swap(phmtx[cLongHorMetrics - 1].advance_width); + nLsb = be::peek(reinterpret_cast(phmtx) + lLsbOffset); + } + + return true; +} + +/*---------------------------------------------------------------------------------------------- + Return a pointer to the requested cmap subtable. By default find the Microsoft Unicode + subtable. Pass nEncoding as -1 to find first table that matches only nPlatformId. + Return NULL if the subtable cannot be found. +----------------------------------------------------------------------------------------------*/ +const void * FindCmapSubtable(const void * pCmap, int nPlatformId, /* =3 */ int nEncodingId, /* = 1 */ size_t length) +{ + const Sfnt::CharacterCodeMap * pTable = reinterpret_cast(pCmap); + uint16 csuPlatforms = be::swap(pTable->num_subtables); + if (length && (sizeof(Sfnt::CharacterCodeMap) + 8 * (csuPlatforms - 1) > length)) + return NULL; + for (int i = 0; i < csuPlatforms; i++) + { + if (be::swap(pTable->encoding[i].platform_id) == nPlatformId && + (nEncodingId == -1 || be::swap(pTable->encoding[i].platform_specific_id) == nEncodingId)) + { + uint32 offset = be::swap(pTable->encoding[i].offset); + const uint8 * pRtn = reinterpret_cast(pCmap) + offset; + if (length) + { + if (offset > length) return NULL; + uint16 format = be::read(pRtn); + if (format == 4) + { + uint16 subTableLength = be::peek(pRtn); + if (i + 1 == csuPlatforms) + { + if (subTableLength > length - offset) + return NULL; + } + else if (subTableLength > be::swap(pTable->encoding[i+1].offset)) + return NULL; + } + if (format == 12) + { + uint32 subTableLength = be::peek(pRtn); + if (i + 1 == csuPlatforms) + { + if (subTableLength > length - offset) + return NULL; + } + else if (subTableLength > be::swap(pTable->encoding[i+1].offset)) + return NULL; + } + } + return reinterpret_cast(pCmap) + offset; + } + } + + return 0; +} + +/*---------------------------------------------------------------------------------------------- + Check the Microsoft Unicode subtable for expected values +----------------------------------------------------------------------------------------------*/ +bool CheckCmapSubtable4(const void * pCmapSubtable4) +{ + if (!pCmapSubtable4) return false; + const Sfnt::CmapSubTable * pTable = reinterpret_cast(pCmapSubtable4); + // Bob H says ome freeware TT fonts have version 1 (eg, CALIGULA.TTF) + // so don't check subtable version. 21 Mar 2002 spec changes version to language. + if (be::swap(pTable->format) != 4) return false; + const Sfnt::CmapSubTableFormat4 * pTable4 = reinterpret_cast(pCmapSubtable4); + uint16 length = be::swap(pTable4->length); + if (length < sizeof(Sfnt::CmapSubTableFormat4)) + return false; + uint16 nRanges = be::swap(pTable4->seg_count_x2) >> 1; + if (length < sizeof(Sfnt::CmapSubTableFormat4) + 4 * nRanges * sizeof(uint16)) + return false; + // check last range is properly terminated + uint16 chEnd = be::peek(pTable4->end_code + nRanges - 1); + return (chEnd == 0xFFFF); +} + +/*---------------------------------------------------------------------------------------------- + Return the Glyph ID for the given Unicode ID in the Microsoft Unicode subtable. + (Actually this code only depends on subtable being format 4.) + Return 0 if the Unicode ID is not in the subtable. +----------------------------------------------------------------------------------------------*/ +gid16 CmapSubtable4Lookup(const void * pCmapSubtabel4, unsigned int nUnicodeId, int rangeKey) +{ + const Sfnt::CmapSubTableFormat4 * pTable = reinterpret_cast(pCmapSubtabel4); + + uint16 nSeg = be::swap(pTable->seg_count_x2) >> 1; + + uint16 n; + const uint16 * pLeft, * pMid; + uint16 cMid, chStart, chEnd; + + if (rangeKey) + { + pMid = &(pTable->end_code[rangeKey]); + chEnd = be::peek(pMid); + n = rangeKey; + } + else + { + // Binary search of the endCode[] array + pLeft = &(pTable->end_code[0]); + n = nSeg; + while (n > 0) + { + cMid = n >> 1; // Pick an element in the middle + pMid = pLeft + cMid; + chEnd = be::peek(pMid); + if (nUnicodeId <= chEnd) + { + if (cMid == 0 || nUnicodeId > be::peek(pMid -1)) + break; // Must be this seg or none! + n = cMid; // Continue on left side, omitting mid point + } + else + { + pLeft = pMid + 1; // Continue on right side, omitting mid point + n -= (cMid + 1); + } + } + + if (!n) + return 0; + } + + // Ok, we're down to one segment and pMid points to the endCode element + // Either this is it or none is. + + chStart = be::peek(pMid += nSeg + 1); + if (chEnd >= nUnicodeId && nUnicodeId >= chStart) + { + // Found correct segment. Find Glyph Id + int16 idDelta = be::peek(pMid += nSeg); + uint16 idRangeOffset = be::peek(pMid += nSeg); + + if (idRangeOffset == 0) + return (uint16)(idDelta + nUnicodeId); // must use modulus 2^16 + + // Look up value in glyphIdArray + size_t offset = (nUnicodeId - chStart) + (idRangeOffset >> 1) + + (reinterpret_cast(pMid) - reinterpret_cast(pTable)); + if (offset * 2 >= pTable->length) + return 0; + gid16 nGlyphId = be::peek(pMid + (nUnicodeId - chStart) + (idRangeOffset >> 1)); + // If this value is 0, return 0. Else add the idDelta + return nGlyphId ? nGlyphId + idDelta : 0; + } + + return 0; +} + +/*---------------------------------------------------------------------------------------------- + Return the next Unicode value in the cmap. Pass 0 to obtain the first item. + Returns 0xFFFF as the last item. + pRangeKey is an optional key that is used to optimize the search; its value is the range + in which the character is found. +----------------------------------------------------------------------------------------------*/ +unsigned int CmapSubtable4NextCodepoint(const void *pCmap31, unsigned int nUnicodeId, int * pRangeKey) +{ + const Sfnt::CmapSubTableFormat4 * pTable = reinterpret_cast(pCmap31); + + uint16 nRange = be::swap(pTable->seg_count_x2) >> 1; + + uint32 nUnicodePrev = (uint32)nUnicodeId; + + const uint16 * pStartCode = &(pTable->end_code[0]) + + nRange // length of end code array + + 1; // reserved word + + if (nUnicodePrev == 0) + { + // return the first codepoint. + if (pRangeKey) + *pRangeKey = 0; + return be::peek(pStartCode); + } + else if (nUnicodePrev >= 0xFFFF) + { + if (pRangeKey) + *pRangeKey = nRange - 1; + return 0xFFFF; + } + + int iRange = (pRangeKey) ? *pRangeKey : 0; + // Just in case we have a bad key: + while (iRange > 0 && be::peek(pStartCode + iRange) > nUnicodePrev) + iRange--; + while (be::peek(pTable->end_code + iRange) < nUnicodePrev) + iRange++; + + // Now iRange is the range containing nUnicodePrev. + unsigned int nStartCode = be::peek(pStartCode + iRange); + unsigned int nEndCode = be::peek(pTable->end_code + iRange); + + if (nStartCode > nUnicodePrev) + // Oops, nUnicodePrev is not in the cmap! Adjust so we get a reasonable + // answer this time around. + nUnicodePrev = nStartCode - 1; + + if (nEndCode > nUnicodePrev) + { + // Next is in the same range; it is the next successive codepoint. + if (pRangeKey) + *pRangeKey = iRange; + return nUnicodePrev + 1; + } + + // Otherwise the next codepoint is the first one in the next range. + // There is guaranteed to be a next range because there must be one that + // ends with 0xFFFF. + if (pRangeKey) + *pRangeKey = iRange + 1; + return be::peek(pStartCode + iRange + 1); +} + +/*---------------------------------------------------------------------------------------------- + Check the Microsoft UCS-4 subtable for expected values. +----------------------------------------------------------------------------------------------*/ +bool CheckCmapSubtable12(const void *pCmapSubtable12) +{ + if (!pCmapSubtable12) return false; + const Sfnt::CmapSubTable * pTable = reinterpret_cast(pCmapSubtable12); + if (be::swap(pTable->format) != 12) + return false; + const Sfnt::CmapSubTableFormat12 * pTable12 = reinterpret_cast(pCmapSubtable12); + uint32 length = be::swap(pTable12->length); + if (length < sizeof(Sfnt::CmapSubTableFormat12)) + return false; + + return (length == (sizeof(Sfnt::CmapSubTableFormat12) + (be::swap(pTable12->num_groups) - 1) + * sizeof(uint32) * 3)); +} + +/*---------------------------------------------------------------------------------------------- + Return the Glyph ID for the given Unicode ID in the Microsoft UCS-4 subtable. + (Actually this code only depends on subtable being format 12.) + Return 0 if the Unicode ID is not in the subtable. +----------------------------------------------------------------------------------------------*/ +gid16 CmapSubtable12Lookup(const void * pCmap310, unsigned int uUnicodeId, int rangeKey) +{ + const Sfnt::CmapSubTableFormat12 * pTable = reinterpret_cast(pCmap310); + + //uint32 uLength = be::swap(pTable->length); //could use to test for premature end of table + uint32 ucGroups = be::swap(pTable->num_groups); + + for (unsigned int i = rangeKey; i < ucGroups; i++) + { + uint32 uStartCode = be::swap(pTable->group[i].start_char_code); + uint32 uEndCode = be::swap(pTable->group[i].end_char_code); + if (uUnicodeId >= uStartCode && uUnicodeId <= uEndCode) + { + uint32 uDiff = uUnicodeId - uStartCode; + uint32 uStartGid = be::swap(pTable->group[i].start_glyph_id); + return static_cast(uStartGid + uDiff); + } + } + + return 0; +} + +/*---------------------------------------------------------------------------------------------- + Return the next Unicode value in the cmap. Pass 0 to obtain the first item. + Returns 0x10FFFF as the last item. + pRangeKey is an optional key that is used to optimize the search; its value is the range + in which the character is found. +----------------------------------------------------------------------------------------------*/ +unsigned int CmapSubtable12NextCodepoint(const void *pCmap310, unsigned int nUnicodeId, int * pRangeKey) +{ + const Sfnt::CmapSubTableFormat12 * pTable = reinterpret_cast(pCmap310); + + int nRange = be::swap(pTable->num_groups); + + uint32 nUnicodePrev = (uint32)nUnicodeId; + + if (nUnicodePrev == 0) + { + // return the first codepoint. + if (pRangeKey) + *pRangeKey = 0; + return be::swap(pTable->group[0].start_char_code); + } + else if (nUnicodePrev >= 0x10FFFF) + { + if (pRangeKey) + *pRangeKey = nRange; + return 0x10FFFF; + } + + int iRange = (pRangeKey) ? *pRangeKey : 0; + // Just in case we have a bad key: + while (iRange > 0 && be::swap(pTable->group[iRange].start_char_code) > nUnicodePrev) + iRange--; + while (be::swap(pTable->group[iRange].end_char_code) < nUnicodePrev) + iRange++; + + // Now iRange is the range containing nUnicodePrev. + + unsigned int nStartCode = be::swap(pTable->group[iRange].start_char_code); + unsigned int nEndCode = be::swap(pTable->group[iRange].end_char_code); + + if (nStartCode > nUnicodePrev) + // Oops, nUnicodePrev is not in the cmap! Adjust so we get a reasonable + // answer this time around. + nUnicodePrev = nStartCode - 1; + + if (nEndCode > nUnicodePrev) + { + // Next is in the same range; it is the next successive codepoint. + if (pRangeKey) + *pRangeKey = iRange; + return nUnicodePrev + 1; + } + + // Otherwise the next codepoint is the first one in the next range, or 10FFFF if we're done. + if (pRangeKey) + *pRangeKey = iRange + 1; + return (iRange + 1 >= nRange) ? 0x10FFFF : be::swap(pTable->group[iRange + 1].start_char_code); +} + +/*---------------------------------------------------------------------------------------------- + Return the offset stored in the loca table for the given Glyph ID. + (This offset is into the glyf table.) + Return -1 if the lookup failed. + Technically this method should return an unsigned long but it is unlikely the offset will + exceed 2^31. +----------------------------------------------------------------------------------------------*/ +size_t LocaLookup(gid16 nGlyphId, + const void * pLoca, size_t lLocaSize, + const void * pHead) // throw (std::out_of_range) +{ + const Sfnt::FontHeader * pTable = reinterpret_cast(pHead); + + // CheckTable verifies the index_to_loc_format is valid + if (be::swap(pTable->index_to_loc_format) == Sfnt::FontHeader::ShortIndexLocFormat) + { // loca entries are two bytes and have been divided by two + if (nGlyphId < (lLocaSize >> 1) - 1) // allow sentinel value to be accessed + { + const uint16 * pShortTable = reinterpret_cast(pLoca); + return (be::peek(pShortTable + nGlyphId) << 1); + } + } + + if (be::swap(pTable->index_to_loc_format) == Sfnt::FontHeader::LongIndexLocFormat) + { // loca entries are four bytes + if (nGlyphId < (lLocaSize >> 2) - 1) + { + const uint32 * pLongTable = reinterpret_cast(pLoca); + return be::peek(pLongTable + nGlyphId); + } + } + + // only get here if glyph id was bad + return -1; + //throw std::out_of_range("glyph id out of range for font"); +} + +/*---------------------------------------------------------------------------------------------- + Return a pointer into the glyf table based on the given offset (from LocaLookup). + Return NULL on error. +----------------------------------------------------------------------------------------------*/ +void * GlyfLookup(const void * pGlyf, size_t nGlyfOffset, size_t nTableLen) +{ + const uint8 * pByte = reinterpret_cast(pGlyf); + if (nGlyfOffset == size_t(-1) || nGlyfOffset >= nTableLen) + return NULL; + return const_cast(pByte + nGlyfOffset); +} + +/*---------------------------------------------------------------------------------------------- + Get the bounding box coordinates for a simple glyf entry (non-composite). + Return true if successful, false otherwise. +----------------------------------------------------------------------------------------------*/ +bool GlyfBox(const void * pSimpleGlyf, int & xMin, int & yMin, + int & xMax, int & yMax) +{ + const Sfnt::Glyph * pGlyph = reinterpret_cast(pSimpleGlyf); + + xMin = be::swap(pGlyph->x_min); + yMin = be::swap(pGlyph->y_min); + xMax = be::swap(pGlyph->x_max); + yMax = be::swap(pGlyph->y_max); + + return true; +} + +#ifdef ALL_TTFUTILS +/*---------------------------------------------------------------------------------------------- + Return the number of contours for a simple glyf entry (non-composite) + Returning -1 means this is a composite glyph +----------------------------------------------------------------------------------------------*/ +int GlyfContourCount(const void * pSimpleGlyf) +{ + const Sfnt::Glyph * pGlyph = reinterpret_cast(pSimpleGlyf); + return be::swap(pGlyph->number_of_contours); // -1 means composite glyph +} + +/*---------------------------------------------------------------------------------------------- + Get the point numbers for the end points of the glyph contours for a simple + glyf entry (non-composite). + cnPointsTotal - count of contours from GlyfContourCount(); (same as number of end points) + prgnContourEndPoints - should point to a buffer large enough to hold cnPoints integers + cnPoints - count of points placed in above range + Return true if successful, false otherwise. + False could indicate a multi-level composite glyphs. +----------------------------------------------------------------------------------------------*/ +bool GlyfContourEndPoints(const void * pSimpleGlyf, int * prgnContourEndPoint, + int cnPointsTotal, int & cnPoints) +{ + const Sfnt::SimpleGlyph * pGlyph = reinterpret_cast(pSimpleGlyf); + + int cContours = be::swap(pGlyph->number_of_contours); + if (cContours < 0) + return false; // this method isn't supposed handle composite glyphs + + for (int i = 0; i < cContours && i < cnPointsTotal; i++) + { + prgnContourEndPoint[i] = be::swap(pGlyph->end_pts_of_contours[i]); + } + + cnPoints = cContours; + return true; +} + +/*---------------------------------------------------------------------------------------------- + Get the points for a simple glyf entry (non-composite) + cnPointsTotal - count of points from largest end point obtained from GlyfContourEndPoints + prgnX & prgnY - should point to buffers large enough to hold cnPointsTotal integers + The ranges are parallel so that coordinates for point(n) are found at offset n in both + ranges. This is raw point data with relative coordinates. + prgbFlag - should point to a buffer a large enough to hold cnPointsTotal bytes + This range is parallel to the prgnX & prgnY + cnPoints - count of points placed in above ranges + Return true if successful, false otherwise. + False could indicate a composite glyph +----------------------------------------------------------------------------------------------*/ +bool GlyfPoints(const void * pSimpleGlyf, int * prgnX, int * prgnY, + char * prgbFlag, int cnPointsTotal, int & cnPoints) +{ + using namespace Sfnt; + + const Sfnt::SimpleGlyph * pGlyph = reinterpret_cast(pSimpleGlyf); + int cContours = be::swap(pGlyph->number_of_contours); + // return false for composite glyph + if (cContours <= 0) + return false; + int cPts = be::swap(pGlyph->end_pts_of_contours[cContours - 1]) + 1; + if (cPts > cnPointsTotal) + return false; + + // skip over bounding box data & point to byte count of instructions (hints) + const uint8 * pbGlyph = reinterpret_cast + (&pGlyph->end_pts_of_contours[cContours]); + + // skip over hints & point to first flag + int cbHints = be::swap(*(uint16 *)pbGlyph); + pbGlyph += sizeof(uint16); + pbGlyph += cbHints; + + // load flags & point to first x coordinate + int iFlag = 0; + while (iFlag < cPts) + { + if (!(*pbGlyph & SimpleGlyph::Repeat)) + { // flag isn't repeated + prgbFlag[iFlag] = (char)*pbGlyph; + pbGlyph++; + iFlag++; + } + else + { // flag is repeated; count specified by next byte + char chFlag = (char)*pbGlyph; + pbGlyph++; + int cFlags = (int)*pbGlyph; + pbGlyph++; + prgbFlag[iFlag] = chFlag; + iFlag++; + for (int i = 0; i < cFlags; i++) + { + prgbFlag[iFlag + i] = chFlag; + } + iFlag += cFlags; + } + } + if (iFlag != cPts) + return false; + + // load x coordinates + iFlag = 0; + while (iFlag < cPts) + { + if (prgbFlag[iFlag] & SimpleGlyph::XShort) + { + prgnX[iFlag] = *pbGlyph; + if (!(prgbFlag[iFlag] & SimpleGlyph::XIsPos)) + { + prgnX[iFlag] = -prgnX[iFlag]; + } + pbGlyph++; + } + else + { + if (prgbFlag[iFlag] & SimpleGlyph::XIsSame) + { + prgnX[iFlag] = 0; + // do NOT increment pbGlyph + } + else + { + prgnX[iFlag] = be::swap(*(int16 *)pbGlyph); + pbGlyph += sizeof(int16); + } + } + iFlag++; + } + + // load y coordinates + iFlag = 0; + while (iFlag < cPts) + { + if (prgbFlag[iFlag] & SimpleGlyph::YShort) + { + prgnY[iFlag] = *pbGlyph; + if (!(prgbFlag[iFlag] & SimpleGlyph::YIsPos)) + { + prgnY[iFlag] = -prgnY[iFlag]; + } + pbGlyph++; + } + else + { + if (prgbFlag[iFlag] & SimpleGlyph::YIsSame) + { + prgnY[iFlag] = 0; + // do NOT increment pbGlyph + } + else + { + prgnY[iFlag] = be::swap(*(int16 *)pbGlyph); + pbGlyph += sizeof(int16); + } + } + iFlag++; + } + + cnPoints = cPts; + return true; +} + +/*---------------------------------------------------------------------------------------------- + Fill prgnCompId with the component Glyph IDs from pSimpleGlyf. + Client must allocate space before calling. + pSimpleGlyf - assumed to point to a composite glyph + cCompIdTotal - the number of elements in prgnCompId + cCompId - the total number of Glyph IDs stored in prgnCompId + Return true if successful, false otherwise + False could indicate a non-composite glyph or the input array was not big enough +----------------------------------------------------------------------------------------------*/ +bool GetComponentGlyphIds(const void * pSimpleGlyf, int * prgnCompId, + size_t cnCompIdTotal, size_t & cnCompId) +{ + using namespace Sfnt; + + if (GlyfContourCount(pSimpleGlyf) >= 0) + return false; + + const Sfnt::SimpleGlyph * pGlyph = reinterpret_cast(pSimpleGlyf); + // for a composite glyph, the special data begins here + const uint8 * pbGlyph = reinterpret_cast(&pGlyph->end_pts_of_contours[0]); + + uint16 GlyphFlags; + size_t iCurrentComp = 0; + do + { + GlyphFlags = be::swap(*((uint16 *)pbGlyph)); + pbGlyph += sizeof(uint16); + prgnCompId[iCurrentComp++] = be::swap(*((uint16 *)pbGlyph)); + pbGlyph += sizeof(uint16); + if (iCurrentComp >= cnCompIdTotal) + return false; + int nOffset = 0; + nOffset += GlyphFlags & CompoundGlyph::Arg1Arg2Words ? 4 : 2; + nOffset += GlyphFlags & CompoundGlyph::HaveScale ? 2 : 0; + nOffset += GlyphFlags & CompoundGlyph::HaveXAndYScale ? 4 : 0; + nOffset += GlyphFlags & CompoundGlyph::HaveTwoByTwo ? 8 : 0; + pbGlyph += nOffset; + } while (GlyphFlags & CompoundGlyph::MoreComponents); + + cnCompId = iCurrentComp; + + return true; +} + +/*---------------------------------------------------------------------------------------------- + Return info on how a component glyph is to be placed + pSimpleGlyph - assumed to point to a composite glyph + nCompId - glyph id for component of interest + bOffset - if true, a & b are the x & y offsets for this component + if false, b is the point on this component that is attaching to point a on the + preceding glyph + Return true if successful, false otherwise + False could indicate a non-composite glyph or that component wasn't found +----------------------------------------------------------------------------------------------*/ +bool GetComponentPlacement(const void * pSimpleGlyf, int nCompId, + bool fOffset, int & a, int & b) +{ + using namespace Sfnt; + + if (GlyfContourCount(pSimpleGlyf) >= 0) + return false; + + const Sfnt::SimpleGlyph * pGlyph = reinterpret_cast(pSimpleGlyf); + // for a composite glyph, the special data begins here + const uint8 * pbGlyph = reinterpret_cast(&pGlyph->end_pts_of_contours[0]); + + uint16 GlyphFlags; + do + { + GlyphFlags = be::swap(*((uint16 *)pbGlyph)); + pbGlyph += sizeof(uint16); + if (be::swap(*((uint16 *)pbGlyph)) == nCompId) + { + pbGlyph += sizeof(uint16); // skip over glyph id of component + fOffset = (GlyphFlags & CompoundGlyph::ArgsAreXYValues) == CompoundGlyph::ArgsAreXYValues; + + if (GlyphFlags & CompoundGlyph::Arg1Arg2Words ) + { + a = be::swap(*(int16 *)pbGlyph); + pbGlyph += sizeof(int16); + b = be::swap(*(int16 *)pbGlyph); + pbGlyph += sizeof(int16); + } + else + { // args are signed bytes + a = *pbGlyph++; + b = *pbGlyph++; + } + return true; + } + pbGlyph += sizeof(uint16); // skip over glyph id of component + int nOffset = 0; + nOffset += GlyphFlags & CompoundGlyph::Arg1Arg2Words ? 4 : 2; + nOffset += GlyphFlags & CompoundGlyph::HaveScale ? 2 : 0; + nOffset += GlyphFlags & CompoundGlyph::HaveXAndYScale ? 4 : 0; + nOffset += GlyphFlags & CompoundGlyph::HaveTwoByTwo ? 8 : 0; + pbGlyph += nOffset; + } while (GlyphFlags & CompoundGlyph::MoreComponents); + + // didn't find requested component + fOffset = true; + a = 0; + b = 0; + return false; +} + +/*---------------------------------------------------------------------------------------------- + Return info on how a component glyph is to be transformed + pSimpleGlyph - assumed to point to a composite glyph + nCompId - glyph id for component of interest + flt11, flt11, flt11, flt11 - a 2x2 matrix giving the transform + bTransOffset - whether to transform the offset from above method + The spec is unclear about the meaning of this flag + Currently - initialize to true for MS rasterizer and false for Mac rasterizer, then + on return it will indicate whether transform should apply to offset (MSDN CD 10/99) + Return true if successful, false otherwise + False could indicate a non-composite glyph or that component wasn't found +----------------------------------------------------------------------------------------------*/ +bool GetComponentTransform(const void * pSimpleGlyf, int nCompId, + float & flt11, float & flt12, float & flt21, float & flt22, + bool & fTransOffset) +{ + using namespace Sfnt; + + if (GlyfContourCount(pSimpleGlyf) >= 0) + return false; + + const Sfnt::SimpleGlyph * pGlyph = reinterpret_cast(pSimpleGlyf); + // for a composite glyph, the special data begins here + const uint8 * pbGlyph = reinterpret_cast(&pGlyph->end_pts_of_contours[0]); + + uint16 GlyphFlags; + do + { + GlyphFlags = be::swap(*((uint16 *)pbGlyph)); + pbGlyph += sizeof(uint16); + if (be::swap(*((uint16 *)pbGlyph)) == nCompId) + { + pbGlyph += sizeof(uint16); // skip over glyph id of component + pbGlyph += GlyphFlags & CompoundGlyph::Arg1Arg2Words ? 4 : 2; // skip over placement data + + if (fTransOffset) // MS rasterizer + fTransOffset = !(GlyphFlags & CompoundGlyph::UnscaledOffset); + else // Apple rasterizer + fTransOffset = (GlyphFlags & CompoundGlyph::ScaledOffset) != 0; + + if (GlyphFlags & CompoundGlyph::HaveScale) + { + flt11 = fixed_to_float<14>(be::swap(*(uint16 *)pbGlyph)); + pbGlyph += sizeof(uint16); + flt12 = 0; + flt21 = 0; + flt22 = flt11; + } + else if (GlyphFlags & CompoundGlyph::HaveXAndYScale) + { + flt11 = fixed_to_float<14>(be::swap(*(uint16 *)pbGlyph)); + pbGlyph += sizeof(uint16); + flt12 = 0; + flt21 = 0; + flt22 = fixed_to_float<14>(be::swap(*(uint16 *)pbGlyph)); + pbGlyph += sizeof(uint16); + } + else if (GlyphFlags & CompoundGlyph::HaveTwoByTwo) + { + flt11 = fixed_to_float<14>(be::swap(*(uint16 *)pbGlyph)); + pbGlyph += sizeof(uint16); + flt12 = fixed_to_float<14>(be::swap(*(uint16 *)pbGlyph)); + pbGlyph += sizeof(uint16); + flt21 = fixed_to_float<14>(be::swap(*(uint16 *)pbGlyph)); + pbGlyph += sizeof(uint16); + flt22 = fixed_to_float<14>(be::swap(*(uint16 *)pbGlyph)); + pbGlyph += sizeof(uint16); + } + else + { // identity transform + flt11 = 1.0; + flt12 = 0.0; + flt21 = 0.0; + flt22 = 1.0; + } + return true; + } + pbGlyph += sizeof(uint16); // skip over glyph id of component + int nOffset = 0; + nOffset += GlyphFlags & CompoundGlyph::Arg1Arg2Words ? 4 : 2; + nOffset += GlyphFlags & CompoundGlyph::HaveScale ? 2 : 0; + nOffset += GlyphFlags & CompoundGlyph::HaveXAndYScale ? 4 : 0; + nOffset += GlyphFlags & CompoundGlyph::HaveTwoByTwo ? 8 : 0; + pbGlyph += nOffset; + } while (GlyphFlags & CompoundGlyph::MoreComponents); + + // didn't find requested component + fTransOffset = false; + flt11 = 1; + flt12 = 0; + flt21 = 0; + flt22 = 1; + return false; +} +#endif + +/*---------------------------------------------------------------------------------------------- + Return a pointer into the glyf table based on the given tables and Glyph ID + Since this method doesn't check for spaces, it is good to call IsSpace before using it. + Return NULL on error. +----------------------------------------------------------------------------------------------*/ +void * GlyfLookup(gid16 nGlyphId, const void * pGlyf, const void * pLoca, + size_t lGlyfSize, size_t lLocaSize, const void * pHead) +{ + // test for valid glyph id + // CheckTable verifies the index_to_loc_format is valid + + const Sfnt::FontHeader * pTable + = reinterpret_cast(pHead); + + if (be::swap(pTable->index_to_loc_format) == Sfnt::FontHeader::ShortIndexLocFormat) + { // loca entries are two bytes (and have been divided by two) + if (nGlyphId >= (lLocaSize >> 1) - 1) // don't allow nGlyphId to access sentinel + { +// throw std::out_of_range("glyph id out of range for font"); + return NULL; + } + } + if (be::swap(pTable->index_to_loc_format) == Sfnt::FontHeader::LongIndexLocFormat) + { // loca entries are four bytes + if (nGlyphId >= (lLocaSize >> 2) - 1) + { +// throw std::out_of_range("glyph id out of range for font"); + return NULL; + } + } + + long lGlyfOffset = LocaLookup(nGlyphId, pLoca, lLocaSize, pHead); + void * pSimpleGlyf = GlyfLookup(pGlyf, lGlyfOffset, lGlyfSize); // invalid loca offset returns null + return pSimpleGlyf; +} + +#ifdef ALL_TTFUTILS +/*---------------------------------------------------------------------------------------------- + Determine if a particular Glyph ID has any data in the glyf table. If it is white space, + there will be no glyf data, though there will be metric data in hmtx, etc. +----------------------------------------------------------------------------------------------*/ +bool IsSpace(gid16 nGlyphId, const void * pLoca, size_t lLocaSize, const void * pHead) +{ + size_t lGlyfOffset = LocaLookup(nGlyphId, pLoca, lLocaSize, pHead); + + // the +1 should always work because there is a sentinel value at the end of the loca table + size_t lNextGlyfOffset = LocaLookup(nGlyphId + 1, pLoca, lLocaSize, pHead); + + return (lNextGlyfOffset - lGlyfOffset) == 0; +} + +/*---------------------------------------------------------------------------------------------- + Determine if a particular Glyph ID is a multi-level composite. +----------------------------------------------------------------------------------------------*/ +bool IsDeepComposite(gid16 nGlyphId, const void * pGlyf, const void * pLoca, + size_t lGlyfSize, long lLocaSize, const void * pHead) +{ + if (IsSpace(nGlyphId, pLoca, lLocaSize, pHead)) {return false;} + + void * pSimpleGlyf = GlyfLookup(nGlyphId, pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); + if (pSimpleGlyf == NULL) + return false; // no way to really indicate an error occured here + + if (GlyfContourCount(pSimpleGlyf) >= 0) + return false; + + int rgnCompId[kMaxGlyphComponents]; // assumes only a limited number of glyph components + size_t cCompIdTotal = kMaxGlyphComponents; + size_t cCompId = 0; + + if (!GetComponentGlyphIds(pSimpleGlyf, rgnCompId, cCompIdTotal, cCompId)) + return false; + + for (size_t i = 0; i < cCompId; i++) + { + pSimpleGlyf = GlyfLookup(static_cast(rgnCompId[i]), + pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); + if (pSimpleGlyf == NULL) {return false;} + + if (GlyfContourCount(pSimpleGlyf) < 0) + return true; + } + + return false; +} + +/*---------------------------------------------------------------------------------------------- + Get the bounding box coordinates based on the given tables and Glyph ID + Handles both simple and composite glyphs. + Return true if successful, false otherwise. On false, all point values will be INT_MIN + False may indicate a white space glyph +----------------------------------------------------------------------------------------------*/ +bool GlyfBox(gid16 nGlyphId, const void * pGlyf, const void * pLoca, + size_t lGlyfSize, size_t lLocaSize, const void * pHead, int & xMin, int & yMin, int & xMax, int & yMax) +{ + xMin = yMin = xMax = yMax = INT_MIN; + + if (IsSpace(nGlyphId, pLoca, lLocaSize, pHead)) {return false;} + + void * pSimpleGlyf = GlyfLookup(nGlyphId, pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); + if (pSimpleGlyf == NULL) {return false;} + + return GlyfBox(pSimpleGlyf, xMin, yMin, xMax, yMax); +} + +/*---------------------------------------------------------------------------------------------- + Get the number of contours based on the given tables and Glyph ID + Handles both simple and composite glyphs. + Return true if successful, false otherwise. On false, cnContours will be INT_MIN + False may indicate a white space glyph or a multi-level composite glyph. +----------------------------------------------------------------------------------------------*/ +bool GlyfContourCount(gid16 nGlyphId, const void * pGlyf, const void * pLoca, + size_t lGlyfSize, size_t lLocaSize, const void * pHead, size_t & cnContours) +{ + cnContours = static_cast(INT_MIN); + + if (IsSpace(nGlyphId, pLoca, lLocaSize, pHead)) {return false;} + + void * pSimpleGlyf = GlyfLookup(nGlyphId, pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); + if (pSimpleGlyf == NULL) {return false;} + + int cRtnContours = GlyfContourCount(pSimpleGlyf); + if (cRtnContours >= 0) + { + cnContours = size_t(cRtnContours); + return true; + } + + //handle composite glyphs + + int rgnCompId[kMaxGlyphComponents]; // assumes no glyph will be made of more than 8 components + size_t cCompIdTotal = kMaxGlyphComponents; + size_t cCompId = 0; + + if (!GetComponentGlyphIds(pSimpleGlyf, rgnCompId, cCompIdTotal, cCompId)) + return false; + + cRtnContours = 0; + int cTmp = 0; + for (size_t i = 0; i < cCompId; i++) + { + if (IsSpace(static_cast(rgnCompId[i]), pLoca, lLocaSize, pHead)) {return false;} + pSimpleGlyf = GlyfLookup(static_cast(rgnCompId[i]), + pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); + if (pSimpleGlyf == 0) {return false;} + // return false on multi-level composite + if ((cTmp = GlyfContourCount(pSimpleGlyf)) < 0) + return false; + cRtnContours += cTmp; + } + + cnContours = size_t(cRtnContours); + return true; +} + +/*---------------------------------------------------------------------------------------------- + Get the point numbers for the end points of the glyph contours based on the given tables + and Glyph ID + Handles both simple and composite glyphs. + cnPoints - count of contours from GlyfContourCount (same as number of end points) + prgnContourEndPoints - should point to a buffer large enough to hold cnPoints integers + Return true if successful, false otherwise. On false, all end points are INT_MIN + False may indicate a white space glyph or a multi-level composite glyph. +----------------------------------------------------------------------------------------------*/ +bool GlyfContourEndPoints(gid16 nGlyphId, const void * pGlyf, const void * pLoca, + size_t lGlyfSize, size_t lLocaSize, const void * pHead, + int * prgnContourEndPoint, size_t cnPoints) +{ + memset(prgnContourEndPoint, 0xFF, cnPoints * sizeof(int)); + // std::fill_n(prgnContourEndPoint, cnPoints, INT_MIN); + + if (IsSpace(nGlyphId, pLoca, lLocaSize, pHead)) {return false;} + + void * pSimpleGlyf = GlyfLookup(nGlyphId, pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); + if (pSimpleGlyf == NULL) {return false;} + + int cContours = GlyfContourCount(pSimpleGlyf); + int cActualPts = 0; + if (cContours > 0) + return GlyfContourEndPoints(pSimpleGlyf, prgnContourEndPoint, cnPoints, cActualPts); + + // handle composite glyphs + + int rgnCompId[kMaxGlyphComponents]; // assumes no glyph will be made of more than 8 components + size_t cCompIdTotal = kMaxGlyphComponents; + size_t cCompId = 0; + + if (!GetComponentGlyphIds(pSimpleGlyf, rgnCompId, cCompIdTotal, cCompId)) + return false; + + int * prgnCurrentEndPoint = prgnContourEndPoint; + int cCurrentPoints = cnPoints; + int nPrevPt = 0; + for (size_t i = 0; i < cCompId; i++) + { + if (IsSpace(static_cast(rgnCompId[i]), pLoca, lLocaSize, pHead)) {return false;} + pSimpleGlyf = GlyfLookup(static_cast(rgnCompId[i]), pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); + if (pSimpleGlyf == NULL) {return false;} + // returns false on multi-level composite + if (!GlyfContourEndPoints(pSimpleGlyf, prgnCurrentEndPoint, cCurrentPoints, cActualPts)) + return false; + // points in composite are numbered sequentially as components are added + // must adjust end point numbers for new point numbers + for (int j = 0; j < cActualPts; j++) + prgnCurrentEndPoint[j] += nPrevPt; + nPrevPt = prgnCurrentEndPoint[cActualPts - 1] + 1; + + prgnCurrentEndPoint += cActualPts; + cCurrentPoints -= cActualPts; + } + + return true; +} + +/*---------------------------------------------------------------------------------------------- + Get the points for a glyph based on the given tables and Glyph ID + Handles both simple and composite glyphs. + cnPoints - count of points from largest end point obtained from GlyfContourEndPoints + prgnX & prgnY - should point to buffers large enough to hold cnPoints integers + The ranges are parallel so that coordinates for point(n) are found at offset n in + both ranges. These points are in absolute coordinates. + prgfOnCurve - should point to a buffer a large enough to hold cnPoints bytes (bool) + This range is parallel to the prgnX & prgnY + Return true if successful, false otherwise. On false, all points may be INT_MIN + False may indicate a white space glyph, a multi-level composite, or a corrupt font + // TODO: doesn't support composite glyphs whose components are themselves components + It's not clear from the TTF spec when the transforms should be applied. Should the + transform be done before or after attachment point calcs? (current code - before) + Should the transform be applied to other offsets? (currently - no; however commented + out code is in place so that if CompoundGlyph::UnscaledOffset on the MS rasterizer is + clear (typical) then yes, and if CompoundGlyph::ScaledOffset on the Apple rasterizer is + clear (typical?) then no). See GetComponentTransform. + It's also unclear where point numbering with attachment poinst starts + (currently - first point number is relative to whole glyph, second point number is + relative to current glyph). +----------------------------------------------------------------------------------------------*/ +bool GlyfPoints(gid16 nGlyphId, const void * pGlyf, + const void * pLoca, size_t lGlyfSize, size_t lLocaSize, const void * pHead, + const int * /*prgnContourEndPoint*/, size_t /*cnEndPoints*/, + int * prgnX, int * prgnY, bool * prgfOnCurve, size_t cnPoints) +{ + memset(prgnX, 0x7F, cnPoints * sizeof(int)); + memset(prgnY, 0x7F, cnPoints * sizeof(int)); + + if (IsSpace(nGlyphId, pLoca, lLocaSize, pHead)) + return false; + + void * pSimpleGlyf = GlyfLookup(nGlyphId, pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); + if (pSimpleGlyf == NULL) + return false; + + int cContours = GlyfContourCount(pSimpleGlyf); + int cActualPts; + if (cContours > 0) + { + if (!GlyfPoints(pSimpleGlyf, prgnX, prgnY, (char *)prgfOnCurve, cnPoints, cActualPts)) + return false; + CalcAbsolutePoints(prgnX, prgnY, cnPoints); + SimplifyFlags((char *)prgfOnCurve, cnPoints); + return true; + } + + // handle composite glyphs + int rgnCompId[kMaxGlyphComponents]; // assumes no glyph will be made of more than 8 components + size_t cCompIdTotal = kMaxGlyphComponents; + size_t cCompId = 0; + + // this will fail if there are more components than there is room for + if (!GetComponentGlyphIds(pSimpleGlyf, rgnCompId, cCompIdTotal, cCompId)) + return false; + + int * prgnCurrentX = prgnX; + int * prgnCurrentY = prgnY; + char * prgbCurrentFlag = (char *)prgfOnCurve; // converting bool to char should be safe + int cCurrentPoints = cnPoints; + bool fOffset = true, fTransOff = true; + int a, b; + float flt11, flt12, flt21, flt22; + // int * prgnPrevX = prgnX; // in case first att pt number relative to preceding glyph + // int * prgnPrevY = prgnY; + for (size_t i = 0; i < cCompId; i++) + { + if (IsSpace(static_cast(rgnCompId[i]), pLoca, lLocaSize, pHead)) {return false;} + void * pCompGlyf = GlyfLookup(static_cast(rgnCompId[i]), pGlyf, pLoca, lGlyfSize, lLocaSize, pHead); + if (pCompGlyf == NULL) {return false;} + // returns false on multi-level composite + if (!GlyfPoints(pCompGlyf, prgnCurrentX, prgnCurrentY, prgbCurrentFlag, + cCurrentPoints, cActualPts)) + return false; + if (!GetComponentPlacement(pSimpleGlyf, rgnCompId[i], fOffset, a, b)) + return false; + if (!GetComponentTransform(pSimpleGlyf, rgnCompId[i], + flt11, flt12, flt21, flt22, fTransOff)) + return false; + bool fIdTrans = flt11 == 1.0 && flt12 == 0.0 && flt21 == 0.0 && flt22 == 1.0; + + // convert points to absolute coordinates + // do before transform and attachment point placement are applied + CalcAbsolutePoints(prgnCurrentX, prgnCurrentY, cActualPts); + + // apply transform - see main method note above + // do before attachment point calcs + if (!fIdTrans) + for (int j = 0; j < cActualPts; j++) + { + int x = prgnCurrentX[j]; // store before transform applied + int y = prgnCurrentY[j]; + prgnCurrentX[j] = (int)(x * flt11 + y * flt12); + prgnCurrentY[j] = (int)(x * flt21 + y * flt22); + } + + // apply placement - see main method note above + int nXOff, nYOff; + if (fOffset) // explicit x & y offsets + { + /* ignore fTransOff for now + if (fTransOff && !fIdTrans) + { // transform x & y offsets + nXOff = (int)(a * flt11 + b * flt12); + nYOff = (int)(a * flt21 + b * flt22); + } + else */ + { // don't transform offset + nXOff = a; + nYOff = b; + } + } + else // attachment points + { // in case first point is relative to preceding glyph and second relative to current + // nXOff = prgnPrevX[a] - prgnCurrentX[b]; + // nYOff = prgnPrevY[a] - prgnCurrentY[b]; + // first point number relative to whole composite, second relative to current glyph + nXOff = prgnX[a] - prgnCurrentX[b]; + nYOff = prgnY[a] - prgnCurrentY[b]; + } + for (int j = 0; j < cActualPts; j++) + { + prgnCurrentX[j] += nXOff; + prgnCurrentY[j] += nYOff; + } + + // prgnPrevX = prgnCurrentX; + // prgnPrevY = prgnCurrentY; + prgnCurrentX += cActualPts; + prgnCurrentY += cActualPts; + prgbCurrentFlag += cActualPts; + cCurrentPoints -= cActualPts; + } + + SimplifyFlags((char *)prgfOnCurve, cnPoints); + + return true; +} + +/*---------------------------------------------------------------------------------------------- + Simplify the meaning of flags to just indicate whether point is on-curve or off-curve. +---------------------------------------------------------------------------------------------*/ +bool SimplifyFlags(char * prgbFlags, int cnPoints) +{ + for (int i = 0; i < cnPoints; i++) + prgbFlags[i] = static_cast(prgbFlags[i] & Sfnt::SimpleGlyph::OnCurve); + return true; +} + +/*---------------------------------------------------------------------------------------------- + Convert relative point coordinates to absolute coordinates + Points are stored in the font such that they are offsets from one another except for the + first point of a glyph. +---------------------------------------------------------------------------------------------*/ +bool CalcAbsolutePoints(int * prgnX, int * prgnY, int cnPoints) +{ + int nX = prgnX[0]; + int nY = prgnY[0]; + for (int i = 1; i < cnPoints; i++) + { + prgnX[i] += nX; + nX = prgnX[i]; + prgnY[i] += nY; + nY = prgnY[i]; + } + + return true; +} +#endif + +/*---------------------------------------------------------------------------------------------- + Return the length of the 'name' table in bytes. + Currently used. +---------------------------------------------------------------------------------------------*/ +#if 0 +size_t NameTableLength(const byte * pTable) +{ + byte * pb = (const_cast(pTable)) + 2; // skip format + size_t cRecords = *pb++ << 8; cRecords += *pb++; + int dbStringOffset0 = (*pb++) << 8; dbStringOffset0 += *pb++; + int dbMaxStringOffset = 0; + for (size_t irec = 0; irec < cRecords; irec++) + { + int nPlatform = (*pb++) << 8; nPlatform += *pb++; + int nEncoding = (*pb++) << 8; nEncoding += *pb++; + int nLanguage = (*pb++) << 8; nLanguage += *pb++; + int nName = (*pb++) << 8; nName += *pb++; + int cbStringLen = (*pb++) << 8; cbStringLen += *pb++; + int dbStringOffset = (*pb++) << 8; dbStringOffset += *pb++; + if (dbMaxStringOffset < dbStringOffset + cbStringLen) + dbMaxStringOffset = dbStringOffset + cbStringLen; + } + return dbStringOffset0 + dbMaxStringOffset; +} +#endif + +} // end of namespace TtfUtil +} // end of namespace graphite diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/UtfCodec.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/UtfCodec.cpp new file mode 100644 index 00000000000..ca3c0c0a700 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/UtfCodec.cpp @@ -0,0 +1,45 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include "inc/UtfCodec.h" +//using namespace graphite2; + +namespace graphite2 { + +} + +using namespace graphite2; + +const int8 _utf_codec<8>::sz_lut[16] = +{ + 1,1,1,1,1,1,1,1, // 1 byte + 0,0,0,0, // trailing byte + 2,2, // 2 bytes + 3, // 3 bytes + 4 // 4 bytes +}; + +const byte _utf_codec<8>::mask_lut[5] = {0x7f, 0xff, 0x3f, 0x1f, 0x0f}; diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/call_machine.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/call_machine.cpp new file mode 100644 index 00000000000..f06f43cbda3 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/call_machine.cpp @@ -0,0 +1,135 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +// This call threaded interpreter implmentation for machine.h +// Author: Tim Eves + +// Build either this interpreter or the direct_machine implementation. +// The call threaded interpreter is portable across compilers and +// architectures as well as being useful to debug (you can set breakpoints on +// opcodes) but is slower that the direct threaded interpreter by a factor of 2 + +#include +#include +#include +#include "inc/Machine.h" +#include "inc/Segment.h" +#include "inc/Slot.h" +#include "inc/Rule.h" + +// Disable the unused parameter warning as th compiler is mistaken since dp +// is always updated (even if by 0) on every opcode. +#ifdef __GNUC__ +#pragma GCC diagnostic ignored "-Wunused-parameter" +#endif + +#define registers const byte * & dp, vm::Machine::stack_t * & sp, \ + vm::Machine::stack_t * const sb, regbank & reg + +// These are required by opcodes.h and should not be changed +#define STARTOP(name) bool name(registers) REGPARM(4);\ + bool name(registers) { +#define ENDOP return (sp - sb)/Machine::STACK_MAX==0; \ + } + +#define EXIT(status) { push(status); return false; } + +// This is required by opcode_table.h +#define do_(name) instr(name) + + +using namespace graphite2; +using namespace vm; + +struct regbank { + slotref is; + slotref * map; + SlotMap & smap; + slotref * const map_base; + const instr * & ip; + int8 flags; +}; + +typedef bool (* ip_t)(registers); + +// Pull in the opcode definitions +// We pull these into a private namespace so these otherwise common names dont +// pollute the toplevel namespace. +namespace { +#define smap reg.smap +#define seg smap.segment +#define is reg.is +#define ip reg.ip +#define map reg.map +#define mapb reg.map_base +#define flags reg.flags + +#include "inc/opcodes.h" + +#undef smap +#undef seg +#undef is +#undef ip +#undef map +#undef mapb +#undef flags +} + +Machine::stack_t Machine::run(const instr * program, + const byte * data, + slotref * & map) + +{ + assert(program != 0); + + // Declare virtual machine registers + const instr * ip = program-1; + const byte * dp = data; + stack_t * sp = _stack + Machine::STACK_GUARD, + * const sb = sp; + regbank reg = {*map, map, _map, _map.begin()+_map.context(), ip, 0}; + + // Run the program + while ((reinterpret_cast(*++ip))(dp, sp, sb, reg)) {} + const stack_t ret = sp == _stack+STACK_GUARD+1 ? *sp-- : 0; + + check_final_stack(sp); + map = reg.map; + *map = reg.is; + return ret; +} + +// Pull in the opcode table +namespace { +#include "inc/opcode_table.h" +} + +const opcode_t * Machine::getOpcodeTable() throw() +{ + return opcode_table; +} + + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/direct_machine.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/direct_machine.cpp new file mode 100644 index 00000000000..09709c30336 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/direct_machine.cpp @@ -0,0 +1,117 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +// This direct threaded interpreter implmentation for machine.h +// Author: Tim Eves + +// Build either this interpreter or the call_machine implementation. +// The direct threaded interpreter is relies upon a gcc feature called +// labels-as-values so is only portable to compilers that support the +// extension (gcc only as far as I know) however it should build on any +// architecture gcc supports. +// This is twice as fast as the call threaded model and is likely faster on +// inorder processors with short pipelines and little branch prediction such +// as the ARM and possibly Atom chips. + + +#include +#include +#include "inc/Machine.h" +#include "inc/Segment.h" +#include "inc/Slot.h" +#include "inc/Rule.h" + +#define STARTOP(name) name: { +#define ENDOP }; goto *((sp - sb)/Machine::STACK_MAX ? &&end : *++ip); +#define EXIT(status) { push(status); goto end; } + +#define do_(name) &&name + + +using namespace graphite2; +using namespace vm; + +namespace { + +const void * direct_run(const bool get_table_mode, + const instr * program, + const byte * data, + Machine::stack_t * stack, + slotref * & __map, + SlotMap * __smap=0) +{ + // We need to define and return to opcode table from within this function + // other inorder to take the addresses of the instruction bodies. + #include "inc/opcode_table.h" + if (get_table_mode) + return opcode_table; + + // Declare virtual machine registers + const instr * ip = program; + const byte * dp = data; + Machine::stack_t * sp = stack + Machine::STACK_GUARD, + * const sb = sp; + SlotMap & smap = *__smap; + Segment & seg = smap.segment; + slotref is = *__map, + * map = __map, + * const mapb = smap.begin()+smap.context(); + int8 flags = 0; + + // start the program + goto **ip; + + // Pull in the opcode definitions + #include "inc/opcodes.h" + + end: + __map = map; + *__map = is; + return sp; +} + +} + +const opcode_t * Machine::getOpcodeTable() throw() +{ + slotref * dummy; + return static_cast(direct_run(true, 0, 0, 0, dummy, 0)); +} + + +Machine::stack_t Machine::run(const instr * program, + const byte * data, + slotref * & is) +{ + assert(program != 0); + + const stack_t *sp = static_cast( + direct_run(false, program, data, _stack, is, &_map)); + const stack_t ret = sp == _stack+STACK_GUARD+1 ? *sp-- : 0; + check_final_stack(sp); + return ret; +} + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/files.mk b/Build/source/libs/graphite2/graphite2-1.2.1/src/files.mk new file mode 100644 index 00000000000..358acef62df --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/files.mk @@ -0,0 +1,115 @@ +# GRAPHITE2 LICENSING +# +# Copyright 2010, SIL International +# All rights reserved. +# +# This library is free software; you can redistribute it and/or modify +# it under the terms of the GNU Lesser General Public License as published +# by the Free Software Foundation; either version 2.1 of License, or +# (at your option) any later version. +# +# This program 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 for more details. +# +# You should also have received a copy of the GNU Lesser General Public +# License along with this library in the file named "LICENSE". +# If not, write to the Free Software Foundation, 51 Franklin Street, +# Suite 500, Boston, MA 02110-1335, USA or visit their web page on the +# internet at http://www.fsf.org/licenses/lgpl.html. +# +# Alternatively, the contents of this file may be used under the terms of the +# Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +# License, as published by the Free Software Foundation, either version 2 +# of the License or (at your option) any later version. + +# Makefile helper file for those wanting to build Graphite2 using make +# The including makefile should set the following variables +# _NS Prefix to all variables this file creates (namespace) +# $(_NS)_MACHINE Set to direct or call. Set to direct if using gcc else +# set to call +# $(_NS)_BASE path to root of graphite2 project +# +# Returns: +# $(_NS)_SOURCES List of source files (with .cpp extension) +# $(_NS)_PRIVATE_HEADERS List of private header files (with .h extension) +# $(_NS)_PUBLIC_HEADERS List of public header files (with .h extension) + + +$(_NS)_SOURCES = \ + $($(_NS)_BASE)/src/$($(_NS)_MACHINE)_machine.cpp \ + $($(_NS)_BASE)/src/gr_char_info.cpp \ + $($(_NS)_BASE)/src/gr_face.cpp \ + $($(_NS)_BASE)/src/gr_features.cpp \ + $($(_NS)_BASE)/src/gr_font.cpp \ + $($(_NS)_BASE)/src/gr_logging.cpp \ + $($(_NS)_BASE)/src/gr_segment.cpp \ + $($(_NS)_BASE)/src/gr_slot.cpp \ + $($(_NS)_BASE)/src/json.cpp \ + $($(_NS)_BASE)/src/Bidi.cpp \ + $($(_NS)_BASE)/src/CachedFace.cpp \ + $($(_NS)_BASE)/src/CmapCache.cpp \ + $($(_NS)_BASE)/src/Code.cpp \ + $($(_NS)_BASE)/src/Face.cpp \ + $($(_NS)_BASE)/src/FeatureMap.cpp \ + $($(_NS)_BASE)/src/FileFace.cpp \ + $($(_NS)_BASE)/src/Font.cpp \ + $($(_NS)_BASE)/src/GlyphCache.cpp \ + $($(_NS)_BASE)/src/GlyphFace.cpp \ + $($(_NS)_BASE)/src/Justifier.cpp \ + $($(_NS)_BASE)/src/NameTable.cpp \ + $($(_NS)_BASE)/src/Pass.cpp \ + $($(_NS)_BASE)/src/SegCache.cpp \ + $($(_NS)_BASE)/src/SegCacheEntry.cpp \ + $($(_NS)_BASE)/src/SegCacheStore.cpp \ + $($(_NS)_BASE)/src/Segment.cpp \ + $($(_NS)_BASE)/src/Silf.cpp \ + $($(_NS)_BASE)/src/Slot.cpp \ + $($(_NS)_BASE)/src/Sparse.cpp \ + $($(_NS)_BASE)/src/TtfUtil.cpp \ + $($(_NS)_BASE)/src/UtfCodec.cpp + +$(_NS)_PRIVATE_HEADERS = \ + $($(_NS)_BASE)/src/inc/bits.h \ + $($(_NS)_BASE)/src/inc/debug.h \ + $($(_NS)_BASE)/src/inc/json.h \ + $($(_NS)_BASE)/src/inc/CachedFace.h \ + $($(_NS)_BASE)/src/inc/CharInfo.h \ + $($(_NS)_BASE)/src/inc/CmapCache.h \ + $($(_NS)_BASE)/src/inc/Code.h \ + $($(_NS)_BASE)/src/inc/Endian.h \ + $($(_NS)_BASE)/src/inc/Face.h \ + $($(_NS)_BASE)/src/inc/FeatureMap.h \ + $($(_NS)_BASE)/src/inc/FeatureVal.h \ + $($(_NS)_BASE)/src/inc/FileFace.h \ + $($(_NS)_BASE)/src/inc/Font.h \ + $($(_NS)_BASE)/src/inc/GlyphCache.h \ + $($(_NS)_BASE)/src/inc/GlyphFace.h \ + $($(_NS)_BASE)/src/inc/List.h \ + $($(_NS)_BASE)/src/inc/locale2lcid.h \ + $($(_NS)_BASE)/src/inc/Machine.h \ + $($(_NS)_BASE)/src/inc/Main.h \ + $($(_NS)_BASE)/src/inc/NameTable.h \ + $($(_NS)_BASE)/src/inc/opcode_table.h \ + $($(_NS)_BASE)/src/inc/opcodes.h \ + $($(_NS)_BASE)/src/inc/Pass.h \ + $($(_NS)_BASE)/src/inc/Position.h \ + $($(_NS)_BASE)/src/inc/Rule.h \ + $($(_NS)_BASE)/src/inc/SegCache.h \ + $($(_NS)_BASE)/src/inc/SegCacheEntry.h \ + $($(_NS)_BASE)/src/inc/SegCacheStore.h \ + $($(_NS)_BASE)/src/inc/Segment.h \ + $($(_NS)_BASE)/src/inc/Silf.h \ + $($(_NS)_BASE)/src/inc/Slot.h \ + $($(_NS)_BASE)/src/inc/Sparse.h \ + $($(_NS)_BASE)/src/inc/TtfTypes.h \ + $($(_NS)_BASE)/src/inc/TtfUtil.h \ + $($(_NS)_BASE)/src/inc/UtfCodec.h + +$(_NS)_PUBLIC_HEADERS = \ + $($(_NS)_BASE)/include/graphite2/Font.h \ + $($(_NS)_BASE)/include/graphite2/Log.h \ + $($(_NS)_BASE)/include/graphite2/Segment.h \ + $($(_NS)_BASE)/include/graphite2/Types.h + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_char_info.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_char_info.cpp new file mode 100644 index 00000000000..ebcb68e593f --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_char_info.cpp @@ -0,0 +1,65 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include +#include "graphite2/Segment.h" +#include "inc/CharInfo.h" + +extern "C" +{ + +unsigned int gr_cinfo_unicode_char(const gr_char_info* p/*not NULL*/) +{ + assert(p); + return p->unicodeChar(); +} + + +int gr_cinfo_break_weight(const gr_char_info* p/*not NULL*/) +{ + assert(p); + return p->breakWeight(); +} + +int gr_cinfo_after(const gr_char_info *p/*not NULL*/) +{ + assert(p); + return p->after(); +} + +int gr_cinfo_before(const gr_char_info *p/*not NULL*/) +{ + assert(p); + return p->before(); +} + +size_t gr_cinfo_base(const gr_char_info *p/*not NULL*/) +{ + assert(p); + return p->base(); +} + +} // extern "C" diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_face.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_face.cpp new file mode 100644 index 00000000000..e0f24335522 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_face.cpp @@ -0,0 +1,255 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include "graphite2/Font.h" +#include "inc/Face.h" +#include "inc/FileFace.h" +#include "inc/GlyphCache.h" +#include "inc/CachedFace.h" +#include "inc/CmapCache.h" +#include "inc/Silf.h" + +using namespace graphite2; + +namespace +{ + bool load_face(Face & face, unsigned int options) + { + Face::Table silf(face, Tag::Silf); + if (silf) options &= ~gr_face_dumbRendering; + else if (!(options & gr_face_dumbRendering)) + return false; + + if (!face.readGlyphs(options)) + return false; + + return silf ? face.readFeatures() && face.readGraphite(silf) + : options & gr_face_dumbRendering; + } +} + +extern "C" { + +gr_face* gr_make_face_with_ops(const void* appFaceHandle/*non-NULL*/, const gr_face_ops *ops, unsigned int faceOptions) + //the appFaceHandle must stay alive all the time when the gr_face is alive. When finished with the gr_face, call destroy_face +{ + if (ops == 0) return 0; + + Face *res = new Face(appFaceHandle, *ops); + if (res && load_face(*res, faceOptions)) + return static_cast(res); + + delete res; + return 0; +} + +gr_face* gr_make_face(const void* appFaceHandle/*non-NULL*/, gr_get_table_fn tablefn, unsigned int faceOptions) +{ + const gr_face_ops ops = {sizeof(gr_face_ops), tablefn, NULL}; + return gr_make_face_with_ops(appFaceHandle, &ops, faceOptions); +} + +#ifndef GRAPHITE2_NSEGCACHE +gr_face* gr_make_face_with_seg_cache_and_ops(const void* appFaceHandle/*non-NULL*/, const gr_face_ops *ops, unsigned int cacheSize, unsigned int faceOptions) + //the appFaceHandle must stay alive all the time when the GrFace is alive. When finished with the GrFace, call destroy_face +{ + if (ops == 0) return 0; + + CachedFace *res = new CachedFace(appFaceHandle, *ops); + if (res && load_face(*res, faceOptions) + && res->setupCache(cacheSize)) + return static_cast(static_cast(res)); + + delete res; + return 0; +} + +gr_face* gr_make_face_with_seg_cache(const void* appFaceHandle/*non-NULL*/, gr_get_table_fn getTable, unsigned int cacheSize, unsigned int faceOptions) +{ + const gr_face_ops ops = {sizeof(gr_face_ops), getTable, NULL}; + return gr_make_face_with_seg_cache_and_ops(appFaceHandle, &ops, cacheSize, faceOptions); +} +#endif + +gr_uint32 gr_str_to_tag(const char *str) +{ + uint32 res = 0; + int i = strlen(str); + if (i > 4) i = 4; + while (--i >= 0) + res = (res >> 8) + (str[i] << 24); + return res; +} + +void gr_tag_to_str(gr_uint32 tag, char *str) +{ + int i = 4; + while (--i >= 0) + { + str[i] = tag & 0xFF; + tag >>= 8; + } +} + +inline +uint32 zeropad(const uint32 x) +{ + if (x == 0x20202020) return 0; + if ((x & 0x00FFFFFF) == 0x00202020) return x & 0xFF000000; + if ((x & 0x0000FFFF) == 0x00002020) return x & 0xFFFF0000; + if ((x & 0x000000FF) == 0x00000020) return x & 0xFFFFFF00; + return x; +} + +gr_feature_val* gr_face_featureval_for_lang(const gr_face* pFace, gr_uint32 langname/*0 means clone default*/) //clones the features. if none for language, clones the default +{ + assert(pFace); + zeropad(langname); + return static_cast(pFace->theSill().cloneFeatures(langname)); +} + + +const gr_feature_ref* gr_face_find_fref(const gr_face* pFace, gr_uint32 featId) //When finished with the FeatureRef, call destroy_FeatureRef +{ + assert(pFace); + zeropad(featId); + const FeatureRef* pRef = pFace->featureById(featId); + return static_cast(pRef); +} + +unsigned short gr_face_n_fref(const gr_face* pFace) +{ + assert(pFace); + return pFace->numFeatures(); +} + +const gr_feature_ref* gr_face_fref(const gr_face* pFace, gr_uint16 i) //When finished with the FeatureRef, call destroy_FeatureRef +{ + assert(pFace); + const FeatureRef* pRef = pFace->feature(i); + return static_cast(pRef); +} + +unsigned short gr_face_n_languages(const gr_face* pFace) +{ + assert(pFace); + return pFace->theSill().numLanguages(); +} + +gr_uint32 gr_face_lang_by_index(const gr_face* pFace, gr_uint16 i) +{ + assert(pFace); + return pFace->theSill().getLangName(i); +} + + +void gr_face_destroy(gr_face *face) +{ + delete face; +} + + +gr_uint16 gr_face_name_lang_for_locale(gr_face *face, const char * locale) +{ + if (face) + { + return face->languageForLocale(locale); + } + return 0; +} + +unsigned short gr_face_n_glyphs(const gr_face* pFace) +{ + return pFace->glyphs().numGlyphs(); +} + +const gr_faceinfo *gr_face_info(const gr_face *pFace, gr_uint32 script) +{ + if (!pFace) return 0; + const Silf *silf = pFace->chooseSilf(script); + if (silf) return silf->silfInfo(); + return 0; +} + +int gr_face_is_char_supported(const gr_face* pFace, gr_uint32 usv, gr_uint32 script) +{ + const Cmap & cmap = pFace->cmap(); + gr_uint16 gid = cmap[usv]; + if (!gid) + { + const Silf * silf = pFace->chooseSilf(script); + gid = silf->findPseudo(usv); + } + return (gid != 0); +} + +#ifndef GRAPHITE2_NFILEFACE +gr_face* gr_make_file_face(const char *filename, unsigned int faceOptions) +{ + FileFace* pFileFace = new FileFace(filename); + if (*pFileFace) + { + gr_face* pRes = gr_make_face_with_ops(pFileFace, &FileFace::ops, faceOptions); + if (pRes) + { + pRes->takeFileFace(pFileFace); //takes ownership + return pRes; + } + } + + //error when loading + + delete pFileFace; + return NULL; +} + +#ifndef GRAPHITE2_NSEGCACHE +gr_face* gr_make_file_face_with_seg_cache(const char* filename, unsigned int segCacheMaxSize, unsigned int faceOptions) //returns NULL on failure. //TBD better error handling + //when finished with, call destroy_face +{ + FileFace* pFileFace = new FileFace(filename); + if (*pFileFace) + { + gr_face * pRes = gr_make_face_with_seg_cache_and_ops(pFileFace, &FileFace::ops, segCacheMaxSize, faceOptions); + if (pRes) + { + pRes->takeFileFace(pFileFace); //takes ownership + return pRes; + } + } + + //error when loading + + delete pFileFace; + return NULL; +} +#endif +#endif //!GRAPHITE2_NFILEFACE + + +} // extern "C" + + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_features.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_features.cpp new file mode 100644 index 00000000000..63c5564ffdd --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_features.cpp @@ -0,0 +1,138 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include "graphite2/Font.h" +#include "inc/Face.h" +#include "inc/FeatureMap.h" +#include "inc/FeatureVal.h" +#include "inc/NameTable.h" + +using namespace graphite2; + +extern "C" { + + +gr_uint16 gr_fref_feature_value(const gr_feature_ref* pfeatureref, const gr_feature_val* feats) //returns 0 if either pointer is NULL +{ + if (!pfeatureref || !feats) return 0; + + return pfeatureref->getFeatureVal(*feats); +} + + +int gr_fref_set_feature_value(const gr_feature_ref* pfeatureref, gr_uint16 val, gr_feature_val* pDest) +{ + if (!pfeatureref || !pDest) return 0; + + return pfeatureref->applyValToFeature(val, *pDest); +} + + +gr_uint32 gr_fref_id(const gr_feature_ref* pfeatureref) //returns 0 if pointer is NULL +{ + if (!pfeatureref) + return 0; + + return pfeatureref->getId(); +} + + +gr_uint16 gr_fref_n_values(const gr_feature_ref* pfeatureref) +{ + if(!pfeatureref) + return 0; + return pfeatureref->getNumSettings(); +} + + +gr_int16 gr_fref_value(const gr_feature_ref* pfeatureref, gr_uint16 settingno) +{ + if(!pfeatureref || (settingno >= pfeatureref->getNumSettings())) + { + return 0; + } + return pfeatureref->getSettingValue(settingno); +} + + +void* gr_fref_label(const gr_feature_ref* pfeatureref, gr_uint16 *langId, gr_encform utf, gr_uint32 *length) +{ + if(!pfeatureref || !pfeatureref->getFace()) + { + langId = 0; + length = 0; + return NULL; + } + uint16 label = pfeatureref->getNameId(); + NameTable * names = pfeatureref->getFace()->nameTable(); + if (!names) + { + langId = 0; + length = 0; + return NULL; + } + return names->getName(*langId, label, utf, *length); +} + + +void* gr_fref_value_label(const gr_feature_ref*pfeatureref, gr_uint16 setting, + gr_uint16 *langId, gr_encform utf, gr_uint32 *length) +{ + if(!pfeatureref || (setting >= pfeatureref->getNumSettings()) || !pfeatureref->getFace()) + { + langId = 0; + length = 0; + return NULL; + } + uint16 label = pfeatureref->getSettingName(setting); + NameTable * names = pfeatureref->getFace()->nameTable(); + if (!names) + { + langId = 0; + length = 0; + return NULL; + } + return names->getName(*langId, label, utf, *length); +} + + +void gr_label_destroy(void * label) +{ + free(label); +} + +gr_feature_val* gr_featureval_clone(const gr_feature_val* pfeatures/*may be NULL*/) +{ //When finished with the Features, call features_destroy + return static_cast(pfeatures ? new Features(*pfeatures) : new Features); +} + +void gr_featureval_destroy(gr_feature_val *p) +{ + delete p; +} + + +} // extern "C" diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_font.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_font.cpp new file mode 100644 index 00000000000..22e4ec9c157 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_font.cpp @@ -0,0 +1,72 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include "graphite2/Font.h" +#include "inc/Font.h" + + +using namespace graphite2; + +extern "C" { + +void gr_engine_version(int *nMajor, int *nMinor, int *nBugFix) +{ + if (nMajor) *nMajor = GR2_VERSION_MAJOR; + if (nMinor) *nMinor = GR2_VERSION_MINOR; + if (nBugFix) *nBugFix = GR2_VERSION_BUGFIX; +} + +gr_font* gr_make_font(float ppm/*pixels per em*/, const gr_face *face) +{ + return gr_make_font_with_advance_fn(ppm, 0, 0, face); +} + + +gr_font* gr_make_font_with_ops(float ppm/*pixels per em*/, const void* appFontHandle/*non-NULL*/, const gr_font_ops * font_ops, const gr_face * face/*needed for scaling*/) +{ //the appFontHandle must stay alive all the time when the gr_font is alive. When finished with the gr_font, call destroy_gr_font + if (face == 0) return 0; + + Font * const res = new Font(ppm, *face, appFontHandle, font_ops); + return static_cast(res); +} + +gr_font* gr_make_font_with_advance_fn(float ppm/*pixels per em*/, const void* appFontHandle/*non-NULL*/, gr_advance_fn getAdvance, const gr_face * face/*needed for scaling*/) +{ + const gr_font_ops ops = {sizeof(gr_font_ops), getAdvance, NULL}; + return gr_make_font_with_ops(ppm, appFontHandle, &ops, face); +} + +void gr_font_destroy(gr_font *font) +{ + delete font; +} + + +} // extern "C" + + + + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_logging.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_logging.cpp new file mode 100644 index 00000000000..2fa6d128b1d --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_logging.cpp @@ -0,0 +1,193 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include + +#include "graphite2/Log.h" +#include "inc/debug.h" +#include "inc/CharInfo.h" +#include "inc/Slot.h" +#include "inc/Segment.h" + +#if defined _WIN32 +#include "windows.h" +#endif + +using namespace graphite2; + + +extern "C" { + + +bool gr_start_logging(gr_face * face, const char *log_path) +{ + if (!face || !log_path) return false; + +#if !defined GRAPHITE2_NTRACING + gr_stop_logging(face); +#if defined _WIN32 + int n = MultiByteToWideChar(CP_UTF8, MB_ERR_INVALID_CHARS, log_path, -1, 0, 0); + if (n == 0 || n > MAX_PATH - 12) return false; + + LPWSTR wlog_path = gralloc(n); + FILE *log = 0; + if (wlog_path && MultiByteToWideChar(CP_UTF8, MB_ERR_INVALID_CHARS, log_path, -1, wlog_path, n)) + log = _wfopen(wlog_path, L"wt"); + + free(wlog_path); +#else + FILE *log = fopen(log_path, "wt"); +#endif + if (!log) return false; + + face->setLogger(log); + if (!face->logger()) return false; + + *face->logger() << json::array; + return true; +#else + return false; +#endif +} + +bool graphite_start_logging(FILE * /* log */, GrLogMask /* mask */) +{ +//#if !defined GRAPHITE2_NTRACING +// graphite_stop_logging(); +// +// if (!log) return false; +// +// dbgout = new json(log); +// if (!dbgout) return false; +// +// *dbgout << json::array; +// return true; +//#else + return false; +//#endif +} + +void gr_stop_logging(gr_face * face) +{ + if (!face) return; + +#if !defined GRAPHITE2_NTRACING + if (face->logger()) + { + FILE * log = face->logger()->stream(); + face->setLogger(0); + fclose(log); + } +#endif +} + +void graphite_stop_logging() +{ +// if (dbgout) delete dbgout; +// dbgout = 0; +} + +} // extern "C" + +#if !defined GRAPHITE2_NTRACING + +json & graphite2::operator << (json & j, const CharInfo & ci) throw() +{ + return j << json::object + << "offset" << ci.base() + << "unicode" << ci.unicodeChar() + << "break" << ci.breakWeight() + << "flags" << ci.flags() + << "slot" << json::flat << json::object + << "before" << ci.before() + << "after" << ci.after() + << json::close + << json::close; +} + + +json & graphite2::operator << (json & j, const dslot & ds) throw() +{ + assert(ds.first); + assert(ds.second); + const Segment & seg = *ds.first; + const Slot & s = *ds.second; + + j << json::object + << "id" << objectid(ds) + << "gid" << s.gid() + << "charinfo" << json::flat << json::object + << "original" << s.original() + << "before" << s.before() + << "after" << s.after() + << json::close + << "origin" << s.origin() + << "shift" << Position(float(s.getAttr(0, gr_slatShiftX, 0)), + float(s.getAttr(0, gr_slatShiftY, 0))) + << "advance" << s.advancePos() + << "insert" << s.isInsertBefore() + << "break" << s.getAttr(&seg, gr_slatBreak, 0); + if (s.just() > 0) + j << "justification" << s.just(); + if (s.getBidiLevel() > 0) + j << "bidi" << s.getBidiLevel(); + if (!s.isBase()) + j << "parent" << json::flat << json::object + << "id" << objectid(dslot(&seg, s.attachedTo())) + << "level" << s.getAttr(0, gr_slatAttLevel, 0) + << "offset" << s.attachOffset() + << json::close; + j << "user" << json::flat << json::array; + for (int n = 0; n!= seg.numAttrs(); ++n) + j << s.userAttrs()[n]; + j << json::close; + if (s.firstChild()) + { + j << "children" << json::flat << json::array; + for (const Slot *c = s.firstChild(); c; c = c->nextSibling()) + j << objectid(dslot(&seg, c)); + j << json::close; + } + return j << json::close; +} + + +graphite2::objectid::objectid(const dslot & ds) throw() +{ + const Slot * const p = ds.second; + uint32 s = reinterpret_cast(p); + sprintf(name, "%.4x-%.2x-%.4hx", uint16(s >> 16), uint16(p ? p->userAttrs()[ds.first->silf()->numUser()] : 0), uint16(s)); + name[sizeof name-1] = 0; +} + +graphite2::objectid::objectid(const Segment * const p) throw() +{ + uint32 s = reinterpret_cast(p); + sprintf(name, "%.4x-%.2x-%.4hx", uint16(s >> 16), 0, uint16(s)); + name[sizeof name-1] = 0; +} + +#endif diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_segment.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_segment.cpp new file mode 100644 index 00000000000..6eca66b4a0b --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_segment.cpp @@ -0,0 +1,174 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include "graphite2/Segment.h" +#include "inc/UtfCodec.h" +#include "inc/Segment.h" + +using namespace graphite2; + +namespace +{ + + gr_segment* makeAndInitialize(const Font *font, const Face *face, uint32 script, const Features* pFeats/*must not be NULL*/, gr_encform enc, const void* pStart, size_t nChars, int dir) + { + if (script == 0x20202020) script = 0; + else if ((script & 0x00FFFFFF) == 0x00202020) script = script & 0xFF000000; + else if ((script & 0x0000FFFF) == 0x00002020) script = script & 0xFFFF0000; + else if ((script & 0x000000FF) == 0x00000020) script = script & 0xFFFFFF00; + // if (!font) return NULL; + Segment* pRes=new Segment(nChars, face, script, dir); + + pRes->read_text(face, pFeats, enc, pStart, nChars); + if (!pRes->runGraphite()) + { + delete pRes; + return NULL; + } + // run the line break passes + // run the substitution passes + pRes->prepare_pos(font); + // run the positioning passes + pRes->finalise(font); + + return static_cast(pRes); + } + + +} + + +template +inline size_t count_unicode_chars(utf_iter first, const utf_iter last, const void **error) +{ + size_t n_chars = 0; + uint32 usv = 0; + + if (last) + { + for (;first != last; ++first, ++n_chars) + if ((usv = *first) == 0 || first.error()) break; + } + else + { + while ((usv = *first) != 0 && !first.error()) + { + ++first; + ++n_chars; + } + } + + if (error) *error = first.error() ? first : 0; + return n_chars; +} + +extern "C" { + +size_t gr_count_unicode_characters(gr_encform enc, const void* buffer_begin, const void* buffer_end/*don't go on or past end, If NULL then ignored*/, const void** pError) //Also stops on nul. Any nul is not in the count +{ + assert(buffer_begin); + + switch (enc) + { + case gr_utf8: return count_unicode_chars(buffer_begin, buffer_end, pError); break; + case gr_utf16: return count_unicode_chars(buffer_begin, buffer_end, pError); break; + case gr_utf32: return count_unicode_chars(buffer_begin, buffer_end, pError); break; + default: return 0; + } +} + + +gr_segment* gr_make_seg(const gr_font *font, const gr_face *face, gr_uint32 script, const gr_feature_val* pFeats, gr_encform enc, const void* pStart, size_t nChars, int dir) +{ + const gr_feature_val * tmp_feats = 0; + if (pFeats == 0) + pFeats = tmp_feats = static_cast(face->theSill().cloneFeatures(0)); + gr_segment * seg = makeAndInitialize(font, face, script, pFeats, enc, pStart, nChars, dir); + delete tmp_feats; + + return seg; +} + + +void gr_seg_destroy(gr_segment* p) +{ + delete p; +} + + +float gr_seg_advance_X(const gr_segment* pSeg/*not NULL*/) +{ + assert(pSeg); + return pSeg->advance().x; +} + + +float gr_seg_advance_Y(const gr_segment* pSeg/*not NULL*/) +{ + assert(pSeg); + return pSeg->advance().y; +} + + +unsigned int gr_seg_n_cinfo(const gr_segment* pSeg/*not NULL*/) +{ + assert(pSeg); + return pSeg->charInfoCount(); +} + + +const gr_char_info* gr_seg_cinfo(const gr_segment* pSeg/*not NULL*/, unsigned int index/*must be (pSeg->charinfo(index)); +} + +unsigned int gr_seg_n_slots(const gr_segment* pSeg/*not NULL*/) +{ + assert(pSeg); + return pSeg->slotCount(); +} + +const gr_slot* gr_seg_first_slot(gr_segment* pSeg/*not NULL*/) +{ + assert(pSeg); + return static_cast(pSeg->first()); +} + +const gr_slot* gr_seg_last_slot(gr_segment* pSeg/*not NULL*/) +{ + assert(pSeg); + return static_cast(pSeg->last()); +} + +float gr_seg_justify(gr_segment* pSeg/*not NULL*/, const gr_slot* pSlot/*not NULL*/, const gr_font *pFont, double width, enum gr_justFlags flags, const gr_slot *pFirst, const gr_slot *pLast) +{ + assert(pSeg); + assert(pSlot); + return pSeg->justify(const_cast(pSlot), pFont, float(width), justFlags(flags), const_cast(pFirst), const_cast(pLast)); +} + +} // extern "C" diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_slot.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_slot.cpp new file mode 100644 index 00000000000..c615e40ffe5 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/gr_slot.cpp @@ -0,0 +1,173 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#include "graphite2/Segment.h" +#include "inc/Segment.h" +#include "inc/Slot.h" +#include "inc/Font.h" + + +extern "C" { + + +const gr_slot* gr_slot_next_in_segment(const gr_slot* p/*not NULL*/) +{ + assert(p); + return static_cast(p->next()); +} + +const gr_slot* gr_slot_prev_in_segment(const gr_slot* p/*not NULL*/) +{ + assert(p); + return static_cast(p->prev()); +} + +const gr_slot* gr_slot_attached_to(const gr_slot* p/*not NULL*/) //returns NULL iff base. If called repeatedly on result, will get to a base +{ + assert(p); + return static_cast(p->attachedTo()); +} + + +const gr_slot* gr_slot_first_attachment(const gr_slot* p/*not NULL*/) //returns NULL iff no attachments. +{ //if slot_first_attachment(p) is not NULL, then slot_attached_to(slot_first_attachment(p))==p. + assert(p); + return static_cast(p->firstChild()); +} + + +const gr_slot* gr_slot_next_sibling_attachment(const gr_slot* p/*not NULL*/) //returns NULL iff no more attachments. +{ //if slot_next_sibling_attachment(p) is not NULL, then slot_attached_to(slot_next_sibling_attachment(p))==slot_attached_to(p). + assert(p); + return static_cast(p->nextSibling()); +} + + +unsigned short gr_slot_gid(const gr_slot* p/*not NULL*/) +{ + assert(p); + return p->glyph(); +} + + +float gr_slot_origin_X(const gr_slot* p/*not NULL*/) +{ + assert(p); + return p->origin().x; +} + + +float gr_slot_origin_Y(const gr_slot* p/*not NULL*/) +{ + assert(p); + return p->origin().y; +} + + +float gr_slot_advance_X(const gr_slot* p/*not NULL*/, const gr_face *face, const gr_font *font) +{ + assert(p); + float scale = 1.0; + float res = p->advance(); + if (font) + { + scale = font->scale(); + if (face && font->isHinted()) + res = (res - face->glyphs().glyph(p->gid())->theAdvance().x) * scale + font->advance(p->gid()); + else + res = res * scale; + } + return res; +} + +float gr_slot_advance_Y(const gr_slot *p/*not NULL*/, const gr_face *face, const gr_font *font) +{ + assert(p); + float res = p->advancePos().y; + if (font && (face || !face)) + return res * font->scale(); + else + return res; +} + +int gr_slot_before(const gr_slot* p/*not NULL*/) +{ + assert(p); + return p->before(); +} + + +int gr_slot_after(const gr_slot* p/*not NULL*/) +{ + assert(p); + return p->after(); +} + +unsigned int gr_slot_index(const gr_slot *p/*not NULL*/) +{ + assert(p); + return p->index(); +} + +int gr_slot_attr(const gr_slot* p/*not NULL*/, const gr_segment* pSeg/*not NULL*/, gr_attrCode index, gr_uint8 subindex) +{ + assert(p); + return p->getAttr(pSeg, index, subindex); +} + + +int gr_slot_can_insert_before(const gr_slot* p/*not NULL*/) +{ + assert(p); + return (p->isInsertBefore())? 1 : 0; +} + + +int gr_slot_original(const gr_slot* p/*not NULL*/) +{ + assert(p); + return p->original(); +} + +void gr_slot_linebreak_before(gr_slot* p/*not NULL*/) +{ + assert(p); + gr_slot *prev = (gr_slot *)p->prev(); + prev->sibling(NULL); + prev->next(NULL); + p->prev(NULL); +} + +#if 0 //what should this be +size_t id(const gr_slot* p/*not NULL*/) +{ + return (size_t)p->id(); +} +#endif + + +} // extern "C" + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/CachedFace.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/CachedFace.h new file mode 100644 index 00000000000..53674754ee2 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/CachedFace.h @@ -0,0 +1,56 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + +#ifndef GRAPHITE2_NSEGCACHE + +#include "inc/Face.h" + +namespace graphite2 { + +class SegCacheStore; +class SegCache; + +class CachedFace : public Face +{ + CachedFace(const CachedFace &); + CachedFace & operator = (const CachedFace &); + +public: + CachedFace(const void* appFaceHandle/*non-NULL*/, const gr_face_ops & ops); + bool setupCache(unsigned int cacheSize); + virtual ~CachedFace(); + virtual bool runGraphite(Segment *seg, const Silf *silf) const; + SegCacheStore * cacheStore() { return m_cacheStore; } +private: + SegCacheStore * m_cacheStore; +}; + +} // namespace graphite2 + +#endif + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/CharInfo.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/CharInfo.h new file mode 100644 index 00000000000..2debaf73477 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/CharInfo.h @@ -0,0 +1,67 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once +#include "inc/Main.h" + + +namespace graphite2 { + +class CharInfo +{ + +public: + CharInfo() : m_char(0), m_before(-1), m_after(0), m_base(0), m_featureid(0), m_break(0), m_flags(0) {} + void init(int cid) { m_char = cid; } + unsigned int unicodeChar() const { return m_char; } + void feats(int offset) { m_featureid = offset; } + int fid() const { return m_featureid; } + int breakWeight() const { return m_break; } + void breakWeight(int val) { m_break = val; } + int after() const { return m_after; } + void after(int val) { m_after = val; } + int before() const { return m_before; } + void before(int val) { m_before = val; } + size_t base() const { return m_base; } + void base(size_t offset) { m_base = offset; } + void addflags(uint8 val) { m_flags |= val; } + uint8 flags() const { return m_flags; } + + CLASS_NEW_DELETE +private: + int m_char; // Unicode character from character stream + int m_before; // slot index before us, comes before + int m_after; // slot index after us, comes after + size_t m_base; // offset into input string corresponding to this charinfo + uint8 m_featureid; // index into features list in the segment + int8 m_break; // breakweight coming from lb table + uint8 m_flags; // 0,1 segment split. +}; + +} // namespace graphite2 + +struct gr_char_info : public graphite2::CharInfo {}; + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/CmapCache.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/CmapCache.h new file mode 100644 index 00000000000..a7df78ea568 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/CmapCache.h @@ -0,0 +1,82 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + +#include "inc/Main.h" +#include "inc/Face.h" + +namespace graphite2 { + +class Face; + +class Cmap +{ +public: + + virtual ~Cmap() throw() {} + + virtual uint16 operator [] (const uint32) const throw() { return 0; } + + virtual operator bool () const throw() { return false; } + + CLASS_NEW_DELETE; +}; + +class DirectCmap : public Cmap +{ + DirectCmap(const DirectCmap &); + DirectCmap & operator = (const DirectCmap &); + +public: + DirectCmap(const Face &); + virtual uint16 operator [] (const uint32 usv) const throw(); + virtual operator bool () const throw(); + + CLASS_NEW_DELETE; +private: + const Face::Table _cmap; + const void * _smp, + * _bmp; +}; + +class CachedCmap : public Cmap +{ + CachedCmap(const CachedCmap &); + CachedCmap & operator = (const CachedCmap &); + +public: + CachedCmap(const Face &); + virtual ~CachedCmap() throw(); + virtual uint16 operator [] (const uint32 usv) const throw(); + virtual operator bool () const throw(); + CLASS_NEW_DELETE; +private: + bool m_isBmpOnly; + uint16 ** m_blocks; +}; + +} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Code.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Code.h new file mode 100644 index 00000000000..d9539b0da24 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Code.h @@ -0,0 +1,175 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +// This class represents loaded graphite stack machine code. It performs +// basic sanity checks, on the incoming code to prevent more obvious problems +// from crashing graphite. +// Author: Tim Eves + +#pragma once + +#include +#include +#include "inc/Main.h" +#include "inc/Machine.h" + +namespace graphite2 { + +class Silf; +class Face; + +namespace vm { + +class Machine::Code +{ +public: + enum status_t + { + loaded, + alloc_failed, + invalid_opcode, + unimplemented_opcode_used, + out_of_range_data, + jump_past_end, + arguments_exhausted, + missing_return, + nested_context_item + }; + +private: + class decoder; + + instr * _code; + byte * _data; + size_t _data_size, + _instr_count; + byte _max_ref; + mutable status_t _status; + bool _constraint, + _modify, + _delete; + mutable bool _own; + + void release_buffers() throw (); + void failure(const status_t) throw(); + +public: + Code() throw(); + Code(bool is_constraint, const byte * bytecode_begin, const byte * const bytecode_end, + uint8 pre_context, uint16 rule_length, const Silf &, const Face &); + Code(const Machine::Code &) throw(); + ~Code() throw(); + + Code & operator=(const Code &rhs) throw(); + operator bool () const throw(); + status_t status() const throw(); + bool constraint() const throw(); + size_t dataSize() const throw(); + size_t instructionCount() const throw(); + bool immutable() const throw(); + bool deletes() const throw(); + size_t maxRef() const throw(); + + int32 run(Machine &m, slotref * & map) const; + + CLASS_NEW_DELETE; +}; + +inline Machine::Code::Code() throw() +: _code(0), _data(0), _data_size(0), _instr_count(0), _max_ref(0), + _status(loaded), _constraint(false), _modify(false),_delete(false), + _own(false) +{ +} + +inline Machine::Code::Code(const Machine::Code &obj) throw () + : _code(obj._code), + _data(obj._data), + _data_size(obj._data_size), + _instr_count(obj._instr_count), + _max_ref(obj._max_ref), + _status(obj._status), + _constraint(obj._constraint), + _modify(obj._modify), + _delete(obj._delete), + _own(obj._own) +{ + obj._own = false; +} + +inline Machine::Code & Machine::Code::operator=(const Machine::Code &rhs) throw() { + if (_instr_count > 0) + release_buffers(); + _code = rhs._code; + _data = rhs._data; + _data_size = rhs._data_size; + _instr_count = rhs._instr_count; + _status = rhs._status; + _constraint = rhs._constraint; + _modify = rhs._modify; + _delete = rhs._delete; + _own = rhs._own; + rhs._own = false; + return *this; +} + +inline Machine::Code::operator bool () const throw () { + return _code && status() == loaded; +} + +inline Machine::Code::status_t Machine::Code::status() const throw() { + return _status; +} + +inline bool Machine::Code::constraint() const throw() { + return _constraint; +} + +inline size_t Machine::Code::dataSize() const throw() { + return _data_size; +} + +inline size_t Machine::Code::instructionCount() const throw() { + return _instr_count; +} + +inline bool Machine::Code::immutable() const throw() +{ + return !(_delete || _modify); +} + +inline bool Machine::Code::deletes() const throw() +{ + return _delete; +} + +inline size_t Machine::Code::maxRef() const throw() +{ + return _max_ref; +} + +} // namespace vm +} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Endian.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Endian.h new file mode 100644 index 00000000000..16ff79f5519 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Endian.h @@ -0,0 +1,107 @@ +/*----------------------------------------------------------------------------- +Copyright (C) 2011 SIL International +Responsibility: Tim Eves + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. + +Description: +A set of fast template based decoders for decoding values of any C integer +type up to long int size laid out with most significant byte first or least +significant byte first (aka big endian or little endian). These are CPU +byte order agnostic and will function the same regardless of the CPUs native +byte order. +Being template based means if the either le or be class is not used then +template code of unused functions will not be instantiated by the compiler +and thus shouldn't cause any overhead. +-----------------------------------------------------------------------------*/ +#include + +#pragma once + + +class be +{ + template + inline static unsigned long int _peek(const unsigned char * p) { + return _peek(p) << (S/2)*8 | _peek(p+S/2); + } +public: + template + inline static T peek(const void * p) { + return T(_peek(static_cast(p))); + } + + template + inline static T read(const unsigned char * &p) { + const T r = T(_peek(p)); + p += sizeof r; + return r; + } + + template + inline static T swap(const T x) { + return T(_peek(reinterpret_cast(&x))); + } + + template + inline static void skip(const unsigned char * &p, size_t n=1) { + p += sizeof(T)*n; + } +}; + +template<> +inline unsigned long int be::_peek<1>(const unsigned char * p) { return *p; } + + +class le +{ + template + inline static unsigned long int _peek(const unsigned char * p) { + return _peek(p) | _peek(p+S/2) << (S/2)*8; + } +public: + template + inline static T peek(const void * p) { + return T(_peek(static_cast(p))); + } + + template + inline static T read(const unsigned char * &p) { + const T r = T(_peek(p)); + p += sizeof r; + return r; + } + + template + inline static T swap(const T x) { + return T(_peek(reinterpret_cast(&x))); + } + + template + inline static void skip(const unsigned char * &p, size_t n=1) { + p += sizeof(T)*n; + } +}; + +template<> +inline unsigned long int le::_peek<1>(const unsigned char * p) { return *p; } + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Face.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Face.h new file mode 100644 index 00000000000..d84ea92fc07 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Face.h @@ -0,0 +1,206 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + +#include + +#include "graphite2/Font.h" + +#include "inc/Main.h" +#include "inc/FeatureMap.h" +#include "inc/TtfUtil.h" +#include "inc/Silf.h" + +namespace graphite2 { + +class Cmap; +class FileFace; +class GlyphCache; +class NameTable; +class json; + +using TtfUtil::Tag; + +// These are the actual tags, as distinct from the consecutive IDs in TtfUtil.h + +class Face +{ + // Prevent any kind of copying + Face(const Face&); + Face& operator=(const Face&); + +public: + class Table; + static float default_glyph_advance(const void* face_ptr, gr_uint16 glyphid); + + Face(const void* appFaceHandle/*non-NULL*/, const gr_face_ops & ops); + virtual ~Face(); + + virtual bool runGraphite(Segment *seg, const Silf *silf) const; + +public: + bool readGlyphs(uint32 faceOptions); + bool readGraphite(const Table & silf); + bool readFeatures(); + void takeFileFace(FileFace* pFileFace/*takes ownership*/); + + const SillMap & theSill() const; + const GlyphCache & glyphs() const; + Cmap & cmap() const; + NameTable * nameTable() const; + void setLogger(FILE *log_file); + json * logger() const throw(); + + const Silf * chooseSilf(uint32 script) const; + uint16 languageForLocale(const char * locale) const; + + // Features + uint16 numFeatures() const; + const FeatureRef * featureById(uint32 id) const; + const FeatureRef * feature(uint16 index) const; + + // Glyph related + uint16 getGlyphMetric(uint16 gid, uint8 metric) const; + uint16 findPseudo(uint32 uid) const; + + CLASS_NEW_DELETE; +private: + SillMap m_Sill; + gr_face_ops m_ops; + const void * m_appFaceHandle; // non-NULL + FileFace * m_pFileFace; //owned + mutable GlyphCache * m_pGlyphFaceCache; // owned - never NULL + mutable Cmap * m_cmap; // cmap cache if available + mutable NameTable * m_pNames; + mutable json * m_logger; +protected: + Silf * m_silfs; // silf subtables. + uint16 m_numSilf; // num silf subtables in the silf table +private: + uint16 m_ascent, + m_descent; +}; + + + +inline +const SillMap & Face::theSill() const +{ + return m_Sill; +} + +inline +uint16 Face::numFeatures() const +{ + return m_Sill.theFeatureMap().numFeats(); +} + +inline +const FeatureRef * Face::featureById(uint32 id) const +{ + return m_Sill.theFeatureMap().findFeatureRef(id); +} + +inline +const FeatureRef *Face::feature(uint16 index) const +{ + return m_Sill.theFeatureMap().feature(index); +} + +inline +const GlyphCache & Face::glyphs() const +{ + return *m_pGlyphFaceCache; +} + +inline +Cmap & Face::cmap() const +{ + return *m_cmap; +}; + +inline +json * Face::logger() const throw() +{ + return m_logger; +} + + + +class Face::Table +{ + const Face * _f; + mutable const byte * _p; + uint32 _sz; + +public: + Table() throw(); + Table(const Face & face, const Tag n) throw(); + Table(const Table & rhs) throw(); + ~Table() throw(); + + operator const byte * () const throw(); + + Table & operator = (const Table & rhs) throw(); + size_t size() const throw(); +}; + +inline +Face::Table::Table() throw() +: _f(0), _p(0), _sz(0) +{ +} + +inline +Face::Table::Table(const Table & rhs) throw() +: _f(rhs._f), _p(rhs._p), _sz(rhs._sz) +{ + rhs._p = 0; +} + +inline +Face::Table::~Table() throw() +{ + if (_p && _f->m_ops.release_table) + (*_f->m_ops.release_table)(_f->m_appFaceHandle, _p); +} + +inline +Face::Table::operator const byte * () const throw() +{ + return _p; +} + +inline +size_t Face::Table::size() const throw() +{ + return _sz; +} + +} // namespace graphite2 + +struct gr_face : public graphite2::Face {}; diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/FeatureMap.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/FeatureMap.h new file mode 100644 index 00000000000..dc5175c3054 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/FeatureMap.h @@ -0,0 +1,184 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once +#include "inc/Main.h" +#include "inc/FeatureVal.h" + +namespace graphite2 { + +// Forward declarations for implmentation types +class FeatureMap; +class Face; + + +class FeatureSetting +{ +public: + FeatureSetting(int16 theValue, uint16 labelId) : m_label(labelId), m_value(theValue) {}; + uint16 label() const { return m_label; } + int16 value() const { return m_value; } + + CLASS_NEW_DELETE; +private: + FeatureSetting(const FeatureSetting & fs) : m_label(fs.m_label), m_value(fs.m_value) {}; + + uint16 m_label; + int16 m_value; +}; + +class FeatureRef +{ + typedef uint32 chunk_t; + static const uint8 SIZEOF_CHUNK = sizeof(chunk_t)*8; + +public: + FeatureRef() : m_nameValues(0) {} + FeatureRef(const Face & face, unsigned short & bits_offset, uint32 max_val, + uint32 name, uint16 uiName, uint16 flags, + FeatureSetting *settings, uint16 num_set) throw(); + ~FeatureRef() throw(); + + bool applyValToFeature(uint32 val, Features& pDest) const; //defined in GrFaceImp.h + void maskFeature(Features & pDest) const { + if (m_index < pDest.size()) //defensive + pDest[m_index] |= m_mask; + } + + uint32 getFeatureVal(const Features& feats) const; //defined in GrFaceImp.h + + uint32 getId() const { return m_id; } + uint16 getNameId() const { return m_nameid; } + uint16 getNumSettings() const { return m_numSet; } + uint16 getSettingName(uint16 index) const { return m_nameValues[index].label(); } + int16 getSettingValue(uint16 index) const { return m_nameValues[index].value(); } + uint32 maxVal() const { return m_max; } + const Face* getFace() const { return m_pFace;} + const FeatureMap* getFeatureMap() const;// { return m_pFace;} + + CLASS_NEW_DELETE; +private: + FeatureRef(const FeatureRef & rhs); + + const Face * m_pFace; //not NULL + FeatureSetting * m_nameValues; // array of name table ids for feature values + chunk_t m_mask, // bit mask to get the value from the vector + m_max; // max value the value can take + uint32 m_id; // feature identifier/name + uint16 m_nameid, // Name table id for feature name + m_flags, // feature flags (unused at the moment but read from the font) + m_numSet; // number of values (number of entries in m_nameValues) + byte m_bits, // how many bits to shift the value into place + m_index; // index into the array to find the ulong to mask + +private: //unimplemented + FeatureRef& operator=(const FeatureRef&); +}; + + +class NameAndFeatureRef +{ + public: + NameAndFeatureRef(uint32 name = 0) : m_name(name) , m_pFRef(NULL){} + NameAndFeatureRef(const FeatureRef* p/*not NULL*/) : m_name(p->getId()), m_pFRef(p) {} + + bool operator<(const NameAndFeatureRef& rhs) const //orders by m_name + { return m_name +#include +#include "inc/Main.h" +#include "inc/List.h" + +namespace graphite2 { + +class FeatureRef; +class FeatureMap; + +class FeatureVal : public Vector +{ +public: + FeatureVal() : m_pMap(0) { } + FeatureVal(int num, const FeatureMap & pMap) : Vector(num), m_pMap(&pMap) {} + FeatureVal(const FeatureVal & rhs) : Vector(rhs), m_pMap(rhs.m_pMap) {} + + FeatureVal & operator = (const FeatureVal & rhs) { Vector::operator = (rhs); m_pMap = rhs.m_pMap; return *this; } + + bool operator ==(const FeatureVal & b) const + { + size_t n = size(); + if (n != b.size()) return false; + + for(const_iterator l = begin(), r = b.begin(); n && *l == *r; --n, ++l, ++r); + + return n == 0; + } + + CLASS_NEW_DELETE +private: + friend class FeatureRef; //so that FeatureRefs can manipulate m_vec directly + const FeatureMap* m_pMap; +}; + +typedef FeatureVal Features; + +} // namespace graphite2 + + +struct gr_feature_val : public graphite2::FeatureVal {}; diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/FileFace.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/FileFace.h new file mode 100644 index 00000000000..05e56d64543 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/FileFace.h @@ -0,0 +1,80 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + +//#include "inc/FeatureMap.h" +//#include "inc/GlyphsCache.h" +//#include "inc/Silf.h" + +#ifndef GRAPHITE2_NFILEFACE + +#include +#include + +#include "graphite2/Font.h" + +#include "inc/Main.h" +#include "inc/TtfTypes.h" +#include "inc/TtfUtil.h" + +namespace graphite2 { + + +class FileFace +{ + static const void * get_table_fn(const void* appFaceHandle, unsigned int name, size_t *len); + static void rel_table_fn(const void* appFaceHandle, const void *table_buffer); + +public: + static const gr_face_ops ops; + + FileFace(const char *filename); + ~FileFace(); + + operator bool () const throw(); + CLASS_NEW_DELETE; + +private: //defensive + FILE * _file; + size_t _file_len; + + TtfUtil::Sfnt::OffsetSubTable * _header_tbl; + TtfUtil::Sfnt::OffsetSubTable::Entry * _table_dir; + + FileFace(const FileFace&); + FileFace& operator=(const FileFace&); +}; + +inline +FileFace::operator bool() const throw() +{ + return _file && _header_tbl && _table_dir; +} + +} // namespace graphite2 + +#endif //!GRAPHITE2_NFILEFACE diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Font.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Font.h new file mode 100644 index 00000000000..650bc7cd8c4 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Font.h @@ -0,0 +1,89 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once +#include +#include "graphite2/Font.h" +#include "inc/Main.h" +#include "inc/Face.h" + +namespace graphite2 { + +#define INVALID_ADVANCE -1e38f // can't be a static const because non-integral + +class Font +{ +public: + Font(float ppm, const Face & face, const void * appFontHandle=0, const gr_font_ops * ops=0); + virtual ~Font(); + + float advance(unsigned short glyphid) const; + float scale() const; + bool isHinted() const; + const Face & face() const; + + CLASS_NEW_DELETE; +private: + gr_font_ops m_ops; + const void * const m_appFontHandle; + float * m_advances; // One advance per glyph in pixels. Nan if not defined + const Face & m_face; + float m_scale; // scales from design units to ppm + bool m_hinted; + + Font(const Font&); + Font& operator=(const Font&); +}; + +inline +float Font::advance(unsigned short glyphid) const +{ + if (m_advances[glyphid] == INVALID_ADVANCE) + m_advances[glyphid] = (*m_ops.glyph_advance_x)(m_appFontHandle, glyphid); + return m_advances[glyphid]; +} + +inline +float Font::scale() const +{ + return m_scale; +} + +inline +bool Font::isHinted() const +{ + return m_hinted; +} + +inline +const Face & Font::face() const +{ + return m_face; +} + +} // namespace graphite2 + +struct gr_font : public graphite2::Font {}; diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/GlyphCache.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/GlyphCache.h new file mode 100644 index 00000000000..74457152916 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/GlyphCache.h @@ -0,0 +1,92 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + + +#include "graphite2/Font.h" +#include "inc/Main.h" + +namespace graphite2 { + +class Face; +class FeatureVal; +class GlyphFace; +class Segment; + +class GlyphCache +{ + class Loader; + + GlyphCache(const GlyphCache&); + GlyphCache& operator=(const GlyphCache&); + +public: + GlyphCache(const Face & face, const uint32 face_options); + ~GlyphCache(); + + unsigned short numGlyphs() const throw(); + unsigned short numAttrs() const throw(); + unsigned short unitsPerEm() const throw(); + + const GlyphFace *glyph(unsigned short glyphid) const; //result may be changed by subsequent call with a different glyphid + const GlyphFace *glyphSafe(unsigned short glyphid) const; + + CLASS_NEW_DELETE; + +private: + const Loader * _glyph_loader; + const GlyphFace * * _glyphs; + unsigned short _num_glyphs, + _num_attrs, + _upem; +}; + +inline +unsigned short GlyphCache::numGlyphs() const throw() +{ + return _num_glyphs; +} + +inline +unsigned short GlyphCache::numAttrs() const throw() +{ + return _num_attrs; +} + +inline +unsigned short GlyphCache::unitsPerEm() const throw() +{ + return _upem; +} + +inline +const GlyphFace *GlyphCache::glyphSafe(unsigned short glyphid) const +{ + return glyphid < _num_glyphs ? glyph(glyphid) : NULL; +} + +} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/GlyphFace.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/GlyphFace.h new file mode 100644 index 00000000000..89ed5aea91a --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/GlyphFace.h @@ -0,0 +1,83 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + +#include "inc/Main.h" +#include "inc/Position.h" +#include "inc/Sparse.h" + +namespace graphite2 { + +enum metrics { + kgmetLsb = 0, kgmetRsb, + kgmetBbTop, kgmetBbBottom, kgmetBbLeft, kgmetBbRight, + kgmetBbHeight, kgmetBbWidth, + kgmetAdvWidth, kgmetAdvHeight, + kgmetAscent, kgmetDescent +}; + + +class GlyphFace +{ +public: + GlyphFace(); + template + GlyphFace(const Rect & bbox, const Position & adv, I first, const I last); + + const Position & theAdvance() const; + const Rect & theBBox() const { return m_bbox; } + const sparse & attrs() const { return m_attrs; } + uint16 getMetric(uint8 metric) const; + + CLASS_NEW_DELETE; +private: + Rect m_bbox; // bounding box metrics in design units + Position m_advance; // Advance width and height in design units + sparse m_attrs; +}; + + +// Inlines: class GlyphFace +// +inline +GlyphFace::GlyphFace() +{} + +template +GlyphFace::GlyphFace(const Rect & bbox, const Position & adv, I first, const I last) +: m_bbox(bbox), + m_advance(adv), + m_attrs(first, last) +{ +} + +inline +const Position & GlyphFace::theAdvance() const { + return m_advance; +} + +} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/List.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/List.h new file mode 100644 index 00000000000..f99036912d8 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/List.h @@ -0,0 +1,155 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ + +// designed to have a limited subset of the std::vector api +#pragma once + +#include +#include +#include +#include +#include + + +namespace graphite2 { + +template +inline +ptrdiff_t distance(T* first, T* last) { return last-first; } + + +template +class Vector +{ + T * m_first, *m_last, *m_end; +public: + typedef T & reference; + typedef const T & const_reference; + typedef T * iterator; + typedef const T * const_iterator; + + Vector() : m_first(0), m_last(0), m_end(0) {} + Vector(size_t n, const T& value = T()) : m_first(0), m_last(0), m_end(0) { insert(begin(), n, value); } + Vector(const Vector &rhs) : m_first(0), m_last(0), m_end(0) { insert(begin(), rhs.begin(), rhs.end()); } + template + Vector(I first, const I last) : m_first(0), m_last(0), m_end(0) { insert(begin(), first, last); } + ~Vector() { clear(); free(m_first); } + + iterator begin() { return m_first; } + const_iterator begin() const { return m_first; } + + iterator end() { return m_last; } + const_iterator end() const { return m_last; } + + bool empty() const { return m_first == m_last; } + size_t size() const { return m_last - m_first; } + size_t capacity() const{ return m_end - m_first; } + + void reserve(size_t n); + + reference front() { assert(size() > 0); return *begin(); } + const_reference front() const { assert(size() > 0); return *begin(); } + reference back() { assert(size() > 0); return *(end()-1); } + const_reference back() const { assert(size() > 0); return *(end()-1); } + + Vector & operator = (const Vector & rhs) { assign(rhs.begin(), rhs.end()); return *this; } + reference operator [] (size_t n) { assert(size() > n); return m_first[n]; } + const_reference operator [] (size_t n) const { assert(size() > n); return m_first[n]; } + + void assign(size_t n, const T& u) { clear(); insert(begin(), n, u); } + void assign(const_iterator first, const_iterator last) { clear(); insert(begin(), first, last); } + iterator insert(iterator p, const T & x) { p = _insert_default(p, 1); *p = x; return p; } + void insert(iterator p, size_t n, const T & x); + void insert(iterator p, const_iterator first, const_iterator last); + void pop_back() { assert(size() > 0); --m_last; } + void push_back(const T &v) { if (m_last == m_end) reserve(size()+1); new (m_last++) T(v); } + + void clear() { erase(begin(), end()); } + iterator erase(iterator p) { return erase(p, p+1); } + iterator erase(iterator first, iterator last); + +private: + iterator _insert_default(iterator p, size_t n); +}; + +template +inline +void Vector::reserve(size_t n) +{ + if (n > capacity()) + { + const ptrdiff_t sz = size(); + m_first = static_cast(realloc(m_first, n*sizeof(T))); + m_last = m_first + sz; + m_end = m_first + n; + } +} + +template +inline +typename Vector::iterator Vector::_insert_default(iterator p, size_t n) +{ + assert(begin() <= p && p <= end()); + const ptrdiff_t i = p - begin(); + reserve((size() + n + 7) >> 3 << 3); + p = begin() + i; + // Move tail if there is one + if (p != end()) memmove(p + n, p, distance(p,end())*sizeof(T)); + m_last += n; + return p; +} + +template +inline +void Vector::insert(iterator p, size_t n, const T & x) +{ + p = _insert_default(p, n); + // Copy in elements + for (; n; --n, ++p) { new (p) T(x); } +} + +template +inline +void Vector::insert(iterator p, const_iterator first, const_iterator last) +{ + p = _insert_default(p, distance(first, last)); + // Copy in elements + for (;first != last; ++first, ++p) { new (p) T(*first); } +} + +template +inline +typename Vector::iterator Vector::erase(iterator first, iterator last) +{ + for (iterator e = first; e != last; ++e) e->~T(); + const size_t sz = distance(first, last); + if (m_last != last) memmove(first, last, distance(last,end())*sizeof(T)); + m_last -= sz; + return first; +} + +} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Machine.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Machine.h new file mode 100644 index 00000000000..f6af44329fa --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Machine.h @@ -0,0 +1,197 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +// This general interpreter interface. +// Author: Tim Eves + +// Build one of direct_machine.cpp or call_machine.cpp to implement this +// interface. + +#pragma once +#include +#include +#include "inc/Main.h" + +#if defined(__GNUC__) +#if defined(__clang__) || (__GNUC__ * 100 + __GNUC_MINOR__ * 10) < 430 +#define HOT +#if defined(__x86_64) +#define REGPARM(n) __attribute__((regparm(n))) +#else +#define REGPARM(n) +#endif +#else +#define HOT __attribute__((hot)) +#if defined(__x86_64) +#define REGPARM(n) __attribute__((hot, regparm(n))) +#else +#define REGPARM(n) +#endif +#endif +#else +#define HOT +#define REGPARM(n) +#endif + +namespace graphite2 { + +// Forward declarations +class Segment; +class Slot; +class SlotMap; + + +namespace vm +{ + + +typedef void * instr; +typedef Slot * slotref; + +enum {VARARGS = 0xff, MAX_NAME_LEN=32}; + +enum opcode { + NOP = 0, + + PUSH_BYTE, PUSH_BYTEU, PUSH_SHORT, PUSH_SHORTU, PUSH_LONG, + + ADD, SUB, MUL, DIV, + MIN_, MAX_, + NEG, + TRUNC8, TRUNC16, + + COND, + + AND, OR, NOT, + EQUAL, NOT_EQ, + LESS, GTR, LESS_EQ, GTR_EQ, + + NEXT, NEXT_N, COPY_NEXT, + PUT_GLYPH_8BIT_OBS, PUT_SUBS_8BIT_OBS, PUT_COPY, + INSERT, DELETE, + ASSOC, + CNTXT_ITEM, + + ATTR_SET, ATTR_ADD, ATTR_SUB, + ATTR_SET_SLOT, + IATTR_SET_SLOT, + PUSH_SLOT_ATTR, PUSH_GLYPH_ATTR_OBS, + PUSH_GLYPH_METRIC, PUSH_FEAT, + PUSH_ATT_TO_GATTR_OBS, PUSH_ATT_TO_GLYPH_METRIC, + PUSH_ISLOT_ATTR, + + PUSH_IGLYPH_ATTR, // not implemented + + POP_RET, RET_ZERO, RET_TRUE, + IATTR_SET, IATTR_ADD, IATTR_SUB, + PUSH_PROC_STATE, PUSH_VERSION, + PUT_SUBS, PUT_SUBS2, PUT_SUBS3, + PUT_GLYPH, PUSH_GLYPH_ATTR, PUSH_ATT_TO_GLYPH_ATTR, + MAX_OPCODE, + // private opcodes for internal use only, comes after all other on disk opcodes + TEMP_COPY = MAX_OPCODE +}; + +struct opcode_t +{ + instr impl[2]; + uint8 param_sz; + char name[MAX_NAME_LEN]; +}; + + +class Machine +{ +public: + typedef int32 stack_t; + static size_t const STACK_ORDER = 10, + STACK_MAX = 1 << STACK_ORDER, + STACK_GUARD = 2; + + class Code; + + enum status_t { + finished = 0, + stack_underflow, + stack_not_empty, + stack_overflow, + slot_offset_out_bounds + }; + + Machine(SlotMap &) throw(); + static const opcode_t * getOpcodeTable() throw(); + + CLASS_NEW_DELETE; + + SlotMap & slotMap() const throw(); + status_t status() const throw(); + operator bool () const throw(); + +private: + void check_final_stack(const stack_t * const sp); + stack_t run(const instr * program, const byte * data, + slotref * & map) HOT; + + SlotMap & _map; + stack_t _stack[STACK_MAX + 2*STACK_GUARD]; + status_t _status; +}; + +inline Machine::Machine(SlotMap & map) throw() +: _map(map), _status(finished) +{ + // Initialise stack guard +1 entries as the stack pointer points to the + // current top of stack, hence the first push will never write entry 0. + // Initialising the guard space like this is unnecessary and is only + // done to keep valgrind happy during fuzz testing. Hopefully loop + // unrolling will flatten this. + for (size_t n = STACK_GUARD + 1; n; --n) _stack[n-1] = 0; +} + +inline SlotMap& Machine::slotMap() const throw() +{ + return _map; +} + +inline Machine::status_t Machine::status() const throw() +{ + return _status; +} + +inline void Machine::check_final_stack(const int32 * const sp) +{ + stack_t const * const base = _stack + STACK_GUARD, + * const limit = base + STACK_MAX; + if (sp < base) _status = stack_underflow; // This should be impossible now. + else if (sp >= limit) _status = stack_overflow; // So should this. + else if (sp != base) _status = stack_not_empty; +} + +} // namespace vm +} // namespace graphite2 + + + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Main.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Main.h new file mode 100644 index 00000000000..674af80e854 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Main.h @@ -0,0 +1,87 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + +#include +#include "graphite2/Types.h" + +#ifdef GRAPHITE2_CUSTOM_HEADER +#include GRAPHITE2_CUSTOM_HEADER +#endif + +namespace graphite2 { + +typedef gr_uint8 uint8; +typedef gr_uint8 byte; +typedef gr_uint16 uint16; +typedef gr_uint32 uint32; +typedef gr_int8 int8; +typedef gr_int16 int16; +typedef gr_int32 int32; +typedef size_t uintptr; + +// typesafe wrapper around malloc for simple types +// use free(pointer) to deallocate +template T * gralloc(size_t n) +{ + return reinterpret_cast(malloc(sizeof(T) * n)); +} + +template T * grzeroalloc(size_t n) +{ + return reinterpret_cast(calloc(n, sizeof(T))); +} + +template +inline T min(const T a, const T b) +{ + return a < b ? a : b; +} + +template +inline T max(const T a, const T b) +{ + return a > b ? a : b; +} + +} // namespace graphite2 + +#define CLASS_NEW_DELETE \ + void * operator new (size_t size){ return malloc(size);} \ + void * operator new (size_t, void * p) throw() { return p; } \ + void * operator new[] (size_t size) {return malloc(size);} \ + void * operator new[] (size_t, void * p) throw() { return p; } \ + void operator delete (void * p) throw() { free(p);} \ + void operator delete (void *, void *) throw() {} \ + void operator delete[] (void * p)throw() { free(p); } \ + void operator delete[] (void *, void *) throw() {} + +#ifdef __GNUC__ +#define GR_MAYBE_UNUSED __attribute__((unused)) +#else +#define GR_MAYBE_UNUSED +#endif diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/NameTable.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/NameTable.h new file mode 100644 index 00000000000..0fdbeb4d85f --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/NameTable.h @@ -0,0 +1,65 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + +#include +#include "inc/TtfTypes.h" +#include "inc/locale2lcid.h" + +namespace graphite2 { + +class NameTable +{ + NameTable(const NameTable &); + NameTable & operator = (const NameTable &); + +public: + NameTable(const void * data, size_t length, uint16 platfromId=3, uint16 encodingID = 1); + ~NameTable() { free(const_cast(m_table)); } + enum eNameFallback { + eNoFallback = 0, + eEnUSFallbackOnly = 1, + eEnOrAnyFallback = 2 + }; + uint16 setPlatformEncoding(uint16 platfromId=3, uint16 encodingID = 1); + void * getName(uint16 & languageId, uint16 nameId, gr_encform enc, uint32 & length); + uint16 getLanguageId(const char * bcp47Locale); + + CLASS_NEW_DELETE +private: + uint16 m_platformId; + uint16 m_encodingId; + uint16 m_languageCount; + uint16 m_platformOffset; // offset of first NameRecord with for platform 3, encoding 1 + uint16 m_platformLastRecord; + uint16 m_nameDataLength; + const TtfUtil::Sfnt::FontNames * m_table; + const uint8 * m_nameData; + Locale2Lang m_locale2Lang; +}; + +} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Pass.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Pass.h new file mode 100644 index 00000000000..6554d937f0e --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Pass.h @@ -0,0 +1,96 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + +#include +#include "inc/Code.h" + +namespace graphite2 { + +class Segment; +class Face; +class Silf; +struct Rule; +struct RuleEntry; +struct State; +class FiniteStateMachine; + +class Pass +{ +public: + Pass(); + ~Pass(); + + bool readPass(const byte * pPass, size_t pass_length, size_t subtable_base, const Face & face); + void runGraphite(vm::Machine & m, FiniteStateMachine & fsm) const; + void init(Silf *silf) { m_silf = silf; } + byte spaceContextuals() const { return (m_flags & 0x0E) >> 1; } + + CLASS_NEW_DELETE +private: + void findNDoRule(Slot* & iSlot, vm::Machine &, FiniteStateMachine& fsm) const; + int doAction(const vm::Machine::Code* codeptr, Slot * & slot_out, vm::Machine &) const; + bool testPassConstraint(vm::Machine & m) const; + bool testConstraint(const Rule & r, vm::Machine &) const; + bool readRules(const byte * rule_map, const size_t num_entries, + const byte *precontext, const uint16 * sort_key, + const uint16 * o_constraint, const byte *constraint_data, + const uint16 * o_action, const byte * action_data, + const Face &); + bool readStates(const byte * starts, const byte * states, const byte * o_rule_map); + bool readRanges(const byte * ranges, size_t num_ranges); + uint16 glyphToCol(const uint16 gid) const; + bool runFSM(FiniteStateMachine & fsm, Slot * slot) const; + void dumpRuleEventConsidered(const FiniteStateMachine & fsm, const RuleEntry & re) const; + void dumpRuleEventOutput(const FiniteStateMachine & fsm, const Rule & r, Slot * os) const; + void adjustSlot(int delta, Slot * & slot_out, SlotMap &) const; + const Silf* m_silf; + uint16 * m_cols; + Rule * m_rules; // rules + RuleEntry * m_ruleMap; + State * * m_startStates; // prectxt length + State * * m_sTable; + State * m_states; + + byte m_flags; + byte m_iMaxLoop; + uint16 m_numGlyphs; + uint16 m_numRules; + uint16 m_sRows; + uint16 m_sTransition; + uint16 m_sSuccess; + uint16 m_sColumns; + byte m_minPreCtxt; + byte m_maxPreCtxt; + vm::Machine::Code m_cPConstraint; + +private: //defensive + Pass(const Pass&); + Pass& operator=(const Pass&); +}; + +} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Position.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Position.h new file mode 100644 index 00000000000..c6f1b755644 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Position.h @@ -0,0 +1,59 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + +namespace graphite2 { + +class Position +{ +public: + Position() : x(0), y(0) { } + Position(const float inx, const float iny) : x(inx), y(iny) {} + Position operator + (const Position& a) const { return Position(x + a.x, y + a.y); } + Position operator - (const Position& a) const { return Position(x - a.x, y - a.y); } + Position operator * (const float m) const { return Position(x * m, y * m); } + Position &operator += (const Position &a) { x += a.x; y += a.y; return *this; } + Position &operator *= (const float m) { x *= m; y *= m; return *this; } + + float x; + float y; +}; + +class Rect +{ +public : + Rect() {} + Rect(const Position& botLeft, const Position& topRight): bl(botLeft), tr(topRight) {} + Rect widen(const Rect& other) { return Rect(Position(bl.x > other.bl.x ? other.bl.x : bl.x, bl.y > other.bl.y ? other.bl.y : bl.y), Position(tr.x > other.tr.x ? tr.x : other.tr.x, tr.y > other.tr.y ? tr.y : other.tr.y)); } + Rect operator + (const Position &a) const { return Rect(Position(bl.x + a.x, bl.y + a.y), Position(tr.x + a.x, tr.y + a.y)); } + Rect operator * (float m) const { return Rect(Position(bl.x, bl.y) * m, Position(tr.x, tr.y) * m); } + + Position bl; + Position tr; +}; + +} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Rule.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Rule.h new file mode 100644 index 00000000000..69442658e4d --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Rule.h @@ -0,0 +1,307 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ + +#pragma once + +#include "inc/Code.h" +#include "inc/Slot.h" + +namespace graphite2 { + +struct Rule { + const vm::Machine::Code * constraint, + * action; + unsigned short sort; + byte preContext; +#ifndef NDEBUG + uint16 rule_idx; +#endif + + Rule() : constraint(0), action(0), sort(0), preContext(0) {} + ~Rule(); + + CLASS_NEW_DELETE; + +private: + Rule(const Rule &); + Rule & operator = (const Rule &); +}; + +inline Rule::~Rule() +{ + delete constraint; + delete action; +} + + +struct RuleEntry +{ + const Rule * rule; + + inline + bool operator < (const RuleEntry &r) const + { + const unsigned short lsort = rule->sort, rsort = r.rule->sort; + return lsort > rsort || (lsort == rsort && rule < r.rule); + } + + inline + bool operator == (const RuleEntry &r) const + { + return rule == r.rule; + } +}; + + +struct State +{ + const RuleEntry * rules, + * rules_end; + const State * const * transitions; + + size_t size() const; + bool is_success() const; + bool is_transition() const; +}; + +inline +size_t State::size() const +{ + return rules_end - rules; +} + +inline +bool State::is_success() const +{ + return (rules != NULL); +} + +inline +bool State::is_transition() const +{ + return (transitions != NULL); +} + + +class SlotMap +{ +public: + enum {MAX_SLOTS=64}; + SlotMap(Segment & seg); + + Slot * * begin(); + Slot * * end(); + size_t size() const; + unsigned short context() const; + void reset(Slot &, unsigned short); + + Slot * const & operator[](int n) const; + Slot * & operator [] (int); + void pushSlot(Slot * const slot); + void collectGarbage(); + + Slot * highwater() { return m_highwater; } + void highwater(Slot *s) { m_highwater = s; m_highpassed = false; } + bool highpassed() const { return m_highpassed; } + void highpassed(bool v) { m_highpassed = v; } + + Segment & segment; +private: + Slot * m_slot_map[MAX_SLOTS+1]; + unsigned short m_size; + unsigned short m_precontext; + Slot * m_highwater; + bool m_highpassed; +}; + + +class FiniteStateMachine +{ +public: + enum {MAX_RULES=128}; + +private: + class Rules + { + public: + Rules(); + void clear(); + const RuleEntry * begin() const; + const RuleEntry * end() const; + size_t size() const; + + void accumulate_rules(const State &state); + + private: + RuleEntry * m_begin, + * m_end, + m_rules[MAX_RULES*2]; + }; + +public: + FiniteStateMachine(SlotMap & map, json * logger); + void reset(Slot * & slot, const short unsigned int max_pre_ctxt); + + Rules rules; + SlotMap & slots; + json * const dbgout; +}; + + +inline +FiniteStateMachine::FiniteStateMachine(SlotMap& map, json * logger) +: slots(map), + dbgout(logger) +{ +} + +inline +void FiniteStateMachine::reset(Slot * & slot, const short unsigned int max_pre_ctxt) +{ + rules.clear(); + int ctxt = 0; + for (; ctxt != max_pre_ctxt && slot->prev(); ++ctxt, slot = slot->prev()); + slots.reset(*slot, ctxt); +} + +inline +FiniteStateMachine::Rules::Rules() + : m_begin(m_rules), m_end(m_rules) +{ +} + +inline +void FiniteStateMachine::Rules::clear() +{ + m_end = m_begin; +} + +inline +const RuleEntry * FiniteStateMachine::Rules::begin() const +{ + return m_begin; +} + +inline +const RuleEntry * FiniteStateMachine::Rules::end() const +{ + return m_end; +} + +inline +size_t FiniteStateMachine::Rules::size() const +{ + return m_end - m_begin; +} + +inline +void FiniteStateMachine::Rules::accumulate_rules(const State &state) +{ + // Only bother if there are rules in the State object. + if (state.size() == 0) return; + + // Merge the new sorted rules list into the current sorted result set. + const RuleEntry * lre = begin(), * rre = state.rules; + RuleEntry * out = m_rules + (m_begin == m_rules)*MAX_RULES; + const RuleEntry * lrend = out + MAX_RULES; + m_begin = out; + while (lre != end() && out != lrend) + { + if (*lre < *rre) *out++ = *lre++; + else if (*rre < *lre) { *out++ = *rre++; } + else { *out++ = *lre++; ++rre; } + + if (rre == state.rules_end) + { + while (lre != end() && out != lrend) { *out++ = *lre++; } + m_end = out; + return; + } + } + while (rre != state.rules_end && out != lrend) { *out++ = *rre++; } + m_end = out; +} + +inline +SlotMap::SlotMap(Segment & seg) +: segment(seg), m_size(0), m_precontext(0), m_highwater(0), m_highpassed(false) +{ + m_slot_map[0] = 0; +} + +inline +Slot * * SlotMap::begin() +{ + return &m_slot_map[1]; // allow map to go 1 before slot_map when inserting + // at start of segment. +} + +inline +Slot * * SlotMap::end() +{ + return m_slot_map + m_size + 1; +} + +inline +size_t SlotMap::size() const +{ + return m_size; +} + +inline +short unsigned int SlotMap::context() const +{ + return m_precontext; +} + +inline +void SlotMap::reset(Slot & slot, short unsigned int ctxt) +{ + m_size = 0; + m_precontext = ctxt; + *m_slot_map = slot.prev(); +} + +inline +void SlotMap::pushSlot(Slot*const slot) +{ + m_slot_map[m_size++ + 1] = slot; +} + +inline +Slot * const & SlotMap::operator[](int n) const +{ + return m_slot_map[n + 1]; +} + +inline +Slot * & SlotMap::operator[](int n) +{ + return m_slot_map[n + 1]; +} + +} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/SegCache.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/SegCache.h new file mode 100644 index 00000000000..ac09966589c --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/SegCache.h @@ -0,0 +1,320 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + +#ifndef GRAPHITE2_NSEGCACHE + +#include +#include "inc/Main.h" +#include "inc/Slot.h" +#include "inc/FeatureVal.h" +#include "inc/SegCacheEntry.h" +#include "inc/Segment.h" + +namespace graphite2 { + +class SegCache; +class SegCacheEntry; +class SegCacheStore; + +/** + * SegPrefixEntry stores lists of word/syllable segments + * with one list for each word length. The prefix size should be chosen so that + * these list sizes stay small since they will be searched iteratively. + */ +class SegCachePrefixEntry +{ + SegCachePrefixEntry(const SegCachePrefixEntry &); + SegCachePrefixEntry & operator = (const SegCachePrefixEntry &); + +public: + SegCachePrefixEntry() : m_lastPurge(0) + { + memset(m_entryCounts, 0, sizeof m_entryCounts); + memset(m_entryBSIndex, 0, sizeof m_entryBSIndex); + memset(m_entries, 0, sizeof m_entries); + } + + ~SegCachePrefixEntry() + { + for (size_t j = 0; j < eMaxSpliceSize; j++) + { + if (m_entryCounts[j]) + { + assert(m_entries[j]); + for (size_t k = 0; k < m_entryCounts[j]; k++) + m_entries[j][k].clear(); + + free(m_entries[j]); + } + } + } + const SegCacheEntry * find(const uint16 * cmapGlyphs, size_t length) const + { + if (length <= ePrefixLength) + { + assert(m_entryCounts[length-1] <= 1); + if (m_entries[length-1]) + return m_entries[length-1]; + return NULL; + } + SegCacheEntry * entry = NULL; + findPosition(cmapGlyphs, length, &entry); + return entry; + } + SegCacheEntry * cache(const uint16* cmapGlyphs, size_t length, Segment * seg, size_t charOffset, unsigned long long totalAccessCount) + { + size_t listSize = m_entryBSIndex[length-1]? (m_entryBSIndex[length-1] << 1) - 1 : 0; + SegCacheEntry * newEntries = NULL; + if (m_entryCounts[length-1] + 1u > listSize) + { + if (m_entryCounts[length-1] == 0) + { + listSize = 1; + } + else + { + // the problem comes when you get incremental numeric ids in a large doc + if (listSize >= eMaxSuffixCount) + return NULL; + listSize = (m_entryBSIndex[length-1] << 2) - 1; + } + newEntries = gralloc(listSize); + if (!newEntries) + { + return NULL; + } + } + + uint16 insertPos = 0; + if (m_entryCounts[length-1] > 0) + { + insertPos = findPosition(cmapGlyphs, length, NULL); + if (!newEntries) + { + // same buffer, shift entries up + memmove(m_entries[length-1] + insertPos + 1, m_entries[length-1] + insertPos, + sizeof(SegCacheEntry) * (m_entryCounts[length-1] - insertPos)); + } + else + { + memcpy(newEntries, m_entries[length-1], sizeof(SegCacheEntry) * (insertPos)); + memcpy(newEntries + insertPos + 1, m_entries[length-1] + insertPos, + sizeof(SegCacheEntry) * (m_entryCounts[length-1] - insertPos)); + + free(m_entries[length-1]); + m_entries[length-1] = newEntries; + assert (m_entryBSIndex[length-1]); + m_entryBSIndex[length-1] <<= 1; + } + } + else + { + m_entryBSIndex[length-1] = 1; + m_entries[length-1] = newEntries; + } + m_entryCounts[length-1] += 1; + new (m_entries[length-1] + insertPos) + SegCacheEntry(cmapGlyphs, length, seg, charOffset, totalAccessCount); + return m_entries[length-1] + insertPos; + } + uint32 purge(unsigned long long minAccessCount, unsigned long long oldAccessTime, + unsigned long long currentTime); + CLASS_NEW_DELETE +private: + uint16 findPosition(const uint16 * cmapGlyphs, uint16 length, SegCacheEntry ** entry) const + { + int dir = 0; + if (m_entryCounts[length-1] == 0) + { + if (entry) *entry = NULL; + return 0; + } + else if (m_entryCounts[length-1] == 1) + { + // optimize single entry case + for (int i = ePrefixLength; i < length; i++) + { + if (cmapGlyphs[i] > m_entries[length-1][0].m_unicode[i]) + { + return 1; + } + else if (cmapGlyphs[i] < m_entries[length-1][0].m_unicode[i]) + { + return 0; + } + } + if (entry) + *entry = m_entries[length-1]; + return 0; + } + uint16 searchIndex = m_entryBSIndex[length-1] - 1; + uint16 stepSize = m_entryBSIndex[length-1] >> 1; + size_t prevIndex = searchIndex; + do + { + dir = 0; + if (searchIndex >= m_entryCounts[length-1]) + { + dir = -1; + searchIndex -= stepSize; + stepSize >>= 1; + } + else + { + for (int i = ePrefixLength; i < length; i++) + { + if (cmapGlyphs[i] > m_entries[length-1][searchIndex].m_unicode[i]) + { + dir = 1; + searchIndex += stepSize; + stepSize >>= 1; + break; + } + else if (cmapGlyphs[i] < m_entries[length-1][searchIndex].m_unicode[i]) + { + dir = -1; + searchIndex -= stepSize; + stepSize >>= 1; + break; + } + } + } + if (prevIndex == searchIndex) + break; + prevIndex = searchIndex; + } while (dir != 0); + if (entry) + { + if (dir == 0) + *entry = m_entries[length-1] + searchIndex; + else + *entry = NULL; + } + else + { + // if entry is null, then this is for inserting a new value, which + // shouldn't already be in the cache + assert(dir != 0); + if (dir > 0) + ++searchIndex; + } + return searchIndex; + } + /** m_entries is a null terminated list of entries */ + uint16 m_entryCounts[eMaxSpliceSize]; + uint16 m_entryBSIndex[eMaxSpliceSize]; + SegCacheEntry * m_entries[eMaxSpliceSize]; + unsigned long long m_lastPurge; +}; + + +#define SEG_CACHE_MIN_INDEX (store->maxCmapGid()) +#define SEG_CACHE_MAX_INDEX (store->maxCmapGid()+1u) +#define SEG_CACHE_UNSET_INDEX (store->maxCmapGid()+2u) + +union SegCachePrefixArray +{ + void ** raw; + SegCachePrefixArray * array; + SegCachePrefixEntry ** prefixEntries; + uintptr * range; +}; + +class SegCache +{ +public: + SegCache(const SegCacheStore * store, const Features& features); + ~SegCache(); + + const SegCacheEntry * find(const uint16 * cmapGlyphs, size_t length) const; + SegCacheEntry * cache(SegCacheStore * store, const uint16 * cmapGlyphs, size_t length, Segment * seg, size_t charOffset); + void purge(SegCacheStore * store); + + long long totalAccessCount() const { return m_totalAccessCount; } + size_t segmentCount() const { return m_segmentCount; } + const Features & features() const { return m_features; } + void clear(SegCacheStore * store); + + CLASS_NEW_DELETE +private: + void freeLevel(SegCacheStore * store, SegCachePrefixArray prefixes, size_t level); + void purgeLevel(SegCacheStore * store, SegCachePrefixArray prefixes, size_t level, + unsigned long long minAccessCount, unsigned long long oldAccessTime); + + uint16 m_prefixLength; + uint16 m_maxCachedSegLength; + size_t m_segmentCount; + SegCachePrefixArray m_prefixes; + Features m_features; + mutable unsigned long long m_totalAccessCount; + mutable unsigned long long m_totalMisses; + float m_purgeFactor; +}; + +inline const SegCacheEntry * SegCache::find(const uint16 * cmapGlyphs, size_t length) const +{ + uint16 pos = 0; + if (!length || length > eMaxSpliceSize) return NULL; + SegCachePrefixArray pEntry = m_prefixes.array[cmapGlyphs[0]]; + while (++pos < m_prefixLength - 1) + { + if (!pEntry.raw) + { + ++m_totalMisses; + return NULL; + } + pEntry = pEntry.array[(pos < length)? cmapGlyphs[pos] : 0]; + } + if (!pEntry.raw) + { + ++m_totalMisses; + return NULL; + } + SegCachePrefixEntry * prefixEntry = pEntry.prefixEntries[(pos < length)? cmapGlyphs[pos] : 0]; + if (!prefixEntry) + { + ++m_totalMisses; + return NULL; + } + const SegCacheEntry * entry = prefixEntry->find(cmapGlyphs, length); + if (entry) + { + ++m_totalAccessCount; + entry->accessed(m_totalAccessCount); + } + else + { + ++m_totalMisses; + } + return entry; +} + +} // namespace graphite2 + +#endif + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/SegCacheEntry.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/SegCacheEntry.h new file mode 100644 index 00000000000..9a7d930677c --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/SegCacheEntry.h @@ -0,0 +1,121 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + +#ifndef GRAPHITE2_NSEGCACHE + +#include "inc/Main.h" +#include "inc/Slot.h" + +namespace graphite2 { + +class Segment; +class Slot; +class SegCacheEntry; +class SegCachePrefixEntry; + +enum SegCacheParameters { + /** number of characters used in initial prefix tree */ + ePrefixLength = 2, + /** Segments more recent than maxSegmentCount() / eAgeFactor are kept */ + eAgeFactor = 4, + /** Segments are purged according to the formular: + * accessCount < (totalAccesses)/(ePurgeFactor * maxSegments) */ + ePurgeFactor = 5, + /** Maximum number of Segments to store which have the same + * prefix. Needed to prevent unique identifiers flooding the cache */ + eMaxSuffixCount = 15 + +}; + +class SegCacheCharInfo +{ +public: + uint16 m_unicode; + uint16 m_before; + uint16 m_after; +}; + +/** + * SegCacheEntry stores the result of running the engine for specific unicode + * code points in the typical mid-line situation. + */ +class SegCacheEntry +{ + // Prevent any implict copying; + SegCacheEntry(const SegCacheEntry &); + SegCacheEntry & operator = (const SegCacheEntry &); + + friend class SegCachePrefixEntry; +public: + SegCacheEntry() : + m_glyphLength(0), m_unicode(NULL), m_glyph(NULL), m_attr(NULL), m_justs(0), + m_accessCount(0), m_lastAccess(0) + {} + SegCacheEntry(const uint16 * cmapGlyphs, size_t length, Segment * seg, size_t charOffset, long long cacheTime); + ~SegCacheEntry() { clear(); }; + void clear(); + size_t glyphLength() const { return m_glyphLength; } + const Slot * first() const { return m_glyph; } + const Slot * last() const { return m_glyph + (m_glyphLength - 1); } + + /** Total number of times this entry has been accessed since creation */ + unsigned long long accessCount() const { return m_accessCount; } + /** "time" of last access where "time" is measured in accesses to the cache owning this entry */ + void accessed(unsigned long long cacheTime) const + { + m_lastAccess = cacheTime; ++m_accessCount; + }; + + int compareRank(const SegCacheEntry & entry) const + { + if (m_accessCount > entry.m_accessCount) return 1; + else if (m_accessCount < entry.m_accessCount) return 1; + else if (m_lastAccess > entry.m_lastAccess) return 1; + else if (m_lastAccess < entry.m_lastAccess) return -1; + return 0; + } + unsigned long long lastAccess() const { return m_lastAccess; }; + + CLASS_NEW_DELETE; +private: + + size_t m_glyphLength; + /** glyph ids resulting from cmap mapping from unicode to glyph before substitution + * the length of this array is determined by the position in the SegCachePrefixEntry */ + uint16 * m_unicode; + /** slots after shapping and positioning */ + Slot * m_glyph; + int16 * m_attr; + byte * m_justs; + mutable unsigned long long m_accessCount; + mutable unsigned long long m_lastAccess; +}; + +} // namespace graphite2 + +#endif diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/SegCacheStore.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/SegCacheStore.h new file mode 100644 index 00000000000..1e6a6e216e7 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/SegCacheStore.h @@ -0,0 +1,127 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + +#ifndef GRAPHITE2_NSEGCACHE + +#include "inc/Main.h" +#include "inc/CmapCache.h" +#include "inc/SegCache.h" + +namespace graphite2 { + +class SegCache; +class Face; + +class SilfSegCache +{ + SilfSegCache(const SilfSegCache &); + SilfSegCache & operator = (const SilfSegCache &); + +public: + SilfSegCache() : m_caches(NULL), m_cacheCount(0) {}; + ~SilfSegCache() + { + assert(m_caches == NULL); + } + void clear(SegCacheStore * cacheStore) + { + for (size_t i = 0; i < m_cacheCount; i++) + { + m_caches[i]->clear(cacheStore); + delete m_caches[i]; + } + free(m_caches); + m_caches = NULL; + m_cacheCount = 0; + } + SegCache * getOrCreate(SegCacheStore * cacheStore, const Features & features) + { + for (size_t i = 0; i < m_cacheCount; i++) + { + if (m_caches[i]->features() == features) + return m_caches[i]; + } + SegCache ** newData = gralloc(m_cacheCount+1); + if (newData) + { + if (m_cacheCount > 0) + { + memcpy(newData, m_caches, sizeof(SegCache*) * m_cacheCount); + free(m_caches); + } + m_caches = newData; + m_caches[m_cacheCount] = new SegCache(cacheStore, features); + m_cacheCount++; + return m_caches[m_cacheCount - 1]; + } + return NULL; + } + CLASS_NEW_DELETE +private: + SegCache ** m_caches; + size_t m_cacheCount; +}; + +class SegCacheStore +{ + SegCacheStore(const SegCacheStore &); + SegCacheStore & operator = (const SegCacheStore &); + +public: + SegCacheStore(const Face & face, unsigned int numSilf, size_t maxSegments); + ~SegCacheStore() + { + for (size_t i = 0; i < m_numSilf; i++) + { + m_caches[i].clear(this); + } + delete [] m_caches; + m_caches = NULL; + } + SegCache * getOrCreate(unsigned int i, const Features & features) + { + return m_caches[i].getOrCreate(this, features); + } + bool isSpaceGlyph(uint16 gid) const { return (gid == m_spaceGid) || (gid == m_zwspGid); } + uint16 maxCmapGid() const { return m_maxCmapGid; } + uint32 maxSegmentCount() const { return m_maxSegments; }; + + CLASS_NEW_DELETE +private: + SilfSegCache * m_caches; + uint8 m_numSilf; + uint32 m_maxSegments; + uint16 m_maxCmapGid; + uint16 m_spaceGid; + uint16 m_zwspGid; +}; + +} // namespace graphite2 + +#endif + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Segment.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Segment.h new file mode 100644 index 00000000000..a36fb73d500 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Segment.h @@ -0,0 +1,270 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + +#include "inc/Main.h" + +#include + +#include "inc/CharInfo.h" +#include "inc/Face.h" +#include "inc/FeatureVal.h" +#include "inc/GlyphCache.h" +#include "inc/GlyphFace.h" +//#include "inc/Silf.h" +#include "inc/Slot.h" +#include "inc/Position.h" +#include "inc/List.h" + +#define MAX_SEG_GROWTH_FACTOR 256 + +namespace graphite2 { + +typedef Vector FeatureList; +typedef Vector SlotRope; +typedef Vector AttributeRope; +typedef Vector JustifyRope; + +#ifndef GRAPHITE2_NSEGCACHE +class SegmentScopeState; +#endif +class Font; +class Segment; +class Silf; + +enum SpliceParam { +/** sub-Segments longer than this are not cached + * (in Unicode code points) */ + eMaxSpliceSize = 96 +}; + +enum justFlags { + gr_justStartInline = 1, + gr_justEndInline = 2 +}; + +class SegmentScopeState +{ +private: + friend class Segment; + Slot * realFirstSlot; + Slot * slotBeforeScope; + Slot * slotAfterScope; + Slot * realLastSlot; + size_t numGlyphsOutsideScope; +}; + +class Segment +{ + // Prevent copying of any kind. + Segment(const Segment&); + Segment& operator=(const Segment&); + +public: + unsigned int slotCount() const { return m_numGlyphs; } //one slot per glyph + void extendLength(int num) { m_numGlyphs += num; } + Position advance() const { return m_advance; } + bool runGraphite() { if (m_silf) return m_face->runGraphite(this, m_silf); else return true;}; + void chooseSilf(uint32 script) { m_silf = m_face->chooseSilf(script); } + const Silf *silf() const { return m_silf; } + unsigned int charInfoCount() const { return m_numCharinfo; } + const CharInfo *charinfo(unsigned int index) const { return index < m_numCharinfo ? m_charinfo + index : NULL; } + CharInfo *charinfo(unsigned int index) { return index < m_numCharinfo ? m_charinfo + index : NULL; } + int8 dir() const { return m_dir; } + + Segment(unsigned int numchars, const Face* face, uint32 script, int dir); + ~Segment(); +#ifndef GRAPHITE2_NSEGCACHE + SegmentScopeState setScope(Slot * firstSlot, Slot * lastSlot, size_t subLength); + void removeScope(SegmentScopeState & state); + void append(const Segment &other); + void splice(size_t offset, size_t length, Slot * const startSlot, + Slot * endSlot, const Slot * srcSlot, + const size_t numGlyphs); +#endif + Slot *first() { return m_first; } + void first(Slot *p) { m_first = p; } + Slot *last() { return m_last; } + void last(Slot *p) { m_last = p; } + void appendSlot(int i, int cid, int gid, int fid, size_t coffset); + Slot *newSlot(); + void freeSlot(Slot *); + SlotJustify *newJustify(); + void freeJustify(SlotJustify *aJustify); + Position positionSlots(const Font *font, Slot *first=0, Slot *last=0); + void associateChars(); + void linkClusters(Slot *first, Slot *last); + uint16 getClassGlyph(uint16 cid, uint16 offset) const { return m_silf->getClassGlyph(cid, offset); } + uint16 findClassIndex(uint16 cid, uint16 gid) const { return m_silf->findClassIndex(cid, gid); } + int addFeatures(const Features& feats) { m_feats.push_back(feats); return m_feats.size() - 1; } + uint32 getFeature(int index, uint8 findex) const { const FeatureRef* pFR=m_face->theSill().theFeatureMap().featureRef(findex); if (!pFR) return 0; else return pFR->getFeatureVal(m_feats[index]); } + void dir(int8 val) { m_dir = val; } + int16 glyphAttr(uint16 gid, uint16 gattr) const { const GlyphFace * p = m_face->glyphs().glyphSafe(gid); return p ? p->attrs()[gattr] : 0; } + int32 getGlyphMetric(Slot *iSlot, uint8 metric, uint8 attrLevel) const; + float glyphAdvance(uint16 gid) const { return m_face->glyphs().glyph(gid)->theAdvance().x; } + const Rect &theGlyphBBoxTemporary(uint16 gid) const { return m_face->glyphs().glyph(gid)->theBBox(); } //warning value may become invalid when another glyph is accessed + Slot *findRoot(Slot *is) const { return is->attachedTo() ? findRoot(is->attachedTo()) : is; } + int numAttrs() const { return m_silf->numUser(); } + int defaultOriginal() const { return m_defaultOriginal; } + const Face * getFace() const { return m_face; } + const Features & getFeatures(unsigned int /*charIndex*/) { assert(m_feats.size() == 1); return m_feats[0]; } + void bidiPass(uint8 aBidi, int paradir, uint8 aMirror); + Slot *addLineEnd(Slot *nSlot); + void delLineEnd(Slot *s); + bool hasJustification() const { return m_justifies.size() != 0; } + + bool isWhitespace(const int cid) const; + + CLASS_NEW_DELETE + +public: //only used by: GrSegment* makeAndInitialize(const GrFont *font, const GrFace *face, uint32 script, const FeaturesHandle& pFeats/*must not be IsNull*/, encform enc, const void* pStart, size_t nChars, int dir); + void read_text(const Face *face, const Features* pFeats/*must not be NULL*/, gr_encform enc, const void*pStart, size_t nChars); + void prepare_pos(const Font *font); + void finalise(const Font *font); + float justify(Slot *pSlot, const Font *font, float width, enum justFlags flags, Slot *pFirst, Slot *pLast); + +private: + Rect m_bbox; // ink box of the segment + Position m_advance; // whole segment advance + SlotRope m_slots; // Vector of slot buffers + AttributeRope m_userAttrs; // Vector of userAttrs buffers + JustifyRope m_justifies; // Slot justification info buffers + FeatureList m_feats; // feature settings referenced by charinfos in this segment + Slot * m_freeSlots; // linked list of free slots + SlotJustify * m_freeJustifies; // Slot justification blocks free list + CharInfo * m_charinfo; // character info, one per input character + const Face * m_face; // GrFace + const Silf * m_silf; + Slot * m_first; // first slot in segment + Slot * m_last; // last slot in segment + unsigned int m_bufSize, // how big a buffer to create when need more slots + m_numGlyphs, + m_numCharinfo; // size of the array and number of input characters + int m_defaultOriginal; // number of whitespace chars in the string + int8 m_dir; +}; + + + +inline +void Segment::finalise(const Font *font) +{ + if (!m_first) return; + + m_advance = positionSlots(font); + associateChars(); + linkClusters(m_first, m_last); +} + +inline +int32 Segment::getGlyphMetric(Slot *iSlot, uint8 metric, uint8 attrLevel) const { + if (attrLevel > 0) + { + Slot *is = findRoot(iSlot); + return is->clusterMetric(this, metric, attrLevel); + } + else + return m_face->getGlyphMetric(iSlot->gid(), metric); +} + +inline +bool Segment::isWhitespace(const int cid) const +{ + return ((cid >= 0x0009) * (cid <= 0x000D) + + (cid == 0x0020) + + (cid == 0x0085) + + (cid == 0x00A0) + + (cid == 0x1680) + + (cid == 0x180E) + + (cid >= 0x2000) * (cid <= 0x200A) + + (cid == 0x2028) + + (cid == 0x2029) + + (cid == 0x202F) + + (cid == 0x205F) + + (cid == 0x3000)) != 0; +} + +//inline +//bool Segment::isWhitespace(const int cid) const +//{ +// switch (cid >> 8) +// { +// case 0x00: +// switch (cid) +// { +// case 0x09: +// case 0x0A: +// case 0x0B: +// case 0x0C: +// case 0x0D: +// case 0x20: +// return true; +// default: +// break; +// } +// break; +// case 0x16: +// return cid == 0x1680; +// break; +// case 0x18: +// return cid == 0x180E; +// break; +// case 0x20: +// switch (cid) +// { +// case 0x00: +// case 0x01: +// case 0x02: +// case 0x03: +// case 0x04: +// case 0x05: +// case 0x06: +// case 0x07: +// case 0x08: +// case 0x09: +// case 0x0A: +// case 0x28: +// case 0x29: +// case 0x2F: +// case 0x5F: +// return true +// default: +// break; +// } +// break; +// case 0x30: +// return cid == 0x3000; +// break; +// } +// +// return false; +//} + +} // namespace graphite2 + +struct gr_segment : public graphite2::Segment {}; + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Silf.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Silf.h new file mode 100644 index 00000000000..652f084c8ec --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Silf.h @@ -0,0 +1,126 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + +#include "graphite2/Font.h" +#include "inc/Main.h" +#include "inc/Pass.h" + +namespace graphite2 { + +class Face; +class Segment; +class FeatureVal; +class VMScratch; + +class Pseudo +{ +public: + uint32 uid; + uint32 gid; + CLASS_NEW_DELETE; +}; + +class Justinfo +{ +public: + Justinfo(uint8 stretch, uint8 shrink, uint8 step, uint8 weight) : + m_astretch(stretch), m_ashrink(shrink), m_astep(step), + m_aweight(weight) {}; + uint8 attrStretch() const { return m_astretch; } + uint8 attrShrink() const { return m_ashrink; } + uint8 attrStep() const { return m_astep; } + uint8 attrWeight() const { return m_aweight; } + +private: + uint8 m_astretch; + uint8 m_ashrink; + uint8 m_astep; + uint8 m_aweight; +}; + +class Silf +{ + // Prevent copying + Silf(const Silf&); + Silf& operator=(const Silf&); + +public: + Silf() throw(); + ~Silf() throw(); + + bool readGraphite(const byte * const pSilf, size_t lSilf, const Face &face, uint32 version); + bool runGraphite(Segment *seg, uint8 firstPass=0, uint8 lastPass=0) const; + uint16 findClassIndex(uint16 cid, uint16 gid) const; + uint16 getClassGlyph(uint16 cid, unsigned int index) const; + uint16 findPseudo(uint32 uid) const; + uint8 numUser() const { return m_aUser; } + uint8 aPseudo() const { return m_aPseudo; } + uint8 aBreak() const { return m_aBreak; } + uint8 aMirror() const {return m_aMirror; } + uint8 substitutionPass() const { return m_sPass; } + uint8 positionPass() const { return m_pPass; } + uint8 justificationPass() const { return m_jPass; } + uint8 bidiPass() const { return m_bPass; } + uint8 numPasses() const { return m_numPasses; } + uint8 maxCompPerLig() const { return m_iMaxComp; } + uint16 numClasses() const { return m_nClass; } + byte flags() const { return m_flags; } + uint8 numJustLevels() const { return m_numJusts; } + Justinfo *justAttrs() const { return m_justs; } + uint16 endLineGlyphid() const { return m_gEndLine; } + const gr_faceinfo *silfInfo() const { return &m_silfinfo; } + + CLASS_NEW_DELETE; + +private: + size_t readClassMap(const byte *p, size_t data_len, uint32 version); + template inline uint32 readClassOffsets(const byte *&p, size_t data_len); + + Pass * m_passes; + Pseudo * m_pseudos; + uint32 * m_classOffsets; + uint16 * m_classData; + Justinfo * m_justs; + uint8 m_numPasses; + uint8 m_numJusts; + uint8 m_sPass, m_pPass, m_jPass, m_bPass, + m_flags; + + uint8 m_aPseudo, m_aBreak, m_aUser, m_aBidi, m_aMirror, + m_iMaxComp; + uint16 m_aLig, + m_numPseudo, + m_nClass, + m_nLinear, + m_gEndLine; + gr_faceinfo m_silfinfo; + + void releaseBuffers() throw(); +}; + +} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Slot.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Slot.h new file mode 100644 index 00000000000..3f0c473889a --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Slot.h @@ -0,0 +1,169 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + +#include "graphite2/Types.h" +#include "graphite2/Segment.h" +#include "inc/Main.h" +#include "inc/Font.h" +#include "inc/Position.h" + + + +namespace graphite2 { + +typedef gr_attrCode attrCode; + +class GlyphFace; +class Segment; +class SegCacheEntry; + +struct SlotJustify +{ + static const int NUMJUSTPARAMS = 5; + + SlotJustify(const SlotJustify &); + SlotJustify & operator = (const SlotJustify &); + +public: + static size_t size_of(size_t levels) { return sizeof(SlotJustify) + ((levels > 1 ? levels : 1)*NUMJUSTPARAMS - 1)*sizeof(int16); } + + void LoadSlot(const Slot *s, const Segment *seg); + + SlotJustify *next; + int16 values[1]; +}; + +class Slot +{ + enum Flag + { + DELETED = 1, + INSERTED = 2, + COPIED = 4, + POSITIONED = 8, + ATTACHED = 16 + }; + +public: + struct iterator; + + unsigned short gid() const { return m_glyphid; } + Position origin() const { return m_position; } + float advance() const { return m_advance.x; } + Position advancePos() const { return m_advance; } + int before() const { return m_before; } + int after() const { return m_after; } + uint32 index() const { return m_index; } + void index(uint32 val) { m_index = val; } + + Slot(); + void set(const Slot & slot, int charOffset, size_t numUserAttr, size_t justLevels); + Slot *next() const { return m_next; } + void next(Slot *s) { m_next = s; } + Slot *prev() const { return m_prev; } + void prev(Slot *s) { m_prev = s; } + uint16 glyph() const { return m_realglyphid ? m_realglyphid : m_glyphid; } + void setGlyph(Segment *seg, uint16 glyphid, const GlyphFace * theGlyph = NULL); + void setRealGid(uint16 realGid) { m_realglyphid = realGid; } + void adjKern(const Position &pos) { m_shift = m_shift + pos; m_advance = m_advance + pos; } + void origin(const Position &pos) { m_position = pos + m_shift; } + void originate(int ind) { m_original = ind; } + int original() const { return m_original; } + void before(int ind) { m_before = ind; } + void after(int ind) { m_after = ind; } + bool isBase() const { return (!m_parent); } + void update(int numSlots, int numCharInfo, Position &relpos); + Position finalise(const Segment* seg, const Font* font, Position & base, Rect & bbox, uint8 attrLevel, float & clusterMin); + bool isDeleted() const { return (m_flags & DELETED) ? true : false; } + void markDeleted(bool state) { if (state) m_flags |= DELETED; else m_flags &= ~DELETED; } + bool isCopied() const { return (m_flags & COPIED) ? true : false; } + void markCopied(bool state) { if (state) m_flags |= COPIED; else m_flags &= ~COPIED; } + bool isPositioned() const { return (m_flags & POSITIONED) ? true : false; } + void markPositioned(bool state) { if (state) m_flags |= POSITIONED; else m_flags &= ~POSITIONED; } + bool isInsertBefore() const { return !(m_flags & INSERTED); } + uint8 getBidiLevel() const { return m_bidiLevel; } + void setBidiLevel(uint8 level) { m_bidiLevel = level; } + uint8 getBidiClass() const { return m_bidiCls; } + void setBidiClass(uint8 cls) { m_bidiCls = cls; } + int16 *userAttrs() const { return m_userAttr; } + void userAttrs(int16 *p) { m_userAttr = p; } + void markInsertBefore(bool state) { if (!state) m_flags |= INSERTED; else m_flags &= ~INSERTED; } + void setAttr(Segment* seg, attrCode ind, uint8 subindex, int16 val, const SlotMap & map); + int getAttr(const Segment *seg, attrCode ind, uint8 subindex) const; + int getJustify(const Segment *seg, uint8 level, uint8 subindex) const; + void setJustify(Segment *seg, uint8 level, uint8 subindex, int16 value); + bool isLocalJustify() const { return m_justs != NULL; }; + void attachTo(Slot *ap) { m_parent = ap; } + Slot *attachedTo() const { return m_parent; } + Position attachOffset() const { return m_attach - m_with; } + Slot* firstChild() const { return m_child; } + bool child(Slot *ap); + Slot* nextSibling() const { return m_sibling; } + bool sibling(Slot *ap); + bool removeChild(Slot *ap); + bool removeSibling(Slot *ap); + int32 clusterMetric(const Segment* seg, uint8 metric, uint8 attrLevel); + void positionShift(Position a) { m_position += a; } + void floodShift(Position adj); + float just() const { return m_just; } + void just(float j) { m_just = j; } + + CLASS_NEW_DELETE + +private: + Slot *m_next; // linked list of slots + Slot *m_prev; + unsigned short m_glyphid; // glyph id + uint16 m_realglyphid; + uint32 m_original; // charinfo that originated this slot (e.g. for feature values) + uint32 m_before; // charinfo index of before association + uint32 m_after; // charinfo index of after association + uint32 m_index; // slot index given to this slot during finalising + Slot *m_parent; // index to parent we are attached to + Slot *m_child; // index to first child slot that attaches to us + Slot *m_sibling; // index to next child that attaches to our parent + Position m_position; // absolute position of glyph + Position m_shift; // .shift slot attribute + Position m_advance; // .advance slot attribute + Position m_attach; // attachment point on us + Position m_with; // attachment point position on parent + float m_just; // Justification inserted space + uint8 m_flags; // holds bit flags + byte m_attLevel; // attachment level + byte m_bidiCls; // bidirectional class + byte m_bidiLevel; // bidirectional level + int16 *m_userAttr; // pointer to user attributes + SlotJustify *m_justs; // pointer to justification parameters + + friend class SegCacheEntry; + friend class Segment; +}; + +} // namespace graphite2 + +struct gr_slot : public graphite2::Slot {}; diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Sparse.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Sparse.h new file mode 100644 index 00000000000..bbe6bcfb95c --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/Sparse.h @@ -0,0 +1,157 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once +#include +#include + +#include "inc/Main.h" + +namespace graphite2 { + + +// A read-only packed fast sparse array of uint16 with uint16 keys. +// Like most container classes this has capacity and size properties and these +// refer to the number of stored entries and the number of addressable entries +// as normal. However due the sparse nature the capacity is always <= than the +// size. +class sparse +{ +public: + typedef uint16 key_type; + typedef uint16 mapped_type; + typedef std::pair value_type; + +private: + typedef unsigned long mask_t; + + static const unsigned char SIZEOF_CHUNK = (sizeof(mask_t) - sizeof(key_type))*8; + + struct chunk + { + mask_t mask:SIZEOF_CHUNK; + key_type offset; + }; + + sparse(const sparse &); + sparse & operator = (const sparse &); + +public: + template + sparse(I first, const I last); + sparse() throw(); + ~sparse() throw(); + + operator bool () const throw(); + mapped_type operator [] (const key_type k) const throw(); + + size_t capacity() const throw(); + size_t size() const throw(); + + size_t _sizeof() const throw(); + + CLASS_NEW_DELETE; + +private: + union { + chunk * map; + mapped_type * values; + } m_array; + key_type m_nchunks; +}; + + +inline +sparse::sparse() throw() : m_nchunks(0) +{ + m_array.map = 0; +} + + +template +sparse::sparse(I attr, const I last) +: m_nchunks(0) +{ + m_array.map = 0; + + // Find the maximum extent of the key space. + size_t n_values=0; + for (I i = attr; i != last; ++i, ++n_values) + { + const key_type k = (*i).first / SIZEOF_CHUNK; + if (k >= m_nchunks) m_nchunks = k+1; + } + if (m_nchunks == 0) return; + + m_array.values = grzeroalloc((m_nchunks*sizeof(chunk) + sizeof(mapped_type)/2) + / sizeof(mapped_type) + + n_values*sizeof(mapped_type)); + + if (m_array.values == 0) + { + free(m_array.values); m_array.map=0; + return; + } + + chunk * ci = m_array.map; + ci->offset = (m_nchunks*sizeof(chunk) + sizeof(mapped_type)-1)/sizeof(mapped_type); + mapped_type * vi = m_array.values + ci->offset; + for (; attr != last; ++attr, ++vi) + { + const typename std::iterator_traits::value_type v = *attr; + chunk * const ci_ = m_array.map + v.first/SIZEOF_CHUNK; + + if (ci != ci_) + { + ci = ci_; + ci->offset = vi - m_array.values; + } + + ci->mask |= 1UL << (SIZEOF_CHUNK - 1 - (v.first % SIZEOF_CHUNK)); + *vi = v.second; + } +} + + +inline +sparse::operator bool () const throw() +{ + return m_array.map != 0; +} + +inline +size_t sparse::size() const throw() +{ + return m_nchunks*SIZEOF_CHUNK; +} + +inline +size_t sparse::_sizeof() const throw() +{ + return sizeof(sparse) + capacity()*sizeof(mapped_type) + m_nchunks*sizeof(chunk); +} + +} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/TtfTypes.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/TtfTypes.h new file mode 100644 index 00000000000..49ffa39229e --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/TtfTypes.h @@ -0,0 +1,419 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once +/*--------------------------------------------------------------------*//*:Ignore this sentence. + +File: TtfTypes.h +Responsibility: Tim Eves +Last reviewed: Not yet. + +Description: +Provides types required to represent the TTF basic types. +-------------------------------------------------------------------------------*//*:End Ignore*/ + + +//********************************************************************************************** +// Include files +//********************************************************************************************** +namespace graphite2 +{ +namespace TtfUtil +{ +//********************************************************************************************** +// Forward declarations +//********************************************************************************************** + + +//********************************************************************************************** +// Type declarations +//********************************************************************************************** +typedef unsigned char uint8; +typedef uint8 byte; +typedef signed char int8; +typedef unsigned short uint16; +typedef short int16; +typedef unsigned int uint32; +typedef int int32; + +typedef int16 short_frac; +typedef int32 fixed; +typedef int16 fword; +typedef uint16 ufword; +typedef int16 f2dot14; +typedef uint32 long_date_time[2]; + +//********************************************************************************************** +// Constants and enum types +//**********************************************************************************************/ +enum +{ + OneFix = 1<<16 +}; + +//********************************************************************************************** +// Table declarations +//********************************************************************************************** +namespace Sfnt +{ +#pragma pack(1) // We need this or the structure members aren't alligned + // correctly. Fortunately this form of pragma is supposed + // to be recongnised by VS C++ too (at least according to + // MSDN). + + struct OffsetSubTable + { + uint32 scaler_type; + uint16 num_tables, + search_range, + entry_selector, + range_shift; + struct Entry + { + uint32 tag, + checksum, + offset, + length; + } table_directory[1]; + + enum ScalerType + { + TrueTypeMac = 0x74727565U, + TrueTypeWin = 0x00010000U, + Type1 = 0x74797031U + }; + }; + + + + + struct CharacterCodeMap + { + uint16 version, + num_subtables; + struct + { + uint16 platform_id, + platform_specific_id; + uint32 offset; + } encoding[1]; + }; + + struct CmapSubTable + { + uint16 format, + length, + language; + }; + + struct CmapSubTableFormat4 : CmapSubTable + { + uint16 seg_count_x2, + search_range, + entry_selector, + range_shift, + end_code[1]; + // There are arrarys after this which need their + // start positions calculated since end_code is + // seg_count uint16s long. + }; + + struct CmapSubTableFormat12 + { + fixed format; + uint32 length, + language, + num_groups; + struct + { + uint32 start_char_code, + end_char_code, + start_glyph_id; + } group[1]; + }; + + + + struct FontHeader + { + fixed version, + font_revision; + uint32 check_sum_adjustment, + magic_number; + uint16 flags, + units_per_em; + long_date_time created, + modified; + fword x_min, + y_min, + x_max, + y_max; + uint16 mac_style, + lowest_rec_ppem; + int16 font_direction_hint, + index_to_loc_format, + glyph_data_format; + enum + { + MagicNumber = 0x5F0F3CF5, + GlypDataFormat = 0 + }; + enum {ShortIndexLocFormat, LongIndexLocFormat}; + }; + + + + + struct PostScriptGlyphName + { + fixed format, + italic_angle; + fword underline_position, + underline_thickness; + uint32 is_fixed_pitch, + min_mem_type42, + max_mem_type42, + min_mem_type1, + max_mem_type1; + enum + { + Format1 = 0x10000, + Format2 = 0x20000, + Format25 = 0x28000, + Format3 = 0x30000, + Format4 = 0x40000 + }; + }; + + struct PostScriptGlyphName2 : PostScriptGlyphName + { + uint16 number_of_glyphs, + glyph_name_index[1]; + }; + + struct PostScriptGlyphName25 : PostScriptGlyphName + { + uint16 number_of_glyphs; + int8 offset[1]; + }; + + struct PostScriptGlyphName3 : PostScriptGlyphName {}; + + struct PostScriptGlyphName4 : PostScriptGlyphName + { + uint16 glyph_to_char_map[1]; + }; + + + struct HorizontalHeader + { + fixed version; + fword ascent, + descent, + line_gap; + ufword advance_width_max; + fword min_left_side_bearing, + max_left_side_bearing, + x_max_element; + int16 caret_slope_rise, + caret_slope_run; + fword caret_offset; + int16 reserved[4], + metric_data_format; + uint16 num_long_hor_metrics; + }; + + struct MaximumProfile + { + fixed version; + uint16 num_glyphs, + max_points, + max_contours, + max_component_points, + max_component_contours, + max_zones, + max_twilight_points, + max_storage, + max_function_defs, + max_instruction_defs, + max_stack_elements, + max_size_of_instructions, + max_component_elements, + max_component_depth; + }; + + + typedef byte Panose[10]; + + struct Compatibility0 + { + uint16 version; + int16 x_avg_char_width; + uint16 weight_class, + width_class; + int16 fs_type, + y_subscript_x_size, + y_subscript_y_size, + y_subscript_x_offset, + y_subscript_y_offset, + y_superscript_x_size, + y_superscript_y_size, + y_superscript_x_offset, + y_superscript_y_offset, + y_strikeout_size, + y_strikeout_position, + family_class; + Panose panose; + uint32 unicode_range[4]; + int8 ach_vend_id[4]; + uint16 fs_selection, + fs_first_char_index, + fs_last_char_index, // Acording to Apple's spec this is where v0 should end + typo_ascender, + typo_descender, + type_linegap, + win_ascent, + win_descent; + + enum + { + Italic =0x01, + Underscore=0x02, + Negative =0x04, + Outlined =0x08, + StrikeOut =0x10, + Bold =0x20 + }; + }; + + struct Compatibility1 : Compatibility0 + { + uint32 codepage_range[2]; + }; + + struct Compatibility2 : Compatibility1 + { + int16 x_height, + cap_height; + uint16 default_char, + break_char, + max_context; + }; + + struct Compatibility3 : Compatibility2 {}; + + typedef Compatibility3 Compatibility; + + + struct NameRecord + { + uint16 platform_id, + platform_specific_id, + language_id, + name_id, + length, + offset; + enum {Unicode, Mactintosh, Reserved, Microsoft}; + enum + { + Copyright, Family, Subfamily, UniqueSubfamily, + Fullname, Version, PostScript + }; + }; + + struct LangTagRecord + { + uint16 length, + offset; + }; + + struct FontNames + { + uint16 format, + count, + string_offset; + NameRecord name_record[1]; + }; + + + struct HorizontalMetric + { + uint16 advance_width; + int16 left_side_bearing; + }; + + + struct Glyph + { + int16 number_of_contours; + fword x_min, + y_min, + x_max, + y_max; + }; + + struct SimpleGlyph : Glyph + { + uint16 end_pts_of_contours[1]; + enum + { + OnCurve = 0x01, + XShort = 0x02, + YShort = 0x04, + Repeat = 0x08, + XIsSame = 0x10, + XIsPos = 0x10, + YIsSame = 0x20, + YIsPos = 0x20 + }; + }; + + struct CompoundGlyph : Glyph + { + uint16 flags, + glyph_index; + enum + { + Arg1Arg2Words = 0x01, + ArgsAreXYValues = 0x02, + RoundXYToGrid = 0x04, + HaveScale = 0x08, + MoreComponents = 0x20, + HaveXAndYScale = 0x40, + HaveTwoByTwo = 0x80, + HaveInstructions = 0x100, + UseMyMetrics = 0x200, + OverlapCompund = 0x400, + ScaledOffset = 0x800, + UnscaledOffset = 0x1000 + }; + }; + +#pragma pack() +} // end of namespace Sfnt + +} // end of namespace TtfUtil +} // end of namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/TtfUtil.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/TtfUtil.h new file mode 100644 index 00000000000..7fafb69cf29 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/TtfUtil.h @@ -0,0 +1,206 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once +/*--------------------------------------------------------------------*//*:Ignore this sentence. + +File: TtfUtil.h +Responsibility: Alan Ward +Last reviewed: Not yet. + +Description: + Utility class for handling TrueType font files. +----------------------------------------------------------------------------------------------*/ + + +#include + +namespace graphite2 +{ +namespace TtfUtil +{ + +typedef long fontTableId32; +typedef unsigned short gid16; + +#define TTF_TAG(a,b,c,d) ((a << 24UL) + (b << 16UL) + (c << 8UL) + (d)) + +// Enumeration used to specify a table in a TTF file +class Tag +{ + unsigned long _v; +public: + Tag(const char n[5]) throw() : _v(TTF_TAG(n[0],n[1],n[2],n[3])) {} + Tag(const unsigned long tag) throw() : _v(tag) {} + + operator unsigned long () const throw () { return _v; } + + enum + { + Feat = TTF_TAG('F','e','a','t'), + Glat = TTF_TAG('G','l','a','t'), + Gloc = TTF_TAG('G','l','o','c'), + Sile = TTF_TAG('S','i','l','e'), + Silf = TTF_TAG('S','i','l','f'), + Sill = TTF_TAG('S','i','l','l'), + cmap = TTF_TAG('c','m','a','p'), + cvt = TTF_TAG('c','v','t',' '), + cryp = TTF_TAG('c','r','y','p'), + head = TTF_TAG('h','e','a','d'), + fpgm = TTF_TAG('f','p','g','m'), + gdir = TTF_TAG('g','d','i','r'), + glyf = TTF_TAG('g','l','y','f'), + hdmx = TTF_TAG('h','d','m','x'), + hhea = TTF_TAG('h','h','e','a'), + hmtx = TTF_TAG('h','m','t','x'), + loca = TTF_TAG('l','o','c','a'), + kern = TTF_TAG('k','e','r','n'), + LTSH = TTF_TAG('L','T','S','H'), + maxp = TTF_TAG('m','a','x','p'), + name = TTF_TAG('n','a','m','e'), + OS_2 = TTF_TAG('O','S','/','2'), + post = TTF_TAG('p','o','s','t'), + prep = TTF_TAG('p','r','e','p') + }; +}; + +/*---------------------------------------------------------------------------------------------- + Class providing utility methods to parse a TrueType font file (TTF). + Callling application handles all file input and memory allocation. + Assumes minimal knowledge of TTF file format. +----------------------------------------------------------------------------------------------*/ + ////////////////////////////////// tools to find & check TTF tables + bool GetHeaderInfo(size_t & lOffset, size_t & lSize); + bool CheckHeader(const void * pHdr); + bool GetTableDirInfo(const void * pHdr, size_t & lOffset, size_t & lSize); + bool GetTableInfo(const Tag TableTag, const void * pHdr, const void * pTableDir, + size_t & lOffset, size_t & lSize); + bool CheckTable(const Tag TableId, const void * pTable, size_t lTableSize); + + ////////////////////////////////// simple font wide info + size_t GlyphCount(const void * pMaxp); +#ifdef ALL_TTFUTILS + size_t MaxCompositeComponentCount(const void * pMaxp); + size_t MaxCompositeLevelCount(const void * pMaxp); + size_t LocaGlyphCount(size_t lLocaSize, const void * pHead); // throw (std::domain_error); +#endif + int DesignUnits(const void * pHead); +#ifdef ALL_TTFUTILS + int HeadTableCheckSum(const void * pHead); + void HeadTableCreateTime(const void * pHead, unsigned int * pnDateBC, unsigned int * pnDateAD); + void HeadTableModifyTime(const void * pHead, unsigned int * pnDateBC, unsigned int * pnDateAD); + bool IsItalic(const void * pHead); + int FontAscent(const void * pOs2); + int FontDescent(const void * pOs2); + bool FontOs2Style(const void *pOs2, bool & fBold, bool & fItalic); + bool Get31EngFamilyInfo(const void * pName, size_t & lOffset, size_t & lSize); + bool Get31EngFullFontInfo(const void * pName, size_t & lOffset, size_t & lSize); + bool Get30EngFamilyInfo(const void * pName, size_t & lOffset, size_t & lSize); + bool Get30EngFullFontInfo(const void * pName, size_t & lOffset, size_t & lSize); + int PostLookup(const void * pPost, size_t lPostSize, const void * pMaxp, + const char * pPostName); +#endif + + ////////////////////////////////// utility methods helpful for name table + bool GetNameInfo(const void * pName, int nPlatformId, int nEncodingId, + int nLangId, int nNameId, size_t & lOffset, size_t & lSize); + //size_t NameTableLength(const byte * pTable); +#ifdef ALL_TTFUTILS + int GetLangsForNames(const void * pName, int nPlatformId, int nEncodingId, + int *nameIdList, int cNameIds, short *langIdList); + void SwapWString(void * pWStr, size_t nSize = 0); // throw (std::invalid_argument); +#endif + + ////////////////////////////////// cmap lookup tools + const void * FindCmapSubtable(const void * pCmap, int nPlatformId = 3, + int nEncodingId = 1, size_t length = 0); + bool CheckCmapSubtable4(const void * pCmap31); + gid16 CmapSubtable4Lookup(const void * pCmapSubtabel4, unsigned int nUnicodeId, int rangeKey = 0); + unsigned int CmapSubtable4NextCodepoint(const void *pCmap31, unsigned int nUnicodeId, + int * pRangeKey = 0); + bool CheckCmapSubtable12(const void *pCmap310); + gid16 CmapSubtable12Lookup(const void * pCmap310, unsigned int uUnicodeId, int rangeKey = 0); + unsigned int CmapSubtable12NextCodepoint(const void *pCmap310, unsigned int nUnicodeId, + int * pRangeKey = 0); + + ///////////////////////////////// horizontal metric data for a glyph + bool HorMetrics(gid16 nGlyphId, const void * pHmtx, size_t lHmtxSize, + const void * pHhea, int & nLsb, unsigned int & nAdvWid); + + ////////////////////////////////// primitives for loca and glyf lookup + size_t LocaLookup(gid16 nGlyphId, const void * pLoca, size_t lLocaSize, + const void * pHead); // throw (std::out_of_range); + void * GlyfLookup(const void * pGlyf, size_t lGlyfOffset, size_t lTableLen); + + ////////////////////////////////// primitves for simple glyph data + bool GlyfBox(const void * pSimpleGlyf, int & xMin, int & yMin, + int & xMax, int & yMax); + +#ifdef ALL_TTFUTILS + int GlyfContourCount(const void * pSimpleGlyf); + bool GlyfContourEndPoints(const void * pSimpleGlyf, int * prgnContourEndPoint, + int cnPointsTotal, size_t & cnPoints); + bool GlyfPoints(const void * pSimpleGlyf, int * prgnX, int * prgnY, + char * prgbFlag, int cnPointsTotal, int & cnPoints); + + // primitive to find the glyph ids in a composite glyph + bool GetComponentGlyphIds(const void * pSimpleGlyf, int * prgnCompId, + size_t cnCompIdTotal, size_t & cnCompId); + // primitive to find the placement data for a component in a composite glyph + bool GetComponentPlacement(const void * pSimpleGlyf, int nCompId, + bool fOffset, int & a, int & b); + // primitive to find the transform data for a component in a composite glyph + bool GetComponentTransform(const void * pSimpleGlyf, int nCompId, + float & flt11, float & flt12, float & flt21, float & flt22, bool & fTransOffset); +#endif + + ////////////////////////////////// operate on composite or simple glyph (auto glyf lookup) + void * GlyfLookup(gid16 nGlyphId, const void * pGlyf, const void * pLoca, + size_t lGlyfSize, size_t lLocaSize, const void * pHead); // primitive used by below methods + +#ifdef ALL_TTFUTILS + // below are primary user methods for handling glyf data + bool IsSpace(gid16 nGlyphId, const void * pLoca, size_t lLocaSize, const void * pHead); + bool IsDeepComposite(gid16 nGlyphId, const void * pGlyf, const void * pLoca, + size_t lGlyfSize, size_t lLocaSize, const void * pHead); + + bool GlyfBox(gid16 nGlyphId, const void * pGlyf, const void * pLoca, size_t lGlyfSize, size_t lLocaSize, + const void * pHead, int & xMin, int & yMin, int & xMax, int & yMax); + bool GlyfContourCount(gid16 nGlyphId, const void * pGlyf, const void * pLoca, + size_t lGlyfSize, size_t lLocaSize, const void *pHead, size_t & cnContours); + bool GlyfContourEndPoints(gid16 nGlyphId, const void * pGlyf, const void * pLoca, + size_t lGlyfSize, size_t lLocaSize, const void * pHead, int * prgnContourEndPoint, size_t cnPoints); + bool GlyfPoints(gid16 nGlyphId, const void * pGlyf, const void * pLoca, + size_t lGlyfSize, size_t lLocaSize, const void * pHead, const int * prgnContourEndPoint, size_t cnEndPoints, + int * prgnX, int * prgnY, bool * prgfOnCurve, size_t cnPoints); + + // utitily method used by high-level GlyfPoints + bool SimplifyFlags(char * prgbFlags, int cnPoints); + bool CalcAbsolutePoints(int * prgnX, int * prgnY, int cnPoints); +#endif + +} // end of namespace TtfUtil +} // end of namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/UtfCodec.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/UtfCodec.h new file mode 100644 index 00000000000..1a49179aafa --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/UtfCodec.h @@ -0,0 +1,207 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + +#include +#include "inc/Main.h" + +namespace graphite2 { + +typedef uint32 uchar_t; + +template +struct _utf_codec +{ + typedef uchar_t codeunit_t; + + static void put(codeunit_t * cp, const uchar_t , int8 & len) throw(); + static uchar_t get(const codeunit_t * cp, int8 & len) throw(); +}; + + +template <> +struct _utf_codec<32> +{ +private: + static const uchar_t limit = 0x110000; +public: + typedef uint32 codeunit_t; + + inline + static void put(codeunit_t * cp, const uchar_t usv, int8 & l) throw() + { + *cp = usv; l = 1; + } + + inline + static uchar_t get(const codeunit_t * cp, int8 & l) throw() + { + if (cp[0] < limit) { l = 1; return cp[0]; } + else { l = -1; return 0xFFFD; } + } +}; + + +template <> +struct _utf_codec<16> +{ +private: + static const int32 lead_offset = 0xD800 - (0x10000 >> 10); + static const int32 surrogate_offset = 0x10000 - (0xD800 << 10) - 0xDC00; +public: + typedef uint16 codeunit_t; + + inline + static void put(codeunit_t * cp, const uchar_t usv, int8 & l) throw() + { + if (usv < 0x10000) { l = 1; cp[0] = codeunit_t(usv); } + else + { + cp[0] = codeunit_t(lead_offset + (usv >> 10)); + cp[1] = codeunit_t(0xDC00 + (usv & 0x3FF)); + l = 2; + } + } + + inline + static uchar_t get(const codeunit_t * cp, int8 & l) throw() + { + const uint32 uh = cp[0]; + l = 1; + + if (0xD800 > uh || uh > 0xDFFF) { return uh; } + const uint32 ul = cp[1]; + if (uh > 0xDBFF || 0xDC00 > ul || ul > 0xDFFF) { l = -1; return 0xFFFD; } + ++l; + return (uh<<10) + ul + surrogate_offset; + } +}; + + +template <> +struct _utf_codec<8> +{ +private: + static const int8 sz_lut[16]; + static const byte mask_lut[5]; + + +public: + typedef uint8 codeunit_t; + + inline + static void put(codeunit_t * cp, const uchar_t usv, int8 & l) throw() + { + if (usv < 0x80) {l = 1; cp[0] = usv; return; } + if (usv < 0x0800) {l = 2; cp[0] = 0xC0 + (usv >> 6); cp[1] = 0x80 + (usv & 0x3F); return; } + if (usv < 0x10000) {l = 3; cp[0] = 0xE0 + (usv >> 12); cp[1] = 0x80 + ((usv >> 6) & 0x3F); cp[2] = 0x80 + (usv & 0x3F); return; } + else {l = 4; cp[0] = 0xF0 + (usv >> 18); cp[1] = 0x80 + ((usv >> 12) & 0x3F); cp[2] = 0x80 + ((usv >> 6) & 0x3F); cp[3] = 0x80 + (usv & 0x3F); return; } + } + + inline + static uchar_t get(const codeunit_t * cp, int8 & l) throw() + { + const int8 seq_sz = sz_lut[*cp >> 4]; + uchar_t u = *cp & mask_lut[seq_sz]; + l = 1; + bool toolong = false; + + switch(seq_sz) { + case 4: u <<= 6; u |= *++cp & 0x3F; if (*cp >> 6 != 2) break; ++l; toolong = (u < 0x10); // no break + case 3: u <<= 6; u |= *++cp & 0x3F; if (*cp >> 6 != 2) break; ++l; toolong |= (u < 0x20); // no break + case 2: u <<= 6; u |= *++cp & 0x3F; if (*cp >> 6 != 2) break; ++l; toolong |= (u < 0x80); // no break + case 1: break; + case 0: l = -1; return 0xFFFD; + } + + if (l != seq_sz || toolong) + { + l = -l; + return 0xFFFD; + } + return u; + } +}; + + +template +class _utf_iterator +{ + typedef _utf_codec codec; + + C * cp; + mutable int8 sl; + +public: + typedef C codeunit_type; + typedef uchar_t value_type; + typedef uchar_t * pointer; + + class reference + { + const _utf_iterator & _i; + + reference(const _utf_iterator & i): _i(i) {} + public: + operator value_type () const throw () { return codec::get(_i.cp, _i.sl); } + reference & operator = (const value_type usv) throw() { codec::put(_i.cp, usv, _i.sl); return *this; } + + friend class _utf_iterator; + }; + + + _utf_iterator(const void * us=0) : cp(reinterpret_cast(const_cast(us))), sl(1) { } + + _utf_iterator & operator ++ () { cp += abs(sl); return *this; } + _utf_iterator operator ++ (int) { _utf_iterator tmp(*this); operator++(); return tmp; } + + bool operator == (const _utf_iterator & rhs) const throw() { return cp >= rhs.cp; } + bool operator != (const _utf_iterator & rhs) const throw() { return !operator==(rhs); } + + reference operator * () const throw() { return *this; } + pointer operator ->() const throw() { return &operator *(); } + + operator codeunit_type * () const throw() { return cp; } + + bool error() const throw() { return sl < 1; } +}; + +template +struct utf +{ + typedef typename _utf_codec::codeunit_t codeunit_t; + + typedef _utf_iterator iterator; + typedef _utf_iterator const_iterator; +}; + + +typedef utf utf32; +typedef utf utf16; +typedef utf utf8; + +} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/bits.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/bits.h new file mode 100644 index 00000000000..56b2d10224e --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/bits.h @@ -0,0 +1,90 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once + +namespace graphite2 +{ + +template +inline unsigned int bit_set_count(T v) +{ + v = v - ((v >> 1) & T(~T(0)/3)); // temp + v = (v & T(~T(0)/15*3)) + ((v >> 2) & T(~T(0)/15*3)); // temp + v = (v + (v >> 4)) & T(~T(0)/255*15); // temp + return (T)(v * T(~T(0)/255)) >> (sizeof(T)-1)*8; // count +} + + +template +inline unsigned long _mask_over_val(unsigned long v) +{ + v = _mask_over_val(v); + v |= v >> S*4; + return v; +} + +template<> +inline unsigned long _mask_over_val<1>(unsigned long v) +{ + v |= v >> 1; + v |= v >> 2; + v |= v >> 4; + return v; +} + +template +inline T mask_over_val(T v) +{ + return _mask_over_val(v); +} + +template +inline unsigned long next_highest_power2(T v) +{ + return _mask_over_val(v-1)+1; +} + +template +inline unsigned int log_binary(T v) +{ + return bit_set_count(mask_over_val(v))-1; +} + +template +inline T has_zero(const T x) +{ + return (x - T(~T(0)/255)) & ~x & T(~T(0)/255*128); +} + +template +inline T zero_bytes(const T x, unsigned char n) +{ + const T t = T(~T(0)/255*n); + return T((has_zero(x^t) >> 7)*n); +} + +} diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/debug.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/debug.h new file mode 100644 index 00000000000..6c733c6a5a4 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/debug.h @@ -0,0 +1,78 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +// debug.h +// +// Created on: 22 Dec 2011 +// Author: tim + +#pragma once + +#if !defined GRAPHITE2_NTRACING + +#include +#include "inc/json.h" +#include "inc/Position.h" + +namespace graphite2 +{ + +class CharInfo; +class Segment; +class Slot; + +typedef std::pair dslot; +struct objectid +{ + char name[16]; + objectid(const dslot &) throw(); + objectid(const Segment * const p) throw(); +}; + +json & operator << (json & j, const Position &) throw(); +json & operator << (json & j, const CharInfo &) throw(); +json & operator << (json & j, const dslot &) throw(); +json & operator << (json & j, const objectid &) throw(); + + +inline +json & operator << (json & j, const Position & p) throw() +{ + return j << json::flat << json::array << p.x << p.y << json::close; +} + + +inline +json & operator << (json & j, const objectid & sid) throw() +{ + return j << sid.name; +} + + +} // namespace graphite2 + +#endif //!defined GRAPHITE2_NTRACING + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/json.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/json.h new file mode 100644 index 00000000000..80ff5b5cbf8 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/json.h @@ -0,0 +1,165 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +// JSON pretty printer for graphite font debug output logging. +// Created on: 15 Dec 2011 +// Author: Tim Eves + +#pragma once +#include "inc/Main.h" +#include +#include + +namespace graphite2 { + +class json +{ + // Prevent copying + json(const json &); + json & operator = (const json &); + + typedef void (*_context_t)(json &); + class _null_t {}; + + FILE * const _stream; + char _contexts[128], // context stack + * _context, // current context (top of stack) + * _flatten; // if !0 points to context above which + // pretty printed output should occur. + + void context(const char current) throw(); + void indent(const int d=0) throw(); + void push_context(const char, const char) throw(); + void pop_context() throw(); + +public: + class closer; + + typedef const char * string; + typedef double number; + typedef long signed int integer; + typedef bool boolean; + static const _null_t null; + + static void flat(json &) throw(); + static void close(json &) throw(); + static void object(json &) throw(); + static void array(json &) throw(); + static void item(json &) throw(); + + json(FILE * stream) throw(); + ~json() throw (); + + FILE * stream() const throw(); + + json & operator << (string) throw(); + json & operator << (number) throw(); + json & operator << (integer) throw(); + json & operator << (long unsigned int d) throw(); + json & operator << (boolean) throw(); + json & operator << (_null_t) throw(); + json & operator << (_context_t) throw(); + + operator bool() const throw(); + bool good() const throw(); + bool eof() const throw(); + + CLASS_NEW_DELETE; +}; + +class json::closer +{ + // Prevent copying. + closer(const closer &); + closer & operator = (const closer &); + + json * const _j; +public: + closer(json * const j) : _j(j) {} + ~closer() throw() { if (_j) *_j << close; } +}; + +inline +json::json(FILE * s) throw() +: _stream(s), _context(_contexts), _flatten(0) +{ + if (good()) + fflush(s); +} + + +inline +json::~json() throw () +{ + while (_context > _contexts) pop_context(); +} + +inline +FILE * json::stream() const throw() { return _stream; } + + +inline +json & json::operator << (json::_context_t ctxt) throw() +{ + ctxt(*this); + return *this; +} + +inline +json & operator << (json & j, signed char d) throw() { return j << json::integer(d); } + +inline +json & operator << (json & j, short signed int d) throw() { return j << json::integer(d); } + +inline +json & operator << (json & j, signed int d) throw() { return j << json::integer(d); } + +inline +json & operator << (json & j, unsigned char d) throw() { return j << json::integer(d); } + +inline +json & operator << (json & j, short unsigned int d) throw() { return j << json::integer(d); } + +inline +json & operator << (json & j, unsigned int d) throw() { return j << json::integer(d); } + +inline +json & operator << (json & j, char c) throw () +{ + const char str[2] = {c,0}; + return j << str; +} + +inline +json::operator bool() const throw() { return good(); } + +inline +bool json::good() const throw() { return _stream && ferror(_stream) == 0; } + +inline +bool json::eof() const throw() { return feof(_stream) != 0; } + +} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/locale2lcid.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/locale2lcid.h new file mode 100644 index 00000000000..fc2d384b444 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/locale2lcid.h @@ -0,0 +1,444 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once +#include +#include + +#include "inc/Main.h" + + +namespace graphite2 { + +struct IsoLangEntry +{ + unsigned short mnLang; + const char maLangStr[4]; + const char maCountry[3]; +}; + +// Windows Language ID, Locale ISO-639 language, country code as used in +// naming table of OpenType fonts +const IsoLangEntry LANG_ENTRIES[] = { + { 0x0401, "ar","SA" }, // Arabic Saudi Arabia + { 0x0402, "bg","BG" }, // Bulgarian Bulgaria + { 0x0403, "ca","ES" }, // Catalan Catalan + { 0x0404, "zh","TW" }, // Chinese Taiwan + { 0x0405, "cs","CZ" }, // Czech Czech Republic + { 0x0406, "da","DK" }, // Danish Denmark + { 0x0407, "de","DE" }, // German Germany + { 0x0408, "el","GR" }, // Greek Greece + { 0x0409, "en","US" }, // English United States + { 0x040A, "es","ES" }, // Spanish (Traditional Sort) Spain + { 0x040B, "fi","FI" }, // Finnish Finland + { 0x040C, "fr","FR" }, // French France + { 0x040D, "he","IL" }, // Hebrew Israel + { 0x040E, "hu","HU" }, // Hungarian Hungary + { 0x040F, "is","IS" }, // Icelandic Iceland + { 0x0410, "it","IT" }, // Italian Italy + { 0x0411, "jp","JP" }, // Japanese Japan + { 0x0412, "ko","KR" }, // Korean Korea + { 0x0413, "nl","NL" }, // Dutch Netherlands + { 0x0414, "no","NO" }, // Norwegian (Bokmal) Norway + { 0x0415, "pl","PL" }, // Polish Poland + { 0x0416, "pt","BR" }, // Portuguese Brazil + { 0x0417, "rm","CH" }, // Romansh Switzerland + { 0x0418, "ro","RO" }, // Romanian Romania + { 0x0419, "ru","RU" }, // Russian Russia + { 0x041A, "hr","HR" }, // Croatian Croatia + { 0x041B, "sk","SK" }, // Slovak Slovakia + { 0x041C, "sq","AL" }, // Albanian Albania + { 0x041D, "sv","SE" }, // Swedish Sweden + { 0x041E, "th","TH" }, // Thai Thailand + { 0x041F, "tr","TR" }, // Turkish Turkey + { 0x0420, "ur","PK" }, // Urdu Islamic Republic of Pakistan + { 0x0421, "id","ID" }, // Indonesian Indonesia + { 0x0422, "uk","UA" }, // Ukrainian Ukraine + { 0x0423, "be","BY" }, // Belarusian Belarus + { 0x0424, "sl","SI" }, // Slovenian Slovenia + { 0x0425, "et","EE" }, // Estonian Estonia + { 0x0426, "lv","LV" }, // Latvian Latvia + { 0x0427, "lt","LT" }, // Lithuanian Lithuania + { 0x0428, "tg","TJ" }, // Tajik (Cyrillic) Tajikistan + { 0x042A, "vi","VN" }, // Vietnamese Vietnam + { 0x042B, "hy","AM" }, // Armenian Armenia + { 0x042C, "az","AZ" }, // Azeri (Latin) Azerbaijan + { 0x042D, "eu","" }, // Basque Basque + { 0x042E, "hsb","DE" }, // Upper Sorbian Germany + { 0x042F, "mk","MK" }, // Macedonian (FYROM) Former Yugoslav Republic of Macedonia + { 0x0432, "tn","ZA" }, // Setswana South Africa + { 0x0434, "xh","ZA" }, // isiXhosa South Africa + { 0x0435, "zu","ZA" }, // isiZulu South Africa + { 0x0436, "af","ZA" }, // Afrikaans South Africa + { 0x0437, "ka","GE" }, // Georgian Georgia + { 0x0438, "fo","FO" }, // Faroese Faroe Islands + { 0x0439, "hi","IN" }, // Hindi India + { 0x043A, "mt","MT" }, // Maltese Malta + { 0x043B, "se","NO" }, // Sami (Northern) Norway + { 0x043E, "ms","MY" }, // Malay Malaysia + { 0x043F, "kk","KZ" }, // Kazakh Kazakhstan + { 0x0440, "ky","KG" }, // Kyrgyz Kyrgyzstan + { 0x0441, "sw","KE" }, // Kiswahili Kenya + { 0x0442, "tk","TM" }, // Turkmen Turkmenistan + { 0x0443, "uz","UZ" }, // Uzbek (Latin) Uzbekistan + { 0x0444, "tt","RU" }, // Tatar Russia + { 0x0445, "bn","IN" }, // Bengali India + { 0x0446, "pa","IN" }, // Punjabi India + { 0x0447, "gu","IN" }, // Gujarati India + { 0x0448, "or","IN" }, // Oriya India + { 0x0448, "wo","SN" }, // Wolof Senegal + { 0x0449, "ta","IN" }, // Tamil India + { 0x044A, "te","IN" }, // Telugu India + { 0x044B, "kn","IN" }, // Kannada India + { 0x044C, "ml","IN" }, // Malayalam India + { 0x044D, "as","IN" }, // Assamese India + { 0x044E, "mr","IN" }, // Marathi India + { 0x044F, "sa","IN" }, // Sanskrit India + { 0x0450, "mn","MN" }, // Mongolian (Cyrillic) Mongolia + { 0x0451, "bo","CN" }, // Tibetan PRC + { 0x0452, "cy","GB" }, // Welsh United Kingdom + { 0x0453, "km","KH" }, // Khmer Cambodia + { 0x0454, "lo","LA" }, // Lao Lao P.D.R. + { 0x0455, "my","MM" }, // Burmese Myanmar - not listed in Microsoft docs anymore + { 0x0456, "gl","ES" }, // Galician Galician + { 0x0457, "kok","IN" }, // Konkani India + { 0x045A, "syr","TR" }, // Syriac Syria + { 0x045B, "si","LK" }, // Sinhala Sri Lanka + { 0x045D, "iu","CA" }, // Inuktitut Canada + { 0x045E, "am","ET" }, // Amharic Ethiopia + { 0x0461, "ne","NP" }, // Nepali Nepal + { 0x0462, "fy","NL" }, // Frisian Netherlands + { 0x0463, "ps","AF" }, // Pashto Afghanistan + { 0x0464, "fil","PH" }, // Filipino Philippines + { 0x0465, "dv","MV" }, // Divehi Maldives + { 0x0468, "ha","NG" }, // Hausa (Latin) Nigeria + { 0x046A, "yo","NG" }, // Yoruba Nigeria + { 0x046B, "qu","BO" }, // Quechua Bolivia + { 0x046C, "st","ZA" }, // Sesotho sa Leboa South Africa + { 0x046D, "ba","RU" }, // Bashkir Russia + { 0x046E, "lb","LU" }, // Luxembourgish Luxembourg + { 0x046F, "kl","GL" }, // Greenlandic Greenland + { 0x0470, "ig","NG" }, // Igbo Nigeria + { 0x0478, "ii","CN" }, // Yi PRC + { 0x047A, "arn","CL" }, // Mapudungun Chile + { 0x047C, "moh","CA" }, // Mohawk Mohawk + { 0x047E, "br","FR" }, // Breton France + { 0x0480, "ug","CN" }, // Uighur PRC + { 0x0481, "mi","NZ" }, // Maori New Zealand + { 0x0482, "oc","FR" }, // Occitan France + { 0x0483, "co","FR" }, // Corsican France + { 0x0484, "gsw","FR" }, // Alsatian France + { 0x0485, "sah","RU" }, // Yakut Russia + { 0x0486, "qut","GT" }, // K'iche Guatemala + { 0x0487, "rw","RW" }, // Kinyarwanda Rwanda + { 0x048C, "gbz","AF" }, // Dari Afghanistan + { 0x0801, "ar","IQ" }, // Arabic Iraq + { 0x0804, "zn","CH" }, // Chinese People's Republic of China + { 0x0807, "de","CH" }, // German Switzerland + { 0x0809, "en","GB" }, // English United Kingdom + { 0x080A, "es","MX" }, // Spanish Mexico + { 0x080C, "fr","BE" }, // French Belgium + { 0x0810, "it","CH" }, // Italian Switzerland + { 0x0813, "nl","BE" }, // Dutch Belgium + { 0x0814, "nn","NO" }, // Norwegian (Nynorsk) Norway + { 0x0816, "pt","PT" }, // Portuguese Portugal + { 0x081A, "sh","RS" }, // Serbian (Latin) Serbia + { 0x081D, "sv","FI" }, // Sweden Finland + { 0x082C, "az","AZ" }, // Azeri (Cyrillic) Azerbaijan + { 0x082E, "dsb","DE" }, // Lower Sorbian Germany + { 0x083B, "se","SE" }, // Sami (Northern) Sweden + { 0x083C, "ga","IE" }, // Irish Ireland + { 0x083E, "ms","BN" }, // Malay Brunei Darussalam + { 0x0843, "uz","UZ" }, // Uzbek (Cyrillic) Uzbekistan + { 0x0845, "bn","BD" }, // Bengali Bangladesh + { 0x0850, "mn","MN" }, // Mongolian (Traditional) People's Republic of China + { 0x085D, "iu","CA" }, // Inuktitut (Latin) Canada + { 0x085F, "ber","DZ" }, // Tamazight (Latin) Algeria + { 0x086B, "es","EC" }, // Quechua Ecuador + { 0x0C01, "ar","EG" }, // Arabic Egypt + { 0x0C04, "zh","HK" }, // Chinese Hong Kong S.A.R. + { 0x0C07, "de","AT" }, // German Austria + { 0x0C09, "en","AU" }, // English Australia + { 0x0C0A, "es","ES" }, // Spanish (Modern Sort) Spain + { 0x0C0C, "fr","CA" }, // French Canada + { 0x0C1A, "sr","CS" }, // Serbian (Cyrillic) Serbia + { 0x0C3B, "se","FI" }, // Sami (Northern) Finland + { 0x0C6B, "qu","PE" }, // Quechua Peru + { 0x1001, "ar","LY" }, // Arabic Libya + { 0x1004, "zh","SG" }, // Chinese Singapore + { 0x1007, "de","LU" }, // German Luxembourg + { 0x1009, "en","CA" }, // English Canada + { 0x100A, "es","GT" }, // Spanish Guatemala + { 0x100C, "fr","CH" }, // French Switzerland + { 0x101A, "hr","BA" }, // Croatian (Latin) Bosnia and Herzegovina + { 0x103B, "smj","NO" }, // Sami (Lule) Norway + { 0x1401, "ar","DZ" }, // Arabic Algeria + { 0x1404, "zh","MO" }, // Chinese Macao S.A.R. + { 0x1407, "de","LI" }, // German Liechtenstein + { 0x1409, "en","NZ" }, // English New Zealand + { 0x140A, "es","CR" }, // Spanish Costa Rica + { 0x140C, "fr","LU" }, // French Luxembourg + { 0x141A, "bs","BA" }, // Bosnian (Latin) Bosnia and Herzegovina + { 0x143B, "smj","SE" }, // Sami (Lule) Sweden + { 0x1801, "ar","MA" }, // Arabic Morocco + { 0x1809, "en","IE" }, // English Ireland + { 0x180A, "es","PA" }, // Spanish Panama + { 0x180C, "fr","MC" }, // French Principality of Monoco + { 0x181A, "sh","BA" }, // Serbian (Latin) Bosnia and Herzegovina + { 0x183B, "sma","NO" }, // Sami (Southern) Norway + { 0x1C01, "ar","TN" }, // Arabic Tunisia + { 0x1C09, "en","ZA" }, // English South Africa + { 0x1C0A, "es","DO" }, // Spanish Dominican Republic + { 0x1C1A, "sr","BA" }, // Serbian (Cyrillic) Bosnia and Herzegovina + { 0x1C3B, "sma","SE" }, // Sami (Southern) Sweden + { 0x2001, "ar","OM" }, // Arabic Oman + { 0x2009, "en","JM" }, // English Jamaica + { 0x200A, "es","VE" }, // Spanish Venezuela + { 0x201A, "bs","BA" }, // Bosnian (Cyrillic) Bosnia and Herzegovina + { 0x203B, "sms","FI" }, // Sami (Skolt) Finland + { 0x2401, "ar","YE" }, // Arabic Yemen + { 0x2409, "en","BS" }, // English Caribbean + { 0x240A, "es","CO" }, // Spanish Colombia + { 0x243B, "smn","FI" }, // Sami (Inari) Finland + { 0x2801, "ar","SY" }, // Arabic Syria + { 0x2809, "en","BZ" }, // English Belize + { 0x280A, "es","PE" }, // Spanish Peru + { 0x2C01, "ar","JO" }, // Arabic Jordan + { 0x2C09, "en","TT" }, // English Trinidad and Tobago + { 0x2C0A, "es","AR" }, // Spanish Argentina + { 0x3001, "ar","LB" }, // Arabic Lebanon + { 0x3009, "en","ZW" }, // English Zimbabwe + { 0x300A, "es","EC" }, // Spanish Ecuador + { 0x3401, "ar","KW" }, // Arabic Kuwait + { 0x3409, "en","PH" }, // English Republic of the Philippines + { 0x340A, "es","CL" }, // Spanish Chile + { 0x3801, "ar","AE" }, // Arabic U.A.E. + { 0x380A, "es","UY" }, // Spanish Uruguay + { 0x3C01, "ar","BH" }, // Arabic Bahrain + { 0x3C0A, "es","PY" }, // Spanish Paraguay + { 0x4001, "ar","QA" }, // Arabic Qatar + { 0x4009, "en","IN" }, // English India + { 0x400A, "es","BO" }, // Spanish Bolivia + { 0x4409, "en","MY" }, // English Malaysia + { 0x440A, "es","SV" }, // Spanish El Salvador + { 0x4809, "en","SG" }, // English Singapore + { 0x480A, "es","HN" }, // Spanish Honduras + { 0x4C0A, "es","NI" }, // Spanish Nicaragua + { 0x500A, "es","PR" }, // Spanish Puerto Rico + { 0x540A, "es","US" } // Spanish United States +}; + +class Locale2Lang +{ + Locale2Lang(const Locale2Lang &); + Locale2Lang & operator = (const Locale2Lang &); + +public: + Locale2Lang() : mSeedPosition(128) + { + memset((void*)mLangLookup, 0, sizeof(mLangLookup)); + // create a tri lookup on first 2 letters of language code + static const int maxIndex = sizeof(LANG_ENTRIES)/sizeof(IsoLangEntry); + for (int i = 0; i < maxIndex; i++) + { + size_t a = LANG_ENTRIES[i].maLangStr[0] - 'a'; + size_t b = LANG_ENTRIES[i].maLangStr[1] - 'a'; + if (mLangLookup[a][b]) + { + const IsoLangEntry ** old = mLangLookup[a][b]; + int len = 1; + while (old[len]) len++; + len += 2; + mLangLookup[a][b] = gralloc(len); + mLangLookup[a][b][--len] = NULL; + mLangLookup[a][b][--len] = &LANG_ENTRIES[i]; + while (--len >= 0) + { + assert(len >= 0); + mLangLookup[a][b][len] = old[len]; + } + free(old); + } + else + { + mLangLookup[a][b] = gralloc(2); + mLangLookup[a][b][1] = NULL; + mLangLookup[a][b][0] = &LANG_ENTRIES[i]; + } + } + while (2 * mSeedPosition < maxIndex) + mSeedPosition *= 2; + }; + ~Locale2Lang() + { + for (int i = 0; i != 26; ++i) + for (int j = 0; j != 26; ++j) + free(mLangLookup[i][j]); + } + unsigned short getMsId(const char * locale) const + { + size_t length = strlen(locale); + size_t langLength = length; + const char * language = locale; + const char * script = NULL; + const char * region = NULL; + size_t regionLength = 0; + const char * dash = strchr(locale, '-'); + if (dash && (dash != locale)) + { + langLength = (dash - locale); + size_t nextPartLength = length - langLength - 1; + if (nextPartLength >= 2) + { + script = ++dash; + dash = strchr(dash, '-'); + if (dash) + { + nextPartLength = (dash - script); + region = ++dash; + } + if (nextPartLength == 2 && + (locale[langLength+1] > 0x40) && (locale[langLength+1] < 0x5B) && + (locale[langLength+2] > 0x40) && (locale[langLength+2] < 0x5B)) + { + region = script; + regionLength = nextPartLength; + script = NULL; + } + else if (nextPartLength == 4) + { + if (dash) + { + dash = strchr(dash, '-'); + if (dash) + { + nextPartLength = (dash - region); + } + else + { + nextPartLength = langLength - (region - locale); + } + regionLength = nextPartLength; + } + } + } + } + size_t a = 'e' - 'a'; + size_t b = 'n' - 'a'; + unsigned short langId = 0; + int i = 0; + switch (langLength) + { + case 2: + { + a = language[0] - 'a'; + b = language[1] - 'a'; + if ((a < 26) && (b < 26) && mLangLookup[a][b]) + { + while (mLangLookup[a][b][i]) + { + if (mLangLookup[a][b][i]->maLangStr[2] != '\0') + { + ++i; + continue; + } + if (region && (strncmp(mLangLookup[a][b][i]->maCountry, region, regionLength) == 0)) + { + langId = mLangLookup[a][b][i]->mnLang; + break; + } + else if (langId == 0) + { + // possible fallback code + langId = mLangLookup[a][b][i]->mnLang; + } + ++i; + } + } + } + break; + case 3: + { + a = language[0] - 'a'; + b = language[1] - 'a'; + if (mLangLookup[a][b]) + { + while (mLangLookup[a][b][i]) + { + if (mLangLookup[a][b][i]->maLangStr[2] != language[2]) + { + ++i; + continue; + } + if (strcmp(mLangLookup[a][b][i]->maCountry, region) == 0) + { + langId = mLangLookup[a][b][i]->mnLang; + break; + } + else if (langId == 0) + { + // possible fallback code + langId = mLangLookup[a][b][i]->mnLang; + } + ++i; + } + } + } + break; + default: + break; + } + if (langId == 0) langId = 0x409; + return langId; + } + const IsoLangEntry * findEntryById(unsigned short langId) const + { + static const int maxIndex = sizeof(LANG_ENTRIES)/sizeof(IsoLangEntry); + int window = mSeedPosition; + int guess = mSeedPosition - 1; + while (LANG_ENTRIES[guess].mnLang != langId) + { + window /= 2; + if (window == 0) return NULL; + guess += (LANG_ENTRIES[guess].mnLang > langId)? -window : window; + while (guess >= maxIndex) + { + window /= 2; + guess -= window; + assert(window); + } + } + return &LANG_ENTRIES[guess]; + } + + CLASS_NEW_DELETE; + +private: + const IsoLangEntry ** mLangLookup[26][26]; + int mSeedPosition; +}; + +} // namespace graphite2 diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/opcode_table.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/opcode_table.h new file mode 100644 index 00000000000..06916f6c875 --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/opcode_table.h @@ -0,0 +1,120 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +// This file will be pulled into and integrated into a machine implmentation +// DO NOT build directly +#pragma once + +#define do2(n) do_(n) ,do_(n) +#define NILOP 0U + +// types or parameters are: (.. is inclusive) +// number - any byte +// output_class - 0 .. silf.m_nClass +// input_class - 0 .. silf.m_nClass +// sattrnum - 0 .. 29 (gr_slatJWidth) , 55 (gr_slatUserDefn) +// attrid - 0 .. silf.numUser() where sattrnum == 55; 0..silf.m_iMaxComp where sattrnum == 15 otherwise 0 +// gattrnum - 0 .. face->getGlyphFaceCache->numAttrs() +// gmetric - 0 .. 11 (kgmetDescent) +// featidx - 0 .. face.numFeatures() +// level - any byte +static const opcode_t opcode_table[] = +{ + {{do2(nop)}, 0, "NOP"}, + + {{do2(push_byte)}, 1, "PUSH_BYTE"}, // number + {{do2(push_byte_u)}, 1, "PUSH_BYTE_U"}, // number + {{do2(push_short)}, 2, "PUSH_SHORT"}, // number number + {{do2(push_short_u)}, 2, "PUSH_SHORT_U"}, // number number + {{do2(push_long)}, 4, "PUSH_LONG"}, // number number number number + + {{do2(add)}, 0, "ADD"}, + {{do2(sub)}, 0, "SUB"}, + {{do2(mul)}, 0, "MUL"}, + {{do2(div_)}, 0, "DIV"}, + {{do2(min_)}, 0, "MIN"}, + {{do2(max_)}, 0, "MAX"}, + {{do2(neg)}, 0, "NEG"}, + {{do2(trunc8)}, 0, "TRUNC8"}, + {{do2(trunc16)}, 0, "TRUNC16"}, + + {{do2(cond)}, 0, "COND"}, + {{do2(and_)}, 0, "AND"}, // 0x10 + {{do2(or_)}, 0, "OR"}, + {{do2(not_)}, 0, "NOT"}, + {{do2(equal)}, 0, "EQUAL"}, + {{do2(not_eq_)}, 0, "NOT_EQ"}, + {{do2(less)}, 0, "LESS"}, + {{do2(gtr)}, 0, "GTR"}, + {{do2(less_eq)}, 0, "LESS_EQ"}, + {{do2(gtr_eq)}, 0, "GTR_EQ"}, // 0x18 + + {{do_(next), NILOP}, 0, "NEXT"}, + {{do_(next_n), NILOP}, 1, "NEXT_N"}, // number <= smap.end - map + {{do_(next), NILOP}, 0, "COPY_NEXT"}, + {{do_(put_glyph_8bit_obs), NILOP}, 1, "PUT_GLYPH_8BIT_OBS"}, // output_class + {{do_(put_subs_8bit_obs), NILOP}, 3, "PUT_SUBS_8BIT_OBS"}, // slot input_class output_class + {{do_(put_copy), NILOP}, 1, "PUT_COPY"}, // slot + {{do_(insert), NILOP}, 0, "INSERT"}, + {{do_(delete_), NILOP}, 0, "DELETE"}, // 0x20 + {{do_(assoc), NILOP}, VARARGS, "ASSOC"}, + {{NILOP ,do_(cntxt_item)}, 2, "CNTXT_ITEM"}, // slot offset + + {{do_(attr_set), NILOP}, 1, "ATTR_SET"}, // sattrnum + {{do_(attr_add), NILOP}, 1, "ATTR_ADD"}, // sattrnum + {{do_(attr_sub), NILOP}, 1, "ATTR_SUB"}, // sattrnum + {{do_(attr_set_slot), NILOP}, 1, "ATTR_SET_SLOT"}, // sattrnum + {{do_(iattr_set_slot), NILOP}, 2, "IATTR_SET_SLOT"}, // sattrnum attrid + {{do2(push_slot_attr)}, 2, "PUSH_SLOT_ATTR"}, // sattrnum slot + {{do2(push_glyph_attr_obs)}, 2, "PUSH_GLYPH_ATTR_OBS"}, // gattrnum slot + {{do2(push_glyph_metric)}, 3, "PUSH_GLYPH_METRIC"}, // gmetric slot level + {{do2(push_feat)}, 2, "PUSH_FEAT"}, // featidx slot + + {{do2(push_att_to_gattr_obs)}, 2, "PUSH_ATT_TO_GATTR_OBS"}, // gattrnum slot + {{do2(push_att_to_glyph_metric)}, 3, "PUSH_ATT_TO_GLYPH_METRIC"}, // gmetric slot level + {{do2(push_islot_attr)}, 3, "PUSH_ISLOT_ATTR"}, // sattrnum slot attrid + + {{NILOP,NILOP}, 3, "PUSH_IGLYPH_ATTR"}, + + {{do2(pop_ret)}, 0, "POP_RET"}, // 0x30 + {{do2(ret_zero)}, 0, "RET_ZERO"}, + {{do2(ret_true)}, 0, "RET_TRUE"}, + + {{do_(iattr_set), NILOP}, 2, "IATTR_SET"}, // sattrnum attrid + {{do_(iattr_add), NILOP}, 2, "IATTR_ADD"}, // sattrnum attrid + {{do_(iattr_sub), NILOP}, 2, "IATTR_SUB"}, // sattrnum attrid + {{do2(push_proc_state)}, 1, "PUSH_PROC_STATE"}, // dummy + {{do2(push_version)}, 0, "PUSH_VERSION"}, + {{do_(put_subs), NILOP}, 5, "PUT_SUBS"}, // slot input_class input_class output_class output_class + {{NILOP,NILOP}, 0, "PUT_SUBS2"}, + {{NILOP,NILOP}, 0, "PUT_SUBS3"}, + {{do_(put_glyph), NILOP}, 2, "PUT_GLYPH"}, // output_class output_class + {{do2(push_glyph_attr)}, 3, "PUSH_GLYPH_ATTR"}, // gattrnum gattrnum slot + {{do2(push_att_to_glyph_attr)}, 3, "PUSH_ATT_TO_GLYPH_ATTR"}, // gattrnum gattrnum slot + // private opcodes for internal use only, comes after all other on disk opcodes. + {{do_(temp_copy), NILOP}, 0, "TEMP_COPY"} +}; + diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/opcodes.h b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/opcodes.h new file mode 100644 index 00000000000..835e89351ff --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/inc/opcodes.h @@ -0,0 +1,644 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +#pragma once +// This file will be pulled into and integrated into a machine implmentation +// DO NOT build directly and under no circumstances every #include headers in +// here or you will break the direct_machine. +// +// Implementers' notes +// ================== +// You have access to a few primitives and the full C++ code: +// declare_params(n) Tells the interpreter how many bytes of parameter +// space to claim for this instruction uses and +// initialises the param pointer. You *must* before the +// first use of param. +// use_params(n) Claim n extra bytes of param space beyond what was +// claimed using delcare_param. +// param A const byte pointer for the parameter space claimed by +// this instruction. +// binop(op) Implement a binary operation on the stack using the +// specified C++ operator. +// NOT_IMPLEMENTED Any instruction body containing this will exit the +// program with an assertion error. Instructions that are +// not implemented should also be marked NILOP in the +// opcodes tables this will cause the code class to spot +// them in a live code stream and throw a runtime_error +// instead. +// push(n) Push the value n onto the stack. +// pop() Pop the top most value and return it. +// +// You have access to the following named fast 'registers': +// sp = The pointer to the current top of stack, the last value +// pushed. +// seg = A reference to the Segment this code is running over. +// is = The current slot index +// isb = The original base slot index at the start of this rule +// isf = The first positioned slot +// isl = The last positioned slot +// ip = The current instruction pointer +// endPos = Position of advance of last cluster + + +// #define NOT_IMPLEMENTED assert(false) +#define NOT_IMPLEMENTED + +#define binop(op) const int32 a = pop(); *sp = int32(*sp) op a +#define use_params(n) dp += n + +#define declare_params(n) const byte * param = dp; \ + use_params(n); + +#define push(n) { *++sp = n; } +#define pop() (*sp--) +#define slotat(x) (map[(x)]) +#define DIE { is=seg.last(); EXIT(1); } +#define POSITIONED 1 + +STARTOP(nop) + do {} while (0); +ENDOP + +STARTOP(push_byte) + declare_params(1); + push(int8(*param)); +ENDOP + +STARTOP(push_byte_u) + declare_params(1); + push(uint8(*param)); +ENDOP + +STARTOP(push_short) + declare_params(2); + const int16 r = int16(param[0]) << 8 + | uint8(param[1]); + push(r); +ENDOP + +STARTOP(push_short_u) + declare_params(2); + const uint16 r = uint16(param[0]) << 8 + | uint8(param[1]); + push(r); +ENDOP + +STARTOP(push_long) + declare_params(4); + const int32 r = int32(param[0]) << 24 + | uint32(param[1]) << 16 + | uint32(param[2]) << 8 + | uint8(param[3]); + push(r); +ENDOP + +STARTOP(add) + binop(+); +ENDOP + +STARTOP(sub) + binop(-); +ENDOP + +STARTOP(mul) + binop(*); +ENDOP + +STARTOP(div_) + if (*sp == 0) DIE; + binop(/); +ENDOP + +STARTOP(min_) + const int32 a = pop(), b = *sp; + if (a < b) *sp = a; +ENDOP + +STARTOP(max_) + const int32 a = pop(), b = *sp; + if (a > b) *sp = a; +ENDOP + +STARTOP(neg) + *sp = uint32(-int32(*sp)); +ENDOP + +STARTOP(trunc8) + *sp = uint8(*sp); +ENDOP + +STARTOP(trunc16) + *sp = uint16(*sp); +ENDOP + +STARTOP(cond) + const uint32 f = pop(), t = pop(), c = pop(); + push(c ? t : f); +ENDOP + +STARTOP(and_) + binop(&&); +ENDOP + +STARTOP(or_) + binop(||); +ENDOP + +STARTOP(not_) + *sp = !*sp; +ENDOP + +STARTOP(equal) + binop(==); +ENDOP + +STARTOP(not_eq_) + binop(!=); +ENDOP + +STARTOP(less) + binop(<); +ENDOP + +STARTOP(gtr) + binop(>); +ENDOP + +STARTOP(less_eq) + binop(<=); +ENDOP + +STARTOP(gtr_eq) + binop(>=); +ENDOP + +STARTOP(next) + if (map - &smap[0] >= int(smap.size())) DIE + if (is) + { + if (is == smap.highwater()) + smap.highpassed(true); + is = is->next(); + } + ++map; +ENDOP + +STARTOP(next_n) + use_params(1); + NOT_IMPLEMENTED; + //declare_params(1); + //const size_t num = uint8(*param); +ENDOP + +//STARTOP(copy_next) +// if (is) is = is->next(); +// ++map; +// ENDOP + +STARTOP(put_glyph_8bit_obs) + declare_params(1); + const unsigned int output_class = uint8(*param); + is->setGlyph(&seg, seg.getClassGlyph(output_class, 0)); +ENDOP + +STARTOP(put_subs_8bit_obs) + declare_params(3); + const int slot_ref = int8(param[0]); + const unsigned int input_class = uint8(param[1]), + output_class = uint8(param[2]); + uint16 index; + slotref slot = slotat(slot_ref); + if (slot) + { + index = seg.findClassIndex(input_class, slot->gid()); + is->setGlyph(&seg, seg.getClassGlyph(output_class, index)); + } +ENDOP + +STARTOP(put_copy) + declare_params(1); + const int slot_ref = int8(*param); + if (is && (slot_ref ||is != *map)) + { + int16 *tempUserAttrs = is->userAttrs(); + slotref ref = slotat(slot_ref); + if (ref) + { + memcpy(tempUserAttrs, ref->userAttrs(), seg.numAttrs() * sizeof(uint16)); + Slot *prev = is->prev(); + Slot *next = is->next(); + memcpy(is, slotat(slot_ref), sizeof(Slot)); + is->userAttrs(tempUserAttrs); + is->next(next); + is->prev(prev); + is->sibling(NULL); + } + is->markCopied(false); + is->markDeleted(false); + } +ENDOP + +STARTOP(insert) + Slot *newSlot = seg.newSlot(); + Slot *iss = is; + while (iss && iss->isDeleted()) iss = iss->next(); + if (!iss) + { + if (seg.last()) + { + seg.last()->next(newSlot); + newSlot->prev(seg.last()); + newSlot->before(seg.last()->before()); + seg.last(newSlot); + } + else + { + seg.first(newSlot); + seg.last(newSlot); + } + } + else if (iss->prev()) + { + iss->prev()->next(newSlot); + newSlot->prev(iss->prev()); + newSlot->before(iss->prev()->after()); + } + else + { + newSlot->prev(NULL); + newSlot->before(iss->before()); + seg.first(newSlot); + } + newSlot->next(iss); + if (iss) + { + iss->prev(newSlot); + newSlot->originate(iss->original()); + newSlot->after(iss->before()); + } + else if (newSlot->prev()) + { + newSlot->originate(newSlot->prev()->original()); + newSlot->after(newSlot->prev()->after()); + } + else + { + newSlot->originate(seg.defaultOriginal()); + } + is = newSlot; + seg.extendLength(1); + if (map != &smap[-1]) + --map; +ENDOP + +STARTOP(delete_) + if (!is) DIE + is->markDeleted(true); + if (is->prev()) + is->prev()->next(is->next()); + else + seg.first(is->next()); + + if (is->next()) + is->next()->prev(is->prev()); + else + seg.last(is->prev()); + + if (is == smap.highwater()) + smap.highwater(is->next()); + if (is->prev()) + is = is->prev(); + seg.extendLength(-1); +ENDOP + +STARTOP(assoc) + declare_params(1); + unsigned int num = uint8(*param); + const int8 * assocs = reinterpret_cast(param+1); + use_params(num); + int max = -1; + int min = -1; + + while (num-- > 0) + { + int sr = *assocs++; + slotref ts = slotat(sr); + if (ts && (min == -1 || ts->before() < min)) min = ts->before(); + if (ts && ts->after() > max) max = ts->after(); + } + if (min > -1) // implies max > -1 + { + is->before(min); + is->after(max); + } +ENDOP + +STARTOP(cntxt_item) + // It turns out this is a cunningly disguised condition forward jump. + declare_params(3); + const int is_arg = int8(param[0]); + const size_t iskip = uint8(param[1]), + dskip = uint8(param[2]); + + if (mapb + is_arg != map) + { + ip += iskip; + dp += dskip; + push(true); + } +ENDOP + +STARTOP(attr_set) + declare_params(1); + const attrCode slat = attrCode(uint8(*param)); + const int val = int(pop()); + is->setAttr(&seg, slat, 0, val, smap); +ENDOP + +STARTOP(attr_add) + declare_params(1); + const attrCode slat = attrCode(uint8(*param)); + const int val = int(pop()); + if ((slat == gr_slatPosX || slat == gr_slatPosY) && (flags & POSITIONED) == 0) + { + seg.positionSlots(0, *smap.begin(), *(smap.end()-1)); + flags |= POSITIONED; + } + int res = is->getAttr(&seg, slat, 0); + is->setAttr(&seg, slat, 0, val + res, smap); +ENDOP + +STARTOP(attr_sub) + declare_params(1); + const attrCode slat = attrCode(uint8(*param)); + const int val = int(pop()); + if ((slat == gr_slatPosX || slat == gr_slatPosY) && (flags & POSITIONED) == 0) + { + seg.positionSlots(0, *smap.begin(), *(smap.end()-1)); + flags |= POSITIONED; + } + int res = is->getAttr(&seg, slat, 0); + is->setAttr(&seg, slat, 0, res - val, smap); +ENDOP + +STARTOP(attr_set_slot) + declare_params(1); + const attrCode slat = attrCode(uint8(*param)); + const int offset = (map - smap.begin())*int(slat == gr_slatAttTo); + const int val = int(pop()) + offset; + is->setAttr(&seg, slat, offset, val, smap); +ENDOP + +STARTOP(iattr_set_slot) + declare_params(2); + const attrCode slat = attrCode(uint8(param[0])); + const size_t idx = uint8(param[1]); + const int val = int(pop()) + (map - smap.begin())*int(slat == gr_slatAttTo); + is->setAttr(&seg, slat, idx, val, smap); +ENDOP + +STARTOP(push_slot_attr) + declare_params(2); + const attrCode slat = attrCode(uint8(param[0])); + const int slot_ref = int8(param[1]); + if ((slat == gr_slatPosX || slat == gr_slatPosY) && (flags & POSITIONED) == 0) + { + seg.positionSlots(0, *smap.begin(), *(smap.end()-1)); + flags |= POSITIONED; + } + slotref slot = slotat(slot_ref); + if (slot) + { + int res = slot->getAttr(&seg, slat, 0); + push(res); + } +ENDOP + +STARTOP(push_glyph_attr_obs) + declare_params(2); + const unsigned int glyph_attr = uint8(param[0]); + const int slot_ref = int8(param[1]); + slotref slot = slotat(slot_ref); + if (slot) + push(int32(seg.glyphAttr(slot->gid(), glyph_attr))); +ENDOP + +STARTOP(push_glyph_metric) + declare_params(3); + const unsigned int glyph_attr = uint8(param[0]); + const int slot_ref = int8(param[1]); + const signed int attr_level = uint8(param[2]); + slotref slot = slotat(slot_ref); + if (slot) + push(seg.getGlyphMetric(slot, glyph_attr, attr_level)); +ENDOP + +STARTOP(push_feat) + declare_params(2); + const unsigned int feat = uint8(param[0]); + const int slot_ref = int8(param[1]); + slotref slot = slotat(slot_ref); + if (slot) + { + uint8 fid = seg.charinfo(slot->original())->fid(); + push(seg.getFeature(fid, feat)); + } +ENDOP + +STARTOP(push_att_to_gattr_obs) + declare_params(2); + const unsigned int glyph_attr = uint8(param[0]); + const int slot_ref = int8(param[1]); + slotref slot = slotat(slot_ref); + if (slot) + { + slotref att = slot->attachedTo(); + if (att) slot = att; + push(int32(seg.glyphAttr(slot->gid(), glyph_attr))); + } +ENDOP + +STARTOP(push_att_to_glyph_metric) + declare_params(3); + const unsigned int glyph_attr = uint8(param[0]); + const int slot_ref = int8(param[1]); + const signed int attr_level = uint8(param[2]); + slotref slot = slotat(slot_ref); + if (slot) + { + slotref att = slot->attachedTo(); + if (att) slot = att; + push(int32(seg.getGlyphMetric(slot, glyph_attr, attr_level))); + } +ENDOP + +STARTOP(push_islot_attr) + declare_params(3); + const attrCode slat = attrCode(uint8(param[0])); + const int slot_ref = int8(param[1]), + idx = uint8(param[2]); + if ((slat == gr_slatPosX || slat == gr_slatPosY) && (flags & POSITIONED) == 0) + { + seg.positionSlots(0, *smap.begin(), *(smap.end()-1)); + flags |= POSITIONED; + } + slotref slot = slotat(slot_ref); + if (slot) + { + int res = slot->getAttr(&seg, slat, idx); + push(res); + } +ENDOP + +#if 0 +STARTOP(push_iglyph_attr) // not implemented + NOT_IMPLEMENTED; +ENDOP +#endif + +STARTOP(pop_ret) + const uint32 ret = pop(); + EXIT(ret); +ENDOP + +STARTOP(ret_zero) + EXIT(0); +ENDOP + +STARTOP(ret_true) + EXIT(1); +ENDOP + +STARTOP(iattr_set) + declare_params(2); + const attrCode slat = attrCode(uint8(param[0])); + const size_t idx = uint8(param[1]); + const int val = int(pop()); + is->setAttr(&seg, slat, idx, val, smap); +ENDOP + +STARTOP(iattr_add) + declare_params(2); + const attrCode slat = attrCode(uint8(param[0])); + const size_t idx = uint8(param[1]); + const int val = int(pop()); + if ((slat == gr_slatPosX || slat == gr_slatPosY) && (flags & POSITIONED) == 0) + { + seg.positionSlots(0, *smap.begin(), *(smap.end()-1)); + flags |= POSITIONED; + } + int res = is->getAttr(&seg, slat, idx); + is->setAttr(&seg, slat, idx, val + res, smap); +ENDOP + +STARTOP(iattr_sub) + declare_params(2); + const attrCode slat = attrCode(uint8(param[0])); + const size_t idx = uint8(param[1]); + const int val = int(pop()); + if ((slat == gr_slatPosX || slat == gr_slatPosY) && (flags & POSITIONED) == 0) + { + seg.positionSlots(0, *smap.begin(), *(smap.end()-1)); + flags |= POSITIONED; + } + int res = is->getAttr(&seg, slat, idx); + is->setAttr(&seg, slat, idx, res - val, smap); +ENDOP + +STARTOP(push_proc_state) + use_params(1); + push(1); +ENDOP + +STARTOP(push_version) + push(0x00030000); +ENDOP + +STARTOP(put_subs) + declare_params(5); + const int slot_ref = int8(param[0]); + const unsigned int input_class = uint8(param[1]) << 8 + | uint8(param[2]); + const unsigned int output_class = uint8(param[3]) << 8 + | uint8(param[4]); + slotref slot = slotat(slot_ref); + if (slot) + { + int index = seg.findClassIndex(input_class, slot->gid()); + is->setGlyph(&seg, seg.getClassGlyph(output_class, index)); + } +ENDOP + +#if 0 +STARTOP(put_subs2) // not implemented + NOT_IMPLEMENTED; +ENDOP + +STARTOP(put_subs3) // not implemented + NOT_IMPLEMENTED; +ENDOP +#endif + +STARTOP(put_glyph) + declare_params(2); + const unsigned int output_class = uint8(param[0]) << 8 + | uint8(param[1]); + is->setGlyph(&seg, seg.getClassGlyph(output_class, 0)); +ENDOP + +STARTOP(push_glyph_attr) + declare_params(3); + const unsigned int glyph_attr = uint8(param[0]) << 8 + | uint8(param[1]); + const int slot_ref = int8(param[2]); + slotref slot = slotat(slot_ref); + if (slot) + push(int32(seg.glyphAttr(slot->gid(), glyph_attr))); +ENDOP + +STARTOP(push_att_to_glyph_attr) + declare_params(3); + const unsigned int glyph_attr = uint8(param[0]) << 8 + | uint8(param[1]); + const int slot_ref = int8(param[2]); + slotref slot = slotat(slot_ref); + if (slot) + { + slotref att = slot->attachedTo(); + if (att) slot = att; + push(int32(seg.glyphAttr(slot->gid(), glyph_attr))); + } +ENDOP + +STARTOP(temp_copy) + slotref newSlot = seg.newSlot(); + int16 *tempUserAttrs = newSlot->userAttrs(); + memcpy(newSlot, is, sizeof(Slot)); + memcpy(tempUserAttrs, is->userAttrs(), seg.numAttrs() * sizeof(uint16)); + newSlot->userAttrs(tempUserAttrs); + newSlot->markCopied(true); + *map = newSlot; +ENDOP diff --git a/Build/source/libs/graphite2/graphite2-1.2.1/src/json.cpp b/Build/source/libs/graphite2/graphite2-1.2.1/src/json.cpp new file mode 100644 index 00000000000..c10037f3afe --- /dev/null +++ b/Build/source/libs/graphite2/graphite2-1.2.1/src/json.cpp @@ -0,0 +1,126 @@ +/* GRAPHITE2 LICENSING + + Copyright 2010, SIL International + All rights reserved. + + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU Lesser General Public License as published + by the Free Software Foundation; either version 2.1 of License, or + (at your option) any later version. + + This program 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 for more details. + + You should also have received a copy of the GNU Lesser General Public + License along with this library in the file named "LICENSE". + If not, write to the Free Software Foundation, 51 Franklin Street, + Suite 500, Boston, MA 02110-1335, USA or visit their web page on the + internet at http://www.fsf.org/licenses/lgpl.html. + +Alternatively, the contents of this file may be used under the terms of the +Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public +License, as published by the Free Software Foundation, either version 2 +of the License or (at your option) any later version. +*/ +// JSON debug logging +// Author: Tim Eves + +#if !defined GRAPHITE2_NTRACING + +#include +#include "inc/json.h" + +using namespace graphite2; + +namespace +{ + enum + { + seq = ',', + obj='}', member=':', empty_obj='{', + arr=']', empty_arr='[' + }; +} + +const json::_null_t json::null = {}; + +inline +void json::context(const char current) throw() +{ + fprintf(_stream, "%c", *_context); + indent(); + *_context = current; +} + + +void json::indent(const int d) throw() +{ + if (*_context == member || (_flatten && _flatten < _context)) + fputc(' ', _stream); + else + fprintf(_stream, "\n%*s", 4*int(_context - _contexts + d), ""); +} + + +inline +void json::push_context(const char prefix, const char suffix) throw() +{ + assert(_context - _contexts < ptrdiff_t(sizeof _contexts)); + + if (_context == _contexts) + *_context = suffix; + else + context(suffix); + *++_context = prefix; +} + + +void json::pop_context() throw() +{ + assert(_context > _contexts); + + if (*_context == seq) indent(-1); + else fputc(*_context, _stream); + + fputc(*--_context, _stream); + if (_context == _contexts) fputc('\n', _stream); + fflush(_stream); + + if (_flatten >= _context) _flatten = 0; + *_context = seq; +} + + +// These four functions cannot be inlined as pointers to these +// functions are needed for operator << (_context_t) to work. +void json::flat(json & j) throw() { if (!j._flatten) j._flatten = j._context; } +void json::close(json & j) throw() { j.pop_context(); } +void json::object(json & j) throw() { j.push_context('{', '}'); } +void json::array(json & j) throw() { j.push_context('[', ']'); } +void json::item(json & j) throw() +{ + while (j._context > j._contexts+1 && j._context[-1] != arr) + j.pop_context(); +} + + +json & json::operator << (json::string s) throw() +{ + const char ctxt = _context[-1] == obj ? *_context == member ? seq : member : seq; + context(ctxt); + fprintf(_stream, "\"%s\"", s); + if (ctxt == member) fputc(' ', _stream); + + return *this; +} + +json & json::operator << (json::number f) throw() { context(seq); fprintf(_stream, "%g", f); return *this; } +json & json::operator << (json::integer d) throw() { context(seq); fprintf(_stream, "%ld", d); return *this; } +json & json::operator << (long unsigned d) throw() { context(seq); fprintf(_stream, "%ld", d); return *this; } +json & json::operator << (json::boolean b) throw() { context(seq); fputs(b ? "true" : "false", _stream); return *this; } +json & json::operator << (json::_null_t) throw() { context(seq); fputs("null",_stream); return *this; } + +#endif + diff --git a/Build/source/libs/graphite2/version.ac b/Build/source/libs/graphite2/version.ac index d4a32558577..67fb56741f1 100644 --- a/Build/source/libs/graphite2/version.ac +++ b/Build/source/libs/graphite2/version.ac @@ -1,5 +1,5 @@ dnl -dnl Copyright (C) 2012 Peter Breitenlohner +dnl Copyright (C) 2012, 2013 Peter Breitenlohner dnl dnl This file is free software; the copyright holder dnl gives unlimited permission to copy and/or distribute it, @@ -8,4 +8,4 @@ dnl dnl -------------------------------------------------------- dnl dnl m4-include this file to define the current graphite2 version -m4_define([graphite2_version], [1.2.0]) +m4_define([graphite2_version], [1.2.1]) -- cgit v1.2.3