├── .gitignore
├── BemaniLZ
    ├── BemaniLZ.c
    └── BemaniLZ.h
├── CMakeLists.txt
├── LICENSE
├── README.md
├── filedata-tool.py
├── lodepng
    ├── LICENSE
    ├── lodepng.c
    └── lodepng.h
├── pngquant
    ├── .gitignore
    ├── .travis.yml
    ├── CHANGELOG
    ├── CODE_OF_CONDUCT.md
    ├── CONTRIBUTING.md
    ├── COPYRIGHT
    ├── Cargo.toml
    ├── Makefile
    ├── README.md
    ├── blur.c
    ├── blur.h
    ├── configure
    ├── imagequant.pc.in
    ├── kmeans.c
    ├── kmeans.h
    ├── libimagequant.c
    ├── libimagequant.cs
    ├── libimagequant.h
    ├── mediancut.c
    ├── mediancut.h
    ├── mempool.c
    ├── mempool.h
    ├── nearest.c
    ├── nearest.h
    ├── org
    │   └── pngquant
    │   │   ├── Image.java
    │   │   ├── LiqObject.java
    │   │   ├── PngQuant.c
    │   │   ├── PngQuant.java
    │   │   ├── PngQuantException.java
    │   │   └── Result.java
    ├── pam.c
    ├── pam.h
    ├── pom.xml
    └── rust
    │   ├── build.rs
    │   └── libimagequant.rs
├── tcb-convert.c
└── tcb-extract.c


/.gitignore:
--------------------------------------------------------------------------------
 1 | # Prerequisites
 2 | *.d
 3 | 
 4 | # Object files
 5 | *.o
 6 | *.ko
 7 | *.obj
 8 | *.elf
 9 | 
10 | # Linker output
11 | *.ilk
12 | *.map
13 | *.exp
14 | 
15 | # Precompiled Headers
16 | *.gch
17 | *.pch
18 | 
19 | # Libraries
20 | *.lib
21 | *.a
22 | *.la
23 | *.lo
24 | 
25 | # Shared objects (inc. Windows DLLs)
26 | *.dll
27 | *.so
28 | *.so.*
29 | *.dylib
30 | 
31 | # Executables
32 | *.exe
33 | *.out
34 | *.app
35 | *.i*86
36 | *.x86_64
37 | *.hex
38 | 
39 | # Debug files
40 | *.dSYM/
41 | *.su
42 | *.idb
43 | *.pdb
44 | 
45 | # Kernel Module Compile Results
46 | *.mod*
47 | *.cmd
48 | .tmp_versions/
49 | modules.order
50 | Module.symvers
51 | Mkfile.old
52 | dkms.conf


--------------------------------------------------------------------------------
/BemaniLZ/BemaniLZ.c:
--------------------------------------------------------------------------------
  1 | #include "BemaniLZ.h"
  2 | 
  3 | /* Based on BemaniLZ.cs from Scharfrichter */
  4 | 
  5 | static const unsigned int BUFFER_MASK = 0x3FF;
  6 | 
  7 | int decompress(uint8_t *src, int srcSize, uint8_t *dst, int dstSize)
  8 | {
  9 | 	int srcOffset = 0;
 10 | 	int dstOffset = 0;
 11 | 
 12 | 	uint8_t buffer[0x400];
 13 | 	int bufferOffset = 0;
 14 | 
 15 | 	uint8_t data = '\0';
 16 | 	uint32_t control = 0;
 17 | 	int32_t length = 0;
 18 | 	uint32_t distance = 0;
 19 | 	int loop = 0;
 20 | 
 21 | 	while(1)
 22 | 	{
 23 | 		loop = 0;
 24 | 
 25 | 		control >>= 1;
 26 | 		if (control < 0x100)
 27 | 		{
 28 | 			control = (uint8_t)src[srcOffset++] | 0xFF00;
 29 | 			//printf("control=%08X\n", control);
 30 | 		}
 31 | 
 32 | 		data = src[srcOffset++];
 33 | 
 34 | 		// direct copy
 35 | 		// can do stream of 1 - 8 direct copies
 36 | 		if ((control & 1) == 0)
 37 | 		{
 38 | 			//printf("%08X: direct copy %02X\n", dstOffset, data);
 39 | 			dst[dstOffset++] = data;
 40 | 			buffer[bufferOffset] = data;
 41 | 			bufferOffset = (bufferOffset + 1) & BUFFER_MASK;
 42 | 			continue;
 43 | 		}
 44 | 
 45 | 		// window copy (long distance)
 46 | 		if ((data & 0x80) == 0)
 47 | 		{
 48 | 			/*
 49 | 			input stream:
 50 | 			00: 0bbb bbaa
 51 | 			01: dddd dddd
 52 | 			distance: [0 - 1023] (00aa dddd dddd)
 53 | 			length: [2 - 33] (000b bbbb)
 54 | 			*/
 55 | 			distance = (uint8_t)src[srcOffset++] | ((data & 0x3) << 8);
 56 | 			length = (data >> 2) + 2;
 57 | 			loop = 1;
 58 | 			//printf("long distance: distance=%08X length=%08X data=%02X\n", distance, length, data);
 59 | 			//printf("%08X: window copy (long): %d bytes from %08X\n", dstOffset, length, dstOffset - distance);
 60 | 		}
 61 | 
 62 | 		// window copy (short distance)
 63 | 		else if ((data & 0x40) == 0)
 64 | 		{
 65 | 			/*
 66 | 			input stream:
 67 | 			00: llll dddd
 68 | 			distance: [1 - 16] (dddd)
 69 | 			length: [1 - 4] (llll)
 70 | 			*/
 71 | 			distance = (data & 0xF) + 1;
 72 | 			length = (data >> 4) - 7;
 73 | 			loop = 1;
 74 | 			//printf("short distance: distance=%08X length=%08X data=%02X\n", distance, length, data);
 75 | 			//printf("%08X: window copy (short): %d bytes from %08X\n", dstOffset, length, dstOffset - distance);
 76 | 		}
 77 | 
 78 | 		if (loop)
 79 | 		{
 80 | 			// copy length bytes from window
 81 | 			while(length-- >= 0)
 82 | 			{
 83 | 				data = buffer[(bufferOffset - distance) & BUFFER_MASK];
 84 | 				dst[dstOffset++] = data;
 85 | 				buffer[bufferOffset] = data;
 86 | 				bufferOffset = (bufferOffset + 1) & BUFFER_MASK;
 87 | 			}
 88 | 			continue;
 89 | 		}
 90 | 
 91 | 		// end of stream
 92 | 		if (data == 0xFF)
 93 | 			break;
 94 | 
 95 | 		// block copy
 96 | 		// directly copy group of bytes
 97 | 		/*
 98 | 		input stream:
 99 | 		00: llll lll0
100 | 		length: [8 - 69]
101 | 		directly copy (length+1) bytes
102 | 		*/
103 | 		length = data - 0xB9;
104 | 		//printf("block copy %d bytes\n", length+1);
105 | 		while (length-- >= 0)
106 | 		{
107 | 			data = src[srcOffset++];
108 | 			dst[dstOffset++] = data;
109 | 			buffer[bufferOffset] = data;
110 | 			bufferOffset = (bufferOffset + 1) & BUFFER_MASK;
111 | 		}
112 | 	}
113 | 
114 | 	return dstOffset;
115 | }
116 | 


--------------------------------------------------------------------------------
/BemaniLZ/BemaniLZ.h:
--------------------------------------------------------------------------------
 1 | 
 2 | #ifndef BEMANILZ_H
 3 | #define BEMANILZ_H
 4 | 
 5 | #include <stdint.h>
 6 | 
 7 | // Decompress data compressed with KonamiLZ
 8 | // Return value: final decompressed size
 9 | int decompress(uint8_t *src, int srcSize, uint8_t *dst, int dstSize);
10 | 
11 | #endif // BEMANILZ_H
12 | 


--------------------------------------------------------------------------------
/CMakeLists.txt:
--------------------------------------------------------------------------------
 1 | CMAKE_MINIMUM_REQUIRED(VERSION 2.6)
 2 | 
 3 | project(tcbtools)
 4 | 
 5 | #
 6 | # Libraries
 7 | #
 8 | file(GLOB sources_pngquant
 9 |     pngquant/*.c
10 | )
11 | add_library(pngquant ${sources_pngquant})
12 | 
13 | file(GLOB sources_lodepng
14 |     lodepng/*.c
15 | )
16 | add_library(lodepng ${sources_lodepng})
17 | 
18 | file(GLOB sources_bemanilz
19 |     BemaniLZ/*.c
20 | )
21 | add_library(bemanilz ${sources_bemanilz})
22 | 
23 | #
24 | # Executables
25 | #
26 | file(GLOB sources_tcb_extract
27 |     tcb-extract.c
28 | )
29 | add_executable(tcb-extract ${sources_tcb_extract})
30 | target_link_libraries(tcb-extract bemanilz)
31 | 
32 | file(GLOB sources_tcb_convert
33 |     tcb-convert.c
34 | )
35 | add_executable(tcb-convert ${sources_tcb_convert})
36 | target_link_libraries(tcb-convert bemanilz pngquant lodepng)


--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
1 | MIT License
2 | 
3 | Copyright (c) 2015-2018 Wesley Castro
4 | 
5 | Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
6 | 
7 | The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
8 | 
9 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
 1 | # DDR Tools
 2 | Tools for extracting and modifying files from Dance Dance Revolution CS games.
 3 | 
 4 | ## TCB Tools
 5 | Tools for extracting and converting TCB image files.
 6 | 
 7 | ### Building
 8 | ```
 9 | mkdir build
10 | cd build
11 | cmake ..
12 | make
13 | ```
14 | 
15 | ### Usage
16 | 
17 | #### tcb-extract
18 | Search for and extract compressed and uncompressed TCB files within a file.
19 | 
20 | ```
21 | ./tcb-extract <mode> <file containing TCBs>
22 | ```
23 | Modes:
24 | * `1` - Bruteforce search for compressed and uncompressed TCBs.
25 | * `2` - Extract TCBs from file beginning with table (compressed entries).
26 | * `3` - Extract TCBs from file beginning with table (uncompressed entries).
27 | 
28 | In most cases `1` works best as many table variations exist that `2` and `3`
29 | won't work with.
30 | 
31 | #### tcb-convert
32 | Convert TCB files to PNG images or inject PNG images back into TCB files. The
33 | extracted image will be a standard RGBA PNG image converted from either a 16 or
34 | 256 color palletized source. When injecting a PNG back into a TCB, the image
35 | data will be updated and a new pallete will be generated to match the TCB's
36 | original format. The PNG you inject must be the same resolution as the TCB.
37 | 
38 | > Convert TCB to PNG:
39 | ```
40 | ./tcb-convert e <TCB file>
41 | ```
42 | 
43 | > Inject PNG into TCB:
44 | ```
45 | ./tcb-convert i <PNG file>
46 | ```
47 | 
48 | ## filedata-tool.py
49 | Extract and create filedata.bin files.
50 | 
51 | ```
52 | python3 filedata-tool.py <mode> <elf file> <filedata.bin> <directory>
53 | ```
54 | Modes:
55 | * `extract` - Extract the contents of `filedata.bin` to `directory`. All files
56 |   referenced in the file table located in the game's `elf file` will be
57 |   extracted in addition to "hidden" data missing from the file table. A CSV file
58 |   will be created named `directory\fieldata.csv` containing IDs, offsets, and
59 |   lengths found in the game's ELF, hidden file offsets and lengths, the exported
60 |   filename, and a guessed description of the file contents to aid in
61 |   modification.
62 | * `create` - Create `filedata.bin` using files in `directory`. The CSV created
63 |   by the extraction mode is used to assemble a new file in the correct order and
64 |   to update the file table in `elf file`.
65 | 
66 | ### Tips
67 | * Don't modify the ids, offsets, or lengths in the CSV file created by the
68 |   extraction mode. The filenames can be changed if desired.
69 | * Don't change the order of the rows in the CSV file. It matches the order of
70 |   the file table found in the game's ELF.
71 | * New entries can't be added to the filetable, although this wouldn't be useful
72 |   anyway. Instead, existing entries can be modified.
73 | 


--------------------------------------------------------------------------------
/filedata-tool.py:
--------------------------------------------------------------------------------
  1 | #!/usr/bin/env python3
  2 | 
  3 | import struct
  4 | import os
  5 | from decimal import *
  6 | from sys import argv
  7 | import sys
  8 | import csv
  9 | import argparse
 10 | 
 11 | class FileData:
 12 |     # Length of the ELF is used as the key
 13 |     table_info = {
 14 |         0x176C2C: {
 15 |             # Tested working
 16 |             'name': 'MAX JP',
 17 |             'offset': 0x175B18,
 18 |             'num_entries': 374
 19 |         },
 20 |         0x19D568: {
 21 |             # Tested working
 22 |             'name': 'MAX US',
 23 |             'offset': 0x168320,
 24 |             'num_entries': 577
 25 |         },
 26 |         0x1DAC88: {
 27 |             'name': 'MAX 2 JP',
 28 |             'offset': 0x17DDE8,
 29 |             'num_entries': 675
 30 |         },
 31 |         0x265854: {
 32 |             'name': 'MAX 2 US',
 33 |             'offset': 0x1A0810,
 34 |             'num_entries': 795
 35 |         },
 36 |         0x12A608: {
 37 |             'name': 'MAX 2 E3 Demo US',
 38 |             'offset': 0x1842F0,
 39 |             'num_entries': 223
 40 |         },
 41 |         2672124: {
 42 |             # Tested working
 43 |             'name': 'Extreme JP',
 44 |             'offset': 0x1B3130,
 45 |             'num_entries': 656
 46 |         },
 47 |         3871008: {
 48 |             'name': 'Extreme E3 Demo US',
 49 |             'offset': 0x17C880,
 50 |             'num_entries': 680
 51 |         },
 52 |         2725576: {
 53 |             'name': 'Party Collection JP',
 54 |             'offset': 0x1A1548,
 55 |             'num_entries': 459
 56 |         }
 57 |     }
 58 | 
 59 |     csv_fieldnames = ['id', 'offset', 'length', 'filename', 'description']
 60 | 
 61 |     def _get_table_info(self, elf_path):
 62 |         length = os.path.getsize(elf_path)
 63 |         try:
 64 |             return self.table_info[length]
 65 |         except:
 66 |             return None
 67 | 
 68 |     def _guess_filetype(self, stream, length):
 69 |         ''' Guess the filetype of a binary stream
 70 |         
 71 |         Parameters:
 72 |         stream: file stream at start of data
 73 |         length: length of data
 74 |         
 75 |         Return value:
 76 |         Dictionary with description and extension keys.
 77 |         The file pointer will be returned to its original position.
 78 |         '''
 79 | 
 80 |         if length > 4 and stream.peek(4)[:4] == b'Svag':
 81 |             return {'description': 'Konami PS2 SVAG Audio', 'extension': 'svag'}
 82 |         elif length > 4 and stream.peek(4)[:4] == b'ipum':
 83 |             return {'description': 'Sony PS2 IPU Video', 'extension': 'ipu'}
 84 |         elif length > 16 and stream.peek(16)[:16] == b'TCB\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00':
 85 |             return {'description': 'Konami TCB Image', 'extension': 'tcb'}
 86 |         elif length > 13 and stream.peek(13)[4:13] == b'FrameInfo':
 87 |             return {'description': 'MPEG2 Stream', 'extension': 'mpeg2'}
 88 |         else:
 89 |             return {'description': 'Unknown Binary Data', 'extension': 'bin'}
 90 | 
 91 |     def _print_progress(self, iteration, total):
 92 |         ''' Print progress info to stdout '''
 93 |         percent = int(round(100 * iteration/total, 0))
 94 |         bar_filled = percent // 10
 95 |         bar = '#' * bar_filled + '-' * (10 - bar_filled)
 96 |         sys.stdout.write('\r[{}] {}%'.format(bar, percent))
 97 |         sys.stdout.flush()
 98 | 
 99 |     def __init__(self, elf_path, filedata_path):
100 |         self.elf_path = elf_path
101 |         self.filedata_path = filedata_path
102 |         self.table = []
103 |         self.table_info = self._get_table_info(elf_path)
104 |         if self.table_info == None:
105 |             raise LookupError('Unknown ELF; Cannot extract filetable.')
106 |         
107 |     def load_from_elf(self):
108 |         ''' Read table contents from ELF file. '''
109 |         filedata_file = open(self.filedata_path, 'rb')
110 |         with open(self.elf_path, 'rb') as elf_file:
111 |             elf_file.seek(self.table_info['offset'], os.SEEK_SET)
112 |             for _ in range(self.table_info['num_entries']):
113 |                 data = struct.unpack('<HBBBBBB', elf_file.read(8))
114 |                 id = data[0]
115 |                 offset = int.from_bytes([data[1],data[2],data[3]], byteorder='little', signed=False) * 0x800
116 |                 length = int.from_bytes([data[4],data[5],data[6]], byteorder='little', signed=False) * 0x800
117 |                 
118 |                 filedata_file.seek(offset)
119 |                 filetype = self._guess_filetype(filedata_file, length)
120 |                 filename = '{}.{}'.format(id, filetype['extension'])
121 | 
122 |                 self.table.append({
123 |                     'id': data[0],
124 |                     'offset': offset,
125 |                     'length': length,
126 |                     'description': filetype['description'],
127 |                     'filename': filename
128 |                 })
129 | 
130 |         # Look for hidden data not referenced in the ELF.
131 |         table_sorted = list(sorted(self.table, key=lambda k: k['offset']))
132 |         for i in range(len(table_sorted) - 1):
133 |             expected_next_offset = table_sorted[i]['offset'] + table_sorted[i]['length']
134 |             if not table_sorted[i+1]['offset'] == expected_next_offset:
135 |                 print('Found hidden data at {}'.format(expected_next_offset))
136 |                 hidden_length = table_sorted[i+1]['offset'] - expected_next_offset
137 |                 filedata_file.seek(expected_next_offset)
138 |                 hidden_filetype = self._guess_filetype(filedata_file, hidden_length)
139 |                 hidden_filename = 'hidden_{}.{}'.format(expected_next_offset, hidden_filetype['extension'])
140 |                 self.table.append({
141 |                     'id': 'hidden',
142 |                     'offset': expected_next_offset,
143 |                     'length': hidden_length,
144 |                     'description': hidden_filetype['description'],
145 |                     'filename': hidden_filename
146 |                 })
147 | 
148 |         if not table_sorted[-1]['offset'] + table_sorted[-1]['length'] == os.path.getsize(self.filedata_path):
149 |             # Found hidden data at the end of filedata.bin not listed in the ELF.
150 |             print('Found hidden data at {}'.format(expected_next_offset))
151 |             hidden_length = os.path.getsize(self.filedata_path) - (table_sorted[-1]['offset'] + table_sorted[-1]['length'])
152 |             hidden_offset = os.path.getsize(self.filedata_path) - hidden_length
153 |             filedata_file.seek(hidden_offset)
154 |             hidden_filetype = self._guess_filetype(filedata_file, hidden_length)
155 |             hidden_filename = 'hidden_{}.{}'.format(hidden_offset, hidden_filetype['extension'])
156 |             self.table.append({
157 |                 'id': 'hidden',
158 |                 'offset': hidden_offset,
159 |                 'length': hidden_length,
160 |                 'description': hidden_filetype['description'],
161 |                 'filename': hidden_filename
162 |             })
163 | 
164 |     def save_to_elf(self):
165 |         ''' Update table contents in ELF file '''
166 |         table = list(filter(lambda x: not x['id'] == 'hidden', self.table))
167 |         if not self.table_info['num_entries'] == len(table):
168 |             raise Exception('ELF only supports {} entries but loaded table has {} entries.'.format(
169 |                 self.table_info['num_entries'], len(table)
170 |             ))
171 |         with open(self.elf_path, 'rb+') as elf_file:
172 |             elf_file.seek(self.table_info['offset'], os.SEEK_SET)
173 |             for row in table:
174 |                 elf_file.write(struct.pack('<H', int(row['id'])))
175 |                 elf_file.write(struct.pack('<I', int(row['offset']) >> 3)[1:])
176 |                 elf_file.write(struct.pack('<I', int(row['length']) >> 3)[1:])
177 | 
178 |     def load_from_csv(self, csv_path):
179 |         ''' Read table contents from CSV file. '''
180 |         with open(csv_path, 'r') as csv_file:
181 |             self.table = list(csv.DictReader(csv_file))
182 |             
183 |     def save_to_csv(self, csv_path):
184 |         ''' Save table contents to CSV file. '''
185 |         os.makedirs(os.path.dirname(csv_path), exist_ok=True)
186 |         with open(csv_path, 'w') as csv_file:
187 |             csv_writer = csv.DictWriter(csv_file, fieldnames=self.csv_fieldnames)
188 |             csv_writer.writeheader()
189 |             csv_writer.writerows(self.table)
190 | 
191 |     def extract(self, output_directory):
192 |         ''' Extract contents of a filedata.bin file. '''
193 |         os.makedirs(output_directory, exist_ok=True)
194 |         with open(self.filedata_path, 'rb') as filedata:
195 |             for i, row in enumerate(self.table):
196 |                 self._print_progress(i, len(self.table))
197 |                 with open(os.path.join(output_directory, row['filename']), 'wb') as out:
198 |                     filedata.seek(row['offset'], os.SEEK_SET)
199 |                     out.write(filedata.read(row['length']))
200 |         print('')
201 |     
202 |     def create(self, input_directory):
203 |         ''' Create filedata.bin file, updating the internal table if file sizes have changed. '''
204 |         sorted_indices = [i[0] for i in sorted(enumerate(self.table), key=lambda x: int(x[1]['offset']))]
205 |         with open(self.filedata_path, 'wb') as filedata:
206 |             for i in sorted_indices:
207 |                 self._print_progress(i, len(self.table))
208 |                 file_path = os.path.join(input_directory, self.table[i]['filename'])
209 |                 self.table[i]['length'] = os.path.getsize(file_path)
210 |                 self.table[i]['length'] += self.table[i]['length'] % 0x800
211 |                 with open(file_path, 'rb') as input:
212 |                     filedata.write(input.read())
213 |                     filedata.write(bytearray(self.table[i]['length'] % 0x800))
214 |         
215 |         # Update offsets to account for potentially updated lengths
216 |         offset = 0
217 |         for i in sorted_indices:
218 |             self.table[i]['offset'] = offset
219 |             offset += self.table[i]['length']
220 | 
221 |         writer = csv.DictWriter(open('filedata_sorted.csv', 'w'), fieldnames=self.csv_fieldnames)
222 |         writer.writeheader()
223 |         writer.writerows(self.table)
224 |         print('')
225 | 
226 | def print_usage(filename):
227 |     print('Usage:')
228 |     print('Extract filedata.bin using file table in ELF:')
229 |     print('    {} extract <elf> <filedata> <output directory>'.format(filename))
230 |     print('Create filedata.bin and update file table in ELF:')
231 |     print('    {} create <elf> <filedata> <input directory>'.format(filename))
232 | 
233 | if not len(argv) == 5:
234 |     print_usage(argv[0])
235 |     sys.exit()
236 | 
237 | elf_path = os.path.abspath(argv[2])
238 | filedata_path = os.path.abspath(argv[3])
239 | directory = os.path.abspath(argv[4])
240 | csv_path = os.path.join(directory, 'filedata.csv')
241 | 
242 | filedata = FileData(elf_path, filedata_path)
243 | 
244 | if argv[1] == 'extract':
245 |     filedata.load_from_elf()
246 |     filedata.save_to_csv(csv_path)
247 |     filedata.extract(directory)
248 | elif argv[1] == 'create':
249 |     filedata.load_from_csv(csv_path)
250 |     filedata.create(directory)
251 |     filedata.save_to_elf()
252 | else:
253 |     print('Unknown action \'{}\''.format(argv[1]))
254 |     exit(1)


--------------------------------------------------------------------------------
/lodepng/LICENSE:
--------------------------------------------------------------------------------
 1 | Copyright (c) 2005-2018 Lode Vandevenne
 2 | 
 3 | This software is provided 'as-is', without any express or implied
 4 | warranty. In no event will the authors be held liable for any damages
 5 | arising from the use of this software.
 6 | 
 7 | Permission is granted to anyone to use this software for any purpose,
 8 | including commercial applications, and to alter it and redistribute it
 9 | freely, subject to the following restrictions:
10 | 
11 |     1. The origin of this software must not be misrepresented; you must not
12 |     claim that you wrote the original software. If you use this software
13 |     in a product, an acknowledgment in the product documentation would be
14 |     appreciated but is not required.
15 | 
16 |     2. Altered source versions must be plainly marked as such, and must not be
17 |     misrepresented as being the original software.
18 | 
19 |     3. This notice may not be removed or altered from any source
20 |     distribution.
21 |     


--------------------------------------------------------------------------------
/pngquant/.gitignore:
--------------------------------------------------------------------------------
 1 | config.mk
 2 | imagequant.pc
 3 | *.lo
 4 | *.o
 5 | *.a
 6 | *.so.0
 7 | *.so
 8 | *.bz2
 9 | *.dylib
10 | *.dylib.0
11 | *.jnilib
12 | *.dSYM
13 | org/pngquant/*.class
14 | org/pngquant/*.h
15 | target/
16 | msvc-dist/org/
17 | msvc-dist/*.md
18 | msvc-dist/Makefile*
19 | msvc-dist/*.cs
20 | msvc-dist/*.xml
21 | msvc-dist/CHANGELOG
22 | msvc-dist/COPYRIGHT
23 | msvc-dist/configure
24 | msvc-dist/.gitignore
25 | quantized_example.png
26 | example
27 | lodepng.?
28 | 


--------------------------------------------------------------------------------
/pngquant/.travis.yml:
--------------------------------------------------------------------------------
 1 | matrix:
 2 |   include:
 3 |     - os: linux
 4 |       language: java
 5 |       jdk: oraclejdk9
 6 |       env: CFLAGS="-fPIC"
 7 |       install: true
 8 |       script: make java
 9 |     - os: linux
10 |       language: rust
11 |       script: cargo build --verbose --all && cargo test --verbose --all
12 |     - os: linux
13 |       language: generic
14 |       script: make static
15 |     - os: linux
16 |       language: generic
17 |       script: ./configure --prefix=/tmp && make libimagequant.so && make install
18 | 


--------------------------------------------------------------------------------
/pngquant/CHANGELOG:
--------------------------------------------------------------------------------
 1 | version 2.12
 2 | ------------
 3 |  - new liq_histogram_add_fixed_color()
 4 |  - faster for large/complex images
 5 |  - workarounds for Microsoft's outdated C compiler
 6 | 
 7 | version 2.11
 8 | ------------
 9 |  - new liq_image_set_background() for high-quality remapping of GIF frames
10 |  - new liq_image_set_importance_map() for controlling which parts of the image get more palette colors
11 |  - improved OpenMP support
12 | 
13 | version 2.10
14 | -----------
15 |  - supports building with Rust/Cargo
16 | 
17 | version 2.9
18 | -----------
19 |  - new liq_histogram_add_colors()
20 | 
21 | version 2.8
22 | -----------
23 |  - standalone version
24 |  - added Java interface (JNI)
25 |  - new API for remapping multiple images to a single shared palette
26 | 
27 | version 2.7
28 | -----------
29 |  - improved dithering of saturated and semitransparent colors
30 |  - libimagequant reports detailed progress and supports aborting of operations via callbacks
31 |  - fixed order of log output when using openmp
32 | 
33 | version 2.5
34 | -----------
35 |  - replaced color search algorithm with vantage point tree, which is much faster and more reliable
36 |  - deprecated IE6 workaround
37 |  - warn when compiled without color profile support
38 |  - improved support for predefined colors in libimagequant
39 | 
40 | version 2.4
41 | -----------
42 |  - fixed remapping of bright colors when dithering
43 |  - added libimagequant API to add fixed preset colors to the palette
44 | 
45 | version 2.3
46 | -----------
47 |  - added ./configure script for better support of Intel C compiler and dependencies [thanks to pdknsk]
48 |  - tweaked quality metric to better estimate quality of images with large solid backgrounds [thanks to Rolf Timmermans]
49 |  - avoid applying quality setting to images that use palette already
50 | 
51 | version 2.2
52 | -----------
53 |  - OpenMP acceleration
54 |  - improved support for Intel C Compiler, speedup in 32-bit GCC, and some workarounds for Visual Studio's incomplete C support
55 | 
56 | version 2.1
57 | -----------
58 |  - option to generate posterized output (for use with 16-bit textures)
59 | 
60 | version 2.0
61 | -----------
62 |  - refactored codebase into pngquant and standalone libimagequant
63 |  - reduced memory usage by further 30% (and more for very large images)
64 |  - less precise remapping improving speed by 25% in higher speed settings
65 |  - fixed regression in dithering of alpha channel
66 | 


--------------------------------------------------------------------------------
/pngquant/CODE_OF_CONDUCT.md:
--------------------------------------------------------------------------------
 1 | # Contributor Covenant Code of Conduct
 2 | 
 3 | ## Our Pledge
 4 | 
 5 | In the interest of fostering an open and welcoming environment, we as
 6 | contributors and maintainers pledge to making participation in our project and
 7 | our community a harassment-free experience for everyone, regardless of age, body
 8 | size, disability, ethnicity, gender identity and expression, level of experience,
 9 | nationality, personal appearance, race, religion, or sexual identity and
10 | orientation.
11 | 
12 | ## Our Standards
13 | 
14 | Examples of behavior that contributes to creating a positive environment
15 | include:
16 | 
17 | * Using welcoming and inclusive language
18 | * Being respectful of differing viewpoints and experiences
19 | * Gracefully accepting constructive criticism
20 | * Focusing on what is best for the community
21 | * Showing empathy towards other community members
22 | 
23 | Examples of unacceptable behavior by participants include:
24 | 
25 | * The use of sexualized language or imagery and unwelcome sexual attention or
26 | advances
27 | * Trolling, insulting/derogatory comments, and personal or political attacks
28 | * Public or private harassment
29 | * Publishing others' private information, such as a physical or electronic
30 |   address, without explicit permission
31 | * Other conduct which could reasonably be considered inappropriate in a
32 |   professional setting
33 | 
34 | ## Our Responsibilities
35 | 
36 | Project maintainers are responsible for clarifying the standards of acceptable
37 | behavior and are expected to take appropriate and fair corrective action in
38 | response to any instances of unacceptable behavior.
39 | 
40 | Project maintainers have the right and responsibility to remove, edit, or
41 | reject comments, commits, code, wiki edits, issues, and other contributions
42 | that are not aligned to this Code of Conduct, or to ban temporarily or
43 | permanently any contributor for other behaviors that they deem inappropriate,
44 | threatening, offensive, or harmful.
45 | 
46 | ## Scope
47 | 
48 | This Code of Conduct applies both within project spaces and in public spaces
49 | when an individual is representing the project or its community. Examples of
50 | representing a project or community include using an official project e-mail
51 | address, posting via an official social media account, or acting as an appointed
52 | representative at an online or offline event. Representation of a project may be
53 | further defined and clarified by project maintainers.
54 | 
55 | ## Enforcement
56 | 
57 | Instances of abusive, harassing, or otherwise unacceptable behavior may be
58 | reported by contacting the project team at kornel@geekhood.net. All
59 | complaints will be reviewed and investigated and will result in a response that
60 | is deemed necessary and appropriate to the circumstances. The project team is
61 | obligated to maintain confidentiality with regard to the reporter of an incident.
62 | Further details of specific enforcement policies may be posted separately.
63 | 
64 | Project maintainers who do not follow or enforce the Code of Conduct in good
65 | faith may face temporary or permanent repercussions as determined by other
66 | members of the project's leadership.
67 | 
68 | ## Attribution
69 | 
70 | This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,
71 | available at [http://contributor-covenant.org/version/1/4][version]
72 | 
73 | [homepage]: http://contributor-covenant.org
74 | [version]: http://contributor-covenant.org/version/1/4/
75 | 


--------------------------------------------------------------------------------
/pngquant/CONTRIBUTING.md:
--------------------------------------------------------------------------------
 1 | 
 2 | Thank you for contributing! pngquant and libimagequant are licensed under multiple
 3 | licenses, so to make things clear, I'm accepting contributions as licensed under
 4 | the BSD 2-clause license:
 5 | 
 6 |    Redistribution and use in source and binary forms, with or without modification,
 7 |    are permitted provided that the following conditions are met:
 8 | 
 9 |    1. Redistributions of source code must retain the above copyright notice,
10 |       this list of conditions and the following disclaimer.
11 | 
12 |    2. Redistributions in binary form must reproduce the above copyright notice,
13 |       this list of conditions and the following disclaimer in the documentation
14 |       and/or other materials provided with the distribution.
15 | 
16 |    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
17 |    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 |    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
19 |    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
20 |    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 |    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
22 |    SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
23 |    CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
24 |    OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
25 |    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 | 
27 | 


--------------------------------------------------------------------------------
/pngquant/COPYRIGHT:
--------------------------------------------------------------------------------
  1 | 
  2 | libimagequant is derived from code by Jef Poskanzer and Greg Roelofs
  3 | licensed under pngquant's original license (at the end of this file),
  4 | and contains extensive changes and additions by Kornel Lesiński
  5 | licensed under GPL v3 or later.
  6 | 
  7 | - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
  8 | 
  9 | libimagequant © 2009-2018 by Kornel Lesiński.
 10 | 
 11 |                     GNU GENERAL PUBLIC LICENSE
 12 |                        Version 3, 29 June 2007
 13 | 
 14 |  Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
 15 |  Everyone is permitted to copy and distribute verbatim copies
 16 |  of this license document, but changing it is not allowed.
 17 | 
 18 |                             Preamble
 19 | 
 20 |   The GNU General Public License is a free, copyleft license for
 21 | software and other kinds of works.
 22 | 
 23 |   The licenses for most software and other practical works are designed
 24 | to take away your freedom to share and change the works.  By contrast,
 25 | the GNU General Public License is intended to guarantee your freedom to
 26 | share and change all versions of a program--to make sure it remains free
 27 | software for all its users.  We, the Free Software Foundation, use the
 28 | GNU General Public License for most of our software; it applies also to
 29 | any other work released this way by its authors.  You can apply it to
 30 | your programs, too.
 31 | 
 32 |   When we speak of free software, we are referring to freedom, not
 33 | price.  Our General Public Licenses are designed to make sure that you
 34 | have the freedom to distribute copies of free software (and charge for
 35 | them if you wish), that you receive source code or can get it if you
 36 | want it, that you can change the software or use pieces of it in new
 37 | free programs, and that you know you can do these things.
 38 | 
 39 |   To protect your rights, we need to prevent others from denying you
 40 | these rights or asking you to surrender the rights.  Therefore, you have
 41 | certain responsibilities if you distribute copies of the software, or if
 42 | you modify it: responsibilities to respect the freedom of others.
 43 | 
 44 |   For example, if you distribute copies of such a program, whether
 45 | gratis or for a fee, you must pass on to the recipients the same
 46 | freedoms that you received.  You must make sure that they, too, receive
 47 | or can get the source code.  And you must show them these terms so they
 48 | know their rights.
 49 | 
 50 |   Developers that use the GNU GPL protect your rights with two steps:
 51 | (1) assert copyright on the software, and (2) offer you this License
 52 | giving you legal permission to copy, distribute and/or modify it.
 53 | 
 54 |   For the developers' and authors' protection, the GPL clearly explains
 55 | that there is no warranty for this free software.  For both users' and
 56 | authors' sake, the GPL requires that modified versions be marked as
 57 | changed, so that their problems will not be attributed erroneously to
 58 | authors of previous versions.
 59 | 
 60 |   Some devices are designed to deny users access to install or run
 61 | modified versions of the software inside them, although the manufacturer
 62 | can do so.  This is fundamentally incompatible with the aim of
 63 | protecting users' freedom to change the software.  The systematic
 64 | pattern of such abuse occurs in the area of products for individuals to
 65 | use, which is precisely where it is most unacceptable.  Therefore, we
 66 | have designed this version of the GPL to prohibit the practice for those
 67 | products.  If such problems arise substantially in other domains, we
 68 | stand ready to extend this provision to those domains in future versions
 69 | of the GPL, as needed to protect the freedom of users.
 70 | 
 71 |   Finally, every program is threatened constantly by software patents.
 72 | States should not allow patents to restrict development and use of
 73 | software on general-purpose computers, but in those that do, we wish to
 74 | avoid the special danger that patents applied to a free program could
 75 | make it effectively proprietary.  To prevent this, the GPL assures that
 76 | patents cannot be used to render the program non-free.
 77 | 
 78 |   The precise terms and conditions for copying, distribution and
 79 | modification follow.
 80 | 
 81 |                        TERMS AND CONDITIONS
 82 | 
 83 |   0. Definitions.
 84 | 
 85 |   "This License" refers to version 3 of the GNU General Public License.
 86 | 
 87 |   "Copyright" also means copyright-like laws that apply to other kinds of
 88 | works, such as semiconductor masks.
 89 | 
 90 |   "The Program" refers to any copyrightable work licensed under this
 91 | License.  Each licensee is addressed as "you".  "Licensees" and
 92 | "recipients" may be individuals or organizations.
 93 | 
 94 |   To "modify" a work means to copy from or adapt all or part of the work
 95 | in a fashion requiring copyright permission, other than the making of an
 96 | exact copy.  The resulting work is called a "modified version" of the
 97 | earlier work or a work "based on" the earlier work.
 98 | 
 99 |   A "covered work" means either the unmodified Program or a work based
100 | on the Program.
101 | 
102 |   To "propagate" a work means to do anything with it that, without
103 | permission, would make you directly or secondarily liable for
104 | infringement under applicable copyright law, except executing it on a
105 | computer or modifying a private copy.  Propagation includes copying,
106 | distribution (with or without modification), making available to the
107 | public, and in some countries other activities as well.
108 | 
109 |   To "convey" a work means any kind of propagation that enables other
110 | parties to make or receive copies.  Mere interaction with a user through
111 | a computer network, with no transfer of a copy, is not conveying.
112 | 
113 |   An interactive user interface displays "Appropriate Legal Notices"
114 | to the extent that it includes a convenient and prominently visible
115 | feature that (1) displays an appropriate copyright notice, and (2)
116 | tells the user that there is no warranty for the work (except to the
117 | extent that warranties are provided), that licensees may convey the
118 | work under this License, and how to view a copy of this License.  If
119 | the interface presents a list of user commands or options, such as a
120 | menu, a prominent item in the list meets this criterion.
121 | 
122 |   1. Source Code.
123 | 
124 |   The "source code" for a work means the preferred form of the work
125 | for making modifications to it.  "Object code" means any non-source
126 | form of a work.
127 | 
128 |   A "Standard Interface" means an interface that either is an official
129 | standard defined by a recognized standards body, or, in the case of
130 | interfaces specified for a particular programming language, one that
131 | is widely used among developers working in that language.
132 | 
133 |   The "System Libraries" of an executable work include anything, other
134 | than the work as a whole, that (a) is included in the normal form of
135 | packaging a Major Component, but which is not part of that Major
136 | Component, and (b) serves only to enable use of the work with that
137 | Major Component, or to implement a Standard Interface for which an
138 | implementation is available to the public in source code form.  A
139 | "Major Component", in this context, means a major essential component
140 | (kernel, window system, and so on) of the specific operating system
141 | (if any) on which the executable work runs, or a compiler used to
142 | produce the work, or an object code interpreter used to run it.
143 | 
144 |   The "Corresponding Source" for a work in object code form means all
145 | the source code needed to generate, install, and (for an executable
146 | work) run the object code and to modify the work, including scripts to
147 | control those activities.  However, it does not include the work's
148 | System Libraries, or general-purpose tools or generally available free
149 | programs which are used unmodified in performing those activities but
150 | which are not part of the work.  For example, Corresponding Source
151 | includes interface definition files associated with source files for
152 | the work, and the source code for shared libraries and dynamically
153 | linked subprograms that the work is specifically designed to require,
154 | such as by intimate data communication or control flow between those
155 | subprograms and other parts of the work.
156 | 
157 |   The Corresponding Source need not include anything that users
158 | can regenerate automatically from other parts of the Corresponding
159 | Source.
160 | 
161 |   The Corresponding Source for a work in source code form is that
162 | same work.
163 | 
164 |   2. Basic Permissions.
165 | 
166 |   All rights granted under this License are granted for the term of
167 | copyright on the Program, and are irrevocable provided the stated
168 | conditions are met.  This License explicitly affirms your unlimited
169 | permission to run the unmodified Program.  The output from running a
170 | covered work is covered by this License only if the output, given its
171 | content, constitutes a covered work.  This License acknowledges your
172 | rights of fair use or other equivalent, as provided by copyright law.
173 | 
174 |   You may make, run and propagate covered works that you do not
175 | convey, without conditions so long as your license otherwise remains
176 | in force.  You may convey covered works to others for the sole purpose
177 | of having them make modifications exclusively for you, or provide you
178 | with facilities for running those works, provided that you comply with
179 | the terms of this License in conveying all material for which you do
180 | not control copyright.  Those thus making or running the covered works
181 | for you must do so exclusively on your behalf, under your direction
182 | and control, on terms that prohibit them from making any copies of
183 | your copyrighted material outside their relationship with you.
184 | 
185 |   Conveying under any other circumstances is permitted solely under
186 | the conditions stated below.  Sublicensing is not allowed; section 10
187 | makes it unnecessary.
188 | 
189 |   3. Protecting Users' Legal Rights From Anti-Circumvention Law.
190 | 
191 |   No covered work shall be deemed part of an effective technological
192 | measure under any applicable law fulfilling obligations under article
193 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
194 | similar laws prohibiting or restricting circumvention of such
195 | measures.
196 | 
197 |   When you convey a covered work, you waive any legal power to forbid
198 | circumvention of technological measures to the extent such circumvention
199 | is effected by exercising rights under this License with respect to
200 | the covered work, and you disclaim any intention to limit operation or
201 | modification of the work as a means of enforcing, against the work's
202 | users, your or third parties' legal rights to forbid circumvention of
203 | technological measures.
204 | 
205 |   4. Conveying Verbatim Copies.
206 | 
207 |   You may convey verbatim copies of the Program's source code as you
208 | receive it, in any medium, provided that you conspicuously and
209 | appropriately publish on each copy an appropriate copyright notice;
210 | keep intact all notices stating that this License and any
211 | non-permissive terms added in accord with section 7 apply to the code;
212 | keep intact all notices of the absence of any warranty; and give all
213 | recipients a copy of this License along with the Program.
214 | 
215 |   You may charge any price or no price for each copy that you convey,
216 | and you may offer support or warranty protection for a fee.
217 | 
218 |   5. Conveying Modified Source Versions.
219 | 
220 |   You may convey a work based on the Program, or the modifications to
221 | produce it from the Program, in the form of source code under the
222 | terms of section 4, provided that you also meet all of these conditions:
223 | 
224 |     a) The work must carry prominent notices stating that you modified
225 |     it, and giving a relevant date.
226 | 
227 |     b) The work must carry prominent notices stating that it is
228 |     released under this License and any conditions added under section
229 |     7.  This requirement modifies the requirement in section 4 to
230 |     "keep intact all notices".
231 | 
232 |     c) You must license the entire work, as a whole, under this
233 |     License to anyone who comes into possession of a copy.  This
234 |     License will therefore apply, along with any applicable section 7
235 |     additional terms, to the whole of the work, and all its parts,
236 |     regardless of how they are packaged.  This License gives no
237 |     permission to license the work in any other way, but it does not
238 |     invalidate such permission if you have separately received it.
239 | 
240 |     d) If the work has interactive user interfaces, each must display
241 |     Appropriate Legal Notices; however, if the Program has interactive
242 |     interfaces that do not display Appropriate Legal Notices, your
243 |     work need not make them do so.
244 | 
245 |   A compilation of a covered work with other separate and independent
246 | works, which are not by their nature extensions of the covered work,
247 | and which are not combined with it such as to form a larger program,
248 | in or on a volume of a storage or distribution medium, is called an
249 | "aggregate" if the compilation and its resulting copyright are not
250 | used to limit the access or legal rights of the compilation's users
251 | beyond what the individual works permit.  Inclusion of a covered work
252 | in an aggregate does not cause this License to apply to the other
253 | parts of the aggregate.
254 | 
255 |   6. Conveying Non-Source Forms.
256 | 
257 |   You may convey a covered work in object code form under the terms
258 | of sections 4 and 5, provided that you also convey the
259 | machine-readable Corresponding Source under the terms of this License,
260 | in one of these ways:
261 | 
262 |     a) Convey the object code in, or embodied in, a physical product
263 |     (including a physical distribution medium), accompanied by the
264 |     Corresponding Source fixed on a durable physical medium
265 |     customarily used for software interchange.
266 | 
267 |     b) Convey the object code in, or embodied in, a physical product
268 |     (including a physical distribution medium), accompanied by a
269 |     written offer, valid for at least three years and valid for as
270 |     long as you offer spare parts or customer support for that product
271 |     model, to give anyone who possesses the object code either (1) a
272 |     copy of the Corresponding Source for all the software in the
273 |     product that is covered by this License, on a durable physical
274 |     medium customarily used for software interchange, for a price no
275 |     more than your reasonable cost of physically performing this
276 |     conveying of source, or (2) access to copy the
277 |     Corresponding Source from a network server at no charge.
278 | 
279 |     c) Convey individual copies of the object code with a copy of the
280 |     written offer to provide the Corresponding Source.  This
281 |     alternative is allowed only occasionally and noncommercially, and
282 |     only if you received the object code with such an offer, in accord
283 |     with subsection 6b.
284 | 
285 |     d) Convey the object code by offering access from a designated
286 |     place (gratis or for a charge), and offer equivalent access to the
287 |     Corresponding Source in the same way through the same place at no
288 |     further charge.  You need not require recipients to copy the
289 |     Corresponding Source along with the object code.  If the place to
290 |     copy the object code is a network server, the Corresponding Source
291 |     may be on a different server (operated by you or a third party)
292 |     that supports equivalent copying facilities, provided you maintain
293 |     clear directions next to the object code saying where to find the
294 |     Corresponding Source.  Regardless of what server hosts the
295 |     Corresponding Source, you remain obligated to ensure that it is
296 |     available for as long as needed to satisfy these requirements.
297 | 
298 |     e) Convey the object code using peer-to-peer transmission, provided
299 |     you inform other peers where the object code and Corresponding
300 |     Source of the work are being offered to the general public at no
301 |     charge under subsection 6d.
302 | 
303 |   A separable portion of the object code, whose source code is excluded
304 | from the Corresponding Source as a System Library, need not be
305 | included in conveying the object code work.
306 | 
307 |   A "User Product" is either (1) a "consumer product", which means any
308 | tangible personal property which is normally used for personal, family,
309 | or household purposes, or (2) anything designed or sold for incorporation
310 | into a dwelling.  In determining whether a product is a consumer product,
311 | doubtful cases shall be resolved in favor of coverage.  For a particular
312 | product received by a particular user, "normally used" refers to a
313 | typical or common use of that class of product, regardless of the status
314 | of the particular user or of the way in which the particular user
315 | actually uses, or expects or is expected to use, the product.  A product
316 | is a consumer product regardless of whether the product has substantial
317 | commercial, industrial or non-consumer uses, unless such uses represent
318 | the only significant mode of use of the product.
319 | 
320 |   "Installation Information" for a User Product means any methods,
321 | procedures, authorization keys, or other information required to install
322 | and execute modified versions of a covered work in that User Product from
323 | a modified version of its Corresponding Source.  The information must
324 | suffice to ensure that the continued functioning of the modified object
325 | code is in no case prevented or interfered with solely because
326 | modification has been made.
327 | 
328 |   If you convey an object code work under this section in, or with, or
329 | specifically for use in, a User Product, and the conveying occurs as
330 | part of a transaction in which the right of possession and use of the
331 | User Product is transferred to the recipient in perpetuity or for a
332 | fixed term (regardless of how the transaction is characterized), the
333 | Corresponding Source conveyed under this section must be accompanied
334 | by the Installation Information.  But this requirement does not apply
335 | if neither you nor any third party retains the ability to install
336 | modified object code on the User Product (for example, the work has
337 | been installed in ROM).
338 | 
339 |   The requirement to provide Installation Information does not include a
340 | requirement to continue to provide support service, warranty, or updates
341 | for a work that has been modified or installed by the recipient, or for
342 | the User Product in which it has been modified or installed.  Access to a
343 | network may be denied when the modification itself materially and
344 | adversely affects the operation of the network or violates the rules and
345 | protocols for communication across the network.
346 | 
347 |   Corresponding Source conveyed, and Installation Information provided,
348 | in accord with this section must be in a format that is publicly
349 | documented (and with an implementation available to the public in
350 | source code form), and must require no special password or key for
351 | unpacking, reading or copying.
352 | 
353 |   7. Additional Terms.
354 | 
355 |   "Additional permissions" are terms that supplement the terms of this
356 | License by making exceptions from one or more of its conditions.
357 | Additional permissions that are applicable to the entire Program shall
358 | be treated as though they were included in this License, to the extent
359 | that they are valid under applicable law.  If additional permissions
360 | apply only to part of the Program, that part may be used separately
361 | under those permissions, but the entire Program remains governed by
362 | this License without regard to the additional permissions.
363 | 
364 |   When you convey a copy of a covered work, you may at your option
365 | remove any additional permissions from that copy, or from any part of
366 | it.  (Additional permissions may be written to require their own
367 | removal in certain cases when you modify the work.)  You may place
368 | additional permissions on material, added by you to a covered work,
369 | for which you have or can give appropriate copyright permission.
370 | 
371 |   Notwithstanding any other provision of this License, for material you
372 | add to a covered work, you may (if authorized by the copyright holders of
373 | that material) supplement the terms of this License with terms:
374 | 
375 |     a) Disclaiming warranty or limiting liability differently from the
376 |     terms of sections 15 and 16 of this License; or
377 | 
378 |     b) Requiring preservation of specified reasonable legal notices or
379 |     author attributions in that material or in the Appropriate Legal
380 |     Notices displayed by works containing it; or
381 | 
382 |     c) Prohibiting misrepresentation of the origin of that material, or
383 |     requiring that modified versions of such material be marked in
384 |     reasonable ways as different from the original version; or
385 | 
386 |     d) Limiting the use for publicity purposes of names of licensors or
387 |     authors of the material; or
388 | 
389 |     e) Declining to grant rights under trademark law for use of some
390 |     trade names, trademarks, or service marks; or
391 | 
392 |     f) Requiring indemnification of licensors and authors of that
393 |     material by anyone who conveys the material (or modified versions of
394 |     it) with contractual assumptions of liability to the recipient, for
395 |     any liability that these contractual assumptions directly impose on
396 |     those licensors and authors.
397 | 
398 |   All other non-permissive additional terms are considered "further
399 | restrictions" within the meaning of section 10.  If the Program as you
400 | received it, or any part of it, contains a notice stating that it is
401 | governed by this License along with a term that is a further
402 | restriction, you may remove that term.  If a license document contains
403 | a further restriction but permits relicensing or conveying under this
404 | License, you may add to a covered work material governed by the terms
405 | of that license document, provided that the further restriction does
406 | not survive such relicensing or conveying.
407 | 
408 |   If you add terms to a covered work in accord with this section, you
409 | must place, in the relevant source files, a statement of the
410 | additional terms that apply to those files, or a notice indicating
411 | where to find the applicable terms.
412 | 
413 |   Additional terms, permissive or non-permissive, may be stated in the
414 | form of a separately written license, or stated as exceptions;
415 | the above requirements apply either way.
416 | 
417 |   8. Termination.
418 | 
419 |   You may not propagate or modify a covered work except as expressly
420 | provided under this License.  Any attempt otherwise to propagate or
421 | modify it is void, and will automatically terminate your rights under
422 | this License (including any patent licenses granted under the third
423 | paragraph of section 11).
424 | 
425 |   However, if you cease all violation of this License, then your
426 | license from a particular copyright holder is reinstated (a)
427 | provisionally, unless and until the copyright holder explicitly and
428 | finally terminates your license, and (b) permanently, if the copyright
429 | holder fails to notify you of the violation by some reasonable means
430 | prior to 60 days after the cessation.
431 | 
432 |   Moreover, your license from a particular copyright holder is
433 | reinstated permanently if the copyright holder notifies you of the
434 | violation by some reasonable means, this is the first time you have
435 | received notice of violation of this License (for any work) from that
436 | copyright holder, and you cure the violation prior to 30 days after
437 | your receipt of the notice.
438 | 
439 |   Termination of your rights under this section does not terminate the
440 | licenses of parties who have received copies or rights from you under
441 | this License.  If your rights have been terminated and not permanently
442 | reinstated, you do not qualify to receive new licenses for the same
443 | material under section 10.
444 | 
445 |   9. Acceptance Not Required for Having Copies.
446 | 
447 |   You are not required to accept this License in order to receive or
448 | run a copy of the Program.  Ancillary propagation of a covered work
449 | occurring solely as a consequence of using peer-to-peer transmission
450 | to receive a copy likewise does not require acceptance.  However,
451 | nothing other than this License grants you permission to propagate or
452 | modify any covered work.  These actions infringe copyright if you do
453 | not accept this License.  Therefore, by modifying or propagating a
454 | covered work, you indicate your acceptance of this License to do so.
455 | 
456 |   10. Automatic Licensing of Downstream Recipients.
457 | 
458 |   Each time you convey a covered work, the recipient automatically
459 | receives a license from the original licensors, to run, modify and
460 | propagate that work, subject to this License.  You are not responsible
461 | for enforcing compliance by third parties with this License.
462 | 
463 |   An "entity transaction" is a transaction transferring control of an
464 | organization, or substantially all assets of one, or subdividing an
465 | organization, or merging organizations.  If propagation of a covered
466 | work results from an entity transaction, each party to that
467 | transaction who receives a copy of the work also receives whatever
468 | licenses to the work the party's predecessor in interest had or could
469 | give under the previous paragraph, plus a right to possession of the
470 | Corresponding Source of the work from the predecessor in interest, if
471 | the predecessor has it or can get it with reasonable efforts.
472 | 
473 |   You may not impose any further restrictions on the exercise of the
474 | rights granted or affirmed under this License.  For example, you may
475 | not impose a license fee, royalty, or other charge for exercise of
476 | rights granted under this License, and you may not initiate litigation
477 | (including a cross-claim or counterclaim in a lawsuit) alleging that
478 | any patent claim is infringed by making, using, selling, offering for
479 | sale, or importing the Program or any portion of it.
480 | 
481 |   11. Patents.
482 | 
483 |   A "contributor" is a copyright holder who authorizes use under this
484 | License of the Program or a work on which the Program is based.  The
485 | work thus licensed is called the contributor's "contributor version".
486 | 
487 |   A contributor's "essential patent claims" are all patent claims
488 | owned or controlled by the contributor, whether already acquired or
489 | hereafter acquired, that would be infringed by some manner, permitted
490 | by this License, of making, using, or selling its contributor version,
491 | but do not include claims that would be infringed only as a
492 | consequence of further modification of the contributor version.  For
493 | purposes of this definition, "control" includes the right to grant
494 | patent sublicenses in a manner consistent with the requirements of
495 | this License.
496 | 
497 |   Each contributor grants you a non-exclusive, worldwide, royalty-free
498 | patent license under the contributor's essential patent claims, to
499 | make, use, sell, offer for sale, import and otherwise run, modify and
500 | propagate the contents of its contributor version.
501 | 
502 |   In the following three paragraphs, a "patent license" is any express
503 | agreement or commitment, however denominated, not to enforce a patent
504 | (such as an express permission to practice a patent or covenant not to
505 | sue for patent infringement).  To "grant" such a patent license to a
506 | party means to make such an agreement or commitment not to enforce a
507 | patent against the party.
508 | 
509 |   If you convey a covered work, knowingly relying on a patent license,
510 | and the Corresponding Source of the work is not available for anyone
511 | to copy, free of charge and under the terms of this License, through a
512 | publicly available network server or other readily accessible means,
513 | then you must either (1) cause the Corresponding Source to be so
514 | available, or (2) arrange to deprive yourself of the benefit of the
515 | patent license for this particular work, or (3) arrange, in a manner
516 | consistent with the requirements of this License, to extend the patent
517 | license to downstream recipients.  "Knowingly relying" means you have
518 | actual knowledge that, but for the patent license, your conveying the
519 | covered work in a country, or your recipient's use of the covered work
520 | in a country, would infringe one or more identifiable patents in that
521 | country that you have reason to believe are valid.
522 | 
523 |   If, pursuant to or in connection with a single transaction or
524 | arrangement, you convey, or propagate by procuring conveyance of, a
525 | covered work, and grant a patent license to some of the parties
526 | receiving the covered work authorizing them to use, propagate, modify
527 | or convey a specific copy of the covered work, then the patent license
528 | you grant is automatically extended to all recipients of the covered
529 | work and works based on it.
530 | 
531 |   A patent license is "discriminatory" if it does not include within
532 | the scope of its coverage, prohibits the exercise of, or is
533 | conditioned on the non-exercise of one or more of the rights that are
534 | specifically granted under this License.  You may not convey a covered
535 | work if you are a party to an arrangement with a third party that is
536 | in the business of distributing software, under which you make payment
537 | to the third party based on the extent of your activity of conveying
538 | the work, and under which the third party grants, to any of the
539 | parties who would receive the covered work from you, a discriminatory
540 | patent license (a) in connection with copies of the covered work
541 | conveyed by you (or copies made from those copies), or (b) primarily
542 | for and in connection with specific products or compilations that
543 | contain the covered work, unless you entered into that arrangement,
544 | or that patent license was granted, prior to 28 March 2007.
545 | 
546 |   Nothing in this License shall be construed as excluding or limiting
547 | any implied license or other defenses to infringement that may
548 | otherwise be available to you under applicable patent law.
549 | 
550 |   12. No Surrender of Others' Freedom.
551 | 
552 |   If conditions are imposed on you (whether by court order, agreement or
553 | otherwise) that contradict the conditions of this License, they do not
554 | excuse you from the conditions of this License.  If you cannot convey a
555 | covered work so as to satisfy simultaneously your obligations under this
556 | License and any other pertinent obligations, then as a consequence you may
557 | not convey it at all.  For example, if you agree to terms that obligate you
558 | to collect a royalty for further conveying from those to whom you convey
559 | the Program, the only way you could satisfy both those terms and this
560 | License would be to refrain entirely from conveying the Program.
561 | 
562 |   13. Use with the GNU Affero General Public License.
563 | 
564 |   Notwithstanding any other provision of this License, you have
565 | permission to link or combine any covered work with a work licensed
566 | under version 3 of the GNU Affero General Public License into a single
567 | combined work, and to convey the resulting work.  The terms of this
568 | License will continue to apply to the part which is the covered work,
569 | but the special requirements of the GNU Affero General Public License,
570 | section 13, concerning interaction through a network will apply to the
571 | combination as such.
572 | 
573 |   14. Revised Versions of this License.
574 | 
575 |   The Free Software Foundation may publish revised and/or new versions of
576 | the GNU General Public License from time to time.  Such new versions will
577 | be similar in spirit to the present version, but may differ in detail to
578 | address new problems or concerns.
579 | 
580 |   Each version is given a distinguishing version number.  If the
581 | Program specifies that a certain numbered version of the GNU General
582 | Public License "or any later version" applies to it, you have the
583 | option of following the terms and conditions either of that numbered
584 | version or of any later version published by the Free Software
585 | Foundation.  If the Program does not specify a version number of the
586 | GNU General Public License, you may choose any version ever published
587 | by the Free Software Foundation.
588 | 
589 |   If the Program specifies that a proxy can decide which future
590 | versions of the GNU General Public License can be used, that proxy's
591 | public statement of acceptance of a version permanently authorizes you
592 | to choose that version for the Program.
593 | 
594 |   Later license versions may give you additional or different
595 | permissions.  However, no additional obligations are imposed on any
596 | author or copyright holder as a result of your choosing to follow a
597 | later version.
598 | 
599 |   15. Disclaimer of Warranty.
600 | 
601 |   THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
602 | APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
603 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
604 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
605 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
606 | PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
607 | IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
608 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
609 | 
610 |   16. Limitation of Liability.
611 | 
612 |   IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
613 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
614 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
615 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
616 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
617 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
618 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
619 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
620 | SUCH DAMAGES.
621 | 
622 |   17. Interpretation of Sections 15 and 16.
623 | 
624 |   If the disclaimer of warranty and limitation of liability provided
625 | above cannot be given local legal effect according to their terms,
626 | reviewing courts shall apply local law that most closely approximates
627 | an absolute waiver of all civil liability in connection with the
628 | Program, unless a warranty or assumption of liability accompanies a
629 | copy of the Program in return for a fee.
630 | 
631 | - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
632 | 
633 | © 1989, 1991 by Jef Poskanzer.
634 | © 1997, 2000, 2002 by Greg Roelofs.
635 | 
636 | Permission to use, copy, modify, and distribute this software and its
637 | documentation for any purpose and without fee is hereby granted, provided
638 | that the above copyright notice appear in all copies and that both that
639 | copyright notice and this permission notice appear in supporting
640 | documentation.  This software is provided "as is" without express or
641 | implied warranty.
642 | 


--------------------------------------------------------------------------------
/pngquant/Cargo.toml:
--------------------------------------------------------------------------------
 1 | # libimagequant is a pure C library.
 2 | # Rust/Cargo is entirely optional. You can also use ./configure && make
 3 | [package]
 4 | version = "2.12.5"
 5 | authors = ["Kornel Lesiński <kornel@pngquant.org>"]
 6 | build = "rust/build.rs"
 7 | categories = ["external-ffi-bindings"]
 8 | homepage = "https://pngquant.org/lib"
 9 | include = ["COPYRIGHT", "rust/*", "*.c", "*.h", "README.md", "Cargo.toml"]
10 | keywords = ["pngquant"]
11 | license = "GPL-3.0+"
12 | links = "imagequant"
13 | name = "imagequant-sys"
14 | readme = "README.md"
15 | repository = "https://github.com/ImageOptim/libimagequant"
16 | description = "Statically linked C part of imagequant library powering tools such as pngquant.\n\nThis library is dual-licensed like pngquant: either GPL or a commercial license. See website for details: https://pngquant.org"
17 | edition = "2018"
18 | 
19 | [build-dependencies]
20 | cc = "1.0.38"
21 | 
22 | [dependencies]
23 | rgb = "0.8.13"
24 | 
25 | [dependencies.openmp-sys]
26 | optional = true
27 | version = "0.1.5"
28 | 
29 | [features]
30 | default = ["sse"]
31 | openmp = ["openmp-sys"]
32 | openmp-static = ["openmp", "openmp-sys/static"]
33 | sse = []
34 | 
35 | [lib]
36 | crate-type = ["cdylib", "staticlib", "lib"]
37 | name = "imagequant_sys"
38 | path = "rust/libimagequant.rs"
39 | doctest = false
40 | 


--------------------------------------------------------------------------------
/pngquant/Makefile:
--------------------------------------------------------------------------------
  1 | -include config.mk
  2 | 
  3 | STATICLIB=libimagequant.a
  4 | SHAREDLIB=libimagequant.$(SOLIBSUFFIX)
  5 | SOVER=0
  6 | ifeq ($(SOLIBSUFFIX),dylib)
  7 | 	SHAREDLIBVER=libimagequant.$(SOVER).$(SOLIBSUFFIX)
  8 | 	FIX_INSTALL_NAME=install_name_tool -id $(LIBDIR)/$(SHAREDLIBVER) $(DESTDIR)$(LIBDIR)/$(SHAREDLIBVER)
  9 | else
 10 | 	SHAREDLIBVER=libimagequant.$(SOLIBSUFFIX).$(SOVER)
 11 | 	FIX_INSTALL_NAME=
 12 | endif
 13 | 
 14 | JNILIB=libimagequant.jnilib
 15 | DLL=imagequant.dll
 16 | DLLIMP=imagequant_dll.a
 17 | DLLDEF=imagequant_dll.def
 18 | JNIDLL=libimagequant.dll
 19 | JNIDLLIMP=libimagequant_dll.a
 20 | JNIDLLDEF=libimagequant_dll.def
 21 | 
 22 | OBJS = pam.o mediancut.o blur.o mempool.o kmeans.o nearest.o libimagequant.o
 23 | SHAREDOBJS = $(subst .o,.lo,$(OBJS))
 24 | 
 25 | JAVACLASSES = org/pngquant/LiqObject.class org/pngquant/PngQuant.class org/pngquant/Image.class org/pngquant/Result.class
 26 | JAVAHEADERS = $(JAVACLASSES:.class=.h)
 27 | JAVAINCLUDE = -I'$(JAVA_HOME)/include' -I'$(JAVA_HOME)/include/linux' -I'$(JAVA_HOME)/include/win32' -I'$(JAVA_HOME)/include/darwin'
 28 | 
 29 | DISTFILES = $(OBJS:.o=.c) *.h README.md CHANGELOG COPYRIGHT Makefile configure imagequant.pc.in
 30 | TARNAME = libimagequant-$(VERSION)
 31 | TARFILE = $(TARNAME)-src.tar.bz2
 32 | PKGCONFIG = imagequant.pc
 33 | 
 34 | all: static shared
 35 | 
 36 | static: $(STATICLIB)
 37 | 
 38 | shared: $(SHAREDLIB)
 39 | 
 40 | dll:
 41 | 	$(MAKE) CFLAGS="$(CFLAGS) -DIMAGEQUANT_EXPORTS" $(DLL)
 42 | 
 43 | java: $(JNILIB)
 44 | 
 45 | java-dll:
 46 | 	$(MAKE) CFLAGS="$(CFLAGS) -DIMAGEQUANT_EXPORTS" $(JNIDLL)
 47 | 
 48 | $(DLL) $(DLLIMP): $(OBJS)
 49 | 	$(CC) -fPIC -shared -o $(DLL) $^ $(LDFLAGS) -Wl,--out-implib,$(DLLIMP),--output-def,$(DLLDEF)
 50 | 
 51 | $(STATICLIB): $(OBJS)
 52 | 	$(AR) $(ARFLAGS) $@ $^
 53 | 
 54 | $(SHAREDOBJS):
 55 | 	$(CC) -fPIC $(CFLAGS) -c $(@:.lo=.c) -o $@
 56 | 
 57 | libimagequant.so: $(SHAREDOBJS)
 58 | 	$(CC) -shared -Wl,-soname,$(SHAREDLIBVER) -o $(SHAREDLIBVER) $^ $(LDFLAGS)
 59 | 	ln -fs $(SHAREDLIBVER) $(SHAREDLIB)
 60 | 
 61 | libimagequant.dylib: $(SHAREDOBJS)
 62 | 	$(CC) -shared -o $(SHAREDLIBVER) $^ $(LDFLAGS)
 63 | 	ln -fs $(SHAREDLIBVER) $(SHAREDLIB)
 64 | 
 65 | $(OBJS): $(wildcard *.h) config.mk
 66 | 
 67 | $(JNILIB): $(JAVAHEADERS) $(STATICLIB) org/pngquant/PngQuant.c
 68 | 	$(CC) -g $(CFLAGS) $(LDFLAGS) $(JAVAINCLUDE) -shared -o $@ org/pngquant/PngQuant.c $(STATICLIB)
 69 | 
 70 | $(JNIDLL) $(JNIDLLIMP): $(JAVAHEADERS) $(OBJS) org/pngquant/PngQuant.c
 71 | 	$(CC) -fPIC -shared -I. $(JAVAINCLUDE) -o $(JNIDLL) $^ $(LDFLAGS) -Wl,--out-implib,$(JNIDLLIMP),--output-def,$(JNIDLLDEF)
 72 | 
 73 | $(JAVACLASSES): %.class: %.java
 74 | 	javac $<
 75 | 
 76 | $(JAVAHEADERS): %.h: %.class
 77 | 	javah -o $@ $(subst /,., $(patsubst %.class,%,$<)) && touch $@
 78 | 
 79 | dist: $(TARFILE) cargo
 80 | 
 81 | $(TARFILE): $(DISTFILES)
 82 | 	rm -rf $(TARFILE) $(TARNAME)
 83 | 	mkdir $(TARNAME)
 84 | 	cp $(DISTFILES) $(TARNAME)
 85 | 	tar -cjf $(TARFILE) --numeric-owner --exclude='._*' $(TARNAME)
 86 | 	rm -rf $(TARNAME)
 87 | 	-shasum $(TARFILE)
 88 | 
 89 | cargo:
 90 | 	rm -rf msvc-dist
 91 | 	git clone . -b msvc msvc-dist
 92 | 	rm -rf msvc-dist/Cargo.toml msvc-dist/org msvc-dist/rust msvc-dist/README.md msvc-dist/COPYRIGHT
 93 | 	cargo test
 94 | 
 95 | example: example.c lodepng.h lodepng.c $(STATICLIB)
 96 | 	$(CC) -g $(CFLAGS) -Wall example.c $(STATICLIB) -o example
 97 | 
 98 | lodepng.h:
 99 | 	curl -o lodepng.h -L https://raw.githubusercontent.com/lvandeve/lodepng/master/lodepng.h
100 | 
101 | lodepng.c:
102 | 	curl -o lodepng.c -L https://raw.githubusercontent.com/lvandeve/lodepng/master/lodepng.cpp
103 | 
104 | clean:
105 | 	rm -f $(OBJS) $(SHAREDOBJS) $(SHAREDLIBVER) $(SHAREDLIB) $(STATICLIB) $(TARFILE) $(DLL) '$(DLLIMP)' '$(DLLDEF)'
106 | 	rm -f $(JAVAHEADERS) $(JAVACLASSES) $(JNILIB) example
107 | 
108 | distclean: clean
109 | 	rm -f config.mk
110 | 	rm -f imagequant.pc
111 | 
112 | install: all $(PKGCONFIG)
113 | 	install -d $(DESTDIR)$(LIBDIR)
114 | 	install -d $(DESTDIR)$(PKGCONFIGDIR)
115 | 	install -d $(DESTDIR)$(INCLUDEDIR)
116 | 	install -m 644 $(STATICLIB) $(DESTDIR)$(LIBDIR)/$(STATICLIB)
117 | 	install -m 644 $(SHAREDLIBVER) $(DESTDIR)$(LIBDIR)/$(SHAREDLIBVER)
118 | 	ln -sf $(SHAREDLIBVER) $(DESTDIR)$(LIBDIR)/$(SHAREDLIB)
119 | 	install -m 644 $(PKGCONFIG) $(DESTDIR)$(PKGCONFIGDIR)/$(PKGCONFIG)
120 | 	install -m 644 libimagequant.h $(DESTDIR)$(INCLUDEDIR)/libimagequant.h
121 | 	$(FIX_INSTALL_NAME)
122 | 
123 | uninstall:
124 | 	rm -f $(DESTDIR)$(LIBDIR)/$(STATICLIB)
125 | 	rm -f $(DESTDIR)$(LIBDIR)/$(SHAREDLIBVER)
126 | 	rm -f $(DESTDIR)$(LIBDIR)/$(SHAREDLIB)
127 | 	rm -f $(DESTDIR)$(PKGCONFIGDIR)/$(PKGCONFIG)
128 | 	rm -f $(DESTDIR)$(INCLUDEDIR)/libimagequant.h
129 | 
130 | config.mk:
131 | ifeq ($(filter %clean %distclean, $(MAKECMDGOALS)), )
132 | 	./configure
133 | endif
134 | 
135 | $(PKGCONFIG): config.mk
136 | 	sed 's|PREFIX|$(PREFIX)|;s|VERSION|$(VERSION)|' < imagequant.pc.in > $(PKGCONFIG)
137 | 
138 | .PHONY: all static shared clean dist distclean dll java cargo
139 | .DELETE_ON_ERROR:
140 | 


--------------------------------------------------------------------------------
/pngquant/blur.c:
--------------------------------------------------------------------------------
  1 | /*
  2 | © 2011-2015 by Kornel Lesiński.
  3 | 
  4 | This file is part of libimagequant.
  5 | 
  6 | libimagequant is free software: you can redistribute it and/or modify
  7 | it under the terms of the GNU General Public License as published by
  8 | the Free Software Foundation, either version 3 of the License, or
  9 | (at your option) any later version.
 10 | 
 11 | libimagequant is distributed in the hope that it will be useful,
 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of
 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 14 | GNU General Public License for more details.
 15 | 
 16 | You should have received a copy of the GNU General Public License
 17 | along with libimagequant. If not, see <http://www.gnu.org/licenses/>.
 18 | */
 19 | 
 20 | #include "libimagequant.h"
 21 | #include "pam.h"
 22 | #include "blur.h"
 23 | 
 24 | /*
 25 |  Blurs image horizontally (width 2*size+1) and writes it transposed to dst (called twice gives 2d blur)
 26 |  */
 27 | static void transposing_1d_blur(unsigned char *restrict src, unsigned char *restrict dst, unsigned int width, unsigned int height, const unsigned int size)
 28 | {
 29 |     assert(size > 0);
 30 | 
 31 |     for(unsigned int j=0; j < height; j++) {
 32 |         unsigned char *restrict row = src + j*width;
 33 | 
 34 |         // accumulate sum for pixels outside line
 35 |         unsigned int sum;
 36 |         sum = row[0]*size;
 37 |         for(unsigned int i=0; i < size; i++) {
 38 |             sum += row[i];
 39 |         }
 40 | 
 41 |         // blur with left side outside line
 42 |         for(unsigned int i=0; i < size; i++) {
 43 |             sum -= row[0];
 44 |             sum += row[i+size];
 45 | 
 46 |             dst[i*height + j] = sum / (size*2);
 47 |         }
 48 | 
 49 |         for(unsigned int i=size; i < width-size; i++) {
 50 |             sum -= row[i-size];
 51 |             sum += row[i+size];
 52 | 
 53 |             dst[i*height + j] = sum / (size*2);
 54 |         }
 55 | 
 56 |         // blur with right side outside line
 57 |         for(unsigned int i=width-size; i < width; i++) {
 58 |             sum -= row[i-size];
 59 |             sum += row[width-1];
 60 | 
 61 |             dst[i*height + j] = sum / (size*2);
 62 |         }
 63 |     }
 64 | }
 65 | 
 66 | /**
 67 |  * Picks maximum of neighboring pixels (blur + lighten)
 68 |  */
 69 | LIQ_PRIVATE void liq_max3(unsigned char *src, unsigned char *dst, unsigned int width, unsigned int height)
 70 | {
 71 |     for(unsigned int j=0; j < height; j++) {
 72 |         const unsigned char *row = src + j*width,
 73 |         *prevrow = src + (j > 1 ? j-1 : 0)*width,
 74 |         *nextrow = src + MIN(height-1,j+1)*width;
 75 | 
 76 |         unsigned char prev,curr=row[0],next=row[0];
 77 | 
 78 |         for(unsigned int i=0; i < width-1; i++) {
 79 |             prev=curr;
 80 |             curr=next;
 81 |             next=row[i+1];
 82 | 
 83 |             unsigned char t1 = MAX(prev,next);
 84 |             unsigned char t2 = MAX(nextrow[i],prevrow[i]);
 85 |             *dst++ = MAX(curr,MAX(t1,t2));
 86 |         }
 87 |         unsigned char t1 = MAX(curr,next);
 88 |         unsigned char t2 = MAX(nextrow[width-1],prevrow[width-1]);
 89 |         *dst++ = MAX(t1,t2);
 90 |     }
 91 | }
 92 | 
 93 | /**
 94 |  * Picks minimum of neighboring pixels (blur + darken)
 95 |  */
 96 | LIQ_PRIVATE void liq_min3(unsigned char *src, unsigned char *dst, unsigned int width, unsigned int height)
 97 | {
 98 |     for(unsigned int j=0; j < height; j++) {
 99 |         const unsigned char *row = src + j*width,
100 |         *prevrow = src + (j > 1 ? j-1 : 0)*width,
101 |         *nextrow = src + MIN(height-1,j+1)*width;
102 | 
103 |         unsigned char prev,curr=row[0],next=row[0];
104 | 
105 |         for(unsigned int i=0; i < width-1; i++) {
106 |             prev=curr;
107 |             curr=next;
108 |             next=row[i+1];
109 | 
110 |             unsigned char t1 = MIN(prev,next);
111 |             unsigned char t2 = MIN(nextrow[i],prevrow[i]);
112 |             *dst++ = MIN(curr,MIN(t1,t2));
113 |         }
114 |         unsigned char t1 = MIN(curr,next);
115 |         unsigned char t2 = MIN(nextrow[width-1],prevrow[width-1]);
116 |         *dst++ = MIN(t1,t2);
117 |     }
118 | }
119 | 
120 | /*
121 |  Filters src image and saves it to dst, overwriting tmp in the process.
122 |  Image must be width*height pixels high. Size controls radius of box blur.
123 |  */
124 | LIQ_PRIVATE void liq_blur(unsigned char *src, unsigned char *tmp, unsigned char *dst, unsigned int width, unsigned int height, unsigned int size)
125 | {
126 |     assert(size > 0);
127 |     if (width < 2*size+1 || height < 2*size+1) {
128 |         return;
129 |     }
130 |     transposing_1d_blur(src, tmp, width, height, size);
131 |     transposing_1d_blur(tmp, dst, height, width, size);
132 | }
133 | 


--------------------------------------------------------------------------------
/pngquant/blur.h:
--------------------------------------------------------------------------------
1 | 
2 | LIQ_PRIVATE void liq_blur(unsigned char *src, unsigned char *tmp, unsigned char *dst, unsigned int width, unsigned int height, unsigned int size);
3 | LIQ_PRIVATE void liq_max3(unsigned char *src, unsigned char *dst, unsigned int width, unsigned int height);
4 | LIQ_PRIVATE void liq_min3(unsigned char *src, unsigned char *dst, unsigned int width, unsigned int height);
5 | 


--------------------------------------------------------------------------------
/pngquant/configure:
--------------------------------------------------------------------------------
  1 | #!/usr/bin/env bash
  2 | 
  3 | CONFIG="config.mk"
  4 | PREFIX="/usr/local"
  5 | LIBDIR="$PREFIX/lib"
  6 | INCLUDEDIR="$PREFIX/include"
  7 | PKGCONFIGDIR="$LIBDIR/pkgconfig"
  8 | VERSION=$(grep LIQ_VERSION_STRING libimagequant.h | grep -Eo "2\.[0-9.]+")
  9 | 
 10 | DEBUG=
 11 | QUIET=0
 12 | SSE=auto
 13 | OPENMP=
 14 | EXTRA_CFLAGS=
 15 | EXTRA_LDFLAGS=
 16 | 
 17 | # make gcc default compiler unless CC is already set
 18 | CC=${CC:-gcc}
 19 | 
 20 | help() {
 21 |     printf "%4s %s\n" "" "$1"
 22 | }
 23 | 
 24 | for i in "$@"; do
 25 |     case $i in
 26 |     --help|-h)
 27 |         echo
 28 |         help "--prefix=<dir>                installation directory [$PREFIX]"
 29 |         help "--libdir=<dir>                installation directory [$LIBDIR]"
 30 |         help "--includedir=<dir>            installation directory [$INCLUDEDIR]"
 31 |         help "--pkgconfigdir=<dir>          installation directory [$PKGCONFIGDIR]"
 32 |         help "--extra-cflags=<flags>        append to CFLAGS"
 33 |         help "--extra-ldflags=<flags>       append to LDFLAGS"
 34 |         echo
 35 |         help "--enable-debug"
 36 |         help "--enable-sse/--disable-sse    enable/disable SSE instructions"
 37 |         echo
 38 |         help "--with-openmp=static          compile with multicore support"
 39 |         echo
 40 |         help "CC=<compiler>                 use given compiler command"
 41 |         help "CFLAGS=<flags>                pass options to the compiler"
 42 |         help "LDFLAGS=<flags>               pass options to the linker"
 43 |         echo
 44 |         exit 0
 45 |         ;;
 46 |     # Can be set before or after configure. Latter overrides former.
 47 |     CC=*)
 48 |         CC=${i#*=}
 49 |         ;;
 50 |     CFLAGS=*)
 51 |         CFLAGS=${i#*=}
 52 |         ;;
 53 |     LDFLAGS=*)
 54 |         LDFLAGS=${i#*=}
 55 |         ;;
 56 |     --enable-debug)
 57 |         DEBUG=1
 58 |         ;;
 59 |     --enable-sse)
 60 |         SSE=1
 61 |         ;;
 62 |     --disable-sse)
 63 |         SSE=0
 64 |         ;;
 65 |     --quiet)
 66 |         QUIET=1
 67 |         ;;
 68 |     '')
 69 |         # allows a bash quirk
 70 |         ;;
 71 |     --with-openmp)
 72 |         OPENMP=1
 73 |         ;;
 74 |     --with-openmp=static)
 75 |         OPENMP=static
 76 |         ;;
 77 |     --prefix=*)
 78 |         PREFIX=${i#*=}
 79 |         LIBDIR="$PREFIX/lib"
 80 |         INCLUDEDIR="$PREFIX/include"
 81 |         PKGCONFIGDIR="$LIBDIR/pkgconfig"
 82 |         ;;
 83 |     --libdir=*)
 84 |         LIBDIR=${i#*=}
 85 |         PKGCONFIGDIR="$LIBDIR/pkgconfig"
 86 |         ;;
 87 |     --includedir=*)
 88 |         INCLUDEDIR=${i#*=}
 89 |         ;;
 90 |     --pkgconfigdir=*)
 91 |         PKGCONFIGDIR=${i#*=}
 92 |         ;;
 93 |     # can be used multiple times or in quotes to set multiple flags
 94 |     --extra-cflags=*)
 95 |         EXTRA_CFLAGS="$EXTRA_CFLAGS ${i#*=}"
 96 |         ;;
 97 |     --extra-ldflags=*)
 98 |         EXTRA_LDFLAGS="$EXTRA_LDFLAGS ${i#*=}"
 99 |         ;;
100 |     *)
101 |         echo "warning: unknown switch '${i%%=*}' (see $0 --help for the list)"
102 |         ;;
103 |     esac
104 | done
105 | 
106 | # If someone runs sudo make install as very first command, and configure later,
107 | # $CONFIG cannot be overwritten, and must be deleted before continuing.
108 | if [[ -f "$CONFIG" && ! -w "$CONFIG" ]]; then
109 |     echo "Cannot overwrite file $CONFIG! Please delete it."
110 |     exit 1
111 | fi
112 | 
113 | cflags() {
114 |     CFLAGS="$CFLAGS $1"
115 | }
116 | 
117 | lflags() {
118 |     LDFLAGS="$LDFLAGS $1"
119 | }
120 | 
121 | status() {
122 |     if [ "$QUIET" -ne 1 ]; then
123 |         printf "%10s: %s\n" "$1" "$2"
124 |     fi
125 | }
126 | 
127 | # Append to CFLAGS if compiler supports flag, with optional prerequisite.
128 | # Fails on errors and warnings.
129 | conditional_cflags() {
130 |     if [ -z "$(echo | "$CC" -xc -S -o /dev/null $2 $1 - 2>&1)" ]; then
131 |         cflags "$1"
132 |     fi
133 | }
134 | 
135 | error() {
136 |     status "$1" "error ... $2"
137 |     echo
138 |     exit 1
139 | }
140 | 
141 | if [ "$QUIET" -ne 1 ]; then
142 |     echo
143 | fi
144 | 
145 | echo > pngquant-gcccheck.c "int main(){}"
146 | if ! "$CC" -std=c99 -o pngquant-gcccheck pngquant-gcccheck.c; then
147 |     rm -f pngquant-gcccheck pngquant-gcccheck.c
148 |     error "Compiler" "$CC failed to compile anything (make sure it's installed and supports C99)"
149 | fi
150 | rm -f pngquant-gcccheck pngquant-gcccheck.c
151 | 
152 | status "Compiler" "$CC"
153 | 
154 | # init flags
155 | CFLAGS=${CFLAGS:--fno-math-errno -funroll-loops -fomit-frame-pointer -Wall}
156 | cflags "-std=c99 -I."
157 | 
158 | # DEBUG
159 | if [ -z "$DEBUG" ]; then
160 |     cflags "-O3 -DNDEBUG"
161 |     status "Debug" "no"
162 | else
163 |     cflags "-O1 -g -DDEBUG"
164 |     status "Debug" "yes"
165 | fi
166 | 
167 | # SSE
168 | if [ "$SSE" = 'auto' ]; then
169 |     SSE=0
170 |     if type uname > /dev/null; then
171 |         if [[ "$(uname -m)" =~ "amd64" || "$(uname -m)" =~ "x86_64" ||
172 |               "$(grep -E -m1 "^flags" /proc/cpuinfo)" =~ "sse" ]]; then
173 |             SSE=1
174 |         fi
175 |     fi
176 | fi
177 | 
178 | if [ "$SSE" -eq 1 ]; then
179 |     status "SSE" "yes"
180 |     cflags "-DUSE_SSE=1"
181 |     cflags "-msse"
182 |     # Silence a later ICC warning due to -msse working slightly different.
183 |     conditional_cflags "-wd10121"
184 |     # Must be set explicitly for GCC on x86_32. Other compilers imply it.
185 |     conditional_cflags "-mfpmath=sse" "-msse"
186 | elif [ "$SSE" -eq 0 ]; then
187 |     status "SSE" "no"
188 |     cflags "-DUSE_SSE=0"
189 | fi
190 | 
191 | # OpenMP
192 | if [ -n "$OPENMP" ]; then
193 |     if [ "static" = "$OPENMP" ]; then
194 |         OPENMPFLAGS="-static-libgcc -Bstatic -fopenmp -Bdynamic"
195 |     else
196 |         OPENMPFLAGS="-fopenmp"
197 |     fi
198 |     if [[ "$("$CC" -xc -E $OPENMPFLAGS <(echo "#ifdef _OPENMP
199 |            #include <omp.h>
200 |            #endif") 2>&1)" =~ "omp_get_thread_num" ]]; then
201 |         cflags "$OPENMPFLAGS"
202 |         lflags "$OPENMPFLAGS"
203 |         status "OpenMP" "yes"
204 |     else
205 |         error "OpenMP" "not supported by compiler (please install a compiler that supports OpenMP (e.g. gcc) and specify it with the CC= argument)"
206 |     fi
207 | else
208 |     # silence warnings about omp pragmas
209 |     cflags "-Wno-unknown-pragmas"
210 |     conditional_cflags "-wd3180" # ICC
211 |     status "OpenMP" "no"
212 | fi
213 | 
214 | # Cocoa
215 | if [[ "$OSTYPE" =~ "darwin" ]]; then
216 |     cflags "-mmacosx-version-min=10.7"
217 |     lflags "-mmacosx-version-min=10.7"
218 | fi
219 | 
220 | if [[ "$OSTYPE" =~ "darwin" ]]; then
221 |     SOLIBSUFFIX=dylib
222 | 
223 |     # Search Developer SDK paths, since Apple seems to have dropped the standard Unixy ones
224 |     XCODE_CMD="xcode-select"
225 |     XCODE_PATH=$($XCODE_CMD -p)
226 |     DIRS+=("$XCODE_PATH/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.10.sdk/usr/include $XCODE_PATH/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.10.sdk/usr/lib")
227 |     DIRS+=("$XCODE_PATH/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.8.sdk/usr/include $XCODE_PATH/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.8.sdk/usr/lib")
228 | elif [[ "$OSTYPE" =~ "msys" ]]; then
229 |     SOLIBSUFFIX=dll
230 | else
231 |     SOLIBSUFFIX=so
232 | fi
233 | 
234 | if [ "$QUIET" -ne 1 ]; then
235 |     echo
236 | fi
237 | 
238 | # As of GCC 4.5, 387 fp math is significantly slower in C99 mode without this.
239 | # Note: CPUs without SSE2 use 387 for doubles, even when SSE fp math is set.
240 | conditional_cflags "-fexcess-precision=fast"
241 | 
242 | # Intel C++ Compiler
243 | 
244 | # ICC does usually only produce fast(er) code when it can optimize to the full
245 | # capabilites of the (Intel) CPU. This is equivalent to -march=native for GCC.
246 | conditional_cflags "-xHOST"
247 | 
248 | # Disable unsafe fp optimizations and enforce fp precision as set in the source.
249 | conditional_cflags "-fp-model source"
250 | 
251 | # Silence a gold linker warning about string misalignment.
252 | conditional_cflags "-falign-stack=maintain-16-byte"
253 | 
254 | lflags "-lm" # Ubuntu requires this library last, issue #38
255 | 
256 | if [ -n "$EXTRA_CFLAGS" ]; then
257 |     cflags "$EXTRA_CFLAGS"
258 | fi
259 | 
260 | if [ -n "$EXTRA_LDFLAGS" ]; then
261 |     lflags "$EXTRA_LDFLAGS"
262 | fi
263 | 
264 | # Overwrite previous configuration.
265 | echo "
266 | # auto-generated by configure
267 | PREFIX = $PREFIX
268 | LIBDIR = $LIBDIR
269 | INCLUDEDIR = $INCLUDEDIR
270 | PKGCONFIGDIR = $PKGCONFIGDIR
271 | VERSION = $VERSION
272 | CC = $CC
273 | CFLAGS = $CFLAGS
274 | LDFLAGS = $LDFLAGS
275 | SOLIBSUFFIX = $SOLIBSUFFIX
276 | " > "$CONFIG"
277 | 


--------------------------------------------------------------------------------
/pngquant/imagequant.pc.in:
--------------------------------------------------------------------------------
 1 | prefix=PREFIX
 2 | includedir=${prefix}/include
 3 | libdir=${prefix}/lib
 4 | 
 5 | Name: imagequant
 6 | Description: Small, portable C library for high-quality conversion of RGBA images to 8-bit indexed-color (palette) images.
 7 | URL: https://pngquant.org/lib/
 8 | Version: VERSION
 9 | Libs: -L${libdir} -limagequant
10 | Cflags: -I${includedir}
11 | 


--------------------------------------------------------------------------------
/pngquant/kmeans.c:
--------------------------------------------------------------------------------
 1 | /*
 2 | ** © 2011-2016 by Kornel Lesiński.
 3 | ** See COPYRIGHT file for license.
 4 | */
 5 | 
 6 | #include "libimagequant.h"
 7 | #include "pam.h"
 8 | #include "kmeans.h"
 9 | #include "nearest.h"
10 | #include <stdlib.h>
11 | #include <string.h>
12 | 
13 | #ifdef _OPENMP
14 | #include <omp.h>
15 | #else
16 | #define omp_get_max_threads() 1
17 | #define omp_get_thread_num() 0
18 | #endif
19 | 
20 | /*
21 |  * K-Means iteration: new palette color is computed from weighted average of colors that map to that palette entry.
22 |  */
23 | LIQ_PRIVATE void kmeans_init(const colormap *map, const unsigned int max_threads, kmeans_state average_color[])
24 | {
25 |     memset(average_color, 0, sizeof(average_color[0])*(KMEANS_CACHE_LINE_GAP+map->colors)*max_threads);
26 | }
27 | 
28 | LIQ_PRIVATE void kmeans_update_color(const f_pixel acolor, const float value, const colormap *map, unsigned int match, const unsigned int thread, kmeans_state average_color[])
29 | {
30 |     match += thread * (KMEANS_CACHE_LINE_GAP+map->colors);
31 |     average_color[match].a += acolor.a * value;
32 |     average_color[match].r += acolor.r * value;
33 |     average_color[match].g += acolor.g * value;
34 |     average_color[match].b += acolor.b * value;
35 |     average_color[match].total += value;
36 | }
37 | 
38 | LIQ_PRIVATE void kmeans_finalize(colormap *map, const unsigned int max_threads, const kmeans_state average_color[])
39 | {
40 |     for (unsigned int i=0; i < map->colors; i++) {
41 |         double a=0, r=0, g=0, b=0, total=0;
42 | 
43 |         // Aggregate results from all threads
44 |         for(unsigned int t=0; t < max_threads; t++) {
45 |             const unsigned int offset = (KMEANS_CACHE_LINE_GAP+map->colors) * t + i;
46 | 
47 |             a += average_color[offset].a;
48 |             r += average_color[offset].r;
49 |             g += average_color[offset].g;
50 |             b += average_color[offset].b;
51 |             total += average_color[offset].total;
52 |         }
53 | 
54 |         if (total && !map->palette[i].fixed) {
55 |             map->palette[i].acolor = (f_pixel){
56 |                 .a = a / total,
57 |                 .r = r / total,
58 |                 .g = g / total,
59 |                 .b = b / total,
60 |             };
61 |             map->palette[i].popularity = total;
62 |         }
63 |     }
64 | }
65 | 
66 | LIQ_PRIVATE double kmeans_do_iteration(histogram *hist, colormap *const map, kmeans_callback callback)
67 | {
68 |     const unsigned int max_threads = omp_get_max_threads();
69 |     LIQ_ARRAY(kmeans_state, average_color, (KMEANS_CACHE_LINE_GAP+map->colors) * max_threads);
70 |     kmeans_init(map, max_threads, average_color);
71 |     struct nearest_map *const n = nearest_init(map);
72 |     hist_item *const achv = hist->achv;
73 |     const int hist_size = hist->size;
74 | 
75 |     double total_diff=0;
76 | #if __GNUC__ >= 9
77 |     #pragma omp parallel for if (hist_size > 2000) \
78 |         schedule(static) default(none) shared(achv,average_color,callback,hist_size,map,n) reduction(+:total_diff)
79 | #else
80 |     #pragma omp parallel for if (hist_size > 2000) \
81 |         schedule(static) default(none) shared(average_color,callback) reduction(+:total_diff)
82 | #endif
83 |     for(int j=0; j < hist_size; j++) {
84 |         float diff;
85 |         unsigned int match = nearest_search(n, &achv[j].acolor, achv[j].tmp.likely_colormap_index, &diff);
86 |         achv[j].tmp.likely_colormap_index = match;
87 |         total_diff += diff * achv[j].perceptual_weight;
88 | 
89 |         kmeans_update_color(achv[j].acolor, achv[j].perceptual_weight, map, match, omp_get_thread_num(), average_color);
90 | 
91 |         if (callback) callback(&achv[j], diff);
92 |     }
93 | 
94 |     nearest_free(n);
95 |     kmeans_finalize(map, max_threads, average_color);
96 | 
97 |     return total_diff / hist->total_perceptual_weight;
98 | }
99 | 


--------------------------------------------------------------------------------
/pngquant/kmeans.h:
--------------------------------------------------------------------------------
 1 | 
 2 | #ifndef KMEANS_H
 3 | #define KMEANS_H
 4 | 
 5 | // Spread memory touched by different threads at least 64B apart which I assume is the cache line size. This should avoid memory write contention.
 6 | #define KMEANS_CACHE_LINE_GAP ((64+sizeof(kmeans_state)-1)/sizeof(kmeans_state))
 7 | 
 8 | typedef struct {
 9 |     double a, r, g, b, total;
10 | } kmeans_state;
11 | 
12 | typedef void (*kmeans_callback)(hist_item *item, float diff);
13 | 
14 | LIQ_PRIVATE void kmeans_init(const colormap *map, const unsigned int max_threads, kmeans_state state[]);
15 | LIQ_PRIVATE void kmeans_update_color(const f_pixel acolor, const float value, const colormap *map, unsigned int match, const unsigned int thread, kmeans_state average_color[]);
16 | LIQ_PRIVATE void kmeans_finalize(colormap *map, const unsigned int max_threads, const kmeans_state state[]);
17 | LIQ_PRIVATE double kmeans_do_iteration(histogram *hist, colormap *const map, kmeans_callback callback);
18 | 
19 | #endif
20 | 


--------------------------------------------------------------------------------
/pngquant/libimagequant.cs:
--------------------------------------------------------------------------------
  1 | /*
  2 | This is an example demonstrating use of libimagequant from C#.
  3 | 
  4 | This example code can be freely copied under CC0 (public domain) license.
  5 | */
  6 | 
  7 | using System;
  8 | using System.Collections.Generic;
  9 | using System.Runtime.InteropServices;
 10 | 
 11 | [StructLayout(LayoutKind.Sequential)]
 12 | struct liq_color
 13 | {
 14 |     public byte r, g, b, a;
 15 | };
 16 | 
 17 | [StructLayout(LayoutKind.Sequential)]
 18 | struct liq_palette
 19 | {
 20 |     public int count;
 21 |     [MarshalAs(UnmanagedType.ByValArray, SizeConst = 256)]
 22 |     public liq_color[] entries;
 23 | };
 24 | 
 25 | enum liq_error
 26 | {
 27 |     LIQ_OK = 0,
 28 |     LIQ_QUALITY_TOO_LOW = 99,
 29 |     LIQ_VALUE_OUT_OF_RANGE = 100,
 30 |     LIQ_OUT_OF_MEMORY,
 31 |     LIQ_ABORTED,
 32 |     LIQ_BITMAP_NOT_AVAILABLE,
 33 |     LIQ_BUFFER_TOO_SMALL,
 34 |     LIQ_INVALID_POINTER,
 35 | };
 36 | 
 37 | namespace liq
 38 | {
 39 |     using liq_attr_ptr = IntPtr;
 40 |     using liq_image_ptr = IntPtr;
 41 |     using liq_result_ptr = IntPtr;
 42 |     using size_t = UIntPtr;
 43 | 
 44 |     class Liq
 45 |     {
 46 |         [DllImport(@"imagequant.dll")]
 47 |         public static extern liq_attr_ptr liq_attr_create();
 48 |         [DllImport(@"imagequant.dll")]
 49 |         public static extern liq_attr_ptr liq_attr_copy(liq_attr_ptr attr);
 50 |         [DllImport(@"imagequant.dll")]
 51 |         public static extern void liq_attr_destroy(liq_attr_ptr attr);
 52 | 
 53 |         [DllImport(@"imagequant.dll")]
 54 |         public static extern liq_error liq_set_max_colors(liq_attr_ptr attr, int colors);
 55 |         [DllImport(@"imagequant.dll")]
 56 |         public static extern int liq_get_max_colors(liq_attr_ptr attr);
 57 |         [DllImport(@"imagequant.dll")]
 58 |         public static extern liq_error liq_set_speed(liq_attr_ptr attr, int speed);
 59 |         [DllImport(@"imagequant.dll")]
 60 |         public static extern int liq_get_speed(liq_attr_ptr attr);
 61 |         [DllImport(@"imagequant.dll")]
 62 |         public static extern liq_error liq_set_min_opacity(liq_attr_ptr attr, int min);
 63 |         [DllImport(@"imagequant.dll")]
 64 |         public static extern int liq_get_min_opacity(liq_attr_ptr attr);
 65 |         [DllImport(@"imagequant.dll")]
 66 |         public static extern liq_error liq_set_min_posterization(liq_attr_ptr attr, int bits);
 67 |         [DllImport(@"imagequant.dll")]
 68 |         public static extern int liq_get_min_posterization(liq_attr_ptr attr);
 69 |         [DllImport(@"imagequant.dll")]
 70 |         public static extern liq_error liq_set_quality(liq_attr_ptr attr, int minimum, int maximum);
 71 |         [DllImport(@"imagequant.dll")]
 72 |         public static extern int liq_get_min_quality(liq_attr_ptr attr);
 73 |         [DllImport(@"imagequant.dll")]
 74 |         public static extern int liq_get_max_quality(liq_attr_ptr attr);
 75 |         [DllImport(@"imagequant.dll")]
 76 |         public static extern void liq_set_last_index_transparent(liq_attr_ptr attr, int is_last);
 77 | 
 78 |         [DllImport(@"imagequant.dll")]
 79 |         public static extern liq_image_ptr liq_image_create_rgba(liq_attr_ptr attr, [In, MarshalAs(UnmanagedType.LPArray)] byte[] bitmap, int width, int height, double gamma);
 80 | 
 81 |         [DllImport(@"imagequant.dll")]
 82 |         public static extern liq_error liq_image_set_memory_ownership(liq_image_ptr image, int ownership_flags);
 83 |         [DllImport(@"imagequant.dll")]
 84 |         public static extern liq_error liq_image_add_fixed_color(liq_image_ptr img, liq_color color);
 85 |         [DllImport(@"imagequant.dll")]
 86 |         public static extern int liq_image_get_width(liq_image_ptr img);
 87 |         [DllImport(@"imagequant.dll")]
 88 |         public static extern int liq_image_get_height(liq_image_ptr img);
 89 |         [DllImport(@"imagequant.dll")]
 90 |         public static extern void liq_image_destroy(liq_image_ptr img);
 91 | 
 92 |         [DllImport(@"imagequant.dll")]
 93 |         public static extern liq_result_ptr liq_quantize_image(liq_attr_ptr attr, liq_image_ptr input_image);
 94 | 
 95 |         [DllImport(@"imagequant.dll")]
 96 |         public static extern liq_error liq_set_dithering_level(liq_result_ptr res, float dither_level);
 97 |         [DllImport(@"imagequant.dll")]
 98 |         public static extern liq_error liq_set_output_gamma(liq_result_ptr res, double gamma);
 99 |         [DllImport(@"imagequant.dll")]
100 |         public static extern double liq_get_output_gamma(liq_result_ptr res);
101 | 
102 |         [DllImport(@"imagequant.dll")]
103 |         public static extern IntPtr liq_get_palette(liq_result_ptr res);
104 | 
105 |         [DllImport(@"imagequant.dll")]
106 |         public static extern liq_error liq_write_remapped_image(liq_result_ptr res, liq_image_ptr input_image, [Out, MarshalAs(UnmanagedType.LPArray)] byte[] buffer, size_t buffer_size);
107 | 
108 |         [DllImport(@"imagequant.dll")]
109 |         public static extern double liq_get_quantization_error(liq_result_ptr res);
110 |         [DllImport(@"imagequant.dll")]
111 |         public static extern int liq_get_quantization_quality(liq_result_ptr res);
112 |         [DllImport(@"imagequant.dll")]
113 |         public static extern double liq_get_remapping_error(liq_result_ptr res);
114 |         [DllImport(@"imagequant.dll")]
115 |         public static extern int liq_get_remapping_quality(liq_result_ptr res);
116 | 
117 |         [DllImport(@"imagequant.dll")]
118 |         public static extern void liq_result_destroy(liq_result_ptr res);
119 | 
120 |         [DllImport(@"imagequant.dll")]
121 |         public static extern int liq_version();
122 | 
123 |         static void Main(string[] args)
124 |         {
125 |             Console.WriteLine("library version: {0}", liq_version());
126 | 
127 |             int width = 3;
128 |             int height = 1;
129 | 
130 |             var attr = liq_attr_create();
131 |             if (attr == IntPtr.Zero) throw new Exception("can't create attr");
132 | 
133 |             byte[] bitmap = { // R, G, B, A,  R, G, B, A, ...
134 |                 111, 222, 33, 255,
135 |                 255, 0, 255, 255,
136 |                 255, 0, 255, 255,
137 |             };
138 |             var img = liq_image_create_rgba(attr, bitmap, width, height, 0);
139 |             if (img == IntPtr.Zero) throw new Exception("can't create image");
140 | 
141 |             var res = liq_quantize_image(attr, img);
142 |             if (res == IntPtr.Zero) throw new Exception("can't quantize image");
143 | 
144 |             var buffer_size = width * height;
145 |             var remapped = new byte[buffer_size];
146 | 
147 |             var err = liq_write_remapped_image(res, img, remapped, (UIntPtr)buffer_size);
148 |             if (err != liq_error.LIQ_OK)
149 |             {
150 |                 throw new Exception("remapping error");
151 |             }
152 | 
153 |             Console.WriteLine("first pixel is {0}th palette entry", remapped[0]);
154 | 
155 |             liq_palette pal = (liq_palette)Marshal.PtrToStructure(liq_get_palette(res), typeof(liq_palette));
156 | 
157 |             Console.WriteLine("palette entries: {0}; red of first entry: {1}", pal.count, pal.entries[0].r);
158 | 
159 |             liq_image_destroy(img);
160 |             liq_result_destroy(res);
161 |             liq_attr_destroy(attr);
162 |         }
163 |     }
164 | }
165 | 


--------------------------------------------------------------------------------
/pngquant/libimagequant.h:
--------------------------------------------------------------------------------
  1 | /*
  2 |  * https://pngquant.org
  3 |  */
  4 | 
  5 | #ifndef LIBIMAGEQUANT_H
  6 | #define LIBIMAGEQUANT_H
  7 | 
  8 | #ifdef IMAGEQUANT_EXPORTS
  9 | #define LIQ_EXPORT __declspec(dllexport)
 10 | #endif
 11 | 
 12 | #ifndef LIQ_EXPORT
 13 | #define LIQ_EXPORT extern
 14 | #endif
 15 | 
 16 | #define LIQ_VERSION 21205
 17 | #define LIQ_VERSION_STRING "2.12.5"
 18 | 
 19 | #ifndef LIQ_PRIVATE
 20 | #if defined(__GNUC__) || defined (__llvm__)
 21 | #define LIQ_PRIVATE __attribute__((visibility("hidden")))
 22 | #define LIQ_NONNULL __attribute__((nonnull))
 23 | #define LIQ_USERESULT __attribute__((warn_unused_result))
 24 | #else
 25 | #define LIQ_PRIVATE
 26 | #define LIQ_NONNULL
 27 | #define LIQ_USERESULT
 28 | #endif
 29 | #endif
 30 | 
 31 | #ifdef __cplusplus
 32 | extern "C" {
 33 | #endif
 34 | 
 35 | #include <stddef.h>
 36 | 
 37 | typedef struct liq_attr liq_attr;
 38 | typedef struct liq_image liq_image;
 39 | typedef struct liq_result liq_result;
 40 | typedef struct liq_histogram liq_histogram;
 41 | 
 42 | typedef struct liq_color {
 43 |     unsigned char r, g, b, a;
 44 | } liq_color;
 45 | 
 46 | typedef struct liq_palette {
 47 |     unsigned int count;
 48 |     liq_color entries[256];
 49 | } liq_palette;
 50 | 
 51 | typedef enum liq_error {
 52 |     LIQ_OK = 0,
 53 |     LIQ_QUALITY_TOO_LOW = 99,
 54 |     LIQ_VALUE_OUT_OF_RANGE = 100,
 55 |     LIQ_OUT_OF_MEMORY,
 56 |     LIQ_ABORTED,
 57 |     LIQ_BITMAP_NOT_AVAILABLE,
 58 |     LIQ_BUFFER_TOO_SMALL,
 59 |     LIQ_INVALID_POINTER,
 60 |     LIQ_UNSUPPORTED,
 61 | } liq_error;
 62 | 
 63 | enum liq_ownership {
 64 |     LIQ_OWN_ROWS=4,
 65 |     LIQ_OWN_PIXELS=8,
 66 |     LIQ_COPY_PIXELS=16,
 67 | };
 68 | 
 69 | typedef struct liq_histogram_entry {
 70 |     liq_color color;
 71 |     unsigned int count;
 72 | } liq_histogram_entry;
 73 | 
 74 | LIQ_EXPORT LIQ_USERESULT liq_attr* liq_attr_create(void);
 75 | LIQ_EXPORT LIQ_USERESULT liq_attr* liq_attr_create_with_allocator(void* (*malloc)(size_t), void (*free)(void*));
 76 | LIQ_EXPORT LIQ_USERESULT liq_attr* liq_attr_copy(const liq_attr *orig) LIQ_NONNULL;
 77 | LIQ_EXPORT void liq_attr_destroy(liq_attr *attr) LIQ_NONNULL;
 78 | 
 79 | LIQ_EXPORT LIQ_USERESULT liq_histogram* liq_histogram_create(const liq_attr* attr);
 80 | LIQ_EXPORT liq_error liq_histogram_add_image(liq_histogram *hist, const liq_attr *attr, liq_image* image) LIQ_NONNULL;
 81 | LIQ_EXPORT liq_error liq_histogram_add_colors(liq_histogram *hist, const liq_attr *attr, const liq_histogram_entry entries[], int num_entries, double gamma) LIQ_NONNULL;
 82 | LIQ_EXPORT liq_error liq_histogram_add_fixed_color(liq_histogram *hist, liq_color color, double gamma) LIQ_NONNULL;
 83 | LIQ_EXPORT void liq_histogram_destroy(liq_histogram *hist) LIQ_NONNULL;
 84 | 
 85 | LIQ_EXPORT liq_error liq_set_max_colors(liq_attr* attr, int colors) LIQ_NONNULL;
 86 | LIQ_EXPORT LIQ_USERESULT int liq_get_max_colors(const liq_attr* attr) LIQ_NONNULL;
 87 | LIQ_EXPORT liq_error liq_set_speed(liq_attr* attr, int speed) LIQ_NONNULL;
 88 | LIQ_EXPORT LIQ_USERESULT int liq_get_speed(const liq_attr* attr) LIQ_NONNULL;
 89 | LIQ_EXPORT liq_error liq_set_min_opacity(liq_attr* attr, int min) LIQ_NONNULL;
 90 | LIQ_EXPORT LIQ_USERESULT int liq_get_min_opacity(const liq_attr* attr) LIQ_NONNULL;
 91 | LIQ_EXPORT liq_error liq_set_min_posterization(liq_attr* attr, int bits) LIQ_NONNULL;
 92 | LIQ_EXPORT LIQ_USERESULT int liq_get_min_posterization(const liq_attr* attr) LIQ_NONNULL;
 93 | LIQ_EXPORT liq_error liq_set_quality(liq_attr* attr, int minimum, int maximum) LIQ_NONNULL;
 94 | LIQ_EXPORT LIQ_USERESULT int liq_get_min_quality(const liq_attr* attr) LIQ_NONNULL;
 95 | LIQ_EXPORT LIQ_USERESULT int liq_get_max_quality(const liq_attr* attr) LIQ_NONNULL;
 96 | LIQ_EXPORT void liq_set_last_index_transparent(liq_attr* attr, int is_last) LIQ_NONNULL;
 97 | 
 98 | typedef void liq_log_callback_function(const liq_attr*, const char *message, void* user_info);
 99 | typedef void liq_log_flush_callback_function(const liq_attr*, void* user_info);
100 | LIQ_EXPORT void liq_set_log_callback(liq_attr*, liq_log_callback_function*, void* user_info);
101 | LIQ_EXPORT void liq_set_log_flush_callback(liq_attr*, liq_log_flush_callback_function*, void* user_info);
102 | 
103 | typedef int liq_progress_callback_function(float progress_percent, void* user_info);
104 | LIQ_EXPORT void liq_attr_set_progress_callback(liq_attr*, liq_progress_callback_function*, void* user_info);
105 | LIQ_EXPORT void liq_result_set_progress_callback(liq_result*, liq_progress_callback_function*, void* user_info);
106 | 
107 | // The rows and their data are not modified. The type of `rows` is non-const only due to a bug in C's typesystem design.
108 | LIQ_EXPORT LIQ_USERESULT liq_image *liq_image_create_rgba_rows(const liq_attr *attr, void *const rows[], int width, int height, double gamma) LIQ_NONNULL;
109 | LIQ_EXPORT LIQ_USERESULT liq_image *liq_image_create_rgba(const liq_attr *attr, const void *bitmap, int width, int height, double gamma) LIQ_NONNULL;
110 | 
111 | typedef void liq_image_get_rgba_row_callback(liq_color row_out[], int row, int width, void* user_info);
112 | LIQ_EXPORT LIQ_USERESULT liq_image *liq_image_create_custom(const liq_attr *attr, liq_image_get_rgba_row_callback *row_callback, void* user_info, int width, int height, double gamma);
113 | 
114 | LIQ_EXPORT liq_error liq_image_set_memory_ownership(liq_image *image, int ownership_flags) LIQ_NONNULL;
115 | LIQ_EXPORT liq_error liq_image_set_background(liq_image *img, liq_image *background_image) LIQ_NONNULL;
116 | LIQ_EXPORT liq_error liq_image_set_importance_map(liq_image *img, unsigned char buffer[], size_t buffer_size, enum liq_ownership memory_handling) LIQ_NONNULL;
117 | LIQ_EXPORT liq_error liq_image_add_fixed_color(liq_image *img, liq_color color) LIQ_NONNULL;
118 | LIQ_EXPORT LIQ_USERESULT int liq_image_get_width(const liq_image *img) LIQ_NONNULL;
119 | LIQ_EXPORT LIQ_USERESULT int liq_image_get_height(const liq_image *img) LIQ_NONNULL;
120 | LIQ_EXPORT void liq_image_destroy(liq_image *img) LIQ_NONNULL;
121 | 
122 | LIQ_EXPORT LIQ_USERESULT liq_error liq_histogram_quantize(liq_histogram *const input_hist, liq_attr *const options, liq_result **result_output) LIQ_NONNULL;
123 | LIQ_EXPORT LIQ_USERESULT liq_error liq_image_quantize(liq_image *const input_image, liq_attr *const options, liq_result **result_output) LIQ_NONNULL;
124 | 
125 | LIQ_EXPORT liq_error liq_set_dithering_level(liq_result *res, float dither_level) LIQ_NONNULL;
126 | LIQ_EXPORT liq_error liq_set_output_gamma(liq_result* res, double gamma) LIQ_NONNULL;
127 | LIQ_EXPORT LIQ_USERESULT double liq_get_output_gamma(const liq_result *result) LIQ_NONNULL;
128 | 
129 | LIQ_EXPORT LIQ_USERESULT const liq_palette *liq_get_palette(liq_result *result) LIQ_NONNULL;
130 | 
131 | LIQ_EXPORT liq_error liq_write_remapped_image(liq_result *result, liq_image *input_image, void *buffer, size_t buffer_size) LIQ_NONNULL;
132 | LIQ_EXPORT liq_error liq_write_remapped_image_rows(liq_result *result, liq_image *input_image, unsigned char **row_pointers) LIQ_NONNULL;
133 | 
134 | LIQ_EXPORT double liq_get_quantization_error(const liq_result *result) LIQ_NONNULL;
135 | LIQ_EXPORT int liq_get_quantization_quality(const liq_result *result) LIQ_NONNULL;
136 | LIQ_EXPORT double liq_get_remapping_error(const liq_result *result) LIQ_NONNULL;
137 | LIQ_EXPORT int liq_get_remapping_quality(const liq_result *result) LIQ_NONNULL;
138 | 
139 | LIQ_EXPORT void liq_result_destroy(liq_result *) LIQ_NONNULL;
140 | 
141 | LIQ_EXPORT int liq_version(void);
142 | 
143 | 
144 | // Deprecated
145 | LIQ_EXPORT LIQ_USERESULT liq_result *liq_quantize_image(liq_attr *options, liq_image *input_image) LIQ_NONNULL;
146 | 
147 | #ifdef __cplusplus
148 | }
149 | #endif
150 | 
151 | #endif
152 | 


--------------------------------------------------------------------------------
/pngquant/mediancut.c:
--------------------------------------------------------------------------------
  1 | /*
  2 | ** © 2009-2018 by Kornel Lesiński.
  3 | ** © 1989, 1991 by Jef Poskanzer.
  4 | ** © 1997, 2000, 2002 by Greg Roelofs; based on an idea by Stefan Schneider.
  5 | **
  6 | ** See COPYRIGHT file for license.
  7 | */
  8 | 
  9 | #include <stdlib.h>
 10 | #include <stddef.h>
 11 | 
 12 | #include "libimagequant.h"
 13 | #include "pam.h"
 14 | #include "mediancut.h"
 15 | 
 16 | #define index_of_channel(ch) (offsetof(f_pixel,ch)/sizeof(float))
 17 | 
 18 | static f_pixel averagepixels(unsigned int clrs, const hist_item achv[]);
 19 | 
 20 | struct box {
 21 |     f_pixel color;
 22 |     f_pixel variance;
 23 |     double sum, total_error, max_error;
 24 |     unsigned int ind;
 25 |     unsigned int colors;
 26 | };
 27 | 
 28 | ALWAYS_INLINE static double variance_diff(double val, const double good_enough);
 29 | inline static double variance_diff(double val, const double good_enough)
 30 | {
 31 |     val *= val;
 32 |     if (val < good_enough*good_enough) return val*0.25;
 33 |     return val;
 34 | }
 35 | 
 36 | /** Weighted per-channel variance of the box. It's used to decide which channel to split by */
 37 | static f_pixel box_variance(const hist_item achv[], const struct box *box)
 38 | {
 39 |     f_pixel mean = box->color;
 40 |     double variancea=0, variancer=0, varianceg=0, varianceb=0;
 41 | 
 42 |     for(unsigned int i = 0; i < box->colors; ++i) {
 43 |         const f_pixel px = achv[box->ind + i].acolor;
 44 |         double weight = achv[box->ind + i].adjusted_weight;
 45 |         variancea += variance_diff(mean.a - px.a, 2.0/256.0)*weight;
 46 |         variancer += variance_diff(mean.r - px.r, 1.0/256.0)*weight;
 47 |         varianceg += variance_diff(mean.g - px.g, 1.0/256.0)*weight;
 48 |         varianceb += variance_diff(mean.b - px.b, 1.0/256.0)*weight;
 49 |     }
 50 | 
 51 |     return (f_pixel){
 52 |         .a = variancea*(4.0/16.0),
 53 |         .r = variancer*(7.0/16.0),
 54 |         .g = varianceg*(9.0/16.0),
 55 |         .b = varianceb*(5.0/16.0),
 56 |     };
 57 | }
 58 | 
 59 | static double box_max_error(const hist_item achv[], const struct box *box)
 60 | {
 61 |     f_pixel mean = box->color;
 62 |     double max_error = 0;
 63 | 
 64 |     for(unsigned int i = 0; i < box->colors; ++i) {
 65 |         const double diff = colordifference(mean, achv[box->ind + i].acolor);
 66 |         if (diff > max_error) {
 67 |             max_error = diff;
 68 |         }
 69 |     }
 70 |     return max_error;
 71 | }
 72 | 
 73 | ALWAYS_INLINE static double color_weight(f_pixel median, hist_item h);
 74 | 
 75 | static inline void hist_item_swap(hist_item *l, hist_item *r)
 76 | {
 77 |     if (l != r) {
 78 |         hist_item t = *l;
 79 |         *l = *r;
 80 |         *r = t;
 81 |     }
 82 | }
 83 | 
 84 | ALWAYS_INLINE static unsigned int qsort_pivot(const hist_item *const base, const unsigned int len);
 85 | inline static unsigned int qsort_pivot(const hist_item *const base, const unsigned int len)
 86 | {
 87 |     if (len < 32) {
 88 |         return len/2;
 89 |     }
 90 | 
 91 |     const unsigned int aidx=8, bidx=len/2, cidx=len-1;
 92 |     const unsigned int a=base[aidx].tmp.sort_value, b=base[bidx].tmp.sort_value, c=base[cidx].tmp.sort_value;
 93 |     return (a < b) ? ((b < c) ? bidx : ((a < c) ? cidx : aidx ))
 94 |            : ((b > c) ? bidx : ((a < c) ? aidx : cidx ));
 95 | }
 96 | 
 97 | ALWAYS_INLINE static unsigned int qsort_partition(hist_item *const base, const unsigned int len);
 98 | inline static unsigned int qsort_partition(hist_item *const base, const unsigned int len)
 99 | {
100 |     unsigned int l = 1, r = len;
101 |     if (len >= 8) {
102 |         hist_item_swap(&base[0], &base[qsort_pivot(base,len)]);
103 |     }
104 | 
105 |     const unsigned int pivot_value = base[0].tmp.sort_value;
106 |     while (l < r) {
107 |         if (base[l].tmp.sort_value >= pivot_value) {
108 |             l++;
109 |         } else {
110 |             while(l < --r && base[r].tmp.sort_value <= pivot_value) {}
111 |             hist_item_swap(&base[l], &base[r]);
112 |         }
113 |     }
114 |     l--;
115 |     hist_item_swap(&base[0], &base[l]);
116 | 
117 |     return l;
118 | }
119 | 
120 | /** quick select algorithm */
121 | static void hist_item_sort_range(hist_item base[], unsigned int len, unsigned int sort_start)
122 | {
123 |     for(;;) {
124 |         const unsigned int l = qsort_partition(base, len), r = l+1;
125 | 
126 |         if (l > 0 && sort_start < l) {
127 |             len = l;
128 |         }
129 |         else if (r < len && sort_start > r) {
130 |             base += r; len -= r; sort_start -= r;
131 |         }
132 |         else break;
133 |     }
134 | }
135 | 
136 | /** sorts array to make sum of weights lower than halfvar one side, returns edge between <halfvar and >halfvar parts of the set */
137 | static hist_item *hist_item_sort_halfvar(hist_item base[], unsigned int len, double *const lowervar, const double halfvar)
138 | {
139 |     do {
140 |         const unsigned int l = qsort_partition(base, len), r = l+1;
141 | 
142 |         // check if sum of left side is smaller than half,
143 |         // if it is, then it doesn't need to be sorted
144 |         unsigned int t = 0; double tmpsum = *lowervar;
145 |         while (t <= l && tmpsum < halfvar) tmpsum += base[t++].color_weight;
146 | 
147 |         if (tmpsum < halfvar) {
148 |             *lowervar = tmpsum;
149 |         } else {
150 |             if (l > 0) {
151 |                 hist_item *res = hist_item_sort_halfvar(base, l, lowervar, halfvar);
152 |                 if (res) return res;
153 |             } else {
154 |                 // End of left recursion. This will be executed in order from the first element.
155 |                 *lowervar += base[0].color_weight;
156 |                 if (*lowervar > halfvar) return &base[0];
157 |             }
158 |         }
159 | 
160 |         if (len > r) {
161 |             base += r; len -= r; // tail-recursive "call"
162 |         } else {
163 |             *lowervar += base[r].color_weight;
164 |             return (*lowervar > halfvar) ? &base[r] : NULL;
165 |         }
166 |     } while(1);
167 | }
168 | 
169 | static f_pixel get_median(const struct box *b, hist_item achv[]);
170 | 
171 | typedef struct {
172 |     unsigned int chan; float variance;
173 | } channelvariance;
174 | 
175 | static int comparevariance(const void *ch1, const void *ch2)
176 | {
177 |     return ((const channelvariance*)ch1)->variance > ((const channelvariance*)ch2)->variance ? -1 :
178 |            (((const channelvariance*)ch1)->variance < ((const channelvariance*)ch2)->variance ? 1 : 0);
179 | }
180 | 
181 | /** Finds which channels need to be sorted first and preproceses achv for fast sort */
182 | static double prepare_sort(struct box *b, hist_item achv[])
183 | {
184 |     /*
185 |      ** Sort dimensions by their variance, and then sort colors first by dimension with highest variance
186 |      */
187 |     channelvariance channels[4] = {
188 |         {index_of_channel(a), b->variance.a},
189 |         {index_of_channel(r), b->variance.r},
190 |         {index_of_channel(g), b->variance.g},
191 |         {index_of_channel(b), b->variance.b},
192 |     };
193 | 
194 |     qsort(channels, 4, sizeof(channels[0]), comparevariance);
195 | 
196 |     const unsigned int ind1 = b->ind;
197 |     const unsigned int colors = b->colors;
198 | #if __GNUC__ >= 9
199 |     #pragma omp parallel for if (colors > 25000) \
200 |         schedule(static) default(none) shared(achv, channels, colors, ind1)
201 | #else
202 |     #pragma omp parallel for if (colors > 25000) \
203 |         schedule(static) default(none) shared(achv, channels)
204 | #endif
205 |     for(unsigned int i=0; i < colors; i++) {
206 |         const float *chans = (const float *)&achv[ind1 + i].acolor;
207 |         // Only the first channel really matters. When trying median cut many times
208 |         // with different histogram weights, I don't want sort randomness to influence outcome.
209 |         achv[ind1 + i].tmp.sort_value = ((unsigned int)(chans[channels[0].chan]*65535.0)<<16) |
210 |                                         (unsigned int)((chans[channels[2].chan] + chans[channels[1].chan]/2.0 + chans[channels[3].chan]/4.0)*65535.0);
211 |     }
212 | 
213 |     const f_pixel median = get_median(b, achv);
214 | 
215 |     // box will be split to make color_weight of each side even
216 |     const unsigned int ind = b->ind, end = ind+b->colors;
217 |     double totalvar = 0;
218 |     #pragma omp parallel for if (end - ind > 15000) \
219 |         schedule(static) default(shared) reduction(+:totalvar)
220 |     for(unsigned int j=ind; j < end; j++) totalvar += (achv[j].color_weight = color_weight(median, achv[j]));
221 |     return totalvar / 2.0;
222 | }
223 | 
224 | /** finds median in unsorted set by sorting only minimum required */
225 | static f_pixel get_median(const struct box *b, hist_item achv[])
226 | {
227 |     const unsigned int median_start = (b->colors-1)/2;
228 | 
229 |     hist_item_sort_range(&(achv[b->ind]), b->colors,
230 |                          median_start);
231 | 
232 |     if (b->colors&1) return achv[b->ind + median_start].acolor;
233 | 
234 |     // technically the second color is not guaranteed to be sorted correctly
235 |     // but most of the time it is good enough to be useful
236 |     return averagepixels(2, &achv[b->ind + median_start]);
237 | }
238 | 
239 | /*
240 |  ** Find the best splittable box. -1 if no boxes are splittable.
241 |  */
242 | static int best_splittable_box(struct box bv[], unsigned int boxes, const double max_mse)
243 | {
244 |     int bi=-1; double maxsum=0;
245 |     for(unsigned int i=0; i < boxes; i++) {
246 |         if (bv[i].colors < 2) {
247 |             continue;
248 |         }
249 | 
250 |         // looks only at max variance, because it's only going to split by it
251 |         const double cv = MAX(bv[i].variance.r, MAX(bv[i].variance.g,bv[i].variance.b));
252 |         double thissum = bv[i].sum * MAX(bv[i].variance.a, cv);
253 | 
254 |         if (bv[i].max_error > max_mse) {
255 |             thissum = thissum* bv[i].max_error/max_mse;
256 |         }
257 | 
258 |         if (thissum > maxsum) {
259 |             maxsum = thissum;
260 |             bi = i;
261 |         }
262 |     }
263 |     return bi;
264 | }
265 | 
266 | inline static double color_weight(f_pixel median, hist_item h)
267 | {
268 |     float diff = colordifference(median, h.acolor);
269 |     return sqrt(diff) * (sqrt(1.0+h.adjusted_weight)-1.0);
270 | }
271 | 
272 | static void set_colormap_from_boxes(colormap *map, struct box bv[], unsigned int boxes, hist_item *achv);
273 | static void adjust_histogram(hist_item *achv, const struct box bv[], unsigned int boxes);
274 | 
275 | static double box_error(const struct box *box, const hist_item achv[])
276 | {
277 |     f_pixel avg = box->color;
278 | 
279 |     double total_error=0;
280 |     for (unsigned int i = 0; i < box->colors; ++i) {
281 |         total_error += colordifference(avg, achv[box->ind + i].acolor) * achv[box->ind + i].perceptual_weight;
282 |     }
283 | 
284 |     return total_error;
285 | }
286 | 
287 | 
288 | static bool total_box_error_below_target(double target_mse, struct box bv[], unsigned int boxes, const histogram *hist)
289 | {
290 |     target_mse *= hist->total_perceptual_weight;
291 |     double total_error=0;
292 | 
293 |     for(unsigned int i=0; i < boxes; i++) {
294 |         // error is (re)calculated lazily
295 |         if (bv[i].total_error >= 0) {
296 |             total_error += bv[i].total_error;
297 |         }
298 |         if (total_error > target_mse) return false;
299 |     }
300 | 
301 |     for(unsigned int i=0; i < boxes; i++) {
302 |         if (bv[i].total_error < 0) {
303 |             bv[i].total_error = box_error(&bv[i], hist->achv);
304 |             total_error += bv[i].total_error;
305 |         }
306 |         if (total_error > target_mse) return false;
307 |     }
308 | 
309 |     return true;
310 | }
311 | 
312 | static void box_init(struct box *box, const hist_item *achv, const unsigned int ind, const unsigned int colors, const double sum) {
313 |     box->ind = ind;
314 |     box->colors = colors;
315 |     box->sum = sum;
316 |     box->total_error = -1;
317 | 
318 |     box->color = averagepixels(colors, &achv[ind]);
319 |     #pragma omp task if (colors > 5000)
320 |     box->variance = box_variance(achv, box);
321 |     #pragma omp task if (colors > 8000)
322 |     box->max_error = box_max_error(achv, box);
323 | }
324 | 
325 | /*
326 |  ** Here is the fun part, the median-cut colormap generator.  This is based
327 |  ** on Paul Heckbert's paper, "Color Image Quantization for Frame Buffer
328 |  ** Display," SIGGRAPH 1982 Proceedings, page 297.
329 |  */
330 | LIQ_PRIVATE colormap *mediancut(histogram *hist, unsigned int newcolors, const double target_mse, const double max_mse, void* (*malloc)(size_t), void (*free)(void*))
331 | {
332 |     hist_item *achv = hist->achv;
333 |     LIQ_ARRAY(struct box, bv, newcolors);
334 |     unsigned int boxes = 1;
335 | 
336 |     /*
337 |      ** Set up the initial box.
338 |      */
339 |     #pragma omp parallel
340 |     #pragma omp single
341 |     {
342 |         double sum = 0;
343 |         for(unsigned int i=0; i < hist->size; i++) {
344 |             sum += achv[i].adjusted_weight;
345 |         }
346 |         #pragma omp taskgroup
347 |         {
348 |             box_init(&bv[0], achv, 0, hist->size, sum);
349 |         }
350 | 
351 | 
352 |         /*
353 |          ** Main loop: split boxes until we have enough.
354 |          */
355 |         while (boxes < newcolors) {
356 | 
357 |             // first splits boxes that exceed quality limit (to have colors for things like odd green pixel),
358 |             // later raises the limit to allow large smooth areas/gradients get colors.
359 |             const double current_max_mse = max_mse + (boxes/(double)newcolors)*16.0*max_mse;
360 |             const int bi = best_splittable_box(bv, boxes, current_max_mse);
361 |             if (bi < 0) {
362 |                 break;    /* ran out of colors! */
363 |             }
364 | 
365 |             unsigned int indx = bv[bi].ind;
366 |             unsigned int clrs = bv[bi].colors;
367 | 
368 |             /*
369 |              Classic implementation tries to get even number of colors or pixels in each subdivision.
370 | 
371 |              Here, instead of popularity I use (sqrt(popularity)*variance) metric.
372 |              Each subdivision balances number of pixels (popular colors) and low variance -
373 |              boxes can be large if they have similar colors. Later boxes with high variance
374 |              will be more likely to be split.
375 | 
376 |              Median used as expected value gives much better results than mean.
377 |              */
378 | 
379 |             const double halfvar = prepare_sort(&bv[bi], achv);
380 |             double lowervar=0;
381 | 
382 |             // hist_item_sort_halfvar sorts and sums lowervar at the same time
383 |             // returns item to break at …minus one, which does smell like an off-by-one error.
384 |             hist_item *break_p = hist_item_sort_halfvar(&achv[indx], clrs, &lowervar, halfvar);
385 |             unsigned int break_at = MIN(clrs-1, break_p - &achv[indx] + 1);
386 | 
387 |             /*
388 |              ** Split the box.
389 |              */
390 |             double sm = bv[bi].sum;
391 |             double lowersum = 0;
392 |             for(unsigned int i=0; i < break_at; i++) lowersum += achv[indx + i].adjusted_weight;
393 | 
394 |             #pragma omp taskgroup
395 |             {
396 |                 box_init(&bv[bi], achv, indx, break_at, lowersum);
397 |                 box_init(&bv[boxes], achv, indx + break_at, clrs - break_at, sm - lowersum);
398 |             }
399 | 
400 |             ++boxes;
401 | 
402 |             if (total_box_error_below_target(target_mse, bv, boxes, hist)) {
403 |                 break;
404 |             }
405 |         }
406 |     }
407 | 
408 |     colormap *map = pam_colormap(boxes, malloc, free);
409 |     set_colormap_from_boxes(map, bv, boxes, achv);
410 | 
411 |     adjust_histogram(achv, bv, boxes);
412 | 
413 |     return map;
414 | }
415 | 
416 | static void set_colormap_from_boxes(colormap *map, struct box* bv, unsigned int boxes, hist_item *achv)
417 | {
418 |     /*
419 |      ** Ok, we've got enough boxes.  Now choose a representative color for
420 |      ** each box.  There are a number of possible ways to make this choice.
421 |      ** One would be to choose the center of the box; this ignores any structure
422 |      ** within the boxes.  Another method would be to average all the colors in
423 |      ** the box - this is the method specified in Heckbert's paper.
424 |      */
425 | 
426 |     for(unsigned int bi = 0; bi < boxes; ++bi) {
427 |         map->palette[bi].acolor = bv[bi].color;
428 | 
429 |         /* store total color popularity (perceptual_weight is approximation of it) */
430 |         map->palette[bi].popularity = 0;
431 |         for(unsigned int i=bv[bi].ind; i < bv[bi].ind+bv[bi].colors; i++) {
432 |             map->palette[bi].popularity += achv[i].perceptual_weight;
433 |         }
434 |     }
435 | }
436 | 
437 | /* increase histogram popularity by difference from the final color (this is used as part of feedback loop) */
438 | static void adjust_histogram(hist_item *achv, const struct box* bv, unsigned int boxes)
439 | {
440 |     for(unsigned int bi = 0; bi < boxes; ++bi) {
441 |         for(unsigned int i=bv[bi].ind; i < bv[bi].ind+bv[bi].colors; i++) {
442 |             achv[i].tmp.likely_colormap_index = bi;
443 |         }
444 |     }
445 | }
446 | 
447 | static f_pixel averagepixels(unsigned int clrs, const hist_item achv[])
448 | {
449 |     double r = 0, g = 0, b = 0, a = 0, sum = 0;
450 | 
451 |     #pragma omp parallel for if (clrs > 25000) \
452 |         schedule(static) default(shared) reduction(+:a) reduction(+:r) reduction(+:g) reduction(+:b) reduction(+:sum)
453 |     for(unsigned int i = 0; i < clrs; i++) {
454 |         const f_pixel px = achv[i].acolor;
455 |         const double weight = achv[i].adjusted_weight;
456 | 
457 |         sum += weight;
458 |         a += px.a * weight;
459 |         r += px.r * weight;
460 |         g += px.g * weight;
461 |         b += px.b * weight;
462 |     }
463 | 
464 |     if (sum) {
465 |         a /= sum;
466 |         r /= sum;
467 |         g /= sum;
468 |         b /= sum;
469 |     }
470 | 
471 |     assert(!isnan(r) && !isnan(g) && !isnan(b) && !isnan(a));
472 | 
473 |     return (f_pixel){.r=r, .g=g, .b=b, .a=a};
474 | }
475 | 


--------------------------------------------------------------------------------
/pngquant/mediancut.h:
--------------------------------------------------------------------------------
1 | 
2 | LIQ_PRIVATE colormap *mediancut(histogram *hist, unsigned int newcolors, const double target_mse, const double max_mse, void* (*malloc)(size_t), void (*free)(void*));
3 | 


--------------------------------------------------------------------------------
/pngquant/mempool.c:
--------------------------------------------------------------------------------
 1 | /*
 2 | ** © 2009-2017 by Kornel Lesiński.
 3 | ** © 1989, 1991 by Jef Poskanzer.
 4 | ** © 1997, 2000, 2002 by Greg Roelofs; based on an idea by Stefan Schneider.
 5 | **
 6 | ** See COPYRIGHT file for license.
 7 | */
 8 | 
 9 | #include "libimagequant.h"
10 | #include "mempool.h"
11 | #include <stdlib.h>
12 | #include <stdint.h>
13 | #include <assert.h>
14 | 
15 | #define ALIGN_MASK 15UL
16 | #define MEMPOOL_RESERVED ((sizeof(struct mempool)+ALIGN_MASK) & ~ALIGN_MASK)
17 | 
18 | struct mempool {
19 |     unsigned int used, size;
20 |     void* (*malloc)(size_t);
21 |     void (*free)(void*);
22 |     struct mempool *next;
23 | };
24 | LIQ_PRIVATE void* mempool_create(mempoolptr *mptr, const unsigned int size, unsigned int max_size, void* (*malloc)(size_t), void (*free)(void*))
25 | {
26 |     if (*mptr && ((*mptr)->used+size) <= (*mptr)->size) {
27 |         unsigned int prevused = (*mptr)->used;
28 |         (*mptr)->used += (size+15UL) & ~0xFUL;
29 |         return ((char*)(*mptr)) + prevused;
30 |     }
31 | 
32 |     mempoolptr old = *mptr;
33 |     if (!max_size) max_size = (1<<17);
34 |     max_size = size+ALIGN_MASK > max_size ? size+ALIGN_MASK : max_size;
35 | 
36 |     *mptr = malloc(MEMPOOL_RESERVED + max_size);
37 |     if (!*mptr) return NULL;
38 |     **mptr = (struct mempool){
39 |         .malloc = malloc,
40 |         .free = free,
41 |         .size = MEMPOOL_RESERVED + max_size,
42 |         .used = sizeof(struct mempool),
43 |         .next = old,
44 |     };
45 |     uintptr_t mptr_used_start = (uintptr_t)(*mptr) + (*mptr)->used;
46 |     (*mptr)->used += (ALIGN_MASK + 1 - (mptr_used_start & ALIGN_MASK)) & ALIGN_MASK; // reserve bytes required to make subsequent allocations aligned
47 |     assert(!(((uintptr_t)(*mptr) + (*mptr)->used) & ALIGN_MASK));
48 | 
49 |     return mempool_alloc(mptr, size, size);
50 | }
51 | 
52 | LIQ_PRIVATE void* mempool_alloc(mempoolptr *mptr, const unsigned int size, const unsigned int max_size)
53 | {
54 |     if (((*mptr)->used+size) <= (*mptr)->size) {
55 |         unsigned int prevused = (*mptr)->used;
56 |         (*mptr)->used += (size + ALIGN_MASK) & ~ALIGN_MASK;
57 |         return ((char*)(*mptr)) + prevused;
58 |     }
59 | 
60 |     return mempool_create(mptr, size, max_size, (*mptr)->malloc, (*mptr)->free);
61 | }
62 | 
63 | LIQ_PRIVATE void mempool_destroy(mempoolptr m)
64 | {
65 |     while (m) {
66 |         mempoolptr next = m->next;
67 |         m->free(m);
68 |         m = next;
69 |     }
70 | }
71 | 


--------------------------------------------------------------------------------
/pngquant/mempool.h:
--------------------------------------------------------------------------------
 1 | #ifndef MEMPOOL_H
 2 | #define MEMPOOL_H
 3 | 
 4 | #include <stddef.h>
 5 | 
 6 | struct mempool;
 7 | typedef struct mempool *mempoolptr;
 8 | 
 9 | LIQ_PRIVATE void* mempool_create(mempoolptr *mptr, const unsigned int size, unsigned int capacity, void* (*malloc)(size_t), void (*free)(void*));
10 | LIQ_PRIVATE void* mempool_alloc(mempoolptr *mptr, const unsigned int size, const unsigned int capacity);
11 | LIQ_PRIVATE void mempool_destroy(mempoolptr m);
12 | 
13 | #endif
14 | 


--------------------------------------------------------------------------------
/pngquant/nearest.c:
--------------------------------------------------------------------------------
  1 | /*
  2 | ** © 2009-2015 by Kornel Lesiński.
  3 | ** © 1989, 1991 by Jef Poskanzer.
  4 | ** © 1997, 2000, 2002 by Greg Roelofs; based on an idea by Stefan Schneider.
  5 | **
  6 | ** See COPYRIGHT file for license.
  7 | */
  8 | 
  9 | #include "libimagequant.h"
 10 | #include "pam.h"
 11 | #include "nearest.h"
 12 | #include "mempool.h"
 13 | #include <stdlib.h>
 14 | 
 15 | typedef struct vp_sort_tmp {
 16 |     float distance_squared;
 17 |     unsigned int idx;
 18 | } vp_sort_tmp;
 19 | 
 20 | typedef struct vp_search_tmp {
 21 |     float distance;
 22 |     unsigned int idx;
 23 |     int exclude;
 24 | } vp_search_tmp;
 25 | 
 26 | typedef struct vp_node {
 27 |     struct vp_node *near, *far;
 28 |     f_pixel vantage_point;
 29 |     float radius;
 30 |     unsigned int idx;
 31 | } vp_node;
 32 | 
 33 | struct nearest_map {
 34 |     vp_node *root;
 35 |     const colormap_item *palette;
 36 |     float nearest_other_color_dist[256];
 37 |     mempoolptr mempool;
 38 | };
 39 | 
 40 | static void vp_search_node(const vp_node *node, const f_pixel *const needle, vp_search_tmp *const best_candidate);
 41 | 
 42 | static int vp_compare_distance(const void *ap, const void *bp) {
 43 |     float a = ((const vp_sort_tmp*)ap)->distance_squared;
 44 |     float b = ((const vp_sort_tmp*)bp)->distance_squared;
 45 |     return a > b ? 1 : -1;
 46 | }
 47 | 
 48 | static void vp_sort_indexes_by_distance(const f_pixel vantage_point, vp_sort_tmp indexes[], int num_indexes, const colormap_item items[]) {
 49 |     for(int i=0; i < num_indexes; i++) {
 50 |         indexes[i].distance_squared = colordifference(vantage_point, items[indexes[i].idx].acolor);
 51 |     }
 52 |     qsort(indexes, num_indexes, sizeof(indexes[0]), vp_compare_distance);
 53 | }
 54 | 
 55 | /*
 56 |  * Usually it should pick farthest point, but picking most popular point seems to make search quicker anyway
 57 |  */
 58 | static int vp_find_best_vantage_point_index(vp_sort_tmp indexes[], int num_indexes, const colormap_item items[]) {
 59 |     int best = 0;
 60 |     float best_popularity = items[indexes[0].idx].popularity;
 61 |     for(int i = 1; i < num_indexes; i++) {
 62 |         if (items[indexes[i].idx].popularity > best_popularity) {
 63 |             best_popularity = items[indexes[i].idx].popularity;
 64 |             best = i;
 65 |         }
 66 |     }
 67 |     return best;
 68 | }
 69 | 
 70 | static vp_node *vp_create_node(mempoolptr *m, vp_sort_tmp indexes[], int num_indexes, const colormap_item items[]) {
 71 |     if (num_indexes <= 0) {
 72 |         return NULL;
 73 |     }
 74 | 
 75 |     vp_node *node = mempool_alloc(m, sizeof(node[0]), 0);
 76 | 
 77 |     if (num_indexes == 1) {
 78 |         *node = (vp_node){
 79 |             .vantage_point = items[indexes[0].idx].acolor,
 80 |             .idx = indexes[0].idx,
 81 |             .radius = MAX_DIFF,
 82 |         };
 83 |         return node;
 84 |     }
 85 | 
 86 |     const int ref = vp_find_best_vantage_point_index(indexes, num_indexes, items);
 87 |     const int ref_idx = indexes[ref].idx;
 88 | 
 89 |     // Removes the `ref_idx` item from remaining items, because it's included in the current node
 90 |     num_indexes -= 1;
 91 |     indexes[ref] = indexes[num_indexes];
 92 | 
 93 |     vp_sort_indexes_by_distance(items[ref_idx].acolor, indexes, num_indexes, items);
 94 | 
 95 |     // Remaining items are split by the median distance
 96 |     const int half_idx = num_indexes/2;
 97 | 
 98 |     *node = (vp_node){
 99 |         .vantage_point = items[ref_idx].acolor,
100 |         .idx = ref_idx,
101 |         .radius = sqrtf(indexes[half_idx].distance_squared),
102 |     };
103 |     node->near = vp_create_node(m, indexes, half_idx, items);
104 |     node->far = vp_create_node(m, &indexes[half_idx], num_indexes - half_idx, items);
105 | 
106 |     return node;
107 | }
108 | 
109 | LIQ_PRIVATE struct nearest_map *nearest_init(const colormap *map) {
110 |     mempoolptr m = NULL;
111 |     struct nearest_map *handle = mempool_create(&m, sizeof(handle[0]), sizeof(handle[0]) + sizeof(vp_node)*map->colors+16, map->malloc, map->free);
112 | 
113 |     LIQ_ARRAY(vp_sort_tmp, indexes, map->colors);
114 | 
115 |     for(unsigned int i=0; i < map->colors; i++) {
116 |         indexes[i].idx = i;
117 |     }
118 | 
119 |     vp_node *root = vp_create_node(&m, indexes, map->colors, map->palette);
120 |     *handle = (struct nearest_map){
121 |         .root = root,
122 |         .palette = map->palette,
123 |         .mempool = m,
124 |     };
125 | 
126 |     for(unsigned int i=0; i < map->colors; i++) {
127 |         vp_search_tmp best = {
128 |             .distance = MAX_DIFF,
129 |             .exclude = i,
130 |         };
131 |         vp_search_node(root, &map->palette[i].acolor, &best);
132 |         handle->nearest_other_color_dist[i] = best.distance * best.distance / 4.0; // half of squared distance
133 |     }
134 | 
135 |     return handle;
136 | }
137 | 
138 | static void vp_search_node(const vp_node *node, const f_pixel *const needle, vp_search_tmp *const best_candidate) {
139 |     do {
140 |         const float distance = sqrtf(colordifference(node->vantage_point, *needle));
141 | 
142 |         if (distance < best_candidate->distance && best_candidate->exclude != node->idx) {
143 |             best_candidate->distance = distance;
144 |             best_candidate->idx = node->idx;
145 |         }
146 | 
147 |         // Recurse towards most likely candidate first to narrow best candidate's distance as soon as possible
148 |         if (distance < node->radius) {
149 |             if (node->near) {
150 |                 vp_search_node(node->near, needle, best_candidate);
151 |             }
152 |             // The best node (final answer) may be just ouside the radius, but not farther than
153 |             // the best distance we know so far. The vp_search_node above should have narrowed
154 |             // best_candidate->distance, so this path is rarely taken.
155 |             if (node->far && distance >= node->radius - best_candidate->distance) {
156 |                 node = node->far; // Fast tail recursion
157 |             } else {
158 |                 break;
159 |             }
160 |         } else {
161 |             if (node->far) {
162 |                 vp_search_node(node->far, needle, best_candidate);
163 |             }
164 |             if (node->near && distance <= node->radius + best_candidate->distance) {
165 |                 node = node->near; // Fast tail recursion
166 |             } else {
167 |                 break;
168 |             }
169 |         }
170 |     } while(true);
171 | }
172 | 
173 | LIQ_PRIVATE unsigned int nearest_search(const struct nearest_map *handle, const f_pixel *px, const int likely_colormap_index, float *diff) {
174 |     const float guess_diff = colordifference(handle->palette[likely_colormap_index].acolor, *px);
175 |     if (guess_diff < handle->nearest_other_color_dist[likely_colormap_index]) {
176 |         if (diff) *diff = guess_diff;
177 |         return likely_colormap_index;
178 |     }
179 | 
180 |     vp_search_tmp best_candidate = {
181 |         .distance = sqrtf(guess_diff),
182 |         .idx = likely_colormap_index,
183 |         .exclude = -1,
184 |     };
185 |     vp_search_node(handle->root, px, &best_candidate);
186 |     if (diff) {
187 |         *diff = best_candidate.distance * best_candidate.distance;
188 |     }
189 |     return best_candidate.idx;
190 | }
191 | 
192 | LIQ_PRIVATE void nearest_free(struct nearest_map *centroids)
193 | {
194 |     mempool_destroy(centroids->mempool);
195 | }
196 | 


--------------------------------------------------------------------------------
/pngquant/nearest.h:
--------------------------------------------------------------------------------
1 | //
2 | //  nearest.h
3 | //  pngquant
4 | //
5 | struct nearest_map;
6 | LIQ_PRIVATE struct nearest_map *nearest_init(const colormap *palette);
7 | LIQ_PRIVATE unsigned int nearest_search(const struct nearest_map *map, const f_pixel *px, const int palette_index_guess, float *diff);
8 | LIQ_PRIVATE void nearest_free(struct nearest_map *map);
9 | 


--------------------------------------------------------------------------------
/pngquant/org/pngquant/Image.java:
--------------------------------------------------------------------------------
 1 | package org.pngquant;
 2 | 
 3 | import org.pngquant.*;
 4 | import java.awt.image.*;
 5 | 
 6 | /**
 7 |  * PngQuant's representation of an Image constructed from BufferedImage.
 8 |  */
 9 | public class Image extends LiqObject {
10 | 
11 |     /**
12 |      * Converts BufferedImage to internal representation (pixel data is copied).
13 |      * It's best to use BufferedImage in RGB/RGBA format backed by DataBufferByte.
14 |      * Throws if conversion fails.
15 |      */
16 |     public Image(BufferedImage image) throws PngQuantException {
17 |         this(new PngQuant(), image);
18 |     }
19 | 
20 |     public Image(PngQuant attr, BufferedImage image) throws PngQuantException {
21 |         handle = handleFromImage(attr, image);
22 | 
23 |         if (handle == 0) {
24 |             BufferedImage converted = new BufferedImage(image.getWidth(), image.getHeight(), BufferedImage.TYPE_4BYTE_ABGR);
25 |             converted.getGraphics().drawImage(image, 0, 0, null);
26 |             handle = handleFromImage(attr, converted);
27 | 
28 |             if (handle == 0) {
29 |                 throw new PngQuantException();
30 |             }
31 |         }
32 |     }
33 | 
34 |     /**
35 |      * Guarantees presence of the given color in the palette (subject to setMaxColors())
36 |      * if this image is used for quantization.
37 |      */
38 |     public native boolean addFixedColor(int r, int g, int b, int a);
39 |     public boolean addFixedColor(int r, int g, int b) {
40 |         return addFixedColor(r, g, b, 255);
41 |     }
42 |     public native int getWidth();
43 |     public native int getHeight();
44 | 
45 |     public void close() {
46 |         if (handle != 0) {
47 |             liq_image_destroy(handle);
48 |             handle = 0;
49 |         }
50 |     }
51 | 
52 |     private static long handleFromImage(PngQuant attr, BufferedImage image) {
53 |         // The JNI wrapper will accept non-premultiplied ABGR and BGR only.
54 |         int type = image.getType();
55 |         if (type != BufferedImage.TYPE_3BYTE_BGR &&
56 |             type != BufferedImage.TYPE_4BYTE_ABGR &&
57 |             type != BufferedImage.TYPE_4BYTE_ABGR_PRE) return 0;
58 | 
59 |         WritableRaster raster = image.getRaster();
60 |         ColorModel color = image.getColorModel();
61 |         if (type == BufferedImage.TYPE_4BYTE_ABGR_PRE) color.coerceData(raster, false);
62 | 
63 |         DataBuffer buffer = raster.getDataBuffer();
64 |         if (buffer instanceof DataBufferByte) {
65 |             byte[] imageData = ((DataBufferByte)buffer).getData();
66 |             return liq_image_create(attr.handle, imageData,
67 |                 raster.getWidth(), raster.getHeight(), color.getNumComponents());
68 |         }
69 |         return 0;
70 |     }
71 | 
72 |     private static native long liq_image_create(long attr, byte[] bitmap, int width, int height, int components);
73 |     private static native void liq_image_destroy(long handle);
74 | }
75 | 


--------------------------------------------------------------------------------
/pngquant/org/pngquant/LiqObject.java:
--------------------------------------------------------------------------------
 1 | package org.pngquant;
 2 | 
 3 | abstract class LiqObject {
 4 |     static {
 5 |         // libimagequant.jnilib or libimagequant.so must be in java.library.path
 6 |         System.loadLibrary("imagequant");
 7 |     }
 8 | 
 9 |     long handle;
10 | 
11 |     /**
12 |      * Free memory used by the library. The object must not be used after this call.
13 |      */
14 |     abstract public void close();
15 | 
16 |     protected void finalize() throws Throwable {
17 |         close();
18 |     }
19 | }
20 | 


--------------------------------------------------------------------------------
/pngquant/org/pngquant/PngQuant.c:
--------------------------------------------------------------------------------
  1 | #include "org/pngquant/PngQuant.h"
  2 | #include "org/pngquant/Image.h"
  3 | #include "org/pngquant/Result.h"
  4 | #include "libimagequant.h"
  5 | #include <stdlib.h>
  6 | 
  7 | typedef struct {
  8 |   liq_image *image;
  9 |   jbyte *data;
 10 | } liq_jni_image;
 11 | 
 12 | static void *handle(JNIEnv *env, jobject obj) {
 13 |     jlong h = (*env)->GetLongField(env, obj, (*env)->GetFieldID(env, (*env)->GetObjectClass(env, obj), "handle", "J"));
 14 |     return (void*)h;
 15 | }
 16 | 
 17 | JNIEXPORT jlong JNICALL Java_org_pngquant_PngQuant_liq_1attr_1create(JNIEnv *env, jclass class) {
 18 |     return (jlong)liq_attr_create();
 19 | }
 20 | 
 21 | JNIEXPORT jlong JNICALL Java_org_pngquant_PngQuant_liq_1attr_1copy(JNIEnv *env, jclass class, jlong attr) {
 22 |     return (jlong)liq_attr_copy((liq_attr*)attr);
 23 | }
 24 | 
 25 | JNIEXPORT void JNICALL Java_org_pngquant_PngQuant_liq_1attr_1destroy(JNIEnv *env, jclass class, jlong attr) {
 26 |     return liq_attr_destroy((liq_attr*)attr);
 27 | }
 28 | 
 29 | JNIEXPORT jboolean JNICALL Java_org_pngquant_PngQuant_setMaxColors(JNIEnv *env, jobject obj, jint colors) {
 30 |     return LIQ_OK == liq_set_max_colors(handle(env, obj), colors);
 31 | }
 32 | 
 33 | JNIEXPORT jboolean JNICALL Java_org_pngquant_PngQuant_setSpeed(JNIEnv *env, jobject obj, jint speed) {
 34 |     return LIQ_OK == liq_set_speed(handle(env, obj), speed);
 35 | }
 36 | 
 37 | JNIEXPORT jboolean JNICALL Java_org_pngquant_PngQuant_setMinPosterization(JNIEnv *env, jobject obj, jint p) {
 38 |     return LIQ_OK == liq_set_min_posterization(handle(env, obj), p);
 39 | }
 40 | 
 41 | JNIEXPORT jboolean JNICALL Java_org_pngquant_PngQuant_setQuality__I(JNIEnv *env, jobject obj, jint q) {
 42 |     return LIQ_OK == liq_set_quality(handle(env, obj), q/2, q);
 43 | }
 44 | 
 45 | JNIEXPORT jboolean JNICALL Java_org_pngquant_PngQuant_setQuality__II(JNIEnv *env, jobject obj, jint qmin, jint qmax) {
 46 |     return LIQ_OK == liq_set_quality(handle(env, obj), qmin, qmax);
 47 | }
 48 | 
 49 | static void convert_abgr(liq_color row_out[], int row_index, int width, void* user_info) {
 50 |     liq_jni_image *jniimg = user_info;
 51 |     int column_index;
 52 |     for(column_index=0; column_index < width; column_index++) {
 53 |         row_out[column_index].r = jniimg->data[4*(width*row_index + column_index) + 3];
 54 |         row_out[column_index].g = jniimg->data[4*(width*row_index + column_index) + 2];
 55 |         row_out[column_index].b = jniimg->data[4*(width*row_index + column_index) + 1];
 56 |         row_out[column_index].a = jniimg->data[4*(width*row_index + column_index) + 0];
 57 |     }
 58 | }
 59 | 
 60 | static void convert_bgr(liq_color row_out[], int row_index, int width, void* user_info) {
 61 |     liq_jni_image *jniimg = user_info;
 62 |     int column_index;
 63 |     for(column_index=0; column_index < width; column_index++) {
 64 |         row_out[column_index].r = jniimg->data[3*(width*row_index + column_index) + 2];
 65 |         row_out[column_index].g = jniimg->data[3*(width*row_index + column_index) + 1];
 66 |         row_out[column_index].b = jniimg->data[3*(width*row_index + column_index) + 0];
 67 |         row_out[column_index].a = 255;
 68 |     }
 69 | }
 70 | 
 71 | JNIEXPORT jlong JNICALL Java_org_pngquant_Image_liq_1image_1create(JNIEnv *env, jclass class, jlong attr, jbyteArray bytearray, jint w, jint h, jint components) {
 72 |     /* liq_image needs to be wrapped to keep track of allocated buffer */
 73 |     liq_jni_image *jniimg = malloc(sizeof(liq_jni_image));
 74 | 
 75 |     /* copying buffer, since ReleaseByteArrayElements was crashing when called from finalize() */
 76 |     jsize size = (*env)->GetArrayLength(env, bytearray);
 77 |     jniimg->data = malloc(size);
 78 |     (*env)->GetByteArrayRegion(env, bytearray, 0, size, jniimg->data);
 79 | 
 80 |     jniimg->image = liq_image_create_custom((liq_attr*)attr, components == 4 ? convert_abgr : convert_bgr, jniimg, w, h, 0);
 81 | 
 82 |     if (!jniimg->image) {
 83 |         free(jniimg->data);
 84 |         free(jniimg);
 85 |         return 0;
 86 |     }
 87 |     return (jlong)jniimg;
 88 | }
 89 | 
 90 | JNIEXPORT jboolean JNICALL Java_org_pngquant_Image_addFixedColor(JNIEnv *env, jobject obj, jint r, jint g, jint b, jint a) {
 91 |     liq_color c = {r,g,b,a};
 92 |     return LIQ_OK == liq_image_add_fixed_color(((liq_jni_image*)handle(env,obj))->image, c);
 93 | }
 94 | 
 95 | JNIEXPORT jint JNICALL Java_org_pngquant_Image_getWidth(JNIEnv *env, jobject obj) {
 96 |     return liq_image_get_width(((liq_jni_image*)handle(env,obj))->image);
 97 | }
 98 | 
 99 | JNIEXPORT jint JNICALL Java_org_pngquant_Image_getHeight(JNIEnv *env, jobject obj) {
100 |     return liq_image_get_height(((liq_jni_image*)handle(env,obj))->image);
101 | }
102 | 
103 | JNIEXPORT void JNICALL Java_org_pngquant_Image_liq_1image_1destroy(JNIEnv *env, jclass class, jlong handle) {
104 |     liq_jni_image *jniimg = (liq_jni_image*)handle;
105 |     liq_image_destroy(jniimg->image);
106 |     free(jniimg->data);
107 |     free(jniimg);
108 | }
109 | 
110 | JNIEXPORT jlong JNICALL Java_org_pngquant_Result_liq_1quantize_1image(JNIEnv *env, jclass class, jlong attr, jlong handle) {
111 |     return (jlong)liq_quantize_image((liq_attr*)attr, ((liq_jni_image*)handle)->image);
112 | }
113 | 
114 | JNIEXPORT jboolean JNICALL Java_org_pngquant_Result_setDitheringLevel(JNIEnv *env, jobject obj, jfloat l) {
115 |     return LIQ_OK == liq_set_dithering_level(handle(env, obj), l);
116 | }
117 | 
118 | JNIEXPORT jboolean JNICALL Java_org_pngquant_Result_setGamma(JNIEnv *env, jobject obj, jdouble gamma) {
119 |     return LIQ_OK == liq_set_output_gamma(handle(env, obj), gamma);
120 | }
121 | 
122 | JNIEXPORT jdouble JNICALL Java_org_pngquant_Result_getGamma(JNIEnv *env, jobject obj) {
123 |     return liq_get_output_gamma(handle(env, obj));
124 | }
125 | 
126 | JNIEXPORT jboolean JNICALL Java_org_pngquant_Result_liq_1write_1remapped_1image(JNIEnv *env, jclass class, jlong result, jlong image_handle, jbyteArray bytearray) {
127 |     jsize size = (*env)->GetArrayLength(env, bytearray);
128 | 
129 |     jbyte *bitmap = (*env)->GetByteArrayElements(env, bytearray, 0);
130 |     liq_error err = liq_write_remapped_image((liq_result*)result, ((liq_jni_image*)image_handle)->image, bitmap, size);
131 |     (*env)->ReleaseByteArrayElements(env, bytearray, bitmap, 0);
132 | 
133 |     return LIQ_OK == err;
134 | }
135 | 
136 | JNIEXPORT jdouble JNICALL Java_org_pngquant_Result_getMeanSquareError(JNIEnv *env, jobject obj) {
137 |     return liq_get_quantization_error(handle(env, obj));
138 | }
139 | 
140 | JNIEXPORT jint JNICALL Java_org_pngquant_Result_getQuality(JNIEnv *env, jobject obj) {
141 |     return liq_get_quantization_quality(handle(env, obj));
142 | }
143 | 
144 | JNIEXPORT void JNICALL Java_org_pngquant_Result_liq_1result_1destroy(JNIEnv *env, jclass class, jlong result) {
145 |     return liq_result_destroy((liq_result*)result);
146 | }
147 | 
148 | JNIEXPORT jbyteArray JNICALL Java_org_pngquant_Result_liq_1get_1palette(JNIEnv *env, jclass class, jlong result) {
149 |     const liq_palette *pal = liq_get_palette((liq_result*)result);
150 |     jbyteArray arr = (*env)->NewByteArray(env, pal->count * 4);
151 |     int i;
152 |     for(i=0; i < pal->count; i++) {
153 |         (*env)->SetByteArrayRegion(env, arr, i*4, 4, ((jbyte*)&pal->entries[i]));
154 |     }
155 |     return arr;
156 | }
157 | 


--------------------------------------------------------------------------------
/pngquant/org/pngquant/PngQuant.java:
--------------------------------------------------------------------------------
  1 | package org.pngquant;
  2 | 
  3 | import org.pngquant.*;
  4 | import java.awt.image.*;
  5 | 
  6 | /**
  7 |  * Starting point for the library. Holds configuration. Equivalent of liq_attr* in libimagequant.
  8 |  */
  9 | public class PngQuant extends LiqObject {
 10 | 
 11 |     /**
 12 |      * Single instance can be "recycled" for many remappings.
 13 |      */
 14 |     public PngQuant() {
 15 |         handle = liq_attr_create();
 16 |     }
 17 | 
 18 |     public PngQuant(PngQuant other) {
 19 |         handle = liq_attr_copy(other.handle);
 20 |     }
 21 | 
 22 |     /**
 23 |      * 1-shot quantization and remapping with current settings.
 24 |      * @see quantize()
 25 |      *
 26 |      * @return 8-bit indexed image or null on failure
 27 |      */
 28 |     public BufferedImage getRemapped(BufferedImage bufimg) {
 29 |         try {
 30 |             Image liqimg = new Image(this, bufimg);
 31 |             BufferedImage remapped = getRemapped(liqimg);
 32 |             liqimg.close();
 33 |             return remapped;
 34 |         } catch(PngQuantException e) {
 35 |             return null;
 36 |         }
 37 |     }
 38 | 
 39 |     /** @return remapped image or null on failure */
 40 |     public BufferedImage getRemapped(Image liqimg) {
 41 |         Result result = quantize(liqimg);
 42 |         if (result == null) return null;
 43 |         BufferedImage remapped = result.getRemapped(liqimg);
 44 |         result.close();
 45 |         return remapped;
 46 |     }
 47 | 
 48 |     /**
 49 |      * Performs quantization (chooses optimal palette for the given Image).
 50 |      * Returned object can be used to customize remapping and reused to remap other images to the same palette.
 51 |      * @link http://pngquant.org/lib/#liq_quantize_image
 52 |      *
 53 |      * @return null on failure
 54 |      */
 55 |     public Result quantize(Image img) {
 56 |         try {
 57 |             return new Result(this, img);
 58 |         } catch(PngQuantException e) {
 59 |             return null;
 60 |         }
 61 |     }
 62 | 
 63 |     /**
 64 |      * Remapped images won't use more than given number of colors (may use less if setQuality() is used)
 65 |      *
 66 |      * @link http://pngquant.org/lib/#liq_set_max_colors
 67 |      */
 68 |     public native boolean setMaxColors(int colors);
 69 | 
 70 |     /**
 71 |      * Equivalent of setQuality(target/2, target)
 72 |      *
 73 |      * @link http://pngquant.org/lib/#liq_set_quality
 74 |      */
 75 |     public native boolean setQuality(int target);
 76 | 
 77 |     /**
 78 |      * Quality in range 0-100. Quantization will fail if minimum quality cannot
 79 |      * be achieved with given number of colors.
 80 |      *
 81 |      * @link http://pngquant.org/lib/#liq_set_quality
 82 |      */
 83 |     public native boolean setQuality(int min, int max);
 84 | 
 85 |     /**
 86 |      * Speed in range 1 (slowest) and 11 (fastest). 3 is the optimum.
 87 |      * Higher speeds quantize quicker, but at cost of quality and sometimes larger images.
 88 |      *
 89 |      * @link http://pngquant.org/lib/#liq_set_speed
 90 |      */
 91 |     public native boolean setSpeed(int speed);
 92 | 
 93 |     /**
 94 |      * Reduces color precision by truncating number of least significant bits.
 95 |      * Slightly improves speed and helps generating images for low-fidelity displays/textures.
 96 |      *
 97 |      * @link http://pngquant.org/lib/#liq_set_min_posterization
 98 |      */
 99 |     public native boolean setMinPosterization(int bits);
100 | 
101 |     public void close() {
102 |         if (handle != 0) {
103 |             liq_attr_destroy(handle);
104 |             handle = 0;
105 |         }
106 |     }
107 | 
108 |     private static native long liq_attr_create();
109 |     private static native long liq_attr_copy(long orig);
110 |     private static native void liq_attr_destroy(long handle);
111 | }
112 | 


--------------------------------------------------------------------------------
/pngquant/org/pngquant/PngQuantException.java:
--------------------------------------------------------------------------------
1 | package org.pngquant;
2 | 
3 | public class PngQuantException extends Exception {
4 | }
5 | 


--------------------------------------------------------------------------------
/pngquant/org/pngquant/Result.java:
--------------------------------------------------------------------------------
 1 | package org.pngquant;
 2 | 
 3 | import org.pngquant.*;
 4 | import java.awt.image.*;
 5 | 
 6 | /**
 7 |  * Quantization result that holds palette and options for remapping.
 8 |  */
 9 | public class Result extends LiqObject {
10 | 
11 |     /**
12 |      * Throws when quantization fails (e.g. due to failing to achieve minimum quality)
13 |      */
14 |     public Result(PngQuant pngquant, Image image) throws PngQuantException {
15 |         handle = liq_quantize_image(pngquant.handle, image.handle);
16 |         if (handle == 0) {
17 |             throw new PngQuantException();
18 |         }
19 |     }
20 | 
21 |     /**
22 |      * @return BufferedImage remapped to palette this Result has been created with or null on failure.
23 |      */
24 |     public BufferedImage getRemapped(Image orig_image) {
25 |         byte[] pal = liq_get_palette(handle);
26 |         IndexColorModel color = new IndexColorModel(8, pal.length/4, pal, 0, true);
27 |         BufferedImage img = new BufferedImage(
28 |             orig_image.getWidth(), orig_image.getHeight(),
29 |             BufferedImage.TYPE_BYTE_INDEXED, color);
30 | 
31 |         byte[] data = get8bitDataFromImage(img);
32 |         if (data == null) return null;
33 | 
34 |         if (!liq_write_remapped_image(handle, orig_image.handle, data)) return null;
35 | 
36 |         return img;
37 |     }
38 | 
39 |     /**
40 |      * Dithering strength. Floyd-Steinberg is always used and in
41 |      * speed settings 1-5 high-quality adaptive dithering is used.
42 |      * @see PngQuant.setSpeed()
43 |      * @link http://pngquant.org/lib/#liq_set_dithering_level
44 |      *
45 |      * @param dither_level Dithering in range 0 (none) and 1 (full)
46 |      */
47 |     public native boolean setDitheringLevel(float dither_level);
48 | 
49 |     /**
50 |      * The default is 0.45455 (1/2.2) which is PNG's approximation of sRGB.
51 |      */
52 |     public native boolean setGamma(double gamma);
53 |     public native double getGamma();
54 | 
55 |     /**
56 |      * Mean Square Error of remapping of image used to create this result.
57 |      * @link http://pngquant.org/lib/#liq_get_quantization_error
58 |      *
59 |      * @return MSE or -1 if not available
60 |      */
61 |     public native double getMeanSquareError();
62 | 
63 |     /**
64 |      * @link http://pngquant.org/lib/#liq_get_quantization_quality
65 |      * @return Actually achieved quality in 0-100 range on scale compatible with PngQuant.setQuality()
66 |      */
67 |     public native int getQuality();
68 | 
69 |     public void close() {
70 |         if (handle != 0) {
71 |             liq_result_destroy(handle);
72 |             handle = 0;
73 |         }
74 |     }
75 | 
76 |     private static byte[] get8bitDataFromImage(BufferedImage image) {
77 |         if (image.getType() == BufferedImage.TYPE_BYTE_INDEXED) {
78 |             DataBuffer buffer = image.getRaster().getDataBuffer();
79 |             if (buffer instanceof DataBufferByte) {
80 |                 return ((DataBufferByte)buffer).getData();
81 |             }
82 |         }
83 |         return null;
84 |     }
85 | 
86 |     private static native byte[] liq_get_palette(long handle);
87 |     private static native long liq_quantize_image(long attr, long image);
88 |     private static native boolean liq_write_remapped_image(long handle, long image, byte[] buffer);
89 |     private static native void liq_result_destroy(long handle);
90 | }
91 | 


--------------------------------------------------------------------------------
/pngquant/pam.c:
--------------------------------------------------------------------------------
  1 | /* pam.c - pam (portable alpha map) utility library
  2 | **
  3 | ** © 2009-2017 by Kornel Lesiński.
  4 | ** © 1989, 1991 by Jef Poskanzer.
  5 | ** © 1997, 2000, 2002 by Greg Roelofs; based on an idea by Stefan Schneider.
  6 | **
  7 | ** See COPYRIGHT file for license.
  8 | */
  9 | 
 10 | #include <stdlib.h>
 11 | #include <string.h>
 12 | 
 13 | #include "libimagequant.h"
 14 | #include "pam.h"
 15 | #include "mempool.h"
 16 | 
 17 | LIQ_PRIVATE bool pam_computeacolorhash(struct acolorhash_table *acht, const rgba_pixel *const pixels[], unsigned int cols, unsigned int rows, const unsigned char *importance_map)
 18 | {
 19 |     const unsigned int ignorebits = acht->ignorebits;
 20 |     const unsigned int channel_mask = 255U>>ignorebits<<ignorebits;
 21 |     const unsigned int channel_hmask = (255U>>ignorebits) ^ 0xFFU;
 22 |     const unsigned int posterize_mask = channel_mask << 24 | channel_mask << 16 | channel_mask << 8 | channel_mask;
 23 |     const unsigned int posterize_high_mask = channel_hmask << 24 | channel_hmask << 16 | channel_hmask << 8 | channel_hmask;
 24 | 
 25 |     const unsigned int hash_size = acht->hash_size;
 26 | 
 27 |     /* Go through the entire image, building a hash table of colors. */
 28 |     for(unsigned int row = 0; row < rows; ++row) {
 29 | 
 30 |         for(unsigned int col = 0; col < cols; ++col) {
 31 |             unsigned int boost;
 32 | 
 33 |             // RGBA color is casted to long for easier hasing/comparisons
 34 |             union rgba_as_int px = {pixels[row][col]};
 35 |             unsigned int hash;
 36 |             if (!px.rgba.a) {
 37 |                 // "dirty alpha" has different RGBA values that end up being the same fully transparent color
 38 |                 px.l=0; hash=0;
 39 | 
 40 |                 boost = 2000;
 41 |                 if (importance_map) {
 42 |                     importance_map++;
 43 |                 }
 44 |             } else {
 45 |                 // mask posterizes all 4 channels in one go
 46 |                 px.l = (px.l & posterize_mask) | ((px.l & posterize_high_mask) >> (8-ignorebits));
 47 |                 // fancier hashing algorithms didn't improve much
 48 |                 hash = px.l % hash_size;
 49 | 
 50 |                 if (importance_map) {
 51 |                     boost = *importance_map++;
 52 |                 } else {
 53 |                     boost = 255;
 54 |                 }
 55 |             }
 56 | 
 57 |             if (!pam_add_to_hash(acht, hash, boost, px, row, rows)) {
 58 |                 return false;
 59 |             }
 60 |         }
 61 | 
 62 |     }
 63 |     acht->cols = cols;
 64 |     acht->rows += rows;
 65 |     return true;
 66 | }
 67 | 
 68 | LIQ_PRIVATE bool pam_add_to_hash(struct acolorhash_table *acht, unsigned int hash, unsigned int boost, union rgba_as_int px, unsigned int row, unsigned int rows)
 69 | {
 70 |             /* head of the hash function stores first 2 colors inline (achl->used = 1..2),
 71 |                to reduce number of allocations of achl->other_items.
 72 |              */
 73 |             struct acolorhist_arr_head *achl = &acht->buckets[hash];
 74 |             if (achl->inline1.color.l == px.l && achl->used) {
 75 |                 achl->inline1.perceptual_weight += boost;
 76 |                 return true;
 77 |             }
 78 |             if (achl->used) {
 79 |                 if (achl->used > 1) {
 80 |                     if (achl->inline2.color.l == px.l) {
 81 |                         achl->inline2.perceptual_weight += boost;
 82 |                         return true;
 83 |                     }
 84 |                     // other items are stored as an array (which gets reallocated if needed)
 85 |                     struct acolorhist_arr_item *other_items = achl->other_items;
 86 |                     unsigned int i = 0;
 87 |                     for (; i < achl->used-2; i++) {
 88 |                         if (other_items[i].color.l == px.l) {
 89 |                             other_items[i].perceptual_weight += boost;
 90 |                             return true;
 91 |                         }
 92 |                     }
 93 | 
 94 |                     // the array was allocated with spare items
 95 |                     if (i < achl->capacity) {
 96 |                         other_items[i] = (struct acolorhist_arr_item){
 97 |                             .color = px,
 98 |                             .perceptual_weight = boost,
 99 |                         };
100 |                         achl->used++;
101 |                         ++acht->colors;
102 |                         return true;
103 |                     }
104 | 
105 |                     if (++acht->colors > acht->maxcolors) {
106 |                         return false;
107 |                     }
108 | 
109 |                     struct acolorhist_arr_item *new_items;
110 |                     unsigned int capacity;
111 |                     if (!other_items) { // there was no array previously, alloc "small" array
112 |                         capacity = 8;
113 |                         if (acht->freestackp <= 0) {
114 |                             // estimate how many colors are going to be + headroom
115 |                             const size_t mempool_size = ((acht->rows + rows-row) * 2 * acht->colors / (acht->rows + row + 1) + 1024) * sizeof(struct acolorhist_arr_item);
116 |                             new_items = mempool_alloc(&acht->mempool, sizeof(struct acolorhist_arr_item)*capacity, mempool_size);
117 |                         } else {
118 |                             // freestack stores previously freed (reallocated) arrays that can be reused
119 |                             // (all pesimistically assumed to be capacity = 8)
120 |                             new_items = acht->freestack[--acht->freestackp];
121 |                         }
122 |                     } else {
123 |                         const unsigned int stacksize = sizeof(acht->freestack)/sizeof(acht->freestack[0]);
124 | 
125 |                         // simply reallocs and copies array to larger capacity
126 |                         capacity = achl->capacity*2 + 16;
127 |                         if (acht->freestackp < stacksize-1) {
128 |                             acht->freestack[acht->freestackp++] = other_items;
129 |                         }
130 |                         const size_t mempool_size = ((acht->rows + rows-row) * 2 * acht->colors / (acht->rows + row + 1) + 32*capacity) * sizeof(struct acolorhist_arr_item);
131 |                         new_items = mempool_alloc(&acht->mempool, sizeof(struct acolorhist_arr_item)*capacity, mempool_size);
132 |                         if (!new_items) return false;
133 |                         memcpy(new_items, other_items, sizeof(other_items[0])*achl->capacity);
134 |                     }
135 | 
136 |                     achl->other_items = new_items;
137 |                     achl->capacity = capacity;
138 |                     new_items[i] = (struct acolorhist_arr_item){
139 |                         .color = px,
140 |                         .perceptual_weight = boost,
141 |                     };
142 |                     achl->used++;
143 |                 } else {
144 |                     // these are elses for first checks whether first and second inline-stored colors are used
145 |                     achl->inline2.color.l = px.l;
146 |                     achl->inline2.perceptual_weight = boost;
147 |                     achl->used = 2;
148 |                     ++acht->colors;
149 |                 }
150 |             } else {
151 |                 achl->inline1.color.l = px.l;
152 |                 achl->inline1.perceptual_weight = boost;
153 |                 achl->used = 1;
154 |                 ++acht->colors;
155 |             }
156 |     return true;
157 | }
158 | 
159 | LIQ_PRIVATE struct acolorhash_table *pam_allocacolorhash(unsigned int maxcolors, unsigned int surface, unsigned int ignorebits, void* (*malloc)(size_t), void (*free)(void*))
160 | {
161 |     const size_t estimated_colors = MIN(maxcolors, surface/(ignorebits + (surface > 512*512 ? 6 : 5)));
162 |     const size_t hash_size = estimated_colors < 66000 ? 6673 : (estimated_colors < 200000 ? 12011 : 24019);
163 | 
164 |     mempoolptr m = NULL;
165 |     const size_t buckets_size = hash_size * sizeof(struct acolorhist_arr_head);
166 |     const size_t mempool_size = sizeof(struct acolorhash_table) + buckets_size + estimated_colors * sizeof(struct acolorhist_arr_item);
167 |     struct acolorhash_table *t = mempool_create(&m, sizeof(*t) + buckets_size, mempool_size, malloc, free);
168 |     if (!t) return NULL;
169 |     *t = (struct acolorhash_table){
170 |         .mempool = m,
171 |         .hash_size = hash_size,
172 |         .maxcolors = maxcolors,
173 |         .ignorebits = ignorebits,
174 |     };
175 |     memset(t->buckets, 0, buckets_size);
176 |     return t;
177 | }
178 | 
179 | ALWAYS_INLINE static float pam_add_to_hist(const float *gamma_lut, hist_item *achv, unsigned int *j, const struct acolorhist_arr_item *entry, const float max_perceptual_weight)
180 | {
181 |     if (entry->perceptual_weight == 0) {
182 |         return 0;
183 |     }
184 |     const float w = MIN(entry->perceptual_weight/128.f, max_perceptual_weight);
185 |     achv[*j].adjusted_weight = achv[*j].perceptual_weight = w;
186 |     achv[*j].acolor = rgba_to_f(gamma_lut, entry->color.rgba);
187 |     *j += 1;
188 |     return w;
189 | }
190 | 
191 | LIQ_PRIVATE histogram *pam_acolorhashtoacolorhist(const struct acolorhash_table *acht, const double gamma, void* (*malloc)(size_t), void (*free)(void*))
192 | {
193 |     histogram *hist = malloc(sizeof(hist[0]));
194 |     if (!hist || !acht) return NULL;
195 |     *hist = (histogram){
196 |         .achv = malloc(MAX(1,acht->colors) * sizeof(hist->achv[0])),
197 |         .size = acht->colors,
198 |         .free = free,
199 |         .ignorebits = acht->ignorebits,
200 |     };
201 |     if (!hist->achv) return NULL;
202 | 
203 |     float gamma_lut[256];
204 |     to_f_set_gamma(gamma_lut, gamma);
205 | 
206 |     /* Limit perceptual weight to 1/10th of the image surface area to prevent
207 |        a single color from dominating all others. */
208 |     float max_perceptual_weight = 0.1f * acht->cols * acht->rows;
209 |     double total_weight = 0;
210 | 
211 |     unsigned int j=0;
212 |     for(unsigned int i=0; i < acht->hash_size; ++i) {
213 |         const struct acolorhist_arr_head *const achl = &acht->buckets[i];
214 |         if (achl->used) {
215 |             total_weight += pam_add_to_hist(gamma_lut, hist->achv, &j, &achl->inline1, max_perceptual_weight);
216 | 
217 |             if (achl->used > 1) {
218 |                 total_weight += pam_add_to_hist(gamma_lut, hist->achv, &j, &achl->inline2, max_perceptual_weight);
219 | 
220 |                 for(unsigned int k=0; k < achl->used-2; k++) {
221 |                     total_weight += pam_add_to_hist(gamma_lut, hist->achv, &j, &achl->other_items[k], max_perceptual_weight);
222 |                 }
223 |             }
224 |         }
225 |     }
226 |     hist->size = j;
227 |     hist->total_perceptual_weight = total_weight;
228 |     if (!j) {
229 |         pam_freeacolorhist(hist);
230 |         return NULL;
231 |     }
232 |     return hist;
233 | }
234 | 
235 | 
236 | LIQ_PRIVATE void pam_freeacolorhash(struct acolorhash_table *acht)
237 | {
238 |     if (acht) {
239 |         mempool_destroy(acht->mempool);
240 |     }
241 | }
242 | 
243 | LIQ_PRIVATE void pam_freeacolorhist(histogram *hist)
244 | {
245 |     hist->free(hist->achv);
246 |     hist->free(hist);
247 | }
248 | 
249 | LIQ_PRIVATE colormap *pam_colormap(unsigned int colors, void* (*malloc)(size_t), void (*free)(void*))
250 | {
251 |     assert(colors > 0 && colors < 65536);
252 | 
253 |     colormap *map;
254 |     const size_t colors_size = colors * sizeof(map->palette[0]);
255 |     map = malloc(sizeof(colormap) + colors_size);
256 |     if (!map) return NULL;
257 |     *map = (colormap){
258 |         .malloc = malloc,
259 |         .free = free,
260 |         .colors = colors,
261 |     };
262 |     memset(map->palette, 0, colors_size);
263 |     return map;
264 | }
265 | 
266 | LIQ_PRIVATE colormap *pam_duplicate_colormap(colormap *map)
267 | {
268 |     colormap *dupe = pam_colormap(map->colors, map->malloc, map->free);
269 |     for(unsigned int i=0; i < map->colors; i++) {
270 |         dupe->palette[i] = map->palette[i];
271 |     }
272 |     return dupe;
273 | }
274 | 
275 | LIQ_PRIVATE void pam_freecolormap(colormap *c)
276 | {
277 |     c->free(c);
278 | }
279 | 
280 | LIQ_PRIVATE void to_f_set_gamma(float gamma_lut[], const double gamma)
281 | {
282 |     for(int i=0; i < 256; i++) {
283 |         gamma_lut[i] = pow((double)i/255.0, internal_gamma/gamma);
284 |     }
285 | }
286 | 
287 | 


--------------------------------------------------------------------------------
/pngquant/pam.h:
--------------------------------------------------------------------------------
  1 | /* pam.h - pam (portable alpha map) utility library
  2 |  **
  3 |  ** Colormap routines.
  4 |  **
  5 |  ** Copyright (C) 1989, 1991 by Jef Poskanzer.
  6 |  ** Copyright (C) 1997 by Greg Roelofs.
  7 |  **
  8 |  ** Permission to use, copy, modify, and distribute this software and its
  9 |  ** documentation for any purpose and without fee is hereby granted, provided
 10 |  ** that the above copyright notice appear in all copies and that both that
 11 |  ** copyright notice and this permission notice appear in supporting
 12 |  ** documentation.  This software is provided "as is" without express or
 13 |  ** implied warranty.
 14 |  */
 15 | 
 16 | #ifndef PAM_H
 17 | #define PAM_H
 18 | 
 19 | // accidental debug assertions make color search much slower,
 20 | // so force assertions off if there's no explicit setting
 21 | #if !defined(NDEBUG) && !defined(DEBUG)
 22 | #define NDEBUG
 23 | #endif
 24 | 
 25 | #include <math.h>
 26 | #include <assert.h>
 27 | #include <stdlib.h>
 28 | #include <stdbool.h>
 29 | 
 30 | #ifndef MAX
 31 | #  define MAX(a,b)  ((a) > (b)? (a) : (b))
 32 | #  define MIN(a,b)  ((a) < (b)? (a) : (b))
 33 | #endif
 34 | 
 35 | #define MAX_DIFF 1e20
 36 | 
 37 | #ifndef USE_SSE
 38 | #  if defined(__SSE__) && (defined(__amd64__) || defined(__X86_64__) || defined(_WIN64) || defined(WIN32) || defined(__WIN32__))
 39 | #    define USE_SSE 1
 40 | #  else
 41 | #    define USE_SSE 0
 42 | #  endif
 43 | #endif
 44 | 
 45 | #if USE_SSE
 46 | #  include <xmmintrin.h>
 47 | #  ifdef _MSC_VER
 48 | #    include <intrin.h>
 49 | #    define SSE_ALIGN
 50 | #  else
 51 | #    define SSE_ALIGN __attribute__ ((aligned (16)))
 52 | #    if defined(__i386__) && defined(__PIC__)
 53 | #       define cpuid(func,ax,bx,cx,dx)\
 54 |         __asm__ __volatile__ ( \
 55 |         "push %%ebx\n" \
 56 |         "cpuid\n" \
 57 |         "mov %%ebx, %1\n" \
 58 |         "pop %%ebx\n" \
 59 |         : "=a" (ax), "=r" (bx), "=c" (cx), "=d" (dx) \
 60 |         : "a" (func));
 61 | #    else
 62 | #       define cpuid(func,ax,bx,cx,dx)\
 63 |         __asm__ __volatile__ ("cpuid":\
 64 |         "=a" (ax), "=b" (bx), "=c" (cx), "=d" (dx) : "a" (func));
 65 | #    endif
 66 | #endif
 67 | #else
 68 | #  define SSE_ALIGN
 69 | #endif
 70 | 
 71 | #ifndef _MSC_VER
 72 | #define LIQ_ARRAY(type, var, count) type var[count]
 73 | #else
 74 | #define LIQ_ARRAY(type, var, count) type* var = (type*)_alloca(sizeof(type)*(count))
 75 | #endif
 76 | 
 77 | #if defined(__GNUC__) || defined (__llvm__)
 78 | #define ALWAYS_INLINE __attribute__((always_inline)) inline
 79 | #define NEVER_INLINE __attribute__ ((noinline))
 80 | #elif defined(_MSC_VER)
 81 | #define inline __inline
 82 | #define restrict __restrict
 83 | #define ALWAYS_INLINE __forceinline
 84 | #define NEVER_INLINE __declspec(noinline)
 85 | #else
 86 | #define ALWAYS_INLINE inline
 87 | #define NEVER_INLINE
 88 | #endif
 89 | 
 90 | /* from pam.h */
 91 | 
 92 | typedef struct {
 93 |     unsigned char r, g, b, a;
 94 | } rgba_pixel;
 95 | 
 96 | typedef struct {
 97 |     float a, r, g, b;
 98 | } SSE_ALIGN f_pixel;
 99 | 
100 | static const float internal_gamma = 0.5499f;
101 | 
102 | LIQ_PRIVATE void to_f_set_gamma(float gamma_lut[], const double gamma);
103 | 
104 | /**
105 |  Converts 8-bit color to internal gamma and premultiplied alpha.
106 |  (premultiplied color space is much better for blending of semitransparent colors)
107 |  */
108 | ALWAYS_INLINE static f_pixel rgba_to_f(const float gamma_lut[], const rgba_pixel px);
109 | inline static f_pixel rgba_to_f(const float gamma_lut[], const rgba_pixel px)
110 | {
111 |     float a = px.a/255.f;
112 | 
113 |     return (f_pixel) {
114 |         .a = a,
115 |         .r = gamma_lut[px.r]*a,
116 |         .g = gamma_lut[px.g]*a,
117 |         .b = gamma_lut[px.b]*a,
118 |     };
119 | }
120 | 
121 | inline static rgba_pixel f_to_rgb(const float gamma, const f_pixel px)
122 | {
123 |     if (px.a < 1.f/256.f) {
124 |         return (rgba_pixel){0,0,0,0};
125 |     }
126 | 
127 |     float r = px.r / px.a,
128 |           g = px.g / px.a,
129 |           b = px.b / px.a,
130 |           a = px.a;
131 | 
132 |     r = powf(r, gamma/internal_gamma);
133 |     g = powf(g, gamma/internal_gamma);
134 |     b = powf(b, gamma/internal_gamma);
135 | 
136 |     // 256, because numbers are in range 1..255.9999… rounded down
137 |     r *= 256.f;
138 |     g *= 256.f;
139 |     b *= 256.f;
140 |     a *= 256.f;
141 | 
142 |     return (rgba_pixel){
143 |         .r = r>=255.f ? 255 : r,
144 |         .g = g>=255.f ? 255 : g,
145 |         .b = b>=255.f ? 255 : b,
146 |         .a = a>=255.f ? 255 : a,
147 |     };
148 | }
149 | 
150 | ALWAYS_INLINE static double colordifference_ch(const double x, const double y, const double alphas);
151 | inline static double colordifference_ch(const double x, const double y, const double alphas)
152 | {
153 |     // maximum of channel blended on white, and blended on black
154 |     // premultiplied alpha and backgrounds 0/1 shorten the formula
155 |     const double black = x-y, white = black+alphas;
156 |     return MAX(black*black, white*white);
157 | }
158 | 
159 | ALWAYS_INLINE static float colordifference_stdc(const f_pixel px, const f_pixel py);
160 | inline static float colordifference_stdc(const f_pixel px, const f_pixel py)
161 | {
162 |     // px_b.rgb = px.rgb + 0*(1-px.a) // blend px on black
163 |     // px_b.a   = px.a   + 1*(1-px.a)
164 |     // px_w.rgb = px.rgb + 1*(1-px.a) // blend px on white
165 |     // px_w.a   = px.a   + 1*(1-px.a)
166 | 
167 |     // px_b.rgb = px.rgb              // difference same as in opaque RGB
168 |     // px_b.a   = 1
169 |     // px_w.rgb = px.rgb - px.a       // difference simplifies to formula below
170 |     // px_w.a   = 1
171 | 
172 |     // (px.rgb - px.a) - (py.rgb - py.a)
173 |     // (px.rgb - py.rgb) + (py.a - px.a)
174 | 
175 |     const double alphas = py.a-px.a;
176 |     return colordifference_ch(px.r, py.r, alphas) +
177 |            colordifference_ch(px.g, py.g, alphas) +
178 |            colordifference_ch(px.b, py.b, alphas);
179 | }
180 | 
181 | ALWAYS_INLINE static float colordifference(f_pixel px, f_pixel py);
182 | inline static float colordifference(f_pixel px, f_pixel py)
183 | {
184 | #if USE_SSE
185 |     const __m128 vpx = _mm_load_ps((const float*)&px);
186 |     const __m128 vpy = _mm_load_ps((const float*)&py);
187 | 
188 |     // y.a - x.a
189 |     __m128 alphas = _mm_sub_ss(vpy, vpx);
190 |     alphas = _mm_shuffle_ps(alphas,alphas,0); // copy first to all four
191 | 
192 |     __m128 onblack = _mm_sub_ps(vpx, vpy); // x - y
193 |     __m128 onwhite = _mm_add_ps(onblack, alphas); // x - y + (y.a - x.a)
194 | 
195 |     onblack = _mm_mul_ps(onblack, onblack);
196 |     onwhite = _mm_mul_ps(onwhite, onwhite);
197 |     const __m128 max = _mm_max_ps(onwhite, onblack);
198 | 
199 |     // add rgb, not a
200 |     const __m128 maxhl = _mm_movehl_ps(max, max);
201 |     const __m128 tmp = _mm_add_ps(max, maxhl);
202 |     const __m128 sum = _mm_add_ss(maxhl, _mm_shuffle_ps(tmp, tmp, 1));
203 | 
204 |     const float res = _mm_cvtss_f32(sum);
205 |     assert(fabs(res - colordifference_stdc(px,py)) < 0.001);
206 |     return res;
207 | #else
208 |     return colordifference_stdc(px,py);
209 | #endif
210 | }
211 | 
212 | /* from pamcmap.h */
213 | union rgba_as_int {
214 |     rgba_pixel rgba;
215 |     unsigned int l;
216 | };
217 | 
218 | typedef struct {
219 |     f_pixel acolor;
220 |     float adjusted_weight,   // perceptual weight changed to tweak how mediancut selects colors
221 |           perceptual_weight; // number of pixels weighted by importance of different areas of the picture
222 | 
223 |     float color_weight;      // these two change every time histogram subset is sorted
224 |     union {
225 |         unsigned int sort_value;
226 |         unsigned char likely_colormap_index;
227 |     } tmp;
228 | } hist_item;
229 | 
230 | typedef struct {
231 |     hist_item *achv;
232 |     void (*free)(void*);
233 |     double total_perceptual_weight;
234 |     unsigned int size;
235 |     unsigned int ignorebits;
236 | } histogram;
237 | 
238 | typedef struct {
239 |     f_pixel acolor;
240 |     float popularity;
241 |     bool fixed; // if true it's user-supplied and must not be changed (e.g in K-Means iteration)
242 | } colormap_item;
243 | 
244 | typedef struct colormap {
245 |     unsigned int colors;
246 |     void* (*malloc)(size_t);
247 |     void (*free)(void*);
248 |     colormap_item palette[];
249 | } colormap;
250 | 
251 | struct acolorhist_arr_item {
252 |     union rgba_as_int color;
253 |     unsigned int perceptual_weight;
254 | };
255 | 
256 | struct acolorhist_arr_head {
257 |     struct acolorhist_arr_item inline1, inline2;
258 |     unsigned int used, capacity;
259 |     struct acolorhist_arr_item *other_items;
260 | };
261 | 
262 | struct acolorhash_table {
263 |     struct mempool *mempool;
264 |     unsigned int ignorebits, maxcolors, colors, cols, rows;
265 |     unsigned int hash_size;
266 |     unsigned int freestackp;
267 |     struct acolorhist_arr_item *freestack[512];
268 |     struct acolorhist_arr_head buckets[];
269 | };
270 | 
271 | LIQ_PRIVATE void pam_freeacolorhash(struct acolorhash_table *acht);
272 | LIQ_PRIVATE struct acolorhash_table *pam_allocacolorhash(unsigned int maxcolors, unsigned int surface, unsigned int ignorebits, void* (*malloc)(size_t), void (*free)(void*));
273 | LIQ_PRIVATE histogram *pam_acolorhashtoacolorhist(const struct acolorhash_table *acht, const double gamma, void* (*malloc)(size_t), void (*free)(void*));
274 | LIQ_PRIVATE bool pam_computeacolorhash(struct acolorhash_table *acht, const rgba_pixel *const pixels[], unsigned int cols, unsigned int rows, const unsigned char *importance_map);
275 | LIQ_PRIVATE bool pam_add_to_hash(struct acolorhash_table *acht, unsigned int hash, unsigned int boost, union rgba_as_int px, unsigned int row, unsigned int rows);
276 | 
277 | LIQ_PRIVATE void pam_freeacolorhist(histogram *h);
278 | 
279 | LIQ_PRIVATE colormap *pam_colormap(unsigned int colors, void* (*malloc)(size_t), void (*free)(void*));
280 | LIQ_PRIVATE colormap *pam_duplicate_colormap(colormap *map);
281 | LIQ_PRIVATE void pam_freecolormap(colormap *c);
282 | 
283 | #endif
284 | 


--------------------------------------------------------------------------------
/pngquant/pom.xml:
--------------------------------------------------------------------------------
 1 | <project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
 2 |   xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/maven-v4_0_0.xsd">
 3 |   <modelVersion>4.0.0</modelVersion>
 4 |   <groupId>org.pngquant</groupId>
 5 |   <artifactId>libimagequant</artifactId>
 6 |   <packaging>jar</packaging>
 7 |   <version>2.1.1</version>
 8 |   <name>pngquant</name>
 9 |   <url>http://pngquant.org</url>
10 |   <build>
11 |     <sourceDirectory>.</sourceDirectory>
12 |     <plugins>
13 |        <plugin>
14 |           <groupId>org.codehaus.mojo</groupId>
15 |           <artifactId>exec-maven-plugin</artifactId>
16 |           <version>1.1</version>
17 |           <executions>
18 |             <execution>
19 |               <id>build</id>
20 |               <phase>compile</phase>
21 |               <goals><goal>exec</goal></goals>
22 |               <configuration>
23 |               <executable>make</executable>
24 |               <arguments>
25 |                 <argument>-j8</argument>
26 |                 <argument>USE_SSE=1</argument>
27 |                 <argument>java</argument>
28 |               </arguments>
29 |               </configuration>
30 |             </execution>
31 |             <execution>
32 |               <id>clean</id>
33 |               <phase>clean</phase>
34 |               <goals><goal>exec</goal></goals>
35 |               <configuration>
36 |               <executable>make</executable>
37 |               <arguments>
38 |                 <argument>clean</argument>
39 |               </arguments>
40 |               </configuration>
41 |             </execution>
42 |           </executions>
43 |         </plugin>
44 |     </plugins>
45 |   </build>
46 |   <profiles>
47 |     <profile>
48 |       <id>mac-x64</id>
49 |       <activation>
50 |       <os>
51 |         <family>Mac</family>
52 |         <arch>x64</arch>
53 |       </os>
54 |       </activation>
55 |       <dependencies>
56 |         <dependency>
57 |           <groupId>org.pngquant</groupId>
58 |           <artifactId>libimagequant-jni</artifactId>
59 |           <version>1</version>
60 |           <type>jnilib</type>
61 |           <classifier>mac-x64</classifier>
62 |         </dependency>
63 |       </dependencies>
64 |     </profile>
65 |     <profile>
66 |       <id>linux-x64</id>
67 |       <activation>
68 |         <os>
69 |           <family>unix</family>
70 |           <name>Linux</name>
71 |           <arch>x64</arch>
72 |         </os>
73 |       </activation>
74 |       <dependencies>
75 |         <dependency>
76 |           <groupId>org.pngquant</groupId>
77 |           <artifactId>libimagequant-jni</artifactId>
78 |           <type>so</type>
79 |           <version>1</version>
80 |           <classifier>linux-x64</classifier>
81 |         </dependency>
82 |       </dependencies>
83 |     </profile>
84 | </profiles>
85 | <dependencies>
86 | </dependencies>
87 | </project>
88 | 


--------------------------------------------------------------------------------
/pngquant/rust/build.rs:
--------------------------------------------------------------------------------
 1 | //! This is a build script for Cargo https://crates.io/
 2 | //! It produces a static library that can be used by C or Rust.
 3 | 
 4 | extern crate cc;
 5 | 
 6 | use std::env;
 7 | use std::path::PathBuf;
 8 | use std::fs::canonicalize;
 9 | 
10 | fn main() {
11 |     let mut cc = cc::Build::new();
12 |     let compiler = cc.get_compiler();
13 |     cc.warnings(false);
14 | 
15 |     if env::var("PROFILE").map(|p|p != "debug").unwrap_or(true) {
16 |         cc.define("NDEBUG", Some("1"));
17 |     } else {
18 |         cc.define("DEBUG", Some("1"));
19 |     }
20 | 
21 |     if cfg!(feature = "openmp") {
22 |         cc.flag(&env::var("DEP_OPENMP_FLAG").unwrap());
23 |     }
24 | 
25 |     let target_arch = env::var("CARGO_CFG_TARGET_ARCH").expect("Needs CARGO_CFG_TARGET_ARCH");
26 |     if target_arch =="x86_64" ||
27 |        (target_arch == "x86" && cfg!(feature = "sse")) {
28 |         cc.flag(if compiler.is_like_msvc() {"/arch:SSE2"} else {"-msse"});
29 |         cc.define("USE_SSE", Some("1"));
30 |     }
31 | 
32 |     let outdated_c_compiler = env::var("TARGET").unwrap().contains("windows-msvc");
33 |     let has_msvc_files = PathBuf::from("msvc-dist/libimagequant.c").exists();
34 | 
35 |     if outdated_c_compiler && has_msvc_files {
36 |         println!("cargo:include={}", canonicalize("msvc-dist").unwrap().display());
37 |         cc.file("msvc-dist/libimagequant.c")
38 |             .file("msvc-dist/nearest.c")
39 |             .file("msvc-dist/kmeans.c")
40 |             .file("msvc-dist/mediancut.c")
41 |             .file("msvc-dist/mempool.c")
42 |             .file("msvc-dist/pam.c")
43 |             .file("msvc-dist/blur.c");
44 |     } else {
45 |         // This is so that I don't forget to publish MSVC version as well
46 |         if !has_msvc_files {
47 |             println!("cargo:warning=msvc-dist/ directory not present. MSVC builds may fail");
48 |         }
49 |         println!("cargo:include={}", canonicalize(".").unwrap().display());
50 |         if !compiler.is_like_msvc() {
51 |             cc.flag("-std=c99");
52 |         }
53 |         cc.file("libimagequant.c")
54 |             .file("nearest.c")
55 |             .file("kmeans.c")
56 |             .file("mediancut.c")
57 |             .file("mempool.c")
58 |             .file("pam.c")
59 |             .file("blur.c");
60 |     }
61 | 
62 |     cc.compile("libimagequant.a");
63 | }
64 | 


--------------------------------------------------------------------------------
/pngquant/rust/libimagequant.rs:
--------------------------------------------------------------------------------
  1 | //! Small, portable C library for high-quality conversion of RGBA images to 8-bit indexed-color (palette) images.
  2 | //! It's powering [pngquant2](https://pngquant.org).
  3 | //!
  4 | //! This is a low-level crate exposing a C API. If you're looking for a Rust library, see [imagequant](https://crates.io/crates/imagequant).
  5 | //!
  6 | //! ## License
  7 | //!
  8 | //! Libimagequant is dual-licensed:
  9 | //!
 10 | //! * For Free/Libre Open Source Software it's available under [GPL v3 or later](https://raw.github.com/ImageOptim/libimagequant/master/COPYRIGHT) with additional copyright notices for older parts of the code.
 11 | //!
 12 | //! * For use in non-GPL software (e.g. closed-source or App Store distribution) please ask kornel@pngquant.org for a commercial license.
 13 | //!
 14 | //! ## Overview
 15 | //!
 16 | //! The basic flow is:
 17 | //!
 18 | //! 1. Create attributes object and configure the library.
 19 | //! 2. Create image object from RGBA pixels or data source.
 20 | //! 3. Perform quantization (generate palette).
 21 | //! 4. Store remapped image and final palette.
 22 | //! 5. Free memory.
 23 | //!
 24 | //! Please note that libimagequant only handles raw uncompressed arrays of pixels in memory and is completely independent of any file format.
 25 | //!
 26 | //! There are 3 ways to create image object for quantization:
 27 | //!
 28 | //!   * `liq_image_create_rgba()` for simple, contiguous RGBA pixel arrays (width×height×4 bytes large bitmap).
 29 | //!   * `liq_image_create_rgba_rows()` for non-contiguous RGBA pixel arrays (that have padding between rows or reverse order, e.g. BMP).
 30 | //!   * `liq_image_create_custom()` for RGB, ABGR, YUV and all other formats that can be converted on-the-fly to RGBA (you have to supply the conversion function).
 31 | //!
 32 | //! Note that "image" here means raw uncompressed pixels. If you have a compressed image file, such as PNG, you must use another library (e.g. lodepng) to decode it first.
 33 | 
 34 | #![allow(non_camel_case_types)]
 35 | 
 36 | #[cfg(feature = "openmp")]
 37 | extern crate openmp_sys;
 38 | 
 39 | use std::os::raw::{c_int, c_uint, c_char, c_void};
 40 | use std::error;
 41 | use std::fmt;
 42 | use std::error::Error;
 43 | 
 44 | pub enum liq_attr {}
 45 | pub enum liq_image {}
 46 | pub enum liq_result {}
 47 | pub enum liq_histogram {}
 48 | pub type liq_color = rgb::RGBA8;
 49 | 
 50 | #[repr(C)]
 51 | #[derive(Copy, Clone, Debug, Eq, PartialEq)]
 52 | pub enum liq_error {
 53 |     LIQ_OK = 0,
 54 |     LIQ_QUALITY_TOO_LOW = 99,
 55 |     LIQ_VALUE_OUT_OF_RANGE = 100,
 56 |     LIQ_OUT_OF_MEMORY,
 57 |     LIQ_ABORTED,
 58 |     LIQ_BITMAP_NOT_AVAILABLE,
 59 |     LIQ_BUFFER_TOO_SMALL,
 60 |     LIQ_INVALID_POINTER,
 61 |     LIQ_UNSUPPORTED,
 62 | }
 63 | 
 64 | #[repr(C)]
 65 | #[derive(Copy, Clone)]
 66 | pub enum liq_ownership {
 67 |     LIQ_OWN_ROWS = 4,
 68 |     LIQ_OWN_PIXELS = 8,
 69 |     LIQ_COPY_PIXELS = 16,
 70 | }
 71 | 
 72 | #[repr(C)]
 73 | pub struct liq_palette {
 74 |     pub count: c_int,
 75 |     pub entries: [liq_color; 256],
 76 | }
 77 | 
 78 | #[repr(C)]
 79 | #[derive(Debug, Copy, Clone)]
 80 | pub struct liq_histogram_entry {
 81 |     pub color: liq_color,
 82 |     pub count: c_uint,
 83 | }
 84 | 
 85 | impl error::Error for liq_error {
 86 |     fn description(&self) -> &str {
 87 |         match *self {
 88 |             liq_error::LIQ_OK => "OK",
 89 |             liq_error::LIQ_QUALITY_TOO_LOW => "LIQ_QUALITY_TOO_LOW",
 90 |             liq_error::LIQ_VALUE_OUT_OF_RANGE => "VALUE_OUT_OF_RANGE",
 91 |             liq_error::LIQ_OUT_OF_MEMORY => "OUT_OF_MEMORY",
 92 |             liq_error::LIQ_ABORTED => "LIQ_ABORTED",
 93 |             liq_error::LIQ_BITMAP_NOT_AVAILABLE => "BITMAP_NOT_AVAILABLE",
 94 |             liq_error::LIQ_BUFFER_TOO_SMALL => "BUFFER_TOO_SMALL",
 95 |             liq_error::LIQ_INVALID_POINTER => "INVALID_POINTER",
 96 |             liq_error::LIQ_UNSUPPORTED => "LIQ_UNSUPPORTED",
 97 |         }
 98 |     }
 99 | }
100 | 
101 | impl fmt::Display for liq_error {
102 |     fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
103 |         write!(f, "{}", self.description())
104 |     }
105 | }
106 | 
107 | impl liq_error {
108 |     #[inline]
109 |     pub fn is_ok(&self) -> bool {
110 |         *self == liq_error::LIQ_OK
111 |     }
112 | 
113 |     pub fn is_err(&self) -> bool {
114 |         !self.is_ok()
115 |     }
116 | 
117 |     #[inline]
118 |     pub fn ok(&self) -> Result<(), liq_error> {
119 |         match *self {
120 |             liq_error::LIQ_OK => Ok(()),
121 |             e => Err(e),
122 |         }
123 |     }
124 | 
125 |     #[inline]
126 |     pub fn ok_or<E>(self, err: E) -> Result<(), E> {
127 |         if self.is_ok() {
128 |             Ok(())
129 |         } else {
130 |             Err(err)
131 |         }
132 |     }
133 | 
134 |     pub fn unwrap(&self) {
135 |         assert!(self.is_ok(), "{}", self);
136 |     }
137 | 
138 |     pub fn expect(&self, msg: &str) {
139 |         assert!(self.is_ok(), "{}", msg);
140 |     }
141 | }
142 | 
143 | pub type liq_log_callback_function = Option<unsafe extern "C" fn(arg1: &liq_attr, message: *const c_char, user_info: *mut c_void)>;
144 | pub type liq_log_flush_callback_function = Option<unsafe extern "C" fn(arg1: &liq_attr, user_info: *mut c_void)>;
145 | pub type liq_progress_callback_function = Option<unsafe extern "C" fn(progress_percent: f32, user_info: *mut c_void) -> c_int>;
146 | pub type liq_image_get_rgba_row_callback = unsafe extern "C" fn(row_out: *mut liq_color, row: c_int, width: c_int, user_info: *mut c_void);
147 | 
148 | #[link(name="imagequant", kind="static")]
149 | extern "C" {
150 | 
151 |     /// Returns object that will hold initial settings (attributes) for the library.
152 |     ///
153 |     /// The object should be freed using `liq_attr_destroy()` after it's no longer needed.
154 |     /// Returns `NULL` in the unlikely case that the library cannot run on the current machine (e.g. the library has been compiled for SSE-capable x86 CPU and run on VIA C3 CPU).
155 |     pub fn liq_attr_create() -> *mut liq_attr;
156 |     pub fn liq_attr_copy(orig: &liq_attr) -> *mut liq_attr;
157 |     pub fn liq_attr_destroy(attr: &mut liq_attr);
158 | 
159 |     /// Specifies maximum number of colors to use.
160 |     ///
161 |     /// The default is 256. Instead of setting a fixed limit it's better to use `liq_set_quality()`.
162 |     /// The first argument is attributes object from `liq_attr_create()`.
163 |     /// Returns `LIQ_VALUE_OUT_OF_RANGE` if number of colors is outside the range 2-256.
164 |     pub fn liq_set_max_colors(attr: &mut liq_attr, colors: c_int) -> liq_error;
165 |     pub fn liq_get_max_colors(attr: &liq_attr) -> c_int;
166 |     pub fn liq_set_speed(attr: &mut liq_attr, speed: c_int) -> liq_error;
167 |     pub fn liq_get_speed(attr: &liq_attr) -> c_int;
168 |     pub fn liq_set_min_posterization(attr: &mut liq_attr, bits: c_int) -> liq_error;
169 |     pub fn liq_get_min_posterization(attr: &liq_attr) -> c_int;
170 |     /// Quality is in range `0` (worst) to `100` (best) and values are analoguous to JPEG quality (i.e. `80` is usually good enough).
171 |     ///
172 |     /// Quantization will attempt to use the lowest number of colors needed to achieve `maximum` quality. `maximum` value of `100` is the default and means conversion as good as possible.
173 |     /// If it's not possible to convert the image with at least `minimum` quality (i.e. 256 colors is not enough to meet the minimum quality), then `liq_image_quantize()` will fail. The default minumum is `0` (proceeds regardless of quality).
174 |     /// Quality measures how well the generated palette fits image given to `liq_image_quantize()`. If a different image is remapped with `liq_write_remapped_image()` then actual quality may be different.
175 |     /// Regardless of the quality settings the number of colors won't exceed the maximum (see `liq_set_max_colors()`).
176 |     /// The first argument is attributes object from `liq_attr_create()`.
177 |     ///
178 |     /// Returns `LIQ_VALUE_OUT_OF_RANGE` if target is lower than minimum or any of them is outside the 0-100 range.
179 |     /// Returns `LIQ_INVALID_POINTER` if `attr` appears to be invalid.
180 |     pub fn liq_set_quality(attr: &mut liq_attr, minimum: c_int, maximum: c_int) -> liq_error;
181 |     pub fn liq_get_min_quality(attr: &liq_attr) -> c_int;
182 |     pub fn liq_get_max_quality(attr: &liq_attr) -> c_int;
183 |     pub fn liq_set_last_index_transparent(attr: &mut liq_attr, is_last: c_int);
184 | 
185 |     pub fn liq_image_create_rgba_rows(attr: &liq_attr, rows: *const *const u8, width: c_int, height: c_int, gamma: f64) -> *mut liq_image;
186 |     /// Creates an object that represents the image pixels to be used for quantization and remapping.
187 |     ///
188 |     /// The pixel array must be contiguous run of RGBA pixels (alpha is the last component, 0 = transparent, 255 = opaque).
189 |     ///
190 |     /// The first argument is attributes object from `liq_attr_create()`. The same `attr` object should be used for the entire process, from creation of images to quantization.
191 |     ///
192 |     /// The `pixels` array must not be modified or freed until this object is freed with `liq_image_destroy()`. See also `liq_image_set_memory_ownership()`.
193 |     ///
194 |     /// `width` and `height` are dimensions in pixels. An image 10x10 pixel large will need a 400-byte array.
195 |     ///
196 |     /// `gamma` can be `0` for images with the typical 1/2.2 [gamma](https://en.wikipedia.org/wiki/Gamma_correction).
197 |     /// Otherwise `gamma` must be > 0 and < 1, e.g. `0.45455` (1/2.2) or `0.55555` (1/1.8). Generated palette will use the same gamma unless `liq_set_output_gamma()` is used. If `liq_set_output_gamma` is not used, then it only affects whether brighter or darker areas of the image will get more palette colors allocated.
198 |     ///
199 |     /// Returns `NULL` on failure, e.g. if `pixels` is `NULL` or `width`/`height` is <= 0.
200 |     pub fn liq_image_create_rgba(attr: &liq_attr, bitmap: *const u8, width: c_int, height: c_int, gamma: f64) -> *mut liq_image;
201 |     /// unsafe: It will crash if the owned memory wasn't allocated using `libc::malloc()` (or whatever allocator C side is using)
202 |     pub fn liq_image_set_memory_ownership(image: &liq_image, own: liq_ownership) -> liq_error;
203 | 
204 |     pub fn liq_set_log_callback(arg1: &mut liq_attr, arg2: liq_log_callback_function, user_info: *mut c_void);
205 |     pub fn liq_set_log_flush_callback(arg1: &mut liq_attr, arg2: liq_log_flush_callback_function, user_info: *mut c_void);
206 |     pub fn liq_attr_set_progress_callback(arg1: &mut liq_attr, arg2: liq_progress_callback_function, user_info: *mut c_void);
207 |     pub fn liq_result_set_progress_callback(arg1: &mut liq_result, arg2: liq_progress_callback_function, user_info: *mut c_void);
208 |     pub fn liq_image_create_custom(attr: &liq_attr, row_callback: liq_image_get_rgba_row_callback, user_info: *mut c_void, width: c_int, height: c_int, gamma: f64) -> *mut liq_image;
209 |     /// Remap assuming the image will be always presented exactly on top of this background.
210 |     ///
211 |     /// Takes ownership of the background image (i.e. do NOT use it afterwards, do NOT call liq_image_destroy on it).
212 |     ///
213 |     /// The background must have the same size. The foreground image must have a transparent color.
214 |     pub fn liq_image_set_background(img: &mut liq_image, background: *mut liq_image) -> liq_error;
215 |     pub fn liq_image_set_importance_map(img: &mut liq_image, buffer: *mut u8, buffer_size: usize, own: liq_ownership) -> liq_error;
216 |     pub fn liq_image_add_fixed_color(img: &mut liq_image, color: liq_color) -> liq_error;
217 |     pub fn liq_image_get_width(img: &liq_image) -> c_int;
218 |     pub fn liq_image_get_height(img: &liq_image) -> c_int;
219 |     pub fn liq_image_destroy(img: &mut liq_image);
220 | 
221 |     pub fn liq_histogram_create(attr: &liq_attr) -> *mut liq_histogram;
222 |     pub fn liq_histogram_add_image(hist: &mut liq_histogram, attr: &liq_attr, image: &mut liq_image) -> liq_error;
223 |     pub fn liq_histogram_add_colors(hist: &mut liq_histogram, attr: &liq_attr, entries: *const liq_histogram_entry, num_entries: c_int, gamma: f64) -> liq_error;
224 |     pub fn liq_histogram_add_fixed_color(hist: &mut liq_histogram, color: liq_color) -> liq_error;
225 |     pub fn liq_histogram_destroy(hist: &mut liq_histogram);
226 | 
227 |     /// Performs quantization (palette generation) based on settings in `attr` (from `liq_attr_create()`) and pixels of the image.
228 |     ///
229 |     /// Returns `LIQ_OK` if quantization succeeds and sets `liq_result` pointer in `out_result`. The last argument is used for receiving the `result` object:
230 |     ///
231 |     ///     liq_result *result;
232 |     ///     if (LIQ_OK == liq_image_quantize(img, attr, &result)) { // Note &result
233 |     ///         // result pointer is valid here
234 |     ///     }
235 |     ///
236 |     /// Returns `LIQ_QUALITY_TOO_LOW` if quantization fails due to limit set in `liq_set_quality()`.
237 |     ///
238 |     /// See `liq_write_remapped_image()`.
239 |     ///
240 |     /// If you want to generate one palette for multiple images at once, see `liq_histogram_create()`.
241 |     pub fn liq_quantize_image(options: &liq_attr, input_image: &liq_image) -> *mut liq_result;
242 |     pub fn liq_histogram_quantize(input_hist: &liq_histogram, options: &liq_attr, result_output: &mut *mut liq_result) -> liq_error;
243 |     pub fn liq_image_quantize(input_image: &liq_image, options: &liq_attr, result_output: &mut *mut liq_result) -> liq_error;
244 |     /// Enables/disables dithering in `liq_write_remapped_image()`.
245 |     ///
246 |     /// Dithering level must be between `0` and `1` (inclusive). Dithering level `0` enables fast non-dithered remapping. Otherwise a variation of Floyd-Steinberg error diffusion is used.
247 |     ///
248 |     /// Precision of the dithering algorithm depends on the speed setting, see `liq_set_speed()`.
249 |     ///
250 |     /// Returns `LIQ_VALUE_OUT_OF_RANGE` if the dithering level is outside the 0-1 range.
251 |     pub fn liq_set_dithering_level(res: &mut liq_result, dither_level: f32) -> liq_error;
252 |     pub fn liq_set_output_gamma(res: &mut liq_result, gamma: f64) -> liq_error;
253 |     pub fn liq_get_output_gamma(result: &liq_result) -> f64;
254 |     /// Returns pointer to palette optimized for image that has been quantized or remapped
255 |     /// (final refinements are applied to the palette during remapping).
256 |     ///
257 |     /// It's valid to call this method before remapping, if you don't plan to remap any images or want to use same palette for multiple images.
258 |     ///
259 |     /// `liq_palette->count` contains number of colors (up to 256), `liq_palette->entries[n]` contains RGBA value for nth palette color.
260 |     pub fn liq_get_palette<'a>(result: &'a mut liq_result) -> &'a liq_palette;
261 |     /// Remaps the image to palette and writes its pixels to the given buffer, 1 pixel per byte.
262 |     ///
263 |     /// The buffer must be large enough to fit the entire image, i.e. width×height bytes large. For safety, pass the size of the buffer as `buffer_size`.
264 |     ///
265 |     /// For best performance call `liq_get_palette()` *after* this function, as palette is improved during remapping (except when `liq_histogram_quantize()` is used).
266 |     ///
267 |     /// Returns `LIQ_BUFFER_TOO_SMALL` if given size of the buffer is not enough to fit the entire image.
268 |     ///
269 |     ///     int buffer_size = width*height;
270 |     ///     char *buffer = malloc(buffer_size);
271 |     ///     if (LIQ_OK == liq_write_remapped_image(result, input_image, buffer, buffer_size)) {
272 |     ///         liq_palette *pal = liq_get_palette(result);
273 |     ///         // save image
274 |     ///     }
275 |     ///
276 |     /// See `liq_get_palette()`.
277 |     ///
278 |     /// The buffer is assumed to be contiguous, with rows ordered from top to bottom, and no gaps between rows. If you need to write rows with padding or upside-down order, then use `liq_write_remapped_image_rows()`.
279 |     ///
280 |     /// Please note that it only writes raw uncompressed pixels to memory. It does not perform any PNG compression. If you'd like to create a PNG file then you need to pass the raw pixel data to another library, e.g. libpng or lodepng. See `rwpng.c` in `pngquant` project for an example how to do that.
281 |     pub fn liq_write_remapped_image(result: &mut liq_result, input_image: &mut liq_image, buffer: *mut u8, buffer_size: usize) -> liq_error;
282 |     pub fn liq_write_remapped_image_rows(result: &mut liq_result, input_image: &mut liq_image, row_pointers: *const *mut u8) -> liq_error;
283 |     pub fn liq_get_quantization_error(result: &liq_result) -> f64;
284 |     pub fn liq_get_quantization_quality(result: &liq_result) -> c_int;
285 | 
286 |     pub fn liq_result_destroy(res: &mut liq_result);
287 |     pub fn liq_get_remapping_error(result: &liq_result) -> f64;
288 |     pub fn liq_get_remapping_quality(result: &liq_result) -> c_int;
289 |     pub fn liq_version() -> c_int;
290 | }
291 | 
292 | #[test]
293 | fn links_and_runs() {
294 |     use std::ptr;
295 |     unsafe {
296 |         assert!(liq_version() >= 20901);
297 |         let attr = liq_attr_create();
298 |         assert!(!attr.is_null());
299 |         let hist = liq_histogram_create(&*attr);
300 |         assert!(!hist.is_null());
301 |         let mut res = ptr::null_mut();
302 |         liq_histogram_quantize(&*hist, &*attr, &mut res);
303 |         assert!(res.is_null());
304 |         liq_histogram_destroy(&mut *hist);
305 |         liq_attr_destroy(&mut *attr);
306 |     }
307 | }
308 | 


--------------------------------------------------------------------------------
/tcb-convert.c:
--------------------------------------------------------------------------------
  1 | #include <ctype.h>
  2 | #include <stdio.h>
  3 | #include <stdlib.h>
  4 | #include <stdint.h>
  5 | #include <assert.h>
  6 | #include "lodepng/lodepng.h"
  7 | #include "pngquant/libimagequant.h"
  8 | 
  9 | // This is a modified TIM2 image data header
 10 | // Reference: http://wiki.xentax.com/index.php/TM2_TIM2
 11 | typedef struct tcbHeader {
 12 |     // 0x00
 13 |     char magic[4];
 14 |     char padding[12];
 15 | 
 16 |     // 0x10
 17 |     uint32_t totalLength;
 18 |     uint32_t paletteLength;
 19 |     uint32_t imageDataLength;
 20 |     uint16_t headerLength;
 21 |     uint16_t numPaletteEntries;
 22 | 
 23 |     // 0x20
 24 |     uint8_t imageType;
 25 |     uint8_t numMipmaps;
 26 |     uint8_t paletteType;
 27 |     uint8_t bitsPerPixel;
 28 |     uint16_t width;
 29 |     uint16_t height;
 30 |     uint64_t gsTEX0;
 31 | 
 32 |     // 0x30
 33 |     uint64_t gsTEX1;
 34 |     uint32_t gsRegs;
 35 |     uint32_t gsTexClut;
 36 | 
 37 |     // 0x40
 38 |     uint8_t userData[16];
 39 | } tcbHeader_t;
 40 | 
 41 | typedef struct rgbaImageData {
 42 |     uint32_t *rgba;
 43 |     unsigned int width;
 44 |     unsigned int height;
 45 | } rgbaImageData_t;
 46 | 
 47 | #define LONIBBLE(x)  ((uint8_t) ((uint8_t) (x) & (uint8_t) 0x0F))
 48 | #define HINIBBLE(x)  ((uint8_t) ((uint8_t) (x) >> (uint8_t) 4))
 49 | 
 50 | /**
 51 |  * Filters palette colors to/from the format used by PS2 games.
 52 |  *
 53 |  * @param unfiltered		pointer to array of unfiltered RGBA colors.
 54 |  * @param filtered			pointer to store array of filtered RGBA colors.
 55 |  * @param length			number of elements in unfiltered/filtered color array.
 56 |  *
 57 |  * @pre unfiltered and filtered point to allocated memory of length*4 bytes.
 58 |  * @post filtered colors copied to filtered.
 59 |  */
 60 | void palette_filter(uint32_t *unfiltered, uint32_t *filtered, int length)
 61 | {
 62 |     int parts = length / 32;
 63 |     int stripes = 2;
 64 |     int colors = 8;
 65 |     int blocks = 2;
 66 | 
 67 |     int i = 0;
 68 |     for (int part = 0; part < parts; part++)
 69 |     {
 70 |         for (int block = 0; block < blocks; block++)
 71 |         {
 72 |             for (int stripe = 0; stripe < stripes; stripe++)
 73 |             {
 74 | 
 75 |                 for (int color = 0; color < colors; color++)
 76 |                 {
 77 |                     filtered[i++] = unfiltered[ part * colors * stripes * blocks + block * colors + stripe * stripes * colors + color ];
 78 |                 }
 79 |             }
 80 |         }
 81 |     }
 82 | }
 83 | 
 84 | int tcb_to_rgba(uint8_t *tcbData, int tcbLength, rgbaImageData_t *imageData);
 85 | int rgba_to_tcb(uint8_t *tcbData, int tcbLength, rgbaImageData_t *imageData);
 86 | 
 87 | int png_decode(char *pngPath, rgbaImageData_t *imageData);
 88 | int png_encode(char *pngPath, rgbaImageData_t *imageData);
 89 | 
 90 | int main(int argc, char *argv[])
 91 | {
 92 |     FILE *tcbFile;
 93 |     int tcbLength;
 94 |     uint8_t *tcbData;
 95 |     char *tcbPath;
 96 |     char pngPath[260];
 97 |     char mode;
 98 |     rgbaImageData_t imageData;
 99 | 
100 |     if(argc != 3)
101 |     {
102 |         printf("TCB Converter\n");
103 |         printf("Usage:\n");
104 |         printf("Convert TCB to PNG: %s e <image.tcb>\n", argv[0]);
105 |         printf("Inject PNG into TCB: %s i <image.tcb>\n", argv[0]);
106 |         return EXIT_FAILURE;
107 |     }
108 | 
109 |     mode = tolower(argv[1][0]);
110 |     tcbPath = argv[2];
111 |     strncpy(pngPath, tcbPath, sizeof(pngPath) - 1);
112 |     strncat(pngPath, ".png", sizeof(pngPath) - 1);
113 | 
114 |     tcbFile = fopen(tcbPath, "rb");
115 |     if(!tcbFile)
116 |     {
117 |         printf("Error opening %s\n", tcbPath);
118 |         return EXIT_FAILURE;
119 |     }
120 | 
121 |     fseek(tcbFile, 0, SEEK_END);
122 |     tcbLength = ftell(tcbFile);
123 |     fseek(tcbFile, 0, SEEK_SET);
124 |     tcbData = malloc(tcbLength);
125 |     if(!tcbData)
126 |     {
127 |         printf("malloc error\n");
128 |         fclose(tcbFile);
129 |         return EXIT_FAILURE;
130 |     }
131 |     fread(tcbData, 1, tcbLength, tcbFile);
132 |     fclose(tcbFile);
133 | 
134 |     if(mode == 'i')
135 |     {
136 |         printf("Injecting image from %s into %s...\n", pngPath, tcbPath);
137 | 
138 |         if(png_decode(pngPath, &imageData))
139 |         {
140 |             free(tcbData);
141 |             return EXIT_FAILURE;
142 |         }
143 | 
144 |         if(rgba_to_tcb(tcbData, tcbLength, &imageData))
145 |         {
146 |             free(tcbData);
147 |             free(imageData.rgba);
148 |             return EXIT_FAILURE;
149 |         }
150 | 
151 |         tcbFile = fopen(tcbPath, "wb");
152 |         if(!tcbFile)
153 |         {
154 |             printf("Error opening %s.\n", tcbPath);
155 |             free(tcbData);
156 |             free(imageData.rgba);
157 |             return EXIT_FAILURE;
158 |         }
159 | 
160 |         fwrite(tcbData, 1, tcbLength, tcbFile);
161 |         fclose(tcbFile);
162 | 
163 |         printf("Success!\n");
164 |     }
165 |     else if(mode == 'e')
166 |     {
167 |         printf("Extracting image from %s to %s...\n", tcbPath, pngPath);
168 | 
169 |         if(tcb_to_rgba(tcbData, tcbLength, &imageData))
170 |         {
171 |             free(tcbData);
172 |             return EXIT_FAILURE;
173 |         }
174 | 
175 |         if(png_encode(pngPath, &imageData))
176 |         {
177 |             free(tcbData);
178 |             free(imageData.rgba);
179 |             return EXIT_FAILURE;
180 |         }
181 | 
182 |         printf("Success!\n");
183 |     }
184 |     else
185 |     {
186 |         printf("Error: Unsupported mode '%c'\n", mode);
187 |         free(tcbData);
188 |         return EXIT_FAILURE;
189 |     }
190 | 
191 |     free(tcbData);
192 |     free(imageData.rgba);
193 | 
194 |     return EXIT_SUCCESS;
195 | }
196 | 
197 | /**
198 |  * Convert TCB data to RGBA data.
199 |  *
200 |  * @param tcbData		pointer to data from a TCB image.
201 |  * @param tcbLength		size of tcbData.
202 |  * @param imageData		pointer to struct to store RGBA image data.
203 |  *
204 |  * @post Image data from TCB is converted to 32-bit RGBA and stored in imageData->rgba.
205 |  * @return 1 on success, 0 on failure
206 |  */
207 | int tcb_to_rgba(uint8_t *tcbData, int tcbLength, rgbaImageData_t *imageData)
208 | {
209 |     tcbHeader_t *header;
210 |     uint8_t index, alpha;
211 |     uint8_t *image;
212 |     uint32_t *palette;
213 | 
214 |     if (!tcbData || tcbLength <= 0 || !imageData)
215 |         return EXIT_FAILURE;
216 | 
217 |     header = (tcbHeader_t*) tcbData;
218 |     image = (uint8_t*) (tcbData + 0x50);
219 |     palette = (uint32_t*) (tcbData + header->imageDataLength + 0x50);
220 | 
221 |     if(strncmp(header->magic, "TCB\0", 4))
222 |     {
223 |         for(int i = 0; i < sizeof(header->padding); i++)
224 |         {
225 |             if(header->padding[i] != 0)
226 |             {
227 |                 printf("ERROR: Invalid TCB file.\n");
228 |                 return EXIT_FAILURE;
229 |             }
230 |         }
231 |     }
232 | 
233 |     imageData->rgba = malloc(header->width * header->height * 4);
234 |     imageData->width = header->width;
235 |     imageData->height = header->height;
236 | 
237 |     uint32_t *newPalette = NULL;
238 |     if(header->paletteLength > 0x50)
239 |     {
240 |         newPalette = calloc(256, 4);
241 |         palette_filter(palette, newPalette, (header->paletteLength - 0x10) / 4);
242 |         palette = newPalette;
243 |     }
244 | 
245 |     if(header->paletteType == 0x05) // 8bpp
246 |     {
247 |         for(int i = 0; i < (header->width * header->height); i++)
248 |         {
249 |             index = image[i];
250 | 
251 |             alpha = palette[index] >> 24;
252 |             if(alpha > 0)
253 |                 alpha = (alpha << 1) - 1;  // scale from 0-128 to 0-255 range
254 | 
255 |             imageData->rgba[i] = palette[index] | (alpha << 24); // 255 alpha channel
256 |         }
257 |     }
258 |     else if(header->paletteType == 0x04) // 4bpp
259 |     {
260 |         for(int i = 0; i < (header->width * header->height); i++)
261 |         {
262 |             index = image[i/2];
263 | 
264 |             if(i%2)
265 |                 index = HINIBBLE(index);
266 |             else
267 |                 index = LONIBBLE(index);
268 | 
269 |             alpha = palette[index] >> 24;
270 |             if(alpha > 0)
271 |                 alpha = (alpha << 1) - 1;  // scale from 0-128 to 0-255 range
272 | 
273 |             imageData->rgba[i] = palette[index] | (alpha << 24);
274 |         }
275 |     }
276 | 
277 |     if(newPalette != NULL)
278 |         free(newPalette);
279 | 
280 |     return EXIT_SUCCESS;
281 | }
282 | 
283 | /**
284 |  * Inject RGBA data into existing TCB data.
285 |  *
286 |  * @param tcbData		pointer to data from TCB image.
287 |  * @param tcbLength		size of tcbData.
288 |  * @param imageData		pointer to struct with RGBA image data.
289 |  *
290 |  * @post Image data from rgbaImageData is quantized and injected into tcbData.
291 |  * @return 0 on success, 1 on failure.
292 |  */
293 | int rgba_to_tcb(uint8_t *tcbData, int tcbLength, rgbaImageData_t *imageData)
294 | {
295 |     tcbHeader_t *header;
296 |     uint8_t *image;
297 |     uint32_t *palette;
298 |     int len;
299 | 
300 |     if(!tcbData || tcbLength <= 0 || !imageData)
301 |         return EXIT_FAILURE;
302 | 
303 |     header = (tcbHeader_t*) tcbData;
304 |     image = (uint8_t*) (tcbData + 0x50);
305 |     palette = (uint32_t*) (tcbData + header->imageDataLength + 0x50);
306 | 
307 |     if(header->width != imageData->width || header->height != imageData->height)
308 |     {
309 |         printf("Image size mismatch. PNG dimensions are %ux%u, but it needs to be %ux%u to be injected into the TCB.\n", imageData->width, imageData->height, header->width, header->height);
310 |         return EXIT_FAILURE;
311 |     }
312 | 
313 |     liq_attr *attr = liq_attr_create();
314 |     if(header->paletteType == 0x04) // 4-bit color
315 |     {
316 |         liq_set_max_colors(attr, 16);
317 |     }
318 |     else if(header->paletteType != 0x05)
319 |     {
320 |         printf("Unsupported image type 0x%02X.\n", header->paletteType);
321 |         return EXIT_FAILURE;
322 |     }
323 | 
324 |     /* Quantize image and create new image map and palette */
325 |     liq_image *imagel = liq_image_create_rgba(attr, imageData->rgba, imageData->width, imageData->height, 0);
326 |     liq_result *res = liq_quantize_image(attr, imagel);
327 | 
328 |     if(header->paletteType == 0x05)
329 |     {
330 |         liq_write_remapped_image(res, imagel, image, imageData->height * imageData->width);
331 |     }
332 |     else if (header->paletteType == 0x04) // 4-bit color
333 |     {
334 |         uint8_t *fulldata = malloc(imageData->width * imageData->height);
335 |         liq_write_remapped_image(res, imagel, (uint32_t *)fulldata, imageData->width * imageData->height);
336 | 
337 |         // Convert to 4-bit
338 |         for(int i = 0; i < (imageData->width * imageData->height)/2; i++)
339 |         {
340 |             uint8_t pixel1 = *((uint8_t *)fulldata + i*2);
341 |             uint8_t pixel2 = *((uint8_t *)fulldata + i*2 + 1);
342 | 
343 |             image[i] = pixel1 | (pixel2 << 4);
344 |         }
345 | 
346 |         free(fulldata);
347 |     }
348 | 
349 |     /* Update palette in TCB */
350 |     const liq_palette *pal = liq_get_palette(res);
351 |     memcpy(palette, pal->entries, pal->count*4);
352 | 
353 |     for(int i = 0; i < pal->count; i++)
354 |     {
355 |         uint8_t alpha = palette[i] >> 24;
356 |         if(alpha > 0)
357 |             alpha = (alpha >> 1) + 1; // scale down to 0-128 range
358 |     }
359 | 
360 |     if(header->paletteType == 0x05) // Filter palette data
361 |     {
362 |         uint32_t *filtered = malloc(256 * 4);
363 |         palette_filter((uint32_t *) palette, filtered, 256);
364 |         memcpy((void *) palette, filtered, 256 * 4);
365 |         free(filtered);
366 |     }
367 | 
368 |     liq_attr_destroy(attr);
369 |     liq_image_destroy(imagel);
370 |     liq_result_destroy(res);
371 | 
372 |     return EXIT_SUCCESS;
373 | }
374 | 
375 | /**
376 |  * Decode PNG file to RGBA data.
377 |  *
378 |  * @param pngPath		Path to PNG file.
379 |  * @param imageData		pointer to struct to store RGBA image data.
380 |  * @return 0 on success, 1 on failure.
381 |  */
382 | int png_decode(char *pngPath, rgbaImageData_t *imageData)
383 | {
384 |     int ret;
385 |     if(!pngPath || !imageData)
386 |         return EXIT_FAILURE;
387 | 
388 |     ret = lodepng_decode32_file((unsigned char **)&imageData->rgba, &imageData->width, &imageData->height, pngPath);
389 |     if(ret != 0)
390 |     {
391 |         printf("PNG decoding error %u: %s\n", ret, lodepng_error_text(ret));
392 |         return EXIT_FAILURE;
393 |     }
394 | 
395 |     return EXIT_SUCCESS;
396 | }
397 | 
398 | /**
399 |  * Encode PNG file with RGBA data.
400 |  *
401 |  * @param pngPath		Path to PNG file.
402 |  * @param imageData		pointer to struct with RGBA image data.
403 |  * @return 0 on success, 1 on failure.
404 |  */
405 | int png_encode(char *pngPath, rgbaImageData_t *imageData)
406 | {
407 |     int ret;
408 |     if(!pngPath || !imageData)
409 |         return EXIT_FAILURE;
410 | 
411 |     ret = lodepng_encode32_file(pngPath, (const unsigned char *)imageData->rgba, imageData->width, imageData->height);
412 | 
413 |     if(ret != 0)
414 |     {
415 |         printf("PNG encoding error %u: %s\n", ret, lodepng_error_text(ret));
416 |         return EXIT_FAILURE;
417 |     }
418 | 
419 |     return EXIT_SUCCESS;
420 | }
421 | 


--------------------------------------------------------------------------------
/tcb-extract.c:
--------------------------------------------------------------------------------
  1 | #include <stdio.h>
  2 | #include <stdlib.h>
  3 | #include <sys/stat.h>
  4 | #include <string.h>
  5 | #include "BemaniLZ/BemaniLZ.h"
  6 | 
  7 | #if defined(_WIN32)
  8 |     #define MKDIR(a)	_mkdir(a);
  9 | #else
 10 |     #define MKDIR(a)	mkdir(a, 0777);
 11 | #endif
 12 | 
 13 | int search_for_tcbs(const unsigned char *data, size_t dataLength, uint32_t *offsets, char *isCompressed)
 14 | {
 15 |     int numFound = 0;
 16 | 
 17 |     for(unsigned int i = 0; i < dataLength; i++)
 18 |     {
 19 |         if(data[i] == 'T' && data[i+1] == 'C' && data[i+2] == 'B')
 20 |         {
 21 |             if(data[i+3] == 0
 22 |                 && data[i+4] == 0
 23 |                 && data[i+5] == 0
 24 |                 && data[i+6] == 0
 25 |                 && data[i+7] == 0
 26 |                 && data[i+8] == 0
 27 |                 && data[i+9] == 0
 28 |                 && data[i+10] == 0)
 29 |             {
 30 |                 offsets[numFound] = i;
 31 |                 isCompressed[numFound] = 0;
 32 |                 numFound++;
 33 |             }
 34 |             else if(i > 0 && (data[i-1] == 0x10 || data[i-1] == 0x90))
 35 |             {
 36 |                 offsets[numFound] = i - 1;
 37 |                 isCompressed[numFound] = 1;
 38 |                 numFound++;
 39 |             }
 40 |         }
 41 |     }
 42 | 
 43 |     return numFound;
 44 | }
 45 | 
 46 | int main(int argc, char *argv[])
 47 | {
 48 |     if(argc != 3)
 49 |     {
 50 |         printf("TCB Extractor\n");
 51 |         printf("Usage:\n");
 52 |         printf("%s <MODE> <file containing TCBs>\n", argv[0]);
 53 |         printf("Modes:\n");
 54 |         printf("1 - Bruteforce search for compressed and uncompressed TCBs\n");
 55 |         printf("2 - Extract from file beginning with table (compressed entries)\n");
 56 |         printf("3 - Extract from file beginning with table (uncompressed entries)\n");
 57 |         return EXIT_FAILURE;
 58 |     }
 59 | 
 60 |     FILE *compressed = fopen(argv[2], "rb");
 61 |     if(!compressed)
 62 |     {
 63 |         printf("Error opening %s\n", argv[2]);
 64 |         return EXIT_FAILURE;
 65 |     }
 66 | 
 67 |     /* Get input data */
 68 |     printf("Loading %s...\n", argv[2]);
 69 |     fseek(compressed, 0, SEEK_END);
 70 |     int length = ftell(compressed);
 71 |     fseek(compressed, 0, SEEK_SET);
 72 |     unsigned char *compressedData = malloc(length);
 73 |     fread(compressedData, length, 1, compressed);
 74 |     fclose(compressed);
 75 | 
 76 |     /* Search for TCBs */
 77 |     printf("Searching for TCBs...\n");
 78 |     uint32_t offsets[8000];
 79 |     char isCompressed[8000] = {0};
 80 |     int numEntries = 0;
 81 | 
 82 |     // file has table
 83 |     if(argv[1][0] == '2' || argv[1][0] == '3')
 84 |     {
 85 |         int offset = 0;
 86 |         uint32_t firstEntry = (uint32_t)compressedData[0];
 87 | 
 88 |         if(firstEntry % 4)
 89 |         {
 90 |             printf("WARNING: First entry is number of entries to follow (%d).\n", firstEntry);
 91 |         }
 92 | 
 93 |         printf("first entry at 0x%08X\n", firstEntry);
 94 | 
 95 |         memcpy(offsets, compressedData, firstEntry);
 96 |         numEntries = firstEntry/4;
 97 | 
 98 |         if(argv[1][0] == '2')
 99 |         {
100 |             for(int i = 0; i < numEntries; i++)
101 |             {
102 |                 isCompressed[i] = 1;
103 |             }
104 |         }
105 |     }
106 |     else // no table, need to search for TCBs
107 |     {
108 |         numEntries = search_for_tcbs(compressedData, length, offsets, isCompressed);
109 |     }
110 | 
111 |     offsets[numEntries] = length;
112 | 
113 |     printf("Found %d TCBs\n", numEntries);
114 |     int numCompressed = 0;
115 |     for(int i = 0; i < sizeof(isCompressed); i++)
116 |     {
117 |         if(isCompressed[i] == 1)
118 |             numCompressed++;
119 |     }
120 |     printf("%d are compressed\n", numCompressed);
121 | 
122 |     /* Decompress and save TCBs */
123 |     char outFolderName[100];
124 |     snprintf(outFolderName, 100, "_%s", argv[2]);
125 |     MKDIR(outFolderName);
126 |     chdir(outFolderName);
127 | 
128 |     uint8_t *buffer = malloc(1024*1024*10);
129 | 
130 |     for(unsigned int i = 0; i < numEntries; i++)
131 |     {
132 |         if (offsets[i+1] == 0)
133 |             break;
134 | 
135 |         printf("Extracting files: %04d/%d [%d%%]\r", i+1, numEntries, ((i+1)*100)/numEntries);
136 | 
137 |         int len = offsets[i+1] - offsets[i];
138 |         char filename[100];
139 |         snprintf(filename, 100, "%08X.tcb", offsets[i]);
140 |         FILE *out = fopen(filename, "wb");
141 | 
142 |         if(isCompressed[i])
143 |         {
144 |             int decLen = decompress(compressedData + offsets[i], len, buffer, 1024*1024*10);
145 |             fwrite(buffer, decLen, 1, out);
146 |         }
147 |         else
148 |         {
149 |             fwrite(compressedData + offsets[i], len, 1, out);
150 |         }
151 | 
152 |         fclose(out);
153 |     }
154 | 
155 |     printf("\n");
156 |     free(compressedData);
157 |     free(buffer);
158 | 
159 |     return 0;
160 | }
161 | 


--------------------------------------------------------------------------------