├── .gitignore ├── README.md ├── temp.hs ├── ttasm.hs ├── ttasm.cabal ├── tables.hs ├── TTFInstructions.hs ├── Template.hs └── LICENSE /.gitignore: -------------------------------------------------------------------------------- 1 | dist 2 | cabal-dev 3 | *.o 4 | *.hi 5 | *.chi 6 | *.chs.h 7 | .virthualenv 8 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | ttasm 2 | ===== 3 | 4 | A TTF assembler. In Haskell! 5 | 6 | ttasm is intended to provide a very, very flexible high-level assembler for making TTF fonts. It is designed to make it easy to make intentionally invalid files, but fairly difficult to write accidentally invalid ones. 7 | 8 | It is currently very much in development. No really, don't use this. 9 | 10 | -------------------------------------------------------------------------------- /temp.hs: -------------------------------------------------------------------------------- 1 | import Template 2 | 3 | import Data.Serialize 4 | import qualified Data.ByteString.Lazy as BS 5 | import qualified Data.ByteString as B 6 | import System.Environment 7 | import Text.Show.Pretty 8 | 9 | main = do 10 | (fileName:_) <- getArgs 11 | s <- BS.readFile $ fileName 12 | let v = decodeLazy s :: Either String TTF 13 | putStrLn $ ppShow v 14 | case v of 15 | Left msg -> putStrLn msg 16 | Right t -> B.writeFile "out.ttf" $ encode t 17 | --let t = ttfTables [PostTable $ Post 0 0 0 0 0 0 0 0 0] 18 | --B.writeFile "out.ttf" $ runPut t 19 | 20 | -------------------------------------------------------------------------------- /ttasm.hs: -------------------------------------------------------------------------------- 1 | import Instructions 2 | import qualified Data.ByteString.Lazy as B 3 | 4 | tab = compileTables [ 5 | Table "cmap" (cmapTable (cmapFormat0 0 (take 262 $ repeat 0))), 6 | Table "glyf" (glyph 0 0 10 10 [0,1,2] (return ()) [3,3,3] [3,4,5] [6,7,8]), 7 | Table "hhea" (hhea 0 0 0 1 0 0 0 0 0 1), 8 | Table "hmtx" (hmtx (hmtxEntry 0 0)), 9 | Table "loca" (_loca [0]), 10 | Table "maxp" (maxp 1 1 1 1 1 1 1 1 1 1 1 1 1 1), 11 | Table "name" (nameHeaderMS [MSNRecord Copyright "bacon", MSNRecord Fullname "tree", MSNRecord UUID "fish"]), 12 | Table "post" (post3 0 0 0 True) 13 | ] (headTable 1 1 0 0 0 0 1 1 0 0 0 1 0) 14 | 15 | main = do B.putStr $ fst $ compile tab 16 | -------------------------------------------------------------------------------- /ttasm.cabal: -------------------------------------------------------------------------------- 1 | name: ttasm 2 | version: 0.1 3 | synopsis: xx 4 | description: 5 | xx 6 | 7 | homepage: https://github.com/CIFASIS/ttasm 8 | license: GPL-3 9 | license-file: LICENSE 10 | author: jseaton 11 | category: Fonts 12 | build-type: Simple 13 | cabal-version: >=1.8 14 | 15 | Flag debug 16 | Default: False 17 | 18 | library 19 | exposed-modules: TTFInstructions 20 | 21 | if flag(debug) 22 | ghc-prof-options: -prof, -fprof-auto 23 | 24 | build-depends: base, 25 | containers >= 0.4.2.1, 26 | bytestring >= 0.9, 27 | binary, 28 | bitwise, 29 | monad-loops, 30 | mtl 31 | -------------------------------------------------------------------------------- /tables.hs: -------------------------------------------------------------------------------- 1 | import qualified Data.ByteString as B 2 | import qualified Data.ByteString.Lazy as LB 3 | import qualified Data.ByteString.Char8 as CB 4 | import Data.Binary.Get 5 | import System.Environment 6 | import Control.Monad 7 | 8 | tables = do 9 | skip 4 10 | n <- getWord16be 11 | skip 6 12 | replicateM (fromIntegral $ n) tableEntry 13 | 14 | tableEntry = do 15 | _tag <- getBytes 4 16 | let tag = CB.unpack _tag 17 | skip 4 -- checksum 18 | offset <- getWord32be 19 | len <- getWord32be 20 | return (tag, offset, len) 21 | 22 | tableData (tag, offset, len) = do 23 | skip $ (fromIntegral $ offset) 24 | cont <- getByteString $ fromIntegral len 25 | return (tag, cont) 26 | 27 | 28 | main = do 29 | (fileName:name:_) <- getArgs 30 | f <- LB.readFile $ fileName 31 | let entries = runGet tables f 32 | if (name == "tables") 33 | then putStrLn $ show $ map (\(t, _, _) -> t) entries 34 | else B.putStr $ head $ map (\e -> snd $ runGet (tableData e) f) $ filter (\(t, _, _) -> t == name) entries 35 | -------------------------------------------------------------------------------- /TTFInstructions.hs: -------------------------------------------------------------------------------- 1 | module TTFInstructions where 2 | 3 | 4 | import qualified Data.Map as M 5 | import Control.Monad.State 6 | import Data.Bits 7 | import qualified Data.Char as C 8 | import qualified Data.Bits.Bitwise as B 9 | import qualified Data.ByteString.Lazy as BS 10 | import GHC.Word 11 | import qualified GHC.Int as I 12 | import Data.Binary.Put 13 | import Data.Binary.Get 14 | import Unsafe.Coerce 15 | import Data.List 16 | 17 | data Op = Byte Word8 | Char I.Int8 | UShort Word16 | Short I.Int16 | UInt Word32 | Int I.Int32 | Str String | Ref String | Label String 18 | deriving (Show) 19 | 20 | data Program = Program [Op] 21 | deriving (Show) 22 | 23 | emptyProg = Program [] 24 | 25 | data Table = Table String (State Program ()) 26 | 27 | stage1 prog = let (_, p) = runState prog emptyProg in p 28 | 29 | stage2 :: [Op] -> (M.Map String Word32) -> Word32 -> (M.Map String Word32) 30 | stage2 ((Byte b):bs) m d = stage2 bs m (d+1) 31 | stage2 ((Char b):bs) m d = stage2 bs m (d+1) 32 | stage2 ((UShort b):bs) m d = stage2 bs m (d+2) 33 | stage2 ((Short b):bs) m d = stage2 bs m (d+2) 34 | stage2 ((UInt b):bs) m d = stage2 bs m (d+4) 35 | stage2 ((Int b):bs) m d = stage2 bs m (d+4) 36 | stage2 ((Label b):bs) m d = stage2 bs (M.insert b d m) d 37 | stage2 ((Ref b):bs) m d = stage2 bs m (d+4) 38 | stage2 ((Str b):bs) m d = stage2 bs m (d+(fromIntegral $ length b)) 39 | stage2 [] m d = m 40 | 41 | stage3 :: [Op] -> (M.Map String Word32) -> [Op] 42 | stage3 ((Ref b):bs) m = (UInt (m M.! b)):(stage3 bs m) 43 | stage3 ((Label b):bs) m = stage3 bs m 44 | stage3 (b:bs) m = b:(stage3 bs m) 45 | stage3 [] m = [] 46 | 47 | stage4 ((Byte b):bs) = do putWord8 b ; stage4 bs 48 | stage4 ((Char b):bs) = do putWord8 $ unsafeCoerce b ; stage4 bs 49 | stage4 ((UShort b):bs) = do putWord16be b ; stage4 bs 50 | stage4 ((Short b):bs) = do putWord16be $ unsafeCoerce b ; stage4 bs 51 | stage4 ((UInt b):bs) = do putWord32be b ; stage4 bs 52 | stage4 ((Int b):bs) = do putWord32be $ unsafeCoerce b ; stage4 bs 53 | stage4 ((Str b):bs) = do mapM (\c -> putWord8 $ fromIntegral $ C.ord c) b ; stage4 bs 54 | stage4 [] = do flush 55 | 56 | compile prog = 57 | let (Program bs) = stage1 prog 58 | m = stage2 bs (M.fromList []) 0 59 | reduced = stage3 bs m 60 | final = runPut $ stage4 reduced 61 | in (final, m) 62 | 63 | compileTables tables head = 64 | let check1 = foldl (\a (Table _ code) -> a + (tableChecksum $ fst $ compile code)) 0 ((Table "head" (head 0)):tables) 65 | check2 = tableChecksum $ fst $ compile $ compileFinal $ (Table "head" (head check1)):tables 66 | in compileFinal $ (Table "head" (head $ 0xb1b0afba - check2)):tables 67 | 68 | compileFinal tables = 69 | let tcomp = sortBy (\(a,_,_) (b,_,_) -> a `compare` b) $ map (\(Table name code) -> (name, code, (compile code))) tables 70 | compose ((name, _, (code, _)):ts) offs = do 71 | tableEntry name code offs 72 | let l = fromIntegral $ BS.length code 73 | compose ts (offs + l + (4 - l `mod` 4)) 74 | compose [] offs = do return () 75 | numTables = length tables 76 | pad (_, code, (compiled, _)) = do 77 | code 78 | bytes $ take (4 - (fromIntegral $ BS.length compiled) `mod` 4) (repeat 0) 79 | in do 80 | offset $ fromIntegral $ numTables 81 | compose tcomp ((fromIntegral numTables)*16+12) 82 | sequence $ map pad tcomp 83 | 84 | ops :: [Op] -> State Program () 85 | ops x = do 86 | (Program a) <- get 87 | put $ Program (a ++ x) 88 | 89 | op x = ops [x] 90 | 91 | byte x = op $ Byte x 92 | bytes x = ops $ map (\e -> Byte e) x 93 | 94 | int i = op $ Int i 95 | uint i = op $ UInt i 96 | short i = op $ Short i 97 | ushort i = op $ UShort i 98 | char i = op $ Char i 99 | 100 | ref name = op $ Ref name 101 | 102 | string s = op $ Str s 103 | 104 | label name = op $ Label name 105 | 106 | slen p = let (_, (Program e)) = runState p emptyProg in fromIntegral $ length e 107 | 108 | _offset scalarType numTables searchRange entrySelector rangeShift = do 109 | uint scalarType 110 | ushort numTables 111 | ushort searchRange 112 | ushort entrySelector 113 | ushort rangeShift 114 | 115 | offset numTables = let largest2 n = if 2^n > numTables then n else largest2 $ n+1 116 | eSel = largest2 1 117 | sRange = 2^eSel 118 | in _offset 0x10000 numTables (sRange*16) eSel (numTables*16 - sRange*16) 119 | 120 | _tableDef tag checkSum offset len 121 | | (length tag == 4) = do 122 | string tag 123 | uint checkSum 124 | uint offset 125 | uint len 126 | 127 | tableChecksum table = 128 | let tc = do 129 | e <- remaining 130 | if e < 4 131 | then return 0 132 | else do w <- getWord32be 133 | r <- tc 134 | return $ w + r 135 | in runGet tc $ table 136 | 137 | tableEntry tag table offset = _tableDef tag (tableChecksum table) offset (fromIntegral $ BS.length table) 138 | 139 | _cmapTable version nSub tables = do 140 | ushort version 141 | ushort nSub 142 | tables 143 | 144 | cmapTable tables = do 145 | let n = slen tables 146 | _cmapTable 0 n tables 147 | 148 | cmapEnc pID pSpecID offset = do 149 | ushort pID 150 | ushort pSpecID 151 | ushort offset 152 | 153 | cmapFormat format length language = do 154 | ushort format 155 | ushort length 156 | ushort language 157 | 158 | cmapFormat0 language glyphIndices 159 | | (length glyphIndices) == 262 = do 160 | cmapFormat 0 262 language 161 | bytes glyphIndices 162 | 163 | glyphDesc nContours xMin yMin xMax yMax = do 164 | ushort nContours 165 | short xMin 166 | short yMin 167 | short xMax 168 | short yMax 169 | 170 | _simpleGlyph endPts iLength instrs flags xs ys = do 171 | mapM_ ushort endPts 172 | ushort iLength 173 | instrs 174 | bytes flags 175 | bytes xs 176 | bytes ys 177 | 178 | data GlyphPoint = GPoint Word16 Word8 Int Int -- TODO: full glyph support 179 | 180 | simpleGlyph :: [Word16] -> (State Program ()) -> [Word8] -> [Word8] -> [Word8] -> (State Program ()) 181 | simpleGlyph endPts instrs flags xs ys =_simpleGlyph endPts (slen instrs) instrs flags xs ys 182 | 183 | glyph xMin yMin xMax yMax endPts instrs flags xs ys = 184 | let g = do glyphDesc (fromIntegral $ length endPts) xMin yMin xMax yMax ; simpleGlyph endPts instrs flags xs ys 185 | in if ((length endPts) == (length xs)) && ((length endPts) == (length ys) && ((length endPts) == (length flags))) then g else error "Mismatched lengths" 186 | 187 | _head version revision magic flags unitsPerEm created modified xMin yMin xMax yMax macStyle lowestRec direction iToLoc format csAdjust = do 188 | uint version -- Fixed 189 | uint revision -- Fixed 190 | uint csAdjust 191 | uint magic 192 | ushort flags 193 | ushort unitsPerEm 194 | uint 0 ; uint 0 -- longDateTime 195 | uint 0 ; uint 0 -- longDateTime 196 | short xMin 197 | short yMin 198 | short xMax 199 | short yMax 200 | ushort macStyle 201 | ushort lowestRec 202 | short direction 203 | short iToLoc 204 | short format 205 | 206 | headTable = _head 0x00010000 0 0x5f0f3cf5 207 | 208 | _hhea version ascent descent lineGap aWidthMax minLeft minRight xMaxExtent cSlopeRise cSlopeRun cOffset r0 r1 r2 r3 mDataFormat nMetrics = do 209 | uint version -- Fixed 210 | short ascent 211 | short descent 212 | short lineGap 213 | ushort aWidthMax 214 | short minLeft 215 | short minRight 216 | short xMaxExtent 217 | short cSlopeRise 218 | short cSlopeRun 219 | short cOffset 220 | short r0 ; short r1 ; short r2 ; short r3 221 | short mDataFormat 222 | ushort nMetrics 223 | 224 | 225 | hhea ascent descent lineGap aWidthMax minLeft minRight cSlopeRise cSlopeRun cOffset nMetrics = 226 | _hhea 0x00010000 ascent descent lineGap aWidthMax minLeft minRight 0 cSlopeRise cSlopeRun cOffset 0 0 0 0 0 nMetrics 227 | 228 | hmtxEntry advanceWidth leftSideBearing = do 229 | ushort advanceWidth 230 | short leftSideBearing 231 | 232 | hmtx entries = do 233 | entries 234 | -- sequence bearings 235 | 236 | -- TODO short version 237 | _loca entries = do mapM_ uint entries 238 | 239 | -- TODO ordering 240 | loca m = _loca $ map (\(k,v) -> v) (M.toList m) 241 | 242 | _maxp version numGlyphs maxPoints maxContours maxComponentPoints maxComponentContours maxZones maxTwilightPoints maxStorage maxFunctionDefs maxInstructionDefs maxStackElements maxSizeOfInstructions maxComponentElements maxComponentDepth = do 243 | uint version -- fixed 244 | ushort numGlyphs 245 | ushort maxPoints 246 | ushort maxContours 247 | ushort maxComponentPoints 248 | ushort maxComponentContours 249 | ushort maxZones 250 | ushort maxTwilightPoints 251 | ushort maxStorage 252 | ushort maxFunctionDefs 253 | ushort maxInstructionDefs 254 | ushort maxStackElements 255 | ushort maxSizeOfInstructions 256 | ushort maxComponentElements 257 | ushort maxComponentDepth 258 | 259 | maxp numGlyphs maxPoints maxContours maxComponentPoints maxComponentContours = _maxp 0x00010000 numGlyphs maxPoints maxContours maxComponentPoints maxComponentContours 260 | 261 | _name format count strOffset nameRecords names = do 262 | ushort format 263 | ushort count 264 | ushort strOffset 265 | nameRecords 266 | names 267 | 268 | name nameRecords names count = _name 0 count (count*12+6) nameRecords names 269 | 270 | data NameRecord = NRecord Word16 Word16 Word16 Word16 String 271 | 272 | data MSNameRecord = MSNRecord NameID String 273 | data NameID = Copyright | Family | Subfamily | UUID | Fullname | Version | Postscript | Trademark deriving Enum 274 | 275 | nameRecord pID psID lID nID length offset = do 276 | ushort pID 277 | ushort psID 278 | ushort lID 279 | ushort nID 280 | ushort length 281 | ushort offset 282 | 283 | string16 s = '\00' : (intersperse '\00' s) 284 | 285 | nameHeaderMS records = nameHeader $ map (\(MSNRecord nid str) -> NRecord 3 1 0x409 (fromIntegral $ fromEnum nid) (string16 str)) records 286 | 287 | nameHeader records = 288 | let nh ((NRecord pid psid lid nid str):rs) c = (pid, psid, lid, fromIntegral $ fromEnum nid, fromIntegral (length str), c):(nh rs (c + fromIntegral(length str))) 289 | nh [] c = [] 290 | recs = nh records 0 291 | names = map (\(NRecord _ _ _ _ s) -> s) records 292 | in name (do mapM_ (\(pid, psid, lid, nid, len, off) -> nameRecord pid psid lid nid len off) recs) (do mapM_ string names) (fromIntegral $ length records) 293 | 294 | _post format iAngle uPos uThick fixed minMemT42 maxMemT42 minMemT1 maxMemT1 = do 295 | uint format -- fixed 296 | uint iAngle -- fixed 297 | short uPos 298 | short uThick 299 | uint fixed 300 | uint minMemT42 301 | uint maxMemT42 302 | uint minMemT1 303 | uint maxMemT1 304 | 305 | post format iAngle uPos uThick fixed = _post format iAngle uPos uThick (if fixed then 1 else 0) 0 0 0 0 306 | 307 | post3 iAngle uPos uThick fixed = post 0x00030000 iAngle uPos uThick fixed 308 | 309 | aa = byte 0x7f 310 | abs = byte 0x64 311 | add = byte 0x60 312 | alignpts = byte 0x27 313 | alignrp = byte 0x3c 314 | and = byte 0x5a 315 | call = byte 0x2b 316 | ceiling = byte 0x67 317 | cindex = byte 0x25 318 | clear = byte 0x22 319 | debug = byte 0x5f 320 | deltac1 = byte 0x73 321 | deltac2 = byte 0x74 322 | deltac3 = byte 0x75 323 | deltap1 = byte 0x5d 324 | deltap2 = byte 0x71 325 | deltap3 = byte 0x72 326 | depth = byte 0x24 327 | div = byte 0x67 328 | dup = byte 0x20 329 | eif = byte 0x59 330 | elset = byte 0x1b 331 | endf = byte 0x2d 332 | eq = byte 0x54 333 | even = byte 0x57 334 | fdef = byte 0x2c 335 | flipoff = byte 0x4e 336 | flipon = byte 0x4d 337 | flippt = byte 0x80 338 | fliprgoff= byte 0x82 339 | fliprgon = byte 0x81 340 | floor = byte 0x66 341 | gc orig = byte $ if orig then 0x47 else 0x46 342 | getinfo = byte 0x88 343 | gvf = byte 0x0d 344 | gpf = byte 0x0c 345 | gt = byte 0x52 346 | gteq = byte 0x53 347 | idef = byte 0x89 348 | ift = byte 0x58 349 | instctrl = byte 0x8e 350 | ip = byte 0x39 351 | isect = byte 0x0f 352 | iup x = byte $ if x then 0x31 else 0x30 353 | jmpr = byte 0x1c 354 | jrof = byte 0x79 355 | jrot = byte 0x78 356 | lobytecall = byte 0x2a 357 | lt = byte 0x50 358 | lteq = byte 0x51 359 | max = byte 0x8b 360 | md orig = byte $ if orig then 0x4a else 0x49 361 | mdap round = byte $ if round then 0x2f else 0x2e 362 | mdrp reset min round dtype = byte $ (B.fromListBE [reset, min, round, dtype]) .|. 0xc0 363 | miap round = byte $ if round then 0x3f else 0x3e 364 | min = byte 0x8c 365 | mindex = byte 0x26 366 | mirp reset min round dtype = byte $ (B.fromListBE [reset, min, round, dtype]) .|. 0xe0 367 | mppem = byte 0x4b 368 | mps = byte 0x4c 369 | msirp reset = byte $ if reset then 0x3b else 0x3a 370 | nround dtype = byte $ dtype .|. 0x6f 371 | pushb n 372 | | n < 8 = byte $ n .|. 0xb0 373 | pushbs l 374 | | (length l) < 9 = bytes $ (((fromIntegral $ length l) - 1) .|. 0xb0):l 375 | pushi l = do 376 | let f = sequence l 377 | pushb (slen f) 378 | f 379 | pushw n 380 | | n < 8 = byte $ n .|. 0xb8 381 | pushws l 382 | | (length l) < 9 = do 383 | pushw $ fromIntegral $ (length l) - 1 384 | mapM_ short l 385 | 386 | odd = byte 0x56 387 | or = byte 0x5b 388 | pbyte = byte 0x21 389 | rcvt = byte 0x45 390 | rdtg = byte 0x7d 391 | roff = byte 0x7a 392 | roll = byte 0x8a 393 | round dtype = byte $ dtype .|. 0x68 394 | rs = byte 0x43 395 | rtdg = byte 0x3d 396 | rtg = byte 0x18 397 | rthg = byte 0x19 398 | rutg = byte 0x7c 399 | s45round = byte 0x77 400 | sangw = byte 0x7e 401 | scanctrl = byte 0x85 402 | scantype = byte 0x8d 403 | scfs = byte 0x48 404 | scvtci = byte 0x1d 405 | sdb = byte 0x5e 406 | sdpvtl perp = byte $ if perp then 0x87 else 0x86 407 | sds = byte 0x5f 408 | sfvfs = byte 0x0b 409 | sfvtca x = byte $ if x then 0x05 else 0x04 410 | sfvtl perp = byte $ if perp then 0x09 else 0x08 411 | sfvtpv = byte 0x0e 412 | shc rp = byte $ if rp then 0x35 else 0x34 413 | shp rp = byte $ if rp then 0x33 else 0x32 414 | shpix = byte 0x38 415 | shz rp = byte $ if rp then 0x37 else 0x36 416 | slobyte = byte 0x17 417 | smd = byte 0x1a 418 | spvfs = byte 0x0a 419 | spvtca x = byte $ if x then 0x03 else 0x02 420 | spvtl perp = byte $ if perp then 0x07 else 0x06 421 | sround = byte 0x76 422 | srp0 = byte 0x10 423 | srp1 = byte 0x11 424 | srp2 = byte 0x12 425 | ssw = byte 0x1f 426 | sswci = byte 0x1e 427 | sub = byte 0x61 428 | svtca x = byte $ if x then 0x01 else 0x00 429 | swap = byte 0x23 430 | szp0 = byte 0x13 431 | szp1 = byte 0x14 432 | szp2 = byte 0x15 433 | szps = byte 0x16 434 | utp = byte 0x29 435 | wcvtf = byte 0x70 436 | wcvtp = byte 0x44 437 | ws = byte 0x42 438 | -------------------------------------------------------------------------------- /Template.hs: -------------------------------------------------------------------------------- 1 | {-# LANGUAGE DeriveGeneric, DefaultSignatures, FlexibleInstances, OverlappingInstances, DoAndIfThenElse #-} 2 | module Template where 3 | 4 | import Data.Serialize 5 | import Data.Serialize.Put 6 | import Data.Serialize.Get 7 | import GHC.Generics 8 | import qualified Data.ByteString as BS 9 | import Data.Bits 10 | import GHC.Int 11 | import GHC.Word 12 | import Control.Monad 13 | import Control.Monad.Loops 14 | import Control.Applicative 15 | import Data.List 16 | import Data.Maybe 17 | import qualified Data.Map as M 18 | import Debug.Trace 19 | 20 | type Fixed = Word32 21 | type FWord = Int16 22 | type DateTime = Word64 23 | data PArray w a = PArray w [a] deriving Show 24 | 25 | puts x = mapM_ put x 26 | getN n = replicateM (fromIntegral n) get 27 | 28 | instance (Serialize w, Serialize as, Integral w) => Serialize (PArray w as) where 29 | get = do 30 | n <- get 31 | as <- getN n 32 | return (PArray n as) 33 | 34 | put (PArray n s) = do 35 | put n 36 | puts s 37 | 38 | type PString = PArray Word8 Char 39 | 40 | newtype BArray a = BArray [a] deriving Show 41 | 42 | instance (Serialize as) => Serialize (BArray as) where 43 | get = do error "Infinite array get!" 44 | put (BArray cs) = puts cs 45 | 46 | 47 | type BString = BArray Char 48 | 49 | getb n = do 50 | a <- getN n 51 | return (BArray a) 52 | 53 | instance Serialize (BArray PString) where 54 | get = do 55 | bs <- whileM (do 56 | r <- remaining 57 | if r > 0 then liftM ((<= r) . fromIntegral) (lookAhead get :: Get Word8) 58 | else return False 59 | ) get 60 | return $ BArray bs 61 | put (BArray ps) = do mapM_ put ps 62 | 63 | data TTF = TTF { 64 | ttfOffset :: Offset, 65 | tableDefs :: BArray TableDef, 66 | tables :: BArray Table 67 | } deriving (Generic, Show) 68 | 69 | instance Serialize TTF where 70 | get = do 71 | o@(Offset s n r e sh) <- get 72 | tdefs <- replicateM (fromIntegral n) get 73 | let sdefs = sortBy (\(TableDef {off=l}) (TableDef {off=r}) -> l `compare` r) tdefs 74 | let mdefs = M.fromList $ map (\t@(TableDef {tag=(BArray tag)}) -> (tag, t)) sdefs 75 | let start = 12 + 16*(fromIntegral n) 76 | head <- lookAhead (tableFromTag start (mdefs M.! "head") (M.fromList [])) 77 | hhea <- lookAhead (tableFromTag start (mdefs M.! "hhea") (M.fromList [])) 78 | maxp <- lookAhead (tableFromTag start (mdefs M.! "maxp") (M.fromList [])) 79 | let neededTabs = M.fromList [("head",head),("hhea",hhea),("maxp",maxp)] 80 | tabs <- mapM (\e -> lookAhead (tableFromTag start e neededTabs)) sdefs 81 | return $ TTF o (BArray tdefs) (BArray tabs) 82 | put (TTF o d (BArray ts)) = do 83 | put o 84 | put d 85 | mapM_ putByteString $ map padbs $ map encode ts 86 | 87 | tableFromTag :: Word32 -> TableDef -> M.Map String Table -> Get Table 88 | tableFromTag start (TableDef (BArray tag) _ off len) tabs = do 89 | skip $ fromIntegral (off-start) 90 | bs <- getBytes $ fromIntegral len 91 | case (runGet (fromTag tag bs tabs) bs) of 92 | (Left m) -> error m 93 | (Right t) -> return t 94 | 95 | fromTag :: String -> BS.ByteString -> M.Map String Table -> Get Table 96 | fromTag tag bs tabs = do 97 | case tag of 98 | "cmap" -> liftM CmapTable get 99 | "cvt " -> liftM CvtTable get 100 | "fpgm" -> liftM FpgmTable get 101 | --"glyf" -> liftM GlyfTable (getGlyf (tabs M.! "maxp") (tabs M.! "head")) 102 | "head" -> liftM HeadTable get 103 | "hhea" -> liftM HheaTable get 104 | "hmtx" -> liftM HmtxTable (getHmtx (tabs M.! "maxp") (tabs M.! "hhea")) 105 | "loca" -> liftM LocaTable (getLoca (tabs M.! "maxp") (tabs M.! "head")) 106 | "maxp" -> liftM MaxpTable get 107 | "name" -> liftM NameTable get 108 | "post" -> liftM PostTable get 109 | _ -> return $ UnknownTable tag bs 110 | 111 | tagFromTable t = 112 | case t of 113 | (CmapTable _) -> BArray "cmap" 114 | (CvtTable _) -> BArray "cmap" 115 | (FpgmTable _) -> BArray "fpgm" 116 | (GlyfTable _) -> BArray "glyf" 117 | (HeadTable _) -> BArray "head" 118 | (HheaTable _) -> BArray "hhea" 119 | (HmtxTable _) -> BArray "hmtx" 120 | (LocaTable _) -> BArray "loca" 121 | (MaxpTable _) -> BArray "maxp" 122 | (NameTable _) -> BArray "name" 123 | (PostTable _) -> BArray "post" 124 | (UnknownTable tag _) -> BArray tag 125 | 126 | padbs bs = 127 | let bsl = fromIntegral $ BS.length bs 128 | pad = 3 - ((bsl - 1)`mod` 4) 129 | in bs `BS.append` (BS.pack (take pad $ repeat 0)) 130 | 131 | accum a (tag, bs) = let 132 | padd = padbs bs 133 | anext = a + (fromIntegral $ BS.length padd) 134 | dnext = tableEntry tag padd (fromIntegral a) 135 | in (anext, dnext) 136 | 137 | ttfTables tables = do 138 | let n = fromIntegral $ length tables 139 | let tabs = map (\t -> (tagFromTable t,encode t)) tables 140 | let (_, tdefs) = mapAccumL accum (12 + 16*(fromIntegral n)) tabs 141 | put $ offset n 142 | puts tdefs 143 | puts $ map snd tabs 144 | 145 | data Offset = Offset { 146 | scalarType :: Word32, 147 | numTables :: Word16, 148 | searchRange :: Word16, 149 | entrySelector :: Word16, 150 | rangeShift :: Word16 151 | } deriving (Generic, Show) 152 | instance Serialize Offset 153 | 154 | offset numTables = 155 | let largest2 n = if 2^n > numTables then n else largest2 $ n+1 156 | eSel = largest2 1 157 | sRange = 2^eSel 158 | in Offset 0x10000 numTables (sRange*16) eSel (numTables*16 - sRange*16) 159 | 160 | data TableDef = TableDef { 161 | tag :: BString, 162 | checkSum :: Word32, 163 | off :: Word32, 164 | len :: Word32 165 | } deriving (Generic, Show) 166 | 167 | instance Serialize TableDef where 168 | get = do 169 | tag <- getb 4 170 | liftM3 (TableDef tag) get get get 171 | 172 | getBS tc d = let r = runGet tc $ d 173 | in case r of 174 | Left m -> error m 175 | Right s -> s 176 | 177 | tableChecksum table = 178 | let tc = do 179 | e <- remaining 180 | if e < 4 181 | then return 0 182 | else do w <- getWord32be 183 | r <- tc 184 | return $ w + r 185 | in getBS tc table 186 | 187 | tableEntry tag table offset = TableDef tag (tableChecksum table) offset (fromIntegral $ BS.length table) 188 | 189 | data Table = CmapTable Cmap 190 | | CvtTable Cvt 191 | | GlyfTable Glyf 192 | | FpgmTable Fpgm 193 | | HeadTable Head 194 | | HheaTable Hhea 195 | | HmtxTable Hmtx 196 | | LocaTable Loca 197 | | MaxpTable Maxp 198 | | NameTable Name 199 | | PostTable Post 200 | | UnknownTable String BS.ByteString deriving (Generic, Show) 201 | instance Serialize Table where 202 | put (CmapTable t) = put t 203 | put (CvtTable t) = put t 204 | put (FpgmTable t) = put t 205 | put (GlyfTable t) = put t 206 | put (HeadTable t) = put t 207 | put (HheaTable t) = put t 208 | put (LocaTable t) = put t 209 | put (HmtxTable t) = put t 210 | put (MaxpTable t) = put t 211 | put (NameTable t) = put t 212 | put (PostTable t) = put t 213 | put (UnknownTable _ bs) = putByteString bs 214 | 215 | data Cmap = Cmap { 216 | version :: Word16, 217 | encs :: PArray Word16 CmapEnc, 218 | formats :: BArray CmapFormat 219 | } deriving (Generic, Show) 220 | 221 | instance Serialize Cmap where 222 | get = do 223 | vers <- get 224 | encs@(PArray _ es) <- get 225 | let fmts = length $ nub $ map encOff es 226 | liftM (Cmap vers encs) (getb fmts) 227 | 228 | data CmapEnc = CmapEnc { 229 | pID :: Word16, 230 | pSpecID :: Word16, 231 | encOff :: Word32 232 | } deriving (Generic, Show) 233 | instance Serialize CmapEnc 234 | 235 | data CmapFormat = CmapFormat0 { 236 | cmapFormat :: Word16, 237 | formatLen :: Word16, 238 | formatLang :: Word16, 239 | glyphIndices:: BArray Word8 240 | } | CmapUnknown16 Word16 Word16 BS.ByteString | CmapUnknown32 Word32 Word32 BS.ByteString deriving (Generic, Show) 241 | 242 | instance Serialize CmapFormat where 243 | get = do 244 | fmt <- get 245 | if fmt == 0 then do 246 | flen <- get 247 | liftM2 (CmapFormat0 0 flen) get (getb (flen-6)) 248 | else if fmt == 2 || fmt == 4 || fmt == 6 then do 249 | flen <- get 250 | liftM (CmapUnknown16 fmt flen) (getBytes $ (fromIntegral flen)-4) 251 | else do 252 | fmt2 <- get :: Get Word16 253 | flen <- get 254 | let fmt32 = ((fromIntegral fmt) `shift` 16) .|. (fromIntegral fmt2) 255 | liftM (CmapUnknown32 fmt32 flen) (getBytes $ (fromIntegral flen)-8) 256 | 257 | put (CmapFormat0 f l a g) = do 258 | puts [f, l, a] 259 | put g 260 | put (CmapUnknown16 f l bs) = do 261 | put f; put l 262 | putByteString bs 263 | put (CmapUnknown32 f l bs) = do 264 | put f; put l 265 | putByteString bs 266 | 267 | 268 | blength (BArray bs) = fromIntegral $ length bs 269 | 270 | cmapFormat0 language glyphIndices = 271 | let n = (blength glyphIndices)+6 272 | in CmapFormat0 0 n language glyphIndices 273 | 274 | data Cvt = Cvt (BArray FWord) deriving (Generic, Show) 275 | instance Serialize Cvt where 276 | get = do 277 | r <- remaining 278 | liftM Cvt (getb (r `shift` (-1))) 279 | 280 | data Fpgm = Fpgm (BArray Word8) deriving (Generic, Show) 281 | instance Serialize Fpgm where 282 | get = do 283 | r <- remaining 284 | bs <- getByteString r 285 | return $ Fpgm $ BArray (BS.unpack bs) 286 | 287 | data Glyf = Glyf (BArray GlyphDesc) deriving (Generic, Show) 288 | instance Serialize Glyf 289 | 290 | getAligned long = do 291 | pre <- remaining 292 | x <- get 293 | post <- remaining 294 | let diff = pre - post 295 | let npad = if long == 1 296 | then 3 - ((diff - 1) `mod` 4) 297 | else (if diff `mod` 2 == 1 then 1 else 0) 298 | got <- getN npad :: Get [Word8] 299 | return x 300 | 301 | getGlyf (MaxpTable m) (HeadTable h) = do 302 | xs <- replicateM (fromIntegral $ numGlyphs m) $ getAligned $ iToLoc h 303 | return $ Glyf $ BArray xs 304 | 305 | data Point = PointB Word8 | PointS Int16 deriving (Generic, Show) 306 | 307 | instance Serialize Point where 308 | put (PointB p) = put p 309 | put (PointS p) = put p 310 | 311 | data GlyphDesc = GlyphDesc { 312 | nContours :: Int16, 313 | xMin :: FWord, 314 | yMin :: FWord, 315 | xMax :: FWord, 316 | yMax :: FWord, 317 | glyph :: Glyph 318 | } deriving (Generic, Show) 319 | 320 | data Glyph = SimpleGlyph { 321 | endPts :: BArray Word16, 322 | instrs :: PArray Word16 Word8, 323 | pflags :: BArray Word8, 324 | xs :: BArray Point, 325 | ys :: BArray Point 326 | } | CompoundGlyph { 327 | cflags :: Word16, 328 | glyphIndex :: Word16, 329 | arg1 :: Point, 330 | arg2 :: Point, 331 | trans :: Point 332 | } deriving (Generic, Show) 333 | 334 | instance Serialize Glyph where 335 | get = error "Serializing lone glyph" 336 | put (SimpleGlyph e i p x y) = do 337 | put e; put i; put p 338 | put x; put y 339 | put (CompoundGlyph c g a1 a2 t) = do 340 | put c; put g 341 | put a1; put a2 342 | put t 343 | 344 | getpflags n 345 | | n > 0 = do 346 | flag <- get 347 | if flag .&. 8 == 8 348 | then do 349 | rep <- get :: Get Word8 350 | let flags = flag:(take (fromIntegral rep) $ repeat flag) 351 | rest <- getpflags (n - 1 - (fromIntegral rep)) 352 | return (flags ++ rest) 353 | else do 354 | rest <- getpflags (n - 1) 355 | return (flag:rest) 356 | | otherwise = return [] 357 | 358 | getps i j (p:ps) prev = do 359 | if p .&. i /= 0 360 | then do 361 | num <- get 362 | let new = PointB (if p .&. j == 0 then num else -num) 363 | rest <- getps i j ps new 364 | return (new:rest) 365 | else if p .&. j == 0 366 | then do 367 | new <- liftM PointS get 368 | rest <- getps i j ps new 369 | return (new:rest) 370 | else do 371 | rest <- getps i j ps prev 372 | return (prev:rest) 373 | 374 | getps _ _ [] _ = return [] 375 | 376 | instance Serialize GlyphDesc where 377 | get = do 378 | nc <- get 379 | x0 <- get; y0 <- get 380 | xm <- get; ym <- get 381 | let gp = GlyphDesc nc x0 y0 xm ym 382 | if nc < 0 383 | then error "Compound glyph!" 384 | else liftM gp (simpleGlyph nc) 385 | 386 | simpleGlyph nc = do 387 | end <- getN nc 388 | instrs <- get 389 | let n = foldr max 0 $ map (+ 1) end 390 | pflag <- getpflags n 391 | xs <- getps 2 16 pflag (PointS 0) 392 | ys <- getps 4 32 pflag (PointS 0) 393 | return $ SimpleGlyph (BArray end) instrs (BArray pflag) (BArray xs) (BArray ys) 394 | 395 | {- 396 | data GlyphPoint = GPoint Word16 Word8 Int Int -- TODO: full glyph support 397 | 398 | simpleGlyph :: [Word16] -> (State Program ()) -> [Word8] -> [Word8] -> [Word8] -> (State Program ()) 399 | simpleGlyph endPts instrs flags xs ys =_simpleGlyph endPts (slen instrs) instrs flags xs ys 400 | 401 | glyph xMin yMin xMax yMax endPts instrs flags xs ys = 402 | let g = do glyphDesc (fromIntegral $ length endPts) xMin yMin xMax yMax ; simpleGlyph endPts instrs flags xs ys 403 | in if ((length endPts) == (length xs)) && ((length endPts) == (length ys) && ((length endPts) == (length flags))) then g else error "Mismatched lengths" 404 | -} 405 | 406 | data Head = Head { 407 | headVersion :: Fixed, 408 | revision :: Fixed, 409 | csAdjust :: Word32, 410 | magic :: Word32, 411 | flags :: Word16, 412 | unitsPerEm :: Word16, 413 | created :: DateTime, 414 | modified :: DateTime, 415 | allXMin :: FWord, 416 | allYMin :: FWord, 417 | allXMax :: FWord, 418 | allYMax :: FWord, 419 | macStyle :: Word16, 420 | lowestRec :: Word16, 421 | direction :: Int16, 422 | iToLoc :: Int16, 423 | format :: Int16 424 | } deriving (Generic, Show) 425 | instance Serialize Head 426 | {- 427 | headTable = _head 0x00010000 0 0x5f0f3cf5 428 | -} 429 | 430 | data Hhea = Hhea { 431 | hheaVersion :: Fixed, 432 | ascent :: Int16, 433 | descent :: Int16, 434 | lineGap :: Int16, 435 | aWidthMax :: Word16, 436 | minLeft :: Int16, 437 | minRight :: Int16, 438 | xMaxExtent :: Int16, 439 | cSlopeRise :: Int16, 440 | cSlopeRun :: Int16, 441 | cOffset :: Int16, 442 | r0 :: Int16, r1 :: Int16, r2 :: Int16, r3 :: Int16, 443 | mDataFormat :: Int16, 444 | nMetrics :: Word16 445 | } deriving (Generic, Show) 446 | instance Serialize Hhea 447 | {- 448 | hhea ascent descent lineGap aWidthMax minLeft minRight cSlopeRise cSlopeRun cOffset nMetrics = 449 | _hhea 0x00010000 ascent descent lineGap aWidthMax minLeft minRight 0 cSlopeRise cSlopeRun cOffset 0 0 0 0 0 nMetrics 450 | 451 | -- TODO short version 452 | _loca entries = do mapM_ uint entries 453 | 454 | -- TODO ordering 455 | loca m = _loca $ map (\(k,v) -> v) (M.toList m) 456 | -} 457 | 458 | data Hmtx = Hmtx (BArray HmtxEntry) (BArray FWord) deriving (Generic, Show) 459 | instance Serialize Hmtx 460 | 461 | getHmtx (MaxpTable m) (HheaTable h) = do 462 | let nhor = nMetrics h 463 | let nglf = numGlyphs m 464 | liftM2 Hmtx (getb nhor) (getb (nglf - nhor)) 465 | 466 | data HmtxEntry = HmtxEntry { 467 | advanceWidth :: Word16, 468 | leftSideBearing :: Int16 469 | } deriving (Generic, Show) 470 | instance Serialize HmtxEntry 471 | 472 | data Loca = LocaShort (BArray Word16) | LocaLong (BArray Word32) deriving (Generic, Show) 473 | instance Serialize Loca where 474 | put (LocaShort ws) = put ws 475 | put (LocaLong ws) = put ws 476 | 477 | getLoca (MaxpTable m) (HeadTable h) = 478 | let fmt = iToLoc h 479 | n = (numGlyphs m)+1 480 | in case fmt of 481 | 0 -> liftM LocaShort (getb n) 482 | 1 -> liftM LocaLong (getb n) 483 | 484 | data Maxp = Maxp { 485 | maxpVersion :: Fixed, 486 | numGlyphs :: Word16, 487 | maxPoints :: Word16, 488 | maxContours :: Word16, 489 | maxComponentPoints :: Word16, 490 | maxComponentContours :: Word16, 491 | maxZones :: Word16, 492 | maxTwilightPoints :: Word16, 493 | maxStorage :: Word16, 494 | maxFunctionDefs :: Word16, 495 | maxInstructionDefs :: Word16, 496 | maxStackElements :: Word16, 497 | maxSizeOfInstructions :: Word16, 498 | maxComponentElements :: Word16, 499 | maxComponentDepth :: Word16 500 | } deriving (Generic, Show) 501 | instance Serialize Maxp 502 | {- 503 | maxp numGlyphs maxPoints maxContours maxComponentPoints maxComponentContours = _maxp 0x00010000 numGlyphs maxPoints maxContours maxComponentPoints maxComponentContours 504 | -} 505 | 506 | data Name = Name { 507 | nameFormat :: Word16, 508 | count :: Word16, 509 | strOffset :: Word16, 510 | nameRecords :: BArray NameRecord, 511 | names :: BS.ByteString 512 | } deriving (Generic, Show) 513 | 514 | instance Serialize Name where 515 | get = do 516 | nf <- get; c <- get; o <- get; nr <- getb c 517 | r <- remaining 518 | ns <- getBytes r 519 | return $ Name nf c o nr ns 520 | put (Name f c s r n) = do 521 | puts [f,c,s] 522 | put r 523 | putByteString n 524 | 525 | {- 526 | name nameRecords names count = _name 0 count (count*12+6) nameRecords names 527 | 528 | data NameRecord = NRecord Word16 Word16 Word16 Word16 String 529 | 530 | data MSNameRecord = MSNRecord NameID String 531 | data NameID = Copyright | Family | Subfamily | UUID | Fullname | Version | Postscript | Trademark deriving Enum 532 | -} 533 | data NameRecord = NameRecord { 534 | namepID :: Word16, 535 | namepsID :: Word16, 536 | namelID :: Word16, 537 | namenID :: Word16, 538 | nameLength :: Word16, 539 | nameOffset :: Word16 540 | } deriving (Generic, Show) 541 | instance Serialize NameRecord 542 | 543 | {- 544 | string16 s = '\00' : (intersperse '\00' s) 545 | 546 | nameHeaderMS records = nameHeader $ map (\(MSNRecord nid str) -> NRecord 3 1 0x409 (fromIntegral $ fromEnum nid) (string16 str)) records 547 | 548 | nameHeader records = 549 | let nh ((NRecord pid psid lid nid str):rs) c = (pid, psid, lid, fromIntegral $ fromEnum nid, fromIntegral (length str), c):(nh rs (c + fromIntegral(length str))) 550 | nh [] c = [] 551 | recs = nh records 0 552 | names = map (\(NRecord _ _ _ _ s) -> s) records 553 | in name (do mapM_ (\(pid, psid, lid, nid, len, off) -> nameRecord pid psid lid nid len off) recs) (do mapM_ string names) (fromIntegral $ length records) 554 | -} 555 | 556 | data Post = Post { 557 | postFormat :: Fixed, 558 | iAngle :: Fixed, 559 | uPos :: Int16, 560 | uThick :: Int16, 561 | fixed :: Word32, 562 | minMemT42 :: Word32, 563 | maxMemT42 :: Word32, 564 | minMemT1 :: Word32, 565 | maxMemT1 :: Word32, 566 | postf :: PostFormat 567 | } deriving (Generic, Show) 568 | instance Serialize Post 569 | 570 | data PostFormat = PostFormat2 { 571 | glyphNameInd :: PArray Word16 Word16, 572 | pNames :: BArray PString 573 | } deriving (Generic, Show) 574 | 575 | 576 | instance Serialize PostFormat 577 | 578 | {- 579 | post format iAngle uPos uThick fixed = _post format iAngle uPos uThick (if fixed then 1 else 0) 0 0 0 0 580 | 581 | post3 iAngle uPos uThick fixed = post 0x00030000 iAngle uPos uThick fixed 582 | -} 583 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | {project} Copyright (C) {year} {fullname} 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | --------------------------------------------------------------------------------