├── .gitignore
├── img2tim.layout
├── README.md
├── img2tim.cbp
├── img2tim.depend
├── tim.h
├── tim.cpp
├── img2tim.txt
├── main.cpp
└── LICENSE


/.gitignore:
--------------------------------------------------------------------------------
1 | *.exe
2 | *.dll
3 | *.zip
4 | *.png
5 | *.tim
6 | *.bmp
7 | obj
8 | gh-pages


--------------------------------------------------------------------------------
/img2tim.layout:
--------------------------------------------------------------------------------
 1 | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
 2 | <CodeBlocks_layout_file>
 3 | 	<ActiveTarget name="Release" />
 4 | 	<File name="tim.h" open="0" top="0" tabpos="2" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 5 | 		<Cursor>
 6 | 			<Cursor1 position="325" topLine="0" />
 7 | 		</Cursor>
 8 | 	</File>
 9 | 	<File name="tim.cpp" open="0" top="0" tabpos="3" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
10 | 		<Cursor>
11 | 			<Cursor1 position="1388" topLine="0" />
12 | 		</Cursor>
13 | 	</File>
14 | 	<File name="main.cpp" open="1" top="1" tabpos="1" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
15 | 		<Cursor>
16 | 			<Cursor1 position="663" topLine="0" />
17 | 		</Cursor>
18 | 	</File>
19 | </CodeBlocks_layout_file>
20 | 


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
 1 | # IMG2TIM
 2 | An Image to PlayStation TIM File Converter
 3 | 
 4 | This tool converts almost any image file into a PlayStation TIM image file for PlayStation homebrew development. Uses the FreeImage library for loading image files of almost any file format.
 5 | 
 6 | ## Features
 7 | * Uses the same arguments used in bmp2tim with special additional arguments.
 8 | * Supports alpha channel (if available) with threshold control as transparency mask.
 9 | * Color-key and index-key transparency masking.
10 | * Basic RGB to color-index image conversion.
11 | 
12 | ## Download
13 | The latest precompiled Win32 binary of this program can be downloaded here:
14 | [img2tim_(v0.75).zip](http://lameguy64.github.io/img2tim/img2tim_(v0.75).zip)
15 | 
16 | Previous versions:
17 | [img2tim_(v0.60).zip](http://lameguy64.github.io/img2tim/img2tim_(v0.60).zip)
18 | 
19 | ## Changelog
20 | **Version 0.75**
21 | * Fixed a bug where a false error message is thrown when converting 4-bit images with -bpp 4.
22 | * Fixed a pixel order bug when converting images from either RGB or 4-bit depth to 4-bit color depth.
23 | 
24 | **Version 0.60**
25 | * Initial release.


--------------------------------------------------------------------------------
/img2tim.cbp:
--------------------------------------------------------------------------------
 1 | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
 2 | <CodeBlocks_project_file>
 3 | 	<FileVersion major="1" minor="6" />
 4 | 	<Project>
 5 | 		<Option title="img2tim" />
 6 | 		<Option pch_mode="2" />
 7 | 		<Option compiler="gcc" />
 8 | 		<Build>
 9 | 			<Target title="Release">
10 | 				<Option output="img2tim" prefix_auto="1" extension_auto="1" />
11 | 				<Option object_output="obj/" />
12 | 				<Option type="1" />
13 | 				<Option compiler="gcc" />
14 | 				<Option parameters="-bpp 4 16color.png" />
15 | 				<Compiler>
16 | 					<Add option="-O2" />
17 | 				</Compiler>
18 | 				<Linker>
19 | 					<Add option="-s" />
20 | 				</Linker>
21 | 			</Target>
22 | 		</Build>
23 | 		<Compiler>
24 | 			<Add option="-Wall" />
25 | 		</Compiler>
26 | 		<Linker>
27 | 			<Add library="libfreeimage" />
28 | 		</Linker>
29 | 		<Unit filename="main.cpp" />
30 | 		<Unit filename="tim.cpp" />
31 | 		<Unit filename="tim.h">
32 | 			<Option target="&lt;{~None~}&gt;" />
33 | 		</Unit>
34 | 		<Extensions>
35 | 			<code_completion />
36 | 			<debugger />
37 | 			<envvars />
38 | 		</Extensions>
39 | 	</Project>
40 | </CodeBlocks_project_file>
41 | 


--------------------------------------------------------------------------------
/img2tim.depend:
--------------------------------------------------------------------------------
 1 | # depslib dependency file v1.0
 2 | 1476085104 source:c:\documents and settings\lameguy64\desktop\projects\img2tim\main.cpp
 3 | 	<stdio.h>
 4 | 	<string.h>
 5 | 	<ctype.h>
 6 | 	<math.h>
 7 | 	<unistd.h>
 8 | 	<windows.h>
 9 | 	<freeimage.h>
10 | 	"tim.h"
11 | 
12 | 1395229970 c:\documents and settings\lameguy64\desktop\projects\img2tim\freeimage\freeimage.h
13 | 	<wchar.h>
14 | 	<inttypes.h>
15 | 
16 | 1425871288 c:\documents and settings\lameguy64\desktop\projects\img2tim\libtim\libtim.cpp
17 | 
18 | 1430448034 c:\documents and settings\lameguy64\desktop\projects\img2tim\tim.cpp
19 | 
20 | 1476152828 source:c:\users\lameguy64\desktop\projects\img2tim\main.cpp
21 | 	<stdio.h>
22 | 	<string.h>
23 | 	<ctype.h>
24 | 	<math.h>
25 | 	<unistd.h>
26 | 	<windows.h>
27 | 	<freeimage.h>
28 | 	"tim.h"
29 | 
30 | 1395229970 c:\users\lameguy64\desktop\projects\img2tim\freeimage\freeimage.h
31 | 	<wchar.h>
32 | 	<inttypes.h>
33 | 
34 | 1446696616 c:\users\lameguy64\desktop\projects\img2tim\tim.cpp
35 | 
36 | 1458995574 c:\users\lameguy64\desktop\projects\img2tim\tim.h
37 | 	<stdio.h>
38 | 	<windows.h>
39 | 	<math.h>
40 | 
41 | 1458995574 source:c:\users\lameguy64\desktop\projects\img2tim\tim.cpp
42 | 	"tim.h"
43 | 
44 | 1459049574 source:c:\documents and settings\lameguy64\desktop\projects\img2tim\tim.cpp
45 | 	"tim.h"
46 | 
47 | 1459049574 c:\documents and settings\lameguy64\desktop\projects\img2tim\tim.h
48 | 	<stdio.h>
49 | 	<windows.h>
50 | 	<math.h>
51 | 
52 | 


--------------------------------------------------------------------------------
/tim.h:
--------------------------------------------------------------------------------
 1 | #ifndef _TIM_H
 2 | #define _TIM_H
 3 | 
 4 | #include <stdio.h>
 5 | #ifdef _WIN32
 6 | #include <windows.h>
 7 | #endif
 8 | #include <math.h>
 9 | 
10 | #define TIM_OUTPUT_CLUT4	0
11 | #define TIM_OUTPUT_CLUT8	1
12 | #define TIM_OUTPUT_RGB5		2
13 | #define TIM_OUTPUT_RGB24	3
14 | 
15 | namespace tim {
16 | 
17 | 
18 | 	// TIM header struct
19 |     typedef struct {
20 | 
21 | 		// ID sub-struct
22 |         struct HEADER_ID {
23 |             u_int id:8;     // Always 0x10
24 |             u_int ver:8;    // Always 0
25 |             u_int pad:16;   // Useless padding
26 |         } id;
27 | 
28 | 		// Flags sub-struct
29 |         struct HEADER_FLAGS {
30 |             u_int pmode:3;  // Pixel mode (0: 4-bit, 1: 8-bit, 2:16-bit, 3:24-bit)
31 |             u_int clut:1;
32 |             u_int pad:24;
33 |         } flags;
34 | 
35 |     } HEADER;
36 | 
37 | 
38 | 	// CLUT header struct
39 |     typedef struct {
40 |         u_int len;
41 |         u_short cx,cy;
42 |         u_short cw,ch;
43 |     } CLUT_HEAD;
44 | 
45 | 
46 | 	// Image data block header
47 |     typedef struct {
48 |         u_int len;
49 |         u_short x,y;
50 |         u_short w,h;
51 |     } IMG_HEAD;
52 | 
53 | 
54 |     typedef struct {
55 |         // 0: 4-bit CLUT, 1: 8-bit CLUT, 2:16-bit, 3:24-bit
56 |         int format;
57 |         // Image data params
58 |         void *imgData;
59 |         u_short imgWidth,imgHeight;
60 |         u_short imgXoffs,imgYoffs;
61 |         // CLUT data params
62 |         void *clutData;
63 |         u_short clutWidth,clutHeight;
64 |         u_short clutXoffs,clutYoffs;
65 |     } PARAM;
66 | 
67 | 
68 | 	// RGB5A1 pixel format struct
69 | 	typedef struct {
70 |         u_short r:5;
71 |         u_short g:5;
72 |         u_short b:5;
73 |         u_short i:1;
74 |     } PIX_RGB5;
75 | 
76 |     typedef struct {
77 | 		u_char	r;
78 | 		u_char	g;
79 | 		u_char	b;
80 |     } PIX_RGB24;
81 | 
82 | 
83 |     /*! tim::ExportFile()
84 | 	 *
85 | 	 *  /param[in]  fileName - Name of TIM file.
86 | 	 *  /param[in]  *param   - tim::PARAM object of TIM export parameters.
87 | 	 *
88 | 	 *  /returns Zero if the TIM file was written successfully, otherwise an error occured.
89 | 	 *
90 | 	 */
91 |     int ExportFile(const char* fileName, tim::PARAM *param);
92 | 
93 | 	void FreeParam(tim::PARAM *param);
94 | 
95 | };
96 | 
97 | 
98 | #endif // _TIM_H
99 | 


--------------------------------------------------------------------------------
/tim.cpp:
--------------------------------------------------------------------------------
 1 | #include "tim.h"
 2 | 
 3 | 
 4 | int tim::ExportFile(const char* fileName, tim::PARAM *param) {
 5 | 
 6 | 	FILE *fp;
 7 | 
 8 | 	if (!(fp = fopen(fileName, "wb"))) {
 9 | 		return(-1);
10 | 	}
11 | 
12 | 
13 | 	tim::HEADER     fileHead={{0}};
14 | 	tim::CLUT_HEAD  clutHead={0};
15 | 	tim::IMG_HEAD   imgHead={0};
16 | 
17 | 
18 | 	// Prepare header
19 | 	fileHead.id.id  = 0x10;
20 | 	fileHead.id.ver = 0;
21 | 	fileHead.flags.pmode = param->format;
22 | 
23 | 
24 | 	// Prepare CLUT data block if image is 8-bit or less and that the pointer to the CLUT data is not NULL
25 | 	if ((param->format <= 1) && (param->clutData != NULL)) {
26 | 		fileHead.flags.clut = 1;
27 | 		clutHead.cw = param->clutWidth;
28 | 		clutHead.ch = param->clutHeight;
29 | 		clutHead.cx = param->clutXoffs;
30 | 		clutHead.cy = param->clutYoffs;
31 | 		clutHead.len = ((2*param->clutWidth)*param->clutHeight);
32 | 		clutHead.len += sizeof(clutHead);
33 | 	}
34 | 
35 | 
36 | 	// Prepare image data block
37 | 	imgHead.w = param->imgWidth;
38 | 	imgHead.h = param->imgHeight;
39 | 	imgHead.x = param->imgXoffs;
40 | 	imgHead.y = param->imgYoffs;
41 | 
42 | 	// Calculate final size of image based on its color depth
43 | 	switch(param->format) {
44 | 	case 0:	// 4-bit with 16-color CLUT
45 | 		imgHead.len = param->imgWidth/2;
46 | 		imgHead.w /= 4;
47 | 		break;
48 | 	case 1:	// 8-bit with 256-color CLUT
49 | 		imgHead.len = param->imgWidth;
50 | 		imgHead.w /= 2;
51 | 		break;
52 | 	case 2:	// 16-bit RGB5I1
53 | 		imgHead.len = param->imgWidth*2;
54 | 		break;
55 | 	case 3:	// 24-bit RGB8
56 | 		imgHead.len = (param->imgWidth*3);
57 | 		imgHead.w = ceil(imgHead.w*1.5f);
58 | 		break;
59 | 	}
60 | 
61 | 	// Calculate size of image data block
62 | 	imgHead.len *= param->imgHeight;
63 | 	imgHead.len += sizeof(imgHead);
64 | 
65 | 
66 | 	// Write the header
67 | 	fwrite(&fileHead, 1, sizeof(fileHead), fp);
68 | 
69 | 	// Write the CLUT data block
70 | 	if ((param->format <= 1) && (param->clutData != NULL)) {
71 | 		fwrite(&clutHead, 1, sizeof(clutHead), fp);
72 | 		fwrite(param->clutData, 1, clutHead.len-sizeof(clutHead), fp);
73 | 	}
74 | 
75 | 	// Write the image data block
76 | 	fwrite(&imgHead, 1, sizeof(imgHead), fp);
77 | 	fwrite(param->imgData, 1, imgHead.len-sizeof(imgHead), fp);
78 | 
79 | 	// Close and return
80 | 	fclose(fp);
81 | 	return(0);
82 | 
83 | }
84 | 
85 | 
86 | void tim::FreeParam(tim::PARAM *param) {
87 | 
88 |     if (param->imgData != NULL) {
89 | 		free(param->imgData);
90 | 		param->imgData = NULL;
91 |     }
92 | 
93 | 	if (param->clutData != NULL) {
94 | 		free(param->clutData);
95 | 		param->clutData = NULL;
96 | 	}
97 | 
98 | }
99 | 


--------------------------------------------------------------------------------
/img2tim.txt:
--------------------------------------------------------------------------------
 1 | img2tim by Lameguy64 of Meido-Tek Productions
 2 | 
 3 | 
 4 | This tool converts almost any image file supported by FreeImage into a PlayStation standard TIM
 5 | texture image file. Made to replace the bmp2tim tool that came with the PsyQ SDK with additional
 6 | features not present in the original program.
 7 | 
 8 | The program itself is still a work in progress but its complete enough as a usable tool.
 9 | Alpha-blending options and better color-index conversion have yet to be implemented.
10 | 
11 | 
12 | Option Details:
13 | 
14 | -b		- Set semi-transparent bit on fully black pixels (ignored when -usealpha is specified).
15 | 
16 | 		If the semi-transparent bit on fully black pixels (R0 G0 B0) is set, the pixel will
17 | 		be drawn opaque instead of transparent as fully black is treated by the PlayStation
18 | 		as the transparent color by default.
19 | 
20 | -t		- Set semi-transparent bit on non fully black pixels.
21 | 
22 | 		This basically enables the output image to be drawn as semi-transparent since
23 | 		semi-transparency is only applied to pixels with the semi-transparency bit set.
24 | 		If the bit is not set, the pixel is always drawn opaque unless its a fully
25 | 		black pixel.
26 | 
27 | -org < x y >	- Specifies the VRAM offset of the image.
28 | 
29 | 		Keep in mind that the width of the converted tim image may vary from the original
30 | 		image's resolution depending on its color depth. 16-bit has no difference, 8-bit is
31 | 		1/2 of the original and 4-bit is about 1/4 of the original. No offset checking is
32 | 		done so its recommended to check the resulting tim file with timtool.
33 | 
34 | -plt < x y >	- Specifies the VRAM offset of the CLUT.
35 | 
36 | 		CLUTs are usually 256x1 for 8-bit tims or 16x1 for 4-bit tims. No offset checking is
37 | 		done so its recommended to check the resulting tim file with timtool.
38 | 
39 | -o < outFile >	- Sets the name of the output file.
40 | 
41 | -usealpha	- Use the alpha channel (if available) as a transparency mask.
42 | 
43 | 		Most useful when working with png image files that have an alpha channel and tools
44 | 		that utilize it, the alpha channel is used as a transparency mask when converting an
45 | 		image with an alpha channel.
46 | 
47 | -alpt < value >	- Specifies the threshold value when using the alpha channel as a transparency mask.
48 | 
49 | 		If the alpha value of the pixel is less than the threshold (default: 127), the pixel
50 | 		will be converted as transparent (pixel color replaced to fully black) and opaque if
51 | 		above the threshold (pixel color intact).
52 | 
53 | -tindex < col >	- Specify color index to be treated as transparent.
54 | 
55 | 		This option only applies to images that are 4-bit/8-bit palletized. Any pixel that has
56 | 		the same color-index specified will be made transparent.
57 | 
58 | -tcol < r g b >	- Specify RGB color value to be transparent.
59 | 
60 | 		Applies to both non-color index and color index images. Any pixel with a matching color
61 | 		specified will be made transparent (replaced to fully black).
62 | 
63 | -bpp < bpp >	- Specify the color depth for the output TIM file.
64 | 
65 | 		Currently, a simple color-search algorithm is used when converting images from non-indexed
66 | 		color depths (24-bit/16-bit) to 8-bit or 4-bit and will fail if more than 256 colors are
67 | 		found.
68 | 
69 | 		Supported output color depths: 4, 8, 16, 24


--------------------------------------------------------------------------------
/main.cpp:
--------------------------------------------------------------------------------
  1 | #include <stdio.h>
  2 | #include <string.h>
  3 | #include <ctype.h>
  4 | #include <math.h>
  5 | #include <unistd.h>
  6 | #ifdef _WIN32
  7 | #include <windows.h>
  8 | #else
  9 | #include <limits.h>
 10 | #define MAX_PATH PATH_MAX
 11 | #endif
 12 | #include <FreeImage.h>
 13 | 
 14 | #include "tim.h"
 15 | 
 16 | #define VERSION		"0.75"
 17 | 
 18 | namespace param {
 19 | 
 20 | 	char	InputFile[MAX_PATH] = { 0 };
 21 | 	char	OutputFile[MAX_PATH] = { 0 };
 22 | 
 23 |     int	BlackTrans		= false;	// Make black pixels transparent (STP bit off)
 24 |     int ColorTrans		= false;	// Make non-black pixels translucent (STP bit on)
 25 | 	int UseAlphaMask	= false;	// Use alpha channel as transparency mask
 26 | 	int AlphaThresh		= 127;		// Alpha mask threshold
 27 | 
 28 | 	int TransColR		= -1;
 29 | 	int TransColG		= -1;
 30 | 	int TransColB		= -1;
 31 | 
 32 | 	int TransCol		= -1;
 33 | 	int OutputBpp		= -1;
 34 | 
 35 | 	tim::PARAM	tim = { 0 };
 36 | 
 37 | }
 38 | 
 39 | 
 40 | typedef struct {
 41 | 
 42 | 	int		fmt;		// 0 - 32-bit RGBA, 1 - 8-bit palletized, 2 - 4-bit palletized
 43 |     short	w,h;
 44 |     void	*pixels;
 45 | 
 46 |     short	numCols;
 47 |     void	*colors;
 48 | 
 49 | } IMGPARAM;
 50 | 
 51 | 
 52 | void ConvertImageToTim(IMGPARAM image, tim::PARAM* tim);
 53 | int SimpleQuantize(tim::PARAM* tim, int bitDepth);
 54 | 
 55 | 
 56 | int LoadImagePixels(const char* fileName, IMGPARAM* image, bool makeRGBA);
 57 | void FreeImageStruct(IMGPARAM* image);
 58 | 
 59 | 
 60 | int main(int argc, char *argv[]) {
 61 | 
 62 |     FreeImage_Initialise(false);
 63 | 
 64 |     printf("img2tim v%s - Converts most image files into PlayStation TIM files\n", VERSION);
 65 |     printf("2016 Meido-Tek Productions (Lameguy64/TheCodingBrony)\n");
 66 |     printf("Powered by FreeImage v%s\n\n", FreeImage_GetVersion());
 67 | 
 68 | 	// Print banner if no arguments were passed
 69 | 	if (argc <= 1) {
 70 | 
 71 | 		printf("Syntax:\n");
 72 | 		printf("   img2tim [options] [-o <outName>] <inFile>\n\n");
 73 | 		printf("Options:\n");
 74 | 		printf("  -b            - Sets semi-transparent bit on fully black pixels\n");
 75 | 		printf("                  (ignored when -usealpha is specified).\n");
 76 | 		printf("  -t            - Set semi-transparent bit on non fully black pixels.\n");
 77 | 		printf("  -org <x y>    - Specifies the VRAM offset of the image (Default: 640 0).\n");
 78 | 		printf("  -plt <x y>    - Specifies the VRAM offset of the CLUT (Default: 0 480).\n");
 79 | 		printf("  -o <outFile>  - Sets the name of the output file (Default: <inFile>.tim).\n");
 80 | 		printf("\nExtra options:\n");
 81 | 		printf("  -usealpha     - Use alpha channel (if available) as transparency mask.\n");
 82 |         printf("  -alpt <value> - Threshold value when alpha channel is used as transparency\n");
 83 |         printf("                  mask (Default: 127).\n");
 84 |         printf("  -tindex <col> - Specify color index to be treated as transparent (ignored on\n");
 85 |         printf("                  non palletized images).\n");
 86 | 		printf("  -tcol <r g b> - Specify RGB color value to be treated as transparent.\n");
 87 | 		printf("  -bpp <bpp>    - Specify color depth for the output TIM file\n");
 88 | 		printf("                  (Default: Color depth of source image, 24 is never default).\n");
 89 | 
 90 | 		/*
 91 |         printf("   -tc <r g b>   - Specify color to be treated as transparent.\n");
 92 |         printf("   -bc <r g b>   - Specify blending color when converting alpha-blended pixels.\n");
 93 | 		printf("   -bg <r g b>   - Specifies a background color for images with an alpha channel.\n");
 94 | 		printf("   -tc <r g b>   - Sepecifies the color to be treated as transparent.\n");
 95 | 		printf("   -qm <method>  - Sets the quantization method used for generating a CLUT when\n");
 96 | 		printf("                   converting true-color images to 4-bit/8-bit.\n");
 97 | 		printf("                    0 - Simple 'color search' quantization (default)\n");
 98 | 		printf("                    1 - Median-cut quantization\n");
 99 | 		printf("                    2 - Median-cut quantization with dithering\n");
100 | 		*/
101 | 
102 | 		printf("\nFor more info, please read img2tim.txt.\n");
103 | 		return(0);
104 | 
105 | 	}
106 | 
107 | 
108 | 	param::tim.imgXoffs		= 640;
109 | 	param::tim.imgYoffs		= 0;
110 | 	param::tim.clutXoffs	= 0;
111 | 	param::tim.clutYoffs	= 480;
112 | 
113 | 
114 | 	// Parse arguments
115 | 	for(int i=1; i<argc; i++) {
116 | 
117 |         char* arg = strdup(argv[i]);
118 |         for(int c=0; arg[c] != 0x00; c++)
119 | 			arg[c] = tolower(arg[c]);
120 | 
121 | 
122 |         if (strcmp(arg, "-b") == 0) {
123 | 
124 |             param::BlackTrans = true;
125 | 
126 |         } else if (strcmp(arg, "-t") == 0) {
127 | 
128 |         	param::ColorTrans = true;
129 | 
130 | 		} else if (strcmp(arg, "-o") == 0) {
131 | 
132 |             strcpy(param::OutputFile, argv[i+1]);
133 |             i++;
134 | 
135 | 		} else if (strcmp(arg, "-org") == 0) {
136 | 
137 |             param::tim.imgXoffs	= atoi(argv[i+1]);
138 |             param::tim.imgYoffs	= atoi(argv[i+2]);
139 |             i += 2;
140 | 
141 | 		} else if (strcmp(arg, "-plt") == 0) {
142 | 
143 |             param::tim.clutXoffs	= atoi(argv[i+1]);
144 |             param::tim.clutYoffs	= atoi(argv[i+2]);
145 |             i += 2;
146 | 
147 | 		} else if (strcmp(arg, "-usealpha") == 0) {
148 | 
149 |             param::UseAlphaMask = true;
150 | 
151 | 		} else if (strcmp(arg, "-alpt") == 0) {
152 | 
153 |             param::AlphaThresh = atoi(argv[i+1]);
154 | 			i++;
155 | 
156 | 		} else if (strcmp(arg, "-tcol") == 0) {
157 | 
158 | 			param::TransColR = atoi(argv[i+1]);
159 | 			i++;
160 | 			param::TransColG = atoi(argv[i+1]);
161 | 			i++;
162 | 			param::TransColB = atoi(argv[i+1]);
163 | 			i++;
164 | 
165 | 		} else if (strcmp(arg, "-tindex") == 0) {
166 | 
167 | 			param::TransCol = atoi(argv[i+1]);
168 | 			i++;
169 | 
170 | 		} else if (strcmp(arg, "-bpp") == 0) {
171 | 
172 |             param::OutputBpp = atoi(argv[i+1]);
173 | 
174 |             if (!((param::OutputBpp == 4) || (param::OutputBpp == 8) || (param::OutputBpp == 16) || (param::OutputBpp == 24))) {
175 |                 printf("Invalid color depth value specified.\n");
176 |                 exit(1);
177 |             }
178 | 
179 | 			i++;
180 | 
181 |         } else if (arg[0] == '-') {
182 | 
183 |             printf("Unknown parameter: %s\n", argv[i]);
184 |             free(arg);
185 |             exit(1);
186 | 
187 |         } else {
188 | 
189 |             strcpy(param::InputFile, argv[i]);
190 | 
191 |         }
192 | 
193 | 
194 |         free(arg);
195 | 
196 | 	}
197 | 
198 | 
199 | 	// Check if an input file name is present
200 | 	if (strlen(param::InputFile) == 0) {
201 | 		printf("No input file specified.\n");
202 | 		exit(1);
203 | 	}
204 | 
205 | 
206 | 	// Check and generate an output filename when necessary
207 |     if (strlen(param::OutputFile) == 0) {
208 | 
209 |         if (strrchr(param::InputFile, '.') == NULL) {
210 | 
211 |             printf("Cannot generate output filename, input has no extension.\n");
212 |             exit(1);
213 | 
214 |         }
215 | 
216 | 		strcpy(param::OutputFile, param::InputFile);
217 |         strcpy(strrchr(param::OutputFile, '.'), ".tim");
218 | 
219 |     }
220 | 
221 | 	printf("Input File  : %s\n", param::InputFile);
222 | 	printf("Output File : %s\n", param::OutputFile);
223 | 
224 | 
225 | 	IMGPARAM	image;
226 | 
227 | 	printf("Output Bpp  : ");
228 | 	if (param::OutputBpp == -1) {
229 | 
230 | 		if (!LoadImagePixels(param::InputFile, &image, false)) {
231 | 			return(EXIT_FAILURE);
232 | 		}
233 | 
234 | 		printf("Input Bpp (");
235 | 		if (image.fmt == 0)
236 | 			printf("24");
237 | 		else if (image.fmt == 1)
238 | 			printf("8");
239 | 		else if (image.fmt == 2)
240 | 			printf("4");
241 | 		printf(")\n\n");
242 | 
243 | 		ConvertImageToTim(image, &param::tim);
244 | 
245 | 	} else {
246 | 
247 | 		printf("%d\n\n", param::OutputBpp);
248 | 
249 | 		if (!LoadImagePixels(param::InputFile, &image, true)) {
250 | 			return(EXIT_FAILURE);
251 | 		}
252 | 
253 | 		ConvertImageToTim(image, &param::tim);
254 | 
255 | 		if (param::OutputBpp <= 8) {
256 | 
257 | 			if (!SimpleQuantize(&param::tim, param::OutputBpp)) {
258 | 
259 | 				tim::FreeParam(&param::tim);
260 | 				FreeImageStruct(&image);
261 | 
262 | 				exit(1);
263 | 
264 | 			}
265 | 
266 | 		}
267 | 
268 | 
269 | 	}
270 | 
271 | 
272 | 	tim::ExportFile(param::OutputFile, &param::tim);
273 | 
274 | 
275 | 	tim::FreeParam(&param::tim);
276 | 	FreeImageStruct(&image);
277 | 
278 | 	printf("Converted successfully...\n\n");
279 | 
280 | 	return(0);
281 | 
282 | }
283 | 
284 | 
285 | void ConvertImageToTim(IMGPARAM image, tim::PARAM* tim) {
286 | 
287 | 	if (image.fmt == 0) {
288 | 
289 | 		if (param::OutputBpp == 24) {	// Convert image from 32-bit RGBA to 24-bit RGB
290 | 
291 | 			tim->imgData = malloc(3*(image.w*image.h));
292 | 
293 | 			for(short py=0; py<image.h; py++) {
294 | 				for(short px=0; px<image.w; px++) {
295 | 
296 | 					u_char r = ((u_char*)image.pixels)[4*(px+(image.w*py))];
297 | 					u_char g = ((u_char*)image.pixels)[(4*(px+(image.w*py)))+1];
298 | 					u_char b = ((u_char*)image.pixels)[(4*(px+(image.w*py)))+2];
299 | 
300 | 					((tim::PIX_RGB24*)tim->imgData)[px+(image.w*py)].r = r;
301 | 					((tim::PIX_RGB24*)tim->imgData)[px+(image.w*py)].g = g;
302 | 					((tim::PIX_RGB24*)tim->imgData)[px+(image.w*py)].b = b;
303 | 
304 | 				}
305 | 
306 | 			}
307 | 
308 | 			tim->format		= 3;
309 | 			tim->imgWidth	= image.w;
310 | 			tim->imgHeight	= image.h;
311 | 
312 | 		} else {	// Convert image from 32-bit RGBA to 16-bit RGBi
313 | 
314 | 			tim->imgData = malloc(2*(image.w*image.h));
315 | 
316 | 			for(short py=0; py<image.h; py++) {
317 | 				for(short px=0; px<image.w; px++) {
318 | 
319 | 					u_char r = ((u_char*)image.pixels)[4*(px+(image.w*py))];
320 | 					u_char g = ((u_char*)image.pixels)[(4*(px+(image.w*py)))+1];
321 | 					u_char b = ((u_char*)image.pixels)[(4*(px+(image.w*py)))+2];
322 | 					u_char a = ((u_char*)image.pixels)[(4*(px+(image.w*py)))+3];
323 | 
324 | 					((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].r = r/8;
325 | 					((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].g = g/8;
326 | 					((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].b = b/8;
327 | 
328 | 					if (param::UseAlphaMask == false) {
329 | 
330 | 						// For fully-black pixels
331 | 						if ((r == 0) && (g == 0) && (b == 0)) {
332 | 
333 | 							if (param::BlackTrans)
334 | 								((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].i = 1;
335 | 							else
336 | 								((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].i = 0;
337 | 
338 | 						// For non-fully black pixels
339 | 						} else {
340 | 
341 | 							if (param::ColorTrans)
342 | 								((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].i = 1;
343 | 							else
344 | 								((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].i = 0;
345 | 
346 | 						}
347 | 
348 | 					} else {
349 | 
350 | 						if ((r == 0) && (g == 0) && (b == 0)) {
351 | 
352 | 							if (a >= param::AlphaThresh)
353 | 								((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].i = 1;
354 | 							else
355 | 								((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].i = 0;
356 | 
357 | 						} else {
358 | 
359 | 							if (a < param::AlphaThresh) {
360 | 
361 | 								((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].r = 0;
362 | 								((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].g = 0;
363 | 								((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].b = 0;
364 | 								((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].i = 0;
365 | 
366 | 							} else {
367 | 
368 | 								if (param::ColorTrans)
369 | 									((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].i = 1;
370 | 								else
371 | 									((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].i = 0;
372 | 
373 | 							}
374 | 
375 | 						}
376 | 
377 | 					}
378 | 
379 | 					if ((param::TransColR == r) && (param::TransColG == g) && (param::TransColB == b)) {
380 | 
381 | 							((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].r = 0;
382 | 							((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].g = 0;
383 | 							((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].b = 0;
384 | 							((tim::PIX_RGB5*)tim->imgData)[px+(image.w*py)].i = 0;
385 | 
386 | 					}
387 | 
388 | 				}
389 | 
390 | 			}
391 | 
392 | 			tim->format		 = 2;
393 | 			tim->imgWidth	 = image.w;
394 | 			tim->imgHeight	 = image.h;
395 | 
396 | 		}
397 | 
398 | 	} else if (image.fmt == 1) {	// Convert 8-bit palletized
399 | 
400 | 		if ((image.w%2) != 0)
401 | 			printf("WARNING: Image width is not a multiple of 2, output may be broken.\n");
402 | 
403 | 		tim->clutData	= malloc(2*256);
404 |         tim->clutWidth	= 256;
405 |         tim->clutHeight	= 1;
406 | 
407 |         for(short c=0; c<256; c++) {
408 | 
409 | 			u_char r = ((RGBQUAD*)image.colors)[c].rgbRed;
410 | 			u_char g = ((RGBQUAD*)image.colors)[c].rgbGreen;
411 | 			u_char b = ((RGBQUAD*)image.colors)[c].rgbBlue;
412 | 
413 | 			if (param::TransCol == -1) {
414 | 				if ((param::TransColR == r) && (param::TransColG == g) && (param::TransColB == b)) {
415 |                     param::TransCol = c;
416 | 				}
417 | 			}
418 | 
419 | 			if (c != param::TransCol) {
420 | 
421 | 				((tim::PIX_RGB5*)tim->clutData)[c].r	= r/8;
422 | 				((tim::PIX_RGB5*)tim->clutData)[c].g	= g/8;
423 | 				((tim::PIX_RGB5*)tim->clutData)[c].b	= b/8;
424 | 
425 | 				// For fully-black pixels
426 | 				if ((r == 0) && (g == 0) && (b == 0)) {
427 | 
428 | 					if (param::BlackTrans)
429 | 						((tim::PIX_RGB5*)tim->clutData)[c].i = 1;
430 | 					else
431 | 						((tim::PIX_RGB5*)tim->clutData)[c].i = 0;
432 | 
433 | 				// For non-fully black pixels
434 | 				} else {
435 | 
436 | 					if (param::ColorTrans)
437 | 						((tim::PIX_RGB5*)tim->clutData)[c].i = 1;
438 | 					else
439 | 						((tim::PIX_RGB5*)tim->clutData)[c].i = 0;
440 | 
441 | 				}
442 | 
443 | 			} else {
444 | 
445 | 				((tim::PIX_RGB5*)tim->clutData)[c].r	= 0;
446 | 				((tim::PIX_RGB5*)tim->clutData)[c].g	= 0;
447 | 				((tim::PIX_RGB5*)tim->clutData)[c].b	= 0;
448 | 				((tim::PIX_RGB5*)tim->clutData)[c].i	= 0;
449 | 
450 | 			}
451 | 
452 |         }
453 | 
454 | 		tim->imgData = malloc(image.w*image.h);
455 | 
456 | 		for(short py=0; py<image.h; py++) {
457 | 
458 | 			memcpy(&((u_char*)tim->imgData)[image.w*py], &((u_char*)image.pixels)[image.w*py], image.w);
459 | 
460 | 		}
461 | 
462 | 		tim->format		= 1;
463 | 		tim->imgWidth	= image.w;
464 | 		tim->imgHeight	= image.h;
465 | 
466 | 	} else if (image.fmt == 2) {	// Convert image for 4-bit TIM
467 | 
468 | 		if ((image.w%4) != 0)
469 | 			printf("WARNING: Image width is not a multiple of 4, output may be broken.\n");
470 | 
471 | 		tim->clutData	= malloc(2*16);
472 |         tim->clutWidth	= 16;
473 |         tim->clutHeight	= 1;
474 | 
475 |         for(short c=0; c<16; c++) {
476 | 
477 | 			u_char r = ((RGBQUAD*)image.colors)[c].rgbRed;
478 | 			u_char g = ((RGBQUAD*)image.colors)[c].rgbGreen;
479 | 			u_char b = ((RGBQUAD*)image.colors)[c].rgbBlue;
480 | 
481 | 			if (param::TransCol == -1) {
482 | 				if ((param::TransColR == r) && (param::TransColG == g) && (param::TransColB == b)) {
483 |                     param::TransCol = c;
484 | 				}
485 | 			}
486 | 
487 | 			if (c != param::TransCol) {
488 | 
489 | 				((tim::PIX_RGB5*)tim->clutData)[c].r	= r/8;
490 | 				((tim::PIX_RGB5*)tim->clutData)[c].g	= g/8;
491 | 				((tim::PIX_RGB5*)tim->clutData)[c].b	= b/8;
492 | 
493 | 				// For fully-black pixels
494 | 				if ((r == 0) && (g == 0) && (b == 0)) {
495 | 
496 | 					if (param::BlackTrans)
497 | 						((tim::PIX_RGB5*)tim->clutData)[c].i = 1;
498 | 					else
499 | 						((tim::PIX_RGB5*)tim->clutData)[c].i = 0;
500 | 
501 | 				// For non-fully black pixels
502 | 				} else {
503 | 
504 | 					if (param::ColorTrans)
505 | 						((tim::PIX_RGB5*)tim->clutData)[c].i = 1;
506 | 					else
507 | 						((tim::PIX_RGB5*)tim->clutData)[c].i = 0;
508 | 
509 | 				}
510 | 
511 | 			} else {
512 | 
513 | 				((tim::PIX_RGB5*)tim->clutData)[c].r	= 0;
514 | 				((tim::PIX_RGB5*)tim->clutData)[c].g	= 0;
515 | 				((tim::PIX_RGB5*)tim->clutData)[c].b	= 0;
516 | 				((tim::PIX_RGB5*)tim->clutData)[c].i	= 0;
517 | 
518 | 			}
519 | 
520 |         }
521 | 
522 | 		tim->imgData = malloc((image.w/2)*image.h);
523 | 
524 | 		for(short py=0; py<image.h; py++) {
525 | 
526 | 			for(short px=0; px<image.w/2; px++) {
527 | 
528 | 				u_char pix = ((u_char*)image.pixels)[px+((image.w/2)*py)];
529 | 				((u_char*)tim->imgData)[px+((image.w/2)*py)] = ((pix&0xf)<<4)|((pix>>4)&0xf);
530 | 
531 | 			}
532 | 
533 | 		}
534 | 
535 | 		tim->format		= 0;
536 | 		tim->imgWidth	= image.w;
537 | 		tim->imgHeight	= image.h;
538 | 
539 | 	}
540 | 
541 | 
542 | }
543 | 
544 | 
545 | int SimpleQuantize(tim::PARAM* tim, int bitDepth) {
546 | 
547 |     u_short			colTable[256] = { 0 };
548 | 	int				diffColors = 0;
549 | 	bool			newCol = true;
550 | 
551 | 	if (bitDepth == 8) {
552 | 
553 | 		if ((tim->imgWidth%2) != 0)
554 | 			printf("WARNING: Image width is not a multiple of 2, output may be broken.\n");
555 | 
556 | 	} else {
557 | 
558 | 		if ((tim->imgWidth%4) != 0)
559 | 			printf("WARNING: Image width is not a multiple of 4, output may be broken.\n");
560 | 
561 | 	}
562 | 
563 |     for(int py=0; py<tim->imgHeight; py++) {
564 | 		for(int px=0; px<tim->imgWidth; px++) {
565 | 
566 | 			u_short	pix = ((u_short*)tim->imgData)[px+(tim->imgWidth*py)];
567 | 
568 | 			for(short c=0; c<diffColors; c++) {
569 | 
570 |                 if (colTable[c] == pix) {
571 | 
572 | 					newCol = false;
573 | 					break;
574 | 
575 |                 } else {
576 | 
577 |                 	newCol = true;
578 | 
579 |                 }
580 | 
581 | 			}
582 | 
583 | 			if (newCol) {
584 | 
585 | 				if (bitDepth == 8) {
586 | 
587 | 					if (diffColors >= 255) {
588 | 						printf("ERROR: More than 256 colors found in image.\n");
589 | 						return(0);
590 | 					}
591 | 
592 | 				} else {
593 | 
594 | 					if (diffColors >= 16) {
595 | 						printf("ERROR: More than 16 colors found in image.\n");
596 | 						return(0);
597 | 					}
598 | 
599 | 				}
600 | 
601 | 				colTable[diffColors] = pix;
602 |                 diffColors++;
603 | 
604 | 				newCol = false;
605 | 
606 | 			}
607 | 
608 | 		}
609 |     }
610 | 
611 |     u_short* srcImage = (u_short*)tim->imgData;
612 | 
613 |     if (bitDepth == 8) {
614 | 
615 | 		tim->imgData = malloc(tim->imgWidth*tim->imgHeight);
616 | 
617 | 		for(int py=0; py<tim->imgHeight; py++) {
618 | 			for(int px=0; px<tim->imgWidth; px++) {
619 | 
620 | 				u_short	pix = srcImage[px+(tim->imgWidth*py)];
621 | 				short index;
622 | 
623 | 				for(index=0; index<diffColors; index++) {
624 | 
625 | 					if (pix == colTable[index])
626 | 						break;
627 | 
628 | 				}
629 | 
630 | 				if (index < diffColors) {
631 | 					((u_char*)tim->imgData)[px+(tim->imgWidth*py)] = index;
632 | 				}
633 | 
634 | 			}
635 | 		}
636 | 
637 |     } else {
638 | 
639 |     	tim->imgData = malloc((tim->imgWidth/2)*tim->imgHeight);
640 | 
641 | 
642 | 		for(int py=0; py<tim->imgHeight; py++) {
643 | 			for(int px=0; px<tim->imgWidth; px++) {
644 | 
645 | 				u_short	pix = srcImage[px+(tim->imgWidth*py)];
646 | 				short index;
647 | 
648 | 				for(index=0; index<diffColors; index++) {
649 | 
650 | 					if (pix == colTable[index])
651 | 						break;
652 | 
653 | 				}
654 | 
655 | 				if (index < diffColors) {
656 | 
657 | 					if ((px%2) == 0) {
658 | 						((u_char*)tim->imgData)[(px/2)+((tim->imgWidth/2)*py)] = index;
659 | 					} else {
660 | 						((u_char*)tim->imgData)[(px/2)+((tim->imgWidth/2)*py)] |= index<<4;
661 | 					}
662 | 
663 | 
664 | 				}
665 | 
666 | 			}
667 | 		}
668 | 
669 |     }
670 | 
671 | 	free(srcImage);
672 | 
673 | 
674 | 	if (bitDepth == 8) {
675 | 		tim->clutData	= malloc(2*256);
676 | 		memcpy(tim->clutData, colTable, 2*256);
677 | 		tim->clutWidth	= 256;
678 | 	} else {
679 | 		tim->clutData	= malloc(2*16);
680 | 		memcpy(tim->clutData, colTable, 2*16);
681 | 		tim->clutWidth	= 16;
682 | 	}
683 | 
684 |     tim->clutHeight	= 1;
685 | 
686 | 	if (bitDepth == 8) {
687 | 		tim->format = 1;
688 | 	} else {
689 | 		tim->format = 0;
690 | 	}
691 | 
692 |     return(1);
693 | 
694 | }
695 | 
696 | 
697 | int LoadImagePixels(const char* fileName, IMGPARAM* image, bool makeRGBA) {
698 | 
699 | 
700 | 	// Check if file exists
701 | 	if (access(fileName, F_OK) == -1) {
702 | 
703 | 		printf("ERROR: File not found.\n");
704 | 		return(0);
705 | 
706 | 	}
707 | 
708 | 
709 | 	// Determine format of input file
710 | 	FREE_IMAGE_FORMAT fif = FreeImage_GetFileType(fileName, 0);
711 | 
712 | 	if (fif == FIF_UNKNOWN) {
713 | 
714 | 		fif = FreeImage_GetFIFFromFilename(fileName);
715 | 
716 | 		if (!FreeImage_FIFSupportsReading(fif)) {
717 | 
718 | 			printf("ERROR: Unknown/unsupported image format.\n");
719 | 			return(0);
720 | 
721 | 		}
722 | 
723 | 	}
724 | 
725 | 
726 | 	// Load the input image
727 | 	FIBITMAP *srcImage = FreeImage_Load(fif, fileName, 0);
728 | 
729 | 	if (srcImage == NULL) {
730 | 
731 | 		printf("ERROR: Cannot load specified image file.\n");
732 | 		return(0);
733 | 
734 | 	}
735 | 
736 | 	// Some checks to make sure that the image is really valid
737 | 	if (!FreeImage_HasPixels(srcImage)) {
738 | 
739 | 		printf("ERROR: Source image has no pixel data... Somehow.\n");
740 | 		return(0);
741 | 
742 | 	}
743 | 
744 | 
745 | 	if ((makeRGBA) || (FreeImage_GetBPP(srcImage) == 24) || ((FreeImage_GetBPP(srcImage) > 32))) {
746 | 
747 | 		// Convert to RGBA32 for 16-bit and 24-bit exports
748 | 		FIBITMAP *tempImage;
749 | 
750 | 		// Just to make things simpler, convert pixels to RGB32 when it is not palletized
751 | 		tempImage = FreeImage_ConvertTo32Bits(srcImage);
752 | 
753 | 		if (tempImage == NULL) {
754 | 
755 | 			printf("ERROR: Could not convert image to RGBA32 for conversion.\n");
756 | 			FreeImage_Unload(srcImage);
757 | 			return(0);
758 | 
759 | 		}
760 | 
761 | 		FreeImage_Unload(srcImage);
762 | 		srcImage = tempImage;
763 | 
764 | 	}
765 | 
766 | 
767 | 	switch(FreeImage_GetBPP(srcImage)) {
768 | 	case 32:	// 32-bit images
769 | 
770 | 		image->fmt	= 0;
771 | 		image->w	= FreeImage_GetWidth(srcImage);
772 | 		image->h	= FreeImage_GetHeight(srcImage);
773 | 
774 | 		image->numCols	= 0;
775 | 		image->colors	= NULL;
776 | 		image->pixels	= malloc(4*(image->w*image->h));
777 | 
778 |         for(short py=0; py<image->h; py++) {
779 | 
780 | 			void* pixels = FreeImage_GetScanLine(srcImage, (image->h-py)-1);
781 | 			memcpy(&((u_int*)image->pixels)[image->w*py], pixels, 4*image->w);
782 | 
783 | 			for(short p=0; p<image->w; p++) {
784 | 
785 | 				u_char* pix = (u_char*)&((u_int*)image->pixels)[ p+(image->w*py) ];
786 | 				u_char	t;
787 | 
788 | 				t = pix[0];
789 | 				pix[0] = pix[2];
790 | 				pix[2] = t;
791 | 
792 | 			}
793 | 
794 |         }
795 | 
796 | 		break;
797 | 
798 | 	case 8:		// 8-bit palletized
799 | 
800 | 		image->fmt	= 1;
801 | 		image->w	= FreeImage_GetWidth(srcImage);
802 | 		image->h	= FreeImage_GetHeight(srcImage);
803 | 
804 | 		image->numCols	= 256;
805 | 		image->colors	= malloc(4*256);
806 | 		memcpy(image->colors, FreeImage_GetPalette(srcImage), 4*256);
807 | 
808 | 		image->pixels	= malloc(image->w*image->h);
809 | 
810 | 		for(short py=0; py<image->h; py++) {
811 | 
812 | 			void* pixels = FreeImage_GetScanLine(srcImage, (image->h-py)-1);
813 | 			memcpy(&((u_char*)image->pixels)[image->w*py], pixels, image->w);
814 | 
815 |         }
816 | 
817 |         break;
818 | 
819 | 	case 4:		// 4-bit palletized
820 | 
821 | 		image->fmt	= 2;
822 | 		image->w	= FreeImage_GetWidth(srcImage);
823 | 		image->h	= FreeImage_GetHeight(srcImage);
824 | 
825 | 		image->numCols	= 16;
826 | 		image->colors	= malloc(4*16);
827 | 		memcpy(image->colors, FreeImage_GetPalette(srcImage), 4*16);
828 | 
829 | 		image->pixels	= malloc((image->w/2)*image->h);
830 | 
831 | 		for(short py=0; py<image->h; py++) {
832 | 
833 | 			void* pixels = FreeImage_GetScanLine(srcImage, (image->h-py)-1);
834 | 			memcpy(&((u_char*)image->pixels)[(image->w/2)*py], pixels, image->w/2);
835 | 
836 |         }
837 | 
838 |         break;
839 | 
840 | 	default:
841 | 
842 | 		printf("ERROR: Unsupported color depth: %dbpp", FreeImage_GetBPP(srcImage));
843 | 		FreeImage_Unload(srcImage);
844 | 		return(0);
845 | 
846 | 	}
847 | 
848 | 
849 | 	// Unload source image
850 | 	FreeImage_Unload(srcImage);
851 | 
852 | 	return(1);
853 | 
854 | }
855 | 
856 | void FreeImageStruct(IMGPARAM* image) {
857 | 
858 |     if (image->pixels != NULL) {
859 | 		free(image->pixels);
860 | 		image->pixels = NULL;
861 |     }
862 | 
863 | 	if (image->colors != NULL) {
864 | 		free(image->colors);
865 | 		image->colors = NULL;
866 | 	}
867 | 
868 | }
869 | 


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


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