Welcome to mirror list, hosted at ThFree Co, Russian Federation.

github.com/mapsme/omim.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
path: root/3party
diff options
context:
space:
mode:
authorAlex Zolotarev <alex@maps.me>2015-09-30 02:38:27 +0300
committerAlex Zolotarev <alex@maps.me>2015-09-30 10:50:59 +0300
commita2682a0b2aab96a132df61f22c983ace6a37c62f (patch)
tree571ea2cbedf232f2adb9899fd39f6b00062276cd /3party
parent89dd44483011719394ff0400dfdb98451e6d400b (diff)
Moved 3party sources to 3party folder for easier support.
Diffstat (limited to '3party')
-rw-r--r--3party/agg/agg_curves.cpp610
-rw-r--r--3party/expat/expat_impl.h868
-rw-r--r--3party/fct/fct.h3959
-rw-r--r--3party/lodepng/lodepng.cpp4340
-rw-r--r--3party/lodepng/lodepng.hpp1713
-rw-r--r--3party/lodepng/lodepng_io.hpp211
-rw-r--r--3party/lodepng/lodepng_io_private.hpp439
-rw-r--r--3party/sdf_image/sdf_image.cpp511
-rw-r--r--3party/sdf_image/sdf_image.h80
-rw-r--r--3party/stb_image/stb_image.c3537
-rw-r--r--3party/stb_image/stb_image.h350
11 files changed, 16618 insertions, 0 deletions
diff --git a/3party/agg/agg_curves.cpp b/3party/agg/agg_curves.cpp
new file mode 100644
index 0000000000..26c83ae853
--- /dev/null
+++ b/3party/agg/agg_curves.cpp
@@ -0,0 +1,610 @@
+//----------------------------------------------------------------------------
+// Anti-Grain Geometry - Version 2.4
+// Copyright (C) 2002-2005 Maxim Shemanarev (http://www.antigrain.com)
+//
+// Permission to copy, use, modify, sell and distribute this software
+// is granted provided this copyright notice appears in all copies.
+// This software is provided "as is" without express or implied
+// warranty, and with no claim as to its suitability for any purpose.
+//
+//----------------------------------------------------------------------------
+// Contact: mcseem@antigrain.com
+// mcseemagg@yahoo.com
+// http://www.antigrain.com
+//----------------------------------------------------------------------------
+
+#include <math.h>
+#include <3party/agg/agg_curves.h>
+#include <3party/agg/agg_math.h>
+
+namespace agg
+{
+
+ //------------------------------------------------------------------------
+// const double curve_distance_epsilon = 1e-30;
+ const double curve_collinearity_epsilon = 1e-30;
+ const double curve_angle_tolerance_epsilon = 0.01;
+ enum curve_recursion_limit_e { curve_recursion_limit = 32 };
+
+
+
+ //------------------------------------------------------------------------
+ void curve3_inc::approximation_scale(double s)
+ {
+ m_scale = s;
+ }
+
+ //------------------------------------------------------------------------
+ double curve3_inc::approximation_scale() const
+ {
+ return m_scale;
+ }
+
+ //------------------------------------------------------------------------
+ void curve3_inc::init(double x1, double y1,
+ double x2, double y2,
+ double x3, double y3)
+ {
+ m_start_x = x1;
+ m_start_y = y1;
+ m_end_x = x3;
+ m_end_y = y3;
+
+ double dx1 = x2 - x1;
+ double dy1 = y2 - y1;
+ double dx2 = x3 - x2;
+ double dy2 = y3 - y2;
+
+ double len = sqrt(dx1 * dx1 + dy1 * dy1) + sqrt(dx2 * dx2 + dy2 * dy2);
+
+ m_num_steps = uround(len * 0.25 * m_scale);
+
+ if(m_num_steps < 4)
+ {
+ m_num_steps = 4;
+ }
+
+ double subdivide_step = 1.0 / m_num_steps;
+ double subdivide_step2 = subdivide_step * subdivide_step;
+
+ double tmpx = (x1 - x2 * 2.0 + x3) * subdivide_step2;
+ double tmpy = (y1 - y2 * 2.0 + y3) * subdivide_step2;
+
+ m_saved_fx = m_fx = x1;
+ m_saved_fy = m_fy = y1;
+
+ m_saved_dfx = m_dfx = tmpx + (x2 - x1) * (2.0 * subdivide_step);
+ m_saved_dfy = m_dfy = tmpy + (y2 - y1) * (2.0 * subdivide_step);
+
+ m_ddfx = tmpx * 2.0;
+ m_ddfy = tmpy * 2.0;
+
+ m_step = m_num_steps;
+ }
+
+ //------------------------------------------------------------------------
+ void curve3_inc::rewind(unsigned)
+ {
+ if(m_num_steps == 0)
+ {
+ m_step = -1;
+ return;
+ }
+ m_step = m_num_steps;
+ m_fx = m_saved_fx;
+ m_fy = m_saved_fy;
+ m_dfx = m_saved_dfx;
+ m_dfy = m_saved_dfy;
+ }
+
+ //------------------------------------------------------------------------
+ unsigned curve3_inc::vertex(double* x, double* y)
+ {
+ if(m_step < 0) return path_cmd_stop;
+ if(m_step == m_num_steps)
+ {
+ *x = m_start_x;
+ *y = m_start_y;
+ --m_step;
+ return path_cmd_move_to;
+ }
+ if(m_step == 0)
+ {
+ *x = m_end_x;
+ *y = m_end_y;
+ --m_step;
+ return path_cmd_line_to;
+ }
+ m_fx += m_dfx;
+ m_fy += m_dfy;
+ m_dfx += m_ddfx;
+ m_dfy += m_ddfy;
+ *x = m_fx;
+ *y = m_fy;
+ --m_step;
+ return path_cmd_line_to;
+ }
+
+ //------------------------------------------------------------------------
+ void curve3_div::init(double x1, double y1,
+ double x2, double y2,
+ double x3, double y3)
+ {
+ m_points.remove_all();
+ m_distance_tolerance_square = 0.5 / m_approximation_scale;
+ m_distance_tolerance_square *= m_distance_tolerance_square;
+ bezier(x1, y1, x2, y2, x3, y3);
+ m_count = 0;
+ }
+
+ //------------------------------------------------------------------------
+ void curve3_div::recursive_bezier(double x1, double y1,
+ double x2, double y2,
+ double x3, double y3,
+ unsigned level)
+ {
+ if(level > curve_recursion_limit)
+ {
+ return;
+ }
+
+ // Calculate all the mid-points of the line segments
+ //----------------------
+ double x12 = (x1 + x2) / 2;
+ double y12 = (y1 + y2) / 2;
+ double x23 = (x2 + x3) / 2;
+ double y23 = (y2 + y3) / 2;
+ double x123 = (x12 + x23) / 2;
+ double y123 = (y12 + y23) / 2;
+
+ double dx = x3-x1;
+ double dy = y3-y1;
+ double d = fabs(((x2 - x3) * dy - (y2 - y3) * dx));
+ double da;
+
+ if(d > curve_collinearity_epsilon)
+ {
+ // Regular case
+ //-----------------
+ if(d * d <= m_distance_tolerance_square * (dx*dx + dy*dy))
+ {
+ // If the curvature doesn't exceed the distance_tolerance value
+ // we tend to finish subdivisions.
+ //----------------------
+ if(m_angle_tolerance < curve_angle_tolerance_epsilon)
+ {
+ m_points.add(point_d(x123, y123));
+ return;
+ }
+
+ // Angle & Cusp Condition
+ //----------------------
+ da = fabs(atan2(y3 - y2, x3 - x2) - atan2(y2 - y1, x2 - x1));
+ if(da >= pi) da = 2*pi - da;
+
+ if(da < m_angle_tolerance)
+ {
+ // Finally we can stop the recursion
+ //----------------------
+ m_points.add(point_d(x123, y123));
+ return;
+ }
+ }
+ }
+ else
+ {
+ // Collinear case
+ //------------------
+ da = dx*dx + dy*dy;
+ if(da == 0)
+ {
+ d = calc_sq_distance(x1, y1, x2, y2);
+ }
+ else
+ {
+ d = ((x2 - x1)*dx + (y2 - y1)*dy) / da;
+ if(d > 0 && d < 1)
+ {
+ // Simple collinear case, 1---2---3
+ // We can leave just two endpoints
+ return;
+ }
+ if(d <= 0) d = calc_sq_distance(x2, y2, x1, y1);
+ else if(d >= 1) d = calc_sq_distance(x2, y2, x3, y3);
+ else d = calc_sq_distance(x2, y2, x1 + d*dx, y1 + d*dy);
+ }
+ if(d < m_distance_tolerance_square)
+ {
+ m_points.add(point_d(x2, y2));
+ return;
+ }
+ }
+
+ // Continue subdivision
+ //----------------------
+ recursive_bezier(x1, y1, x12, y12, x123, y123, level + 1);
+ recursive_bezier(x123, y123, x23, y23, x3, y3, level + 1);
+ }
+
+ //------------------------------------------------------------------------
+ void curve3_div::bezier(double x1, double y1,
+ double x2, double y2,
+ double x3, double y3)
+ {
+ m_points.add(point_d(x1, y1));
+ recursive_bezier(x1, y1, x2, y2, x3, y3, 0);
+ m_points.add(point_d(x3, y3));
+ }
+
+
+
+
+
+ //------------------------------------------------------------------------
+ void curve4_inc::approximation_scale(double s)
+ {
+ m_scale = s;
+ }
+
+ //------------------------------------------------------------------------
+ double curve4_inc::approximation_scale() const
+ {
+ return m_scale;
+ }
+
+ //------------------------------------------------------------------------
+// static double MSC60_fix_ICE(double v) { return v; }
+
+ //------------------------------------------------------------------------
+ void curve4_inc::init(double x1, double y1,
+ double x2, double y2,
+ double x3, double y3,
+ double x4, double y4)
+ {
+ m_start_x = x1;
+ m_start_y = y1;
+ m_end_x = x4;
+ m_end_y = y4;
+
+ double dx1 = x2 - x1;
+ double dy1 = y2 - y1;
+ double dx2 = x3 - x2;
+ double dy2 = y3 - y2;
+ double dx3 = x4 - x3;
+ double dy3 = y4 - y3;
+
+ double len = (sqrt(dx1 * dx1 + dy1 * dy1) +
+ sqrt(dx2 * dx2 + dy2 * dy2) +
+ sqrt(dx3 * dx3 + dy3 * dy3)) * 0.25 * m_scale;
+
+#if defined(_MSC_VER) && _MSC_VER <= 1200
+ m_num_steps = uround(MSC60_fix_ICE(len));
+#else
+ m_num_steps = uround(len);
+#endif
+
+ if(m_num_steps < 4)
+ {
+ m_num_steps = 4;
+ }
+
+ double subdivide_step = 1.0 / m_num_steps;
+ double subdivide_step2 = subdivide_step * subdivide_step;
+ double subdivide_step3 = subdivide_step * subdivide_step * subdivide_step;
+
+ double pre1 = 3.0 * subdivide_step;
+ double pre2 = 3.0 * subdivide_step2;
+ double pre4 = 6.0 * subdivide_step2;
+ double pre5 = 6.0 * subdivide_step3;
+
+ double tmp1x = x1 - x2 * 2.0 + x3;
+ double tmp1y = y1 - y2 * 2.0 + y3;
+
+ double tmp2x = (x2 - x3) * 3.0 - x1 + x4;
+ double tmp2y = (y2 - y3) * 3.0 - y1 + y4;
+
+ m_saved_fx = m_fx = x1;
+ m_saved_fy = m_fy = y1;
+
+ m_saved_dfx = m_dfx = (x2 - x1) * pre1 + tmp1x * pre2 + tmp2x * subdivide_step3;
+ m_saved_dfy = m_dfy = (y2 - y1) * pre1 + tmp1y * pre2 + tmp2y * subdivide_step3;
+
+ m_saved_ddfx = m_ddfx = tmp1x * pre4 + tmp2x * pre5;
+ m_saved_ddfy = m_ddfy = tmp1y * pre4 + tmp2y * pre5;
+
+ m_dddfx = tmp2x * pre5;
+ m_dddfy = tmp2y * pre5;
+
+ m_step = m_num_steps;
+ }
+
+ //------------------------------------------------------------------------
+ void curve4_inc::rewind(unsigned)
+ {
+ if(m_num_steps == 0)
+ {
+ m_step = -1;
+ return;
+ }
+ m_step = m_num_steps;
+ m_fx = m_saved_fx;
+ m_fy = m_saved_fy;
+ m_dfx = m_saved_dfx;
+ m_dfy = m_saved_dfy;
+ m_ddfx = m_saved_ddfx;
+ m_ddfy = m_saved_ddfy;
+ }
+
+ //------------------------------------------------------------------------
+ unsigned curve4_inc::vertex(double* x, double* y)
+ {
+ if(m_step < 0) return path_cmd_stop;
+ if(m_step == m_num_steps)
+ {
+ *x = m_start_x;
+ *y = m_start_y;
+ --m_step;
+ return path_cmd_move_to;
+ }
+
+ if(m_step == 0)
+ {
+ *x = m_end_x;
+ *y = m_end_y;
+ --m_step;
+ return path_cmd_line_to;
+ }
+
+ m_fx += m_dfx;
+ m_fy += m_dfy;
+ m_dfx += m_ddfx;
+ m_dfy += m_ddfy;
+ m_ddfx += m_dddfx;
+ m_ddfy += m_dddfy;
+
+ *x = m_fx;
+ *y = m_fy;
+ --m_step;
+ return path_cmd_line_to;
+ }
+
+
+
+
+ //------------------------------------------------------------------------
+ void curve4_div::init(double x1, double y1,
+ double x2, double y2,
+ double x3, double y3,
+ double x4, double y4)
+ {
+ m_points.remove_all();
+ m_distance_tolerance_square = 0.5 / m_approximation_scale;
+ m_distance_tolerance_square *= m_distance_tolerance_square;
+ bezier(x1, y1, x2, y2, x3, y3, x4, y4);
+ m_count = 0;
+ }
+
+ //------------------------------------------------------------------------
+ void curve4_div::recursive_bezier(double x1, double y1,
+ double x2, double y2,
+ double x3, double y3,
+ double x4, double y4,
+ unsigned level)
+ {
+ if(level > curve_recursion_limit)
+ {
+ return;
+ }
+
+ // Calculate all the mid-points of the line segments
+ //----------------------
+ double x12 = (x1 + x2) / 2;
+ double y12 = (y1 + y2) / 2;
+ double x23 = (x2 + x3) / 2;
+ double y23 = (y2 + y3) / 2;
+ double x34 = (x3 + x4) / 2;
+ double y34 = (y3 + y4) / 2;
+ double x123 = (x12 + x23) / 2;
+ double y123 = (y12 + y23) / 2;
+ double x234 = (x23 + x34) / 2;
+ double y234 = (y23 + y34) / 2;
+ double x1234 = (x123 + x234) / 2;
+ double y1234 = (y123 + y234) / 2;
+
+
+ // Try to approximate the full cubic curve by a single straight line
+ //------------------
+ double dx = x4-x1;
+ double dy = y4-y1;
+
+ double d2 = fabs(((x2 - x4) * dy - (y2 - y4) * dx));
+ double d3 = fabs(((x3 - x4) * dy - (y3 - y4) * dx));
+ double da1, da2, k;
+
+ switch((int(d2 > curve_collinearity_epsilon) << 1) +
+ int(d3 > curve_collinearity_epsilon))
+ {
+ case 0:
+ // All collinear OR p1==p4
+ //----------------------
+ k = dx*dx + dy*dy;
+ if(k == 0)
+ {
+ d2 = calc_sq_distance(x1, y1, x2, y2);
+ d3 = calc_sq_distance(x4, y4, x3, y3);
+ }
+ else
+ {
+ k = 1 / k;
+ da1 = x2 - x1;
+ da2 = y2 - y1;
+ d2 = k * (da1*dx + da2*dy);
+ da1 = x3 - x1;
+ da2 = y3 - y1;
+ d3 = k * (da1*dx + da2*dy);
+ if(d2 > 0 && d2 < 1 && d3 > 0 && d3 < 1)
+ {
+ // Simple collinear case, 1---2---3---4
+ // We can leave just two endpoints
+ return;
+ }
+ if(d2 <= 0) d2 = calc_sq_distance(x2, y2, x1, y1);
+ else if(d2 >= 1) d2 = calc_sq_distance(x2, y2, x4, y4);
+ else d2 = calc_sq_distance(x2, y2, x1 + d2*dx, y1 + d2*dy);
+
+ if(d3 <= 0) d3 = calc_sq_distance(x3, y3, x1, y1);
+ else if(d3 >= 1) d3 = calc_sq_distance(x3, y3, x4, y4);
+ else d3 = calc_sq_distance(x3, y3, x1 + d3*dx, y1 + d3*dy);
+ }
+ if(d2 > d3)
+ {
+ if(d2 < m_distance_tolerance_square)
+ {
+ m_points.add(point_d(x2, y2));
+ return;
+ }
+ }
+ else
+ {
+ if(d3 < m_distance_tolerance_square)
+ {
+ m_points.add(point_d(x3, y3));
+ return;
+ }
+ }
+ break;
+
+ case 1:
+ // p1,p2,p4 are collinear, p3 is significant
+ //----------------------
+ if(d3 * d3 <= m_distance_tolerance_square * (dx*dx + dy*dy))
+ {
+ if(m_angle_tolerance < curve_angle_tolerance_epsilon)
+ {
+ m_points.add(point_d(x23, y23));
+ return;
+ }
+
+ // Angle Condition
+ //----------------------
+ da1 = fabs(atan2(y4 - y3, x4 - x3) - atan2(y3 - y2, x3 - x2));
+ if(da1 >= pi) da1 = 2*pi - da1;
+
+ if(da1 < m_angle_tolerance)
+ {
+ m_points.add(point_d(x2, y2));
+ m_points.add(point_d(x3, y3));
+ return;
+ }
+
+ if(m_cusp_limit != 0.0)
+ {
+ if(da1 > m_cusp_limit)
+ {
+ m_points.add(point_d(x3, y3));
+ return;
+ }
+ }
+ }
+ break;
+
+ case 2:
+ // p1,p3,p4 are collinear, p2 is significant
+ //----------------------
+ if(d2 * d2 <= m_distance_tolerance_square * (dx*dx + dy*dy))
+ {
+ if(m_angle_tolerance < curve_angle_tolerance_epsilon)
+ {
+ m_points.add(point_d(x23, y23));
+ return;
+ }
+
+ // Angle Condition
+ //----------------------
+ da1 = fabs(atan2(y3 - y2, x3 - x2) - atan2(y2 - y1, x2 - x1));
+ if(da1 >= pi) da1 = 2*pi - da1;
+
+ if(da1 < m_angle_tolerance)
+ {
+ m_points.add(point_d(x2, y2));
+ m_points.add(point_d(x3, y3));
+ return;
+ }
+
+ if(m_cusp_limit != 0.0)
+ {
+ if(da1 > m_cusp_limit)
+ {
+ m_points.add(point_d(x2, y2));
+ return;
+ }
+ }
+ }
+ break;
+
+ case 3:
+ // Regular case
+ //-----------------
+ if((d2 + d3)*(d2 + d3) <= m_distance_tolerance_square * (dx*dx + dy*dy))
+ {
+ // If the curvature doesn't exceed the distance_tolerance value
+ // we tend to finish subdivisions.
+ //----------------------
+ if(m_angle_tolerance < curve_angle_tolerance_epsilon)
+ {
+ m_points.add(point_d(x23, y23));
+ return;
+ }
+
+ // Angle & Cusp Condition
+ //----------------------
+ k = atan2(y3 - y2, x3 - x2);
+ da1 = fabs(k - atan2(y2 - y1, x2 - x1));
+ da2 = fabs(atan2(y4 - y3, x4 - x3) - k);
+ if(da1 >= pi) da1 = 2*pi - da1;
+ if(da2 >= pi) da2 = 2*pi - da2;
+
+ if(da1 + da2 < m_angle_tolerance)
+ {
+ // Finally we can stop the recursion
+ //----------------------
+ m_points.add(point_d(x23, y23));
+ return;
+ }
+
+ if(m_cusp_limit != 0.0)
+ {
+ if(da1 > m_cusp_limit)
+ {
+ m_points.add(point_d(x2, y2));
+ return;
+ }
+
+ if(da2 > m_cusp_limit)
+ {
+ m_points.add(point_d(x3, y3));
+ return;
+ }
+ }
+ }
+ break;
+ }
+
+ // Continue subdivision
+ //----------------------
+ recursive_bezier(x1, y1, x12, y12, x123, y123, x1234, y1234, level + 1);
+ recursive_bezier(x1234, y1234, x234, y234, x34, y34, x4, y4, level + 1);
+ }
+
+ //------------------------------------------------------------------------
+ void curve4_div::bezier(double x1, double y1,
+ double x2, double y2,
+ double x3, double y3,
+ double x4, double y4)
+ {
+ m_points.add(point_d(x1, y1));
+ recursive_bezier(x1, y1, x2, y2, x3, y3, x4, y4, 0);
+ m_points.add(point_d(x4, y4));
+ }
+
+}
diff --git a/3party/expat/expat_impl.h b/3party/expat/expat_impl.h
new file mode 100644
index 0000000000..2f2c28963d
--- /dev/null
+++ b/3party/expat/expat_impl.h
@@ -0,0 +1,868 @@
+#pragma once
+#ifndef DSSI_EXPATIMPL_H
+#define DSSI_EXPATIMPL_H
+
+#include <cstring>
+
+
+//-----------------------------------------------------------------------------
+//
+// @doc
+//
+// @module ExpatImpl.h - Expat class container |
+//
+// This module contains the definition of the expat class container.
+//
+// Copyright (c) 1994-2002 - Descartes Systems Sciences, Inc.
+//
+// @end
+//
+// $History: ExpatImpl.h $
+//
+// ***************** Version 1 *****************
+// User: Tim Smith Date: 1/29/02 Time: 1:57p
+// Created in $/Omni_V2/_ToolLib
+// 1. String.h now replaced with StringCode.h.
+// 2. StringRsrc.h modified to use new string class.
+// 3. Added tons of new classes from the wedge work.
+//
+//-----------------------------------------------------------------------------
+
+//-----------------------------------------------------------------------------
+//
+// Required include files
+//
+//-----------------------------------------------------------------------------
+
+#include <assert.h>
+#include <expat.h>
+
+//-----------------------------------------------------------------------------
+//
+// Forward definitions
+//
+//-----------------------------------------------------------------------------
+
+//-----------------------------------------------------------------------------
+//
+// Template class definition
+//
+//-----------------------------------------------------------------------------
+
+template <class _T>
+class CExpatImpl
+{
+
+// @access Constructors and destructors
+public:
+
+ // @cmember General constructor
+
+ CExpatImpl ()
+ {
+ m_p = NULL;
+ }
+
+ // @cmember Destructor
+
+ ~CExpatImpl ()
+ {
+ Destroy ();
+ }
+
+// @access Parser creation and deletion methods
+public:
+
+ // @cmember Create a parser
+
+ bool Create (const XML_Char *pszEncoding = NULL,
+ const XML_Char *pszSep = NULL)
+ {
+
+ //
+ // Destroy the old parser
+ //
+
+ Destroy ();
+
+ //
+ // If the encoding or seperator are empty, then NULL
+ //
+
+ if (pszEncoding != NULL && pszEncoding [0] == 0)
+ pszEncoding = NULL;
+ if (pszSep != NULL && pszSep [0] == 0)
+ pszSep = NULL;
+
+ //
+ // Create the new one
+ //
+
+ m_p = XML_ParserCreate_MM (pszEncoding, NULL, pszSep);
+ if (m_p == NULL)
+ return false;
+
+ //
+ // Invoke the post create routine
+ //
+
+ _T *pThis = static_cast <_T *> (this);
+ pThis ->OnPostCreate ();
+
+ //
+ // Set the user data used in callbacks
+ //
+
+ XML_SetUserData (m_p, (void *) this);
+ return true;
+ }
+
+ // @cmember Destroy the parser
+
+ void Destroy ()
+ {
+ if (m_p != NULL)
+ XML_ParserFree (m_p);
+ m_p = NULL;
+ }
+
+// @access Parser parse methods
+public:
+
+ // @cmember Parse a block of data
+
+ bool Parse (const char *pszBuffer, int nLength = -1, bool fIsFinal = true)
+ {
+
+ //
+ // Validate
+ //
+
+ assert (m_p != NULL);
+
+ //
+ // Get the length if not specified
+ //
+
+ if (nLength < 0)
+ nLength = strlen (pszBuffer);
+
+ //
+ // Invoke the parser
+ //
+
+ return XML_Parse (m_p, pszBuffer, nLength, fIsFinal) != 0;
+ }
+
+ // @cmember Parse a block of data
+
+#ifdef WCHAR
+ bool Parse (const WCHAR *pszBuffer, int nLength = -1, bool fIsFinal = true)
+ {
+
+ //
+ // Validate
+ //
+
+ assert (m_p != NULL);
+
+ //
+ // Get the length if not specified
+ //
+
+ if (nLength < 0)
+ nLength = wcslen (pszBuffer) * 2;
+
+ //
+ // Invoke the parser
+ //
+
+ return XML_Parse (m_p, pszBuffer, nLength, fIsFinal) != 0;
+ }
+#endif
+
+ // @cmember Parse internal buffer
+
+ bool ParseBuffer (int nLength, bool fIsFinal = true)
+ {
+ assert (m_p != NULL);
+ return XML_ParseBuffer (m_p, nLength, fIsFinal) != 0;
+ }
+
+ // @cmember Get the internal buffer
+
+ void *GetBuffer (int nLength)
+ {
+ assert (m_p != NULL);
+ return XML_GetBuffer (m_p, nLength);
+ }
+
+// @access Parser callback enable/disable methods
+public:
+
+ // @cmember Enable/Disable the start element handler
+
+ void EnableStartElementHandler (bool fEnable = true)
+ {
+ assert (m_p != NULL);
+ XML_SetStartElementHandler (m_p, fEnable ? StartElementHandler : NULL);
+ }
+
+ // @cmember Enable/Disable the end element handler
+
+ void EnableEndElementHandler (bool fEnable = true)
+ {
+ assert (m_p != NULL);
+ XML_SetEndElementHandler (m_p, fEnable ? EndElementHandler : NULL);
+ }
+
+ // @cmember Enable/Disable the element handlers
+
+ void EnableElementHandler (bool fEnable = true)
+ {
+ assert (m_p != NULL);
+ EnableStartElementHandler (fEnable);
+ EnableEndElementHandler (fEnable);
+ }
+
+ // @cmember Enable/Disable the character data handler
+
+ void EnableCharacterDataHandler (bool fEnable = true)
+ {
+ assert (m_p != NULL);
+ XML_SetCharacterDataHandler (m_p,
+ fEnable ? CharacterDataHandler : NULL);
+ }
+
+ // @cmember Enable/Disable the processing instruction handler
+
+ void EnableProcessingInstructionHandler (bool fEnable = true)
+ {
+ assert (m_p != NULL);
+ XML_SetProcessingInstructionHandler (m_p,
+ fEnable ? ProcessingInstructionHandler : NULL);
+ }
+
+ // @cmember Enable/Disable the comment handler
+
+ void EnableCommentHandler (bool fEnable = true)
+ {
+ assert (m_p != NULL);
+ XML_SetCommentHandler (m_p, fEnable ? CommentHandler : NULL);
+ }
+
+ // @cmember Enable/Disable the start CDATA section handler
+
+ void EnableStartCdataSectionHandler (bool fEnable = true)
+ {
+ assert (m_p != NULL);
+ XML_SetStartCdataSectionHandler (m_p,
+ fEnable ? StartCdataSectionHandler : NULL);
+ }
+
+ // @cmember Enable/Disable the end CDATA section handler
+
+ void EnableEndCdataSectionHandler (bool fEnable = true)
+ {
+ assert (m_p != NULL);
+ XML_SetEndCdataSectionHandler (m_p,
+ fEnable ? EndCdataSectionHandler : NULL);
+ }
+
+ // @cmember Enable/Disable the CDATA section handlers
+
+ void EnableCdataSectionHandler (bool fEnable = true)
+ {
+ assert (m_p != NULL);
+ EnableStartCdataSectionHandler (fEnable);
+ EnableEndCdataSectionHandler (fEnable);
+ }
+
+ // @cmember Enable/Disable default handler
+
+ void EnableDefaultHandler (bool fEnable = true, bool fExpand = true)
+ {
+ assert (m_p != NULL);
+ if (fExpand)
+ {
+ XML_SetDefaultHandlerExpand (m_p,
+ fEnable ? DefaultHandler : NULL);
+ }
+ else
+ XML_SetDefaultHandler (m_p, fEnable ? DefaultHandler : NULL);
+ }
+
+ // @cmember Enable/Disable external entity ref handler
+
+ void EnableExternalEntityRefHandler (bool fEnable = true)
+ {
+ assert (m_p != NULL);
+ XML_SetExternalEntityRefHandler (m_p,
+ fEnable ? ExternalEntityRefHandler : NULL);
+ }
+
+ // @cmember Enable/Disable unknown encoding handler
+
+ void EnableUnknownEncodingHandler (bool fEnable = true)
+ {
+ assert (m_p != NULL);
+ XML_SetUnknownEncodingHandler (m_p,
+ fEnable ? UnknownEncodingHandler : NULL);
+ }
+
+ // @cmember Enable/Disable start namespace handler
+
+ void EnableStartNamespaceDeclHandler (bool fEnable = true)
+ {
+ assert (m_p != NULL);
+ XML_SetStartNamespaceDeclHandler (m_p,
+ fEnable ? StartNamespaceDeclHandler : NULL);
+ }
+
+ // @cmember Enable/Disable end namespace handler
+
+ void EnableEndNamespaceDeclHandler (bool fEnable = true)
+ {
+ assert (m_p != NULL);
+ XML_SetEndNamespaceDeclHandler (m_p,
+ fEnable ? EndNamespaceDeclHandler : NULL);
+ }
+
+ // @cmember Enable/Disable namespace handlers
+
+ void EnableNamespaceDeclHandler (bool fEnable = true)
+ {
+ EnableStartNamespaceDeclHandler (fEnable);
+ EnableEndNamespaceDeclHandler (fEnable);
+ }
+
+ // @cmember Enable/Disable the XML declaration handler
+
+ void EnableXmlDeclHandler (bool fEnable = true)
+ {
+ assert (m_p != NULL);
+ XML_SetXmlDeclHandler (m_p, fEnable ? XmlDeclHandler : NULL);
+ }
+
+ // @cmember Enable/Disable the start DOCTYPE declaration handler
+
+ void EnableStartDoctypeDeclHandler (bool fEnable = true)
+ {
+ assert (m_p != NULL);
+ XML_SetStartDoctypeDeclHandler (m_p,
+ fEnable ? StartDoctypeDeclHandler : NULL);
+ }
+
+ // @cmember Enable/Disable the end DOCTYPE declaration handler
+
+ void EnableEndDoctypeDeclHandler (bool fEnable = true)
+ {
+ assert (m_p != NULL);
+ XML_SetEndDoctypeDeclHandler (m_p,
+ fEnable ? EndDoctypeDeclHandler : NULL);
+ }
+
+ // @cmember Enable/Disable the DOCTYPE declaration handler
+
+ void EnableDoctypeDeclHandler (bool fEnable = true)
+ {
+ assert (m_p != NULL);
+ EnableStartDoctypeDeclHandler (fEnable);
+ EnableEndDoctypeDeclHandler (fEnable);
+ }
+
+// @access Parser error reporting methods
+public:
+
+ // @cmember Get last error
+
+ enum XML_Error GetErrorCode ()
+ {
+ assert (m_p != NULL);
+ return XML_GetErrorCode (m_p);
+ }
+
+ // @cmember Get the current byte index
+
+ long GetCurrentByteIndex ()
+ {
+ assert (m_p != NULL);
+ return XML_GetCurrentByteIndex (m_p);
+ }
+
+ // @cmember Get the current line number
+
+ unsigned long GetCurrentLineNumber ()
+ {
+ assert (m_p != NULL);
+ return XML_GetCurrentLineNumber (m_p);
+ }
+
+ // @cmember Get the current column number
+
+ int GetCurrentColumnNumber ()
+ {
+ assert (m_p != NULL);
+ return XML_GetCurrentColumnNumber (m_p);
+ }
+
+ // @cmember Get the current byte count
+
+ int GetCurrentByteCount ()
+ {
+ assert (m_p != NULL);
+ return XML_GetCurrentByteCount (m_p);
+ }
+
+ // @cmember Get the input context
+
+ const char *GetInputContext (int *pnOffset, int *pnSize)
+ {
+ assert (m_p != NULL);
+ return XML_GetInputContext (m_p, pnOffset, pnSize);
+ }
+
+ // @cmember Get last error string
+
+ const XML_LChar *GetErrorString ()
+ {
+ return XML_ErrorString (GetErrorCode ());
+ }
+
+// @access Parser other methods
+public:
+
+ // @cmember Return the version string
+
+ static const XML_LChar *GetExpatVersion ()
+ {
+ return XML_ExpatVersion ();
+ }
+
+ // @cmember Get the version information
+
+/*
+ static void GetExpatVersion (int *pnMajor, int *pnMinor, int *pnMicro)
+ {
+ XML_expat_version v = XML_ExpatVersionInfo ();
+ if (pnMajor)
+ *pnMajor = v .major;
+ if (pnMinor)
+ *pnMinor = v .minor;
+ if (pnMicro)
+ *pnMicro = v .micro;
+ }
+*/
+
+ // @cmember Get last error string
+
+ static const XML_LChar *GetErrorString (enum XML_Error nError)
+ {
+ return XML_ErrorString (nError);
+ }
+
+// @access Public handler methods
+public:
+
+ // @cmember Start element handler
+
+ void OnStartElement (const XML_Char *pszName, const XML_Char **papszAttrs)
+ {
+ return;
+ }
+
+ // @cmember End element handler
+
+ void OnEndElement (const XML_Char *pszName)
+ {
+ return;
+ }
+
+ // @cmember Character data handler
+
+ void OnCharacterData (const XML_Char *pszData, int nLength)
+ {
+ return;
+ }
+
+ // @cmember Processing instruction handler
+
+ void OnProcessingInstruction (const XML_Char *pszTarget,
+ const XML_Char *pszData)
+ {
+ return;
+ }
+
+ // @cmember Comment handler
+
+ void OnComment (const XML_Char *pszData)
+ {
+ return;
+ }
+
+ // @cmember Start CDATA section handler
+
+ void OnStartCdataSection ()
+ {
+ return;
+ }
+
+ // @cmember End CDATA section handler
+
+ void OnEndCdataSection ()
+ {
+ return;
+ }
+
+ // @cmember Default handler
+
+ void OnDefault (const XML_Char *pszData, int nLength)
+ {
+ return;
+ }
+
+ // @cmember External entity ref handler
+
+ bool OnExternalEntityRef (const XML_Char *pszContext,
+ const XML_Char *pszBase, const XML_Char *pszSystemID,
+ const XML_Char *pszPublicID)
+ {
+ return false;
+ }
+
+ // @cmember Unknown encoding handler
+
+ bool OnUnknownEncoding (const XML_Char *pszName, XML_Encoding *pInfo)
+ {
+ return false;
+ }
+
+ // @cmember Start namespace declaration handler
+
+ void OnStartNamespaceDecl (const XML_Char *pszPrefix,
+ const XML_Char *pszURI)
+ {
+ return;
+ }
+
+ // @cmember End namespace declaration handler
+
+ void OnEndNamespaceDecl (const XML_Char *pszPrefix)
+ {
+ return;
+ }
+
+ // @cmember XML declaration handler
+
+ void OnXmlDecl (const XML_Char *pszVersion, const XML_Char *pszEncoding,
+ bool fStandalone)
+ {
+ return;
+ }
+
+ // @cmember Start DOCTYPE declaration handler
+
+ void OnStartDoctypeDecl (const XML_Char *pszDoctypeName,
+ const XML_Char *pszSysID, const XML_Char *pszPubID,
+ bool fHasInternalSubset)
+ {
+ return;
+ }
+
+ // @cmember End DOCTYPE declaration handler
+
+ void OnEndDoctypeDecl ()
+ {
+ return;
+ }
+
+// @access Protected methods
+protected:
+
+ // @cmember Handle any post creation
+
+ void OnPostCreate ()
+ {
+ }
+
+// @access Protected static methods
+protected:
+
+ // @cmember Start element handler wrapper
+
+ static void StartElementHandler (void *pUserData,
+ const XML_Char *pszName, const XML_Char **papszAttrs)
+ {
+ _T *pThis = static_cast <_T *> ((CExpatImpl <_T> *) pUserData);
+ pThis ->OnStartElement (pszName, papszAttrs);
+ }
+
+ // @cmember End element handler wrapper
+
+ static void EndElementHandler (void *pUserData,
+ const XML_Char *pszName)
+ {
+ _T *pThis = static_cast <_T *> ((CExpatImpl <_T> *) pUserData);
+ pThis ->OnEndElement (pszName);
+ }
+
+ // @cmember Character data handler wrapper
+
+ static void CharacterDataHandler (void *pUserData,
+ const XML_Char *pszData, int nLength)
+ {
+ _T *pThis = static_cast <_T *> ((CExpatImpl <_T> *) pUserData);
+ pThis ->OnCharacterData (pszData, nLength);
+ }
+
+ // @cmember Processing instruction handler wrapper
+
+ static void ProcessingInstructionHandler (void *pUserData,
+ const XML_Char *pszTarget, const XML_Char *pszData)
+ {
+ _T *pThis = static_cast <_T *> ((CExpatImpl <_T> *) pUserData);
+ pThis ->OnProcessingInstruction (pszTarget, pszData);
+ }
+
+ // @cmember Comment handler wrapper
+
+ static void CommentHandler (void *pUserData,
+ const XML_Char *pszData)
+ {
+ _T *pThis = static_cast <_T *> ((CExpatImpl <_T> *) pUserData);
+ pThis ->OnComment (pszData);
+ }
+
+ // @cmember Start CDATA section wrapper
+
+ static void StartCdataSectionHandler (void *pUserData)
+ {
+ _T *pThis = static_cast <_T *> ((CExpatImpl <_T> *) pUserData);
+ pThis ->OnStartCdataSection ();
+ }
+
+ // @cmember End CDATA section wrapper
+
+ static void EndCdataSectionHandler (void *pUserData)
+ {
+ _T *pThis = static_cast <_T *> ((CExpatImpl <_T> *) pUserData);
+ pThis ->OnEndCdataSection ();
+ }
+
+ // @cmember Default wrapper
+
+ static void DefaultHandler (void *pUserData,
+ const XML_Char *pszData, int nLength)
+ {
+ _T *pThis = static_cast <_T *> ((CExpatImpl <_T> *) pUserData);
+ pThis ->OnDefault (pszData, nLength);
+ }
+
+ // @cmember External entity ref wrapper
+
+ static int ExternalEntityRefHandler (void *pUserData,
+ const XML_Char *pszContext, const XML_Char *pszBase,
+ const XML_Char *pszSystemID, const XML_Char *pszPublicID)
+ {
+ _T *pThis = static_cast <_T *> ((CExpatImpl <_T> *) pUserData);
+ return pThis ->OnExternalEntityRef (pszContext,
+ pszBase, pszSystemID, pszPublicID) ? 1 : 0;
+ }
+
+ // @cmember Unknown encoding wrapper
+
+ static int UnknownEncodingHandler (void *pUserData,
+ const XML_Char *pszName, XML_Encoding *pInfo)
+ {
+ _T *pThis = static_cast <_T *> ((CExpatImpl <_T> *) pUserData);
+ return pThis ->OnUnknownEncoding (pszName, pInfo) ? 1 : 0;
+ }
+
+ // @cmember Start namespace decl wrapper
+
+ static void StartNamespaceDeclHandler (void *pUserData,
+ const XML_Char *pszPrefix, const XML_Char *pszURI)
+ {
+ _T *pThis = static_cast <_T *> ((CExpatImpl <_T> *) pUserData);
+ pThis ->OnStartNamespaceDecl (pszPrefix, pszURI);
+ }
+
+ // @cmember End namespace decl wrapper
+
+ static void EndNamespaceDeclHandler (void *pUserData,
+ const XML_Char *pszPrefix)
+ {
+ _T *pThis = static_cast <_T *> ((CExpatImpl <_T> *) pUserData);
+ pThis ->OnEndNamespaceDecl (pszPrefix);
+ }
+
+ // @cmember XML declaration wrapper
+
+ static void XmlDeclHandler (void *pUserData,
+ const XML_Char *pszVersion, const XML_Char *pszEncoding,
+ int nStandalone)
+ {
+ _T *pThis = static_cast <_T *> ((CExpatImpl <_T> *) pUserData);
+ pThis ->OnXmlDecl (pszVersion, pszEncoding, nStandalone != 0);
+ }
+
+ // @cmember Start Doctype declaration wrapper
+
+ static void StartDoctypeDeclHandler (void *pUserData,
+ const XML_Char *pszDoctypeName, const XML_Char *pszSysID,
+ const XML_Char *pszPubID, int nHasInternalSubset)
+ {
+ _T *pThis = static_cast <_T *> ((CExpatImpl <_T> *) pUserData);
+ pThis ->OnStartDoctypeDecl (pszDoctypeName, pszSysID,
+ pszPubID, nHasInternalSubset != 0);
+ }
+
+ // @cmember End Doctype declaration wrapper
+
+ static void EndDoctypeDeclHandler (void *pUserData)
+ {
+ _T *pThis = static_cast <_T *> ((CExpatImpl <_T> *) pUserData);
+ pThis ->OnEndDoctypeDecl ();
+ }
+
+// @access Protected members
+protected:
+
+ XML_Parser m_p;
+};
+
+//-----------------------------------------------------------------------------
+//
+// Virtual method class definition
+//
+//-----------------------------------------------------------------------------
+
+class CExpat : public CExpatImpl <CExpat>
+{
+// @access Constructors and destructors
+public:
+
+ CExpat ()
+ {
+ }
+
+ virtual ~CExpat() {}
+
+// @access Public handler methods
+public:
+
+ // @cmember Start element handler
+
+ virtual void OnStartElement (const XML_Char * /*pszName*/,
+ const XML_Char ** /*papszAttrs*/)
+ {
+ return;
+ }
+
+ // @cmember End element handler
+
+ virtual void OnEndElement (const XML_Char * /*pszName*/)
+ {
+ return;
+ }
+
+ // @cmember Character data handler
+
+ virtual void OnCharacterData (const XML_Char * /*pszData*/, int /*nLength*/)
+ {
+ return;
+ }
+
+ // @cmember Processing instruction handler
+
+ virtual void OnProcessingInstruction (const XML_Char * /*pszTarget*/,
+ const XML_Char * /*pszData*/)
+ {
+ return;
+ }
+
+ // @cmember Comment handler
+
+ virtual void OnComment (const XML_Char * /*pszData*/)
+ {
+ return;
+ }
+
+ // @cmember Start CDATA section handler
+
+ virtual void OnStartCdataSection ()
+ {
+ return;
+ }
+
+ // @cmember End CDATA section handler
+
+ virtual void OnEndCdataSection ()
+ {
+ return;
+ }
+
+ // @cmember Default handler
+
+ virtual void OnDefault (const XML_Char * /*pszData*/, int /*nLength*/)
+ {
+ return;
+ }
+
+ // @cmember External entity ref handler
+
+ virtual bool OnExternalEntityRef (const XML_Char * /*pszContext*/,
+ const XML_Char * /*pszBase*/, const XML_Char * /*pszSystemID*/,
+ const XML_Char * /*pszPublicID*/)
+ {
+ return false;
+ }
+
+ // @cmember Unknown encoding handler
+
+ virtual bool OnUnknownEncoding (const XML_Char * /*pszName*/, XML_Encoding * /*pInfo*/)
+ {
+ return false;
+ }
+
+ // @cmember Start namespace declaration handler
+
+ virtual void OnStartNamespaceDecl (const XML_Char * /*pszPrefix*/,
+ const XML_Char * /*pszURI*/)
+ {
+ return;
+ }
+
+ // @cmember End namespace declaration handler
+
+ virtual void OnEndNamespaceDecl (const XML_Char * /*pszPrefix*/)
+ {
+ return;
+ }
+
+ // @cmember XML declaration handler
+
+ virtual void OnXmlDecl (const XML_Char * /*pszVersion*/,
+ const XML_Char * /*pszEncoding*/, bool /*fStandalone*/)
+ {
+ return;
+ }
+
+ // @cmember Start DOCTYPE declaration handler
+
+ virtual void OnStartDoctypeDecl (const XML_Char * /*pszDoctypeName*/,
+ const XML_Char * /*pszSysID*/, const XML_Char * /*pszPubID*/,
+ bool /*fHasInternalSubset*/)
+ {
+ return;
+ }
+
+ // @cmember End DOCTYPE declaration handler
+
+ virtual void OnEndDoctypeDecl ()
+ {
+ return;
+ }
+};
+
+#endif // DSSI_EXPATIMPL_H
diff --git a/3party/fct/fct.h b/3party/fct/fct.h
new file mode 100644
index 0000000000..d4a6ee357f
--- /dev/null
+++ b/3party/fct/fct.h
@@ -0,0 +1,3959 @@
+/*
+====================================================================
+Copyright (c) 2008 Ian Blumel. All rights reserved.
+
+FCTX (Fast C Test) Unit Testing Framework
+
+Copyright (c) 2008, Ian Blumel (ian.blumel@gmail.com)
+All rights reserved.
+
+This license is based on the BSD License.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+ * Redistributions of source code must retain the above copyright
+ notice, this list of conditions and the following disclaimer.
+
+ * Redistributions in binary form must reproduce the above copyright
+ notice, this list of conditions and the following disclaimer in
+ the documentation and/or other materials provided with the
+ distribution.
+
+ * Neither the name of, Ian Blumel, nor the names of its
+ contributors may be used to endorse or promote products derived
+ from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
+IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
+TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
+PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
+OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+====================================================================
+
+File: fct.h
+*/
+
+#if !defined(FCT_INCLUDED__IMB)
+#define FCT_INCLUDED__IMB
+
+/* Configuration Values. You can over-ride these values in your own
+header, then include this header. For example, in your file, myfct.h,
+
+ #define FCT_DEFAULT_LOGGER "standard"
+ #include "fct.h"
+
+then if your unit tests included, myfct.h, you would default to work
+with a standard logger. */
+
+#if !defined(FCT_DEFAULT_LOGGER)
+# define FCT_DEFAULT_LOGGER "standard"
+#endif /* !FCT_DEFAULT_LOGGER */
+
+#define FCT_VERSION_MAJOR 1
+#define FCT_VERSION_MINOR 6
+#define FCT_VERSION_MICRO 1
+
+#define _FCT_QUOTEME(x) #x
+#define FCT_QUOTEME(x) _FCT_QUOTEME(x)
+
+#define FCT_VERSION_STR (FCT_QUOTEME(FCT_VERSION_MAJOR) "."\
+ FCT_QUOTEME(FCT_VERSION_MINOR) "."\
+ FCT_QUOTEME(FCT_VERSION_MICRO))
+
+#include <string.h>
+#include <assert.h>
+#include <stdarg.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include <time.h>
+#include <float.h>
+#include <math.h>
+#include <ctype.h>
+
+#define FCT_MAX_NAME 256
+#define FCT_MAX_LOG_LINE 256
+
+#define nbool_t int
+#define FCT_TRUE 1
+#define FCT_FALSE 0
+
+#define FCTMIN(x, y) ( x < y) ? (x) : (y)
+
+#ifndef __INTEL_COMPILER
+/* Use regular assertions for non-Intel compilers */
+#define FCT_ASSERT(expr) assert(expr)
+#else
+/* Silence Intel warnings on assert(expr && "str") or assert("str") */
+#define FCT_ASSERT(expr) do { \
+ _Pragma("warning(push,disable:279)"); \
+ assert(expr); \
+ _Pragma("warning(pop)"); \
+ } while (0)
+#endif
+
+#if defined(__cplusplus)
+#define FCT_EXTERN_C extern "C"
+#else
+#define FCT_EXTERN_C
+#endif
+
+/* Forward declarations. The following forward declarations are required
+because there is a inter-relationship between certain objects that
+just can not be untwined. */
+typedef struct _fct_logger_evt_t fct_logger_evt_t;
+typedef struct _fct_logger_i fct_logger_i;
+typedef struct _fct_logger_types_t fct_logger_types_t;
+typedef struct _fct_standard_logger_t fct_standard_logger_t;
+typedef struct _fct_junit_logger_t fct_junit_logger_t;
+typedef struct _fct_minimal_logger_t fct_minimal_logger_t;
+typedef struct _fctchk_t fctchk_t;
+typedef struct _fct_test_t fct_test_t;
+typedef struct _fct_ts_t fct_ts_t;
+typedef struct _fctkern_t fctkern_t;
+
+/* Forward declare some functions used throughout. */
+static fct_logger_i*
+fct_standard_logger_new(void);
+
+static fct_logger_i*
+fct_minimal_logger_new(void);
+
+static fct_junit_logger_t *
+fct_junit_logger_new(void);
+
+static void
+fct_logger__del(fct_logger_i *logger);
+
+static void
+fct_logger__on_chk(fct_logger_i *self, fctchk_t const *chk);
+
+static void
+fct_logger__on_test_start(fct_logger_i *logger, fct_test_t const *test);
+
+static void
+fct_logger__on_test_end(fct_logger_i *logger, fct_test_t *test);
+
+static void
+fct_logger__on_test_suite_start(fct_logger_i *logger, fct_ts_t const *ts);
+
+static void
+fct_logger__on_test_suite_end(fct_logger_i *logger, fct_ts_t const *ts);
+
+static void
+fct_logger__on_test_suite_skip(
+ fct_logger_i *logger,
+ char const *condition,
+ char const *name
+);
+
+static void
+fct_logger__on_test_skip(
+ fct_logger_i *logger,
+ char const *condition,
+ char const *name
+);
+
+
+static void
+fct_logger__on_warn(fct_logger_i *logger, char const *warn);
+
+
+
+/* Explicitly indicate a no-op */
+#define fct_pass()
+
+#define fct_unused(x) (void)(x)
+
+/* This is just a little trick to let me put comments inside of macros. I
+really only want to bother with this when we are "unwinding" the macros
+for debugging purposes. */
+#if defined(FCT_CONF_UNWIND)
+# define _fct_cmt(string) {char*_=string;}
+#else
+# define _fct_cmt(string)
+#endif
+
+/*
+--------------------------------------------------------
+UTILITIES
+--------------------------------------------------------
+*/
+
+
+/* STDIO and STDERR redirect support */
+#define FCT_PIPE_RESERVE_BYTES_DEFAULT 512
+static int fct_stdout_pipe[2];
+static int fct_stderr_pipe[2];
+static int fct_saved_stdout;
+static int fct_saved_stderr;
+
+/* Platform indepedent pipe functions. TODO: Look to figure this out in a way
+that follows the ISO C++ conformant naming convention. */
+#if defined(WIN32)
+# include <io.h>
+# include <fcntl.h>
+# define _fct_pipe(_PFDS_) \
+ _pipe((_PFDS_), FCT_PIPE_RESERVE_BYTES_DEFAULT, _O_TEXT)
+# define _fct_dup _dup
+# define _fct_dup2 _dup2
+# define _fct_close _close
+# define _fct_read _read
+/* Until I can figure a better way to do this, rely on magic numbers. */
+# define STDOUT_FILENO 1
+# define STDERR_FILENO 2
+#else
+# include <unistd.h>
+# define _fct_pipe pipe
+# define _fct_dup dup
+# define _fct_dup2 dup2
+# define _fct_close close
+# define _fct_read read
+#endif /* WIN32 */
+
+
+
+
+static void
+fct_switch_std_to_buffer(int std_pipe[2], FILE *out, int fileno_, int *save_handle)
+{
+ fflush(out);
+ *save_handle = _fct_dup(fileno_);
+ if ( _fct_pipe(std_pipe) != 0 )
+ {
+ exit(1);
+ }
+ _fct_dup2(std_pipe[1], fileno_);
+ _fct_close(std_pipe[1]);
+}
+
+
+static void
+fct_switch_std_to_std(FILE *out, int fileno_, int save_handle)
+{
+ fflush(out);
+ _fct_dup2(save_handle, fileno_);
+}
+
+
+#define FCT_SWITCH_STDOUT_TO_BUFFER() \
+ fct_switch_std_to_buffer(fct_stdout_pipe, stdout, STDOUT_FILENO, &fct_saved_stdout)
+#define FCT_SWITCH_STDOUT_TO_STDOUT() \
+ fct_switch_std_to_std(stdout, STDOUT_FILENO, fct_saved_stdout)
+#define FCT_SWITCH_STDERR_TO_BUFFER() \
+ fct_switch_std_to_buffer(fct_stderr_pipe, stderr, STDERR_FILENO, &fct_saved_stderr)
+#define FCT_SWITCH_STDERR_TO_STDERR() \
+ fct_switch_std_to_std(stderr, STDERR_FILENO, fct_saved_stderr)
+
+
+/* Utility for truncated, safe string copies. The NUM
+should be the length of DST plus the null-termintor. */
+static void
+fctstr_safe_cpy(char *dst, char const *src, size_t num)
+{
+ FCT_ASSERT( dst != NULL );
+ FCT_ASSERT( src != NULL );
+ FCT_ASSERT( num > 0 );
+#if defined(WIN32) && _MSC_VER >= 1400
+ strncpy_s(dst, num, src, _TRUNCATE);
+#else
+ strncpy(dst, src, num);
+#endif
+ dst[num-1] = '\0';
+}
+
+/* Isolate the vsnprintf implementation */
+static int
+fct_vsnprintf(char *buffer,
+ size_t buffer_len,
+ char const *format,
+ va_list args)
+{
+ int count =0;
+ /* Older microsoft compilers where not ANSI compliant with this
+ function and you had to use _vsnprintf. I will assume that newer
+ Microsoft Compilers start implementing vsnprintf. */
+#if defined(_MSC_VER) && (_MSC_VER < 1400)
+ count = _vsnprintf(buffer, buffer_len, format, args);
+#elif defined(_MSC_VER) && (_MSC_VER >= 1400)
+ count = vsnprintf_s(buffer, buffer_len, _TRUNCATE, format, args);
+#else
+ count = vsnprintf(buffer, buffer_len, format, args);
+#endif
+ return count;
+}
+
+
+/* Isolate the snprintf implemenation. */
+static int
+fct_snprintf(char *buffer, size_t buffer_len, char const *format, ...)
+{
+ int count =0;
+ va_list args;
+ va_start(args, format);
+ count =fct_vsnprintf(buffer, buffer_len, format, args);
+ va_end(args);
+ return count;
+}
+
+
+/* Helper to for cloning strings on the heap. Returns NULL for
+an out of memory condition. */
+static char*
+fctstr_clone(char const *s)
+{
+ char *k =NULL;
+ size_t klen =0;
+ FCT_ASSERT( s != NULL && "invalid arg");
+ klen = strlen(s)+1;
+ k = (char*)malloc(sizeof(char)*klen+1);
+ fctstr_safe_cpy(k, s, klen);
+ return k;
+}
+
+
+/* Clones and returns a lower case version of the original string. */
+static char*
+fctstr_clone_lower(char const *s)
+{
+ char *k =NULL;
+ size_t klen =0;
+ size_t i;
+ if ( s == NULL )
+ {
+ return NULL;
+ }
+ klen = strlen(s)+1;
+ k = (char*)malloc(sizeof(char)*klen+1);
+ for ( i=0; i != klen; ++i )
+ {
+ k[i] = (char)tolower(s[i]);
+ }
+ return k;
+}
+
+
+/* A very, very simple "filter". This just compares the supplied prefix
+against the test_str, to see if they both have the same starting
+characters. If they do we return true, otherwise we return false. If the
+prefix is a blank string or NULL, then it will return FCT_TRUE.*/
+static nbool_t
+fct_filter_pass(char const *prefix, char const *test_str)
+{
+ nbool_t is_match = FCT_FALSE;
+ char const *prefix_p;
+ char const *test_str_p;
+
+ /* If you got nothing to test against, why test? */
+ FCT_ASSERT( test_str != NULL );
+
+ /* When the prefix is NULL or blank, we always return FCT_TRUE. */
+ if ( prefix == NULL || prefix[0] == '\0' )
+ {
+ return FCT_TRUE;
+ }
+
+ /* Iterate through both character arrays at the same time. We are
+ going to play a game and see if we can beat the house. */
+ for ( prefix_p = prefix, test_str_p = test_str;
+ *prefix_p != '\0' && *test_str_p != '\0';
+ ++prefix_p, ++test_str_p )
+ {
+ is_match = *prefix_p == *test_str_p;
+ if ( !is_match )
+ {
+ break; /* Quit the first time we don't match. */
+ }
+ }
+
+ /* If the iterator for the test_str is pointing at the null char, and
+ the iterator for the prefix string is not, then the prefix string is
+ larger than the actual test string, and therefore we failed to pass the
+ filter. */
+ if ( *test_str_p == '\0' && *prefix_p != '\0' )
+ {
+ return FCT_FALSE;
+ }
+
+ /* is_match will be set to the either FCT_TRUE if we kicked of the loop
+ early because our filter ran out of characters or FCT_FALSE if we
+ encountered a mismatch before our filter ran out of characters. */
+ return is_match;
+}
+
+
+/* Routine checks if two strings are equal. Taken from
+http://publications.gbdirect.co.uk/c_book/chapter5/character_handling.html
+*/
+static int
+fctstr_eq(char const *s1, char const *s2)
+{
+ if ( s1 == s2 )
+ {
+ return 1;
+ }
+ if ( (s1 == NULL && s2 != NULL)
+ || (s1 != NULL && s2 == NULL) )
+ {
+ return 0;
+ }
+ while (*s1 == *s2)
+ {
+ if (*s1 == '\0')
+ return 1;
+ s1++;
+ s2++;
+ }
+ /* Difference detected! */
+ return 0;
+}
+
+
+static int
+fctstr_ieq(char const *s1, char const *s2)
+{
+ if ( s1 == s2 )
+ {
+ return 1;
+ }
+ if ( (s1 == NULL && s2 != NULL)
+ || (s1 != NULL && s2 == NULL) )
+ {
+ return 0;
+ }
+ while (tolower(*s1) == tolower(*s2))
+ {
+ if (*s1 == '\0')
+ return 1;
+ s1++;
+ s2++;
+ }
+ /* Difference detected! */
+ return 0;
+}
+
+
+/* Returns 1 if the STR contains the CHECK_INCL substring. NULL's
+are handled, and NULL always INCLUDES NULL. This check is case
+sensitive. If two strings point to the same place they are
+included. */
+static int
+fctstr_incl(char const *str, char const *check_incl)
+{
+ static char const *blank_s = "";
+ char const *found = NULL;
+ if ( str == NULL )
+ {
+ str = blank_s;
+ }
+ if ( check_incl == NULL )
+ {
+ check_incl = blank_s;
+ }
+ if ( str == check_incl )
+ {
+ return 1;
+ }
+ found = strstr(str, check_incl);
+ return found != NULL;
+}
+
+
+/* Does a case insensitive include check. */
+static int
+fctstr_iincl(char const *str, char const *check_incl)
+{
+ /* Going to do this with a memory allocation to save coding
+ time. In the future this can be rewritten. Both clone_lower
+ and _incl are NULL tolerant. */
+ char *lstr = fctstr_clone_lower(str);
+ char *lcheck_incl = fctstr_clone_lower(check_incl);
+ int found = fctstr_incl(lstr, lcheck_incl);
+ free(lstr);
+ free(lcheck_incl);
+ return found;
+}
+
+
+/* Returns true if STR starts with CHECK. NULL and NULL is consider
+true. */
+static int
+fctstr_startswith(char const *str, char const *check)
+{
+ char const *sp;
+ if ( str == NULL && check == NULL )
+ {
+ return 1;
+ }
+ else if ( ((str == NULL) && (check != NULL))
+ || ((str != NULL) && (check == NULL)) )
+ {
+ return 0;
+ }
+ sp = strstr(str, check);
+ return sp == str;
+}
+
+
+/* Case insenstive variant of fctstr_startswith. */
+static int
+fctstr_istartswith(char const *str, char const *check)
+{
+ /* Taking the lazy approach for now. */
+ char *istr = fctstr_clone_lower(str);
+ char *icheck = fctstr_clone_lower(check);
+ /* TODO: check for memory. */
+ int startswith = fctstr_startswith(istr, icheck);
+ free(istr);
+ free(icheck);
+ return startswith;
+}
+
+
+/* Returns true if the given string ends with the given
+check. Treats NULL as a blank string, and as such, will
+pass the ends with (a blank string endswith a blank string). */
+static int
+fctstr_endswith(char const *str, char const *check)
+{
+ size_t check_i;
+ size_t str_i;
+ if ( str == NULL && check == NULL )
+ {
+ return 1;
+ }
+ else if ( ((str == NULL) && (check != NULL))
+ || ((str != NULL) && (check == NULL)) )
+ {
+ return 0;
+ }
+ check_i = strlen(check);
+ str_i = strlen(str);
+ if ( str_i < check_i )
+ {
+ return 0; /* Can't do it string is too small. */
+ }
+ for ( ; check_i != 0; --check_i, --str_i)
+ {
+ if ( str[str_i] != check[check_i] )
+ {
+ return 0; /* Found a case where they are not equal. */
+ }
+ }
+ /* Exahausted check against string, can only be true. */
+ return 1;
+}
+
+
+static int
+fctstr_iendswith(char const *str, char const *check)
+{
+ size_t check_i;
+ size_t str_i;
+ if ( str == NULL && check == NULL )
+ {
+ return 1;
+ }
+ else if ( ((str == NULL) && (check != NULL))
+ || ((str != NULL) && (check == NULL)) )
+ {
+ return 0;
+ }
+ check_i = strlen(check);
+ str_i = strlen(str);
+ if ( str_i < check_i )
+ {
+ return 0; /* Can't do it string is too small. */
+ }
+ for ( ; check_i != 0; --check_i, --str_i)
+ {
+ if ( tolower(str[str_i]) != tolower(check[check_i]) )
+ {
+ return 0; /* Found a case where they are not equal. */
+ }
+ }
+ /* Exahausted check against string, can only be true. */
+ return 1;
+}
+
+
+/* Use this with the _end variant to get the
+
+STARTSWITH ........................................ END
+
+effect. Assumes that the line will be maxwidth in characters. The
+maxwidth can't be greater than FCT_DOTTED_MAX_LEN. */
+#define FCT_DOTTED_MAX_LEN 256
+static void
+fct_dotted_line_start(size_t maxwidth, char const *startwith)
+{
+ char line[FCT_DOTTED_MAX_LEN];
+ size_t len =0;
+ size_t line_len =0;
+
+ memset(line, '.', sizeof(char)*maxwidth);
+ len = strlen(startwith);
+ line_len = FCTMIN(maxwidth-1, len);
+ memcpy(line, startwith, sizeof(char)*line_len);
+ if ( len < maxwidth-1)
+ {
+ line[len] = ' ';
+ }
+ line[maxwidth-1] = '\0';
+ fputs(line, stdout);
+}
+
+
+static void
+fct_dotted_line_end(char const *endswith)
+{
+ printf(" %s\n", endswith);
+}
+
+
+/*
+--------------------------------------------------------
+TIMER
+--------------------------------------------------------
+This is a low-res implementation at the moment.
+
+We will improve this in the future, and isolate the
+implementation from the rest of the code.
+*/
+
+typedef struct _fct_timer_t fct_timer_t;
+struct _fct_timer_t
+{
+ clock_t start;
+ clock_t stop;
+ double duration;
+};
+
+
+static void
+fct_timer__init(fct_timer_t *timer)
+{
+ FCT_ASSERT(timer != NULL);
+ memset(timer, 0, sizeof(fct_timer_t));
+}
+
+
+static void
+fct_timer__start(fct_timer_t *timer)
+{
+ FCT_ASSERT(timer != NULL);
+ timer->start = clock();
+}
+
+
+static void
+fct_timer__stop(fct_timer_t *timer)
+{
+ FCT_ASSERT(timer != NULL);
+ timer->stop = clock();
+ timer->duration = (double) (timer->stop - timer->start) / CLOCKS_PER_SEC;
+}
+
+
+/* Returns the time in seconds. */
+static double
+fct_timer__duration(fct_timer_t const *timer)
+{
+ FCT_ASSERT( timer != NULL );
+ return timer->duration;
+}
+
+
+/*
+--------------------------------------------------------
+GENERIC LIST
+--------------------------------------------------------
+*/
+
+/* For now we will just keep it at a linear growth rate. */
+#define FCT_LIST_GROWTH_FACTOR 2
+
+/* Starting size for the list, to keep it simple we will start
+at a reasonable size. */
+#define FCT_LIST_DEFAULT_START_SZ 8
+
+/* Helper macros for quickly iterating through a list. You should be able
+to do something like,
+
+ FCT_NLIST_FOREACH_BGN(fct_logger_i*, logger, my_list)
+ {
+ fct_logger__on_blah(logger);
+ }
+ FCT_NLIST_FOREACH_END();
+
+*/
+#define FCT_NLIST_FOREACH_BGN(Type, Var, List)\
+{\
+ if ( List != NULL ) {\
+ size_t item_i##Var;\
+ size_t num_items##Var = fct_nlist__size(List);\
+ for( item_i##Var =0; item_i##Var != num_items##Var; ++item_i##Var )\
+ {\
+ Type Var = (Type) fct_nlist__at((List), item_i##Var);
+
+#define FCT_NLIST_FOREACH_END() }}}
+
+/* Used to manage a list of loggers. This works mostly like
+the STL vector, where the array grows as more items are
+appended. */
+typedef struct _fct_nlist_t fct_nlist_t;
+struct _fct_nlist_t
+{
+ /* Item's are stored as pointers to void. */
+ void **itm_list;
+
+ /* Indicates the number of element's in the array. */
+ size_t avail_itm_num;
+
+ /* Indicates the number of actually elements in the array. */
+ size_t used_itm_num;
+};
+typedef void (*fct_nlist_on_del_t)(void*);
+
+
+/* Clears the contents of the list, and sets the list count to 0. The
+actual count remains unchanged. If on_del is supplied it is executed
+against each list element. */
+static void
+fct_nlist__clear(fct_nlist_t *list, fct_nlist_on_del_t on_del)
+{
+ size_t itm_i__ =0;
+ FCT_ASSERT( list != NULL );
+ if ( on_del != NULL )
+ {
+ for ( itm_i__=0; itm_i__ != list->used_itm_num; ++itm_i__ )
+ {
+ on_del(list->itm_list[itm_i__]);
+ }
+ }
+ list->used_itm_num =0;
+}
+
+
+/* If you used init, then close with final. This is useful for
+working with structures that live on the stack. */
+static void
+fct_nlist__final(fct_nlist_t *list, fct_nlist_on_del_t on_del)
+{
+ FCT_ASSERT( list != NULL );
+ fct_nlist__clear(list, on_del);
+ free(list->itm_list);
+}
+
+
+static int
+fct_nlist__init2(fct_nlist_t *list, size_t start_sz)
+{
+ FCT_ASSERT( list != NULL );
+ if ( start_sz == 0 )
+ {
+ list->itm_list = NULL;
+ }
+ else
+ {
+ list->itm_list = (void**)malloc(sizeof(void*)*start_sz);
+ if ( list->itm_list == NULL )
+ {
+ return 0;
+ }
+ }
+ /* If these are both 0, then they are equal and that means
+ that the first append operation will allocate memory. The beauty
+ here is that if the list remains empty, then we save a malloc.
+ Empty lists are relatively common in FCT (consider an error list). */
+ list->avail_itm_num = start_sz;
+ list->used_itm_num =0;
+ return 1;
+}
+
+
+/* Initializes a list. Useful for populating existing structures.
+Returns 0 if there was an error allocating memory. Returns 1 otherwise. */
+#define fct_nlist__init(_LIST_PTR_) \
+ (fct_nlist__init2((_LIST_PTR_), FCT_LIST_DEFAULT_START_SZ))
+
+
+/* Returns the number of elements within the list. */
+static size_t
+fct_nlist__size(fct_nlist_t const *list)
+{
+ FCT_ASSERT( list != NULL );
+ return list->used_itm_num;
+}
+
+
+/* Returns the item at idx, asserts otherwise. */
+static void*
+fct_nlist__at(fct_nlist_t const *list, size_t idx)
+{
+ FCT_ASSERT( list != NULL );
+ FCT_ASSERT( idx < list->used_itm_num );
+ return list->itm_list[idx];
+}
+
+
+static void
+fct_nlist__append(fct_nlist_t *list, void *itm)
+{
+ FCT_ASSERT( list != NULL );
+ /* If we ran out of room, then the last increment should be equal to the
+ available space, in this case we need to grow a little more. If this
+ list started as size 0, then we should encounter the same effect as
+ "running out of room." */
+ if ( list->used_itm_num == list->avail_itm_num )
+ {
+ /* Use multiple and add, since the avail_itm_num could be 0. */
+ list->avail_itm_num = list->avail_itm_num*FCT_LIST_GROWTH_FACTOR+\
+ FCT_LIST_GROWTH_FACTOR;
+ list->itm_list = (void**)realloc(
+ list->itm_list, sizeof(void*)*list->avail_itm_num
+ );
+ FCT_ASSERT( list->itm_list != NULL && "memory check");
+ }
+
+ list->itm_list[list->used_itm_num] = itm;
+ ++(list->used_itm_num);
+}
+
+
+
+/*
+-----------------------------------------------------------
+A SINGLE CHECK
+-----------------------------------------------------------
+This defines a single check. It indicates what the check was,
+and where it occurred. A "Test" object will have-a bunch
+of "checks".
+*/
+
+struct _fctchk_t
+{
+ /* This string that represents the condition. */
+ char cndtn[FCT_MAX_LOG_LINE];
+
+ /* These indicate where the condition occurred. */
+ char file[FCT_MAX_LOG_LINE];
+
+ int lineno;
+
+ nbool_t is_pass;
+
+ /* This is a message that we can "format into", if
+ no format string is specified this should be
+ equivalent to the cntdn. */
+ char msg[FCT_MAX_LOG_LINE];
+};
+
+#define fctchk__is_pass(_CHK_) ((_CHK_)->is_pass)
+#define fctchk__file(_CHK_) ((_CHK_)->file)
+#define fctchk__lineno(_CHK_) ((_CHK_)->lineno)
+#define fctchk__cndtn(_CHK_) ((_CHK_)->cndtn)
+#define fctchk__msg(_CHK_) ((_CHK_)->msg)
+
+static fctchk_t*
+fctchk_new(int is_pass,
+ char const *cndtn,
+ char const *file,
+ int lineno,
+ char const *format,
+ va_list args)
+{
+ fctchk_t *chk = NULL;
+
+ FCT_ASSERT( cndtn != NULL );
+ FCT_ASSERT( file != NULL );
+ FCT_ASSERT( lineno > 0 );
+
+ chk = (fctchk_t*)calloc(1, sizeof(fctchk_t));
+ if ( chk == NULL )
+ {
+ return NULL;
+ }
+
+ fctstr_safe_cpy(chk->cndtn, cndtn, FCT_MAX_LOG_LINE);
+ fctstr_safe_cpy(chk->file, file, FCT_MAX_LOG_LINE);
+ chk->lineno = lineno;
+
+ chk->is_pass =is_pass;
+
+ if ( format != NULL )
+ {
+ fct_vsnprintf(chk->msg, FCT_MAX_LOG_LINE, format, args);
+ }
+ else
+ {
+ /* Default to make the condition be the message, if there was no format
+ specified. */
+ fctstr_safe_cpy(chk->msg, cndtn, FCT_MAX_LOG_LINE);
+ }
+
+ return chk;
+}
+
+
+/* Cleans up a "check" object. If the `chk` is NULL, this function does
+nothing. */
+static void
+fctchk__del(fctchk_t *chk)
+{
+ if ( chk == NULL )
+ {
+ return;
+ }
+ free( chk );
+}
+
+
+/*
+-----------------------------------------------------------
+A TEST
+-----------------------------------------------------------
+A suite will have-a list of tests. Where each test will have-a
+list of failed and passed checks.
+*/
+
+struct _fct_test_t
+{
+ /* List of failed and passed "checks" (fctchk_t). Two seperate
+ lists make it faster to determine how many checks passed and how
+ many checks failed. */
+ fct_nlist_t failed_chks;
+ fct_nlist_t passed_chks;
+
+ /* To store the test run time */
+ fct_timer_t timer;
+
+ /* The name of the test case. */
+ char name[FCT_MAX_NAME];
+};
+
+#define fct_test__name(_TEST_) ((_TEST_)->name)
+
+/* Clears the failed tests ... partly for internal testing. */
+#define fct_test__clear_failed(test) \
+ fct_nlist__clear(test->failed_chks, (fct_nlist_on_del_t)fctchk__del);\
+
+
+static void
+fct_test__del(fct_test_t *test)
+{
+ if (test == NULL )
+ {
+ return;
+ }
+ fct_nlist__final(&(test->passed_chks), (fct_nlist_on_del_t)fctchk__del);
+ fct_nlist__final(&(test->failed_chks), (fct_nlist_on_del_t)fctchk__del);
+ free(test);
+}
+
+
+static fct_test_t*
+fct_test_new(char const *name)
+{
+ nbool_t ok =FCT_FALSE;
+ fct_test_t *test =NULL;
+
+ test = (fct_test_t*)malloc(sizeof(fct_test_t));
+ if ( test == NULL )
+ {
+ return NULL;
+ }
+
+ fctstr_safe_cpy(test->name, name, FCT_MAX_NAME);
+
+ /* Failures are an exception, so lets not allocate up
+ the list until we need to. */
+ fct_nlist__init2(&(test->failed_chks), 0);
+ if (!fct_nlist__init(&(test->passed_chks)))
+ {
+ ok =FCT_FALSE;
+ goto finally;
+ }
+
+ fct_timer__init(&(test->timer));
+
+ ok =FCT_TRUE;
+finally:
+ if ( !ok )
+ {
+ fct_test__del(test);
+ test =NULL;
+ }
+ return test;
+}
+
+
+static void
+fct_test__start_timer(fct_test_t *test)
+{
+ FCT_ASSERT( test != NULL );
+ fct_timer__start(&(test->timer));
+}
+
+
+static void
+fct_test__stop_timer(fct_test_t *test)
+{
+ FCT_ASSERT( test != NULL );
+ fct_timer__stop(&(test->timer));
+}
+
+
+static double
+fct_test__duration(fct_test_t const *test)
+{
+ FCT_ASSERT( test != NULL );
+ return fct_timer__duration(&(test->timer));
+}
+
+
+static nbool_t
+fct_test__is_pass(fct_test_t const *test)
+{
+ FCT_ASSERT( test != NULL );
+ return fct_nlist__size(&(test->failed_chks)) == 0;
+}
+
+
+static void
+fct_test__add(fct_test_t *test, fctchk_t *chk)
+{
+
+ FCT_ASSERT( test != NULL );
+ FCT_ASSERT( chk != NULL );
+
+ if ( fctchk__is_pass(chk) )
+ {
+ fct_nlist__append(&(test->passed_chks), (void*)chk);
+ }
+ else
+ {
+ fct_nlist__append(&(test->failed_chks), (void*)chk);
+ }
+}
+
+/* Returns the number of checks made throughout the test. */
+static size_t
+fct_test__chk_cnt(fct_test_t const *test)
+{
+ FCT_ASSERT( test != NULL );
+ return fct_nlist__size(&(test->failed_chks)) \
+ + fct_nlist__size(&(test->passed_chks));
+}
+
+
+/*
+-----------------------------------------------------------
+TEST SUITE (TS)
+-----------------------------------------------------------
+*/
+
+
+/* The different types of 'modes' that a test suite can be in.
+
+While the test suite is iterating through all the tests, its "State"
+can change from "setup mode", to "test mode" to "tear down" mode.
+These help to indicate what mode are currently in. Think of it as a
+basic FSM.
+
+ if the count was 0 end
+ +--------->---------------------> ending_mode-----+-+
+ | ^ |
+ ^ | ^
+start | [if no more tests] |
+ | | | |
+ +-count_mode -> setup_mode -> test_mode -> teardown_mode->-+
+ | ^ | |
+ | +-----------<---------------+ |
+ +----------->---[if fct_req fails]--------+
+
+*/
+enum ts_mode
+{
+ ts_mode_cnt, /* To setup when done counting. */
+ ts_mode_setup, /* To test when done setup. */
+ ts_mode_teardown, /* To ending mode, when no more tests. */
+ ts_mode_test, /* To tear down mode. */
+ ts_mode_ending, /* To ... */
+ ts_mode_end, /* .. The End. */
+ ts_mode_abort /* Abort */
+};
+
+/* Types of states the test could be in. */
+typedef enum
+{
+ fct_test_status_SUCCESS,
+ fct_test_status_FAILURE
+} fct_test_status;
+
+
+struct _fct_ts_t
+{
+ /* For counting our 'current' test number, and the total number of
+ tests. */
+ int curr_test_num;
+ int total_test_num;
+
+ /* Keeps track of the current state of the object while it is walking
+ through its "FSM" */
+ enum ts_mode mode;
+
+ /* The name of the test suite. */
+ char name[FCT_MAX_NAME];
+
+ /* List of tests that where executed within the test suite. */
+ fct_nlist_t test_list;
+};
+
+
+#define fct_ts__is_setup_mode(ts) ((ts)->mode == ts_mode_setup)
+#define fct_ts__is_teardown_mode(ts) ((ts)->mode == ts_mode_teardown)
+#define fct_ts__is_test_mode(ts) ((ts)->mode == ts_mode_test)
+#define fct_ts__is_ending_mode(ts) ((ts)->mode == ts_mode_ending)
+#define fct_ts__is_end(ts) ((ts)->mode == ts_mode_end)
+#define fct_ts__is_cnt_mode(ts) ((ts)->mode == ts_mode_cnt)
+#define fct_ts__is_abort_mode(ts) ((ts)->mode == ts_mode_abort)
+
+/* This cndtn is set when we have iterated through all the tests, and
+there was nothing more to do. */
+#define fct_ts__ending(ts) ((ts)->mode = ts_mode_ending)
+
+/* Flag a test suite as complete. It will no longer accept any more tests. */
+#define fct_ts__end(ts) ((ts)->mode = ts_mode_end)
+
+#define fct_ts__name(ts) ((ts)->name)
+
+
+static void
+fct_ts__del(fct_ts_t *ts)
+{
+ if ( ts == NULL )
+ {
+ return;
+ }
+ fct_nlist__final(&(ts->test_list), (fct_nlist_on_del_t)fct_test__del);
+ free(ts);
+}
+
+static fct_ts_t *
+fct_ts_new(char const *name)
+{
+ fct_ts_t *ts =NULL;
+ ts = (fct_ts_t*)calloc(1, sizeof(fct_ts_t));
+ FCT_ASSERT( ts != NULL );
+
+ fctstr_safe_cpy(ts->name, name, FCT_MAX_NAME);
+ ts->mode = ts_mode_cnt;
+ fct_nlist__init(&(ts->test_list));
+ return ts;
+}
+
+
+
+static nbool_t
+fct_ts__is_more_tests(fct_ts_t const *ts)
+{
+ FCT_ASSERT( ts != NULL );
+ FCT_ASSERT( !fct_ts__is_end(ts) );
+ return ts->curr_test_num < ts->total_test_num;
+}
+
+
+/* Indicates that we have started a test case. */
+static void
+fct_ts__test_begin(fct_ts_t *ts)
+{
+ FCT_ASSERT( !fct_ts__is_end(ts) );
+ ++(ts->curr_test_num);
+}
+
+
+/* Takes OWNERSHIP of a test object, and warehouses it for later stat
+generation. */
+static void
+fct_ts__add_test(fct_ts_t *ts, fct_test_t *test)
+{
+ FCT_ASSERT( ts != NULL && "invalid arg");
+ FCT_ASSERT( test != NULL && "invalid arg");
+ FCT_ASSERT( !fct_ts__is_end(ts) );
+ fct_nlist__append(&(ts->test_list), test);
+}
+
+
+static void
+fct_ts__test_end(fct_ts_t *ts)
+{
+ FCT_ASSERT( ts != NULL );
+ /* After a test has completed, move to teardown mode. */
+ ts->mode = ts_mode_teardown;
+}
+
+
+/* Increments the internal count by 1. */
+static void
+fct_ts__inc_total_test_num(fct_ts_t *ts)
+{
+ FCT_ASSERT( ts != NULL );
+ FCT_ASSERT( fct_ts__is_cnt_mode(ts) );
+ FCT_ASSERT( !fct_ts__is_end(ts) );
+ ++(ts->total_test_num);
+}
+
+
+/* Flags the end of the setup, which implies we are going to move into
+setup mode. You must be already in setup mode for this to work! */
+static void
+fct_ts__setup_end(fct_ts_t *ts)
+{
+ if ( ts->mode != ts_mode_abort )
+ {
+ ts->mode = ts_mode_test;
+ }
+}
+
+
+static fct_test_t *
+fct_ts__make_abort_test(fct_ts_t *ts)
+{
+ char setup_testname[FCT_MAX_LOG_LINE+1] = {'\0'};
+ char const *suitename = fct_ts__name(ts);
+ fct_snprintf(setup_testname, FCT_MAX_LOG_LINE, "setup_%s", suitename);
+ return fct_test_new(setup_testname);
+}
+
+/* Flags a pre-mature abort of a setup (like a failed fct_req). */
+static void
+fct_ts__setup_abort(fct_ts_t *ts)
+{
+ FCT_ASSERT( ts != NULL );
+ ts->mode = ts_mode_abort;
+}
+
+/* Flags the end of the teardown, which implies we are going to move
+into setup mode (for the next 'iteration'). */
+static void
+fct_ts__teardown_end(fct_ts_t *ts)
+{
+ if ( ts->mode == ts_mode_abort )
+ {
+ return; /* Because we are aborting . */
+ }
+ /* We have to decide if we should keep on testing by moving into tear down
+ mode or if we have reached the real end and should be moving into the
+ ending mode. */
+ if ( fct_ts__is_more_tests(ts) )
+ {
+ ts->mode = ts_mode_setup;
+ }
+ else
+ {
+ ts->mode = ts_mode_ending;
+ }
+}
+
+
+/* Flags the end of the counting, and proceeding to the first setup.
+Consider the special case when a test suite has NO tests in it, in
+that case we will have a current count that is zero, in which case
+we can skip right to 'ending'. */
+static void
+fct_ts__cnt_end(fct_ts_t *ts)
+{
+ FCT_ASSERT( ts != NULL );
+ FCT_ASSERT( fct_ts__is_cnt_mode(ts) );
+ FCT_ASSERT( !fct_ts__is_end(ts) );
+ if (ts->total_test_num == 0 )
+ {
+ ts->mode = ts_mode_ending;
+ }
+ else
+ {
+ ts->mode = ts_mode_setup;
+ }
+}
+
+
+static nbool_t
+fct_ts__is_test_cnt(fct_ts_t const *ts, int test_num)
+{
+ FCT_ASSERT( ts != NULL );
+ FCT_ASSERT( 0 <= test_num );
+ FCT_ASSERT( test_num < ts->total_test_num );
+ FCT_ASSERT( !fct_ts__is_end(ts) );
+
+ /* As we roll through the tests we increment the count. With this
+ count we can decide if we need to execute a test or not. */
+ return test_num == ts->curr_test_num;
+}
+
+
+/* Returns the # of tests on the FCT TS object. This is the actual
+# of tests executed. */
+static size_t
+fct_ts__tst_cnt(fct_ts_t const *ts)
+{
+ FCT_ASSERT( ts != NULL );
+ FCT_ASSERT(
+ fct_ts__is_end(ts)
+ && "can't count number of tests executed until the test suite ends"
+ );
+ return fct_nlist__size(&(ts->test_list));
+}
+
+
+/* Returns the # of tests in the TS object that passed. */
+static size_t
+fct_ts__tst_cnt_passed(fct_ts_t const *ts)
+{
+ size_t tally =0;
+
+ FCT_ASSERT( ts != NULL );
+ FCT_ASSERT( fct_ts__is_end(ts) );
+
+ FCT_NLIST_FOREACH_BGN(fct_test_t*, test, &(ts->test_list))
+ {
+ if ( fct_test__is_pass(test) )
+ {
+ tally += 1;
+ }
+ }
+ FCT_NLIST_FOREACH_END();
+ return tally;
+}
+
+
+/* Returns the # of checks made throughout a test suite. */
+static size_t
+fct_ts__chk_cnt(fct_ts_t const *ts)
+{
+ size_t tally =0;
+
+ FCT_ASSERT( ts != NULL );
+
+ FCT_NLIST_FOREACH_BGN(fct_test_t *, test, &(ts->test_list))
+ {
+ tally += fct_test__chk_cnt(test);
+ }
+ FCT_NLIST_FOREACH_END();
+ return tally;
+}
+
+/* Currently the duration is simply a sum of all the tests. */
+static double
+fct_ts__duration(fct_ts_t const *ts)
+{
+ double tally =0.0;
+ FCT_ASSERT( ts != NULL );
+ FCT_NLIST_FOREACH_BGN(fct_test_t *, test, &(ts->test_list))
+ {
+ tally += fct_test__duration(test);
+ }
+ FCT_NLIST_FOREACH_END();
+ return tally;
+}
+
+
+/*
+--------------------------------------------------------
+FCT COMMAND LINE OPTION INITIALIZATION (fctcl_init)
+--------------------------------------------------------
+
+Structure used for command line initialization. To keep it clear that we do
+not delete the char*'s present on this structure.
+*/
+
+
+typedef enum
+{
+ FCTCL_STORE_UNDEFINED,
+ FCTCL_STORE_TRUE,
+ FCTCL_STORE_VALUE
+} fctcl_store_t;
+
+
+typedef struct _fctcl_init_t
+{
+ /* What to parse for this option. --long versus -s. */
+ char const *long_opt; /* i.e. --help */
+ char const *short_opt; /* i.e. -h */
+
+ /* What action to take when the option is activated. */
+ fctcl_store_t action;
+
+ /* The help string for the action. */
+ char const *help;
+} fctcl_init_t;
+
+
+/* Use when defining the option list. */
+#define FCTCL_INIT_NULL \
+ {NULL, NULL, FCTCL_STORE_UNDEFINED, NULL}
+
+
+/*
+--------------------------------------------------------
+FCT COMMAND LINE OPTION (fctcl)
+--------------------------------------------------------
+
+Specifies the command line configuration options. Use this
+to help initialize the fct_clp (command line parser).
+*/
+
+
+/* Handy strings for storing "true" and "false". We can reference
+these strings throughout the parse operation and not have to
+worry about dealing with memory. */
+#define FCTCL_TRUE_STR "1"
+
+
+typedef struct _fctcl_t
+{
+ /* What to parse for this option. --long versus -s. */
+ char *long_opt; /* i.e. --help */
+ char *short_opt; /* i.e. -h */
+
+ /* What action to take when the option is activated. */
+ fctcl_store_t action;
+
+ /* The help string for the action. */
+ char *help;
+
+ /* The result. */
+ char *value;
+} fctcl_t;
+
+
+#define fctcl_new() ((fctcl_t*)calloc(1, sizeof(fctcl_t)))
+
+
+static void
+fctcl__del(fctcl_t *clo)
+{
+ if ( clo == NULL )
+ {
+ return;
+ }
+ if ( clo->long_opt )
+ {
+ free(clo->long_opt);
+ }
+ if ( clo->short_opt)
+ {
+ free(clo->short_opt);
+ }
+ if ( clo->value )
+ {
+ free(clo->value);
+ }
+ if ( clo->help )
+ {
+ free(clo->help);
+ }
+ free(clo);
+}
+
+
+static fctcl_t*
+fctcl_new2(fctcl_init_t const *clo_init)
+{
+ fctcl_t *clone = NULL;
+ int ok =0;
+ clone = fctcl_new();
+ if ( clone == NULL )
+ {
+ return NULL;
+ }
+ clone->action = clo_init->action;
+ if ( clo_init->help == NULL )
+ {
+ clone->help = NULL;
+ }
+ else
+ {
+ clone->help = fctstr_clone(clo_init->help);
+ if ( clone->help == NULL )
+ {
+ ok =0;
+ goto finally;
+ }
+ }
+ if ( clo_init->long_opt == NULL )
+ {
+ clone->long_opt = NULL;
+ }
+ else
+ {
+ clone->long_opt = fctstr_clone(clo_init->long_opt);
+ if ( clone->long_opt == NULL )
+ {
+ ok = 0;
+ goto finally;
+ }
+ }
+ if ( clo_init->short_opt == NULL )
+ {
+ clone->short_opt = NULL;
+ }
+ else
+ {
+ clone->short_opt = fctstr_clone(clo_init->short_opt);
+ if ( clone->short_opt == NULL )
+ {
+ ok =0;
+ goto finally;
+ }
+ }
+ ok = 1;
+finally:
+ if ( !ok )
+ {
+ fctcl__del(clone);
+ clone = NULL;
+ }
+ return clone;
+}
+
+
+static int
+fctcl__is_option(fctcl_t const *clo, char const *option)
+{
+ FCT_ASSERT( clo != NULL );
+ if ( option == NULL )
+ {
+ return 0;
+ }
+ return ((clo->long_opt != NULL
+ && fctstr_eq(clo->long_opt, option))
+ ||
+ (clo->short_opt != NULL
+ && fctstr_eq(clo->short_opt, option))
+ );
+}
+
+
+#define fctcl__set_value(_CLO_, _VAL_) \
+ (_CLO_)->value = fctstr_clone((_VAL_));
+
+/*
+--------------------------------------------------------
+FCT COMMAND PARSER (fct_clp)
+--------------------------------------------------------
+*/
+
+#define FCT_CLP_MAX_ERR_MSG_LEN 256
+
+typedef struct _fct_clp_t
+{
+ /* List of command line options. */
+ fct_nlist_t clo_list;
+
+ /* List of parameters (not options). */
+ fct_nlist_t param_list;
+
+ char error_msg[FCT_CLP_MAX_ERR_MSG_LEN];
+ int is_error;
+} fct_clp_t;
+
+
+static void
+fct_clp__final(fct_clp_t *clp)
+{
+ fct_nlist__final(&(clp->clo_list), (fct_nlist_on_del_t)fctcl__del);
+ fct_nlist__final(&(clp->param_list), (fct_nlist_on_del_t)free);
+}
+
+
+/* Add an configuration options. */
+static int
+fct_clp__add_options(fct_clp_t *clp, fctcl_init_t const *options)
+{
+ fctcl_init_t const *pclo =NULL;
+ int ok;
+ for ( pclo = options; pclo->action != FCTCL_STORE_UNDEFINED; ++pclo )
+ {
+ fctcl_t *cpy = fctcl_new2(pclo);
+ if ( cpy == NULL )
+ {
+ ok = 0;
+ goto finally;
+ }
+ fct_nlist__append(&(clp->clo_list), (void*)cpy);
+ }
+ ok =1;
+finally:
+ return ok;
+}
+
+/* Returns false if we ran out of memory. */
+static int
+fct_clp__init(fct_clp_t *clp, fctcl_init_t const *options)
+{
+ int ok =0;
+ FCT_ASSERT( clp != NULL );
+ /* It is just much saner to manage a clone of the options. Then we know
+ who is in charge of the memory. */
+ ok = fct_nlist__init(&(clp->clo_list));
+ if ( !ok )
+ {
+ goto finally;
+ }
+ if ( options != NULL )
+ {
+ ok = fct_clp__add_options(clp, options);
+ if ( !ok )
+ {
+ goto finally;
+ }
+ }
+ ok = fct_nlist__init(&(clp->param_list));
+ if ( !ok )
+ {
+ goto finally;
+ }
+ ok =1;
+finally:
+ if ( !ok )
+ {
+ fct_clp__final(clp);
+ }
+ return ok;
+}
+
+
+/* Parses the command line arguments. Use fct_clp__is_error and
+fct_clp__get_error to figure out if something went awry. */
+static void
+fct_clp__parse(fct_clp_t *clp, int argc, char const *argv[])
+{
+ int argi =1;
+ int is_option =0;
+ char *arg =NULL;
+ char *token =NULL;
+ char *next_token =NULL;
+
+ clp->error_msg[0] = '\0';
+ clp->is_error =0;
+
+ while ( argi < argc )
+ {
+ is_option =0;
+ token =NULL;
+ next_token = NULL;
+ arg = fctstr_clone(argv[argi]);
+
+#if defined(_MSC_VER) && _MSC_VER > 1300
+ token = strtok_s(arg, "=", &next_token);
+#else
+ token = strtok(arg, "=");
+ next_token = strtok(NULL, "=");
+#endif
+
+ FCT_NLIST_FOREACH_BGN(fctcl_t*, pclo, &(clp->clo_list))
+ {
+ /* Need to reset for each search. strtok below is destructive. */
+ if ( fctcl__is_option(pclo, token) )
+ {
+ is_option =1;
+ if ( pclo->action == FCTCL_STORE_VALUE )
+ {
+ /* If this is --xxxx=value then the next strtok should succeed.
+ Otherwise, we need to chew up the next argument. */
+ if ( next_token != NULL && strlen(next_token) > 0 )
+ {
+ fctcl__set_value(pclo, next_token);
+ }
+ else
+ {
+ ++argi; /* Chew up the next value */
+ if ( argi >= argc )
+ {
+ /* error */
+ fct_snprintf(
+ clp->error_msg,
+ FCT_CLP_MAX_ERR_MSG_LEN,
+ "missing argument for %s",
+ token
+ );
+ clp->is_error =1;
+ break;
+ }
+ fctcl__set_value(pclo, argv[argi]);
+ }
+ }
+ else if (pclo->action == FCTCL_STORE_TRUE)
+ {
+ fctcl__set_value(pclo, FCTCL_TRUE_STR);
+ }
+ else
+ {
+ FCT_ASSERT("undefined action requested");
+ }
+ break; /* No need to parse this argument further. */
+ }
+ }
+ FCT_NLIST_FOREACH_END();
+ /* If we have an error, exit. */
+ if ( clp->is_error )
+ {
+ break;
+ }
+ /* If we walked through all the options, and didn't find
+ anything, then we must have a parameter. Forget the fact that
+ an unknown option will be treated like a parameter... */
+ if ( !is_option )
+ {
+ fct_nlist__append(&(clp->param_list), arg);
+ arg =NULL; /* Owned by the nlist */
+ }
+ ++argi;
+ if ( arg != NULL )
+ {
+ free(arg);
+ arg =NULL;
+ }
+ }
+}
+
+
+static fctcl_t const*
+fct_clp__get_clo(fct_clp_t const *clp, char const *option)
+{
+ fctcl_t const *found =NULL;
+
+ FCT_NLIST_FOREACH_BGN(fctcl_t const*, pclo, &(clp->clo_list))
+ {
+ if ( fctcl__is_option(pclo, option) )
+ {
+ found = pclo;
+ break;
+ }
+ }
+ FCT_NLIST_FOREACH_END();
+ return found;
+}
+
+
+#define fct_clp__optval(_CLP_, _OPTION_) \
+ fct_clp__optval2((_CLP_), (_OPTION_), NULL)
+
+
+/* Returns the value parsed at the command line, and equal to OPTION.
+If the value wasn't parsed, the DEFAULT_VAL is returned instead. */
+static char const*
+fct_clp__optval2(fct_clp_t *clp, char const *option, char const *default_val)
+{
+ fctcl_t const *clo =NULL;
+ FCT_ASSERT( clp != NULL );
+ FCT_ASSERT( option != NULL );
+ clo = fct_clp__get_clo(clp, option);
+ if ( clo == NULL || clo->value == NULL)
+ {
+ return default_val;
+ }
+ return clo->value;
+}
+
+
+
+/* Mainly used for unit tests. */
+static int
+fct_clp__is_param(fct_clp_t *clp, char const *param)
+{
+ if ( clp == NULL || param == NULL )
+ {
+ return 0;
+ }
+ FCT_NLIST_FOREACH_BGN(char *, aparam, &(clp->param_list))
+ {
+ if ( fctstr_eq(aparam, param) )
+ {
+ return 1;
+ }
+ }
+ FCT_NLIST_FOREACH_END();
+ return 0;
+}
+
+
+#define fct_clp__is_error(_CLP_) ((_CLP_)->is_error)
+#define fct_clp__get_error(_CLP_) ((_CLP_)->error_msg);
+
+#define fct_clp__num_clo(_CLP_) \
+ (fct_nlist__size(&((_CLP_)->clo_list)))
+
+#define fct_clp__param_cnt(_CLP_) \
+ (fct_nlist__size(&((_CLP_)->param_list)))
+
+/* Returns a *reference* to the parameter at _IDX_. Do not modify
+its contents. */
+#define fct_clp__param_at(_CLP_, _IDX_) \
+ ((char const*)fct_nlist__at(&((_CLP_)->param_list), (_IDX_)))
+
+
+/* Returns true if the given option was on the command line.
+Use either the long or short option name to check against. */
+#define fct_clp__is(_CLP_, _OPTION_) \
+ (fct_clp__optval((_CLP_), (_OPTION_)) != NULL)
+
+
+
+/*
+--------------------------------------------------------
+FCT NAMESPACE
+--------------------------------------------------------
+
+The macros below start to pollute the watch window with
+lots of "system" variables. This NAMESPACE is an
+attempt to hide all the "system" variables in one place.
+*/
+typedef struct _fct_namespace_t
+{
+ /* The currently active test suite. */
+ fct_ts_t *ts_curr;
+ int ts_is_skip_suite;
+ char const *ts_skip_cndtn;
+
+ /* Current test name. */
+ char const* curr_test_name;
+ fct_test_t *curr_test;
+ const char *test_skip_cndtn;
+ int test_is_skip;
+
+ /* Counts the number of tests in a test suite. */
+ int test_num;
+
+ /* Set at the end of the test suites. */
+ size_t num_total_failed;
+} fct_namespace_t;
+
+
+static void
+fct_namespace_init(fct_namespace_t *ns)
+{
+ FCT_ASSERT( ns != NULL && "invalid argument!");
+ memset(ns, 0, sizeof(fct_namespace_t));
+}
+
+
+/*
+--------------------------------------------------------
+FCT KERNAL
+--------------------------------------------------------
+
+The "fctkern" is a singleton that is defined throughout the
+system.
+*/
+
+struct _fctkern_t
+{
+ /* Holds variables used throughout MACRO MAGIC. In order to reduce
+ the "noise" in the watch window during a debug trace. */
+ fct_namespace_t ns;
+
+ /* Command line parsing. */
+ fct_clp_t cl_parser;
+
+ /* Hold onto the command line arguments. */
+ int cl_argc;
+ char const **cl_argv;
+ /* Track user options. */
+ fctcl_init_t const *cl_user_opts;
+
+ /* Tracks the delay parsing. */
+ int cl_is_parsed;
+
+ /* This is an list of loggers that can be used in the fct system. */
+ fct_nlist_t logger_list;
+
+ /* Array of custom types, you have built-in system ones and you
+ have optionally supplied user ones.. */
+ fct_logger_types_t *lt_usr;
+ fct_logger_types_t *lt_sys;
+
+ /* This is a list of prefix's that can be used to determine if a
+ test is should be run or not. */
+ fct_nlist_t prefix_list;
+
+ /* This is a list of test suites that where generated throughout the
+ testing process. */
+ fct_nlist_t ts_list;
+
+ /* Records what we expect to fail. */
+ size_t num_expected_failures;
+};
+
+
+#define FCT_OPT_VERSION "--version"
+#define FCT_OPT_VERSION_SHORT "-v"
+#define FCT_OPT_HELP "--help"
+#define FCT_OPT_HELP_SHORT "-h"
+#define FCT_OPT_LOGGER "--logger"
+#define FCT_OPT_LOGGER_SHORT "-l"
+static fctcl_init_t FCT_CLP_OPTIONS[] =
+{
+ /* Totally unsafe, since we are assuming we can clean out this data,
+ what I need to do is have an "initialization" object, full of
+ const objects. But for now, this should work. */
+ {
+ FCT_OPT_VERSION,
+ FCT_OPT_VERSION_SHORT,
+ FCTCL_STORE_TRUE,
+ "Displays the FCTX version number and exits."
+ },
+ {
+ FCT_OPT_HELP,
+ FCT_OPT_HELP_SHORT,
+ FCTCL_STORE_TRUE,
+ "Shows this help."
+ },
+ {
+ FCT_OPT_LOGGER,
+ FCT_OPT_LOGGER_SHORT,
+ FCTCL_STORE_VALUE,
+ NULL
+ },
+ FCTCL_INIT_NULL /* Sentinel */
+};
+
+typedef fct_logger_i* (*fct_logger_new_fn)(void);
+struct _fct_logger_types_t
+{
+ char const *name;
+ fct_logger_new_fn logger_new_fn;
+ char const *desc;
+};
+
+static fct_logger_types_t FCT_LOGGER_TYPES[] =
+{
+ {
+ "standard",
+ (fct_logger_new_fn)fct_standard_logger_new,
+ "the basic fctx logger"
+ },
+ {
+ "minimal",
+ (fct_logger_new_fn)fct_minimal_logger_new,
+ "the least amount of logging information."
+ },
+ {
+ "junit",
+ (fct_logger_new_fn)fct_junit_logger_new,
+ "junit compatable xml"
+ },
+ {NULL, (fct_logger_new_fn)NULL, NULL} /* Sentinel */
+};
+
+
+/* Returns the number of filters defined for the fct kernal. */
+#define fctkern__filter_cnt(_NK_) (fct_nlist__size(&((_NK_)->prefix_list)))
+
+
+static void
+fctkern__add_logger(fctkern_t *nk, fct_logger_i *logger_owns)
+{
+ FCT_ASSERT(nk != NULL && "invalid arg");
+ FCT_ASSERT(logger_owns != NULL && "invalid arg");
+ fct_nlist__append(&(nk->logger_list), logger_owns);
+}
+
+
+static void
+fctkern__write_help(fctkern_t *nk, FILE *out)
+{
+ fct_clp_t *clp = &(nk->cl_parser);
+ fprintf(out, "test.exe [options] prefix_filter ...\n\n");
+ FCT_NLIST_FOREACH_BGN(fctcl_t*, clo, &(clp->clo_list))
+ {
+ if ( clo->short_opt != NULL )
+ {
+ fprintf(out, "%s, %s\n", clo->short_opt, clo->long_opt);
+ }
+ else
+ {
+ fprintf(out, "%s\n", clo->long_opt);
+ }
+ if ( !fctstr_ieq(clo->long_opt, FCT_OPT_LOGGER) )
+ {
+ /* For now lets not get to fancy with the text wrapping. */
+ fprintf(out, " %s\n", clo->help);
+ }
+ else
+ {
+ fct_logger_types_t *types[2];
+ int type_i;
+ fct_logger_types_t *itr;
+ types[0] = nk->lt_sys;
+ types[1] = nk->lt_usr;
+ fputs(" Sets the logger. The types of loggers currently "
+ "available are,\n", out);
+ for (type_i =0; type_i != 2; ++type_i )
+ {
+ for ( itr=types[type_i]; itr && itr->name != NULL; ++itr )
+ {
+ fprintf(out, " =%s : %s\n", itr->name, itr->desc);
+ }
+ }
+ fprintf(out, " default is '%s'.\n", FCT_DEFAULT_LOGGER);
+ }
+ }
+ FCT_NLIST_FOREACH_END();
+ fputs("\n", out);
+}
+
+
+/* Appends a prefix filter that is used to determine if a test can
+be executed or not. If the test starts with the same characters as
+the prefix, then it should be "runnable". The prefix filter must be
+a non-NULL, non-Blank string. */
+static void
+fctkern__add_prefix_filter(fctkern_t *nk, char const *prefix_filter)
+{
+ char *filter =NULL;
+ size_t filter_len =0;
+ FCT_ASSERT( nk != NULL && "invalid arg" );
+ FCT_ASSERT( prefix_filter != NULL && "invalid arg" );
+ FCT_ASSERT( strlen(prefix_filter) > 0 && "invalid arg" );
+ /* First we make a copy of the prefix, then we store it away
+ in our little list. */
+ filter_len = strlen(prefix_filter);
+ filter = (char*)malloc(sizeof(char)*(filter_len+1));
+ fctstr_safe_cpy(filter, prefix_filter, filter_len+1);
+ fct_nlist__append(&(nk->prefix_list), (void*)filter);
+}
+
+
+/* Cleans up the contents of a fctkern. NULL does nothing. */
+static void
+fctkern__final(fctkern_t *nk)
+{
+ if ( nk == NULL )
+ {
+ return;
+ }
+ fct_clp__final(&(nk->cl_parser));
+ fct_nlist__final(&(nk->logger_list), (fct_nlist_on_del_t)fct_logger__del);
+ /* The prefix list is a list of malloc'd strings. */
+ fct_nlist__final(&(nk->prefix_list), (fct_nlist_on_del_t)free);
+ fct_nlist__final(&(nk->ts_list), (fct_nlist_on_del_t)fct_ts__del);
+}
+
+
+#define fctkern__cl_is_parsed(_NK_) ((_NK_)->cl_is_parsed)
+
+
+static int
+fctkern__cl_is(fctkern_t *nk, char const *opt_str)
+{
+ FCT_ASSERT( opt_str != NULL );
+ return opt_str[0] != '\0'
+ && fct_clp__is(&(nk->cl_parser), opt_str);
+}
+
+
+/* Returns the command line value given by OPT_STR. If OPT_STR was not defined
+at the command line, DEF_STR is returned (you can use NULL for the DEF_STR).
+The result returned should not be mofidied, and MAY even be the same pointer
+to DEF_STR. */
+static char const *
+fctkern__cl_val2(fctkern_t *nk, char const *opt_str, char const *def_str)
+{
+ FCT_ASSERT( opt_str != NULL );
+ if ( nk == NULL )
+ {
+ return NULL;
+ }
+ return fct_clp__optval2(&(nk->cl_parser), opt_str, def_str);
+}
+
+
+/* Selects a logger from the list based on the selection name.
+May return NULL if the name doesn't exist in the list. */
+static fct_logger_i*
+fckern_sel_log(fct_logger_types_t *search, char const *sel_logger)
+{
+ fct_logger_types_t *iter;
+ FCT_ASSERT(search != NULL);
+ FCT_ASSERT(sel_logger != NULL);
+ FCT_ASSERT(strlen(sel_logger) > 0);
+ for ( iter = search; iter->name != NULL; ++iter)
+ {
+ if ( fctstr_ieq(iter->name, sel_logger) )
+ {
+ return iter->logger_new_fn();
+ }
+ }
+ return NULL;
+}
+
+static int
+fctkern__cl_parse_config_logger(fctkern_t *nk)
+{
+ fct_logger_i *logger =NULL;
+ char const *sel_logger =NULL;
+ char const *def_logger =FCT_DEFAULT_LOGGER;
+ sel_logger = fctkern__cl_val2(nk, FCT_OPT_LOGGER, def_logger);
+ FCT_ASSERT(sel_logger != NULL && "should never be NULL");
+ /* First search the user selected types, then search the
+ built-in types. */
+ if ( nk->lt_usr != NULL )
+ {
+ logger = fckern_sel_log(nk->lt_usr, sel_logger);
+ }
+ if ( nk->lt_sys != NULL && logger == NULL )
+ {
+ logger = fckern_sel_log(nk->lt_sys, sel_logger);
+ }
+ if ( logger == NULL )
+ {
+ /* No logger configured, you must have supplied an invalid selection. */
+ fprintf(stderr, "error: unknown logger selected - '%s'", sel_logger);
+ return 0;
+ }
+ fctkern__add_logger(nk, logger);
+ logger = NULL; /* owned by nk. */
+ return 1;
+}
+
+
+
+/* Call this if you want to (re)parse the command line options with a new
+set of options. Returns -1 if you are to abort with EXIT_SUCCESS, returns
+0 if you are to abort with EXIT_FAILURE and returns 1 if you are to continue. */
+static int
+fctkern__cl_parse(fctkern_t *nk)
+{
+ int status =0;
+ size_t num_params =0;
+ size_t param_i =0;
+ if ( nk == NULL )
+ {
+ return 0;
+ }
+ if ( nk->cl_user_opts != NULL )
+ {
+ if ( !fct_clp__add_options(&(nk->cl_parser), nk->cl_user_opts) )
+ {
+ status =0;
+ goto finally;
+ }
+ }
+ /* You want to add the "house options" after the user defined ones. The
+ options are stored as a list so it means that any option listed after
+ the above ones won't get parsed. */
+ if ( !fct_clp__add_options(&(nk->cl_parser), FCT_CLP_OPTIONS) )
+ {
+ status =0;
+ goto finally;
+ }
+ fct_clp__parse(&(nk->cl_parser), nk->cl_argc, nk->cl_argv);
+ if ( fct_clp__is_error(&(nk->cl_parser)) )
+ {
+ char *err = fct_clp__get_error(&(nk->cl_parser));
+ fprintf(stderr, "error: %s", err);
+ status =0;
+ goto finally;
+ }
+ num_params = fct_clp__param_cnt(&(nk->cl_parser));
+ for ( param_i =0; param_i != num_params; ++param_i )
+ {
+ char const *param = fct_clp__param_at(&(nk->cl_parser), param_i);
+ fctkern__add_prefix_filter(nk, param);
+ }
+ if ( fctkern__cl_is(nk, FCT_OPT_VERSION) )
+ {
+ (void)printf("Built using FCTX version %s.\n", FCT_VERSION_STR);
+ status = -1;
+ goto finally;
+ }
+ if ( fctkern__cl_is(nk, FCT_OPT_HELP) )
+ {
+ fctkern__write_help(nk, stdout);
+ status = -1;
+ goto finally;
+ }
+ if ( !fctkern__cl_parse_config_logger(nk) )
+ {
+ status = -1;
+ goto finally;
+ }
+ status =1;
+ nk->cl_is_parsed =1;
+finally:
+ return status;
+}
+
+
+
+/* Parses the command line and sets up the framework. The argc and argv
+should be directly from the program's main. */
+static int
+fctkern__init(fctkern_t *nk, int argc, const char *argv[])
+{
+ if ( argc == 0 && argv == NULL )
+ {
+ return 0;
+ }
+ memset(nk, 0, sizeof(fctkern_t));
+ fct_clp__init(&(nk->cl_parser), NULL);
+ fct_nlist__init(&(nk->logger_list));
+ nk->lt_usr = NULL; /* Supplied via 'install' mechanics. */
+ nk->lt_sys = FCT_LOGGER_TYPES;
+ fct_nlist__init2(&(nk->prefix_list), 0);
+ fct_nlist__init2(&(nk->ts_list), 0);
+ nk->cl_is_parsed =0;
+ /* Save a copy of the arguments. We do a delay parse of the command
+ line arguments in order to allow the client code to optionally configure
+ the command line parser.*/
+ nk->cl_argc = argc;
+ nk->cl_argv = argv;
+ fct_namespace_init(&(nk->ns));
+ return 1;
+}
+
+
+/* Takes OWNERSHIP of the test suite after we have finished executing
+its contents. This way we can build up all kinds of summaries at the end
+of a run. */
+static void
+fctkern__add_ts(fctkern_t *nk, fct_ts_t *ts)
+{
+ FCT_ASSERT( nk != NULL );
+ FCT_ASSERT( ts != NULL );
+ fct_nlist__append(&(nk->ts_list), ts);
+}
+
+
+/* Returns FCT_TRUE if the supplied test_name passes the filters set on
+this test suite. If there are no filters, we return FCT_TRUE always. */
+static nbool_t
+fctkern__pass_filter(fctkern_t *nk, char const *test_name)
+{
+ size_t prefix_i =0;
+ size_t prefix_list_size =0;
+ FCT_ASSERT( nk != NULL && "invalid arg");
+ FCT_ASSERT( test_name != NULL );
+ FCT_ASSERT( strlen(test_name) > 0 );
+ prefix_list_size = fctkern__filter_cnt(nk);
+ /* If there is no filter list, then we return FCT_TRUE always. */
+ if ( prefix_list_size == 0 )
+ {
+ return FCT_TRUE;
+ }
+ /* Iterate through the prefix filter list, and see if we have
+ anything that does not pass. All we require is ONE item that
+ passes the test in order for us to succeed here. */
+ for ( prefix_i = 0; prefix_i != prefix_list_size; ++prefix_i )
+ {
+ char const *prefix = (char const*)fct_nlist__at(
+ &(nk->prefix_list), prefix_i
+ );
+ nbool_t pass = fct_filter_pass(prefix, test_name);
+ if ( pass )
+ {
+ return FCT_TRUE;
+ }
+ }
+ /* Otherwise, we never managed to find a prefix that satisfied the
+ supplied test name. Therefore we have failed to pass to the filter
+ list test. */
+ return FCT_FALSE;
+}
+
+
+/* Returns the number of tests that were performed. */
+static size_t
+fctkern__tst_cnt(fctkern_t const *nk)
+{
+ size_t tally =0;
+ FCT_ASSERT( nk != NULL );
+ FCT_NLIST_FOREACH_BGN(fct_ts_t *, ts, &(nk->ts_list))
+ {
+ tally += fct_ts__tst_cnt(ts);
+ }
+ FCT_NLIST_FOREACH_END();
+ return tally;
+}
+
+
+/* Returns the number of tests that passed. */
+static size_t
+fctkern__tst_cnt_passed(fctkern_t const *nk)
+{
+ size_t tally =0;
+ FCT_ASSERT( nk != NULL );
+
+ FCT_NLIST_FOREACH_BGN(fct_ts_t*, ts, &(nk->ts_list))
+ {
+ tally += fct_ts__tst_cnt_passed(ts);
+ }
+ FCT_NLIST_FOREACH_END();
+
+ return tally;
+}
+
+
+/* Returns the number of tests that failed. */
+#define fctkern__tst_cnt_failed(nk) \
+ (fctkern__tst_cnt(nk) - fctkern__tst_cnt_passed(nk))
+
+
+/* Returns the number of checks made throughout the entire test. */
+#if defined(FCT_USE_TEST_COUNT)
+static size_t
+fctkern__chk_cnt(fctkern_t const *nk)
+{
+ size_t tally =0;
+ FCT_ASSERT( nk != NULL );
+
+ FCT_NLIST_FOREACH_BGN(fct_ts_t *, ts, &(nk->ts_list))
+ {
+ tally += fct_ts__chk_cnt(ts);
+ }
+ FCT_NLIST_FOREACH_END();
+ return tally;
+}
+#endif /* FCT_USE_TEST_COUNT */
+
+
+/* Indicates the very end of all the tests. */
+#define fctkern__end(nk) /* unused */
+
+
+static void
+fctkern__log_suite_start(fctkern_t *nk, fct_ts_t const *ts)
+{
+ FCT_ASSERT( nk != NULL );
+ FCT_ASSERT( ts != NULL );
+ FCT_NLIST_FOREACH_BGN(fct_logger_i*, logger, &(nk->logger_list))
+ {
+ fct_logger__on_test_suite_start(logger, ts);
+ }
+ FCT_NLIST_FOREACH_END();
+}
+
+
+static void
+fctkern__log_suite_end(fctkern_t *nk, fct_ts_t const *ts)
+{
+ FCT_ASSERT( nk != NULL );
+ FCT_ASSERT( ts != NULL );
+ FCT_NLIST_FOREACH_BGN(fct_logger_i*, logger, &(nk->logger_list))
+ {
+ fct_logger__on_test_suite_end(logger, ts);
+ }
+ FCT_NLIST_FOREACH_END();
+}
+
+
+static void
+fctkern__log_suite_skip(fctkern_t *nk, char const *condition, char const *name)
+{
+ if ( nk == NULL )
+ {
+ return;
+ }
+ FCT_NLIST_FOREACH_BGN(fct_logger_i*, logger, &(nk->logger_list))
+ {
+ fct_logger__on_test_suite_skip(logger, condition, name);
+ }
+ FCT_NLIST_FOREACH_END();
+}
+
+
+static void
+fctkern__log_test_skip(fctkern_t *nk, char const *condition, char const *name)
+{
+ FCT_NLIST_FOREACH_BGN(fct_logger_i*, logger, &(nk->logger_list))
+ {
+ fct_logger__on_test_skip(logger, condition, name);
+ }
+ FCT_NLIST_FOREACH_END();
+}
+
+
+/* Use this for displaying information about a "Check" (i.e.
+a condition). */
+static void
+fctkern__log_chk(fctkern_t *nk, fctchk_t const *chk)
+{
+ FCT_ASSERT( nk != NULL );
+ FCT_ASSERT( chk != NULL );
+ FCT_NLIST_FOREACH_BGN(fct_logger_i*, logger, &(nk->logger_list))
+ {
+ fct_logger__on_chk(logger, chk);
+ }
+ FCT_NLIST_FOREACH_END();
+}
+
+
+/* Use this for displaying warning messages. */
+static void
+fctkern__log_warn(fctkern_t *nk, char const *warn)
+{
+ FCT_ASSERT( nk != NULL );
+ FCT_ASSERT( warn != NULL );
+ FCT_NLIST_FOREACH_BGN(fct_logger_i*, logger, &(nk->logger_list))
+ {
+ fct_logger__on_warn(logger, warn);
+ }
+ FCT_NLIST_FOREACH_END();
+}
+
+
+/* Called whenever a test is started. */
+static void
+fctkern__log_test_start(fctkern_t *nk, fct_test_t const *test)
+{
+ FCT_ASSERT( nk != NULL );
+ FCT_ASSERT( test != NULL );
+ FCT_NLIST_FOREACH_BGN(fct_logger_i*, logger, &(nk->logger_list))
+ {
+ fct_logger__on_test_start(logger, test);
+ }
+ FCT_NLIST_FOREACH_END();
+}
+
+
+static void
+fctkern__log_test_end(fctkern_t *nk, fct_test_t *test)
+{
+ FCT_ASSERT( nk != NULL );
+ FCT_ASSERT( test != NULL );
+ FCT_NLIST_FOREACH_BGN(fct_logger_i*, logger, &(nk->logger_list))
+ {
+ fct_logger__on_test_end(logger, test);
+ }
+ FCT_NLIST_FOREACH_END();
+}
+
+
+#define fctkern__log_start(_NK_) \
+ {\
+ FCT_NLIST_FOREACH_BGN(fct_logger_i*, logger, &((_NK_)->logger_list))\
+ {\
+ fct_logger__on_fctx_start(logger, (_NK_));\
+ }\
+ FCT_NLIST_FOREACH_END();\
+ }
+
+
+#define fctkern__log_end(_NK_) \
+ {\
+ FCT_NLIST_FOREACH_BGN(fct_logger_i*, logger, &((_NK_)->logger_list))\
+ {\
+ fct_logger__on_fctx_end(logger, (_NK_));\
+ }\
+ FCT_NLIST_FOREACH_END();\
+ }
+
+
+
+
+/*
+-----------------------------------------------------------
+LOGGER INTERFACE
+
+Defines an interface to a logging system. A logger
+must define the following functions in order to hook
+into the logging system.
+
+See the "Standard Logger" and "Minimal Logger" as examples
+of the implementation.
+-----------------------------------------------------------
+*/
+
+/* Common event argument. The values of the each event may or may not be
+defined depending on the event in question. */
+struct _fct_logger_evt_t
+{
+ fctkern_t const *kern;
+ fctchk_t const *chk;
+ fct_test_t const *test;
+ fct_ts_t const *ts;
+ char const *msg;
+ char const *cndtn;
+ char const *name;
+};
+
+
+typedef struct _fct_logger_i_vtable_t
+{
+ /* 1
+ * Fired when an "fct_chk*" (check) function is completed. The event
+ * will contain a reference to the "chk" object created.
+ * */
+ void (*on_chk)(fct_logger_i *logger, fct_logger_evt_t const *e);
+
+ /* 2
+ * Fired when a test starts and before any checks are made. The
+ * event will have its "test" object set. */
+ void (*on_test_start)(
+ fct_logger_i *logger,
+ fct_logger_evt_t const *e
+ );
+ /* 3 */
+ void (*on_test_end)(
+ fct_logger_i *logger,
+ fct_logger_evt_t const *e
+ );
+ /* 4 */
+ void (*on_test_suite_start)(
+ fct_logger_i *logger,
+ fct_logger_evt_t const *e
+ );
+ /* 5 */
+ void (*on_test_suite_end)(
+ fct_logger_i *logger,
+ fct_logger_evt_t const *e
+ );
+ /* 6 */
+ void (*on_fctx_start)(
+ fct_logger_i *logger,
+ fct_logger_evt_t const *e
+ );
+ /* 7 */
+ void (*on_fctx_end)(
+ fct_logger_i *logger,
+ fct_logger_evt_t const *e
+ );
+ /* 8
+ Called when the logger object must "clean up". */
+ void (*on_delete)(
+ fct_logger_i *logger,
+ fct_logger_evt_t const *e
+ );
+ /* 9 */
+ void (*on_warn)(
+ fct_logger_i *logger,
+ fct_logger_evt_t const *e
+ );
+ /* -- new in 1.2 -- */
+ /* 10 */
+ void (*on_test_suite_skip)(
+ fct_logger_i *logger,
+ fct_logger_evt_t const *e
+ );
+ /* 11 */
+ void (*on_test_skip)(
+ fct_logger_i *logger,
+ fct_logger_evt_t const *e
+ );
+} fct_logger_i_vtable_t;
+
+#define _fct_logger_head \
+ fct_logger_i_vtable_t vtable; \
+ fct_logger_evt_t evt
+
+struct _fct_logger_i
+{
+ _fct_logger_head;
+};
+
+
+static void
+fct_logger__stub(fct_logger_i *l, fct_logger_evt_t const *e)
+{
+ fct_unused(l);
+ fct_unused(e);
+}
+
+
+static fct_logger_i_vtable_t fct_logger_default_vtable =
+{
+ fct_logger__stub, /* 1. on_chk */
+ fct_logger__stub, /* 2. on_test_start */
+ fct_logger__stub, /* 3. on_test_end */
+ fct_logger__stub, /* 4. on_test_suite_start */
+ fct_logger__stub, /* 5. on_test_suite_end */
+ fct_logger__stub, /* 6. on_fctx_start */
+ fct_logger__stub, /* 7. on_fctx_end */
+ fct_logger__stub, /* 8. on_delete */
+ fct_logger__stub, /* 9. on_warn */
+ fct_logger__stub, /* 10. on_test_suite_skip */
+ fct_logger__stub, /* 11. on_test_skip */
+};
+
+
+/* Initializes the elements of a logger interface so they are at their
+standard values. */
+static void
+fct_logger__init(fct_logger_i *logger)
+{
+ FCT_ASSERT( logger != NULL );
+ memcpy(
+ &(logger->vtable),
+ &fct_logger_default_vtable,
+ sizeof(fct_logger_i_vtable_t)
+ );
+ memset(&(logger->evt),0, sizeof(fct_logger_evt_t));
+}
+
+static void
+fct_logger__del(fct_logger_i *logger)
+{
+ if ( logger )
+ {
+ logger->vtable.on_delete(logger, &(logger->evt));
+ }
+}
+
+
+static void
+fct_logger__on_test_start(fct_logger_i *logger, fct_test_t const *test)
+{
+ logger->evt.test = test;
+ logger->vtable.on_test_start(logger, &(logger->evt));
+}
+
+
+static void
+fct_logger__on_test_end(fct_logger_i *logger, fct_test_t *test)
+{
+ logger->evt.test = test;
+ logger->vtable.on_test_end(logger, &(logger->evt));
+}
+
+
+static void
+fct_logger__on_test_suite_start(fct_logger_i *logger, fct_ts_t const *ts)
+{
+ logger->evt.ts = ts;
+ logger->vtable.on_test_suite_start(logger, &(logger->evt));
+}
+
+
+static void
+fct_logger__on_test_suite_end(fct_logger_i *logger, fct_ts_t const *ts)
+{
+ logger->evt.ts = ts;
+ logger->vtable.on_test_suite_end(logger, &(logger->evt));
+}
+
+
+static void
+fct_logger__on_test_suite_skip(
+ fct_logger_i *logger,
+ char const *condition,
+ char const *name
+)
+{
+ logger->evt.cndtn = condition;
+ logger->evt.name = name;
+ logger->vtable.on_test_suite_skip(logger, &(logger->evt));
+}
+
+
+static void
+fct_logger__on_test_skip(
+ fct_logger_i *logger,
+ char const *condition,
+ char const *name
+)
+{
+ logger->evt.cndtn = condition;
+ logger->evt.name = name;
+ logger->vtable.on_test_skip(logger, &(logger->evt));
+}
+
+
+static void
+fct_logger__on_chk(fct_logger_i *logger, fctchk_t const *chk)
+{
+ logger->evt.chk = chk;
+ logger->vtable.on_chk(logger, &(logger->evt));
+}
+
+/* When we start all our tests. */
+#define fct_logger__on_fctx_start(LOGGER, KERN) \
+ (LOGGER)->evt.kern = (KERN);\
+ (LOGGER)->vtable.on_fctx_start((LOGGER), &((LOGGER)->evt));
+
+
+/* When we have reached the end of ALL of our testing. */
+#define fct_logger__on_fctx_end(LOGGER, KERN) \
+ (LOGGER)->evt.kern = (KERN);\
+ (LOGGER)->vtable.on_fctx_end((LOGGER), &((LOGGER)->evt));
+
+
+static void
+fct_logger__on_warn(fct_logger_i *logger, char const *msg)
+{
+ logger->evt.msg = msg;
+ logger->vtable.on_warn(logger, &(logger->evt));
+}
+
+
+/* Commmon routine to record strings representing failures. The
+chk should be a failure before we call this, and the list is a list
+of char*'s that will eventually be free'd by the logger. */
+static void
+fct_logger_record_failure(fctchk_t const* chk, fct_nlist_t* fail_list)
+{
+ /* For now we will truncate the string to some set amount, later
+ we can work out a dynamic string object. */
+ char *str = (char*)malloc(sizeof(char)*FCT_MAX_LOG_LINE);
+ FCT_ASSERT( str != NULL );
+ fct_snprintf(
+ str,
+ FCT_MAX_LOG_LINE,
+ "%s(%d):\n %s",
+ fctchk__file(chk),
+ fctchk__lineno(chk),
+ fctchk__msg(chk)
+ );
+ /* Append it to the listing ... */
+ fct_nlist__append(fail_list, (void*)str);
+}
+
+
+/* Another common routine, to print the failures at the end of a run. */
+static void
+fct_logger_print_failures(fct_nlist_t const *fail_list)
+{
+ puts(
+ "\n----------------------------------------------------------------------------\n"
+ );
+ puts("FAILED TESTS\n\n");
+ FCT_NLIST_FOREACH_BGN(char *, cndtn_str, fail_list)
+ {
+ printf("%s\n", cndtn_str);
+ }
+ FCT_NLIST_FOREACH_END();
+
+ puts("\n");
+}
+
+
+
+
+/*
+-----------------------------------------------------------
+MINIMAL LOGGER
+-----------------------------------------------------------
+
+At the moment the MINIMAL LOGGER is currently disabled. Hope
+to bring it back online soon. The only reason it is
+disabled is that we don't currently have the ability to specify
+loggers.
+*/
+
+
+/* Minimal logger, reports the minimum amount of information needed
+to determine "something is happening". */
+struct _fct_minimal_logger_t
+{
+ _fct_logger_head;
+ /* A list of char*'s that needs to be cleaned up. */
+ fct_nlist_t failed_cndtns_list;
+};
+
+
+static void
+fct_minimal_logger__on_chk(
+ fct_logger_i *self_,
+ fct_logger_evt_t const *e
+)
+{
+ fct_minimal_logger_t *self = (fct_minimal_logger_t*)self_;
+ if ( fctchk__is_pass(e->chk) )
+ {
+ fputs(".", stdout);
+ }
+ else
+ {
+ fputs("x", stdout);
+ fct_logger_record_failure(e->chk, &(self->failed_cndtns_list));
+
+ }
+}
+
+static void
+fct_minimal_logger__on_fctx_end(
+ fct_logger_i *self_,
+ fct_logger_evt_t const *e
+)
+{
+ fct_minimal_logger_t *self = (fct_minimal_logger_t*)self_;
+ fct_unused(e);
+ if ( fct_nlist__size(&(self->failed_cndtns_list)) >0 )
+ {
+ fct_logger_print_failures(&(self->failed_cndtns_list));
+ }
+}
+
+
+static void
+fct_minimal_logger__on_delete(
+ fct_logger_i *self_,
+ fct_logger_evt_t const *e
+)
+{
+ fct_minimal_logger_t *self = (fct_minimal_logger_t*)self_;
+ fct_unused(e);
+ fct_nlist__final(&(self->failed_cndtns_list), free);
+ free(self);
+
+}
+
+
+fct_logger_i*
+fct_minimal_logger_new(void)
+{
+ fct_minimal_logger_t *self = (fct_minimal_logger_t*)\
+ calloc(1,sizeof(fct_minimal_logger_t));
+ if ( self == NULL )
+ {
+ return NULL;
+ }
+ fct_logger__init((fct_logger_i*)self);
+ self->vtable.on_chk = fct_minimal_logger__on_chk;
+ self->vtable.on_fctx_end = fct_minimal_logger__on_fctx_end;
+ self->vtable.on_delete = fct_minimal_logger__on_delete;
+ fct_nlist__init2(&(self->failed_cndtns_list), 0);
+ return (fct_logger_i*)self;
+}
+
+
+/*
+-----------------------------------------------------------
+STANDARD LOGGER
+-----------------------------------------------------------
+*/
+
+struct _fct_standard_logger_t
+{
+ _fct_logger_head;
+
+ /* Start time. For now we use the low-accuracy time_t version. */
+ fct_timer_t timer;
+
+ /* A list of char*'s that needs to be cleaned up. */
+ fct_nlist_t failed_cndtns_list;
+};
+
+
+#define FCT_STANDARD_LOGGER_MAX_LINE 68
+
+
+/* When a failure occurrs, we will record the details so we can display
+them when the log "finishes" up. */
+static void
+fct_standard_logger__on_chk(
+ fct_logger_i *logger_,
+ fct_logger_evt_t const *e
+)
+{
+ fct_standard_logger_t *logger = (fct_standard_logger_t*)logger_;
+ /* Only record failures. */
+ if ( !fctchk__is_pass(e->chk) )
+ {
+ fct_logger_record_failure(e->chk, &(logger->failed_cndtns_list));
+ }
+}
+
+
+static void
+fct_standard_logger__on_test_skip(
+ fct_logger_i* logger_,
+ fct_logger_evt_t const *e
+)
+{
+ char const *condition = e->cndtn;
+ char const *name = e->name;
+ char msg[256] = {'\0'};
+ fct_unused(logger_);
+ fct_unused(condition);
+ fct_snprintf(msg, sizeof(msg), "%s (%s)", name, condition);
+ msg[sizeof(msg)-1] = '\0';
+ fct_dotted_line_start(FCT_STANDARD_LOGGER_MAX_LINE, msg);
+ fct_dotted_line_end("- SKIP -");
+}
+
+
+static void
+fct_standard_logger__on_test_start(
+ fct_logger_i *logger_,
+ fct_logger_evt_t const *e
+)
+{
+ fct_unused(logger_);
+ fct_dotted_line_start(
+ FCT_STANDARD_LOGGER_MAX_LINE,
+ fct_test__name(e->test)
+ );
+}
+
+
+static void
+fct_standard_logger__on_test_end(
+ fct_logger_i *logger_,
+ fct_logger_evt_t const *e
+)
+{
+ nbool_t is_pass;
+ fct_unused(logger_);
+ is_pass = fct_test__is_pass(e->test);
+ fct_dotted_line_end((is_pass) ? "PASS" : "FAIL ***" );
+}
+
+
+static void
+fct_standard_logger__on_fctx_start(
+ fct_logger_i *logger_,
+ fct_logger_evt_t const *e
+)
+{
+ fct_standard_logger_t *logger = (fct_standard_logger_t*)logger_;
+ fct_unused(e);
+ fct_timer__start(&(logger->timer));
+}
+
+
+static void
+fct_standard_logger__on_fctx_end(
+ fct_logger_i *logger_,
+ fct_logger_evt_t const *e
+)
+{
+ fct_standard_logger_t *logger = (fct_standard_logger_t*)logger_;
+ nbool_t is_success =1;
+ double elasped_time =0;
+ size_t num_tests =0;
+ size_t num_passed =0;
+
+ fct_timer__stop(&(logger->timer));
+
+ is_success = fct_nlist__size(&(logger->failed_cndtns_list)) ==0;
+
+ if ( !is_success )
+ {
+ fct_logger_print_failures(&(logger->failed_cndtns_list));
+ }
+ puts(
+ "\n----------------------------------------------------------------------------\n"
+ );
+ num_tests = fctkern__tst_cnt(e->kern);
+ num_passed = fctkern__tst_cnt_passed(e->kern);
+ printf(
+ "%s (%lu/%lu tests",
+ (is_success) ? "PASSED" : "FAILED",
+ (unsigned long) num_passed,
+ (unsigned long) num_tests
+ );
+ elasped_time = fct_timer__duration(&(logger->timer));
+ if ( elasped_time > 0.0000001 )
+ {
+ printf(" in %.6fs)\n", elasped_time);
+ }
+ else
+ {
+ /* Don't bother displaying the time to execute. */
+ puts(")\n");
+ }
+}
+
+
+static void
+fct_standard_logger__on_delete(
+ fct_logger_i *logger_,
+ fct_logger_evt_t const *e
+)
+{
+ fct_standard_logger_t *logger = (fct_standard_logger_t*)logger_;
+ fct_unused(e);
+ fct_nlist__final(&(logger->failed_cndtns_list), free);
+ free(logger);
+ logger_ =NULL;
+}
+
+
+static void
+fct_standard_logger__on_warn(
+ fct_logger_i* logger_,
+ fct_logger_evt_t const *e
+)
+{
+ fct_unused(logger_);
+ (void)printf("WARNING: %s", e->msg);
+}
+
+
+fct_logger_i*
+fct_standard_logger_new(void)
+{
+ fct_standard_logger_t *logger = (fct_standard_logger_t *)calloc(
+ 1, sizeof(fct_standard_logger_t)
+ );
+ if ( logger == NULL )
+ {
+ return NULL;
+ }
+ fct_logger__init((fct_logger_i*)logger);
+ logger->vtable.on_chk = fct_standard_logger__on_chk;
+ logger->vtable.on_test_start = fct_standard_logger__on_test_start;
+ logger->vtable.on_test_end = fct_standard_logger__on_test_end;
+ logger->vtable.on_fctx_start = fct_standard_logger__on_fctx_start;
+ logger->vtable.on_fctx_end = fct_standard_logger__on_fctx_end;
+ logger->vtable.on_delete = fct_standard_logger__on_delete;
+ logger->vtable.on_warn = fct_standard_logger__on_warn;
+ logger->vtable.on_test_skip = fct_standard_logger__on_test_skip;
+ fct_nlist__init2(&(logger->failed_cndtns_list), 0);
+ fct_timer__init(&(logger->timer));
+ return (fct_logger_i*)logger;
+}
+
+
+/*
+-----------------------------------------------------------
+JUNIT LOGGER
+-----------------------------------------------------------
+*/
+
+
+/* JUnit logger */
+struct _fct_junit_logger_t
+{
+ _fct_logger_head;
+};
+
+
+static void
+fct_junit_logger__on_test_suite_start(
+ fct_logger_i *l,
+ fct_logger_evt_t const *e
+)
+{
+ fct_unused(l);
+ fct_unused(e);
+ FCT_SWITCH_STDOUT_TO_BUFFER();
+ FCT_SWITCH_STDERR_TO_BUFFER();
+}
+
+
+static void
+fct_junit_logger__on_test_suite_end(
+ fct_logger_i *logger_,
+ fct_logger_evt_t const *e
+)
+{
+ fct_ts_t const *ts = e->ts; /* Test Suite */
+ nbool_t is_pass;
+ double elasped_time = 0;
+ char std_buffer[1024];
+ int read_length;
+ int first_out_line;
+
+ fct_unused(logger_);
+
+ elasped_time = fct_ts__duration(ts);
+
+ FCT_SWITCH_STDOUT_TO_STDOUT();
+ FCT_SWITCH_STDERR_TO_STDERR();
+
+ /* opening testsuite tag */
+ printf("\t<testsuite errors=\"%lu\" failures=\"0\" tests=\"%lu\" "
+ "name=\"%s\" time=\"%.4f\">\n",
+ (unsigned long) fct_ts__tst_cnt(ts)
+ - fct_ts__tst_cnt_passed(ts),
+ (unsigned long) fct_ts__tst_cnt(ts),
+ fct_ts__name(ts),
+ elasped_time);
+
+ FCT_NLIST_FOREACH_BGN(fct_test_t*, test, &(ts->test_list))
+ {
+ is_pass = fct_test__is_pass(test);
+
+ /* opening testcase tag */
+ if (is_pass)
+ {
+ printf("\t\t<testcase name=\"%s\" time=\"%.3f\"",
+ fct_test__name(test),
+ fct_test__duration(test)
+ );
+ }
+ else
+ {
+ printf("\t\t<testcase name=\"%s\" time=\"%.3f\">\n",
+ fct_test__name(test),
+ fct_test__duration(test)
+ );
+ }
+
+ FCT_NLIST_FOREACH_BGN(fctchk_t*, chk, &(test->failed_chks))
+ {
+ /* error tag */
+ printf("\t\t\t<error message=\"%s\" "
+ "type=\"fctx\">", chk->msg);
+ printf("file:%s, line:%d", chk->file, chk->lineno);
+ printf("</error>\n");
+ }
+ FCT_NLIST_FOREACH_END();
+
+ /* closing testcase tag */
+ if (is_pass)
+ {
+ printf(" />\n");
+ }
+ else
+ {
+ printf("\t\t</testcase>\n");
+ }
+ }
+ FCT_NLIST_FOREACH_END();
+
+ /* print the std streams */
+ first_out_line = 1;
+ printf("\t\t<system-out>\n\t\t\t<![CDATA[");
+ while ( (read_length = _fct_read(fct_stdout_pipe[0], std_buffer, 1024)) > 0)
+ {
+ if (first_out_line)
+ {
+ printf("\n");
+ first_out_line = 0;
+ }
+ printf("%.*s", read_length, std_buffer);
+ }
+ printf("]]>\n\t\t</system-out>\n");
+
+ first_out_line = 1;
+ printf("\t\t<system-err>\n\t\t\t<![CDATA[");
+ while ((read_length = _fct_read(fct_stderr_pipe[0], std_buffer, 1024)) > 0)
+ {
+ if (first_out_line)
+ {
+ printf("\n");
+ first_out_line = 0;
+ }
+ printf("%.*s", read_length, std_buffer);
+ }
+ printf("]]>\n\t\t</system-err>\n");
+
+ /* closing testsuite tag */
+ printf("\t</testsuite>\n");
+}
+
+static void
+fct_junit_logger__on_fct_start(
+ fct_logger_i *logger_,
+ fct_logger_evt_t const *e
+)
+{
+ fct_unused(logger_);
+ fct_unused(e);
+ printf("<?xml version=\"1.0\" encoding=\"UTF-8\" ?>\n");
+ printf("<testsuites>\n");
+}
+
+static void
+fct_junit_logger__on_fctx_end(
+ fct_logger_i *logger_,
+ fct_logger_evt_t const *e
+)
+{
+ fct_unused(logger_);
+ fct_unused(e);
+ printf("</testsuites>\n");
+}
+
+static void
+fct_junit_logger__on_delete(
+ fct_logger_i *logger_,
+ fct_logger_evt_t const *e
+)
+{
+ fct_junit_logger_t *logger = (fct_junit_logger_t*)logger_;
+ fct_unused(e);
+ free(logger);
+ logger_ =NULL;
+}
+
+
+fct_junit_logger_t *
+fct_junit_logger_new(void)
+{
+ fct_junit_logger_t *logger =
+ (fct_junit_logger_t *)calloc(1, sizeof(fct_junit_logger_t));
+ if ( logger == NULL )
+ {
+ return NULL;
+ }
+ fct_logger__init((fct_logger_i*)logger);
+ logger->vtable.on_test_suite_start = fct_junit_logger__on_test_suite_start;
+ logger->vtable.on_test_suite_end = fct_junit_logger__on_test_suite_end;
+ logger->vtable.on_fctx_start = fct_junit_logger__on_fct_start;
+ logger->vtable.on_fctx_end = fct_junit_logger__on_fctx_end;
+ logger->vtable.on_delete = fct_junit_logger__on_delete;
+ return logger;
+}
+
+
+/*
+------------------------------------------------------------
+MACRO MAGIC
+------------------------------------------------------------
+This is where the show begins!
+*/
+
+/* This macro invokes a bunch of functions that need to be referenced in
+order to avoid a "unreferenced local function has been removed" warning.
+The logical acrobatics below try and make it appear to the compiler that
+they are needed, but at runtime, only the cheap, first call is made. */
+#define FCT_REFERENCE_FUNCS() \
+ {\
+ int check = 0 && fctstr_ieq(NULL, NULL);\
+ if ( check ) {\
+ _fct_cmt("not to be executed");\
+ (void)_fct_chk_empty_str(NULL);\
+ (void)_fct_chk_full_str(NULL);\
+ (void)fct_test__start_timer(NULL);\
+ (void)fct_test__stop_timer(NULL);\
+ (void)fct_ts_new(NULL);\
+ (void)fct_ts__test_begin(NULL);\
+ (void)fct_ts__add_test(NULL, NULL);\
+ (void)fct_ts__test_end(NULL);\
+ (void)fct_ts__inc_total_test_num(NULL);\
+ (void)fct_ts__make_abort_test(NULL);\
+ (void)fct_ts__setup_abort(NULL);\
+ (void)fct_ts__setup_end(NULL);\
+ (void)fct_ts__teardown_end(NULL);\
+ (void)fct_ts__cnt_end(NULL);\
+ (void)fct_ts__is_test_cnt(NULL, 0);\
+ (void)fct_xchk_fn(0, "");\
+ (void)fct_xchk2_fn(NULL, 0, "");\
+ (void)fctkern__cl_parse(NULL);\
+ (void)fctkern__add_ts(NULL, NULL);\
+ (void)fctkern__pass_filter(NULL, NULL);\
+ (void)fctkern__log_suite_start(NULL, NULL);\
+ (void)fctkern__log_suite_end(NULL, NULL);\
+ (void)fctkern__log_test_skip(NULL, NULL, NULL);\
+ (void)fctkern__log_test_start(NULL, NULL);\
+ (void)fctkern__log_test_end(NULL, NULL);\
+ (void)fctstr_endswith(NULL,NULL);\
+ (void)fctstr_iendswith(NULL,NULL);\
+ (void)fctstr_ieq(NULL,NULL);\
+ (void)fctstr_incl(NULL, NULL);\
+ (void)fctstr_iincl(NULL, NULL);\
+ (void)fctstr_iendswith(NULL,NULL);\
+ (void)fctstr_istartswith(NULL,NULL);\
+ (void)fctstr_clone_lower(NULL);\
+ (void)fctstr_startswith(NULL,NULL);\
+ (void)fctkern__init(NULL, 0, NULL);\
+ (void)fctkern__cl_is(NULL, "");\
+ (void)fctkern__cl_val2(NULL, NULL, NULL);\
+ fctkern__log_suite_skip(NULL, NULL, NULL);\
+ (void)fct_clp__is_param(NULL,NULL);\
+ _fct_cmt("should never construct an object");\
+ (void)fct_test_new(NULL);\
+ (void)fct_ts__chk_cnt(NULL);\
+ }\
+ }
+
+
+#define FCT_INIT(_ARGC_, _ARGV_) \
+ fctkern_t fctkern__; \
+ fctkern_t* fctkern_ptr__ = &fctkern__; \
+ FCT_REFERENCE_FUNCS(); \
+ if ( !fctkern__init(fctkern_ptr__, (_ARGC_), (const char **)(_ARGV_)) ) {\
+ (void)fprintf( \
+ stderr, "FATAL ERROR: Unable to initialize FCTX Kernel." \
+ ); \
+ exit(EXIT_FAILURE); \
+ } \
+
+
+#define FCT_FINAL() \
+ fctkern_ptr__->ns.num_total_failed = fctkern__tst_cnt_failed( \
+ (fctkern_ptr__) \
+ ); \
+ fctkern__log_end(fctkern_ptr__); \
+ fctkern__end(fctkern_ptr__); \
+ fctkern__final(fctkern_ptr__); \
+ FCT_ASSERT( !((int)fctkern_ptr__->ns.num_total_failed < 0) \
+ && "or we got truncated!"); \
+ if ( fctkern_ptr__->ns.num_total_failed == \
+ fctkern_ptr__->num_expected_failures) { \
+ fctkern_ptr__->ns.num_total_failed = 0; \
+ } \
+
+
+
+#define FCT_NUM_FAILED() \
+ fctkern_ptr__->ns.num_total_failed \
+
+
+
+/* Typically used internally only, this mentions to FCTX that you EXPECT
+to _NUM_FAILS_. If you the expected matches the actual, a 0 value is returned
+from the program. */
+#define FCT_EXPECTED_FAILURES(_NUM_FAILS_) \
+ ((fctkern_ptr__->num_expected_failures = (_NUM_FAILS_)))
+
+
+#define FCT_BGN_FN(_FNNAME_) \
+ int _FNNAME_(int argc, char* argv[])\
+ { \
+ FCT_INIT(argc, argv)
+
+#define FCT_END_FN() FCT_END()
+
+/* This defines our start. The fctkern__ is a kernal object
+that lives throughout the lifetime of our program. The
+fctkern_ptr__ makes it easier to abstract out macros. */
+#define FCT_BGN() FCT_BGN_FN(main)
+
+
+/* Silence Intel complaints about unspecified operand order in user's code */
+#ifndef __INTEL_COMPILER
+# define FCT_END_WARNINGFIX_BGN
+# define FCT_END_WARNINGFIX_END
+#else
+# define FCT_END_WARNINGFIX_BGN _Pragma("warning(push,disable:981)");
+# define FCT_END_WARNINGFIX_END _Pragma("warning(pop)");
+#endif
+
+/* Ends the test suite by returning the number failed. The "chk_cnt" call is
+made in order allow strict compilers to pass when it encounters unreferenced
+functions. */
+#define FCT_END() \
+ { \
+ FCT_END_WARNINGFIX_BGN \
+ FCT_FINAL(); \
+ return (int) FCT_NUM_FAILED();\
+ FCT_END_WARNINGFIX_END \
+ }\
+}
+
+#define fctlog_install(_CUST_LOGGER_LIST_) \
+ fctkern_ptr__->lt_usr = (_CUST_LOGGER_LIST_)
+
+/* Re-parses the command line options with the addition of user defined
+options. */
+#define fctcl_install(_CLO_INIT_) \
+ {\
+ fctkern_ptr__->cl_user_opts = (_CLO_INIT_);\
+ _fct_cmt("Delay parse in order to allow for user customization.");\
+ if ( !fctkern__cl_is_parsed((fctkern_ptr__)) ) {\
+ int status = fctkern__cl_parse((fctkern_ptr__));\
+ _fct_cmt("Need to parse command line before we start logger.");\
+ fctkern__log_start((fctkern_ptr__));\
+ switch( status ) {\
+ case -1:\
+ case 0:\
+ fctkern__final(fctkern_ptr__);\
+ exit( (status == 0) ? (EXIT_FAILURE) : (EXIT_SUCCESS) );\
+ break;\
+ default:\
+ fct_pass();\
+ }\
+ }\
+ }
+
+
+#define fctcl_is(_OPT_STR_) (fctkern__cl_is(fctkern_ptr__, (_OPT_STR_)))
+
+#define fctcl_val(_OPT_STR_) (fctcl_val2((_OPT_STR_), NULL))
+
+#define fctcl_val2(_OPT_STR_, _DEF_STR_) \
+ (fctkern__cl_val2(fctkern_ptr__, (_OPT_STR_), (_DEF_STR_)))
+
+
+/* We delay the first parse of the command line until we get the first
+test fixture. This allows the user to possibly add their own parse
+specification. */
+#define FCT_FIXTURE_SUITE_BGN(_NAME_) \
+ {\
+ fctkern_ptr__->ns.ts_curr = fct_ts_new( #_NAME_ );\
+ _fct_cmt("Delay parse in order to allow for user customization.");\
+ if ( !fctkern__cl_is_parsed((fctkern_ptr__)) ) {\
+ int status = fctkern__cl_parse((fctkern_ptr__));\
+ _fct_cmt("Need to parse command line before we start logger.");\
+ fctkern__log_start((fctkern_ptr__));\
+ switch( status ) {\
+ case -1:\
+ case 0:\
+ fct_ts__del((fctkern_ptr__->ns.ts_curr));\
+ fctkern__final(fctkern_ptr__);\
+ exit( (status == 0) ? (EXIT_FAILURE) : (EXIT_SUCCESS) );\
+ break;\
+ default:\
+ fct_pass();\
+ }\
+ }\
+ if ( fctkern_ptr__->ns.ts_curr == NULL ) {\
+ fctkern__log_warn((fctkern_ptr__), "out of memory");\
+ }\
+ else\
+ {\
+ fctkern__log_suite_start((fctkern_ptr__), fctkern_ptr__->ns.ts_curr);\
+ for (;;)\
+ {\
+ fctkern_ptr__->ns.test_num = -1;\
+ if ( fct_ts__is_ending_mode(fctkern_ptr__->ns.ts_curr) \
+ || fct_ts__is_abort_mode(fctkern_ptr__->ns.ts_curr) )\
+ {\
+ _fct_cmt("flag the test suite as complete.");\
+ fct_ts__end(fctkern_ptr__->ns.ts_curr);\
+ break;\
+ }
+
+
+
+/* Closes off a "Fixture" test suite. */
+#define FCT_FIXTURE_SUITE_END() \
+ if ( fct_ts__is_cnt_mode(fctkern_ptr__->ns.ts_curr) )\
+ {\
+ fct_ts__cnt_end(fctkern_ptr__->ns.ts_curr);\
+ }\
+ }\
+ fctkern__add_ts((fctkern_ptr__), fctkern_ptr__->ns.ts_curr);\
+ fctkern__log_suite_end((fctkern_ptr__), fctkern_ptr__->ns.ts_curr);\
+ fct_ts__end(fctkern_ptr__->ns.ts_curr);\
+ fctkern_ptr__->ns.ts_curr = NULL;\
+ }\
+ }
+
+#define FCT_FIXTURE_SUITE_BGN_IF(_CONDITION_, _NAME_) \
+ fctkern_ptr__->ns.ts_is_skip_suite = !(_CONDITION_);\
+ fctkern_ptr__->ns.ts_skip_cndtn = #_CONDITION_;\
+ if ( fctkern_ptr__->ns.ts_is_skip_suite ) {\
+ fctkern__log_suite_skip((fctkern_ptr__), #_CONDITION_, #_NAME_);\
+ }\
+ FCT_FIXTURE_SUITE_BGN(_NAME_);
+
+#define FCT_FIXTURE_SUITE_END_IF() \
+ FCT_FIXTURE_SUITE_END();\
+ fctkern_ptr__->ns.ts_is_skip_suite =0;\
+ fctkern_ptr__->ns.ts_skip_cndtn =NULL;\
+
+#define FCT_SETUP_BGN()\
+ if ( fct_ts__is_setup_mode(fctkern_ptr__->ns.ts_curr) ) {
+
+#define FCT_SETUP_END() \
+ fct_ts__setup_end(fctkern_ptr__->ns.ts_curr); }
+
+#define FCT_TEARDOWN_BGN() \
+ if ( fct_ts__is_teardown_mode(fctkern_ptr__->ns.ts_curr) ) {\
+
+#define FCT_TEARDOWN_END() \
+ fct_ts__teardown_end(fctkern_ptr__->ns.ts_curr); \
+ continue; \
+ }
+
+/* Lets you create a test suite, where maybe you don't want a fixture. We
+do it by 'stubbing' out the setup/teardown logic. */
+#define FCT_SUITE_BGN(Name) \
+ FCT_FIXTURE_SUITE_BGN(Name) {\
+ FCT_SETUP_BGN() {_fct_cmt("stubbed"); } FCT_SETUP_END()\
+ FCT_TEARDOWN_BGN() {_fct_cmt("stubbed");} FCT_TEARDOWN_END()\
+
+#define FCT_SUITE_END() } FCT_FIXTURE_SUITE_END()
+
+#define FCT_SUITE_BGN_IF(_CONDITION_, _NAME_) \
+ FCT_FIXTURE_SUITE_BGN_IF(_CONDITION_, (_NAME_)) {\
+ FCT_SETUP_BGN() {_fct_cmt("stubbed"); } FCT_SETUP_END()\
+ FCT_TEARDOWN_BGN() {_fct_cmt("stubbed");} FCT_TEARDOWN_END()\
+
+#define FCT_SUITE_END_IF() } FCT_FIXTURE_SUITE_END_IF()
+
+typedef enum
+{
+ FCT_TEST_END_FLAG_Default = 0x0000,
+ FCT_TEST_END_FLAG_ClearFail = 0x0001
+} FCT_TEST_END_FLAG;
+
+
+#define FCT_TEST_BGN_IF(_CONDITION_, _NAME_) { \
+ fctkern_ptr__->ns.test_is_skip = !(_CONDITION_);\
+ fctkern_ptr__->ns.test_skip_cndtn = #_CONDITION_;\
+ FCT_TEST_BGN(_NAME_) {\
+
+#define FCT_TEST_END_IF() \
+ } FCT_TEST_END();\
+ fctkern_ptr__->ns.test_is_skip = 0;\
+ fctkern_ptr__->ns.test_skip_cndtn = NULL;\
+ }
+
+
+/* Depending on whether or not we are counting the tests, we will have to
+first determine if the test is the "current" count. Then we have to determine
+if we can pass the filter. Finally we will execute everything so that when a
+check fails, we can "break" out to the end of the test. And in between all
+that we do a memory check and fail a test if we can't build a fct_test
+object (should be rare). */
+#define FCT_TEST_BGN(_NAME_) \
+ {\
+ fctkern_ptr__->ns.curr_test_name = #_NAME_;\
+ ++(fctkern_ptr__->ns.test_num);\
+ if ( fct_ts__is_cnt_mode(fctkern_ptr__->ns.ts_curr) )\
+ {\
+ fct_ts__inc_total_test_num(fctkern_ptr__->ns.ts_curr);\
+ }\
+ else if ( fct_ts__is_test_mode(fctkern_ptr__->ns.ts_curr) \
+ && fct_ts__is_test_cnt(fctkern_ptr__->ns.ts_curr, fctkern_ptr__->ns.test_num) )\
+ {\
+ fct_ts__test_begin(fctkern_ptr__->ns.ts_curr);\
+ if ( fctkern__pass_filter(fctkern_ptr__, fctkern_ptr__->ns.curr_test_name ) )\
+ {\
+ fctkern_ptr__->ns.curr_test = fct_test_new( fctkern_ptr__->ns.curr_test_name );\
+ if ( fctkern_ptr__->ns.curr_test == NULL ) {\
+ fctkern__log_warn(fctkern_ptr__, "out of memory");\
+ } else if ( fctkern_ptr__->ns.ts_is_skip_suite \
+ || fctkern_ptr__->ns.test_is_skip ) {\
+ fct_ts__test_begin(fctkern_ptr__->ns.ts_curr);\
+ fctkern__log_test_skip(\
+ fctkern_ptr__,\
+ fctkern_ptr__->ns.curr_test_name,\
+ (fctkern_ptr__->ns.test_is_skip) ?\
+ (fctkern_ptr__->ns.test_skip_cndtn) :\
+ (fctkern_ptr__->ns.ts_skip_cndtn)\
+ );\
+ fct_ts__test_end(fctkern_ptr__->ns.ts_curr);\
+ continue;\
+ } else {\
+ fctkern__log_test_start(fctkern_ptr__, fctkern_ptr__->ns.curr_test);\
+ fct_test__start_timer(fctkern_ptr__->ns.curr_test);\
+ for (;;) \
+ {
+
+
+
+
+#define FCT_TEST_END() \
+ break;\
+ }\
+ fct_test__stop_timer(fctkern_ptr__->ns.curr_test);\
+ }\
+ fct_ts__add_test(fctkern_ptr__->ns.ts_curr, fctkern_ptr__->ns.curr_test);\
+ fctkern__log_test_end(fctkern_ptr__, fctkern_ptr__->ns.curr_test);\
+ }\
+ fct_ts__test_end(fctkern_ptr__->ns.ts_curr);\
+ continue;\
+ }\
+ }\
+
+
+
+/*
+---------------------------------------------------------
+CHECKING MACROS
+----------------------------------------------------------
+
+The chk variants will continue on while the req variants will abort
+a test if a chk condition fails. The req variants are useful when you
+no longer want to keep checking conditions because a critical condition
+is not being met. */
+
+
+/* To support older compilers that do not have macro variable argument lists
+we have to use a function. The macro manages to store away the line/file
+location into a global before it runs this function, a trick I picked up from
+the error handling in the APR library. The unfortunate thing is that we can
+not carry forth the actual test through a "stringize" operation, but if you
+wanted to do that you should use fct_chk. */
+
+static int fct_xchk_lineno =0;
+static char const *fct_xchk_file = NULL;
+static fct_test_t *fct_xchk_test = NULL;
+static fctkern_t *fct_xchk_kern =NULL;
+
+
+static int
+_fct_xchk_fn_varg(
+ char const *condition,
+ int is_pass,
+ char const *format,
+ va_list args
+)
+{
+ fctchk_t *chk =NULL;
+ chk = fctchk_new(
+ is_pass,
+ condition,
+ fct_xchk_file,
+ fct_xchk_lineno,
+ format,
+ args
+ );
+ if ( chk == NULL )
+ {
+ fctkern__log_warn(fct_xchk_kern, "out of memory (aborting test)");
+ goto finally;
+ }
+
+ fct_test__add(fct_xchk_test, chk);
+ fctkern__log_chk(fct_xchk_kern, chk);
+finally:
+ fct_xchk_lineno =0;
+ fct_xchk_file =NULL;
+ fct_xchk_test =NULL;
+ fct_xchk_kern =NULL;
+ return is_pass;
+}
+
+
+static int
+fct_xchk2_fn(const char *condition, int is_pass, char const *format, ...)
+{
+ int r =0;
+ va_list args;
+ va_start(args, format);
+ r = _fct_xchk_fn_varg(condition, is_pass, format, args);
+ va_end(args);
+ return r;
+}
+
+
+static int
+fct_xchk_fn(int is_pass, char const *format, ...)
+{
+ int r=0;
+ va_list args;
+ va_start(args, format);
+ r = _fct_xchk_fn_varg("<none-from-xchk>", is_pass, format, args);
+ va_end(args);
+ return r;
+}
+
+
+/* Call this with the following argument list:
+
+ fct_xchk(test_condition, format_str, ...)
+
+the bulk of this macro presets some globals to allow us to support
+variable argument lists on older compilers. The idea came from the APR
+libraries error checking routines. */
+#define fct_xchk fct_xchk_kern = fctkern_ptr__,\
+ fct_xchk_test = fctkern_ptr__->ns.curr_test,\
+ fct_xchk_lineno =__LINE__,\
+ fct_xchk_file=__FILE__,\
+ fct_xchk_fn
+
+#define fct_xchk2 fct_xchk_kern = fctkern_ptr__,\
+ fct_xchk_test = fctkern_ptr__->ns.curr_test,\
+ fct_xchk_lineno =__LINE__,\
+ fct_xchk_file=__FILE__,\
+ fct_xchk2_fn
+
+
+/* This checks the condition and reports the condition as a string
+if it fails. */
+#define fct_chk(_CNDTN_) (fct_xchk((_CNDTN_) ? 1 : 0, #_CNDTN_))
+
+#define _fct_req(_CNDTN_) \
+ if ( !(fct_xchk((_CNDTN_) ? 1 : 0, #_CNDTN_)) ) { break; }
+
+
+/* When in test mode, construct a mock test object for fct_xchk to operate
+with. If we fail a setup up, then we go directly to a teardown mode. */
+#define fct_req(_CNDTN_) \
+ if ( fct_ts__is_test_mode(fctkern_ptr__->ns.ts_curr) ) { \
+ _fct_req((_CNDTN_)); \
+ } \
+ else if ( fct_ts__is_setup_mode(fctkern_ptr__->ns.ts_curr) \
+ || fct_ts__is_teardown_mode(fctkern_ptr__->ns.ts_curr) ) { \
+ fctkern_ptr__->ns.curr_test = fct_ts__make_abort_test( \
+ fctkern_ptr__->ns.ts_curr \
+ ); \
+ if ( !(fct_xchk((_CNDTN_) ? 1 : 0, #_CNDTN_)) ) { \
+ fct_ts__setup_abort(fctkern_ptr__->ns.ts_curr); \
+ fct_ts__add_test( \
+ fctkern_ptr__->ns.ts_curr, fctkern_ptr__->ns.curr_test \
+ ); \
+ } \
+ } else { \
+ assert("invalid condition for fct_req!"); \
+ _fct_req((_CNDTN_)); \
+ }
+
+
+#define fct_chk_eq_dbl(V1, V2) \
+ fct_xchk(\
+ ((int)(fabs((V1)-(V2)) < DBL_EPSILON)),\
+ "chk_eq_dbl: %f != %f",\
+ (V1),\
+ (V2)\
+ )
+
+
+#define fct_chk_neq_dbl(V1, V2) \
+ fct_xchk(\
+ ((int)(fabs((V1)-(V2)) >= DBL_EPSILON)),\
+ "chk_neq_dbl: %f == %f",\
+ (V1),\
+ (V2)\
+ )
+
+
+#define fct_chk_eq_str(V1, V2) \
+ fct_xchk(fctstr_eq((V1), (V2)),\
+ "chk_eq_str: '%s' != '%s'",\
+ (V1),\
+ (V2)\
+ )
+
+
+#define fct_chk_neq_str(V1, V2) \
+ fct_xchk(!fctstr_eq((V1), (V2)),\
+ "chk_neq_str: '%s' == '%s'",\
+ (V1),\
+ (V2)\
+ )
+
+/* To quiet warnings with GCC, who think we are being silly and passing
+in NULL to strlen, we will filter the predicate through these little
+functions */
+static int
+_fct_chk_empty_str(char const *s)
+{
+ if ( s == NULL )
+ {
+ return 1;
+ }
+ return strlen(s) ==0;
+}
+static int
+_fct_chk_full_str(char const *s)
+{
+ if ( s == NULL )
+ {
+ return 0;
+ }
+ return strlen(s) >0;
+}
+
+
+#define fct_chk_empty_str(V) \
+ fct_xchk(_fct_chk_empty_str((V)),\
+ "string not empty: '%s'",\
+ (V)\
+ )
+
+#define fct_chk_full_str(V) \
+ fct_xchk(_fct_chk_full_str((V)),\
+ "string is full: '%s'",\
+ (V)\
+ )
+
+
+#define fct_chk_eq_istr(V1, V2) \
+ fct_xchk(fctstr_ieq((V1), (V2)),\
+ "chk_eq_str: '%s' != '%s'",\
+ (V1),\
+ (V2)\
+ )
+
+
+#define fct_chk_neq_istr(V1, V2) \
+ fct_xchk(!fctstr_ieq((V1), (V2)),\
+ "chk_neq_str: '%s' == '%s'",\
+ (V1),\
+ (V2)\
+ )
+
+
+#define fct_chk_endswith_str(STR, CHECK)\
+ fct_xchk(fctstr_endswith((STR),(CHECK)),\
+ "fct_chk_endswith_str: '%s' doesn't end with '%s'",\
+ (STR),\
+ (CHECK)\
+ )
+
+
+#define fct_chk_iendswith_str(STR, CHECK)\
+ fct_xchk(fctstr_iendswith((STR), (CHECK)),\
+ "fch_chk_iendswith_str: '%s' doesn't end with '%s'.",\
+ (STR),\
+ (CHECK)\
+ )
+
+#define fct_chk_excl_str(STR, CHECK_EXCLUDE) \
+ fct_xchk(!fctstr_incl((STR), (CHECK_EXCLUDE)),\
+ "fct_chk_excl_str: '%s' is included in '%s'",\
+ (STR),\
+ (CHECK_EXCLUDE)\
+ )
+
+#define fct_chk_excl_istr(ISTR, ICHECK_EXCLUDE) \
+ fct_xchk(!fctstr_iincl((ISTR), (ICHECK_EXCLUDE)),\
+ "fct_chk_excl_istr (case insensitive): '%s' is "\
+ "included in'%s'",\
+ (ISTR),\
+ (ICHECK_EXCLUDE)\
+ )
+
+#define fct_chk_incl_str(STR, CHECK_INCLUDE) \
+ fct_xchk(fctstr_incl((STR), (CHECK_INCLUDE)),\
+ "fct_chk_incl_str: '%s' does not include '%s'",\
+ (STR),\
+ (CHECK_INCLUDE)\
+ )
+
+
+#define fct_chk_incl_istr(ISTR, ICHECK_INCLUDE) \
+ fct_xchk(fctstr_iincl((ISTR), (ICHECK_INCLUDE)),\
+ "fct_chk_incl_istr (case insensitive): '%s' does "\
+ "not include '%s'",\
+ (ISTR),\
+ (ICHECK_INCLUDE)\
+ )
+
+
+#define fct_chk_startswith_str(STR, CHECK)\
+ fct_xchk(fctstr_startswith((STR), (CHECK)),\
+ "'%s' does not start with '%s'",\
+ (STR),\
+ (CHECK)\
+ )
+
+
+#define fct_chk_startswith_istr(STR, CHECK)\
+ fct_xchk(fctstr_istartswith((STR), (CHECK)),\
+ "case insensitive check: '%s' does not start with '%s'",\
+ (STR),\
+ (CHECK)\
+ )
+
+#define fct_chk_eq_int(V1, V2) \
+ fct_xchk(\
+ ((V1) == (V2)),\
+ "chq_eq_int: %d != %d",\
+ (V1),\
+ (V2)\
+ )
+
+
+#define fct_chk_neq_int(V1, V2) \
+ fct_xchk(\
+ ((V1) != (V2)),\
+ "chq_neq_int: %d == %d",\
+ (V1),\
+ (V2)\
+ )
+
+#define fct_chk_ex(EXCEPTION, CODE) \
+ { \
+ bool pass_chk_ex = false; \
+ try { \
+ CODE; \
+ pass_chk_ex = false; \
+ } catch ( EXCEPTION ) { \
+ pass_chk_ex = true; \
+ } catch ( ... ) { \
+ pass_chk_ex = false; \
+ } \
+ fct_xchk( \
+ pass_chk_ex, \
+ "%s exception not generated", \
+ #EXCEPTION \
+ ); \
+ } \
+
+/*
+---------------------------------------------------------
+GUT CHECK MACROS
+----------------------------------------------------------
+
+The following macros are used to help check the "guts" of
+the FCT, and to confirm that it all works according to spec.
+*/
+
+/* Generates a message to STDERR and exits the application with a
+non-zero number. */
+#define _FCT_GUTCHK(_CNDTN_) \
+ if ( !(_CNDTN_) ) {\
+ fprintf(stderr, "gutchk fail: '" #_CNDTN_ "' was not true.\n");\
+ exit(1);\
+ }\
+ else {\
+ fprintf(stdout, "gutchk pass: '" #_CNDTN_ "'\n");\
+ }
+
+/*
+---------------------------------------------------------
+MULTI-FILE TEST SUITE MACROS
+----------------------------------------------------------
+
+I struggled trying to figure this out in a way that was
+as simple as possible. I wanted to be able to define
+the test suite in one object file, then refer it within
+the other one within the minimum amount of typing.
+
+Unfortunately without resorting to some supermacro
+work, I could only find a happy comprimise.
+
+See test_multi.c for an example.
+*/
+
+/* The following macros are used in your separate object
+file to define your test suite. */
+
+
+#define FCTMF_FIXTURE_SUITE_BGN(NAME) \
+ void NAME (fctkern_t *fctkern_ptr__) {\
+ FCT_REFERENCE_FUNCS();\
+ FCT_FIXTURE_SUITE_BGN( NAME ) {
+
+#define FCTMF_FIXTURE_SUITE_END() \
+ } FCT_FIXTURE_SUITE_END();\
+ }
+
+#define FCTMF_SUITE_BGN(NAME) \
+ void NAME (fctkern_t *fctkern_ptr__) {\
+ FCT_REFERENCE_FUNCS();\
+ FCT_SUITE_BGN( NAME ) {
+#define FCTMF_SUITE_END() \
+ } FCT_SUITE_END(); \
+ }
+
+
+/* Deprecated, no longer required. */
+#define FCTMF_SUITE_DEF(NAME)
+
+
+/* Executes a test suite defined by FCTMF_SUITE* */
+#define FCTMF_SUITE_CALL(NAME) {\
+ void NAME (fctkern_t *);\
+ NAME (fctkern_ptr__);\
+ }
+
+
+/*
+---------------------------------------------------------
+FCT QUICK TEST API
+----------------------------------------------------------
+The goal of these little macros is to try and get you
+up and running with a test as quick as possible.
+
+The basic idea is that there is one test per test suite.
+*/
+
+#define FCT_QTEST_BGN(NAME) \
+ FCT_SUITE_BGN(NAME) {\
+ FCT_TEST_BGN(NAME) {\
+
+#define FCT_QTEST_END() \
+ } FCT_TEST_END();\
+ } FCT_SUITE_END();
+
+
+#define FCT_QTEST_BGN_IF(_CONDITION_, _NAME_) \
+ FCT_SUITE_BGN(_NAME_) {\
+ FCT_TEST_BGN_IF(_CONDITION_, _NAME_) {\
+
+#define FCT_QTEST_END_IF() \
+ } FCT_TEST_END_IF();\
+ } FCT_SUITE_END();
+
+#endif /* !FCT_INCLUDED__IMB */
diff --git a/3party/lodepng/lodepng.cpp b/3party/lodepng/lodepng.cpp
new file mode 100644
index 0000000000..2fbeab6246
--- /dev/null
+++ b/3party/lodepng/lodepng.cpp
@@ -0,0 +1,4340 @@
+/*
+LodePNG version 20100314
+
+Copyright (c) 2005-2010 Lode Vandevenne
+
+This software is provided 'as-is', without any express or implied
+warranty. In no event will the authors be held liable for any damages
+arising from the use of this software.
+
+Permission is granted to anyone to use this software for any purpose,
+including commercial applications, and to alter it and redistribute it
+freely, subject to the following restrictions:
+
+ 1. The origin of this software must not be misrepresented; you must not
+ claim that you wrote the original software. If you use this software
+ in a product, an acknowledgment in the product documentation would be
+ appreciated but is not required.
+
+ 2. Altered source versions must be plainly marked as such, and must not be
+ misrepresented as being the original software.
+
+ 3. This notice may not be removed or altered from any source
+ distribution.
+*/
+
+/*
+The manual and changelog can be found in the header file "lodepng.h"
+You are free to name this file lodepng.cpp or lodepng.c depending on your usage.
+*/
+
+#include "lodepng.hpp"
+
+#define VERSION_STRING "20100314"
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* / Tools For C / */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+/*
+About these tools (vector, uivector, ucvector and string):
+-LodePNG was originally written in C++. The vectors replace the std::vectors that were used in the C++ version.
+-The string tools are made to avoid problems with compilers that declare things like strncat as deprecated.
+-They're not used in the interface, only internally in this file, so all their functions are made static.
+*/
+
+#ifdef LODEPNG_COMPILE_ZLIB
+#ifdef LODEPNG_COMPILE_ENCODER
+
+typedef struct png_vector /*this one is used only by the deflate compressor*/
+{
+ void* data;
+ size_t size; /*in groups of bytes depending on type*/
+ size_t allocsize; /*in bytes*/
+ unsigned typesize; /*sizeof the type you store in data*/
+} png_vector;
+
+static unsigned vector_resize(png_vector* p, size_t size) /*returns 1 if success, 0 if failure ==> nothing done*/
+{
+ if(size * p->typesize > p->allocsize)
+ {
+ size_t newsize = size * p->typesize * 2;
+ void* data = realloc(p->data, newsize);
+ if(data)
+ {
+ p->allocsize = newsize;
+ p->data = data;
+ p->size = size;
+ }
+ else return 0;
+ }
+ else p->size = size;
+ return 1;
+}
+
+static unsigned vector_resized(png_vector* p, size_t size, void dtor(void*)) /*resize and use destructor on elements if it gets smaller*/
+{
+ size_t i;
+ if(size < p->size) for(i = size; i < p->size; i++) dtor(&((char*)(p->data))[i * p->typesize]);
+ return vector_resize(p, size);
+}
+
+static void vector_cleanup(void* p)
+{
+ ((png_vector*)p)->size = ((png_vector*)p)->allocsize = 0;
+ free(((png_vector*)p)->data);
+ ((png_vector*)p)->data = NULL;
+}
+
+static void vector_cleanupd(png_vector* p, void dtor(void*)) /*clear and use destructor on elements*/
+{
+ vector_resized(p, 0, dtor);
+ vector_cleanup(p);
+}
+
+static void vector_init(png_vector* p, unsigned typesize)
+{
+ p->data = NULL;
+ p->size = p->allocsize = 0;
+ p->typesize = typesize;
+}
+
+static void vector_swap(png_vector* p, png_vector* q) /*they're supposed to have the same typesize*/
+{
+ size_t tmp;
+ void* tmpp;
+ tmp = p->size; p->size = q->size; q->size = tmp;
+ tmp = p->allocsize; p->allocsize = q->allocsize; q->allocsize = tmp;
+ tmpp = p->data; p->data = q->data; q->data = tmpp;
+}
+
+static void* vector_get(png_vector* p, size_t index)
+{
+ return &((char*)p->data)[index * p->typesize];
+}
+
+#endif /*LODEPNG_COMPILE_ENCODER*/
+#endif /*LODEPNG_COMPILE_ZLIB*/
+
+/* /////////////////////////////////////////////////////////////////////////// */
+
+#ifdef LODEPNG_COMPILE_ZLIB
+typedef struct uivector
+{
+ unsigned* data;
+ size_t size; /*size in number of unsigned longs*/
+ size_t allocsize; /*allocated size in bytes*/
+} uivector;
+
+static void uivector_cleanup(void* p)
+{
+ ((uivector*)p)->size = ((uivector*)p)->allocsize = 0;
+ free(((uivector*)p)->data);
+ ((uivector*)p)->data = NULL;
+}
+
+static unsigned uivector_resize(uivector* p, size_t size) /*returns 1 if success, 0 if failure ==> nothing done*/
+{
+ if(size * sizeof(unsigned) > p->allocsize)
+ {
+ size_t newsize = size * sizeof(unsigned) * 2;
+ void* data = realloc(p->data, newsize);
+ if(data)
+ {
+ p->allocsize = newsize;
+ p->data = (unsigned*)data;
+ p->size = size;
+ }
+ else return 0;
+ }
+ else p->size = size;
+ return 1;
+}
+
+static unsigned uivector_resizev(uivector* p, size_t size, unsigned value) /*resize and give all new elements the value*/
+{
+ size_t oldsize = p->size, i;
+ if(!uivector_resize(p, size)) return 0;
+ for(i = oldsize; i < size; i++) p->data[i] = value;
+ return 1;
+}
+
+static void uivector_init(uivector* p)
+{
+ p->data = NULL;
+ p->size = p->allocsize = 0;
+}
+
+#ifdef LODEPNG_COMPILE_ENCODER
+static unsigned uivector_push_back(uivector* p, unsigned c) /*returns 1 if success, 0 if failure ==> nothing done*/
+{
+ if(!uivector_resize(p, p->size + 1)) return 0;
+ p->data[p->size - 1] = c;
+ return 1;
+}
+
+static unsigned uivector_copy(uivector* p, const uivector* q) /*copy q to p, returns 1 if success, 0 if failure ==> nothing done*/
+{
+ size_t i;
+ if(!uivector_resize(p, q->size)) return 0;
+ for(i = 0; i < q->size; i++) p->data[i] = q->data[i];
+ return 1;
+}
+
+static void uivector_swap(uivector* p, uivector* q)
+{
+ size_t tmp;
+ unsigned* tmpp;
+ tmp = p->size; p->size = q->size; q->size = tmp;
+ tmp = p->allocsize; p->allocsize = q->allocsize; q->allocsize = tmp;
+ tmpp = p->data; p->data = q->data; q->data = tmpp;
+}
+#endif /*LODEPNG_COMPILE_ENCODER*/
+#endif /*LODEPNG_COMPILE_ZLIB*/
+
+/* /////////////////////////////////////////////////////////////////////////// */
+
+typedef struct ucvector
+{
+ unsigned char* data;
+ size_t size; /*used size*/
+ size_t allocsize; /*allocated size*/
+} ucvector;
+
+static void ucvector_cleanup(void* p)
+{
+ ((ucvector*)p)->size = ((ucvector*)p)->allocsize = 0;
+ free(((ucvector*)p)->data);
+ ((ucvector*)p)->data = NULL;
+}
+
+static unsigned ucvector_resize(ucvector* p, size_t size) /*returns 1 if success, 0 if failure ==> nothing done*/
+{
+ if(size * sizeof(unsigned char) > p->allocsize)
+ {
+ size_t newsize = size * sizeof(unsigned char) * 2;
+ void* data = realloc(p->data, newsize);
+ if(data)
+ {
+ p->allocsize = newsize;
+ p->data = (unsigned char*)data;
+ p->size = size;
+ }
+ else return 0; /*error: not enough memory*/
+ }
+ else p->size = size;
+ return 1;
+}
+
+#ifdef LODEPNG_COMPILE_DECODER
+#ifdef LODEPNG_COMPILE_PNG
+static unsigned ucvector_resizev(ucvector* p, size_t size, unsigned char value) /*resize and give all new elements the value*/
+{
+ size_t oldsize = p->size, i;
+ if(!ucvector_resize(p, size)) return 0;
+ for(i = oldsize; i < size; i++) p->data[i] = value;
+ return 1;
+}
+#endif /*LODEPNG_COMPILE_PNG*/
+#endif /*LODEPNG_COMPILE_DECODER*/
+
+static void ucvector_init(ucvector* p)
+{
+ p->data = NULL;
+ p->size = p->allocsize = 0;
+}
+
+#ifdef LODEPNG_COMPILE_ZLIB
+/*you can both convert from png_vector to buffer&size and vica versa*/
+static void ucvector_init_buffer(ucvector* p, unsigned char* buffer, size_t size)
+{
+ p->data = buffer;
+ p->allocsize = p->size = size;
+}
+#endif /*LODEPNG_COMPILE_ZLIB*/
+
+static unsigned ucvector_push_back(ucvector* p, unsigned char c) /*returns 1 if success, 0 if failure ==> nothing done*/
+{
+ if(!ucvector_resize(p, p->size + 1)) return 0;
+ p->data[p->size - 1] = c;
+ return 1;
+}
+
+/* /////////////////////////////////////////////////////////////////////////// */
+
+#ifdef LODEPNG_COMPILE_PNG
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+static unsigned string_resize(char** out, size_t size) /*returns 1 if success, 0 if failure ==> nothing done*/
+{
+ char* data = (char*)realloc(*out, size + 1);
+ if(data)
+ {
+ data[size] = 0; /*null termination char*/
+ *out = data;
+ }
+ return data != 0;
+}
+
+static void string_init(char** out) /*init a {char*, size_t} pair for use as string*/
+{
+ *out = NULL;
+ string_resize(out, 0);
+}
+
+static void string_cleanup(char** out) /*free the above pair again*/
+{
+ free(*out);
+ *out = NULL;
+}
+
+static void string_set(char** out, const char* in)
+{
+ size_t insize = strlen(in), i = 0;
+ if(string_resize(out, insize)) for(i = 0; i < insize; i++) (*out)[i] = in[i];
+}
+#endif /*LODEPNG_COMPILE_ANCILLARY_CHUNKS*/
+#endif /*LODEPNG_COMPILE_PNG*/
+
+#ifdef LODEPNG_COMPILE_ZLIB
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* / Reading and writing single bits and bytes from/to stream for Deflate / */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+#ifdef LODEPNG_COMPILE_ENCODER
+static void addBitToStream(size_t* bitpointer, ucvector* bitstream, unsigned char bit)
+{
+ if((*bitpointer) % 8 == 0) ucvector_push_back(bitstream, 0); /*add a new byte at the end*/
+ (bitstream->data[bitstream->size - 1]) |= (bit << ((*bitpointer) & 0x7)); /*earlier bit of huffman code is in a lesser significant bit of an earlier byte*/
+ (*bitpointer)++;
+}
+
+static void addBitsToStream(size_t* bitpointer, ucvector* bitstream, unsigned value, size_t nbits)
+{
+ size_t i;
+ for(i = 0; i < nbits; i++) addBitToStream(bitpointer, bitstream, (unsigned char)((value >> i) & 1));
+}
+
+static void addBitsToStreamReversed(size_t* bitpointer, ucvector* bitstream, unsigned value, size_t nbits)
+{
+ size_t i;
+ for(i = 0; i < nbits; i++) addBitToStream(bitpointer, bitstream, (unsigned char)((value >> (nbits - 1 - i)) & 1));
+}
+#endif /*LODEPNG_COMPILE_ENCODER*/
+
+#ifdef LODEPNG_COMPILE_DECODER
+static unsigned char readBitFromStream(size_t* bitpointer, const unsigned char* bitstream)
+{
+ unsigned char result = (unsigned char)((bitstream[(*bitpointer) >> 3] >> ((*bitpointer) & 0x7)) & 1);
+ (*bitpointer)++;
+ return result;
+}
+
+static unsigned readBitsFromStream(size_t* bitpointer, const unsigned char* bitstream, size_t nbits)
+{
+ unsigned result = 0, i;
+ for(i = 0; i < nbits; i++) result += ((unsigned)readBitFromStream(bitpointer, bitstream)) << i;
+ return result;
+}
+#endif /*LODEPNG_COMPILE_DECODER*/
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* / Deflate - Huffman / */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+#define FIRST_LENGTH_CODE_INDEX 257
+#define LAST_LENGTH_CODE_INDEX 285
+#define NUM_DEFLATE_CODE_SYMBOLS 288 /*256 literals, the end code, some length codes, and 2 unused codes*/
+#define NUM_DISTANCE_SYMBOLS 32 /*the distance codes have their own symbols, 30 used, 2 unused*/
+#define NUM_CODE_LENGTH_CODES 19 /*the code length codes. 0-15: code lengths, 16: copy previous 3-6 times, 17: 3-10 zeros, 18: 11-138 zeros*/
+
+static const unsigned LENGTHBASE[29] /*the base lengths represented by codes 257-285*/
+ = {3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258};
+static const unsigned LENGTHEXTRA[29] /*the extra bits used by codes 257-285 (added to base length)*/
+ = {0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0};
+static const unsigned DISTANCEBASE[30] /*the base backwards distances (the bits of distance codes appear after length codes and use their own huffman tree)*/
+ = {1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577};
+static const unsigned DISTANCEEXTRA[30] /*the extra bits of backwards distances (added to base)*/
+ = {0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13};
+static const unsigned CLCL[NUM_CODE_LENGTH_CODES] /*the order in which "code length alphabet code lengths" are stored, out of this the huffman tree of the dynamic huffman tree lengths is generated*/
+ = {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};
+
+/* /////////////////////////////////////////////////////////////////////////// */
+
+#ifdef LODEPNG_COMPILE_ENCODER
+/*terminology used for the package-merge algorithm and the coin collector's problem*/
+typedef struct Coin /*a coin can be multiple coins (when they're merged)*/
+{
+ uivector symbols;
+ float weight; /*the sum of all weights in this coin*/
+} Coin;
+
+static void Coin_init(Coin* c)
+{
+ uivector_init(&c->symbols);
+}
+
+static void Coin_cleanup(void* c) /*void* so that this dtor can be given as function pointer to the vector resize function*/
+{
+ uivector_cleanup(&((Coin*)c)->symbols);
+}
+
+static void Coin_copy(Coin* c1, const Coin* c2)
+{
+ c1->weight = c2->weight;
+ uivector_copy(&c1->symbols, &c2->symbols);
+}
+
+static void addCoins(Coin* c1, const Coin* c2)
+{
+ unsigned i;
+ for(i = 0; i < c2->symbols.size; i++) uivector_push_back(&c1->symbols, c2->symbols.data[i]);
+ c1->weight += c2->weight;
+}
+
+static void Coin_sort(Coin* data, size_t amount) /*combsort*/
+{
+ size_t gap = amount;
+ unsigned char swapped = 0;
+ while(gap > 1 || swapped)
+ {
+ size_t i;
+ gap = (gap * 10) / 13; /*shrink factor 1.3*/
+ if(gap == 9 || gap == 10) gap = 11; /*combsort11*/
+ if(gap < 1) gap = 1;
+ swapped = 0;
+ for(i = 0; i < amount - gap; i++)
+ {
+ size_t j = i + gap;
+ if(data[j].weight < data[i].weight)
+ {
+ float temp = data[j].weight; data[j].weight = data[i].weight; data[i].weight = temp;
+ uivector_swap(&data[i].symbols, &data[j].symbols);
+ swapped = 1;
+ }
+ }
+ }
+}
+#endif /*LODEPNG_COMPILE_ENCODER*/
+
+typedef struct HuffmanTree
+{
+ uivector tree2d;
+ uivector tree1d;
+ uivector lengths; /*the lengths of the codes of the 1d-tree*/
+ unsigned maxbitlen; /*maximum number of bits a single code can get*/
+ unsigned numcodes; /*number of symbols in the alphabet = number of codes*/
+} HuffmanTree;
+
+/*function used for debug purposes*/
+/*#include <iostream>
+static void HuffmanTree_draw(HuffmanTree* tree)
+{
+ std::cout << "tree. length: " << tree->numcodes << " maxbitlen: " << tree->maxbitlen << std::endl;
+ for(size_t i = 0; i < tree->tree1d.size; i++)
+ {
+ if(tree->lengths.data[i])
+ std::cout << i << " " << tree->tree1d.data[i] << " " << tree->lengths.data[i] << std::endl;
+ }
+ std::cout << std::endl;
+}*/
+
+static void HuffmanTree_init(HuffmanTree* tree)
+{
+ uivector_init(&tree->tree2d);
+ uivector_init(&tree->tree1d);
+ uivector_init(&tree->lengths);
+}
+
+static void HuffmanTree_cleanup(HuffmanTree* tree)
+{
+ uivector_cleanup(&tree->tree2d);
+ uivector_cleanup(&tree->tree1d);
+ uivector_cleanup(&tree->lengths);
+}
+
+/*the tree representation used by the decoder. return value is error*/
+static unsigned HuffmanTree_make2DTree(HuffmanTree* tree)
+{
+ unsigned nodefilled = 0; /*up to which node it is filled*/
+ unsigned treepos = 0; /*position in the tree (1 of the numcodes columns)*/
+ unsigned n, i;
+
+ if(!uivector_resize(&tree->tree2d, tree->numcodes * 2)) return 9901; /*if failed return not enough memory error*/
+ /*convert tree1d[] to tree2d[][]. In the 2D array, a value of 32767 means uninited, a value >= numcodes is an address to another bit, a value < numcodes is a code. The 2 rows are the 2 possible bit values (0 or 1), there are as many columns as codes - 1
+ a good huffmann tree has N * 2 - 1 nodes, of which N - 1 are internal nodes. Here, the internal nodes are stored (what their 0 and 1 option point to). There is only memory for such good tree currently, if there are more nodes (due to too long length codes), error 55 will happen*/
+ for(n = 0; n < tree->numcodes * 2; n++) tree->tree2d.data[n] = 32767; /*32767 here means the tree2d isn't filled there yet*/
+
+ for(n = 0; n < tree->numcodes; n++) /*the codes*/
+ for(i = 0; i < tree->lengths.data[n]; i++) /*the bits for this code*/
+ {
+ unsigned char bit = (unsigned char)((tree->tree1d.data[n] >> (tree->lengths.data[n] - i - 1)) & 1);
+ if(treepos > tree->numcodes - 2) return 55; /*error 55: oversubscribed; see description in header*/
+ if(tree->tree2d.data[2 * treepos + bit] == 32767) /*not yet filled in*/
+ {
+ if(i + 1 == tree->lengths.data[n]) /*last bit*/
+ {
+ tree->tree2d.data[2 * treepos + bit] = n; /*put the current code in it*/
+ treepos = 0;
+ }
+ else /*put address of the next step in here, first that address has to be found of course (it's just nodefilled + 1)...*/
+ {
+ nodefilled++;
+ tree->tree2d.data[2 * treepos + bit] = nodefilled + tree->numcodes; /*addresses encoded with numcodes added to it*/
+ treepos = nodefilled;
+ }
+ }
+ else treepos = tree->tree2d.data[2 * treepos + bit] - tree->numcodes;
+ }
+ for(n = 0; n < tree->numcodes * 2; n++) if(tree->tree2d.data[n] == 32767) tree->tree2d.data[n] = 0; /*remove possible remaining 32767's*/
+
+ return 0;
+}
+
+static unsigned HuffmanTree_makeFromLengths2(HuffmanTree* tree) /*given that numcodes, lengths and maxbitlen are already filled in correctly. return value is error.*/
+{
+ uivector blcount;
+ uivector nextcode;
+ unsigned bits, n, error = 0;
+
+ uivector_init(&blcount);
+ uivector_init(&nextcode);
+ if(!uivector_resize(&tree->tree1d, tree->numcodes)
+ || !uivector_resizev(&blcount, tree->maxbitlen + 1, 0)
+ || !uivector_resizev(&nextcode, tree->maxbitlen + 1, 0))
+ error = 9902;
+
+ if(!error)
+ {
+ /*step 1: count number of instances of each code length*/
+ for(bits = 0; bits < tree->numcodes; bits++) blcount.data[tree->lengths.data[bits]]++;
+ /*step 2: generate the nextcode values*/
+ for(bits = 1; bits <= tree->maxbitlen; bits++) nextcode.data[bits] = (nextcode.data[bits - 1] + blcount.data[bits - 1]) << 1;
+ /*step 3: generate all the codes*/
+ for(n = 0; n < tree->numcodes; n++) if(tree->lengths.data[n] != 0) tree->tree1d.data[n] = nextcode.data[tree->lengths.data[n]]++;
+ }
+
+ uivector_cleanup(&blcount);
+ uivector_cleanup(&nextcode);
+
+ if(!error) return HuffmanTree_make2DTree(tree);
+ else return error;
+}
+
+/*given the code lengths (as stored in the PNG file), generate the tree as defined by Deflate. maxbitlen is the maximum bits that a code in the tree can have. return value is error.*/
+static unsigned HuffmanTree_makeFromLengths(HuffmanTree* tree, const unsigned* bitlen, size_t numcodes, unsigned maxbitlen)
+{
+ unsigned i;
+ if(!uivector_resize(&tree->lengths, numcodes)) return 9903;
+ for(i = 0; i < numcodes; i++) tree->lengths.data[i] = bitlen[i];
+ tree->numcodes = (unsigned)numcodes; /*number of symbols*/
+ tree->maxbitlen = maxbitlen;
+ return HuffmanTree_makeFromLengths2(tree);
+}
+
+#ifdef LODEPNG_COMPILE_ENCODER
+static unsigned HuffmanTree_fillInCoins(png_vector* coins, const unsigned* frequencies, unsigned numcodes, size_t sum)
+{
+ unsigned i;
+ for(i = 0; i < numcodes; i++)
+ {
+ Coin* coin;
+ if(frequencies[i] == 0) continue; /*it's important to exclude symbols that aren't present*/
+ if(!vector_resize(coins, coins->size + 1)) { vector_cleanup(coins); return 9904; }
+ coin = (Coin*)(vector_get(coins, coins->size - 1));
+ Coin_init(coin);
+ coin->weight = frequencies[i] / (float)sum;
+ uivector_push_back(&coin->symbols, i);
+ }
+ if(coins->size) Coin_sort((Coin*)coins->data, coins->size);
+ return 0;
+}
+
+static unsigned HuffmanTree_makeFromFrequencies(HuffmanTree* tree, const unsigned* frequencies, size_t numcodes, unsigned maxbitlen)
+{
+ unsigned i, j;
+ size_t sum = 0, numpresent = 0;
+ unsigned error = 0;
+
+ png_vector prev_row; /*type Coin, the previous row of coins*/
+ png_vector coins; /*type Coin, the coins of the currently calculated row*/
+
+ tree->maxbitlen = maxbitlen;
+
+ for(i = 0; i < numcodes; i++)
+ {
+ if(frequencies[i] > 0)
+ {
+ numpresent++;
+ sum += frequencies[i];
+ }
+ }
+
+ if(numcodes == 0) return 80; /*error: a tree of 0 symbols is not supposed to be made*/
+ tree->numcodes = (unsigned)numcodes; /*number of symbols*/
+ uivector_resize(&tree->lengths, 0);
+ if(!uivector_resizev(&tree->lengths, tree->numcodes, 0)) return 9905;
+
+ if(numpresent == 0) /*there are no symbols at all, in that case add one symbol of value 0 to the tree (see RFC 1951 section 3.2.7) */
+ {
+ tree->lengths.data[0] = 1;
+ return HuffmanTree_makeFromLengths2(tree);
+ }
+ else if(numpresent == 1) /*the package merge algorithm gives wrong results if there's only one symbol (theoretically 0 bits would then suffice, but we need a proper symbol for zlib)*/
+ {
+ for(i = 0; i < numcodes; i++) if(frequencies[i]) tree->lengths.data[i] = 1;
+ return HuffmanTree_makeFromLengths2(tree);
+ }
+
+ vector_init(&coins, sizeof(Coin));
+ vector_init(&prev_row, sizeof(Coin));
+
+ /*Package-Merge algorithm represented by coin collector's problem
+ For every symbol, maxbitlen coins will be created*/
+
+ /*first row, lowest denominator*/
+ error = HuffmanTree_fillInCoins(&coins, frequencies, tree->numcodes, sum);
+ if(!error)
+ {
+ for(j = 1; j <= maxbitlen && !error; j++) /*each of the remaining rows*/
+ {
+ vector_swap(&coins, &prev_row); /*swap instead of copying*/
+ if(!vector_resized(&coins, 0, Coin_cleanup)) { error = 9906; break; }
+
+ for(i = 0; i + 1 < prev_row.size; i += 2)
+ {
+ if(!vector_resize(&coins, coins.size + 1)) { error = 9907; break; }
+ Coin_init((Coin*)vector_get(&coins, coins.size - 1));
+ Coin_copy((Coin*)vector_get(&coins, coins.size - 1), (Coin*)vector_get(&prev_row, i));
+ addCoins((Coin*)vector_get(&coins, coins.size - 1), (Coin*)vector_get(&prev_row, i + 1)); /*merge the coins into packages*/
+ }
+ if(j < maxbitlen)
+ {
+ error = HuffmanTree_fillInCoins(&coins, frequencies, tree->numcodes, sum);
+ }
+ }
+ }
+
+ if(!error)
+ {
+ /*keep the coins with lowest weight, so that they add up to the amount of symbols - 1*/
+ vector_resized(&coins, numpresent - 1, Coin_cleanup);
+
+ /*calculate the lenghts of each symbol, as the amount of times a coin of each symbol is used*/
+ for(i = 0; i < coins.size; i++)
+ {
+ Coin* coin = (Coin*)vector_get(&coins, i);
+ for(j = 0; j < coin->symbols.size; j++) tree->lengths.data[coin->symbols.data[j]]++;
+ }
+
+ error = HuffmanTree_makeFromLengths2(tree);
+ }
+
+ vector_cleanupd(&coins, Coin_cleanup);
+ vector_cleanupd(&prev_row, Coin_cleanup);
+
+ return error;
+}
+
+static unsigned HuffmanTree_getCode(const HuffmanTree* tree, unsigned index) { return tree->tree1d.data[index]; }
+static unsigned HuffmanTree_getLength(const HuffmanTree* tree, unsigned index) { return tree->lengths.data[index]; }
+#endif /*LODEPNG_COMPILE_ENCODER*/
+
+/*get the tree of a deflated block with fixed tree, as specified in the deflate specification*/
+static unsigned generateFixedTree(HuffmanTree* tree)
+{
+ unsigned i, error = 0;
+ uivector bitlen;
+ uivector_init(&bitlen);
+ if(!uivector_resize(&bitlen, NUM_DEFLATE_CODE_SYMBOLS)) error = 9909;
+
+ if(!error)
+ {
+ /*288 possible codes: 0-255=literals, 256=endcode, 257-285=lengthcodes, 286-287=unused*/
+ for(i = 0; i <= 143; i++) bitlen.data[i] = 8;
+ for(i = 144; i <= 255; i++) bitlen.data[i] = 9;
+ for(i = 256; i <= 279; i++) bitlen.data[i] = 7;
+ for(i = 280; i <= 287; i++) bitlen.data[i] = 8;
+
+ error = HuffmanTree_makeFromLengths(tree, bitlen.data, NUM_DEFLATE_CODE_SYMBOLS, 15);
+ }
+
+ uivector_cleanup(&bitlen);
+ return error;
+}
+
+static unsigned generateDistanceTree(HuffmanTree* tree)
+{
+ unsigned i, error = 0;
+ uivector bitlen;
+ uivector_init(&bitlen);
+ if(!uivector_resize(&bitlen, NUM_DISTANCE_SYMBOLS)) error = 9910;
+
+ /*there are 32 distance codes, but 30-31 are unused*/
+ if(!error)
+ {
+ for(i = 0; i < NUM_DISTANCE_SYMBOLS; i++) bitlen.data[i] = 5;
+ error = HuffmanTree_makeFromLengths(tree, bitlen.data, NUM_DISTANCE_SYMBOLS, 15);
+ }
+ uivector_cleanup(&bitlen);
+ return error;
+}
+
+#ifdef LODEPNG_COMPILE_DECODER
+
+/*Decodes a symbol from the tree
+if decoded is true, then result contains the symbol, otherwise it contains something unspecified (because the symbol isn't fully decoded yet)
+bit is the bit that was just read from the stream
+you have to decode a full symbol (let the decode function return true) before you can try to decode another one, otherwise the state isn't reset
+return value is error.*/
+static unsigned HuffmanTree_decode(const HuffmanTree* tree, unsigned* decoded, unsigned* result, unsigned* treepos, unsigned char bit)
+{
+ if((*treepos) >= tree->numcodes) return 11; /*error: it appeared outside the codetree*/
+
+ (*result) = tree->tree2d.data[2 * (*treepos) + bit];
+ (*decoded) = ((*result) < tree->numcodes);
+
+ if(*decoded) (*treepos) = 0;
+ else (*treepos) = (*result) - tree->numcodes;
+
+ return 0;
+}
+
+static unsigned huffmanDecodeSymbol(unsigned int* error, const unsigned char* in, size_t* bp, const HuffmanTree* codetree, size_t inlength)
+{
+ unsigned treepos = 0, decoded, ct;
+ for(;;)
+ {
+ unsigned char bit;
+ if(((*bp) & 0x07) == 0 && ((*bp) >> 3) > inlength) { *error = 10; return 0; } /*error: end of input memory reached without endcode*/
+ bit = readBitFromStream(bp, in);
+ *error = HuffmanTree_decode(codetree, &decoded, &ct, &treepos, bit);
+ if(*error) return 0; /*stop, an error happened*/
+ if(decoded) return ct;
+ }
+}
+
+#endif /*LODEPNG_COMPILE_DECODER*/
+
+#ifdef LODEPNG_COMPILE_DECODER
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* / Inflator / */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+/*get the tree of a deflated block with fixed tree, as specified in the deflate specification*/
+static void getTreeInflateFixed(HuffmanTree* tree, HuffmanTree* treeD)
+{
+ /*error checking not done, this is fixed stuff, it works, it doesn't depend on the image*/
+ generateFixedTree(tree);
+ generateDistanceTree(treeD);
+}
+
+/*get the tree of a deflated block with dynamic tree, the tree itself is also Huffman compressed with a known tree*/
+static unsigned getTreeInflateDynamic(HuffmanTree* codetree, HuffmanTree* codetreeD, HuffmanTree* codelengthcodetree,
+ const unsigned char* in, size_t* bp, size_t inlength)
+{
+ /*make sure that length values that aren't filled in will be 0, or a wrong tree will be generated*/
+ /*C-code note: use no "return" between ctor and dtor of an uivector!*/
+ unsigned error = 0;
+ unsigned n, HLIT, HDIST, HCLEN, i;
+ uivector bitlen;
+ uivector bitlenD;
+ uivector codelengthcode;
+
+ if((*bp) >> 3 >= inlength - 2) { return 49; } /*the bit pointer is or will go past the memory*/
+
+ HLIT = readBitsFromStream(bp, in, 5) + 257; /*number of literal/length codes + 257. Unlike the spec, the value 257 is added to it here already*/
+ HDIST = readBitsFromStream(bp, in, 5) + 1; /*number of distance codes. Unlike the spec, the value 1 is added to it here already*/
+ HCLEN = readBitsFromStream(bp, in, 4) + 4; /*number of code length codes. Unlike the spec, the value 4 is added to it here already*/
+
+ /*read the code length codes out of 3 * (amount of code length codes) bits*/
+ uivector_init(&codelengthcode);
+ if(!uivector_resize(&codelengthcode, NUM_CODE_LENGTH_CODES)) error = 9911;
+
+ if(!error)
+ {
+ for(i = 0; i < NUM_CODE_LENGTH_CODES; i++)
+ {
+ if(i < HCLEN) codelengthcode.data[CLCL[i]] = readBitsFromStream(bp, in, 3);
+ else codelengthcode.data[CLCL[i]] = 0; /*if not, it must stay 0*/
+ }
+
+ error = HuffmanTree_makeFromLengths(codelengthcodetree, codelengthcode.data, codelengthcode.size, 7);
+ }
+
+ uivector_cleanup(&codelengthcode);
+ if(error) return error;
+
+ /*now we can use this tree to read the lengths for the tree that this function will return*/
+ uivector_init(&bitlen);
+ uivector_resizev(&bitlen, NUM_DEFLATE_CODE_SYMBOLS, 0);
+ uivector_init(&bitlenD);
+ uivector_resizev(&bitlenD, NUM_DISTANCE_SYMBOLS, 0);
+ i = 0;
+ if(!bitlen.data || !bitlenD.data) error = 9912;
+ else while(i < HLIT + HDIST) /*i is the current symbol we're reading in the part that contains the code lengths of lit/len codes and dist codes*/
+ {
+ unsigned code = huffmanDecodeSymbol(&error, in, bp, codelengthcodetree, inlength);
+ if(error) break;
+
+ if(code <= 15) /*a length code*/
+ {
+ if(i < HLIT) bitlen.data[i] = code;
+ else bitlenD.data[i - HLIT] = code;
+ i++;
+ }
+ else if(code == 16) /*repeat previous*/
+ {
+ unsigned replength = 3; /*read in the 2 bits that indicate repeat length (3-6)*/
+ unsigned value; /*set value to the previous code*/
+
+ if((*bp) >> 3 >= inlength) { error = 50; break; } /*error, bit pointer jumps past memory*/
+
+ replength += readBitsFromStream(bp, in, 2);
+
+ if((i - 1) < HLIT) value = bitlen.data[i - 1];
+ else value = bitlenD.data[i - HLIT - 1];
+ /*repeat this value in the next lengths*/
+ for(n = 0; n < replength; n++)
+ {
+ if(i >= HLIT + HDIST) { error = 13; break; } /*error: i is larger than the amount of codes*/
+ if(i < HLIT) bitlen.data[i] = value;
+ else bitlenD.data[i - HLIT] = value;
+ i++;
+ }
+ }
+ else if(code == 17) /*repeat "0" 3-10 times*/
+ {
+ unsigned replength = 3; /*read in the bits that indicate repeat length*/
+ if((*bp) >> 3 >= inlength) { error = 50; break; } /*error, bit pointer jumps past memory*/
+
+ replength += readBitsFromStream(bp, in, 3);
+
+ /*repeat this value in the next lengths*/
+ for(n = 0; n < replength; n++)
+ {
+ if(i >= HLIT + HDIST) { error = 14; break; } /*error: i is larger than the amount of codes*/
+ if(i < HLIT) bitlen.data[i] = 0;
+ else bitlenD.data[i - HLIT] = 0;
+ i++;
+ }
+ }
+ else if(code == 18) /*repeat "0" 11-138 times*/
+ {
+ unsigned replength = 11; /*read in the bits that indicate repeat length*/
+ if((*bp) >> 3 >= inlength) { error = 50; break; } /*error, bit pointer jumps past memory*/
+ replength += readBitsFromStream(bp, in, 7);
+
+ /*repeat this value in the next lengths*/
+ for(n = 0; n < replength; n++)
+ {
+ if(i >= HLIT + HDIST) { error = 15; break; } /*error: i is larger than the amount of codes*/
+ if(i < HLIT) bitlen.data[i] = 0;
+ else bitlenD.data[i - HLIT] = 0;
+ i++;
+ }
+ }
+ else { error = 16; break; } /*error: somehow an unexisting code appeared. This can never happen.*/
+ }
+
+ if(!error && bitlen.data[256] == 0) { error = 64; } /*the length of the end code 256 must be larger than 0*/
+
+ /*now we've finally got HLIT and HDIST, so generate the code trees, and the function is done*/
+ if(!error) error = HuffmanTree_makeFromLengths(codetree, &bitlen.data[0], bitlen.size, 15);
+ if(!error) error = HuffmanTree_makeFromLengths(codetreeD, &bitlenD.data[0], bitlenD.size, 15);
+
+ uivector_cleanup(&bitlen);
+ uivector_cleanup(&bitlenD);
+
+ return error;
+}
+
+/*inflate a block with dynamic of fixed Huffman tree*/
+static unsigned inflateHuffmanBlock(ucvector* out, const unsigned char* in, size_t* bp, size_t* pos, size_t inlength, unsigned btype)
+{
+ unsigned endreached = 0, error = 0;
+ HuffmanTree codetree; /*287, the code tree for Huffman codes*/
+ HuffmanTree codetreeD; /*31, the code tree for distance codes*/
+
+ HuffmanTree_init(&codetree);
+ HuffmanTree_init(&codetreeD);
+
+ if(btype == 1) getTreeInflateFixed(&codetree, &codetreeD);
+ else if(btype == 2)
+ {
+ HuffmanTree codelengthcodetree; /*18, the code tree for code length codes*/
+ HuffmanTree_init(&codelengthcodetree);
+ error = getTreeInflateDynamic(&codetree, &codetreeD, &codelengthcodetree, in, bp, inlength);
+ HuffmanTree_cleanup(&codelengthcodetree);
+ }
+
+ while(!endreached && !error)
+ {
+ unsigned code = huffmanDecodeSymbol(&error, in, bp, &codetree, inlength);
+ if(error) break; /*some error happened in the above function*/
+ if(code == 256) endreached = 1; /*end code*/
+ else if(code <= 255) /*literal symbol*/
+ {
+ if((*pos) >= out->size) ucvector_resize(out, ((*pos) + 1) * 2); /*reserve more room at once*/
+ if((*pos) >= out->size) { error = 9913; break; } /*not enough memory*/
+ out->data[(*pos)] = (unsigned char)(code);
+ (*pos)++;
+ }
+ else if(code >= FIRST_LENGTH_CODE_INDEX && code <= LAST_LENGTH_CODE_INDEX) /*length code*/
+ {
+ /*part 1: get length base*/
+ size_t length = LENGTHBASE[code - FIRST_LENGTH_CODE_INDEX];
+ unsigned codeD, distance, numextrabitsD;
+ size_t start, forward, backward, numextrabits;
+
+ /*part 2: get extra bits and add the value of that to length*/
+ numextrabits = LENGTHEXTRA[code - FIRST_LENGTH_CODE_INDEX];
+ if(((*bp) >> 3) >= inlength) { error = 51; break; } /*error, bit pointer will jump past memory*/
+ length += readBitsFromStream(bp, in, numextrabits);
+
+ /*part 3: get distance code*/
+ codeD = huffmanDecodeSymbol(&error, in, bp, &codetreeD, inlength);
+ if(error) break;
+ if(codeD > 29) { error = 18; break; } /*error: invalid distance code (30-31 are never used)*/
+ distance = DISTANCEBASE[codeD];
+
+ /*part 4: get extra bits from distance*/
+ numextrabitsD = DISTANCEEXTRA[codeD];
+ if(((*bp) >> 3) >= inlength) { error = 51; break; } /*error, bit pointer will jump past memory*/
+ distance += readBitsFromStream(bp, in, numextrabitsD);
+
+ /*part 5: fill in all the out[n] values based on the length and dist*/
+ start = (*pos);
+ backward = start - distance;
+ if((*pos) + length >= out->size) ucvector_resize(out, ((*pos) + length) * 2); /*reserve more room at once*/
+ if((*pos) + length >= out->size) { error = 9914; break; } /*not enough memory*/
+
+ for(forward = 0; forward < length; forward++)
+ {
+ out->data[(*pos)] = out->data[backward];
+ (*pos)++;
+ backward++;
+ if(backward >= start) backward = start - distance;
+ }
+ }
+ }
+
+ HuffmanTree_cleanup(&codetree);
+ HuffmanTree_cleanup(&codetreeD);
+
+ return error;
+}
+
+static unsigned inflateNoCompression(ucvector* out, const unsigned char* in, size_t* bp, size_t* pos, size_t inlength)
+{
+ /*go to first boundary of byte*/
+ size_t p;
+ unsigned LEN, NLEN, n, error = 0;
+ while(((*bp) & 0x7) != 0) (*bp)++;
+ p = (*bp) / 8; /*byte position*/
+
+ /*read LEN (2 bytes) and NLEN (2 bytes)*/
+ if(p >= inlength - 4) return 52; /*error, bit pointer will jump past memory*/
+ LEN = in[p] + 256 * in[p + 1]; p += 2;
+ NLEN = in[p] + 256 * in[p + 1]; p += 2;
+
+ /*check if 16-bit NLEN is really the one's complement of LEN*/
+ if(LEN + NLEN != 65535) return 21; /*error: NLEN is not one's complement of LEN*/
+
+ if((*pos) + LEN >= out->size) { if(!ucvector_resize(out, (*pos) + LEN)) return 9915; }
+
+ /*read the literal data: LEN bytes are now stored in the out buffer*/
+ if(p + LEN > inlength) return 23; /*error: reading outside of in buffer*/
+ for(n = 0; n < LEN; n++) out->data[(*pos)++] = in[p++];
+
+ (*bp) = p * 8;
+
+ return error;
+}
+
+/*inflate the deflated data (cfr. deflate spec); return value is the error*/
+unsigned LodeFlate_inflate(ucvector* out, const unsigned char* in, size_t insize, size_t inpos)
+{
+ size_t bp = 0; /*bit pointer in the "in" data, current byte is bp >> 3, current bit is bp & 0x7 (from lsb to msb of the byte)*/
+ unsigned BFINAL = 0;
+ size_t pos = 0; /*byte position in the out buffer*/
+
+ unsigned error = 0;
+
+ while(!BFINAL)
+ {
+ unsigned BTYPE;
+ if((bp >> 3) >= insize) return 52; /*error, bit pointer will jump past memory*/
+ BFINAL = readBitFromStream(&bp, &in[inpos]);
+ BTYPE = 1 * readBitFromStream(&bp, &in[inpos]); BTYPE += 2 * readBitFromStream(&bp, &in[inpos]);
+
+ if(BTYPE == 3) return 20; /*error: invalid BTYPE*/
+ else if(BTYPE == 0) error = inflateNoCompression(out, &in[inpos], &bp, &pos, insize); /*no compression*/
+ else error = inflateHuffmanBlock(out, &in[inpos], &bp, &pos, insize, BTYPE); /*compression, BTYPE 01 or 10*/
+ if(error) return error;
+ }
+
+ if(!ucvector_resize(out, pos)) error = 9916; /*Only now we know the true size of out, resize it to that*/
+
+ return error;
+}
+
+#endif /*LODEPNG_COMPILE_DECODER*/
+
+#ifdef LODEPNG_COMPILE_ENCODER
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* / Deflator / */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+static const size_t MAX_SUPPORTED_DEFLATE_LENGTH = 258;
+
+/*bitlen is the size in bits of the code*/
+static void addHuffmanSymbol(size_t* bp, ucvector* compressed, unsigned code, unsigned bitlen)
+{
+ addBitsToStreamReversed(bp, compressed, code, bitlen);
+}
+
+/*search the index in the array, that has the largest value smaller than or equal to the given value, given array must be sorted (if no value is smaller, it returns the size of the given array)*/
+static size_t searchCodeIndex(const unsigned* array, size_t array_size, size_t value)
+{
+ /*linear search implementation*/
+ /*for(size_t i = 1; i < array_size; i++) if(array[i] > value) return i - 1;
+ return array_size - 1;*/
+
+ /*binary search implementation (not that much faster) (precondition: array_size > 0)*/
+ size_t left = 1;
+ size_t right = array_size - 1;
+ while(left <= right)
+ {
+ size_t mid = (left + right) / 2;
+ if(array[mid] <= value) left = mid + 1; /*the value to find is more to the right*/
+ else if(array[mid - 1] > value) right = mid - 1; /*the value to find is more to the left*/
+ else return mid - 1;
+ }
+ return array_size - 1;
+}
+
+static void addLengthDistance(uivector* values, size_t length, size_t distance)
+{
+ /*values in encoded vector are those used by deflate:
+ 0-255: literal bytes
+ 256: end
+ 257-285: length/distance pair (length code, followed by extra length bits, distance code, extra distance bits)
+ 286-287: invalid*/
+
+ unsigned length_code = (unsigned)searchCodeIndex(LENGTHBASE, 29, length);
+ unsigned extra_length = (unsigned)(length - LENGTHBASE[length_code]);
+ unsigned dist_code = (unsigned)searchCodeIndex(DISTANCEBASE, 30, distance);
+ unsigned extra_distance = (unsigned)(distance - DISTANCEBASE[dist_code]);
+
+ uivector_push_back(values, length_code + FIRST_LENGTH_CODE_INDEX);
+ uivector_push_back(values, extra_length);
+ uivector_push_back(values, dist_code);
+ uivector_push_back(values, extra_distance);
+}
+
+#if 0
+/*the "brute force" version of the encodeLZ7 algorithm, not used anymore, kept here for reference*/
+static void encodeLZ77_brute(uivector* out, const unsigned char* in, size_t size, unsigned windowSize)
+{
+ size_t pos;
+ /*using pointer instead of vector for input makes it faster when NOT using optimization when compiling; no influence if optimization is used*/
+ for(pos = 0; pos < size; pos++)
+ {
+ size_t length = 0, offset = 0; /*the length and offset found for the current position*/
+ size_t max_offset = pos < windowSize ? pos : windowSize; /*how far back to test*/
+ size_t current_offset;
+
+ /**search for the longest string**/
+ for(current_offset = 1; current_offset < max_offset; current_offset++) /*search backwards through all possible distances (=offsets)*/
+ {
+ size_t backpos = pos - current_offset;
+ if(in[backpos] == in[pos])
+ {
+ /*test the next characters*/
+ size_t current_length = 1;
+ size_t backtest = backpos + 1;
+ size_t foretest = pos + 1;
+ while(foretest < size && in[backtest] == in[foretest] && current_length < MAX_SUPPORTED_DEFLATE_LENGTH) /*maximum supporte length by deflate is max length*/
+ {
+ if(backpos >= pos) backpos -= current_offset; /*continue as if we work on the decoded bytes after pos by jumping back before pos*/
+ current_length++;
+ backtest++;
+ foretest++;
+ }
+ if(current_length > length)
+ {
+ length = current_length; /*the longest length*/
+ offset = current_offset; /*the offset that is related to this longest length*/
+ if(current_length == MAX_SUPPORTED_DEFLATE_LENGTH) break; /*you can jump out of this for loop once a length of max length is found (gives significant speed gain)*/
+ }
+ }
+ }
+
+ /**encode it as length/distance pair or literal value**/
+ if(length < 3) /*only lengths of 3 or higher are supported as length/distance pair*/
+ {
+ uivector_push_back(out, in[pos]);
+ }
+ else
+ {
+ addLengthDistance(out, length, offset);
+ pos += (length - 1);
+ }
+ } /*end of the loop through each character of input*/
+}
+#endif
+
+static const unsigned HASH_NUM_VALUES = 65536;
+static const unsigned HASH_NUM_CHARACTERS = 6;
+static const unsigned HASH_SHIFT = 2;
+/*
+Good and fast values: HASH_NUM_VALUES=65536, HASH_NUM_CHARACTERS=6, HASH_SHIFT=2
+making HASH_NUM_CHARACTERS larger (like 8), makes the file size larger but is a bit faster
+making HASH_NUM_CHARACTERS smaller (like 3), makes the file size smaller but is slower
+*/
+
+static unsigned getHash(const unsigned char* data, size_t size, size_t pos)
+{
+ unsigned result = 0;
+ size_t amount, i;
+ if(pos >= size) return 0;
+ amount = HASH_NUM_CHARACTERS; if(pos + amount >= size) amount = size - pos;
+ for(i = 0; i < amount; i++) result ^= (data[pos + i] << (i * HASH_SHIFT));
+ return result % HASH_NUM_VALUES;
+}
+
+/*LZ77-encode the data using a hash table technique to let it encode faster. Return value is error code*/
+static unsigned encodeLZ77(uivector* out, const unsigned char* in, size_t size, unsigned windowSize)
+{
+ /**generate hash table**/
+ png_vector table; /*HASH_NUM_VALUES uivectors; this represents what would be an std::vector<std::vector<unsigned> > in C++*/
+ uivector tablepos1, tablepos2;
+ unsigned pos, i, error = 0;
+
+ vector_init(&table, sizeof(uivector));
+ if(!vector_resize(&table, HASH_NUM_VALUES)) return 9917;
+ for(i = 0; i < HASH_NUM_VALUES; i++)
+ {
+ uivector* v = (uivector*)vector_get(&table, i);
+ uivector_init(v);
+ }
+
+ /*remember start and end positions in the tables to searching in*/
+ uivector_init(&tablepos1);
+ uivector_init(&tablepos2);
+ if(!uivector_resizev(&tablepos1, HASH_NUM_VALUES, 0)) error = 9918;
+ if(!uivector_resizev(&tablepos2, HASH_NUM_VALUES, 0)) error = 9919;
+
+ if(!error)
+ {
+ for(pos = 0; pos < size; pos++)
+ {
+ unsigned length = 0, offset = 0; /*the length and offset found for the current position*/
+ unsigned max_offset = pos < windowSize ? pos : windowSize; /*how far back to test*/
+ unsigned tablepos;
+
+ /*/search for the longest string*/
+ /*first find out where in the table to start (the first value that is in the range from "pos - max_offset" to "pos")*/
+ unsigned hash = getHash(in, size, pos);
+ if(!uivector_push_back((uivector*)vector_get(&table, hash), pos)) { error = 9920; break; }
+
+ while(((uivector*)vector_get(&table, hash))->data[tablepos1.data[hash]] < pos - max_offset) tablepos1.data[hash]++; /*it now points to the first value in the table for which the index is larger than or equal to pos - max_offset*/
+ while(((uivector*)vector_get(&table, hash))->data[tablepos2.data[hash]] < pos) tablepos2.data[hash]++; /*it now points to the first value in the table for which the index is larger than or equal to pos*/
+
+ for(tablepos = tablepos2.data[hash] - 1; tablepos >= tablepos1.data[hash] && tablepos < tablepos2.data[hash]; tablepos--)
+ {
+ unsigned backpos = ((uivector*)vector_get(&table, hash))->data[tablepos];
+ unsigned current_offset = pos - backpos;
+
+ /*test the next characters*/
+ unsigned current_length = 0;
+ unsigned backtest = backpos;
+ unsigned foretest = pos;
+ while(foretest < size && in[backtest] == in[foretest] && current_length < MAX_SUPPORTED_DEFLATE_LENGTH) /*maximum supporte length by deflate is max length*/
+ {
+ if(backpos >= pos) backpos -= current_offset; /*continue as if we work on the decoded bytes after pos by jumping back before pos*/
+ current_length++;
+ backtest++;
+ foretest++;
+ }
+ if(current_length > length)
+ {
+ length = current_length; /*the longest length*/
+ offset = current_offset; /*the offset that is related to this longest length*/
+ if(current_length == MAX_SUPPORTED_DEFLATE_LENGTH) break; /*you can jump out of this for loop once a length of max length is found (gives significant speed gain)*/
+ }
+ }
+
+ /**encode it as length/distance pair or literal value**/
+ if(length < 3) /*only lengths of 3 or higher are supported as length/distance pair*/
+ {
+ if(!uivector_push_back(out, in[pos])) { error = 9921; break; }
+ }
+ else
+ {
+ unsigned j;
+ addLengthDistance(out, length, offset);
+ for(j = 0; j < length - 1; j++)
+ {
+ pos++;
+ if(!uivector_push_back((uivector*)vector_get(&table, getHash(in, size, pos)), pos)) { error = 9922; break; }
+ }
+ }
+ } /*end of the loop through each character of input*/
+ } /*end of "if(!error)"*/
+
+ /*cleanup*/
+ for(i = 0; i < table.size; i++)
+ {
+ uivector* v = (uivector*)vector_get(&table, i);
+ uivector_cleanup(v);
+ }
+ vector_cleanup(&table);
+ uivector_cleanup(&tablepos1);
+ uivector_cleanup(&tablepos2);
+ return error;
+}
+
+/* /////////////////////////////////////////////////////////////////////////// */
+
+static unsigned deflateNoCompression(ucvector* out, const unsigned char* data, size_t datasize)
+{
+ /*non compressed deflate block data: 1 bit BFINAL,2 bits BTYPE,(5 bits): it jumps to start of next byte, 2 bytes LEN, 2 bytes NLEN, LEN bytes literal DATA*/
+
+ size_t i, j, numdeflateblocks = datasize / 65536 + 1;
+ unsigned datapos = 0;
+ for(i = 0; i < numdeflateblocks; i++)
+ {
+ unsigned BFINAL, BTYPE, LEN, NLEN;
+ unsigned char firstbyte;
+
+ BFINAL = (i == numdeflateblocks - 1);
+ BTYPE = 0;
+
+ firstbyte = (unsigned char)(BFINAL + ((BTYPE & 1) << 1) + ((BTYPE & 2) << 1));
+ ucvector_push_back(out, firstbyte);
+
+ LEN = 65535;
+ if(datasize - datapos < 65535) LEN = (unsigned)datasize - datapos;
+ NLEN = 65535 - LEN;
+
+ ucvector_push_back(out, (unsigned char)(LEN % 256));
+ ucvector_push_back(out, (unsigned char)(LEN / 256));
+ ucvector_push_back(out, (unsigned char)(NLEN % 256));
+ ucvector_push_back(out, (unsigned char)(NLEN / 256));
+
+ /*Decompressed data*/
+ for(j = 0; j < 65535 && datapos < datasize; j++)
+ {
+ ucvector_push_back(out, data[datapos++]);
+ }
+ }
+
+ return 0;
+}
+
+/*write the encoded data, using lit/len as well as distance codes*/
+static void writeLZ77data(size_t* bp, ucvector* out, const uivector* lz77_encoded, const HuffmanTree* codes, const HuffmanTree* codesD)
+{
+ size_t i = 0;
+ for(i = 0; i < lz77_encoded->size; i++)
+ {
+ unsigned val = lz77_encoded->data[i];
+ addHuffmanSymbol(bp, out, HuffmanTree_getCode(codes, val), HuffmanTree_getLength(codes, val));
+ if(val > 256) /*for a length code, 3 more things have to be added*/
+ {
+ unsigned length_index = val - FIRST_LENGTH_CODE_INDEX;
+ unsigned n_length_extra_bits = LENGTHEXTRA[length_index];
+ unsigned length_extra_bits = lz77_encoded->data[++i];
+
+ unsigned distance_code = lz77_encoded->data[++i];
+
+ unsigned distance_index = distance_code;
+ unsigned n_distance_extra_bits = DISTANCEEXTRA[distance_index];
+ unsigned distance_extra_bits = lz77_encoded->data[++i];
+
+ addBitsToStream(bp, out, length_extra_bits, n_length_extra_bits);
+ addHuffmanSymbol(bp, out, HuffmanTree_getCode(codesD, distance_code), HuffmanTree_getLength(codesD, distance_code));
+ addBitsToStream(bp, out, distance_extra_bits, n_distance_extra_bits);
+ }
+ }
+}
+
+static unsigned deflateDynamic(ucvector* out, const unsigned char* data, size_t datasize, const LodeZlib_DeflateSettings* settings)
+{
+ /*
+ after the BFINAL and BTYPE, the dynamic block consists out of the following:
+ - 5 bits HLIT, 5 bits HDIST, 4 bits HCLEN
+ - (HCLEN+4)*3 bits code lengths of code length alphabet
+ - HLIT + 257 code lenghts of lit/length alphabet (encoded using the code length alphabet, + possible repetition codes 16, 17, 18)
+ - HDIST + 1 code lengths of distance alphabet (encoded using the code length alphabet, + possible repetition codes 16, 17, 18)
+ - compressed data
+ - 256 (end code)
+ */
+
+ unsigned error = 0;
+
+ uivector lz77_encoded;
+ HuffmanTree codes; /*tree for literal values and length codes*/
+ HuffmanTree codesD; /*tree for distance codes*/
+ HuffmanTree codelengthcodes;
+ uivector frequencies;
+ uivector frequenciesD;
+ uivector amounts; /*the amounts in the "normal" order*/
+ uivector lldl;
+ uivector lldll; /*lit/len & dist code lenghts*/
+ uivector clcls;
+
+ unsigned BFINAL = 1; /*make only one block... the first and final one*/
+ size_t numcodes, numcodesD, i, bp = 0; /*the bit pointer*/
+ unsigned HLIT, HDIST, HCLEN;
+
+ uivector_init(&lz77_encoded);
+ HuffmanTree_init(&codes);
+ HuffmanTree_init(&codesD);
+ HuffmanTree_init(&codelengthcodes);
+ uivector_init(&frequencies);
+ uivector_init(&frequenciesD);
+ uivector_init(&amounts);
+ uivector_init(&lldl);
+ uivector_init(&lldll);
+ uivector_init(&clcls);
+
+ while(!error) /*the goto-avoiding while construct: break out to go to the cleanup phase, a break at the end makes sure the while is never repeated*/
+ {
+ if(settings->useLZ77)
+ {
+ error = encodeLZ77(&lz77_encoded, data, datasize, settings->windowSize); /*LZ77 encoded*/
+ if(error) break;
+ }
+ else
+ {
+ if(!uivector_resize(&lz77_encoded, datasize)) { error = 9923; break; }
+ for(i = 0; i < datasize; i++) lz77_encoded.data[i] = data[i]; /*no LZ77, but still will be Huffman compressed*/
+ }
+
+ if(!uivector_resizev(&frequencies, 286, 0)) { error = 9924; break; }
+ if(!uivector_resizev(&frequenciesD, 30, 0)) { error = 9925; break; }
+ for(i = 0; i < lz77_encoded.size; i++)
+ {
+ unsigned symbol = lz77_encoded.data[i];
+ frequencies.data[symbol]++;
+ if(symbol > 256)
+ {
+ unsigned dist = lz77_encoded.data[i + 2];
+ frequenciesD.data[dist]++;
+ i += 3;
+ }
+ }
+ frequencies.data[256] = 1; /*there will be exactly 1 end code, at the end of the block*/
+
+ error = HuffmanTree_makeFromFrequencies(&codes, frequencies.data, frequencies.size, 15);
+ if(error) break;
+ error = HuffmanTree_makeFromFrequencies(&codesD, frequenciesD.data, frequenciesD.size, 15);
+ if(error) break;
+
+ addBitToStream(&bp, out, BFINAL);
+ addBitToStream(&bp, out, 0); /*first bit of BTYPE "dynamic"*/
+ addBitToStream(&bp, out, 1); /*second bit of BTYPE "dynamic"*/
+
+ numcodes = codes.numcodes; if(numcodes > 286) numcodes = 286;
+ numcodesD = codesD.numcodes; if(numcodesD > 30) numcodesD = 30;
+ for(i = 0; i < numcodes; i++) uivector_push_back(&lldll, HuffmanTree_getLength(&codes, (unsigned)i));
+ for(i = 0; i < numcodesD; i++) uivector_push_back(&lldll, HuffmanTree_getLength(&codesD, (unsigned)i));
+
+ /*make lldl smaller by using repeat codes 16 (copy length 3-6 times), 17 (3-10 zeroes), 18 (11-138 zeroes)*/
+ for(i = 0; i < (unsigned)lldll.size; i++)
+ {
+ unsigned j = 0;
+ while(i + j + 1 < (unsigned)lldll.size && lldll.data[i + j + 1] == lldll.data[i]) j++;
+
+ if(lldll.data[i] == 0 && j >= 2)
+ {
+ j++; /*include the first zero*/
+ if(j <= 10) { uivector_push_back(&lldl, 17); uivector_push_back(&lldl, j - 3); }
+ else
+ {
+ if(j > 138) j = 138;
+ uivector_push_back(&lldl, 18); uivector_push_back(&lldl, j - 11);
+ }
+ i += (j - 1);
+ }
+ else if(j >= 3)
+ {
+ size_t k;
+ unsigned num = j / 6, rest = j % 6;
+ uivector_push_back(&lldl, lldll.data[i]);
+ for(k = 0; k < num; k++) { uivector_push_back(&lldl, 16); uivector_push_back(&lldl, 6 - 3); }
+ if(rest >= 3) { uivector_push_back(&lldl, 16); uivector_push_back(&lldl, rest - 3); }
+ else j -= rest;
+ i += j;
+ }
+ else uivector_push_back(&lldl, lldll.data[i]);
+ }
+
+ /*generate huffmantree for the length codes of lit/len and dist codes*/
+ if(!uivector_resizev(&amounts, 19, 0)) { error = 9926; break; } /*16 possible lengths (0-15) and 3 repeat codes (16, 17 and 18)*/
+ for(i = 0; i < lldl.size; i++)
+ {
+ amounts.data[lldl.data[i]]++;
+ if(lldl.data[i] >= 16) i++; /*after a repeat code come the bits that specify the amount, those don't need to be in the amounts calculation*/
+ }
+
+ error = HuffmanTree_makeFromFrequencies(&codelengthcodes, amounts.data, amounts.size, 7);
+ if(error) break;
+
+ if(!uivector_resize(&clcls, 19)) { error = 9927; break; }
+ for(i = 0; i < 19; i++) clcls.data[i] = HuffmanTree_getLength(&codelengthcodes, CLCL[i]); /*lenghts of code length tree is in the order as specified by deflate*/
+ while(clcls.data[clcls.size - 1] == 0 && clcls.size > 4)
+ {
+ if(!uivector_resize(&clcls, clcls.size - 1)) { error = 9928; break; } /*remove zeros at the end, but minimum size must be 4*/
+ }
+ if(error) break;
+
+ /*write the HLIT, HDIST and HCLEN values*/
+ HLIT = (unsigned)(numcodes - 257);
+ HDIST = (unsigned)(numcodesD - 1);
+ HCLEN = (unsigned)clcls.size - 4;
+ addBitsToStream(&bp, out, HLIT, 5);
+ addBitsToStream(&bp, out, HDIST, 5);
+ addBitsToStream(&bp, out, HCLEN, 4);
+
+ /*write the code lenghts of the code length alphabet*/
+ for(i = 0; i < HCLEN + 4; i++) addBitsToStream(&bp, out, clcls.data[i], 3);
+
+ /*write the lenghts of the lit/len AND the dist alphabet*/
+ for(i = 0; i < lldl.size; i++)
+ {
+ addHuffmanSymbol(&bp, out, HuffmanTree_getCode(&codelengthcodes, lldl.data[i]), HuffmanTree_getLength(&codelengthcodes, lldl.data[i]));
+ /*extra bits of repeat codes*/
+ if(lldl.data[i] == 16) addBitsToStream(&bp, out, lldl.data[++i], 2);
+ else if(lldl.data[i] == 17) addBitsToStream(&bp, out, lldl.data[++i], 3);
+ else if(lldl.data[i] == 18) addBitsToStream(&bp, out, lldl.data[++i], 7);
+ }
+
+ /*write the compressed data symbols*/
+ writeLZ77data(&bp, out, &lz77_encoded, &codes, &codesD);
+ if(HuffmanTree_getLength(&codes, 256) == 0) { error = 64; break; } /*the length of the end code 256 must be larger than 0*/
+ addHuffmanSymbol(&bp, out, HuffmanTree_getCode(&codes, 256), HuffmanTree_getLength(&codes, 256)); /*end code*/
+
+ break; /*end of error-while*/
+ }
+
+ /*cleanup*/
+ uivector_cleanup(&lz77_encoded);
+ HuffmanTree_cleanup(&codes);
+ HuffmanTree_cleanup(&codesD);
+ HuffmanTree_cleanup(&codelengthcodes);
+ uivector_cleanup(&frequencies);
+ uivector_cleanup(&frequenciesD);
+ uivector_cleanup(&amounts);
+ uivector_cleanup(&lldl);
+ uivector_cleanup(&lldll);
+ uivector_cleanup(&clcls);
+
+ return error;
+}
+
+static unsigned deflateFixed(ucvector* out, const unsigned char* data, size_t datasize, const LodeZlib_DeflateSettings* settings)
+{
+ HuffmanTree codes; /*tree for literal values and length codes*/
+ HuffmanTree codesD; /*tree for distance codes*/
+
+ unsigned BFINAL = 1; /*make only one block... the first and final one*/
+ unsigned error = 0;
+ size_t i, bp = 0; /*the bit pointer*/
+
+ HuffmanTree_init(&codes);
+ HuffmanTree_init(&codesD);
+
+ generateFixedTree(&codes);
+ generateDistanceTree(&codesD);
+
+ addBitToStream(&bp, out, BFINAL);
+ addBitToStream(&bp, out, 1); /*first bit of BTYPE*/
+ addBitToStream(&bp, out, 0); /*second bit of BTYPE*/
+
+ if(settings->useLZ77) /*LZ77 encoded*/
+ {
+ uivector lz77_encoded;
+ uivector_init(&lz77_encoded);
+ error = encodeLZ77(&lz77_encoded, data, datasize, settings->windowSize);
+ if(!error) writeLZ77data(&bp, out, &lz77_encoded, &codes, &codesD);
+ uivector_cleanup(&lz77_encoded);
+ }
+ else /*no LZ77, but still will be Huffman compressed*/
+ {
+ for(i = 0; i < datasize; i++) addHuffmanSymbol(&bp, out, HuffmanTree_getCode(&codes, data[i]), HuffmanTree_getLength(&codes, data[i]));
+ }
+ if(!error) addHuffmanSymbol(&bp, out, HuffmanTree_getCode(&codes, 256), HuffmanTree_getLength(&codes, 256)); /*"end" code*/
+
+ /*cleanup*/
+ HuffmanTree_cleanup(&codes);
+ HuffmanTree_cleanup(&codesD);
+
+ return error;
+}
+
+unsigned LodeFlate_deflate(ucvector* out, const unsigned char* data, size_t datasize, const LodeZlib_DeflateSettings* settings)
+{
+ unsigned error = 0;
+ if(settings->btype == 0) error = deflateNoCompression(out, data, datasize);
+ else if(settings->btype == 1) error = deflateFixed(out, data, datasize, settings);
+ else if(settings->btype == 2) error = deflateDynamic(out, data, datasize, settings);
+ else error = 61;
+ return error;
+}
+
+#endif /*LODEPNG_COMPILE_DECODER*/
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* / Adler32 */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+static unsigned update_adler32(unsigned adler, const unsigned char* data, unsigned len)
+{
+ unsigned s1 = adler & 0xffff;
+ unsigned s2 = (adler >> 16) & 0xffff;
+
+ while(len > 0)
+ {
+ /*at least 5550 sums can be done before the sums overflow, saving us from a lot of module divisions*/
+ unsigned amount = len > 5550 ? 5550 : len;
+ len -= amount;
+ while(amount > 0)
+ {
+ s1 = (s1 + *data++);
+ s2 = (s2 + s1);
+ amount--;
+ }
+ s1 %= 65521;
+ s2 %= 65521;
+ }
+
+ return (s2 << 16) | s1;
+}
+
+/*Return the adler32 of the bytes data[0..len-1]*/
+static unsigned adler32(const unsigned char* data, unsigned len)
+{
+ return update_adler32(1L, data, len);
+}
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* / Reading and writing single bits and bytes from/to stream for Zlib / */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+#ifdef LODEPNG_COMPILE_ENCODER
+void LodeZlib_add32bitInt(ucvector* buffer, unsigned value)
+{
+ ucvector_push_back(buffer, (unsigned char)((value >> 24) & 0xff));
+ ucvector_push_back(buffer, (unsigned char)((value >> 16) & 0xff));
+ ucvector_push_back(buffer, (unsigned char)((value >> 8) & 0xff));
+ ucvector_push_back(buffer, (unsigned char)((value ) & 0xff));
+}
+#endif /*LODEPNG_COMPILE_ENCODER*/
+
+unsigned LodeZlib_read32bitInt(const unsigned char* buffer)
+{
+ return (buffer[0] << 24) | (buffer[1] << 16) | (buffer[2] << 8) | buffer[3];
+}
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* / Zlib / */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+#ifdef LODEPNG_COMPILE_DECODER
+
+unsigned LodeZlib_decompress(unsigned char** out, size_t* outsize, const unsigned char* in, size_t insize, const LodeZlib_DecompressSettings* settings)
+{
+ unsigned error = 0;
+ unsigned CM, CINFO, FDICT;
+ ucvector outv;
+
+ if(insize < 2) { error = 53; return error; } /*error, size of zlib data too small*/
+ /*read information from zlib header*/
+ if((in[0] * 256 + in[1]) % 31 != 0) { error = 24; return error; } /*error: 256 * in[0] + in[1] must be a multiple of 31, the FCHECK value is supposed to be made that way*/
+
+ CM = in[0] & 15;
+ CINFO = (in[0] >> 4) & 15;
+ /*FCHECK = in[1] & 31; //FCHECK is already tested above*/
+ FDICT = (in[1] >> 5) & 1;
+ /*FLEVEL = (in[1] >> 6) & 3; //not really important, all it does it to give a compiler warning about unused variable, we don't care what encoding setting the encoder used*/
+
+ if(CM != 8 || CINFO > 7) { error = 25; return error; } /*error: only compression method 8: inflate with sliding window of 32k is supported by the PNG spec*/
+ if(FDICT != 0) { error = 26; return error; } /*error: the specification of PNG says about the zlib stream: "The additional flags shall not specify a preset dictionary."*/
+
+ ucvector_init_buffer(&outv, *out, *outsize); /*ucvector-controlled version of the output buffer, for dynamic array*/
+ error = LodeFlate_inflate(&outv, in, insize, 2);
+ *out = outv.data;
+ *outsize = outv.size;
+ if(error) return error;
+
+ if(!settings->ignoreAdler32)
+ {
+ unsigned ADLER32 = LodeZlib_read32bitInt(&in[insize - 4]);
+ unsigned checksum = adler32(outv.data, (unsigned)outv.size);
+ if(checksum != ADLER32) { error = 58; return error; }
+ }
+
+ return error;
+}
+
+#endif /*LODEPNG_COMPILE_DECODER*/
+
+#ifdef LODEPNG_COMPILE_ENCODER
+
+unsigned LodeZlib_compress(unsigned char** out, size_t* outsize, const unsigned char* in, size_t insize, const LodeZlib_DeflateSettings* settings)
+{
+ /*initially, *out must be NULL and outsize 0, if you just give some random *out that's pointing to a non allocated buffer, this'll crash*/
+ ucvector deflatedata, outv;
+ size_t i;
+ unsigned error;
+
+ unsigned ADLER32;
+ /*zlib data: 1 byte CMF (CM+CINFO), 1 byte FLG, deflate data, 4 byte ADLER32 checksum of the Decompressed data*/
+ unsigned CMF = 120; /*0b01111000: CM 8, CINFO 7. With CINFO 7, any window size up to 32768 can be used.*/
+ unsigned FLEVEL = 0;
+ unsigned FDICT = 0;
+ unsigned CMFFLG = 256 * CMF + FDICT * 32 + FLEVEL * 64;
+ unsigned FCHECK = 31 - CMFFLG % 31;
+ CMFFLG += FCHECK;
+
+ ucvector_init_buffer(&outv, *out, *outsize); /*ucvector-controlled version of the output buffer, for dynamic array*/
+
+ ucvector_push_back(&outv, (unsigned char)(CMFFLG / 256));
+ ucvector_push_back(&outv, (unsigned char)(CMFFLG % 256));
+
+ ucvector_init(&deflatedata);
+ error = LodeFlate_deflate(&deflatedata, in, insize, settings);
+
+ if(!error)
+ {
+ ADLER32 = adler32(in, (unsigned)insize);
+ for(i = 0; i < deflatedata.size; i++) ucvector_push_back(&outv, deflatedata.data[i]);
+ ucvector_cleanup(&deflatedata);
+ LodeZlib_add32bitInt(&outv, ADLER32);
+ }
+
+ *out = outv.data;
+ *outsize = outv.size;
+
+ return error;
+}
+
+#endif /*LODEPNG_COMPILE_ENCODER*/
+
+#endif /*LODEPNG_COMPILE_ZLIB*/
+
+/* ////////////////////////////////////////////////////////////////////////// */
+
+#ifdef LODEPNG_COMPILE_ENCODER
+
+void LodeZlib_DeflateSettings_init(LodeZlib_DeflateSettings* settings)
+{
+ settings->btype = 2; /*compress with dynamic huffman tree (not in the mathematical sense, just not the predefined one)*/
+ settings->useLZ77 = 1;
+ settings->windowSize = 2048; /*this is a good tradeoff between speed and compression ratio*/
+}
+
+const LodeZlib_DeflateSettings LodeZlib_defaultDeflateSettings = {2, 1, 2048};
+
+#endif /*LODEPNG_COMPILE_ENCODER*/
+
+#ifdef LODEPNG_COMPILE_DECODER
+
+void LodeZlib_DecompressSettings_init(LodeZlib_DecompressSettings* settings)
+{
+ settings->ignoreAdler32 = 0;
+}
+
+const LodeZlib_DecompressSettings LodeZlib_defaultDecompressSettings = {0};
+
+#endif /*LODEPNG_COMPILE_DECODER*/
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* ////////////////////////////////////////////////////////////////////////// */
+/* ////////////////////////////////////////////////////////////////////////// */
+/* ////////////////////////////////////////////////////////////////////////// */
+/* ////////////////////////////////////////////////////////////////////////// */
+/* // End of Zlib related code, now comes the PNG related code that uses it// */
+/* ////////////////////////////////////////////////////////////////////////// */
+/* ////////////////////////////////////////////////////////////////////////// */
+/* ////////////////////////////////////////////////////////////////////////// */
+/* ////////////////////////////////////////////////////////////////////////// */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+#ifdef LODEPNG_COMPILE_PNG
+
+/*
+The two functions below (LodePNG_decompress and LodePNG_compress) directly call the
+LodeZlib_decompress and LodeZlib_compress functions. The only purpose of the functions
+below, is to provide the ability to let LodePNG use a different Zlib encoder by only
+changing the two functions below, instead of changing it inside the vareous places
+in the other LodePNG functions.
+
+*out must be NULL and *outsize must be 0 initially, and after the function is done,
+*out must point to the decompressed data, *outsize must be the size of it, and must
+be the size of the useful data in bytes, not the alloc size.
+*/
+
+#ifdef LODEPNG_COMPILE_DECODER
+static unsigned LodePNG_decompress(unsigned char** out, size_t* outsize, const unsigned char* in, size_t insize, const LodeZlib_DecompressSettings* settings)
+{
+ return LodeZlib_decompress(out, outsize, in, insize, settings);
+}
+#endif /*LODEPNG_COMPILE_DECODER*/
+#ifdef LODEPNG_COMPILE_ENCODER
+static unsigned LodePNG_compress(unsigned char** out, size_t* outsize, const unsigned char* in, size_t insize, const LodeZlib_DeflateSettings* settings)
+{
+ return LodeZlib_compress(out, outsize, in, insize, settings);
+}
+#endif /*LODEPNG_COMPILE_ENCODER*/
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* / CRC32 / */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+static unsigned Crc32_crc_table_computed = 0;
+static unsigned Crc32_crc_table[256];
+
+/*Make the table for a fast CRC.*/
+static void Crc32_make_crc_table(void)
+{
+ unsigned c, k, n;
+ for(n = 0; n < 256; n++)
+ {
+ c = n;
+ for(k = 0; k < 8; k++)
+ {
+ if(c & 1) c = 0xedb88320L ^ (c >> 1);
+ else c = c >> 1;
+ }
+ Crc32_crc_table[n] = c;
+ }
+ Crc32_crc_table_computed = 1;
+}
+
+/*Update a running CRC with the bytes buf[0..len-1]--the CRC should be
+initialized to all 1's, and the transmitted value is the 1's complement of the
+final running CRC (see the crc() routine below).*/
+static unsigned Crc32_update_crc(const unsigned char* buf, unsigned crc, size_t len)
+{
+ unsigned c = crc;
+ size_t n;
+
+ if(!Crc32_crc_table_computed) Crc32_make_crc_table();
+ for(n = 0; n < len; n++)
+ {
+ c = Crc32_crc_table[(c ^ buf[n]) & 0xff] ^ (c >> 8);
+ }
+ return c;
+}
+
+/*Return the CRC of the bytes buf[0..len-1].*/
+static unsigned Crc32_crc(const unsigned char* buf, size_t len)
+{
+ return Crc32_update_crc(buf, 0xffffffffL, len) ^ 0xffffffffL;
+}
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* / Reading and writing single bits and bytes from/to stream for LodePNG / */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+static unsigned char readBitFromReversedStream(size_t* bitpointer, const unsigned char* bitstream)
+{
+ unsigned char result = (unsigned char)((bitstream[(*bitpointer) >> 3] >> (7 - ((*bitpointer) & 0x7))) & 1);
+ (*bitpointer)++;
+ return result;
+}
+
+static unsigned readBitsFromReversedStream(size_t* bitpointer, const unsigned char* bitstream, size_t nbits)
+{
+ unsigned result = 0;
+ size_t i;
+ for(i = nbits - 1; i < nbits; i--) result += (unsigned)readBitFromReversedStream(bitpointer, bitstream) << i;
+ return result;
+}
+
+#ifdef LODEPNG_COMPILE_DECODER
+static void setBitOfReversedStream0(size_t* bitpointer, unsigned char* bitstream, unsigned char bit)
+{
+ /*the current bit in bitstream must be 0 for this to work*/
+ if(bit) bitstream[(*bitpointer) >> 3] |= (bit << (7 - ((*bitpointer) & 0x7))); /*earlier bit of huffman code is in a lesser significant bit of an earlier byte*/
+ (*bitpointer)++;
+}
+#endif /*LODEPNG_COMPILE_DECODER*/
+
+static void setBitOfReversedStream(size_t* bitpointer, unsigned char* bitstream, unsigned char bit)
+{
+ /*the current bit in bitstream may be 0 or 1 for this to work*/
+ if(bit == 0) bitstream[(*bitpointer) >> 3] &= (unsigned char)(~(1 << (7 - ((*bitpointer) & 0x7))));
+ else bitstream[(*bitpointer) >> 3] |= (1 << (7 - ((*bitpointer) & 0x7)));
+ (*bitpointer)++;
+}
+
+static unsigned LodePNG_read32bitInt(const unsigned char* buffer)
+{
+ return (buffer[0] << 24) | (buffer[1] << 16) | (buffer[2] << 8) | buffer[3];
+}
+
+static void LodePNG_set32bitInt(unsigned char* buffer, unsigned value) /*buffer must have at least 4 allocated bytes available*/
+{
+ buffer[0] = (unsigned char)((value >> 24) & 0xff);
+ buffer[1] = (unsigned char)((value >> 16) & 0xff);
+ buffer[2] = (unsigned char)((value >> 8) & 0xff);
+ buffer[3] = (unsigned char)((value ) & 0xff);
+}
+
+#ifdef LODEPNG_COMPILE_ENCODER
+static void LodePNG_add32bitInt(ucvector* buffer, unsigned value)
+{
+ ucvector_resize(buffer, buffer->size + 4);
+ LodePNG_set32bitInt(&buffer->data[buffer->size - 4], value);
+}
+#endif /*LODEPNG_COMPILE_ENCODER*/
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* / PNG chunks / */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+unsigned LodePNG_chunk_length(const unsigned char* chunk) /*get the length of the data of the chunk. Total chunk length has 12 bytes more.*/
+{
+ return LodePNG_read32bitInt(&chunk[0]);
+}
+
+void LodePNG_chunk_type(char type[5], const unsigned char* chunk) /*puts the 4-byte type in null terminated string*/
+{
+ unsigned i;
+ for(i = 0; i < 4; i++) type[i] = chunk[4 + i];
+ type[4] = 0; /*null termination char*/
+}
+
+unsigned char LodePNG_chunk_type_equals(const unsigned char* chunk, const char* type) /*check if the type is the given type*/
+{
+ if(strlen(type) != 4) return 0;
+ return (chunk[4] == type[0] && chunk[5] == type[1] && chunk[6] == type[2] && chunk[7] == type[3]);
+}
+
+/*properties of PNG chunks gotten from capitalization of chunk type name, as defined by the standard*/
+unsigned char LodePNG_chunk_critical(const unsigned char* chunk) /*0: ancillary chunk, 1: it's one of the critical chunk types*/
+{
+ return((chunk[4] & 32) == 0);
+}
+
+unsigned char LodePNG_chunk_private(const unsigned char* chunk) /*0: public, 1: private*/
+{
+ return((chunk[6] & 32) != 0);
+}
+
+unsigned char LodePNG_chunk_safetocopy(const unsigned char* chunk) /*0: the chunk is unsafe to copy, 1: the chunk is safe to copy*/
+{
+ return((chunk[7] & 32) != 0);
+}
+
+unsigned char* LodePNG_chunk_data(unsigned char* chunk) /*get pointer to the data of the chunk*/
+{
+ return &chunk[8];
+}
+
+const unsigned char* LodePNG_chunk_data_const(const unsigned char* chunk) /*get pointer to the data of the chunk*/
+{
+ return &chunk[8];
+}
+
+unsigned LodePNG_chunk_check_crc(const unsigned char* chunk) /*returns 0 if the crc is correct, error code if it's incorrect*/
+{
+ unsigned length = LodePNG_chunk_length(chunk);
+ unsigned CRC = LodePNG_read32bitInt(&chunk[length + 8]);
+ unsigned checksum = Crc32_crc(&chunk[4], length + 4); /*the CRC is taken of the data and the 4 chunk type letters, not the length*/
+ if(CRC != checksum) return 1;
+ else return 0;
+}
+
+void LodePNG_chunk_generate_crc(unsigned char* chunk) /*generates the correct CRC from the data and puts it in the last 4 bytes of the chunk*/
+{
+ unsigned length = LodePNG_chunk_length(chunk);
+ unsigned CRC = Crc32_crc(&chunk[4], length + 4);
+ LodePNG_set32bitInt(chunk + 8 + length, CRC);
+}
+
+unsigned char* LodePNG_chunk_next(unsigned char* chunk) /*don't use on IEND chunk, as there is no next chunk then*/
+{
+ unsigned total_chunk_length = LodePNG_chunk_length(chunk) + 12;
+ return &chunk[total_chunk_length];
+}
+
+const unsigned char* LodePNG_chunk_next_const(const unsigned char* chunk) /*don't use on IEND chunk, as there is no next chunk then*/
+{
+ unsigned total_chunk_length = LodePNG_chunk_length(chunk) + 12;
+ return &chunk[total_chunk_length];
+}
+
+unsigned LodePNG_append_chunk(unsigned char** out, size_t* outlength, const unsigned char* chunk) /*appends chunk that was already created, to the data. Returns error code.*/
+{
+ unsigned i;
+ unsigned total_chunk_length = LodePNG_chunk_length(chunk) + 12;
+ unsigned char *chunk_start, *new_buffer;
+ size_t new_length = (*outlength) + total_chunk_length;
+ if(new_length < total_chunk_length || new_length < (*outlength)) return 77; /*integer overflow happened*/
+
+ new_buffer = (unsigned char*)realloc(*out, new_length);
+ if(!new_buffer) return 9929;
+ (*out) = new_buffer;
+ (*outlength) = new_length;
+ chunk_start = &(*out)[new_length - total_chunk_length];
+
+ for(i = 0; i < total_chunk_length; i++) chunk_start[i] = chunk[i];
+
+ return 0;
+}
+
+unsigned LodePNG_create_chunk(unsigned char** out, size_t* outlength, unsigned length, const char* type, const unsigned char* data) /*appends new chunk to out. Returns error code; may change memory address of out buffer*/
+{
+ unsigned i;
+ unsigned char *chunk, *new_buffer;
+ size_t new_length = (*outlength) + length + 12;
+ if(new_length < length + 12 || new_length < (*outlength)) return 77; /*integer overflow happened*/
+ new_buffer = (unsigned char*)realloc(*out, new_length);
+ if(!new_buffer) return 9930;
+ (*out) = new_buffer;
+ (*outlength) = new_length;
+ chunk = &(*out)[(*outlength) - length - 12];
+
+ /*1: length*/
+ LodePNG_set32bitInt(chunk, (unsigned)length);
+
+ /*2: chunk name (4 letters)*/
+ chunk[4] = type[0];
+ chunk[5] = type[1];
+ chunk[6] = type[2];
+ chunk[7] = type[3];
+
+ /*3: the data*/
+ for(i = 0; i < length; i++) chunk[8 + i] = data[i];
+
+ /*4: CRC (of the chunkname characters and the data)*/
+ LodePNG_chunk_generate_crc(chunk);
+
+ return 0;
+}
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* / Color types and such / */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+/*return type is a LodePNG error code*/
+static unsigned checkColorValidity(unsigned colorType, unsigned bd) /*bd = bitDepth*/
+{
+ switch(colorType)
+ {
+ case 0: if(!(bd == 1 || bd == 2 || bd == 4 || bd == 8 || bd == 16)) return 37; break; /*grey*/
+ case 2: if(!( bd == 8 || bd == 16)) return 37; break; /*RGB*/
+ case 3: if(!(bd == 1 || bd == 2 || bd == 4 || bd == 8 )) return 37; break; /*palette*/
+ case 4: if(!( bd == 8 || bd == 16)) return 37; break; /*grey + alpha*/
+ case 6: if(!( bd == 8 || bd == 16)) return 37; break; /*RGBA*/
+ default: return 31;
+ }
+ return 0; /*allowed color type / bits combination*/
+}
+
+static unsigned getNumColorChannels(unsigned colorType)
+{
+ switch(colorType)
+ {
+ case 0: return 1; /*grey*/
+ case 2: return 3; /*RGB*/
+ case 3: return 1; /*palette*/
+ case 4: return 2; /*grey + alpha*/
+ case 6: return 4; /*RGBA*/
+ }
+ return 0; /*unexisting color type*/
+}
+
+static unsigned getBpp(unsigned colorType, unsigned bitDepth)
+{
+ return getNumColorChannels(colorType) * bitDepth; /*bits per pixel is amount of channels * bits per channel*/
+}
+
+/* ////////////////////////////////////////////////////////////////////////// */
+
+void LodePNG_InfoColor_init(LodePNG_InfoColor* info)
+{
+ info->key_defined = 0;
+ info->key_r = info->key_g = info->key_b = 0;
+ info->colorType = 6;
+ info->bitDepth = 8;
+ info->palette = 0;
+ info->palettesize = 0;
+}
+
+void LodePNG_InfoColor_cleanup(LodePNG_InfoColor* info)
+{
+ LodePNG_InfoColor_clearPalette(info);
+}
+
+void LodePNG_InfoColor_clearPalette(LodePNG_InfoColor* info)
+{
+ if(info->palette) free(info->palette);
+ info->palettesize = 0;
+}
+
+unsigned LodePNG_InfoColor_addPalette(LodePNG_InfoColor* info, unsigned char r, unsigned char g, unsigned char b, unsigned char a)
+{
+ unsigned char* data;
+ /*the same resize technique as C++ std::vectors is used, and here it's made so that for a palette with the max of 256 colors, it'll have the exact alloc size*/
+ if(!(info->palettesize & (info->palettesize - 1))) /*if palettesize is 0 or a power of two*/
+ {
+ /*allocated data must be at least 4* palettesize (for 4 color bytes)*/
+ size_t alloc_size = info->palettesize == 0 ? 4 : info->palettesize * 4 * 2;
+ data = (unsigned char*)realloc(info->palette, alloc_size);
+ if(!data) return 9931;
+ else info->palette = data;
+ }
+ info->palette[4 * info->palettesize + 0] = r;
+ info->palette[4 * info->palettesize + 1] = g;
+ info->palette[4 * info->palettesize + 2] = b;
+ info->palette[4 * info->palettesize + 3] = a;
+ info->palettesize++;
+ return 0;
+}
+
+unsigned LodePNG_InfoColor_getBpp(const LodePNG_InfoColor* info) { return getBpp(info->colorType, info->bitDepth); } /*calculate bits per pixel out of colorType and bitDepth*/
+unsigned LodePNG_InfoColor_getChannels(const LodePNG_InfoColor* info) { return getNumColorChannels(info->colorType); }
+unsigned LodePNG_InfoColor_isGreyscaleType(const LodePNG_InfoColor* info) { return info->colorType == 0 || info->colorType == 4; }
+unsigned LodePNG_InfoColor_isAlphaType(const LodePNG_InfoColor* info) { return (info->colorType & 4) != 0; }
+
+unsigned LodePNG_InfoColor_equal(const LodePNG_InfoColor* info1, const LodePNG_InfoColor* info2)
+{
+ return info1->colorType == info2->colorType
+ && info1->bitDepth == info2->bitDepth; /*palette and color key not compared*/
+}
+
+#ifdef LODEPNG_COMPILE_UNKNOWN_CHUNKS
+
+void LodePNG_UnknownChunks_init(LodePNG_UnknownChunks* chunks)
+{
+ unsigned i;
+ for(i = 0; i < 3; i++) chunks->data[i] = 0;
+ for(i = 0; i < 3; i++) chunks->datasize[i] = 0;
+}
+
+void LodePNG_UnknownChunks_cleanup(LodePNG_UnknownChunks* chunks)
+{
+ unsigned i;
+ for(i = 0; i < 3; i++) free(chunks->data[i]);
+}
+
+unsigned LodePNG_UnknownChunks_copy(LodePNG_UnknownChunks* dest, const LodePNG_UnknownChunks* src)
+{
+ unsigned i;
+
+ LodePNG_UnknownChunks_cleanup(dest);
+
+ for(i = 0; i < 3; i++)
+ {
+ size_t j;
+ dest->datasize[i] = src->datasize[i];
+ dest->data[i] = (unsigned char*)malloc(src->datasize[i]);
+ if(!dest->data[i] && dest->datasize[i]) return 9932;
+ for(j = 0; j < src->datasize[i]; j++) dest->data[i][j] = src->data[i][j];
+ }
+
+ return 0;
+}
+
+#endif /*LODEPNG_COMPILE_UNKNOWN_CHUNKS*/
+
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+
+void LodePNG_Text_init(LodePNG_Text* text)
+{
+ text->num = 0;
+ text->keys = NULL;
+ text->strings = NULL;
+}
+
+void LodePNG_Text_cleanup(LodePNG_Text* text)
+{
+ LodePNG_Text_clear(text);
+}
+
+unsigned LodePNG_Text_copy(LodePNG_Text* dest, const LodePNG_Text* source)
+{
+ size_t i = 0;
+ dest->keys = 0;
+ dest->strings = 0;
+ dest->num = 0;
+ for(i = 0; i < source->num; i++)
+ {
+ unsigned error = LodePNG_Text_add(dest, source->keys[i], source->strings[i]);
+ if(error) return error;
+ }
+ return 0;
+}
+
+void LodePNG_Text_clear(LodePNG_Text* text)
+{
+ size_t i;
+ for(i = 0; i < text->num; i++)
+ {
+ string_cleanup(&text->keys[i]);
+ string_cleanup(&text->strings[i]);
+ }
+ free(text->keys);
+ free(text->strings);
+}
+
+unsigned LodePNG_Text_add(LodePNG_Text* text, const char* key, const char* str)
+{
+ char** new_keys = (char**)(realloc(text->keys, sizeof(char*) * (text->num + 1)));
+ char** new_strings = (char**)(realloc(text->strings, sizeof(char*) * (text->num + 1)));
+ if(!new_keys || !new_strings)
+ {
+ free(new_keys);
+ free(new_strings);
+ return 9933;
+ }
+
+ text->num++;
+ text->keys = new_keys;
+ text->strings = new_strings;
+
+ string_init(&text->keys[text->num - 1]);
+ string_set(&text->keys[text->num - 1], key);
+
+ string_init(&text->strings[text->num - 1]);
+ string_set(&text->strings[text->num - 1], str);
+
+ return 0;
+}
+
+/******************************************************************************/
+
+void LodePNG_IText_init(LodePNG_IText* text)
+{
+ text->num = 0;
+ text->keys = NULL;
+ text->langtags = NULL;
+ text->transkeys = NULL;
+ text->strings = NULL;
+}
+
+void LodePNG_IText_cleanup(LodePNG_IText* text)
+{
+ LodePNG_IText_clear(text);
+}
+
+unsigned LodePNG_IText_copy(LodePNG_IText* dest, const LodePNG_IText* source)
+{
+ size_t i = 0;
+ dest->keys = 0;
+ dest->langtags = 0;
+ dest->transkeys = 0;
+ dest->strings = 0;
+ dest->num = 0;
+ for(i = 0; i < source->num; i++)
+ {
+ unsigned error = LodePNG_IText_add(dest, source->keys[i], source->langtags[i], source->transkeys[i], source->strings[i]);
+ if(error) return error;
+ }
+ return 0;
+}
+
+void LodePNG_IText_clear(LodePNG_IText* text)
+{
+ size_t i;
+ for(i = 0; i < text->num; i++)
+ {
+ string_cleanup(&text->keys[i]);
+ string_cleanup(&text->langtags[i]);
+ string_cleanup(&text->transkeys[i]);
+ string_cleanup(&text->strings[i]);
+ }
+ free(text->keys);
+ free(text->langtags);
+ free(text->transkeys);
+ free(text->strings);
+}
+
+unsigned LodePNG_IText_add(LodePNG_IText* text, const char* key, const char* langtag, const char* transkey, const char* str)
+{
+ char** new_keys = (char**)(realloc(text->keys, sizeof(char*) * (text->num + 1)));
+ char** new_langtags = (char**)(realloc(text->langtags, sizeof(char*) * (text->num + 1)));
+ char** new_transkeys = (char**)(realloc(text->transkeys, sizeof(char*) * (text->num + 1)));
+ char** new_strings = (char**)(realloc(text->strings, sizeof(char*) * (text->num + 1)));
+ if(!new_keys || !new_langtags || !new_transkeys || !new_strings)
+ {
+ free(new_keys);
+ free(new_langtags);
+ free(new_transkeys);
+ free(new_strings);
+ return 9934;
+ }
+
+ text->num++;
+ text->keys = new_keys;
+ text->langtags = new_langtags;
+ text->transkeys = new_transkeys;
+ text->strings = new_strings;
+
+ string_init(&text->keys[text->num - 1]);
+ string_set(&text->keys[text->num - 1], key);
+
+ string_init(&text->langtags[text->num - 1]);
+ string_set(&text->langtags[text->num - 1], langtag);
+
+ string_init(&text->transkeys[text->num - 1]);
+ string_set(&text->transkeys[text->num - 1], transkey);
+
+ string_init(&text->strings[text->num - 1]);
+ string_set(&text->strings[text->num - 1], str);
+
+ return 0;
+}
+
+#endif /*LODEPNG_COMPILE_ANCILLARY_CHUNKS*/
+
+void LodePNG_InfoPng_init(LodePNG_InfoPng* info)
+{
+ info->width = info->height = 0;
+ LodePNG_InfoColor_init(&info->color);
+ info->interlaceMethod = 0;
+ info->compressionMethod = 0;
+ info->filterMethod = 0;
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+ info->background_defined = 0;
+ info->background_r = info->background_g = info->background_b = 0;
+
+ LodePNG_Text_init(&info->text);
+ LodePNG_IText_init(&info->itext);
+
+ info->time_defined = 0;
+ info->phys_defined = 0;
+#endif /*LODEPNG_COMPILE_ANCILLARY_CHUNKS*/
+#ifdef LODEPNG_COMPILE_UNKNOWN_CHUNKS
+ LodePNG_UnknownChunks_init(&info->unknown_chunks);
+#endif /*LODEPNG_COMPILE_UNKNOWN_CHUNKS*/
+}
+
+void LodePNG_InfoPng_cleanup(LodePNG_InfoPng* info)
+{
+ LodePNG_InfoColor_cleanup(&info->color);
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+ LodePNG_Text_cleanup(&info->text);
+ LodePNG_IText_cleanup(&info->itext);
+#endif /*LODEPNG_COMPILE_ANCILLARY_CHUNKS*/
+#ifdef LODEPNG_COMPILE_UNKNOWN_CHUNKS
+ LodePNG_UnknownChunks_cleanup(&info->unknown_chunks);
+#endif /*LODEPNG_COMPILE_UNKNOWN_CHUNKS*/
+}
+
+unsigned LodePNG_InfoPng_copy(LodePNG_InfoPng* dest, const LodePNG_InfoPng* source)
+{
+ unsigned error = 0;
+ LodePNG_InfoPng_cleanup(dest);
+ *dest = *source;
+ LodePNG_InfoColor_init(&dest->color);
+ error = LodePNG_InfoColor_copy(&dest->color, &source->color); if(error) return error;
+
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+ error = LodePNG_Text_copy(&dest->text, &source->text); if(error) return error;
+ error = LodePNG_IText_copy(&dest->itext, &source->itext); if(error) return error;
+#endif /*LODEPNG_COMPILE_ANCILLARY_CHUNKS*/
+
+#ifdef LODEPNG_COMPILE_UNKNOWN_CHUNKS
+ LodePNG_UnknownChunks_init(&dest->unknown_chunks);
+ error = LodePNG_UnknownChunks_copy(&dest->unknown_chunks, &source->unknown_chunks); if(error) return error;
+#endif /*LODEPNG_COMPILE_UNKNOWN_CHUNKS*/
+ return error;
+}
+
+void LodePNG_InfoPng_swap(LodePNG_InfoPng* a, LodePNG_InfoPng* b)
+{
+ LodePNG_InfoPng temp = *a;
+ *a = *b;
+ *b = temp;
+}
+
+unsigned LodePNG_InfoColor_copy(LodePNG_InfoColor* dest, const LodePNG_InfoColor* source)
+{
+ size_t i;
+ LodePNG_InfoColor_cleanup(dest);
+ *dest = *source;
+ dest->palette = (unsigned char*)malloc(source->palettesize * 4);
+ if(!dest->palette && source->palettesize) return 9935;
+ for(i = 0; i < source->palettesize * 4; i++) dest->palette[i] = source->palette[i];
+ return 0;
+}
+
+void LodePNG_InfoRaw_init(LodePNG_InfoRaw* info)
+{
+ LodePNG_InfoColor_init(&info->color);
+}
+
+void LodePNG_InfoRaw_cleanup(LodePNG_InfoRaw* info)
+{
+ LodePNG_InfoColor_cleanup(&info->color);
+}
+
+unsigned LodePNG_InfoRaw_copy(LodePNG_InfoRaw* dest, const LodePNG_InfoRaw* source)
+{
+ unsigned error = 0;
+ LodePNG_InfoRaw_cleanup(dest);
+ *dest = *source;
+ LodePNG_InfoColor_init(&dest->color);
+ error = LodePNG_InfoColor_copy(&dest->color, &source->color); if(error) return error;
+ return error;
+}
+
+/* ////////////////////////////////////////////////////////////////////////// */
+
+/*
+converts from any color type to 24-bit or 32-bit (later maybe more supported). return value = LodePNG error code
+the out buffer must have (w * h * bpp + 7) / 8 bytes, where bpp is the bits per pixel of the output color type (LodePNG_InfoColor_getBpp)
+for < 8 bpp images, there may _not_ be padding bits at the end of scanlines.
+*/
+unsigned LodePNG_convert(unsigned char* out, const unsigned char* in, LodePNG_InfoColor* infoOut, LodePNG_InfoColor* infoIn, unsigned w, unsigned h)
+{
+ const size_t numpixels = w * h; /*amount of pixels*/
+ const unsigned OUT_BYTES = LodePNG_InfoColor_getBpp(infoOut) / 8; /*bytes per pixel in the output image*/
+ const unsigned OUT_ALPHA = LodePNG_InfoColor_isAlphaType(infoOut); /*use 8-bit alpha channel*/
+ size_t i, c, bp = 0; /*bitpointer, used by less-than-8-bit color types*/
+
+ /*cases where in and out already have the same format*/
+ if(LodePNG_InfoColor_equal(infoIn, infoOut))
+ {
+ size_t i, size = (w * h * LodePNG_InfoColor_getBpp(infoIn) + 7) / 8;
+ for(i = 0; i < size; i++) out[i] = in[i];
+ return 0;
+ }
+
+ if((infoOut->colorType == 2 || infoOut->colorType == 6) && infoOut->bitDepth == 8)
+ {
+ if(infoIn->bitDepth == 8)
+ {
+ switch(infoIn->colorType)
+ {
+ case 0: /*greyscale color*/
+ for(i = 0; i < numpixels; i++)
+ {
+ if(OUT_ALPHA) out[OUT_BYTES * i + 3] = 255;
+ out[OUT_BYTES * i + 0] = out[OUT_BYTES * i + 1] = out[OUT_BYTES * i + 2] = in[i];
+ if(OUT_ALPHA && infoIn->key_defined && in[i] == infoIn->key_r) out[OUT_BYTES * i + 3] = 0;
+ }
+ break;
+ case 2: /*RGB color*/
+ for(i = 0; i < numpixels; i++)
+ {
+ if(OUT_ALPHA) out[OUT_BYTES * i + 3] = 255;
+ for(c = 0; c < 3; c++) out[OUT_BYTES * i + c] = in[3 * i + c];
+ if(OUT_ALPHA && infoIn->key_defined == 1 && in[3 * i + 0] == infoIn->key_r && in[3 * i + 1] == infoIn->key_g && in[3 * i + 2] == infoIn->key_b) out[OUT_BYTES * i + 3] = 0;
+ }
+ break;
+ case 3: /*indexed color (palette)*/
+ for(i = 0; i < numpixels; i++)
+ {
+ if(OUT_ALPHA) out[OUT_BYTES * i + 3] = 255;
+ if(in[i] >= infoIn->palettesize) return 46;
+ for(c = 0; c < OUT_BYTES; c++) out[OUT_BYTES * i + c] = infoIn->palette[4 * in[i] + c]; /*get rgb colors from the palette*/
+ }
+ break;
+ case 4: /*greyscale with alpha*/
+ for(i = 0; i < numpixels; i++)
+ {
+ out[OUT_BYTES * i + 0] = out[OUT_BYTES * i + 1] = out[OUT_BYTES * i + 2] = in[2 * i + 0];
+ if(OUT_ALPHA) out[OUT_BYTES * i + 3] = in[2 * i + 1];
+ }
+ break;
+ case 6: /*RGB with alpha*/
+ for(i = 0; i < numpixels; i++)
+ {
+ for(c = 0; c < OUT_BYTES; c++) out[OUT_BYTES * i + c] = in[4 * i + c];
+ }
+ break;
+ default: break;
+ }
+ }
+ else if(infoIn->bitDepth == 16)
+ {
+ switch(infoIn->colorType)
+ {
+ case 0: /*greyscale color*/
+ for(i = 0; i < numpixels; i++)
+ {
+ if(OUT_ALPHA) out[OUT_BYTES * i + 3] = 255;
+ out[OUT_BYTES * i + 0] = out[OUT_BYTES * i + 1] = out[OUT_BYTES * i + 2] = in[2 * i];
+ if(OUT_ALPHA && infoIn->key_defined && 256U * in[i] + in[i + 1] == infoIn->key_r) out[OUT_BYTES * i + 3] = 0;
+ }
+ break;
+ case 2: /*RGB color*/
+ for(i = 0; i < numpixels; i++)
+ {
+ if(OUT_ALPHA) out[OUT_BYTES * i + 3] = 255;
+ for(c = 0; c < 3; c++) out[OUT_BYTES * i + c] = in[6 * i + 2 * c];
+ if(OUT_ALPHA && infoIn->key_defined && 256U * in[6 * i + 0] + in[6 * i + 1] == infoIn->key_r && 256U * in[6 * i + 2] + in[6 * i + 3] == infoIn->key_g && 256U * in[6 * i + 4] + in[6 * i + 5] == infoIn->key_b) out[OUT_BYTES * i + 3] = 0;
+ }
+ break;
+ case 4: /*greyscale with alpha*/
+ for(i = 0; i < numpixels; i++)
+ {
+ out[OUT_BYTES * i + 0] = out[OUT_BYTES * i + 1] = out[OUT_BYTES * i + 2] = in[4 * i]; /*most significant byte*/
+ if(OUT_ALPHA) out[OUT_BYTES * i + 3] = in[4 * i + 2];
+ }
+ break;
+ case 6: /*RGB with alpha*/
+ for(i = 0; i < numpixels; i++)
+ {
+ for(c = 0; c < OUT_BYTES; c++) out[OUT_BYTES * i + c] = in[8 * i + 2 * c];
+ }
+ break;
+ default: break;
+ }
+ }
+ else /*infoIn->bitDepth is less than 8 bit per channel*/
+ {
+ switch(infoIn->colorType)
+ {
+ case 0: /*greyscale color*/
+ for(i = 0; i < numpixels; i++)
+ {
+ unsigned value = readBitsFromReversedStream(&bp, in, infoIn->bitDepth);
+ if(OUT_ALPHA) out[OUT_BYTES * i + 3] = 255;
+ if(OUT_ALPHA && infoIn->key_defined && value && ((1U << infoIn->bitDepth) - 1U) == infoIn->key_r && ((1U << infoIn->bitDepth) - 1U)) out[OUT_BYTES * i + 3] = 0;
+ value = (value * 255) / ((1 << infoIn->bitDepth) - 1); /*scale value from 0 to 255*/
+ out[OUT_BYTES * i + 0] = out[OUT_BYTES * i + 1] = out[OUT_BYTES * i + 2] = (unsigned char)(value);
+ }
+ break;
+ case 3: /*indexed color (palette)*/
+ for(i = 0; i < numpixels; i++)
+ {
+ unsigned value = readBitsFromReversedStream(&bp, in, infoIn->bitDepth);
+ if(OUT_ALPHA) out[OUT_BYTES * i + 3] = 255;
+ if(value >= infoIn->palettesize) return 47;
+ for(c = 0; c < OUT_BYTES; c++) out[OUT_BYTES * i + c] = infoIn->palette[4 * value + c]; /*get rgb colors from the palette*/
+ }
+ break;
+ default: break;
+ }
+ }
+ }
+ else if(LodePNG_InfoColor_isGreyscaleType(infoOut) && infoOut->bitDepth == 8) /*conversion from greyscale to greyscale*/
+ {
+ if(!LodePNG_InfoColor_isGreyscaleType(infoIn)) return 62;
+ if(infoIn->bitDepth == 8)
+ {
+ switch(infoIn->colorType)
+ {
+ case 0: /*greyscale color*/
+ for(i = 0; i < numpixels; i++)
+ {
+ if(OUT_ALPHA) out[OUT_BYTES * i + 1] = 255;
+ out[OUT_BYTES * i] = in[i];
+ if(OUT_ALPHA && infoIn->key_defined && in[i] == infoIn->key_r) out[OUT_BYTES * i + 1] = 0;
+ }
+ break;
+ case 4: /*greyscale with alpha*/
+ for(i = 0; i < numpixels; i++)
+ {
+ out[OUT_BYTES * i + 0] = in[2 * i + 0];
+ if(OUT_ALPHA) out[OUT_BYTES * i + 1] = in[2 * i + 1];
+ }
+ break;
+ default: return 31;
+ }
+ }
+ else if(infoIn->bitDepth == 16)
+ {
+ switch(infoIn->colorType)
+ {
+ case 0: /*greyscale color*/
+ for(i = 0; i < numpixels; i++)
+ {
+ if(OUT_ALPHA) out[OUT_BYTES * i + 1] = 255;
+ out[OUT_BYTES * i] = in[2 * i];
+ if(OUT_ALPHA && infoIn->key_defined && 256U * in[i] + in[i + 1] == infoIn->key_r) out[OUT_BYTES * i + 1] = 0;
+ }
+ break;
+ case 4: /*greyscale with alpha*/
+ for(i = 0; i < numpixels; i++)
+ {
+ out[OUT_BYTES * i] = in[4 * i]; /*most significant byte*/
+ if(OUT_ALPHA) out[OUT_BYTES * i + 1] = in[4 * i + 2]; /*most significant byte*/
+ }
+ break;
+ default: return 31;
+ }
+ }
+ else /*infoIn->bitDepth is less than 8 bit per channel*/
+ {
+ if(infoIn->colorType != 0) return 31; /*colorType 0 is the only greyscale type with < 8 bits per channel*/
+ for(i = 0; i < numpixels; i++)
+ {
+ unsigned value = readBitsFromReversedStream(&bp, in, infoIn->bitDepth);
+ if(OUT_ALPHA) out[OUT_BYTES * i + 1] = 255;
+ if(OUT_ALPHA && infoIn->key_defined && value && ((1U << infoIn->bitDepth) - 1U) == infoIn->key_r && ((1U << infoIn->bitDepth) - 1U)) out[OUT_BYTES * i + 1] = 0;
+ value = (value * 255) / ((1 << infoIn->bitDepth) - 1); /*scale value from 0 to 255*/
+ out[OUT_BYTES * i] = (unsigned char)(value);
+ }
+ }
+ }
+ else return 59;
+
+ return 0;
+}
+
+/*Paeth predicter, used by PNG filter type 4*/
+static int paethPredictor(int a, int b, int c)
+{
+ int p = a + b - c;
+ int pa = p > a ? p - a : a - p;
+ int pb = p > b ? p - b : b - p;
+ int pc = p > c ? p - c : c - p;
+
+ if(pa <= pb && pa <= pc) return a;
+ else if(pb <= pc) return b;
+ else return c;
+}
+
+/*shared values used by multiple Adam7 related functions*/
+
+static const unsigned ADAM7_IX[7] = { 0, 4, 0, 2, 0, 1, 0 }; /*x start values*/
+static const unsigned ADAM7_IY[7] = { 0, 0, 4, 0, 2, 0, 1 }; /*y start values*/
+static const unsigned ADAM7_DX[7] = { 8, 8, 4, 4, 2, 2, 1 }; /*x delta values*/
+static const unsigned ADAM7_DY[7] = { 8, 8, 8, 4, 4, 2, 2 }; /*y delta values*/
+
+static void Adam7_getpassvalues(unsigned passw[7], unsigned passh[7], size_t filter_passstart[8], size_t padded_passstart[8], size_t passstart[8], unsigned w, unsigned h, unsigned bpp)
+{
+ /*the passstart values have 8 values: the 8th one actually indicates the byte after the end of the 7th (= last) pass*/
+ unsigned i;
+
+ /*calculate width and height in pixels of each pass*/
+ for(i = 0; i < 7; i++)
+ {
+ passw[i] = (w + ADAM7_DX[i] - ADAM7_IX[i] - 1) / ADAM7_DX[i];
+ passh[i] = (h + ADAM7_DY[i] - ADAM7_IY[i] - 1) / ADAM7_DY[i];
+ if(passw[i] == 0) passh[i] = 0;
+ if(passh[i] == 0) passw[i] = 0;
+ }
+
+ filter_passstart[0] = padded_passstart[0] = passstart[0] = 0;
+ for(i = 0; i < 7; i++)
+ {
+ filter_passstart[i + 1] = filter_passstart[i] + ((passw[i] && passh[i]) ? passh[i] * (1 + (passw[i] * bpp + 7) / 8) : 0); /*if passw[i] is 0, it's 0 bytes, not 1 (no filtertype-byte)*/
+ padded_passstart[i + 1] = padded_passstart[i] + passh[i] * ((passw[i] * bpp + 7) / 8); /*bits padded if needed to fill full byte at end of each scanline*/
+ passstart[i + 1] = passstart[i] + (passh[i] * passw[i] * bpp + 7) / 8; /*only padded at end of reduced image*/
+ }
+}
+
+#ifdef LODEPNG_COMPILE_DECODER
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* / PNG Decoder / */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+/*read the information from the header and store it in the LodePNG_Info. return value is error*/
+void LodePNG_inspect(LodePNG_Decoder* decoder, const unsigned char* in, size_t inlength)
+{
+ if(inlength == 0 || in == 0) { decoder->error = 48; return; } /*the given data is empty*/
+ if(inlength < 29) { decoder->error = 27; return; } /*error: the data length is smaller than the length of the header*/
+
+ /*when decoding a new PNG image, make sure all parameters created after previous decoding are reset*/
+ LodePNG_InfoPng_cleanup(&decoder->infoPng);
+ LodePNG_InfoPng_init(&decoder->infoPng);
+ decoder->error = 0;
+
+ if(in[0] != 137 || in[1] != 80 || in[2] != 78 || in[3] != 71 || in[4] != 13 || in[5] != 10 || in[6] != 26 || in[7] != 10) { decoder->error = 28; return; } /*error: the first 8 bytes are not the correct PNG signature*/
+ if(in[12] != 'I' || in[13] != 'H' || in[14] != 'D' || in[15] != 'R') { decoder->error = 29; return; } /*error: it doesn't start with a IHDR chunk!*/
+
+ /*read the values given in the header*/
+ decoder->infoPng.width = LodePNG_read32bitInt(&in[16]);
+ decoder->infoPng.height = LodePNG_read32bitInt(&in[20]);
+ decoder->infoPng.color.bitDepth = in[24];
+ decoder->infoPng.color.colorType = in[25];
+ decoder->infoPng.compressionMethod = in[26];
+ decoder->infoPng.filterMethod = in[27];
+ decoder->infoPng.interlaceMethod = in[28];
+
+ if(!decoder->settings.ignoreCrc)
+ {
+ unsigned CRC = LodePNG_read32bitInt(&in[29]);
+ unsigned checksum = Crc32_crc(&in[12], 17);
+ if(CRC != checksum) { decoder->error = 57; return; }
+ }
+
+ if(decoder->infoPng.compressionMethod != 0) { decoder->error = 32; return; } /*error: only compression method 0 is allowed in the specification*/
+ if(decoder->infoPng.filterMethod != 0) { decoder->error = 33; return; } /*error: only filter method 0 is allowed in the specification*/
+ if(decoder->infoPng.interlaceMethod > 1) { decoder->error = 34; return; } /*error: only interlace methods 0 and 1 exist in the specification*/
+
+ decoder->error = checkColorValidity(decoder->infoPng.color.colorType, decoder->infoPng.color.bitDepth);
+}
+
+static unsigned unfilterScanline(unsigned char* recon, const unsigned char* scanline, const unsigned char* precon, size_t bytewidth, unsigned char filterType, size_t length)
+{
+ /*
+ For PNG filter method 0
+ unfilter a PNG image scanline by scanline. when the pixels are smaller than 1 byte, the filter works byte per byte (bytewidth = 1)
+ precon is the previous unfiltered scanline, recon the result, scanline the current one
+ the incoming scanlines do NOT include the filtertype byte, that one is given in the parameter filterType instead
+ recon and scanline MAY be the same memory address! precon must be disjoint.
+ */
+
+ size_t i;
+ switch(filterType)
+ {
+ case 0:
+ for(i = 0; i < length; i++) recon[i] = scanline[i];
+ break;
+ case 1:
+ for(i = 0; i < bytewidth; i++) recon[i] = scanline[i];
+ for(i = bytewidth; i < length; i++) recon[i] = scanline[i] + recon[i - bytewidth];
+ break;
+ case 2:
+ if(precon) for(i = 0; i < length; i++) recon[i] = scanline[i] + precon[i];
+ else for(i = 0; i < length; i++) recon[i] = scanline[i];
+ break;
+ case 3:
+ if(precon)
+ {
+ for(i = 0; i < bytewidth; i++) recon[i] = scanline[i] + precon[i] / 2;
+ for(i = bytewidth; i < length; i++) recon[i] = scanline[i] + ((recon[i - bytewidth] + precon[i]) / 2);
+ }
+ else
+ {
+ for(i = 0; i < bytewidth; i++) recon[i] = scanline[i];
+ for(i = bytewidth; i < length; i++) recon[i] = scanline[i] + recon[i - bytewidth] / 2;
+ }
+ break;
+ case 4:
+ if(precon)
+ {
+ for(i = 0; i < bytewidth; i++) recon[i] = (unsigned char)(scanline[i] + paethPredictor(0, precon[i], 0));
+ for(i = bytewidth; i < length; i++) recon[i] = (unsigned char)(scanline[i] + paethPredictor(recon[i - bytewidth], precon[i], precon[i - bytewidth]));
+ }
+ else
+ {
+ for(i = 0; i < bytewidth; i++) recon[i] = scanline[i];
+ for(i = bytewidth; i < length; i++) recon[i] = (unsigned char)(scanline[i] + paethPredictor(recon[i - bytewidth], 0, 0));
+ }
+ break;
+ default: return 36; /*error: unexisting filter type given*/
+ }
+ return 0;
+}
+
+static unsigned unfilter(unsigned char* out, const unsigned char* in, unsigned w, unsigned h, unsigned bpp)
+{
+ /*
+ For PNG filter method 0
+ this function unfilters a single image (e.g. without interlacing this is called once, with Adam7 it's called 7 times)
+ out must have enough bytes allocated already, in must have the scanlines + 1 filtertype byte per scanline
+ w and h are image dimensions or dimensions of reduced image, bpp is bits per pixel
+ in and out are allowed to be the same memory address!
+ */
+
+ unsigned y;
+ unsigned char* prevline = 0;
+
+ size_t bytewidth = (bpp + 7) / 8; /*bytewidth is used for filtering, is 1 when bpp < 8, number of bytes per pixel otherwise*/
+ size_t linebytes = (w * bpp + 7) / 8;
+
+ for(y = 0; y < h; y++)
+ {
+ size_t outindex = linebytes * y;
+ size_t inindex = (1 + linebytes) * y; /*the extra filterbyte added to each row*/
+ unsigned char filterType = in[inindex];
+
+ unsigned error = unfilterScanline(&out[outindex], &in[inindex + 1], prevline, bytewidth, filterType, linebytes);
+ if(error) return error;
+
+ prevline = &out[outindex];
+ }
+
+ return 0;
+}
+
+static void Adam7_deinterlace(unsigned char* out, const unsigned char* in, unsigned w, unsigned h, unsigned bpp)
+{
+ /*Note: this function works on image buffers WITHOUT padding bits at end of scanlines with non-multiple-of-8 bit amounts, only between reduced images is padding
+ out must be big enough AND must be 0 everywhere if bpp < 8 in the current implementation (because that's likely a little bit faster)*/
+ unsigned passw[7], passh[7]; size_t filter_passstart[8], padded_passstart[8], passstart[8];
+ unsigned i;
+
+ Adam7_getpassvalues(passw, passh, filter_passstart, padded_passstart, passstart, w, h, bpp);
+
+ if(bpp >= 8)
+ {
+ for(i = 0; i < 7; i++)
+ {
+ unsigned x, y, b;
+ size_t bytewidth = bpp / 8;
+ for(y = 0; y < passh[i]; y++)
+ for(x = 0; x < passw[i]; x++)
+ {
+ size_t pixelinstart = passstart[i] + (y * passw[i] + x) * bytewidth;
+ size_t pixeloutstart = ((ADAM7_IY[i] + y * ADAM7_DY[i]) * w + ADAM7_IX[i] + x * ADAM7_DX[i]) * bytewidth;
+ for(b = 0; b < bytewidth; b++)
+ {
+ out[pixeloutstart + b] = in[pixelinstart + b];
+ }
+ }
+ }
+ }
+ else /*bpp < 8: Adam7 with pixels < 8 bit is a bit trickier: with bit pointers*/
+ {
+ for(i = 0; i < 7; i++)
+ {
+ unsigned x, y, b;
+ unsigned ilinebits = bpp * passw[i];
+ unsigned olinebits = bpp * w;
+ size_t obp, ibp; /*bit pointers (for out and in buffer)*/
+ for(y = 0; y < passh[i]; y++)
+ for(x = 0; x < passw[i]; x++)
+ {
+ ibp = (8 * passstart[i]) + (y * ilinebits + x * bpp);
+ obp = (ADAM7_IY[i] + y * ADAM7_DY[i]) * olinebits + (ADAM7_IX[i] + x * ADAM7_DX[i]) * bpp;
+ for(b = 0; b < bpp; b++)
+ {
+ unsigned char bit = readBitFromReversedStream(&ibp, in);
+ setBitOfReversedStream0(&obp, out, bit); /*note that this function assumes the out buffer is completely 0, use setBitOfReversedStream otherwise*/
+ }
+ }
+ }
+ }
+}
+
+static void removePaddingBits(unsigned char* out, const unsigned char* in, size_t olinebits, size_t ilinebits, unsigned h)
+{
+ /*
+ After filtering there are still padding bits if scanlines have non multiple of 8 bit amounts. They need to be removed (except at last scanline of (Adam7-reduced) image) before working with pure image buffers for the Adam7 code, the color convert code and the output to the user.
+ in and out are allowed to be the same buffer, in may also be higher but still overlapping; in must have >= ilinebits*h bits, out must have >= olinebits*h bits, olinebits must be <= ilinebits
+ also used to move bits after earlier such operations happened, e.g. in a sequence of reduced images from Adam7
+ only useful if (ilinebits - olinebits) is a value in the range 1..7
+ */
+ unsigned y;
+ size_t diff = ilinebits - olinebits;
+ size_t obp = 0, ibp = 0; /*bit pointers*/
+ for(y = 0; y < h; y++)
+ {
+ size_t x;
+ for(x = 0; x < olinebits; x++)
+ {
+ unsigned char bit = readBitFromReversedStream(&ibp, in);
+ setBitOfReversedStream(&obp, out, bit);
+ }
+ ibp += diff;
+ }
+}
+
+/*out must be buffer big enough to contain full image, and in must contain the full decompressed data from the IDAT chunks*/
+static unsigned postProcessScanlines(unsigned char* out, unsigned char* in, const LodePNG_InfoPng* infoPng) /*return value is error*/
+{
+ /*
+ This function converts the filtered-padded-interlaced data into pure 2D image buffer with the PNG's colortype. Steps:
+ *) if no Adam7: 1) unfilter 2) remove padding bits (= posible extra bits per scanline if bpp < 8)
+ *) if adam7: 1) 7x unfilter 2) 7x remove padding bits 3) Adam7_deinterlace
+ NOTE: the in buffer will be overwritten with intermediate data!
+ */
+ unsigned bpp = LodePNG_InfoColor_getBpp(&infoPng->color);
+ unsigned w = infoPng->width;
+ unsigned h = infoPng->height;
+ unsigned error = 0;
+ if(bpp == 0) return 31; /*error: invalid colortype*/
+
+ if(infoPng->interlaceMethod == 0)
+ {
+ if(bpp < 8 && w * bpp != ((w * bpp + 7) / 8) * 8)
+ {
+ error = unfilter(in, in, w, h, bpp);
+ if(error) return error;
+ removePaddingBits(out, in, w * bpp, ((w * bpp + 7) / 8) * 8, h);
+ }
+ else error = unfilter(out, in, w, h, bpp); /*we can immediatly filter into the out buffer, no other steps needed*/
+ }
+ else /*interlaceMethod is 1 (Adam7)*/
+ {
+ unsigned passw[7], passh[7]; size_t filter_passstart[8], padded_passstart[8], passstart[8];
+ unsigned i;
+
+ Adam7_getpassvalues(passw, passh, filter_passstart, padded_passstart, passstart, w, h, bpp);
+
+ for(i = 0; i < 7; i++)
+ {
+ error = unfilter(&in[padded_passstart[i]], &in[filter_passstart[i]], passw[i], passh[i], bpp);
+ if(error) return error;
+ if(bpp < 8) /*TODO: possible efficiency improvement: if in this reduced image the bits fit nicely in 1 scanline, move bytes instead of bits or move not at all*/
+ {
+ /*remove padding bits in scanlines; after this there still may be padding bits between the different reduced images: each reduced image still starts nicely at a byte*/
+ removePaddingBits(&in[passstart[i]], &in[padded_passstart[i]], passw[i] * bpp, ((passw[i] * bpp + 7) / 8) * 8, passh[i]);
+ }
+ }
+
+ Adam7_deinterlace(out, in, w, h, bpp);
+ }
+
+ return error;
+}
+
+/*read a PNG, the result will be in the same color type as the PNG (hence "generic")*/
+static void decodeGeneric(LodePNG_Decoder* decoder, unsigned char** out, size_t* outsize, const unsigned char* in, size_t size)
+{
+ unsigned char IEND = 0;
+ const unsigned char* chunk;
+ size_t i;
+ ucvector idat; /*the data from idat chunks*/
+
+ /*for unknown chunk order*/
+ unsigned unknown = 0;
+ unsigned critical_pos = 1; /*1 = after IHDR, 2 = after PLTE, 3 = after IDAT*/
+
+ /*provide some proper output values if error will happen*/
+ *out = 0;
+ *outsize = 0;
+
+ if(size == 0 || in == 0) { decoder->error = 48; return; } /*the given data is empty*/
+
+ LodePNG_inspect(decoder, in, size); /*reads header and resets other parameters in decoder->infoPng*/
+ if(decoder->error) return;
+
+ ucvector_init(&idat);
+
+ chunk = &in[33]; /*first byte of the first chunk after the header*/
+
+ while(!IEND) /*loop through the chunks, ignoring unknown chunks and stopping at IEND chunk. IDAT data is put at the start of the in buffer*/
+ {
+ unsigned chunkLength;
+ const unsigned char* data; /*the data in the chunk*/
+
+ if((size_t)((chunk - in) + 12) > size || chunk < in) { decoder->error = 30; break; } /*error: size of the in buffer too small to contain next chunk*/
+ chunkLength = LodePNG_chunk_length(chunk); /*length of the data of the chunk, excluding the length bytes, chunk type and CRC bytes*/
+ if(chunkLength > 2147483647) { decoder->error = 63; break; }
+ if((size_t)((chunk - in) + chunkLength + 12) > size || (chunk + chunkLength + 12) < in) { decoder->error = 35; break; } /*error: size of the in buffer too small to contain next chunk*/
+ data = LodePNG_chunk_data_const(chunk);
+
+ /*IDAT chunk, containing compressed image data*/
+ if(LodePNG_chunk_type_equals(chunk, "IDAT"))
+ {
+ size_t oldsize = idat.size;
+ if(!ucvector_resize(&idat, oldsize + chunkLength)) { decoder->error = 9936; break; }
+ for(i = 0; i < chunkLength; i++) idat.data[oldsize + i] = data[i];
+ critical_pos = 3;
+ }
+ /*IEND chunk*/
+ else if(LodePNG_chunk_type_equals(chunk, "IEND"))
+ {
+ IEND = 1;
+ }
+ /*palette chunk (PLTE)*/
+ else if(LodePNG_chunk_type_equals(chunk, "PLTE"))
+ {
+ unsigned pos = 0;
+ if(decoder->infoPng.color.palette) free(decoder->infoPng.color.palette);
+ decoder->infoPng.color.palettesize = chunkLength / 3;
+ decoder->infoPng.color.palette = (unsigned char*)malloc(4 * decoder->infoPng.color.palettesize);
+ if(!decoder->infoPng.color.palette && decoder->infoPng.color.palettesize) { decoder->error = 9937; break; }
+ if(!decoder->infoPng.color.palette) decoder->infoPng.color.palettesize = 0; /*malloc failed...*/
+ if(decoder->infoPng.color.palettesize > 256) { decoder->error = 38; break; } /*error: palette too big*/
+ for(i = 0; i < decoder->infoPng.color.palettesize; i++)
+ {
+ decoder->infoPng.color.palette[4 * i + 0] = data[pos++]; /*R*/
+ decoder->infoPng.color.palette[4 * i + 1] = data[pos++]; /*G*/
+ decoder->infoPng.color.palette[4 * i + 2] = data[pos++]; /*B*/
+ decoder->infoPng.color.palette[4 * i + 3] = 255; /*alpha*/
+ }
+ critical_pos = 2;
+ }
+ /*palette transparency chunk (tRNS)*/
+ else if(LodePNG_chunk_type_equals(chunk, "tRNS"))
+ {
+ if(decoder->infoPng.color.colorType == 3)
+ {
+ if(chunkLength > decoder->infoPng.color.palettesize) { decoder->error = 39; break; } /*error: more alpha values given than there are palette entries*/
+ for(i = 0; i < chunkLength; i++) decoder->infoPng.color.palette[4 * i + 3] = data[i];
+ }
+ else if(decoder->infoPng.color.colorType == 0)
+ {
+ if(chunkLength != 2) { decoder->error = 40; break; } /*error: this chunk must be 2 bytes for greyscale image*/
+ decoder->infoPng.color.key_defined = 1;
+ decoder->infoPng.color.key_r = decoder->infoPng.color.key_g = decoder->infoPng.color.key_b = 256 * data[0] + data[1];
+ }
+ else if(decoder->infoPng.color.colorType == 2)
+ {
+ if(chunkLength != 6) { decoder->error = 41; break; } /*error: this chunk must be 6 bytes for RGB image*/
+ decoder->infoPng.color.key_defined = 1;
+ decoder->infoPng.color.key_r = 256 * data[0] + data[1];
+ decoder->infoPng.color.key_g = 256 * data[2] + data[3];
+ decoder->infoPng.color.key_b = 256 * data[4] + data[5];
+ }
+ else { decoder->error = 42; break; } /*error: tRNS chunk not allowed for other color models*/
+ }
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+ /*background color chunk (bKGD)*/
+ else if(LodePNG_chunk_type_equals(chunk, "bKGD"))
+ {
+ if(decoder->infoPng.color.colorType == 3)
+ {
+ if(chunkLength != 1) { decoder->error = 43; break; } /*error: this chunk must be 1 byte for indexed color image*/
+ decoder->infoPng.background_defined = 1;
+ decoder->infoPng.background_r = decoder->infoPng.background_g = decoder->infoPng.background_g = data[0];
+ }
+ else if(decoder->infoPng.color.colorType == 0 || decoder->infoPng.color.colorType == 4)
+ {
+ if(chunkLength != 2) { decoder->error = 44; break; } /*error: this chunk must be 2 bytes for greyscale image*/
+ decoder->infoPng.background_defined = 1;
+ decoder->infoPng.background_r = decoder->infoPng.background_g = decoder->infoPng.background_b = 256 * data[0] + data[1];
+ }
+ else if(decoder->infoPng.color.colorType == 2 || decoder->infoPng.color.colorType == 6)
+ {
+ if(chunkLength != 6) { decoder->error = 45; break; } /*error: this chunk must be 6 bytes for greyscale image*/
+ decoder->infoPng.background_defined = 1;
+ decoder->infoPng.background_r = 256 * data[0] + data[1];
+ decoder->infoPng.background_g = 256 * data[2] + data[3];
+ decoder->infoPng.background_b = 256 * data[4] + data[5];
+ }
+ }
+ /*text chunk (tEXt)*/
+ else if(LodePNG_chunk_type_equals(chunk, "tEXt"))
+ {
+ if(decoder->settings.readTextChunks)
+ {
+ char *key = 0, *str = 0;
+
+ while(!decoder->error) /*not really a while loop, only used to break on error*/
+ {
+ unsigned length, string2_begin;
+
+ for(length = 0; length < chunkLength && data[length] != 0; length++) ;
+ if(length + 1 >= chunkLength) { decoder->error = 75; break; }
+ key = (char*)malloc(length + 1);
+ if(!key) { decoder->error = 9938; break; }
+ key[length] = 0;
+ for(i = 0; i < length; i++) key[i] = data[i];
+
+ string2_begin = length + 1;
+ if(string2_begin > chunkLength) { decoder->error = 75; break; }
+ length = chunkLength - string2_begin;
+ str = (char*)malloc(length + 1);
+ if(!str) { decoder->error = 9939; break; }
+ str[length] = 0;
+ for(i = 0; i < length; i++) str[i] = data[string2_begin + i];
+
+ decoder->error = LodePNG_Text_add(&decoder->infoPng.text, key, str);
+
+ break;
+ }
+
+ free(key);
+ free(str);
+ }
+ }
+ /*compressed text chunk (zTXt)*/
+ else if(LodePNG_chunk_type_equals(chunk, "zTXt"))
+ {
+ if(decoder->settings.readTextChunks)
+ {
+ unsigned length, string2_begin;
+ char *key = 0;
+ ucvector decoded;
+
+ ucvector_init(&decoded);
+
+ while(!decoder->error) /*not really a while loop, only used to break on error*/
+ {
+ for(length = 0; length < chunkLength && data[length] != 0; length++) ;
+ if(length + 2 >= chunkLength) { decoder->error = 75; break; }
+ key = (char*)malloc(length + 1);
+ if(!key) { decoder->error = 9940; break; }
+ key[length] = 0;
+ for(i = 0; i < length; i++) key[i] = data[i];
+
+ if(data[length + 1] != 0) { decoder->error = 72; break; } /*the 0 byte indicating compression must be 0*/
+
+ string2_begin = length + 2;
+ if(string2_begin > chunkLength) { decoder->error = 75; break; }
+ length = chunkLength - string2_begin;
+ decoder->error = LodePNG_decompress(&decoded.data, &decoded.size, (unsigned char*)(&data[string2_begin]), length, &decoder->settings.zlibsettings);
+ if(decoder->error) break;
+ ucvector_push_back(&decoded, 0);
+
+ decoder->error = LodePNG_Text_add(&decoder->infoPng.text, key, (char*)decoded.data);
+
+ break;
+ }
+
+ free(key);
+ ucvector_cleanup(&decoded);
+ if(decoder->error) break;
+ }
+ }
+ /*international text chunk (iTXt)*/
+ else if(LodePNG_chunk_type_equals(chunk, "iTXt"))
+ {
+ if(decoder->settings.readTextChunks)
+ {
+ unsigned length, begin, compressed;
+ char *key = 0, *langtag = 0, *transkey = 0;
+ ucvector decoded;
+ ucvector_init(&decoded);
+
+ while(!decoder->error) /*not really a while loop, only used to break on error*/
+ {
+ if(chunkLength < 5) { decoder->error = 76; break; }
+ for(length = 0; length < chunkLength && data[length] != 0; length++) ;
+ if(length + 2 >= chunkLength) { decoder->error = 75; break; }
+ key = (char*)malloc(length + 1);
+ if(!key) { decoder->error = 9941; break; }
+ key[length] = 0;
+ for(i = 0; i < length; i++) key[i] = data[i];
+
+ compressed = data[length + 1];
+ if(data[length + 2] != 0) { decoder->error = 72; break; } /*the 0 byte indicating compression must be 0*/
+
+ begin = length + 3;
+ length = 0;
+ for(i = begin; i < chunkLength && data[i] != 0; i++) length++;
+ if(begin + length + 1 >= chunkLength) { decoder->error = 75; break; }
+ langtag = (char*)malloc(length + 1);
+ if(!langtag) { decoder->error = 9942; break; }
+ langtag[length] = 0;
+ for(i = 0; i < length; i++) langtag[i] = data[begin + i];
+
+ begin += length + 1;
+ length = 0;
+ for(i = begin; i < chunkLength && data[i] != 0; i++) length++;
+ if(begin + length + 1 >= chunkLength) { decoder->error = 75; break; }
+ transkey = (char*)malloc(length + 1);
+ if(!transkey) { decoder->error = 9943; break; }
+ transkey[length] = 0;
+ for(i = 0; i < length; i++) transkey[i] = data[begin + i];
+
+ begin += length + 1;
+ if(begin > chunkLength) { decoder->error = 75; break; }
+ length = chunkLength - begin;
+
+ if(compressed)
+ {
+ decoder->error = LodePNG_decompress(&decoded.data, &decoded.size, (unsigned char*)(&data[begin]), length, &decoder->settings.zlibsettings);
+ if(decoder->error) break;
+ ucvector_push_back(&decoded, 0);
+ }
+ else
+ {
+ if(!ucvector_resize(&decoded, length + 1)) { decoder->error = 9944; break; }
+ decoded.data[length] = 0;
+ for(i = 0; i < length; i++) decoded.data[i] = data[begin + i];
+ }
+
+ decoder->error = LodePNG_IText_add(&decoder->infoPng.itext, key, langtag, transkey, (char*)decoded.data);
+
+ break;
+ }
+
+ free(key);
+ free(langtag);
+ free(transkey);
+ ucvector_cleanup(&decoded);
+ if(decoder->error) break;
+ }
+ }
+ else if(LodePNG_chunk_type_equals(chunk, "tIME"))
+ {
+ if(chunkLength != 7) { decoder->error = 73; break; }
+ decoder->infoPng.time_defined = 1;
+ decoder->infoPng.time.year = 256 * data[0] + data[+ 1];
+ decoder->infoPng.time.month = data[2];
+ decoder->infoPng.time.day = data[3];
+ decoder->infoPng.time.hour = data[4];
+ decoder->infoPng.time.minute = data[5];
+ decoder->infoPng.time.second = data[6];
+ }
+ else if(LodePNG_chunk_type_equals(chunk, "pHYs"))
+ {
+ if(chunkLength != 9) { decoder->error = 74; break; }
+ decoder->infoPng.phys_defined = 1;
+ decoder->infoPng.phys_x = 16777216 * data[0] + 65536 * data[1] + 256 * data[2] + data[3];
+ decoder->infoPng.phys_y = 16777216 * data[4] + 65536 * data[5] + 256 * data[6] + data[7];
+ decoder->infoPng.phys_unit = data[8];
+ }
+#endif /*LODEPNG_COMPILE_ANCILLARY_CHUNKS*/
+ else /*it's not an implemented chunk type, so ignore it: skip over the data*/
+ {
+ if(LodePNG_chunk_critical(chunk)) { decoder->error = 69; break; } /*error: unknown critical chunk (5th bit of first byte of chunk type is 0)*/
+ unknown = 1;
+#ifdef LODEPNG_COMPILE_UNKNOWN_CHUNKS
+ if(decoder->settings.rememberUnknownChunks)
+ {
+ LodePNG_UnknownChunks* unknown = &decoder->infoPng.unknown_chunks;
+ decoder->error = LodePNG_append_chunk(&unknown->data[critical_pos - 1], &unknown->datasize[critical_pos - 1], chunk);
+ if(decoder->error) break;
+ }
+#endif /*LODEPNG_COMPILE_UNKNOWN_CHUNKS*/
+ }
+
+ if(!decoder->settings.ignoreCrc && !unknown) /*check CRC if wanted, only on known chunk types*/
+ {
+ if(LodePNG_chunk_check_crc(chunk)) { decoder->error = 57; break; }
+ }
+
+ if(!IEND) chunk = LodePNG_chunk_next_const(chunk);
+ }
+
+ if(!decoder->error)
+ {
+ ucvector scanlines;
+ ucvector_init(&scanlines);
+ if(!ucvector_resize(&scanlines, ((decoder->infoPng.width * (decoder->infoPng.height * LodePNG_InfoColor_getBpp(&decoder->infoPng.color) + 7)) / 8) + decoder->infoPng.height)) decoder->error = 9945; /*maximum final image length is already reserved in the vector's length - this is not really necessary*/
+ if(!decoder->error) decoder->error = LodePNG_decompress(&scanlines.data, &scanlines.size, idat.data, idat.size, &decoder->settings.zlibsettings); /*decompress with the Zlib decompressor*/
+
+ if(!decoder->error)
+ {
+ ucvector outv;
+ ucvector_init(&outv);
+ if(!ucvector_resizev(&outv, (decoder->infoPng.height * decoder->infoPng.width * LodePNG_InfoColor_getBpp(&decoder->infoPng.color) + 7) / 8, 0)) decoder->error = 9946;
+ if(!decoder->error) decoder->error = postProcessScanlines(outv.data, scanlines.data, &decoder->infoPng);
+ *out = outv.data;
+ *outsize = outv.size;
+ }
+ ucvector_cleanup(&scanlines);
+ }
+
+ ucvector_cleanup(&idat);
+}
+
+void LodePNG_decode(LodePNG_Decoder* decoder, unsigned char** out, size_t* outsize, const unsigned char* in, size_t insize)
+{
+ *out = 0;
+ *outsize = 0;
+ decodeGeneric(decoder, out, outsize, in, insize);
+ if(decoder->error) return;
+ if(!decoder->settings.color_convert || LodePNG_InfoColor_equal(&decoder->infoRaw.color, &decoder->infoPng.color))
+ {
+ /*same color type, no copying or converting of data needed*/
+ /*store the infoPng color settings on the infoRaw so that the infoRaw still reflects what colorType
+ the raw image has to the end user*/
+ if(!decoder->settings.color_convert)
+ {
+ decoder->error = LodePNG_InfoColor_copy(&decoder->infoRaw.color, &decoder->infoPng.color);
+ if(decoder->error) return;
+ }
+ }
+ else
+ {
+ /*color conversion needed; sort of copy of the data*/
+ unsigned char* data = *out;
+
+ /*TODO: check if this works according to the statement in the documentation: "The converter can convert from greyscale input color type, to 8-bit greyscale or greyscale with alpha"*/
+ if(!(decoder->infoRaw.color.colorType == 2 || decoder->infoRaw.color.colorType == 6) && !(decoder->infoRaw.color.bitDepth == 8)) { decoder->error = 56; return; }
+
+ *outsize = (decoder->infoPng.width * decoder->infoPng.height * LodePNG_InfoColor_getBpp(&decoder->infoRaw.color) + 7) / 8;
+ *out = (unsigned char*)malloc(*outsize);
+ if(!(*out))
+ {
+ decoder->error = 9947;
+ *outsize = 0;
+ }
+ else decoder->error = LodePNG_convert(*out, data, &decoder->infoRaw.color, &decoder->infoPng.color, decoder->infoPng.width, decoder->infoPng.height);
+ free(data);
+ }
+}
+
+unsigned LodePNG_decode32(unsigned char** out, unsigned* w, unsigned* h, const unsigned char* in, size_t insize)
+{
+ unsigned error;
+ size_t dummy_size;
+ LodePNG_Decoder decoder;
+ LodePNG_Decoder_init(&decoder);
+ LodePNG_decode(&decoder, out, &dummy_size, in, insize);
+ error = decoder.error;
+ *w = decoder.infoPng.width;
+ *h = decoder.infoPng.height;
+ LodePNG_Decoder_cleanup(&decoder);
+ return error;
+}
+
+#ifdef LODEPNG_COMPILE_DISK
+unsigned LodePNG_decode32f(unsigned char** out, unsigned* w, unsigned* h, const char* filename)
+{
+ unsigned char* buffer;
+ size_t buffersize;
+ unsigned error;
+ error = LodePNG_loadFile(&buffer, &buffersize, filename);
+ if(!error) error = LodePNG_decode32(out, w, h, buffer, buffersize);
+ free(buffer);
+ return error;
+}
+#endif /*LODEPNG_COMPILE_DISK*/
+
+void LodePNG_DecodeSettings_init(LodePNG_DecodeSettings* settings)
+{
+ settings->color_convert = 1;
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+ settings->readTextChunks = 1;
+#endif /*LODEPNG_COMPILE_ANCILLARY_CHUNKS*/
+ settings->ignoreCrc = 0;
+#ifdef LODEPNG_COMPILE_UNKNOWN_CHUNKS
+ settings->rememberUnknownChunks = 0;
+#endif /*LODEPNG_COMPILE_UNKNOWN_CHUNKS*/
+ LodeZlib_DecompressSettings_init(&settings->zlibsettings);
+}
+
+void LodePNG_Decoder_init(LodePNG_Decoder* decoder)
+{
+ LodePNG_DecodeSettings_init(&decoder->settings);
+ LodePNG_InfoRaw_init(&decoder->infoRaw);
+ LodePNG_InfoPng_init(&decoder->infoPng);
+ decoder->error = 1;
+}
+
+void LodePNG_Decoder_cleanup(LodePNG_Decoder* decoder)
+{
+ LodePNG_InfoRaw_cleanup(&decoder->infoRaw);
+ LodePNG_InfoPng_cleanup(&decoder->infoPng);
+}
+
+void LodePNG_Decoder_copy(LodePNG_Decoder* dest, const LodePNG_Decoder* source)
+{
+ LodePNG_Decoder_cleanup(dest);
+ *dest = *source;
+ LodePNG_InfoRaw_init(&dest->infoRaw);
+ LodePNG_InfoPng_init(&dest->infoPng);
+ dest->error = LodePNG_InfoRaw_copy(&dest->infoRaw, &source->infoRaw); if(dest->error) return;
+ dest->error = LodePNG_InfoPng_copy(&dest->infoPng, &source->infoPng); if(dest->error) return;
+}
+
+#endif /*LODEPNG_COMPILE_DECODER*/
+
+#ifdef LODEPNG_COMPILE_ENCODER
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* / PNG Encoder / */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+/*chunkName must be string of 4 characters*/
+static unsigned addChunk(ucvector* out, const char* chunkName, const unsigned char* data, size_t length)
+{
+ unsigned error = LodePNG_create_chunk(&out->data, &out->size, (unsigned)length, chunkName, data);
+ if(error) return error;
+ out->allocsize = out->size; /*fix the allocsize again*/
+ return 0;
+}
+
+static void writeSignature(ucvector* out)
+{
+ /*8 bytes PNG signature*/
+ ucvector_push_back(out, 137);
+ ucvector_push_back(out, 80);
+ ucvector_push_back(out, 78);
+ ucvector_push_back(out, 71);
+ ucvector_push_back(out, 13);
+ ucvector_push_back(out, 10);
+ ucvector_push_back(out, 26);
+ ucvector_push_back(out, 10);
+}
+
+static unsigned addChunk_IHDR(ucvector* out, unsigned w, unsigned h, unsigned bitDepth, unsigned colorType, unsigned interlaceMethod)
+{
+ unsigned error = 0;
+ ucvector header;
+ ucvector_init(&header);
+
+ LodePNG_add32bitInt(&header, w); /*width*/
+ LodePNG_add32bitInt(&header, h); /*height*/
+ ucvector_push_back(&header, (unsigned char)bitDepth); /*bit depth*/
+ ucvector_push_back(&header, (unsigned char)colorType); /*color type*/
+ ucvector_push_back(&header, 0); /*compression method*/
+ ucvector_push_back(&header, 0); /*filter method*/
+ ucvector_push_back(&header, interlaceMethod); /*interlace method*/
+
+ error = addChunk(out, "IHDR", header.data, header.size);
+ ucvector_cleanup(&header);
+
+ return error;
+}
+
+static unsigned addChunk_PLTE(ucvector* out, const LodePNG_InfoColor* info)
+{
+ unsigned error = 0;
+ size_t i;
+ ucvector PLTE;
+ ucvector_init(&PLTE);
+ for(i = 0; i < info->palettesize * 4; i++) if(i % 4 != 3) ucvector_push_back(&PLTE, info->palette[i]); /*add all channels except alpha channel*/
+ error = addChunk(out, "PLTE", PLTE.data, PLTE.size);
+ ucvector_cleanup(&PLTE);
+
+ return error;
+}
+
+static unsigned addChunk_tRNS(ucvector* out, const LodePNG_InfoColor* info)
+{
+ unsigned error = 0;
+ size_t i;
+ ucvector tRNS;
+ ucvector_init(&tRNS);
+ if(info->colorType == 3)
+ {
+ for(i = 0; i < info->palettesize; i++) ucvector_push_back(&tRNS, info->palette[4 * i + 3]); /*add only alpha channel*/
+ }
+ else if(info->colorType == 0)
+ {
+ if(info->key_defined)
+ {
+ ucvector_push_back(&tRNS, (unsigned char)(info->key_r / 256));
+ ucvector_push_back(&tRNS, (unsigned char)(info->key_r % 256));
+ }
+ }
+ else if(info->colorType == 2)
+ {
+ if(info->key_defined)
+ {
+ ucvector_push_back(&tRNS, (unsigned char)(info->key_r / 256));
+ ucvector_push_back(&tRNS, (unsigned char)(info->key_r % 256));
+ ucvector_push_back(&tRNS, (unsigned char)(info->key_g / 256));
+ ucvector_push_back(&tRNS, (unsigned char)(info->key_g % 256));
+ ucvector_push_back(&tRNS, (unsigned char)(info->key_b / 256));
+ ucvector_push_back(&tRNS, (unsigned char)(info->key_b % 256));
+ }
+ }
+
+ error = addChunk(out, "tRNS", tRNS.data, tRNS.size);
+ ucvector_cleanup(&tRNS);
+
+ return error;
+}
+
+static unsigned addChunk_IDAT(ucvector* out, const unsigned char* data, size_t datasize, LodeZlib_DeflateSettings* zlibsettings)
+{
+ ucvector zlibdata;
+ unsigned error = 0;
+
+ /*compress with the Zlib compressor*/
+ ucvector_init(&zlibdata);
+ error = LodePNG_compress(&zlibdata.data, &zlibdata.size, data, datasize, zlibsettings);
+ if(!error) error = addChunk(out, "IDAT", zlibdata.data, zlibdata.size);
+ ucvector_cleanup(&zlibdata);
+
+ return error;
+}
+
+static unsigned addChunk_IEND(ucvector* out)
+{
+ unsigned error = 0;
+ error = addChunk(out, "IEND", 0, 0);
+ return error;
+}
+
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+
+static unsigned addChunk_tEXt(ucvector* out, const char* keyword, const char* textstring) /*add text chunk*/
+{
+ unsigned error = 0;
+ size_t i;
+ ucvector text;
+ ucvector_init(&text);
+ for(i = 0; keyword[i] != 0; i++) ucvector_push_back(&text, (unsigned char)keyword[i]);
+ ucvector_push_back(&text, 0);
+ for(i = 0; textstring[i] != 0; i++) ucvector_push_back(&text, (unsigned char)textstring[i]);
+ error = addChunk(out, "tEXt", text.data, text.size);
+ ucvector_cleanup(&text);
+
+ return error;
+}
+
+static unsigned addChunk_zTXt(ucvector* out, const char* keyword, const char* textstring, LodeZlib_DeflateSettings* zlibsettings)
+{
+ unsigned error = 0;
+ ucvector data, compressed;
+ size_t i, textsize = strlen(textstring);
+
+ ucvector_init(&data);
+ ucvector_init(&compressed);
+ for(i = 0; keyword[i] != 0; i++) ucvector_push_back(&data, (unsigned char)keyword[i]);
+ ucvector_push_back(&data, 0); /* 0 termination char*/
+ ucvector_push_back(&data, 0); /*compression method: 0*/
+
+ error = LodePNG_compress(&compressed.data, &compressed.size, (unsigned char*)textstring, textsize, zlibsettings);
+ if(!error)
+ {
+ for(i = 0; i < compressed.size; i++) ucvector_push_back(&data, compressed.data[i]);
+ error = addChunk(out, "zTXt", data.data, data.size);
+ }
+
+ ucvector_cleanup(&compressed);
+ ucvector_cleanup(&data);
+ return error;
+}
+
+static unsigned addChunk_iTXt(ucvector* out, unsigned compressed, const char* keyword, const char* langtag, const char* transkey, const char* textstring, LodeZlib_DeflateSettings* zlibsettings)
+{
+ unsigned error = 0;
+ ucvector data, compressed_data;
+ size_t i, textsize = strlen(textstring);
+
+ ucvector_init(&data);
+
+ for(i = 0; keyword[i] != 0; i++) ucvector_push_back(&data, (unsigned char)keyword[i]);
+ ucvector_push_back(&data, 0); /*null termination char*/
+ ucvector_push_back(&data, compressed ? 1 : 0); /*compression flag*/
+ ucvector_push_back(&data, 0); /*compression method*/
+ for(i = 0; langtag[i] != 0; i++) ucvector_push_back(&data, (unsigned char)langtag[i]);
+ ucvector_push_back(&data, 0); /*null termination char*/
+ for(i = 0; transkey[i] != 0; i++) ucvector_push_back(&data, (unsigned char)transkey[i]);
+ ucvector_push_back(&data, 0); /*null termination char*/
+
+ if(compressed)
+ {
+ ucvector_init(&compressed_data);
+ error = LodePNG_compress(&compressed_data.data, &compressed_data.size, (unsigned char*)textstring, textsize, zlibsettings);
+ if(!error)
+ {
+ for(i = 0; i < compressed_data.size; i++) ucvector_push_back(&data, compressed_data.data[i]);
+ for(i = 0; textstring[i] != 0; i++) ucvector_push_back(&data, (unsigned char)textstring[i]);
+ }
+ }
+ else /*not compressed*/
+ {
+ for(i = 0; textstring[i] != 0; i++) ucvector_push_back(&data, (unsigned char)textstring[i]);
+ }
+
+ if(!error) error = addChunk(out, "iTXt", data.data, data.size);
+ ucvector_cleanup(&data);
+ return error;
+}
+
+static unsigned addChunk_bKGD(ucvector* out, const LodePNG_InfoPng* info)
+{
+ unsigned error = 0;
+ ucvector bKGD;
+ ucvector_init(&bKGD);
+ if(info->color.colorType == 0 || info->color.colorType == 4)
+ {
+ ucvector_push_back(&bKGD, (unsigned char)(info->background_r / 256));
+ ucvector_push_back(&bKGD, (unsigned char)(info->background_r % 256));
+ }
+ else if(info->color.colorType == 2 || info->color.colorType == 6)
+ {
+ ucvector_push_back(&bKGD, (unsigned char)(info->background_r / 256));
+ ucvector_push_back(&bKGD, (unsigned char)(info->background_r % 256));
+ ucvector_push_back(&bKGD, (unsigned char)(info->background_g / 256));
+ ucvector_push_back(&bKGD, (unsigned char)(info->background_g % 256));
+ ucvector_push_back(&bKGD, (unsigned char)(info->background_b / 256));
+ ucvector_push_back(&bKGD, (unsigned char)(info->background_b % 256));
+ }
+ else if(info->color.colorType == 3)
+ {
+ ucvector_push_back(&bKGD, (unsigned char)(info->background_r % 256)); /*palette index*/
+ }
+
+ error = addChunk(out, "bKGD", bKGD.data, bKGD.size);
+ ucvector_cleanup(&bKGD);
+
+ return error;
+}
+
+static unsigned addChunk_tIME(ucvector* out, const LodePNG_Time* time)
+{
+ unsigned error = 0;
+ unsigned char* data = (unsigned char*)malloc(7);
+ if(!data) return 9948;
+ data[0] = (unsigned char)(time->year / 256);
+ data[1] = (unsigned char)(time->year % 256);
+ data[2] = time->month;
+ data[3] = time->day;
+ data[4] = time->hour;
+ data[5] = time->minute;
+ data[6] = time->second;
+ error = addChunk(out, "tIME", data, 7);
+ free(data);
+ return error;
+}
+
+static unsigned addChunk_pHYs(ucvector* out, const LodePNG_InfoPng* info)
+{
+ unsigned error = 0;
+ ucvector data;
+ ucvector_init(&data);
+
+ LodePNG_add32bitInt(&data, info->phys_x);
+ LodePNG_add32bitInt(&data, info->phys_y);
+ ucvector_push_back(&data, info->phys_unit);
+
+ error = addChunk(out, "pHYs", data.data, data.size);
+ ucvector_cleanup(&data);
+
+ return error;
+}
+
+#endif /*LODEPNG_COMPILE_ANCILLARY_CHUNKS*/
+
+static void filterScanline(unsigned char* out, const unsigned char* scanline, const unsigned char* prevline, size_t length, size_t bytewidth, unsigned char filterType)
+{
+ size_t i;
+ switch(filterType)
+ {
+ case 0:
+ if(prevline) for(i = 0; i < length; i++) out[i] = scanline[i];
+ else for(i = 0; i < length; i++) out[i] = scanline[i];
+ break;
+ case 1:
+ if(prevline)
+ {
+ for(i = 0; i < bytewidth; i++) out[i] = scanline[i];
+ for(i = bytewidth; i < length ; i++) out[i] = scanline[i] - scanline[i - bytewidth];
+ }
+ else
+ {
+ for(i = 0; i < bytewidth; i++) out[i] = scanline[i];
+ for(i = bytewidth; i < length; i++) out[i] = scanline[i] - scanline[i - bytewidth];
+ }
+ break;
+ case 2:
+ if(prevline) for(i = 0; i < length; i++) out[i] = scanline[i] - prevline[i];
+ else for(i = 0; i < length; i++) out[i] = scanline[i];
+ break;
+ case 3:
+ if(prevline)
+ {
+ for(i = 0; i < bytewidth; i++) out[i] = scanline[i] - prevline[i] / 2;
+ for(i = bytewidth; i < length; i++) out[i] = scanline[i] - ((scanline[i - bytewidth] + prevline[i]) / 2);
+ }
+ else
+ {
+ for(i = 0; i < length; i++) out[i] = scanline[i];
+ for(i = bytewidth; i < length; i++) out[i] = scanline[i] - scanline[i - bytewidth] / 2;
+ }
+ break;
+ case 4:
+ if(prevline)
+ {
+ for(i = 0; i < bytewidth; i++) out[i] = (unsigned char)(scanline[i] - paethPredictor(0, prevline[i], 0));
+ for(i = bytewidth; i < length; i++) out[i] = (unsigned char)(scanline[i] - paethPredictor(scanline[i - bytewidth], prevline[i], prevline[i - bytewidth]));
+ }
+ else
+ {
+ for(i = 0; i < bytewidth; i++) out[i] = scanline[i];
+ for(i = bytewidth; i < length; i++) out[i] = (unsigned char)(scanline[i] - paethPredictor(scanline[i - bytewidth], 0, 0));
+ }
+ break;
+ default: return; /*unexisting filter type given*/
+ }
+}
+
+static unsigned filter(unsigned char* out, const unsigned char* in, unsigned w, unsigned h, const LodePNG_InfoColor* info)
+{
+ /*
+ For PNG filter method 0
+ out must be a buffer with as size: h + (w * h * bpp + 7) / 8, because there are the scanlines with 1 extra byte per scanline
+
+ There is a nice heuristic described here: http://www.cs.toronto.edu/~cosmin/pngtech/optipng.html. It says:
+ * If the image type is Palette, or the bit depth is smaller than 8, then do not filter the image (i.e. use fixed filtering, with the filter None).
+ * (The other case) If the image type is Grayscale or RGB (with or without Alpha), and the bit depth is not smaller than 8, then use adaptive filtering heuristic as follows: independently for each row, apply all five filters and select the filter that produces the smallest sum of absolute values per row.
+
+ Here the above method is used mostly. Note though that it appears to be better to use the adaptive filtering on the plasma 8-bit palette example, but that image isn't the best reference for palette images in general.
+ */
+
+ unsigned bpp = LodePNG_InfoColor_getBpp(info);
+ size_t linebytes = (w * bpp + 7) / 8; /*the width of a scanline in bytes, not including the filter type*/
+ size_t bytewidth = (bpp + 7) / 8; /*bytewidth is used for filtering, is 1 when bpp < 8, number of bytes per pixel otherwise*/
+ const unsigned char* prevline = 0;
+ unsigned x, y;
+ unsigned heuristic;
+ unsigned error = 0;
+
+ if(bpp == 0) return 31; /*invalid color type*/
+
+ /*choose heuristic as described above*/
+ if(info->colorType == 3 || info->bitDepth < 8) heuristic = 0;
+ else heuristic = 1;
+
+ if(heuristic == 0) /*None filtertype for everything*/
+ {
+ for(y = 0; y < h; y++)
+ {
+ size_t outindex = (1 + linebytes) * y; /*the extra filterbyte added to each row*/
+ size_t inindex = linebytes * y;
+ const unsigned TYPE = 0;
+ out[outindex] = TYPE; /*filter type byte*/
+ filterScanline(&out[outindex + 1], &in[inindex], prevline, linebytes, bytewidth, TYPE);
+ prevline = &in[inindex];
+ }
+ }
+ else if(heuristic == 1) /*adaptive filtering*/
+ {
+ size_t sum[5];
+ ucvector attempt[5]; /*five filtering attempts, one for each filter type*/
+ size_t smallest = 0;
+ unsigned type, bestType = 0;
+
+ for(type = 0; type < 5; type++) ucvector_init(&attempt[type]);
+ for(type = 0; type < 5; type++)
+ {
+ if(!ucvector_resize(&attempt[type], linebytes)) { error = 9949; break; }
+ }
+
+ if(!error)
+ {
+ for(y = 0; y < h; y++)
+ {
+ /*try the 5 filter types*/
+ for(type = 0; type < 5; type++)
+ {
+ filterScanline(attempt[type].data, &in[y * linebytes], prevline, linebytes, bytewidth, type);
+
+ /*calculate the sum of the result*/
+ sum[type] = 0;
+ for(x = 0; x < attempt[type].size; x+=3) sum[type] += attempt[type].data[x]; /*note that not all pixels are checked to speed this up while still having probably the best choice*/
+
+ /*check if this is smallest sum (or if type == 0 it's the first case so always store the values)*/
+ if(type == 0 || sum[type] < smallest)
+ {
+ bestType = type;
+ smallest = sum[type];
+ }
+ }
+
+ prevline = &in[y * linebytes];
+
+ /*now fill the out values*/
+ out[y * (linebytes + 1)] = bestType; /*the first byte of a scanline will be the filter type*/
+ for(x = 0; x < linebytes; x++) out[y * (linebytes + 1) + 1 + x] = attempt[bestType].data[x];
+ }
+ }
+
+ for(type = 0; type < 5; type++) ucvector_cleanup(&attempt[type]);
+ }
+ #if 0 /*deflate the scanline with a fixed tree after every filter attempt to see which one deflates best. This is slow, and _does not work as expected_: the heuristic gives smaller result!*/
+ else if(heuristic == 2) /*adaptive filtering by using deflate*/
+ {
+ size_t size[5];
+ ucvector attempt[5]; /*five filtering attempts, one for each filter type*/
+ size_t smallest;
+ unsigned type = 0, bestType = 0;
+ unsigned char* dummy;
+ LodeZlib_DeflateSettings deflatesettings = LodeZlib_defaultDeflateSettings;
+ deflatesettings.btype = 1; /*use fixed tree on the attempts so that the tree is not adapted to the filtertype on purpose, to simulate the true case where the tree is the same for the whole image*/
+ for(type = 0; type < 5; type++) { ucvector_init(&attempt[type]); ucvector_resize(&attempt[type], linebytes); }
+ for(y = 0; y < h; y++) /*try the 5 filter types*/
+ {
+ for(type = 0; type < 5; type++)
+ {
+ filterScanline(attempt[type].data, &in[y * linebytes], prevline, linebytes, bytewidth, type);
+ size[type] = 0; dummy = 0;
+ LodePNG_compress(&dummy, &size[type], attempt[type].data, attempt[type].size, &deflatesettings);
+ free(dummy);
+ /*check if this is smallest size (or if type == 0 it's the first case so always store the values)*/
+ if(type == 0 || size[type] < smallest) { bestType = type; smallest = size[type]; }
+ }
+ prevline = &in[y * linebytes];
+ out[y * (linebytes + 1)] = bestType; /*the first byte of a scanline will be the filter type*/
+ for(x = 0; x < linebytes; x++) out[y * (linebytes + 1) + 1 + x] = attempt[bestType].data[x];
+ }
+ for(type = 0; type < 5; type++) ucvector_cleanup(&attempt[type]);
+ }
+ #endif
+
+ return error;
+}
+
+static void addPaddingBits(unsigned char* out, const unsigned char* in, size_t olinebits, size_t ilinebits, unsigned h)
+{
+ /*The opposite of the removePaddingBits function
+ olinebits must be >= ilinebits*/
+ unsigned y;
+ size_t diff = olinebits - ilinebits;
+ size_t obp = 0, ibp = 0; /*bit pointers*/
+ for(y = 0; y < h; y++)
+ {
+ size_t x;
+ for(x = 0; x < ilinebits; x++)
+ {
+ unsigned char bit = readBitFromReversedStream(&ibp, in);
+ setBitOfReversedStream(&obp, out, bit);
+ }
+ /*obp += diff; --> no, fill in some value in the padding bits too, to avoid "Use of uninitialised value of size ###" warning from valgrind*/
+ for(x = 0; x < diff; x++) setBitOfReversedStream(&obp, out, 0);
+ }
+}
+
+static void Adam7_interlace(unsigned char* out, const unsigned char* in, unsigned w, unsigned h, unsigned bpp)
+{
+ /*Note: this function works on image buffers WITHOUT padding bits at end of scanlines with non-multiple-of-8 bit amounts, only between reduced images is padding*/
+ unsigned passw[7], passh[7]; size_t filter_passstart[8], padded_passstart[8], passstart[8];
+ unsigned i;
+
+ Adam7_getpassvalues(passw, passh, filter_passstart, padded_passstart, passstart, w, h, bpp);
+
+ if(bpp >= 8)
+ {
+ for(i = 0; i < 7; i++)
+ {
+ unsigned x, y, b;
+ size_t bytewidth = bpp / 8;
+ for(y = 0; y < passh[i]; y++)
+ for(x = 0; x < passw[i]; x++)
+ {
+ size_t pixelinstart = ((ADAM7_IY[i] + y * ADAM7_DY[i]) * w + ADAM7_IX[i] + x * ADAM7_DX[i]) * bytewidth;
+ size_t pixeloutstart = passstart[i] + (y * passw[i] + x) * bytewidth;
+ for(b = 0; b < bytewidth; b++)
+ {
+ out[pixeloutstart + b] = in[pixelinstart + b];
+ }
+ }
+ }
+ }
+ else /*bpp < 8: Adam7 with pixels < 8 bit is a bit trickier: with bit pointers*/
+ {
+ for(i = 0; i < 7; i++)
+ {
+ unsigned x, y, b;
+ unsigned ilinebits = bpp * passw[i];
+ unsigned olinebits = bpp * w;
+ size_t obp, ibp; /*bit pointers (for out and in buffer)*/
+ for(y = 0; y < passh[i]; y++)
+ for(x = 0; x < passw[i]; x++)
+ {
+ ibp = (ADAM7_IY[i] + y * ADAM7_DY[i]) * olinebits + (ADAM7_IX[i] + x * ADAM7_DX[i]) * bpp;
+ obp = (8 * passstart[i]) + (y * ilinebits + x * bpp);
+ for(b = 0; b < bpp; b++)
+ {
+ unsigned char bit = readBitFromReversedStream(&ibp, in);
+ setBitOfReversedStream(&obp, out, bit);
+ }
+ }
+ }
+ }
+}
+
+/*out must be buffer big enough to contain uncompressed IDAT chunk data, and in must contain the full image*/
+static unsigned preProcessScanlines(unsigned char** out, size_t* outsize, const unsigned char* in, const LodePNG_InfoPng* infoPng) /*return value is error*/
+{
+ /*
+ This function converts the pure 2D image with the PNG's colortype, into filtered-padded-interlaced data. Steps:
+ *) if no Adam7: 1) add padding bits (= posible extra bits per scanline if bpp < 8) 2) filter
+ *) if adam7: 1) Adam7_interlace 2) 7x add padding bits 3) 7x filter
+ */
+ unsigned bpp = LodePNG_InfoColor_getBpp(&infoPng->color);
+ unsigned w = infoPng->width;
+ unsigned h = infoPng->height;
+ unsigned error = 0;
+
+ if(infoPng->interlaceMethod == 0)
+ {
+ *outsize = h + (h * ((w * bpp + 7) / 8)); /*image size plus an extra byte per scanline + possible padding bits*/
+ *out = (unsigned char*)malloc(*outsize);
+ if(!(*out) && (*outsize)) error = 9950;
+
+ if(!error)
+ {
+ if(bpp < 8 && w * bpp != ((w * bpp + 7) / 8) * 8) /*non multiple of 8 bits per scanline, padding bits needed per scanline*/
+ {
+ ucvector padded;
+ ucvector_init(&padded);
+ if(!ucvector_resize(&padded, h * ((w * bpp + 7) / 8))) error = 9951;
+ if(!error)
+ {
+ addPaddingBits(padded.data, in, ((w * bpp + 7) / 8) * 8, w * bpp, h);
+ error = filter(*out, padded.data, w, h, &infoPng->color);
+ }
+ ucvector_cleanup(&padded);
+ }
+ else error = filter(*out, in, w, h, &infoPng->color); /*we can immediatly filter into the out buffer, no other steps needed*/
+ }
+ }
+ else /*interlaceMethod is 1 (Adam7)*/
+ {
+ unsigned char* adam7 = (unsigned char*)malloc((h * w * bpp + 7) / 8);
+ if(!adam7 && ((h * w * bpp + 7) / 8)) error = 9952; /*malloc failed*/
+
+ while(!error) /*not a real while loop, used to break out to cleanup to avoid a goto*/
+ {
+ unsigned passw[7], passh[7]; size_t filter_passstart[8], padded_passstart[8], passstart[8];
+ unsigned i;
+
+ Adam7_getpassvalues(passw, passh, filter_passstart, padded_passstart, passstart, w, h, bpp);
+
+ *outsize = filter_passstart[7]; /*image size plus an extra byte per scanline + possible padding bits*/
+ *out = (unsigned char*)malloc(*outsize);
+ if(!(*out) && (*outsize)) { error = 9953; break; }
+
+ Adam7_interlace(adam7, in, w, h, bpp);
+
+ for(i = 0; i < 7; i++)
+ {
+ if(bpp < 8)
+ {
+ ucvector padded;
+ ucvector_init(&padded);
+ if(!ucvector_resize(&padded, h * ((w * bpp + 7) / 8))) error = 9954;
+ if(!error)
+ {
+ addPaddingBits(&padded.data[padded_passstart[i]], &adam7[passstart[i]], ((passw[i] * bpp + 7) / 8) * 8, passw[i] * bpp, passh[i]);
+ error = filter(&(*out)[filter_passstart[i]], &padded.data[padded_passstart[i]], passw[i], passh[i], &infoPng->color);
+ }
+
+ ucvector_cleanup(&padded);
+ }
+ else
+ {
+ error = filter(&(*out)[filter_passstart[i]], &adam7[padded_passstart[i]], passw[i], passh[i], &infoPng->color);
+ }
+ }
+
+ break;
+ }
+
+ free(adam7);
+ }
+
+ return error;
+}
+
+/*palette must have 4 * palettesize bytes allocated*/
+static unsigned isPaletteFullyOpaque(const unsigned char* palette, size_t palettesize) /*palette given in format RGBARGBARGBARGBA...*/
+{
+ size_t i;
+ for(i = 0; i < palettesize; i++)
+ {
+ if(palette[4 * i + 3] != 255) return 0;
+ }
+ return 1;
+}
+
+/*this function checks if the input image given by the user has no transparent pixels*/
+static unsigned isFullyOpaque(const unsigned char* image, unsigned w, unsigned h, const LodePNG_InfoColor* info)
+{
+ /*TODO: When the user specified a color key for the input image, then this function must also check for pixels that are the same as the color key and treat those as transparent.*/
+
+ unsigned i, numpixels = w * h;
+ if(info->colorType == 6)
+ {
+ if(info->bitDepth == 8)
+ {
+ for(i = 0; i < numpixels; i++) if(image[i * 4 + 3] != 255) return 0;
+ }
+ else
+ {
+ for(i = 0; i < numpixels; i++) if(image[i * 8 + 6] != 255 || image[i * 8 + 7] != 255) return 0;
+ }
+ return 1; /*no single pixel with alpha channel other than 255 found*/
+ }
+ else if(info->colorType == 4)
+ {
+ if(info->bitDepth == 8)
+ {
+ for(i = 0; i < numpixels; i++) if(image[i * 2 + 1] != 255) return 0;
+ }
+ else
+ {
+ for(i = 0; i < numpixels; i++) if(image[i * 4 + 2] != 255 || image[i * 4 + 3] != 255) return 0;
+ }
+ return 1; /*no single pixel with alpha channel other than 255 found*/
+ }
+ else if(info->colorType == 3)
+ {
+ /*when there's a palette, we could check every pixel for translucency, but much quicker is to just check the palette*/
+ return(isPaletteFullyOpaque(info->palette, info->palettesize));
+ }
+
+ return 0; /*color type that isn't supported by this function yet, so assume there is transparency to be safe*/
+}
+
+#ifdef LODEPNG_COMPILE_UNKNOWN_CHUNKS
+static unsigned addUnknownChunks(ucvector* out, unsigned char* data, size_t datasize)
+{
+ unsigned char* inchunk = data;
+ while((size_t)(inchunk - data) < datasize)
+ {
+ unsigned error = LodePNG_append_chunk(&out->data, &out->size, inchunk);
+ if(error) return error; /*error: not enough memory*/
+ out->allocsize = out->size; /*fix the allocsize again*/
+ inchunk = LodePNG_chunk_next(inchunk);
+ }
+ return 0;
+}
+#endif /*LODEPNG_COMPILE_UNKNOWN_CHUNKS*/
+
+void LodePNG_encode(LodePNG_Encoder* encoder, unsigned char** out, size_t* outsize, const unsigned char* image, unsigned w, unsigned h)
+{
+ LodePNG_InfoPng info;
+ ucvector outv;
+ unsigned char* data = 0; /*uncompressed version of the IDAT chunk data*/
+ size_t datasize = 0;
+
+ /*provide some proper output values if error will happen*/
+ *out = 0;
+ *outsize = 0;
+ encoder->error = 0;
+
+ info = encoder->infoPng; /*UNSAFE copy to avoid having to cleanup! but we will only change primitive parameters, and not invoke the cleanup function nor touch the palette's buffer so we use it safely*/
+ info.width = w;
+ info.height = h;
+
+ if(encoder->settings.autoLeaveOutAlphaChannel && isFullyOpaque(image, w, h, &encoder->infoRaw.color))
+ {
+ /*go to a color type without alpha channel*/
+ if(info.color.colorType == 6) info.color.colorType = 2;
+ else if(info.color.colorType == 4) info.color.colorType = 0;
+ }
+
+ if(encoder->settings.zlibsettings.windowSize > 32768) { encoder->error = 60; return; } /*error: windowsize larger than allowed*/
+ if(encoder->settings.zlibsettings.btype > 2) { encoder->error = 61; return; } /*error: unexisting btype*/
+ if(encoder->infoPng.interlaceMethod > 1) { encoder->error = 71; return; } /*error: unexisting interlace mode*/
+ if((encoder->error = checkColorValidity(info.color.colorType, info.color.bitDepth))) return; /*error: unexisting color type given*/
+ if((encoder->error = checkColorValidity(encoder->infoRaw.color.colorType, encoder->infoRaw.color.bitDepth))) return; /*error: unexisting color type given*/
+
+ if(!LodePNG_InfoColor_equal(&encoder->infoRaw.color, &info.color))
+ {
+ unsigned char* converted;
+ size_t size = (w * h * LodePNG_InfoColor_getBpp(&info.color) + 7) / 8;
+
+ if((info.color.colorType != 6 && info.color.colorType != 2) || (info.color.bitDepth != 8)) { encoder->error = 59; return; } /*for the output image, only these types are supported*/
+ converted = (unsigned char*)malloc(size);
+ if(!converted && size) encoder->error = 9955; /*error: malloc failed*/
+ if(!encoder->error) encoder->error = LodePNG_convert(converted, image, &info.color, &encoder->infoRaw.color, w, h);
+ if(!encoder->error) preProcessScanlines(&data, &datasize, converted, &info);/*filter(data.data, converted.data, w, h, LodePNG_InfoColor_getBpp(&info.color));*/
+ free(converted);
+ }
+ else preProcessScanlines(&data, &datasize, image, &info);/*filter(data.data, image, w, h, LodePNG_InfoColor_getBpp(&info.color));*/
+
+ ucvector_init(&outv);
+ while(!encoder->error) /*not really a while loop, this is only used to break out if an error happens to avoid goto's to do the ucvector cleanup*/
+ {
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+ size_t i;
+#endif /*LODEPNG_COMPILE_ANCILLARY_CHUNKS*/
+ /*write signature and chunks*/
+ writeSignature(&outv);
+ /*IHDR*/
+ addChunk_IHDR(&outv, w, h, info.color.bitDepth, info.color.colorType, info.interlaceMethod);
+#ifdef LODEPNG_COMPILE_UNKNOWN_CHUNKS
+ /*unknown chunks between IHDR and PLTE*/
+ if(info.unknown_chunks.data[0]) { encoder->error = addUnknownChunks(&outv, info.unknown_chunks.data[0], info.unknown_chunks.datasize[0]); if(encoder->error) break; }
+#endif /*LODEPNG_COMPILE_UNKNOWN_CHUNKS*/
+ /*PLTE*/
+ if(info.color.colorType == 3)
+ {
+ if(info.color.palettesize == 0 || info.color.palettesize > 256) { encoder->error = 68; break; }
+ addChunk_PLTE(&outv, &info.color);
+ }
+ if(encoder->settings.force_palette && (info.color.colorType == 2 || info.color.colorType == 6))
+ {
+ if(info.color.palettesize == 0 || info.color.palettesize > 256) { encoder->error = 68; break; }
+ addChunk_PLTE(&outv, &info.color);
+ }
+ /*tRNS*/
+ if(info.color.colorType == 3 && !isPaletteFullyOpaque(info.color.palette, info.color.palettesize)) addChunk_tRNS(&outv, &info.color);
+ if((info.color.colorType == 0 || info.color.colorType == 2) && info.color.key_defined) addChunk_tRNS(&outv, &info.color);
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+ /*bKGD (must come between PLTE and the IDAt chunks*/
+ if(info.background_defined) addChunk_bKGD(&outv, &info);
+ /*pHYs (must come before the IDAT chunks)*/
+ if(info.phys_defined) addChunk_pHYs(&outv, &info);
+#endif /*LODEPNG_COMPILE_ANCILLARY_CHUNKS*/
+#ifdef LODEPNG_COMPILE_UNKNOWN_CHUNKS
+ /*unknown chunks between PLTE and IDAT*/
+ if(info.unknown_chunks.data[1]) { encoder->error = addUnknownChunks(&outv, info.unknown_chunks.data[1], info.unknown_chunks.datasize[1]); if(encoder->error) break; }
+#endif /*LODEPNG_COMPILE_UNKNOWN_CHUNKS*/
+ /*IDAT (multiple IDAT chunks must be consecutive)*/
+ encoder->error = addChunk_IDAT(&outv, data, datasize, &encoder->settings.zlibsettings);
+ if(encoder->error) break;
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+ /*tIME*/
+ if(info.time_defined) addChunk_tIME(&outv, &info.time);
+ /*tEXt and/or zTXt*/
+ for(i = 0; i < info.text.num; i++)
+ {
+ if(strlen(info.text.keys[i]) > 79) { encoder->error = 66; break; }
+ if(strlen(info.text.keys[i]) < 1) { encoder->error = 67; break; }
+ if(encoder->settings.text_compression)
+ addChunk_zTXt(&outv, info.text.keys[i], info.text.strings[i], &encoder->settings.zlibsettings);
+ else
+ addChunk_tEXt(&outv, info.text.keys[i], info.text.strings[i]);
+ }
+ /*LodePNG version id in text chunk*/
+ if(encoder->settings.add_id)
+ {
+ unsigned alread_added_id_text = 0;
+ for(i = 0; i < info.text.num; i++)
+ if(!strcmp(info.text.keys[i], "LodePNG")) { alread_added_id_text = 1; break; }
+ if(alread_added_id_text == 0)
+ addChunk_tEXt(&outv, "LodePNG", VERSION_STRING); /*it's shorter as tEXt than as zTXt chunk*/
+ }
+ /*iTXt*/
+ for(i = 0; i < info.itext.num; i++)
+ {
+ if(strlen(info.itext.keys[i]) > 79) { encoder->error = 66; break; }
+ if(strlen(info.itext.keys[i]) < 1) { encoder->error = 67; break; }
+ addChunk_iTXt(&outv, encoder->settings.text_compression,
+ info.itext.keys[i], info.itext.langtags[i], info.itext.transkeys[i], info.itext.strings[i],
+ &encoder->settings.zlibsettings);
+ }
+#endif /*LODEPNG_COMPILE_ANCILLARY_CHUNKS*/
+#ifdef LODEPNG_COMPILE_UNKNOWN_CHUNKS
+ /*unknown chunks between IDAT and IEND*/
+ if(info.unknown_chunks.data[2]) { encoder->error = addUnknownChunks(&outv, info.unknown_chunks.data[2], info.unknown_chunks.datasize[2]); if(encoder->error) break; }
+#endif /*LODEPNG_COMPILE_UNKNOWN_CHUNKS*/
+ /*IEND*/
+ addChunk_IEND(&outv);
+
+ break; /*this isn't really a while loop; no error happened so break out now!*/
+ }
+
+ free(data);
+ /*instead of cleaning the vector up, give it to the output*/
+ *out = outv.data;
+ *outsize = outv.size;
+}
+
+unsigned LodePNG_encode32(unsigned char** out, size_t* outsize, const unsigned char* image, unsigned w, unsigned h)
+{
+ unsigned error;
+ LodePNG_Encoder encoder;
+ LodePNG_Encoder_init(&encoder);
+ LodePNG_encode(&encoder, out, outsize, image, w, h);
+ error = encoder.error;
+ LodePNG_Encoder_cleanup(&encoder);
+ return error;
+}
+
+#ifdef LODEPNG_COMPILE_DISK
+unsigned LodePNG_encode32f(const char* filename, const unsigned char* image, unsigned w, unsigned h)
+{
+ unsigned char* buffer;
+ size_t buffersize;
+ unsigned error = LodePNG_encode32(&buffer, &buffersize, image, w, h);
+ LodePNG_saveFile(buffer, buffersize, filename);
+ free(buffer);
+ return error;
+}
+#endif /*LODEPNG_COMPILE_DISK*/
+
+void LodePNG_EncodeSettings_init(LodePNG_EncodeSettings* settings)
+{
+ LodeZlib_DeflateSettings_init(&settings->zlibsettings);
+ settings->autoLeaveOutAlphaChannel = 1;
+ settings->force_palette = 0;
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+ settings->add_id = 1;
+ settings->text_compression = 0;
+#endif /*LODEPNG_COMPILE_ANCILLARY_CHUNKS*/
+}
+
+void LodePNG_Encoder_init(LodePNG_Encoder* encoder)
+{
+ LodePNG_EncodeSettings_init(&encoder->settings);
+ LodePNG_InfoPng_init(&encoder->infoPng);
+ LodePNG_InfoRaw_init(&encoder->infoRaw);
+ encoder->error = 1;
+}
+
+void LodePNG_Encoder_cleanup(LodePNG_Encoder* encoder)
+{
+ LodePNG_InfoPng_cleanup(&encoder->infoPng);
+ LodePNG_InfoRaw_cleanup(&encoder->infoRaw);
+}
+
+void LodePNG_Encoder_copy(LodePNG_Encoder* dest, const LodePNG_Encoder* source)
+{
+ LodePNG_Encoder_cleanup(dest);
+ *dest = *source;
+ LodePNG_InfoPng_init(&dest->infoPng);
+ LodePNG_InfoRaw_init(&dest->infoRaw);
+ dest->error = LodePNG_InfoPng_copy(&dest->infoPng, &source->infoPng); if(dest->error) return;
+ dest->error = LodePNG_InfoRaw_copy(&dest->infoRaw, &source->infoRaw); if(dest->error) return;
+}
+
+#endif /*LODEPNG_COMPILE_ENCODER*/
+
+#endif /*LODEPNG_COMPILE_PNG*/
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* / File IO / */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+#ifdef LODEPNG_COMPILE_DISK
+
+unsigned LodePNG_loadFile(unsigned char** out, size_t* outsize, const char* filename) /*designed for loading files from hard disk in a dynamically allocated buffer*/
+{
+ FILE* file;
+ long size;
+
+ /*provide some proper output values if error will happen*/
+ *out = 0;
+ *outsize = 0;
+
+ file = fopen(filename, "rb");
+ if(!file) return 78;
+
+ /*get filesize:*/
+ fseek(file , 0 , SEEK_END);
+ size = ftell(file);
+ rewind(file);
+
+ /*read contents of the file into the vector*/
+ *outsize = 0;
+ *out = (unsigned char*)malloc((size_t)size);
+ if(size && (*out)) (*outsize) = fread(*out, 1, (size_t)size, file);
+
+ fclose(file);
+ if(!(*out) && size) return 80; /*the above malloc failed*/
+ return 0;
+}
+
+/*write given buffer to the file, overwriting the file, it doesn't append to it.*/
+unsigned LodePNG_saveFile(const unsigned char* buffer, size_t buffersize, const char* filename)
+{
+ FILE* file;
+ file = fopen(filename, "wb" );
+ if(!file) return 79;
+ fwrite((char*)buffer , 1 , buffersize, file);
+ fclose(file);
+ return 0;
+}
+
+#endif /*LODEPNG_COMPILE_DISK*/
+
+#ifdef __cplusplus
+/* ////////////////////////////////////////////////////////////////////////// */
+/* / C++ RAII wrapper / */
+/* ////////////////////////////////////////////////////////////////////////// */
+#ifdef LODEPNG_COMPILE_ZLIB
+namespace LodeZlib
+{
+#ifdef LODEPNG_COMPILE_DECODER
+ unsigned decompress(std::vector<unsigned char>& out, const unsigned char* in, size_t insize, const LodeZlib_DecompressSettings& settings)
+ {
+ unsigned char* buffer = 0;
+ size_t buffersize = 0;
+ unsigned error = LodeZlib_decompress(&buffer, &buffersize, in, insize, &settings);
+ if(buffer)
+ {
+ out.insert(out.end(), &buffer[0], &buffer[buffersize]);
+ free(buffer);
+ }
+ return error;
+ }
+
+ unsigned decompress(std::vector<unsigned char>& out, const std::vector<unsigned char>& in, const LodeZlib_DecompressSettings& settings)
+ {
+ return decompress(out, in.empty() ? 0 : &in[0], in.size(), settings);
+ }
+#endif //LODEPNG_COMPILE_DECODER
+#ifdef LODEPNG_COMPILE_ENCODER
+ unsigned compress(std::vector<unsigned char>& out, const unsigned char* in, size_t insize, const LodeZlib_DeflateSettings& settings)
+ {
+ unsigned char* buffer = 0;
+ size_t buffersize = 0;
+ unsigned error = LodeZlib_compress(&buffer, &buffersize, in, insize, &settings);
+ if(buffer)
+ {
+ out.insert(out.end(), &buffer[0], &buffer[buffersize]);
+ free(buffer);
+ }
+ return error;
+ }
+
+ unsigned compress(std::vector<unsigned char>& out, const std::vector<unsigned char>& in, const LodeZlib_DeflateSettings& settings)
+ {
+ return compress(out, in.empty() ? 0 : &in[0], in.size(), settings);
+ }
+#endif //LODEPNG_COMPILE_ENCODER
+}
+#endif //LODEPNG_COMPILE_ZLIB
+
+namespace LodePNG
+{
+#ifdef LODEPNG_COMPILE_DECODER
+ Decoder::Decoder() { LodePNG_Decoder_init(this); }
+ Decoder::~Decoder() { LodePNG_Decoder_cleanup(this); }
+ void Decoder::operator=(const LodePNG_Decoder& other) { LodePNG_Decoder_copy(this, &other); }
+
+ bool Decoder::hasError() const { return error != 0; }
+ unsigned Decoder::getError() const { return error; }
+
+ unsigned Decoder::getWidth() const { return infoPng.width; }
+ unsigned Decoder::getHeight() const { return infoPng.height; }
+ unsigned Decoder::getBpp() { return LodePNG_InfoColor_getBpp(&infoPng.color); }
+ unsigned Decoder::getChannels() { return LodePNG_InfoColor_getChannels(&infoPng.color); }
+ unsigned Decoder::isGreyscaleType() { return LodePNG_InfoColor_isGreyscaleType(&infoPng.color); }
+ unsigned Decoder::isAlphaType() { return LodePNG_InfoColor_isAlphaType(&infoPng.color); }
+
+ void Decoder::decode(std::vector<unsigned char>& out, const unsigned char* in, size_t insize)
+ {
+ unsigned char* buffer;
+ size_t buffersize;
+ LodePNG_decode(this, &buffer, &buffersize, in, insize);
+ if(buffer)
+ {
+ out.insert(out.end(), &buffer[0], &buffer[buffersize]);
+ free(buffer);
+ }
+ }
+
+ void Decoder::decode(std::vector<unsigned char>& out, const std::vector<unsigned char>& in)
+ {
+ decode(out, in.empty() ? 0 : &in[0], in.size());
+ }
+
+ void Decoder::inspect(const unsigned char* in, size_t size)
+ {
+ LodePNG_inspect(this, in, size);
+ }
+
+ void Decoder::inspect(const std::vector<unsigned char>& in)
+ {
+ inspect(in.empty() ? 0 : &in[0], in.size());
+ }
+
+ const LodePNG_DecodeSettings& Decoder::getSettings() const { return settings; }
+ LodePNG_DecodeSettings& Decoder::getSettings() { return settings; }
+ void Decoder::setSettings(const LodePNG_DecodeSettings& settings) { this->settings = settings; }
+
+ const LodePNG_InfoPng& Decoder::getInfoPng() const { return infoPng; }
+ LodePNG_InfoPng& Decoder::getInfoPng() { return infoPng; }
+ void Decoder::setInfoPng(const LodePNG_InfoPng& info) { error = LodePNG_InfoPng_copy(&this->infoPng, &info); }
+ void Decoder::swapInfoPng(LodePNG_InfoPng& info) { LodePNG_InfoPng_swap(&this->infoPng, &info); }
+
+ const LodePNG_InfoRaw& Decoder::getInfoRaw() const { return infoRaw; }
+ LodePNG_InfoRaw& Decoder::getInfoRaw() { return infoRaw; }
+ void Decoder::setInfoRaw(const LodePNG_InfoRaw& info) { error = LodePNG_InfoRaw_copy(&this->infoRaw, &info); }
+#endif //LODEPNG_COMPILE_DECODER
+
+ /* ////////////////////////////////////////////////////////////////////////// */
+
+#ifdef LODEPNG_COMPILE_ENCODER
+ Encoder::Encoder() { LodePNG_Encoder_init(this); }
+ Encoder::~Encoder() { LodePNG_Encoder_cleanup(this); }
+ void Encoder::operator=(const LodePNG_Encoder& other) { LodePNG_Encoder_copy(this, &other); }
+
+ bool Encoder::hasError() const { return error != 0; }
+ unsigned Encoder::getError() const { return error; }
+
+ void Encoder::encode(std::vector<unsigned char>& out, const unsigned char* image, unsigned w, unsigned h)
+ {
+ unsigned char* buffer;
+ size_t buffersize;
+ LodePNG_encode(this, &buffer, &buffersize, image, w, h);
+ if(buffer)
+ {
+ out.insert(out.end(), &buffer[0], &buffer[buffersize]);
+ free(buffer);
+ }
+ }
+
+ void Encoder::encode(std::vector<unsigned char>& out, const std::vector<unsigned char>& image, unsigned w, unsigned h)
+ {
+ encode(out, image.empty() ? 0 : &image[0], w, h);
+ }
+
+ void Encoder::clearPalette() { LodePNG_InfoColor_clearPalette(&infoPng.color); }
+ void Encoder::addPalette(unsigned char r, unsigned char g, unsigned char b, unsigned char a) { error = LodePNG_InfoColor_addPalette(&infoPng.color, r, g, b, a); }
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+ void Encoder::clearText() { LodePNG_Text_clear(&infoPng.text); }
+ void Encoder::addText(const std::string& key, const std::string& str) { error = LodePNG_Text_add(&infoPng.text, key.c_str(), str.c_str()); }
+ void Encoder::clearIText() { LodePNG_IText_clear(&infoPng.itext); }
+ void Encoder::addIText(const std::string& key, const std::string& langtag, const std::string& transkey, const std::string& str) { error = LodePNG_IText_add(&infoPng.itext, key.c_str(), langtag.c_str(), transkey.c_str(), str.c_str()); }
+#endif /*LODEPNG_COMPILE_ANCILLARY_CHUNKS*/
+
+ const LodePNG_EncodeSettings& Encoder::getSettings() const { return settings; }
+ LodePNG_EncodeSettings& Encoder::getSettings() { return settings; }
+ void Encoder::setSettings(const LodePNG_EncodeSettings& settings) { this->settings = settings; }
+
+ const LodePNG_InfoPng& Encoder::getInfoPng() const { return infoPng; }
+ LodePNG_InfoPng& Encoder::getInfoPng() { return infoPng; }
+ void Encoder::setInfoPng(const LodePNG_InfoPng& info) { error = LodePNG_InfoPng_copy(&this->infoPng, &info); }
+ void Encoder::swapInfoPng(LodePNG_InfoPng& info) { LodePNG_InfoPng_swap(&this->infoPng, &info); }
+
+ const LodePNG_InfoRaw& Encoder::getInfoRaw() const { return infoRaw; }
+ LodePNG_InfoRaw& Encoder::getInfoRaw() { return infoRaw; }
+ void Encoder::setInfoRaw(const LodePNG_InfoRaw& info) { error = LodePNG_InfoRaw_copy(&this->infoRaw, &info); }
+#endif //LODEPNG_COMPILE_ENCODER
+ /* ////////////////////////////////////////////////////////////////////////// */
+
+//#ifdef LODEPNG_COMPILE_DISK
+
+ void loadFile(std::vector<unsigned char>& buffer, ReaderPtr<Reader> & reader) //designed for loading files from hard disk in an std::vector
+ {
+ uint64_t const sz = reader.Size();
+ if (sz > 0)
+ {
+ buffer.resize(sz);
+ reader.Read(0, &buffer[0], sz);
+ }
+ }
+
+ /*write given buffer to the file, overwriting the file, it doesn't append to it.*/
+ void saveFile(const std::vector<unsigned char>& buffer, WriterPtr<Writer> &writer)
+ {
+ size_t const sz = buffer.size();
+ if (sz > 0)
+ {
+ writer.Write(&buffer[0], sz);
+ }
+ }
+
+//#endif /*LODEPNG_COMPILE_DISK*/
+
+ /* ////////////////////////////////////////////////////////////////////////// */
+#ifdef LODEPNG_COMPILE_DECODER
+ unsigned decode(std::vector<unsigned char>& out, unsigned& w, unsigned& h, const unsigned char* in, unsigned size, unsigned colorType, unsigned bitDepth)
+ {
+ Decoder decoder;
+ decoder.getInfoRaw().color.colorType = colorType;
+ decoder.getInfoRaw().color.bitDepth = bitDepth;
+ decoder.decode(out, in, size);
+ w = decoder.getWidth();
+ h = decoder.getHeight();
+ return decoder.getError();
+ }
+
+ unsigned decode(std::vector<unsigned char>& out, unsigned& w, unsigned& h, const std::vector<unsigned char>& in, unsigned colorType, unsigned bitDepth)
+ {
+ return decode(out, w, h, in.empty() ? 0 : &in[0], (unsigned)in.size(), colorType, bitDepth);
+ }
+#ifdef LODEPNG_COMPILE_DISK
+ unsigned decode(std::vector<unsigned char>& out, unsigned& w, unsigned& h, const std::string& filename, unsigned colorType, unsigned bitDepth)
+ {
+ std::vector<unsigned char> buffer;
+ loadFile(buffer, filename);
+ return decode(out, w, h, buffer, colorType, bitDepth);
+ }
+#endif /*LODEPNG_COMPILE_DISK*/
+#endif //LODEPNG_COMPILE_DECODER
+
+#ifdef LODEPNG_COMPILE_ENCODER
+ unsigned encode(std::vector<unsigned char>& out, const unsigned char* in, unsigned w, unsigned h, unsigned colorType, unsigned bitDepth)
+ {
+ Encoder encoder;
+ encoder.getInfoRaw().color.colorType = colorType;
+ encoder.getInfoRaw().color.bitDepth = bitDepth;
+ encoder.encode(out, in, w, h);
+ return encoder.getError();
+ }
+
+ unsigned encode(std::vector<unsigned char>& out, const std::vector<unsigned char>& in, unsigned w, unsigned h, unsigned colorType, unsigned bitDepth)
+ {
+ return encode(out, in.empty() ? 0 : &in[0], w, h, colorType, bitDepth);
+ }
+
+#ifdef LODEPNG_COMPILE_DISK
+ unsigned encode(const std::string& filename, const unsigned char* in, unsigned w, unsigned h, unsigned colorType, unsigned bitDepth)
+ {
+ std::vector<unsigned char> buffer;
+ Encoder encoder;
+ encoder.getInfoRaw().color.colorType = colorType;
+ encoder.getInfoRaw().color.bitDepth = bitDepth;
+ encoder.encode(buffer, in, w, h);
+ if(!encoder.hasError()) saveFile(buffer, filename);
+ return encoder.getError();
+ }
+
+ unsigned encode(const std::string& filename, const std::vector<unsigned char>& in, unsigned w, unsigned h, unsigned colorType, unsigned bitDepth)
+ {
+ return encode(filename, in.empty() ? 0 : &in[0], w, h, colorType, bitDepth);
+ }
+#endif /*LODEPNG_COMPILE_DISK*/
+#endif // LODEPNG_COMPILE_ENCODER
+}
+#endif /*__cplusplus C++ RAII wrapper*/
diff --git a/3party/lodepng/lodepng.hpp b/3party/lodepng/lodepng.hpp
new file mode 100644
index 0000000000..bc71df1650
--- /dev/null
+++ b/3party/lodepng/lodepng.hpp
@@ -0,0 +1,1713 @@
+/*
+LodePNG version 20100314
+
+Copyright (c) 2005-2010 Lode Vandevenne
+
+This software is provided 'as-is', without any express or implied
+warranty. In no event will the authors be held liable for any damages
+arising from the use of this software.
+
+Permission is granted to anyone to use this software for any purpose,
+including commercial applications, and to alter it and redistribute it
+freely, subject to the following restrictions:
+
+ 1. The origin of this software must not be misrepresented; you must not
+ claim that you wrote the original software. If you use this software
+ in a product, an acknowledgment in the product documentation would be
+ appreciated but is not required.
+
+ 2. Altered source versions must be plainly marked as such, and must not be
+ misrepresented as being the original software.
+
+ 3. This notice may not be removed or altered from any source
+ distribution.
+*/
+
+#ifndef LODEPNG_H
+#define LODEPNG_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "coding/reader.hpp"
+#include "coding/writer.hpp"
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* Code Sections */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+/*The following defines can be commented disable code sections. Gives potential faster compile and smaller binary.*/
+
+#define LODEPNG_COMPILE_ZLIB /*deflate&zlib encoder and deflate&zlib decoder*/
+#define LODEPNG_COMPILE_PNG /*png encoder and png decoder*/
+#define LODEPNG_COMPILE_DECODER /*deflate&zlib decoder and png decoder*/
+#define LODEPNG_COMPILE_ENCODER /*deflate&zlib encoder and png encoder*/
+//#define LODEPNG_COMPILE_DISK /*the optional built in harddisk file loading and saving functions*/
+//#define LODEPNG_COMPILE_ANCILLARY_CHUNKS /*any code or struct datamember related to chunks other than IHDR, IDAT, PLTE, tRNS, IEND*/
+//#define LODEPNG_COMPILE_UNKNOWN_CHUNKS /*handling of unknown chunks*/
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* LodeFlate & LodeZlib Setting structs */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+#ifdef LODEPNG_COMPILE_DECODER
+typedef struct LodeZlib_DecompressSettings
+{
+ unsigned ignoreAdler32;
+} LodeZlib_DecompressSettings;
+
+extern const LodeZlib_DecompressSettings LodeZlib_defaultDecompressSettings;
+void LodeZlib_DecompressSettings_init(LodeZlib_DecompressSettings* settings);
+#endif /*LODEPNG_COMPILE_DECODER*/
+
+#ifdef LODEPNG_COMPILE_ENCODER
+typedef struct LodeZlib_DeflateSettings /*deflate = compress*/
+{
+ /*LZ77 related settings*/
+ unsigned btype; /*the block type for LZ*/
+ unsigned useLZ77; /*whether or not to use LZ77*/
+ unsigned windowSize; /*the maximum is 32768*/
+} LodeZlib_DeflateSettings;
+
+extern const LodeZlib_DeflateSettings LodeZlib_defaultDeflateSettings;
+void LodeZlib_DeflateSettings_init(LodeZlib_DeflateSettings* settings);
+#endif /*LODEPNG_COMPILE_ENCODER*/
+
+#ifdef LODEPNG_COMPILE_ZLIB
+/* ////////////////////////////////////////////////////////////////////////// */
+/* LodeFlate & LodeZlib */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+#ifdef LODEPNG_COMPILE_DECODER
+/*This function reallocates the out buffer and appends the data.
+Either, *out must be NULL and *outsize must be 0, or, *out must be a valid buffer and *outsize its size in bytes.*/
+unsigned LodeZlib_decompress(unsigned char** out, size_t* outsize, const unsigned char* in, size_t insize, const LodeZlib_DecompressSettings* settings);
+#endif /*LODEPNG_COMPILE_DECODER*/
+
+#ifdef LODEPNG_COMPILE_ENCODER
+/*This function reallocates the out buffer and appends the data.
+Either, *out must be NULL and *outsize must be 0, or, *out must be a valid buffer and *outsize its size in bytes.*/
+unsigned LodeZlib_compress(unsigned char** out, size_t* outsize, const unsigned char* in, size_t insize, const LodeZlib_DeflateSettings* settings);
+#endif /*LODEPNG_COMPILE_ENCODER*/
+#endif /*LODEPNG_COMPILE_ZLIB*/
+
+#ifdef LODEPNG_COMPILE_PNG
+
+/* ////////////////////////////////////////////////////////////////////////// */
+/* LodePNG */
+/* ////////////////////////////////////////////////////////////////////////// */
+
+/*LodePNG_chunk functions: These functions need as input a large enough amount of allocated memory.*/
+
+unsigned LodePNG_chunk_length(const unsigned char* chunk); /*get the length of the data of the chunk. Total chunk length has 12 bytes more.*/
+
+void LodePNG_chunk_type(char type[5], const unsigned char* chunk); /*puts the 4-byte type in null terminated string*/
+unsigned char LodePNG_chunk_type_equals(const unsigned char* chunk, const char* type); /*check if the type is the given type*/
+
+/*properties of PNG chunks gotten from capitalization of chunk type name, as defined by the standard*/
+unsigned char LodePNG_chunk_critical(const unsigned char* chunk); /*0: ancillary chunk, 1: it's one of the critical chunk types*/
+unsigned char LodePNG_chunk_private(const unsigned char* chunk); /*0: public, 1: private*/
+unsigned char LodePNG_chunk_safetocopy(const unsigned char* chunk); /*0: the chunk is unsafe to copy, 1: the chunk is safe to copy*/
+
+unsigned char* LodePNG_chunk_data(unsigned char* chunk); /*get pointer to the data of the chunk*/
+const unsigned char* LodePNG_chunk_data_const(const unsigned char* chunk); /*get pointer to the data of the chunk*/
+
+unsigned LodePNG_chunk_check_crc(const unsigned char* chunk); /*returns 0 if the crc is correct, 1 if it's incorrect*/
+void LodePNG_chunk_generate_crc(unsigned char* chunk); /*generates the correct CRC from the data and puts it in the last 4 bytes of the chunk*/
+
+/*iterate to next chunks.*/
+unsigned char* LodePNG_chunk_next(unsigned char* chunk);
+const unsigned char* LodePNG_chunk_next_const(const unsigned char* chunk);
+
+/*add chunks to out buffer. It reallocs the buffer to append the data. returns error code*/
+unsigned LodePNG_append_chunk(unsigned char** out, size_t* outlength, const unsigned char* chunk); /*appends chunk that was already created, to the data. Returns pointer to start of appended chunk, or NULL if error happened*/
+unsigned LodePNG_create_chunk(unsigned char** out, size_t* outlength, unsigned length, const char* type, const unsigned char* data); /*appends new chunk to out. Returns pointer to start of appended chunk, or NULL if error happened; may change memory address of out buffer*/
+
+typedef struct LodePNG_InfoColor /*info about the color type of an image*/
+{
+ /*header (IHDR)*/
+ unsigned colorType; /*color type*/
+ unsigned bitDepth; /*bits per sample*/
+
+ /*palette (PLTE)*/
+ unsigned char* palette; /*palette in RGBARGBA... order*/
+ size_t palettesize; /*palette size in number of colors (amount of bytes is 4 * palettesize)*/
+
+ /*transparent color key (tRNS)*/
+ unsigned key_defined; /*is a transparent color key given?*/
+ unsigned key_r; /*red component of color key*/
+ unsigned key_g; /*green component of color key*/
+ unsigned key_b; /*blue component of color key*/
+} LodePNG_InfoColor;
+
+void LodePNG_InfoColor_init(LodePNG_InfoColor* info);
+void LodePNG_InfoColor_cleanup(LodePNG_InfoColor* info);
+unsigned LodePNG_InfoColor_copy(LodePNG_InfoColor* dest, const LodePNG_InfoColor* source);
+
+/*Use these functions instead of allocating palette manually*/
+void LodePNG_InfoColor_clearPalette(LodePNG_InfoColor* info);
+unsigned LodePNG_InfoColor_addPalette(LodePNG_InfoColor* info, unsigned char r, unsigned char g, unsigned char b, unsigned char a); /*add 1 color to the palette*/
+
+/*additional color info*/
+unsigned LodePNG_InfoColor_getBpp(const LodePNG_InfoColor* info); /*bits per pixel*/
+unsigned LodePNG_InfoColor_getChannels(const LodePNG_InfoColor* info); /*amount of channels*/
+unsigned LodePNG_InfoColor_isGreyscaleType(const LodePNG_InfoColor* info); /*is it a greyscale type? (colorType 0 or 4)*/
+unsigned LodePNG_InfoColor_isAlphaType(const LodePNG_InfoColor* info); /*has it an alpha channel? (colorType 2 or 6)*/
+
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+typedef struct LodePNG_Time /*LodePNG's encoder does not generate the current time. To make it add a time chunk the correct time has to be provided*/
+{
+ unsigned year; /*2 bytes*/
+ unsigned char month; /*1-12*/
+ unsigned char day; /*1-31*/
+ unsigned char hour; /*0-23*/
+ unsigned char minute; /*0-59*/
+ unsigned char second; /*0-60 (to allow for leap seconds)*/
+} LodePNG_Time;
+
+typedef struct LodePNG_Text /*non-international text*/
+{
+ size_t num;
+ char** keys; /*the keyword of a text chunk (e.g. "Comment")*/
+ char** strings; /*the actual text*/
+} LodePNG_Text;
+
+void LodePNG_Text_init(LodePNG_Text* text);
+void LodePNG_Text_cleanup(LodePNG_Text* text);
+unsigned LodePNG_Text_copy(LodePNG_Text* dest, const LodePNG_Text* source);
+
+/*Use these functions instead of allocating the char**s manually*/
+void LodePNG_Text_clear(LodePNG_Text* text);
+unsigned LodePNG_Text_add(LodePNG_Text* text, const char* key, const char* str); /*push back both texts at once*/
+
+
+typedef struct LodePNG_IText /*international text*/
+{
+ size_t num;
+ char** keys; /*the English keyword of the text chunk (e.g. "Comment")*/
+ char** langtags; /*the language tag for this text's international language, ISO/IEC 646 string, e.g. ISO 639 language tag*/
+ char** transkeys; /*keyword translated to the international language - UTF-8 string*/
+ char** strings; /*the actual international text - UTF-8 string*/
+} LodePNG_IText;
+
+void LodePNG_IText_init(LodePNG_IText* text);
+void LodePNG_IText_cleanup(LodePNG_IText* text);
+unsigned LodePNG_IText_copy(LodePNG_IText* dest, const LodePNG_IText* source);
+
+/*Use these functions instead of allocating the char**s manually*/
+void LodePNG_IText_clear(LodePNG_IText* text);
+unsigned LodePNG_IText_add(LodePNG_IText* text, const char* key, const char* langtag, const char* transkey, const char* str); /*push back the 4 texts of 1 chunk at once*/
+#endif /*LODEPNG_COMPILE_ANCILLARY_CHUNKS*/
+
+#ifdef LODEPNG_COMPILE_UNKNOWN_CHUNKS
+typedef struct LodePNG_UnknownChunks /*unknown chunks read from the PNG, or extra chunks the user wants to have added in the encoded PNG*/
+{
+ /*There are 3 buffers, one for each position in the PNG where unknown chunks can appear
+ each buffer contains all unknown chunks for that position consecutively
+ The 3 buffers are the unknown chunks between certain critical chunks:
+ 0: IHDR-PLTE, 1: PLTE-IDAT, 2: IDAT-IEND*/
+ unsigned char* data[3];
+ size_t datasize[3]; /*size in bytes of the unknown chunks, given for protection*/
+
+} LodePNG_UnknownChunks;
+
+void LodePNG_UnknownChunks_init(LodePNG_UnknownChunks* chunks);
+void LodePNG_UnknownChunks_cleanup(LodePNG_UnknownChunks* chunks);
+unsigned LodePNG_UnknownChunks_copy(LodePNG_UnknownChunks* dest, const LodePNG_UnknownChunks* src);
+#endif /*LODEPNG_COMPILE_UNKNOWN_CHUNKS*/
+
+typedef struct LodePNG_InfoPng /*information about the PNG image, except pixels and sometimes except width and height*/
+{
+ /*header (IHDR), palette (PLTE) and transparency (tRNS)*/
+ unsigned width; /*width of the image in pixels (ignored by encoder, but filled in by decoder)*/
+ unsigned height; /*height of the image in pixels (ignored by encoder, but filled in by decoder)*/
+ unsigned compressionMethod; /*compression method of the original file*/
+ unsigned filterMethod; /*filter method of the original file*/
+ unsigned interlaceMethod; /*interlace method of the original file*/
+ LodePNG_InfoColor color; /*color type and bits, palette, transparency*/
+
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+
+ /*suggested background color (bKGD)*/
+ unsigned background_defined; /*is a suggested background color given?*/
+ unsigned background_r; /*red component of suggested background color*/
+ unsigned background_g; /*green component of suggested background color*/
+ unsigned background_b; /*blue component of suggested background color*/
+
+ /*non-international text chunks (tEXt and zTXt)*/
+ LodePNG_Text text;
+
+ /*international text chunks (iTXt)*/
+ LodePNG_IText itext;
+
+ /*time chunk (tIME)*/
+ unsigned char time_defined; /*if 0, no tIME chunk was or will be generated in the PNG image*/
+ LodePNG_Time time;
+
+ /*phys chunk (pHYs)*/
+ unsigned phys_defined; /*is pHYs chunk defined?*/
+ unsigned phys_x;
+ unsigned phys_y;
+ unsigned char phys_unit; /*may be 0 (unknown unit) or 1 (metre)*/
+
+#endif /*LODEPNG_COMPILE_ANCILLARY_CHUNKS*/
+
+#ifdef LODEPNG_COMPILE_UNKNOWN_CHUNKS
+ /*unknown chunks*/
+ LodePNG_UnknownChunks unknown_chunks;
+#endif /*LODEPNG_COMPILE_UNKNOWN_CHUNKS*/
+
+} LodePNG_InfoPng;
+
+void LodePNG_InfoPng_init(LodePNG_InfoPng* info);
+void LodePNG_InfoPng_cleanup(LodePNG_InfoPng* info);
+unsigned LodePNG_InfoPng_copy(LodePNG_InfoPng* dest, const LodePNG_InfoPng* source);
+
+typedef struct LodePNG_InfoRaw /*contains user-chosen information about the raw image data, which is independent of the PNG image*/
+{
+ LodePNG_InfoColor color;
+} LodePNG_InfoRaw;
+
+void LodePNG_InfoRaw_init(LodePNG_InfoRaw* info);
+void LodePNG_InfoRaw_cleanup(LodePNG_InfoRaw* info);
+unsigned LodePNG_InfoRaw_copy(LodePNG_InfoRaw* dest, const LodePNG_InfoRaw* source);
+
+/*
+LodePNG_convert: Converts from any color type to 24-bit or 32-bit (later maybe more supported). return value = LodePNG error code
+The out buffer must have (w * h * bpp + 7) / 8, where bpp is the bits per pixel of the output color type (LodePNG_InfoColor_getBpp)
+*/
+unsigned LodePNG_convert(unsigned char* out, const unsigned char* in, LodePNG_InfoColor* infoOut, LodePNG_InfoColor* infoIn, unsigned w, unsigned h);
+
+#ifdef LODEPNG_COMPILE_DECODER
+
+typedef struct LodePNG_DecodeSettings
+{
+ LodeZlib_DecompressSettings zlibsettings; /*in here is the setting to ignore Adler32 checksums*/
+
+ unsigned ignoreCrc; /*ignore CRC checksums*/
+ unsigned color_convert; /*whether to convert the PNG to the color type you want. Default: yes*/
+
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+ unsigned readTextChunks; /*if false but rememberUnknownChunks is true, they're stored in the unknown chunks*/
+#endif /*LODEPNG_COMPILE_ANCILLARY_CHUNKS*/
+
+#ifdef LODEPNG_COMPILE_UNKNOWN_CHUNKS
+ unsigned rememberUnknownChunks; /*store all bytes from unknown chunks in the InfoPng (off by default, useful for a png editor)*/
+#endif /*LODEPNG_COMPILE_UNKNOWN_CHUNKS*/
+} LodePNG_DecodeSettings;
+
+void LodePNG_DecodeSettings_init(LodePNG_DecodeSettings* settings);
+
+typedef struct LodePNG_Decoder
+{
+ LodePNG_DecodeSettings settings;
+ LodePNG_InfoRaw infoRaw;
+ LodePNG_InfoPng infoPng; /*info of the PNG image obtained after decoding*/
+ unsigned error;
+} LodePNG_Decoder;
+
+void LodePNG_Decoder_init(LodePNG_Decoder* decoder);
+void LodePNG_Decoder_cleanup(LodePNG_Decoder* decoder);
+void LodePNG_Decoder_copy(LodePNG_Decoder* dest, const LodePNG_Decoder* source);
+
+/*decoding functions*/
+/*This function allocates the out buffer and stores the size in *outsize.*/
+void LodePNG_decode(LodePNG_Decoder* decoder, unsigned char** out, size_t* outsize, const unsigned char* in, size_t insize);
+unsigned LodePNG_decode32(unsigned char** out, unsigned* w, unsigned* h, const unsigned char* in, size_t insize); /*return value is error*/
+#ifdef LODEPNG_COMPILE_DISK
+unsigned LodePNG_decode32f(unsigned char** out, unsigned* w, unsigned* h, const char* filename);
+#endif /*LODEPNG_COMPILE_DISK*/
+void LodePNG_inspect(LodePNG_Decoder* decoder, const unsigned char* in, size_t size); /*read the png header*/
+
+#endif /*LODEPNG_COMPILE_DECODER*/
+
+#ifdef LODEPNG_COMPILE_ENCODER
+
+typedef struct LodePNG_EncodeSettings
+{
+ LodeZlib_DeflateSettings zlibsettings; /*settings for the zlib encoder, such as window size, ...*/
+
+ unsigned autoLeaveOutAlphaChannel; /*automatically use color type without alpha instead of given one, if given image is opaque*/
+ unsigned force_palette; /*force creating a PLTE chunk if colortype is 2 or 6 (= a suggested palette). If colortype is 3, PLTE is _always_ created.*/
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+ unsigned add_id; /*add LodePNG version as text chunk*/
+ unsigned text_compression; /*encode text chunks as zTXt chunks instead of tEXt chunks, and use compression in iTXt chunks*/
+#endif /*LODEPNG_COMPILE_ANCILLARY_CHUNKS*/
+} LodePNG_EncodeSettings;
+
+void LodePNG_EncodeSettings_init(LodePNG_EncodeSettings* settings);
+
+typedef struct LodePNG_Encoder
+{
+ LodePNG_EncodeSettings settings;
+ LodePNG_InfoPng infoPng; /*the info specified by the user may not be changed by the encoder. The encoder will try to generate a PNG close to the given info.*/
+ LodePNG_InfoRaw infoRaw; /*put the properties of the input raw image in here*/
+ unsigned error;
+} LodePNG_Encoder;
+
+void LodePNG_Encoder_init(LodePNG_Encoder* encoder);
+void LodePNG_Encoder_cleanup(LodePNG_Encoder* encoder);
+void LodePNG_Encoder_copy(LodePNG_Encoder* dest, const LodePNG_Encoder* source);
+
+/*This function allocates the out buffer and stores the size in *outsize.*/
+void LodePNG_encode(LodePNG_Encoder* encoder, unsigned char** out, size_t* outsize, const unsigned char* image, unsigned w, unsigned h);
+unsigned LodePNG_encode32(unsigned char** out, size_t* outsize, const unsigned char* image, unsigned w, unsigned h); /*return value is error*/
+#ifdef LODEPNG_COMPILE_DISK
+unsigned LodePNG_encode32f(const char* filename, const unsigned char* image, unsigned w, unsigned h);
+#endif /*LODEPNG_COMPILE_DISK*/
+#endif /*LODEPNG_COMPILE_ENCODER*/
+#endif /*LODEPNG_COMPILE_PNG*/
+
+#ifdef LODEPNG_COMPILE_DISK
+/*free functions allowing to load and save a file from/to harddisk*/
+/*This function allocates the out buffer and stores the size in *outsize.*/
+unsigned LodePNG_loadFile(unsigned char** out, size_t* outsize, const char* filename);
+unsigned LodePNG_saveFile(const unsigned char* buffer, size_t buffersize, const char* filename);
+#endif /*LODEPNG_COMPILE_DISK*/
+
+#ifdef __cplusplus
+
+//LodePNG C++ wrapper: wraps interface with destructors and std::vectors around the harder to use C version
+
+#include <vector>
+#include <string>
+
+#ifdef LODEPNG_COMPILE_ZLIB
+namespace LodeZlib
+{
+#ifdef LODEPNG_COMPILE_DECODER
+ unsigned decompress(std::vector<unsigned char>& out, const unsigned char* in, size_t insize, const LodeZlib_DecompressSettings& settings = LodeZlib_defaultDecompressSettings);
+ unsigned decompress(std::vector<unsigned char>& out, const std::vector<unsigned char>& in, const LodeZlib_DecompressSettings& settings = LodeZlib_defaultDecompressSettings);
+#endif //LODEPNG_COMPILE_DECODER
+#ifdef LODEPNG_COMPILE_ENCODER
+ unsigned compress(std::vector<unsigned char>& out, const unsigned char* in, size_t insize, const LodeZlib_DeflateSettings& settings = LodeZlib_defaultDeflateSettings);
+ unsigned compress(std::vector<unsigned char>& out, const std::vector<unsigned char>& in, const LodeZlib_DeflateSettings& settings = LodeZlib_defaultDeflateSettings);
+#endif //LODEPNG_COMPILE_ENCODER
+}
+#endif //LODEPNG_COMPILE_ZLIB
+
+#ifdef LODEPNG_COMPILE_PNG
+namespace LodePNG
+{
+
+#ifdef LODEPNG_COMPILE_DECODER
+ class Decoder : public LodePNG_Decoder
+ {
+ public:
+
+ Decoder();
+ ~Decoder();
+ void operator=(const LodePNG_Decoder& other);
+
+ //decoding functions
+ void decode(std::vector<unsigned char>& out, const unsigned char* in, size_t insize);
+ void decode(std::vector<unsigned char>& out, const std::vector<unsigned char>& in);
+
+ void inspect(const unsigned char* in, size_t size);
+ void inspect(const std::vector<unsigned char>& in);
+
+ //error checking after decoding
+ bool hasError() const;
+ unsigned getError() const;
+
+ //convenient access to some InfoPng parameters after decoding
+ unsigned getWidth() const;
+ unsigned getHeight() const;
+ unsigned getBpp(); //bits per pixel
+ unsigned getChannels(); //amount of channels
+ unsigned isGreyscaleType(); //is it a greyscale type? (colorType 0 or 4)
+ unsigned isAlphaType(); //has it an alpha channel? (colorType 2 or 6)
+
+ const LodePNG_DecodeSettings& getSettings() const;
+ LodePNG_DecodeSettings& getSettings();
+ void setSettings(const LodePNG_DecodeSettings& info);
+
+ const LodePNG_InfoPng& getInfoPng() const;
+ LodePNG_InfoPng& getInfoPng();
+ void setInfoPng(const LodePNG_InfoPng& info);
+ void swapInfoPng(LodePNG_InfoPng& info); //faster than copying with setInfoPng
+
+ const LodePNG_InfoRaw& getInfoRaw() const;
+ LodePNG_InfoRaw& getInfoRaw();
+ void setInfoRaw(const LodePNG_InfoRaw& info);
+ };
+
+ //simple functions for encoding/decoding the PNG in one call (RAW image always 32-bit)
+ unsigned decode(std::vector<unsigned char>& out, unsigned& w, unsigned& h, const unsigned char* in, unsigned size, unsigned colorType = 6, unsigned bitDepth = 8);
+ unsigned decode(std::vector<unsigned char>& out, unsigned& w, unsigned& h, const std::vector<unsigned char>& in, unsigned colorType = 6, unsigned bitDepth = 8);
+#ifdef LODEPNG_COMPILE_DISK
+ unsigned decode(std::vector<unsigned char>& out, unsigned& w, unsigned& h, const std::string& filename, unsigned colorType = 6, unsigned bitDepth = 8);
+#endif //LODEPNG_COMPILE_DISK
+#endif //LODEPNG_COMPILE_DECODER
+
+#ifdef LODEPNG_COMPILE_ENCODER
+ class Encoder : public LodePNG_Encoder
+ {
+ public:
+
+ Encoder();
+ ~Encoder();
+ void operator=(const LodePNG_Encoder& other);
+
+ void encode(std::vector<unsigned char>& out, const unsigned char* image, unsigned w, unsigned h);
+ void encode(std::vector<unsigned char>& out, const std::vector<unsigned char>& image, unsigned w, unsigned h);
+
+ //error checking after decoding
+ bool hasError() const;
+ unsigned getError() const;
+
+ //convenient direct access to some parameters of the InfoPng
+ void clearPalette();
+ void addPalette(unsigned char r, unsigned char g, unsigned char b, unsigned char a); //add 1 color to the palette
+#ifdef LODEPNG_COMPILE_ANCILLARY_CHUNKS
+ void clearText();
+ void addText(const std::string& key, const std::string& str); //push back both texts at once
+ void clearIText();
+ void addIText(const std::string& key, const std::string& langtag, const std::string& transkey, const std::string& str);
+#endif //LODEPNG_COMPILE_ANCILLARY_CHUNKS
+
+ const LodePNG_EncodeSettings& getSettings() const;
+ LodePNG_EncodeSettings& getSettings();
+ void setSettings(const LodePNG_EncodeSettings& info);
+
+ const LodePNG_InfoPng& getInfoPng() const;
+ LodePNG_InfoPng& getInfoPng();
+ void setInfoPng(const LodePNG_InfoPng& info);
+ void swapInfoPng(LodePNG_InfoPng& info); //faster than copying with setInfoPng
+
+ const LodePNG_InfoRaw& getInfoRaw() const;
+ LodePNG_InfoRaw& getInfoRaw();
+ void setInfoRaw(const LodePNG_InfoRaw& info);
+ };
+
+ unsigned encode(std::vector<unsigned char>& out, const unsigned char* in, unsigned w, unsigned h, unsigned colorType = 6, unsigned bitDepth = 8);
+ unsigned encode(std::vector<unsigned char>& out, const std::vector<unsigned char>& in, unsigned w, unsigned h, unsigned colorType = 6, unsigned bitDepth = 8);
+#ifdef LODEPNG_COMPILE_DISK
+ unsigned encode(const std::string& filename, const unsigned char* in, unsigned w, unsigned h, unsigned colorType = 6, unsigned bitDepth = 8);
+ unsigned encode(const std::string& filename, const std::vector<unsigned char>& in, unsigned w, unsigned h, unsigned colorType = 6, unsigned bitDepth = 8);
+#endif //LODEPNG_COMPILE_DISK
+#endif //LODEPNG_COMPILE_ENCODER
+
+//#ifdef LODEPNG_COMPILE_DISK
+ //free functions allowing to load and save a file from/to harddisk
+ void loadFile(std::vector<unsigned char>& buffer, ReaderPtr<Reader> & reader);
+ void saveFile(const std::vector<unsigned char>& buffer, WriterPtr<Writer> & writer);
+//#endif //LODEPNG_COMPILE_DISK
+
+} //namespace LodePNG
+
+#endif //LODEPNG_COMPILE_PNG
+
+#endif /*end of __cplusplus wrapper*/
+
+/*
+TODO:
+[ ] test if there are no memory leaks or security exploits - done a lot but needs to be checked often
+[ ] LZ77 encoder more like the one described in zlib - to make sure it's patentfree
+[ ] converting color to 16-bit types
+[ ] read all public PNG chunk types (but never let the color profile and gamma ones ever touch RGB values, that is very annoying for textures as well as images in a browser)
+[ ] make sure encoder generates no chunks with size > (2^31)-1
+[ ] partial decoding (stream processing)
+[ ] let the "isFullyOpaque" function check color keys and transparent palettes too
+[ ] better name for the variables "codes", "codesD", "codelengthcodes", "clcl" and "lldl"
+[ ] check compatibility with vareous compilers - done but needs to be redone for every newer version
+[ ] don't stop decoding on errors like 69, 57, 58 (make warnings that the decoder stores in the error at the very end? and make some errors just let it stop with this one chunk but still do the next ones)
+[ ] make option to choose if the raw image with non multiple of 8 bits per scanline should have padding bits or not, if people like storing raw images that way
+*/
+
+#endif
+
+/*
+LodePNG Documentation
+---------------------
+
+0. table of contents
+--------------------
+
+ 1. about
+ 1.1. supported features
+ 1.2. features not supported
+ 2. C and C++ version
+ 3. A note about security!
+ 4. simple functions
+ 4.1 C Simple Functions
+ 4.2 C++ Simple Functions
+ 5. decoder
+ 6. encoder
+ 7. color conversions
+ 8. info values
+ 9. error values
+ 10. file IO
+ 11. chunks and PNG editing
+ 12. compiler support
+ 13. examples
+ 13.1. decoder example
+ 13.2. encoder example
+ 14. LodeZlib
+ 15. changes
+ 16. contact information
+
+
+1. about
+--------
+
+PNG is a file format to store raster images losslessly with good compression,
+supporting different color types. It can be implemented in a patent-free way.
+
+LodePNG is a PNG codec according to the Portable Network Graphics (PNG)
+Specification (Second Edition) - W3C Recommendation 10 November 2003.
+
+The specifications used are:
+
+*) Portable Network Graphics (PNG) Specification (Second Edition):
+ http://www.w3.org/TR/2003/REC-PNG-20031110
+*) RFC 1950 ZLIB Compressed Data Format version 3.3:
+ http://www.gzip.org/zlib/rfc-zlib.html
+*) RFC 1951 DEFLATE Compressed Data Format Specification ver 1.3:
+ http://www.gzip.org/zlib/rfc-deflate.html
+
+The most recent version of LodePNG can currently be found at
+http://members.gamedev.net/lode/projects/LodePNG/
+
+LodePNG works both in C (ISO C90) and C++, with a C++ wrapper that adds
+extra functionality.
+
+LodePNG exists out of two files:
+-lodepng.h: the header file for both C and C++
+-lodepng.c(pp): give it the name lodepng.c or lodepng.cpp depending on your usage
+
+If you want to start using LodePNG right away without reading this doc, get the
+files lodepng_examples.c or lodepng_examples.cpp to see how to use it in code,
+or check the (smaller) examples in chapter 13 here.
+
+LodePNG is simple but only supports the basic requirements. To achieve
+simplicity, the following design choices were made: There are no dependencies
+on any external library. To decode PNGs, there's a Decoder struct or class that
+can convert any PNG file data into an RGBA image buffer with a single function
+call. To encode PNGs, there's an Encoder struct or class that can convert image
+data into PNG file data with a single function call. To read and write files,
+there are simple functions to convert the files to/from buffers in memory.
+
+This all makes LodePNG suitable for loading textures in games, demoscene
+productions, saving a screenshot, images in programs that require them for simple
+usage, ... It's less suitable for full fledged image editors, loading PNGs
+over network (it requires all the image data to be available before decoding can
+begin), life-critical systems, ...
+LodePNG has a standards conformant decoder and encoder, and supports the ability
+to make a somewhat conformant editor.
+
+1.1. supported features
+-----------------------
+
+The following features are supported by the decoder:
+
+*) decoding of PNGs with any color type, bit depth and interlace mode, to a 24- or 32-bit color raw image, or the same color type as the PNG
+*) encoding of PNGs, from any raw image to 24- or 32-bit color, or the same color type as the raw image
+*) Adam7 interlace and deinterlace for any color type
+*) loading the image from harddisk or decoding it from a buffer from other sources than harddisk
+*) support for alpha channels, including RGBA color model, translucent palettes and color keying
+*) zlib decompression (inflate)
+*) zlib compression (deflate)
+*) CRC32 and ADLER32 checksums
+*) handling of unknown chunks, allowing making a PNG editor that stores custom and unknown chunks.
+*) the following chunks are supported (generated/interpreted) by both encoder and decoder:
+ IHDR: header information
+ PLTE: color palette
+ IDAT: pixel data
+ IEND: the final chunk
+ tRNS: transparency for palettized images
+ tEXt: textual information
+ zTXt: compressed textual information
+ iTXt: international textual information
+ bKGD: suggested background color
+ pHYs: physical dimensions
+ tIME: modification time
+
+1.2. features not supported
+---------------------------
+
+The following features are _not_ supported:
+
+*) some features needed to make a conformant PNG-Editor might be still missing.
+*) partial loading/stream processing. All data must be available and is processed in one call.
+*) The following public chunks are not supported but treated as unknown chunks by LodePNG
+ cHRM, gAMA, iCCP, sRGB, sBIT, hIST, sPLT
+
+
+2. C and C++ version
+--------------------
+
+The C version uses buffers allocated with alloc instead that you need to free()
+yourself. On top of that, you need to use init and cleanup functions for each
+struct whenever using a struct from the C version to avoid exploits and memory leaks.
+
+The C++ version has constructors and destructors that take care of these things,
+and uses std::vectors in the interface for storing data.
+
+Both the C and the C++ version are contained in this file! The C++ code depends on
+the C code, the C code works on its own.
+
+These files work without modification for both C and C++ compilers because all the
+additional C++ code is in "#ifdef __cplusplus" blocks that make C-compilers ignore
+it, and the C code is made to compile both with strict ISO C90 and C++.
+
+To use the C++ version, you need to rename the source file to lodepng.cpp (instead
+of lodepng.c), and compile it with a C++ compiler.
+
+To use the C version, you need to rename the source file to lodepng.c (instead
+of lodepng.cpp), and compile it with a C compiler.
+
+
+3. A note about security!
+-------------------------
+
+Despite being used already and having received bug fixes whenever bugs were reported,
+LodePNG may still contain possible exploits.
+
+If you discover a possible exploit, please let me know, and it will be eliminated.
+
+When using LodePNG, care has to be taken with the C version of LodePNG, as well as the C-style
+structs when working with C++. The following conventions are used for all C-style structs:
+
+-if a struct has a corresponding init function, always call the init function when making a new one, to avoid exploits
+-if a struct has a corresponding cleanup function, call it before the struct disappears to avoid memory leaks
+-if a struct has a corresponding copy function, use the copy function instead of "=". The destination must be inited already!
+
+
+4. "Simple" Functions
+---------------------
+
+For the most simple usage cases of loading and saving a PNG image, there
+are some simple functions that do everything in 1 call (instead of you
+having to instantiate a struct or class).
+
+The simple versions always use 32-bit RGBA color for the raw image, but
+still support loading arbitrary-colortype PNG images.
+
+The later sections of this manual are devoted to the complex versions, where
+you can use other color types and conversions.
+
+4.1 C Simple Functions
+----------------------
+
+The C simple functions have a "32" or "32f" in their name, and don't take a struct as
+parameter, unlike the non-simple ones (see more down in the documentation).
+
+unsigned LodePNG_decode32(unsigned char** out, unsigned* w, unsigned* h, const unsigned char* in, size_t insize);
+
+Load PNG from given buffer.
+As input, give an unsigned char* buffer gotten by loading the .png file and its size.
+As output, you get a dynamically allocated buffer of large enough size, and the width and height of the image.
+The buffer's size is w * h * 4. The image is in RGBA format.
+The return value is the error (0 if ok).
+You need to do free(out) after usage to clean up the memory.
+
+unsigned LodePNG_decode32f(unsigned char** out, unsigned* w, unsigned* h, const char* filename);
+
+Load PNG from disk, from file with given name.
+Same as decode32, except you give a filename instead of an input buffer.
+
+unsigned LodePNG_encode32(unsigned char** out, size_t* outsize, const unsigned char* image, unsigned w, unsigned h);
+
+Encode PNG into buffer.
+As input, give a image buffer of size w * h * 4, in RGBA format.
+As output, you get a dynamically allocated buffer and its size, which is a PNG file that can
+directly be saved in this form to the harddisk.
+The return value is the error (0 if ok).
+You need to do free(out) after usage to clean up the memory.
+
+unsigned LodePNG_encode32f(const char* filename, const unsigned char* image, unsigned w, unsigned h);
+
+Encode PNG into file on disk with given name.
+If the file exists, it's overwritten without warning!
+Same parameters as encode2, except the result is stored in a file instead of a dynamic buffer.
+
+4.2 C++ Simple Functions
+------------------------
+
+For decoding a PNG there are:
+
+unsigned LodePNG::decode(std::vector<unsigned char>& out, unsigned& w, unsigned& h, const unsigned char* in, unsigned size);
+unsigned LodePNG::decode(std::vector<unsigned char>& out, unsigned& w, unsigned& h, const std::vector<unsigned char>& in);
+unsigned LodePNG::decode(std::vector<unsigned char>& out, unsigned& w, unsigned& h, const std::string& filename);
+
+These store the pixel data as 32-bit RGBA color in the out vector, and the width
+and height of the image in w and h.
+The 3 functions each have a different input type: The first as unsigned char
+buffer, the second as std::vector buffer, and the third allows you to give the
+filename in case you want to load the PNG from disk instead of from a buffer.
+The return value is the error (0 if ok).
+
+For encoding a PNG there are:
+
+unsigned LodePNG::encode(std::vector<unsigned char>& out, const unsigned char* in, unsigned w, unsigned h);
+unsigned LodePNG::encode(std::vector<unsigned char>& out, const std::vector<unsigned char>& in, unsigned w, unsigned h);
+unsigned LodePNG::encode(const std::string& filename, const std::vector<unsigned char>& in, unsigned w, unsigned h);
+unsigned LodePNG::encode(const std::string& filename, const unsigned char* in, unsigned w, unsigned h);
+
+Specify the width and height of the input image with w and h.
+You can choose to get the output in an std::vector or stored in a file, and
+the input can come from an std::vector or an unsigned char* buffer. The input
+buffer must be in RGBA format and the size must be w * h * 4 bytes.
+
+The first two functions append to the out buffer, they don't clear it, clear it
+first before encoding into a buffer that you expect to only contain this result.
+
+On the other hand, the functions that encode to a file will completely overwrite
+the original file without warning if it exists.
+
+The return value is the error (0 if ok).
+
+5. Decoder
+----------
+
+This is about the LodePNG_Decoder struct in the C version, and the
+LodePNG::Decoder class in the C++ version. The C++ version inherits
+from the C struct and adds functions in the interface.
+
+The Decoder class can be used to convert a PNG image to a raw image.
+
+Usage:
+
+-in C++:
+ declare a LodePNG::Decoder
+ call its decode member function with the parameters described below
+
+-in C more needs to be done due to the lack of constructors and destructors:
+ declare a LodePNG_Decoder struct
+ call LodePNG_Decoder_init with the struct as parameter
+ call LodePNG_Decode with the parameters described below
+ after usage, call LodePNG_Decoder_cleanup with the struct as parameter
+ after usage, free() the out buffer with image data that was created by the decode function
+
+The other parameters of the decode function are:
+*) out: this buffer will be filled with the raw image pixels
+*) in: pointer to the PNG image data or std::vector with the data
+*) size: the size of the PNG image data (not needed for std::vector version)
+
+After decoding you need to read the width and height of the image from the
+decoder, see further down in this manual to see how.
+
+There's also an optional function "inspect". It has the same parameters as decode except
+the "out" parameter. This function will read only the header chunk of the PNG
+image, and store the information from it in the LodePNG_InfoPng (see below).
+This allows knowing information about the image without decoding it. Only the
+header (IHDR) information is read by this, not text chunks, not the palette, ...
+
+During the decoding it's possible that an error can happen, for example if the
+PNG image was corrupted. To check if an error happened during the last decoding,
+check the value error, which is a member of the decoder struct.
+In the C++ version, use hasError() and getError() of the Decoder.
+The error codes are explained in another section.
+
+Now about colors and settings...
+
+The Decoder contains 3 components:
+*) LodePNG_InfoPng: it stores information about the PNG (the input) in an LodePNG_InfoPng struct, don't modify this one yourself
+*) Settings: you can specify a few other settings for the decoder to use
+*) LodePNG_InfoRaw: here you can say what type of raw image (the output) you want to get
+
+Some of the parameters described below may be inside the sub-struct "LodePNG_InfoColor color".
+In the C and C++ version, when using Info structs outside of the decoder or encoder, you need to use their
+init and cleanup functions, but normally you use the ones in the decoder that are already handled
+in the init and cleanup functions of the decoder itself.
+
+=LodePNG_InfoPng=
+
+This contains information such as the original color type of the PNG image, text
+comments, suggested background color, etc... More details about the LodePNG_InfoPng struct
+are in another section.
+
+Because the dimensions of the image are important, there are shortcuts to get them in the
+C++ version: use decoder.getWidth() and decoder.getHeight().
+In the C version, use decoder.infoPng.width and decoder.infoPng.height.
+
+=LodePNG_InfoRaw=
+
+In the LodePNG_InfoRaw struct of the Decoder, you can specify which color type you want
+the resulting raw image to be. If this is different from the colorType of the
+PNG, then the decoder will automatically convert the result to your LodePNG_InfoRaw
+settings. Currently the following options are supported to convert to:
+-colorType 6, bitDepth 8: 32-bit RGBA
+-colorType 2, bitDepth 8: 24-bit RGB
+-other color types if it's exactly the same as that in the PNG image
+
+Palette of LodePNG_InfoRaw isn't used by the Decoder, when converting from palette color
+to palette color, the values of the pixels are left untouched so that the colors
+will change if the palette is different. Color key of LodePNG_InfoRaw is not used by the
+Decoder. If setting color_convert is false then LodePNG_InfoRaw is completely ignored,
+but it will be modified to match the color type of the PNG so will be overwritten.
+
+By default, 32-bit color is used for the result.
+
+=Settings=
+
+The Settings can be used to ignore the errors created by invalid CRC and Adler32
+chunks, and to disable the decoding of tEXt chunks.
+
+There's also a setting color_convert, true by default. If false, no conversion
+is done, the resulting data will be as it was in the PNG (after decompression)
+and you'll have to puzzle the colors of the pixels together yourself using the
+color type information in the LodePNG_InfoPng.
+
+
+6. Encoder
+----------
+
+This is about the LodePNG_Encoder struct in the C version, and the
+LodePNG::Encoder class in the C++ version.
+
+The Encoder class can be used to convert raw image data into a PNG image.
+
+The PNG part of the encoder is working good, the zlib compression part is
+becoming quite fine but not as good as the official zlib yet, because it's not
+as fast and doesn't provide an as high compression ratio.
+
+Usage:
+
+-in C++:
+ declare a LodePNG::Encoder
+ call its encode member function with the parameters described below
+
+-in C more needs to be done due to the lack of constructors and destructors:
+ declare a LodePNG_Encoder struct
+ call LodePNG_Encoder_init with the struct as parameter
+ call LodePNG_Encode with the parameters described below
+ after usage, call LodePNG_Encoder_cleanup with the struct as parameter
+ after usage, free() the out buffer with PNG data that was created by the encode function
+
+The raw image given to the encoder is an unsigned char* buffer. You also have to
+specify the width and height of the raw image. The result is stored in a given
+buffer. These buffers can be unsigned char* pointers, std::vectors or dynamically
+allocated unsigned char* buffers that you have to free() yourself, depending on
+which you use.
+
+The parameters of the encode function are:
+*) out: in this buffer the PNG file data will be stored (it will be appended)
+*) in: vector of or pointer to a buffer containing the raw image
+*) w and h: the width and height of the raw image in pixels
+
+Make sure that the in buffer you provide, is big enough to contain w * h pixels
+of the color type specified by the LodePNG_InfoRaw.
+
+In the C version, you need to free() the out buffer after usage to avoid memory leaks.
+In the C version, you need to use the LodePNG_Encoder_init function before using the decoder,
+and the LodePNG_Encoder_cleanup function after using it.
+In the C++ version, you don't need to do this since RAII takes care of it.
+
+The encoder generates some errors but not for everything, because, unlike when
+decoding a PNG, when encoding one there aren't so much parameters of the input
+that can be corrupted. It's the responsibility of the user to make sure that all
+preconditions are satesfied, such as giving a correct window size, giving an
+existing btype, making sure the given buffer is large enough to contain an image
+with the given width and height and colortype, ... The encoder can generate
+some errors, see the section with the explanations of errors for those.
+
+Like the Decoder, the Encoder has 3 components:
+*) LodePNG_InfoRaw: here you say what color type of the raw image (the input) has
+*) Settings: you can specify a few settings for the encoder to use
+*) LodePNG_InfoPng: the same LodePNG_InfoPng struct as created by the Decoder. For the encoder,
+with this you specify how you want the PNG (the output) to be.
+
+Some of the parameters described below may be inside the sub-struct "LodePNG_InfoColor color".
+In the C and C++ version, when using Info structs outside of the decoder or encoder, you need to use their
+init and cleanup functions, but normally you use the ones in the encoder that are already handled
+in the init and cleanup functions of the decoder itself.
+
+=LodePNG_InfoPng=
+
+The Decoder class stores information about the PNG image in an LodePNG_InfoPng object. With
+the Encoder you can do the opposite: you give it an LodePNG_InfoPng object, and it'll try
+to match the LodePNG_InfoPng you give as close as possible in the PNG it encodes. For
+example in the LodePNG_InfoPng you can specify the color type you want to use, possible
+tEXt chunks you want the PNG to contain, etc... For an explanation of all the
+values in LodePNG_InfoPng see a further section. Not all PNG color types are supported
+by the Encoder.
+
+Note that the encoder will only TRY to match the LodePNG_InfoPng struct you give.
+Some things are ignored by the encoder. The width and height of LodePNG_InfoPng are
+ignored as well, because instead the width and height of the raw image you give
+in the input are used. In fact the encoder currently uses only the following
+settings from it:
+-colorType: the ones it supports
+-text chunks, that you can add to the LodePNG_InfoPng with "addText"
+-the color key, if applicable for the given color type
+-the palette, if you encode to a PNG with colorType 3
+-the background color: it'll add a bKGD chunk to the PNG if one is given
+-the interlaceMethod: None (0) or Adam7 (1)
+
+When encoding to a PNG with colorType 3, the encoder will generate a PLTE chunk.
+If the palette contains any colors for which the alpha channel is not 255 (so
+there are translucent colors in the palette), it'll add a tRNS chunk.
+
+=LodePNG_InfoRaw=
+
+You specify the color type of the raw image that you give to the input here,
+including a possible transparent color key and palette you happen to be using in
+your raw image data.
+
+By default, 32-bit color is assumed, meaning your input has to be in RGBA
+format with 4 bytes (unsigned chars) per pixel.
+
+=Settings=
+
+The following settings are supported (some are in sub-structs):
+*) autoLeaveOutAlphaChannel: when this option is enabled, when you specify a PNG
+color type with alpha channel (not to be confused with the color type of the raw
+image you specify!!), but the encoder detects that all pixels of the given image
+are opaque, then it'll automatically use the corresponding type without alpha
+channel, resulting in a smaller PNG image.
+*) btype: the block type for LZ77. 0 = uncompressed, 1 = fixed huffman tree, 2 = dynamic huffman tree (best compression)
+*) useLZ77: whether or not to use LZ77 for compressed block types
+*) windowSize: the window size used by the LZ77 encoder (1 - 32768)
+*) force_palette: if colorType is 2 or 6, you can make the encoder write a PLTE
+ chunk if force_palette is true. This can used as suggested palette to convert
+ to by viewers that don't support more than 256 colors (if those still exist)
+*) add_id: add text chunk "Encoder: LodePNG <version>" to the image.
+*) text_compression: default 0. If 1, it'll store texts as zTXt instead of tEXt chunks.
+ zTXt chunks use zlib compression on the text. This gives a smaller result on
+ large texts but a larger result on small texts (such as a single program name).
+ It's all tEXt or all zTXt though, there's no separate setting per text yet.
+
+
+7. color conversions
+--------------------
+
+For trickier usage of LodePNG, you need to understand about PNG color types and
+about how and when LodePNG uses the settings in LodePNG_InfoPng, LodePNG_InfoRaw and Settings.
+
+=PNG color types=
+
+A PNG image can have many color types, ranging from 1-bit color to 64-bit color,
+as well as palettized color modes. After the zlib decompression and unfiltering
+in the PNG image is done, the raw pixel data will have that color type and thus
+a certain amount of bits per pixel. If you want the output raw image after
+decoding to have another color type, a conversion is done by LodePNG.
+
+The PNG specification mentions the following color types:
+
+0: greyscale, bit depths 1, 2, 4, 8, 16
+2: RGB, bit depths 8 and 16
+3: palette, bit depths 1, 2, 4 and 8
+4: greyscale with alpha, bit depths 8 and 16
+6: RGBA, bit depths 8 and 16
+
+Bit depth is the amount of bits per color channel.
+
+=Default Behaviour of LodePNG=
+
+By default, the Decoder will convert the data from the PNG to 32-bit RGBA color,
+no matter what color type the PNG has, so that the result can be used directly
+as a texture in OpenGL etc... without worries about what color type the original
+image has.
+
+The Encoder assumes by default that the raw input you give it is a 32-bit RGBA
+buffer and will store the PNG as either 32 bit or 24 bit depending on whether
+or not any translucent pixels were detected in it.
+
+To get the default behaviour, don't change the values of LodePNG_InfoRaw and LodePNG_InfoPng of
+the encoder, and don't change the values of LodePNG_InfoRaw of the decoder.
+
+=Color Conversions=
+
+As explained in the sections about the Encoder and Decoder, you can specify
+color types and bit depths in LodePNG_InfoPng and LodePNG_InfoRaw, to change the default behaviour
+explained above. (for the Decoder you can only specify the LodePNG_InfoRaw, because the
+LodePNG_InfoPng contains what the PNG file has).
+
+To avoid some confusion:
+-the Decoder converts from PNG to raw image
+-the Encoder converts from raw image to PNG
+-the color type and bit depth in LodePNG_InfoRaw, are those of the raw image
+-the color type and bit depth in LodePNG_InfoPng, are those of the PNG
+-if the color type of the LodePNG_InfoRaw and PNG image aren't the same, a conversion
+between the color types is done if the color types are supported
+
+Supported color types:
+-It's possible to load PNGs from any colortype and to save PNGs of any colorType.
+-Both encoder and decoder use the same converter. So both encoder and decoder
+suport the same color types at the input and the output. So the decoder supports
+any type of PNG image and can convert it to certain types of raw image, while the
+encoder supports any type of raw data but only certain color types for the output PNG.
+-The converter can convert from _any_ input color type, to 24-bit RGB or 32-bit RGBA
+-The converter can convert from greyscale input color type, to 8-bit greyscale or greyscale with alpha
+-If both color types are the same, conversion from anything to anything is possible
+-Color types that are invalid according to the PNG specification are not allowed
+-When converting from a type with alpha channel to one without, the alpha channel information is discarded
+-When converting from a type without alpha channel to one with, the result will be opaque except pixels that have the same color as the color key of the input if one was given
+-When converting from 16-bit bitDepth to 8-bit bitDepth, the 16-bit precision information is lost, only the most significant byte is kept
+-Converting from color to greyscale is not supported on purpose: choosing what kind of color to greyscale conversion to do is not a decision a PNG codec should make
+-Converting from/to a palette type, only keeps the indices, it ignores the colors defined in the palette
+
+No conversion needed...:
+-If the color type of the PNG image and raw image are the same, then no
+conversion is done, and all color types are supported.
+-In the encoder, you can make it save a PNG with any color by giving the
+LodePNG_InfoRaw and LodePNG_InfoPng the same color type.
+-In the decoder, you can make it store the pixel data in the same color type
+as the PNG has, by setting the color_convert setting to false. Settings in
+infoRaw are then ignored.
+
+The function LodePNG_convert does this, which is available in the interface but
+normally isn't needed since the encoder and decoder already call it.
+
+=More Notes=
+
+In the PNG file format, if a less than 8-bit per pixel color type is used and the scanlines
+have a bit amount that isn't a multiple of 8, then padding bits are used so that each
+scanline starts at a fresh byte.
+However: The input image you give to the encoder, and the output image you get from the decoder
+will NOT have these padding bits in that case, e.g. in the case of a 1-bit image with a width
+of 7 pixels, the first pixel of the second scanline will the the 8th bit of the first byte,
+not the first bit of a new byte.
+
+8. info values
+--------------
+
+Both the encoder and decoder use a variable of type LodePNG_InfoPng and LodePNG_InfoRaw, which
+both also contain a LodePNG_InfoColor. Here's a list of each of the values stored in them:
+
+*) info from the PNG header (IHDR chunk):
+
+width: width of the image in pixels
+height: height of the image in pixels
+colorType: color type of the original PNG file
+bitDepth: bits per sample
+compressionMethod: compression method of the original file. Always 0.
+filterMethod: filter method of the original file. Always 0.
+interlaceMethod: interlace method of the original file. 0 is no interlace, 1 is adam7 interlace.
+
+Note: width and height are only used as information of a decoded PNG image. When encoding one, you don't have
+to specify width and height in an LodePNG_Info struct, but you give them as parameters of the encode function.
+The rest of the LodePNG_Info struct IS used by the encoder though!
+
+*) palette:
+
+This is a dynamically allocated unsigned char array with the colors of the palette. The value palettesize
+indicates the amount of colors in the palette. The allocated size of the buffer is 4 * palettesize bytes,
+because there are 4 values per color: R, G, B and A. Even if less color channels are used, the palette
+is always in RGBA format, in the order RGBARGBARGBA.....
+
+When encoding a PNG, to store your colors in the palette of the LodePNG_InfoRaw, first use
+LodePNG_InfoColor_clearPalette, then for each color use LodePNG_InfoColor_addPalette.
+In the C++ version the Encoder class also has the above functions available directly in its interface.
+
+Note that the palette information from the tRNS chunk is also already included in this palette vector.
+
+If you encode an image with palette, don't forget that you have to set the alpha channels (A) of the palette
+too, set them to 255 for an opaque palette. If you leave them at zero, the image will be encoded as
+fully invisible. This both for the palette in the infoRaw and the infoPng if the png is to have a palette.
+
+*) transparent color key
+
+key_defined: is a transparent color key given?
+key_r: red/greyscale component of color key
+key_g: green component of color key
+key_b: blue component of color key
+
+For greyscale PNGs, r, g and b will all 3 be set to the same.
+
+This color is 8-bit for 8-bit PNGs, 16-bit for 16-bit per channel PNGs.
+
+*) suggested background color
+
+background_defined: is a suggested background color given?
+background_r: red component of sugg. background color
+background_g: green component of sugg. background color
+background_b: blue component of sugg. background color
+
+This color is 8-bit for 8-bit PNGs, 16-bit for 16-bit PNGs
+
+For greyscale PNGs, r, g and b will all 3 be set to the same. When encoding
+the encoder writes the red one away.
+For palette PNGs: When decoding, the RGB value will be stored, no a palette
+index. But when encoding, specify the index of the palette in background_r,
+the other two are then ignored.
+
+The decoder pretty much ignores this background color, after all if you make a
+PNG translucent normally you intend it to be used against any background, on
+websites, as translucent textures in games, ... But you can get the color this
+way if needed.
+
+*) text and itext
+
+Non-international text:
+
+-text.keys: a char** buffer containing the keywords (see below)
+-text.strings: a char** buffer containing the texts (see below)
+-text.num: the amount of texts in the above char** buffers (there may be more texts in itext)
+-LodePNG_InfoText_clearText: use this to clear the texts again after you filled them in
+-LodePNG_InfoText_addText: this function is used to push back a keyword and text
+
+International text: This is stored in separate arrays! The sum text.num and itext.num is the real amount of texts.
+
+-itext.keys: keyword in English
+-itext.langtags: ISO 639 letter code for the language
+-itext.transkeys: keyword in this language
+-itext.strings: the text in this language, in UTF-8
+-itext.num: the amount of international texts in this PNG
+-LodePNG_InfoIText_clearText: use this to clear the itexts again after you filled them in
+-LodePNG_InfoIText_addText: this function is used to push back all 4 parts of an itext
+
+Don't allocate these text buffers yourself. Use the init/cleanup functions
+correctly and use addText and clearText.
+
+In the C++ version the Encoder class also has the above functions available directly in its interface.
+The char** buffers are used like the argv parameter of a main() function, and (i)text.num takes the role
+of argc.
+
+In a text, there must be as much keys as strings because they always form pairs. In an itext,
+there must always be as much keys, langtags, transkeys and strings.
+
+They keyword of text chunks gives a short description what the actual text
+represents. There are a few standard standard keywords recognised
+by many programs: Title, Author, Description, Copyright, Creation Time,
+Software, Disclaimer, Warning, Source, Comment. It's allowed to use other keys.
+
+The keyword is minimum 1 character and maximum 79 characters long. It's
+discouraged to use a single line length longer than 79 characters for texts.
+
+*) additional color info
+
+These functions are available with longer names in the C version, and directly
+in the Decoder's interface in the C++ version.
+
+getBpp(): bits per pixel of the PNG image
+getChannels(): amount of color channels of the PNG image
+isGreyscaleType(): it's color type 0 or 4
+isAlphaType(): it's color type 2 or 6
+
+These values are calculated out of color type and bit depth of InfoColor.
+
+The difference between bits per pixel and bit depth is that bit depth is the
+number of bits per color channel, while a pixel can have multiple channels.
+
+*) pHYs chunk (image dimensions)
+
+phys_defined: if 0, there is no pHYs chunk and the values are undefined, if 1 else there is one
+phys_x: pixels per unit in x direction
+phys_y: pixels per unit in y direction
+phys_unit: the unit, 0 is no unit (x and y only give the ratio), 1 is metre
+
+*) tIME chunk (modification time)
+
+time_defined: if 0, there is no tIME chunk and the values are undefined, if 1 there is one
+time: this struct contains year as a 2-byte number (0-65535), month, day, hour, minute,
+second as 1-byte numbers that must be in the correct range
+
+Note: to make the encoder add a time chunk, set time_defined to 1 and fill in
+the correct values in all the time parameters, LodePNG will not fill the current
+time in these values itself, all it does is copy them over into the chunk bytes.
+
+
+9. error values
+---------------
+
+The meanings of the LodePNG error values:
+
+*) 0: no error, everything went ok
+*) 1: the Encoder/Decoder has done nothing yet, so error checking makes no sense yet
+*) 10: while huffman decoding: end of input memory reached without endcode
+*) 11: while huffman decoding: error in code tree made it jump outside of tree
+*) 13: problem while processing dynamic deflate block
+*) 14: problem while processing dynamic deflate block
+*) 15: problem while processing dynamic deflate block
+*) 16: unexisting code while processing dynamic deflate block
+*) 17: while inflating: end of out buffer memory reached
+*) 18: while inflating: invalid distance code
+*) 19: while inflating: end of out buffer memory reached
+*) 20: invalid deflate block BTYPE encountered while decoding
+*) 21: NLEN is not ones complement of LEN in a deflate block
+*) 22: while inflating: end of out buffer memory reached.
+ This can happen if the inflated deflate data is longer than the amount of bytes required to fill up
+ all the pixels of the image, given the color depth and image dimensions. Something that doesn't
+ happen in a normal, well encoded, PNG image.
+*) 23: while inflating: end of in buffer memory reached
+*) 24: invalid FCHECK in zlib header
+*) 25: invalid compression method in zlib header
+*) 26: FDICT encountered in zlib header while it's not used for PNG
+*) 27: PNG file is smaller than a PNG header
+*) 28: incorrect PNG signature (the first 8 bytes of the PNG file)
+ Maybe it's not a PNG, or a PNG file that got corrupted so that the header indicates the corruption.
+*) 29: first chunk is not the header chunk
+*) 30: chunk length too large, chunk broken off at end of file
+*) 31: illegal PNG color type or bpp
+*) 32: illegal PNG compression method
+*) 33: illegal PNG filter method
+*) 34: illegal PNG interlace method
+*) 35: chunk length of a chunk is too large or the chunk too small
+*) 36: illegal PNG filter type encountered
+*) 37: illegal bit depth for this color type given
+*) 38: the palette is too big (more than 256 colors)
+*) 39: more palette alpha values given in tRNS, than there are colors in the palette
+*) 40: tRNS chunk has wrong size for greyscale image
+*) 41: tRNS chunk has wrong size for RGB image
+*) 42: tRNS chunk appeared while it was not allowed for this color type
+*) 43: bKGD chunk has wrong size for palette image
+*) 44: bKGD chunk has wrong size for greyscale image
+*) 45: bKGD chunk has wrong size for RGB image
+*) 46: value encountered in indexed image is larger than the palette size (bitdepth == 8). Is the palette too small?
+*) 47: value encountered in indexed image is larger than the palette size (bitdepth < 8). Is the palette too small?
+*) 48: the input data is empty. Maybe a PNG file you tried to load doesn't exist or is in the wrong path.
+*) 49: jumped past memory while generating dynamic huffman tree
+*) 50: jumped past memory while generating dynamic huffman tree
+*) 51: jumped past memory while inflating huffman block
+*) 52: jumped past memory while inflating
+*) 53: size of zlib data too small
+*) 55: jumped past tree while generating huffman tree, this could be when the
+ tree will have more leaves than symbols after generating it out of the
+ given lenghts. They call this an oversubscribed dynamic bit lengths tree in zlib.
+*) 56: given output image colorType or bitDepth not supported for color conversion
+*) 57: invalid CRC encountered (checking CRC can be disabled)
+*) 58: invalid ADLER32 encountered (checking ADLER32 can be disabled)
+*) 59: conversion to unexisting or unsupported color type or bit depth requested by encoder or decoder
+*) 60: invalid window size given in the settings of the encoder (must be 0-32768)
+*) 61: invalid BTYPE given in the settings of the encoder (only 0, 1 and 2 are allowed)
+*) 62: conversion from non-greyscale color to greyscale color requested by encoder or decoder. LodePNG
+ leaves the choice of RGB to greyscale conversion formula to the user.
+*) 63: length of a chunk too long, max allowed for PNG is 2147483647 bytes per chunk (2^31-1)
+*) 64: the length of the "end" symbol 256 in the Huffman tree is 0, resulting in the inability of a deflated
+ block to ever contain an end code. It must be at least 1.
+*) 66: the length of a text chunk keyword given to the encoder is longer than the maximum 79 bytes.
+*) 67: the length of a text chunk keyword given to the encoder is smaller than the minimum 1 byte.
+*) 68: tried to encode a PLTE chunk with a palette that has less than 1 or more than 256 colors
+*) 69: unknown chunk type with "critical" flag encountered by the decoder
+*) 71: unexisting interlace mode given to encoder (must be 0 or 1)
+*) 72: while decoding, unexisting compression method encountering in zTXt or iTXt chunk (it must be 0)
+*) 73: invalid tIME chunk size
+*) 74: invalid pHYs chunk size
+*) 75: no null termination char found while decoding any kind of text chunk, or wrong length
+*) 76: iTXt chunk too short to contain required bytes
+*) 77: integer overflow in buffer size happened somewhere
+*) 78: file doesn't exist or couldn't be opened for reading
+*) 79: file couldn't be opened for writing
+*) 80: tried creating a tree for 0 symbols
+*) 9900-9999: out of memory while allocating chunk of memory somewhere
+
+
+10. file IO
+-----------
+
+For cases where you want to load the PNG image from a file, you can use your own
+file loading code, or the file loading and saving functions provided with
+LodePNG. These use the same unsigned char format used by the Decoder and Encoder.
+
+The loadFile function fills the given buffer up with the file from harddisk
+with the given name.
+
+The saveFile function saves the contents of the given buffer to the file
+with given name. Warning: this overwrites the contents that were previously in
+the file if it already existed, without warning.
+
+Note that you don't have to decode a PNG image from a file, you can as well
+retrieve the buffer another way in your code, because the decode function takes
+a buffer as parameter, not a filename.
+
+Both C and C++ versions of the loadFile and saveFile functions are available.
+For the C version of loadFile, you need to free() the buffer after use. The
+C++ versions use std::vectors so they clean themselves automatically.
+
+
+11. chunks and PNG editing
+--------------------------
+
+If you want to add extra chunks to a PNG you encode, or use LodePNG for a PNG
+editor that should follow the rules about handling of unknown chunks, or if you
+program is able to read other types of chunks than the ones handled by LodePNG,
+then that's possible with the chunk functions of LodePNG.
+
+A PNG chunk has the following layout:
+
+4 bytes length
+4 bytes type name
+length bytes data
+4 bytes CRC
+
+
+11.1 iterating through chunks
+-----------------------------
+
+If you have a buffer containing the PNG image data, then the first chunk (the
+IHDR chunk) starts at byte number 8 of that buffer. The first 8 bytes are the
+signature of the PNG and are not part of a chunk. But if you start at byte 8
+then you have a chunk, and can check the following things of it.
+
+NOTE: none of these functions check for memory buffer boundaries. To avoid
+exploits, always make sure the buffer contains all the data of the chunks.
+When using LodePNG_chunk_next, make sure the returned value is within the
+allocated memory.
+
+unsigned LodePNG_chunk_length(const unsigned char* chunk):
+
+Get the length of the chunk's data. The total chunk length is this length + 12.
+
+void LodePNG_chunk_type(char type[5], const unsigned char* chunk):
+unsigned char LodePNG_chunk_type_equals(const unsigned char* chunk, const char* type):
+
+Get the type of the chunk or compare if it's a certain type
+
+unsigned char LodePNG_chunk_critical(const unsigned char* chunk):
+unsigned char LodePNG_chunk_private(const unsigned char* chunk):
+unsigned char LodePNG_chunk_safetocopy(const unsigned char* chunk):
+
+Check if the chunk is critical in the PNG standard (only IHDR, PLTE, IDAT and IEND are).
+Check if the chunk is private (public chunks are part of the standard, private ones not).
+Check if the chunk is safe to copy. If it's not, then, when modifying data in a critical
+chunk, unsafe to copy chunks of the old image may NOT be saved in the new one if your
+program doesn't handle that type of unknown chunk.
+
+unsigned char* LodePNG_chunk_data(unsigned char* chunk):
+const unsigned char* LodePNG_chunk_data_const(const unsigned char* chunk):
+
+Get a pointer to the start of the data of the chunk.
+
+unsigned LodePNG_chunk_check_crc(const unsigned char* chunk):
+void LodePNG_chunk_generate_crc(unsigned char* chunk):
+
+Check if the crc is correct or generate a correct one.
+
+unsigned char* LodePNG_chunk_next(unsigned char* chunk):
+const unsigned char* LodePNG_chunk_next_const(const unsigned char* chunk):
+
+Iterate to the next chunk. This works if you have a buffer with consecutive chunks. Note that these
+functions do no boundary checking of the allocated data whatsoever, so make sure there is enough
+data available in the buffer to be able to go to the next chunk.
+
+unsigned LodePNG_append_chunk(unsigned char** out, size_t* outlength, const unsigned char* chunk):
+unsigned LodePNG_create_chunk(unsigned char** out, size_t* outlength, unsigned length, const char* type, const unsigned char* data):
+
+These functions are used to create new chunks that are appended to the data in *out that has
+length *outlength. The append function appends an existing chunk to the new data. The create
+function creates a new chunk with the given parameters and appends it. Type is the 4-letter
+name of the chunk.
+
+
+11.2 chunks in infoPng
+----------------------
+
+The LodePNG_InfoPng struct contains a struct LodePNG_UnknownChunks in it. This
+struct has 3 buffers (each with size) to contain 3 types of unknown chunks:
+the ones that come before the PLTE chunk, the ones that come between the PLTE
+and the IDAT chunks, and the ones that come after the IDAT chunks.
+It's necessary to make the distionction between these 3 cases because the PNG
+standard forces to keep the ordering of unknown chunks compared to the critical
+chunks, but does not force any other ordering rules.
+
+infoPng.unknown_chunks.data[0] is the chunks before PLTE
+infoPng.unknown_chunks.data[1] is the chunks after PLTE, before IDAT
+infoPng.unknown_chunks.data[2] is the chunks after IDAT
+
+The chunks in these 3 buffers can be iterated through and read by using the same
+way described in the previous subchapter.
+
+When using the decoder to decode a PNG, you can make it store all unknown chunks
+if you set the option settings.rememberUnknownChunks to 1. By default, this option
+is off and is 0.
+
+The encoder will always encode unknown chunks that are stored in the infoPng. If
+you need it to add a particular chunk that isn't known by LodePNG, you can use
+LodePNG_append_chunk or LodePNG_create_chunk to the chunk data in
+infoPng.unknown_chunks.data[x].
+
+Chunks that are known by LodePNG should not be added in that way. E.g. to make
+LodePNG add a bKGD chunk, set background_defined to true and add the correct
+parameters there and LodePNG will generate the chunk.
+
+
+12. compiler support
+--------------------
+
+No libraries other than the current standard C library are needed to compile
+LodePNG. For the C++ version, only the standard C++ library is needed on top.
+Add the files lodepng.c(pp) and lodepng.h to your project, include
+lodepng.h where needed, and your program can read/write PNG files.
+
+Use optimization! For both the encoder and decoder, compiling with the best
+optimizations makes a large difference.
+
+Make sure that LodePNG is compiled with the same compiler of the same version
+and with the same settings as the rest of the program, or the interfaces with
+std::vectors and std::strings in C++ can be incompatible resulting in bad things.
+
+CHAR_BITS must be 8 or higher, because LodePNG uses unsigned chars for octets.
+
+*) gcc and g++
+
+LodePNG is developed in gcc so this compiler is natively supported. It gives no
+warnings with compiler options "-Wall -Wextra -pedantic -ansi", with gcc and g++
+version 4.2.2 on Linux.
+
+*) Mingw and Bloodshed DevC++
+
+The Mingw compiler (a port of gcc) used by Bloodshed DevC++ for Windows is fully
+supported by LodePNG.
+
+*) Visual Studio 2005 and Visual C++ 2005 Express Edition
+
+Versions 20070604 up to 20080107 have been tested on VS2005 and work. There are no
+warnings, except two warnings about 'fopen' being deprecated. 'fopen' is a function
+required by the C standard, so this warning is the fault of VS2005, it's nice of
+them to enforce secure code, however the multiplatform LodePNG can't follow their
+non-standard extensions. LodePNG is fully ISO C90 compliant.
+
+If you're using LodePNG in VS2005 and don't want to see the deprecated warnings,
+put this on top of lodepng.h before the inclusions: #define _CRT_SECURE_NO_DEPRECATE
+
+*) Visual Studio 6.0
+
+The C++ version of LodePNG was not supported by Visual Studio 6.0 because Visual
+Studio 6.0 doesn't follow the C++ standard and implements it incorrectly.
+The current C version of LodePNG has not been tested in VS6 but may work now.
+
+*) Comeau C/C++
+
+Vesion 20070107 compiles without problems on the Comeau C/C++ Online Test Drive
+at http://www.comeaucomputing.com/tryitout in both C90 and C++ mode.
+
+*) Compilers on Macintosh
+
+I'd love to support Macintosh but don't have one available to test it on.
+If it doesn't work with your compiler, maybe it can be gotten to work with the
+gcc compiler for Macintosh. Someone reported that it doesn't work well at all
+for Macintosh. All information on attempts to get it to work on Mac is welcome.
+
+*) Other Compilers
+
+If you encounter problems on other compilers, I'm happy to help out make LodePNG
+support the compiler if it supports the ISO C90 and C++ standard well enough. If
+the required modification to support the compiler requires using non standard or
+lesser C/C++ code or headers, I won't support it.
+
+
+13. examples
+------------
+
+This decoder and encoder example show the most basic usage of LodePNG (using the
+classes, not the simple functions, which would be trivial)
+
+More complex examples can be found in:
+-lodepng_examples.c: 9 different examples in C, such as showing the image with SDL, ...
+-lodepng_examples.cpp: the exact same examples in C++ using the C++ wrapper of LodePNG
+
+
+13.1. decoder C++ example
+-------------------------
+
+////////////////////////////////////////////////////////////////////////////////
+#include "coding/lodepng.h"
+#include <iostream>
+
+int main(int argc, char *argv[])
+{
+ const char* filename = argc > 1 ? argv[1] : "test.png";
+
+ //load and decode
+ std::vector<unsigned char> buffer, image;
+ LodePNG::loadFile(buffer, filename); //load the image file with given filename
+ LodePNG::Decoder decoder;
+ decoder.decode(image, buffer.size() ? &buffer[0] : 0, (unsigned)buffer.size()); //decode the png
+
+ //if there's an error, display it
+ if(decoder.hasError()) std::cout << "error: " << decoder.getError() << std::endl;
+
+ //the pixels are now in the vector "image", use it as texture, draw it, ...
+}
+
+//alternative version using the "simple" function
+int main(int argc, char *argv[])
+{
+ const char* filename = argc > 1 ? argv[1] : "test.png";
+
+ //load and decode
+ std::vector<unsigned char> image;
+ unsigned w, h;
+ unsigned error = LodePNG::decode(image, w, h, filename);
+
+ //if there's an error, display it
+ if(error != 0) std::cout << "error: " << error << std::endl;
+
+ //the pixels are now in the vector "image", use it as texture, draw it, ...
+}
+////////////////////////////////////////////////////////////////////////////////
+
+
+13.2 encoder C++ example
+------------------------
+
+////////////////////////////////////////////////////////////////////////////////
+#include "coding/lodepng.h"
+#include <iostream>
+
+int main(int argc, char *argv[])
+{
+ //check if user gave a filename
+ if(argc <= 1)
+ {
+ std::cout << "please provide a filename to save to\n";
+ return 0;
+ }
+
+ //generate some image
+ std::vector<unsigned char> image;
+ image.resize(512 * 512 * 4);
+ for(unsigned y = 0; y < 512; y++)
+ for(unsigned x = 0; x < 512; x++)
+ {
+ image[4 * 512 * y + 4 * x + 0] = 255 * !(x & y);
+ image[4 * 512 * y + 4 * x + 1] = x ^ y;
+ image[4 * 512 * y + 4 * x + 2] = x | y;
+ image[4 * 512 * y + 4 * x + 3] = 255;
+ }
+
+ //encode and save
+ std::vector<unsigned char> buffer;
+ LodePNG::Encoder encoder;
+ encoder.encode(buffer, image, 512, 512);
+ LodePNG::saveFile(buffer, argv[1]);
+
+ //the same as the 4 lines of code above, but in 1 call:
+ //LodePNG::encode(argv[1], image, 512, 512);
+}
+////////////////////////////////////////////////////////////////////////////////
+
+
+13.3 Decoder C example
+----------------------
+
+This example loads the PNG in 1 function call
+
+#include "coding/lodepng.h"
+
+int main(int argc, char *argv[])
+{
+ unsigned error;
+ unsigned char* image;
+ size_t w, h;
+
+ if(argc <= 1) return 0;
+
+ error = LodePNG_decode3(&image, &w, &h, filename);
+
+ free(image);
+}
+
+
+14. LodeZlib
+------------
+
+Also available in the interface is LodeZlib. Both C and C++ versions of these
+functions are available. The interface is similar to that of the "simple" PNG
+encoding and decoding functions.
+
+LodeZlib can be used to zlib compress and decompress a buffer. It cannot be
+used to create gzip files however. Also, it only supports the part of zlib
+that is required for PNG, it does not support compression and decompression
+with dictionaries.
+
+
+15. changes
+-----------
+
+The version number of LodePNG is the date of the change given in the format
+yyyymmdd.
+
+Some changes aren't backwards compatible. Those are indicated with a (!)
+symbol.
+
+*) 14 mar 2010: fixed bug where too much memory was allocated for char buffers.
+*) 02 sep 2008: fixed bug where it could create empty tree that linux apps could
+ read by ignoring the problem but windows apps couldn't.
+*) 06 jun 2008: added more error checks for out of memory cases.
+*) 26 apr 2008: added a few more checks here and there to ensure more safety.
+*) 06 mar 2008: crash with encoding of strings fixed
+*) 02 feb 2008: support for international text chunks added (iTXt)
+*) 23 jan 2008: small cleanups, and #defines to divide code in sections
+*) 20 jan 2008: support for unknown chunks allowing using LodePNG for an editor.
+*) 18 jan 2008: support for tIME and pHYs chunks added to encoder and decoder.
+*) 17 jan 2008: ability to encode and decode compressed zTXt chunks added
+ Also vareous fixes, such as in the deflate and the padding bits code.
+*) 13 jan 2008: Added ability to encode Adam7-interlaced images. Improved
+ filtering code of encoder.
+*) 07 jan 2008: (!) changed LodePNG to use ISO C90 instead of C++. A
+ C++ wrapper around this provides an interface almost identical to before.
+ Having LodePNG be pure ISO C90 makes it more portable. The C and C++ code
+ are together in these files but it works both for C and C++ compilers.
+*) 29 dec 2007: (!) changed most integer types to unsigned int + other tweaks
+*) 30 aug 2007: bug fixed which makes this Borland C++ compatible
+*) 09 aug 2007: some VS2005 warnings removed again
+*) 21 jul 2007: deflate code placed in new namespace separate from zlib code
+*) 08 jun 2007: fixed bug with 2- and 4-bit color, and small interlaced images
+*) 04 jun 2007: improved support for Visual Studio 2005: crash with accessing
+ invalid std::vector element [0] fixed, and level 3 and 4 warnings removed
+*) 02 jun 2007: made the encoder add a tag with version by default
+*) 27 may 2007: zlib and png code separated (but still in the same file),
+ simple encoder/decoder functions added for more simple usage cases
+*) 19 may 2007: minor fixes, some code cleaning, new error added (error 69),
+ moved some examples from here to lodepng_examples.cpp
+*) 12 may 2007: palette decoding bug fixed
+*) 24 apr 2007: changed the license from BSD to the zlib license
+*) 11 mar 2007: very simple addition: ability to encode bKGD chunks.
+*) 04 mar 2007: (!) tEXt chunk related fixes, and support for encoding
+ palettized PNG images. Plus little interface change with palette and texts.
+*) 03 mar 2007: Made it encode dynamic Huffman shorter with repeat codes.
+ Fixed a bug where the end code of a block had length 0 in the Huffman tree.
+*) 26 feb 2007: Huffman compression with dynamic trees (BTYPE 2) now implemented
+ and supported by the encoder, resulting in smaller PNGs at the output.
+*) 27 jan 2007: Made the Adler-32 test faster so that a timewaste is gone.
+*) 24 jan 2007: gave encoder an error interface. Added color conversion from any
+ greyscale type to 8-bit greyscale with or without alpha.
+*) 21 jan 2007: (!) Totally changed the interface. It allows more color types
+ to convert to and is more uniform. See the manual for how it works now.
+*) 07 jan 2007: Some cleanup & fixes, and a few changes over the last days:
+ encode/decode custom tEXt chunks, separate classes for zlib & deflate, and
+ at last made the decoder give errors for incorrect Adler32 or Crc.
+*) 01 jan 2007: Fixed bug with encoding PNGs with less than 8 bits per channel.
+*) 29 dec 2006: Added support for encoding images without alpha channel, and
+ cleaned out code as well as making certain parts faster.
+*) 28 dec 2006: Added "Settings" to the encoder.
+*) 26 dec 2006: The encoder now does LZ77 encoding and produces much smaller files now.
+ Removed some code duplication in the decoder. Fixed little bug in an example.
+*) 09 dec 2006: (!) Placed output parameters of public functions as first parameter.
+ Fixed a bug of the decoder with 16-bit per color.
+*) 15 okt 2006: Changed documentation structure
+*) 09 okt 2006: Encoder class added. It encodes a valid PNG image from the
+ given image buffer, however for now it's not compressed.
+*) 08 sep 2006: (!) Changed to interface with a Decoder class
+*) 30 jul 2006: (!) LodePNG_InfoPng , width and height are now retrieved in different
+ way. Renamed decodePNG to decodePNGGeneric.
+*) 29 jul 2006: (!) Changed the interface: image info is now returned as a
+ struct of type LodePNG::LodePNG_Info, instead of a vector, which was a bit clumsy.
+*) 28 jul 2006: Cleaned the code and added new error checks.
+ Corrected terminology "deflate" into "inflate".
+*) 23 jun 2006: Added SDL example in the documentation in the header, this
+ example allows easy debugging by displaying the PNG and its transparency.
+*) 22 jun 2006: (!) Changed way to obtain error value. Added
+ loadFile function for convenience. Made decodePNG32 faster.
+*) 21 jun 2006: (!) Changed type of info vector to unsigned.
+ Changed position of palette in info vector. Fixed an important bug that
+ happened on PNGs with an uncompressed block.
+*) 16 jun 2006: Internally changed unsigned into unsigned where
+ needed, and performed some optimizations.
+*) 07 jun 2006: (!) Renamed functions to decodePNG and placed them
+ in LodePNG namespace. Changed the order of the parameters. Rewrote the
+ documentation in the header. Renamed files to lodepng.cpp and lodepng.h
+*) 22 apr 2006: Optimized and improved some code
+*) 07 sep 2005: (!) Changed to std::vector interface
+*) 12 aug 2005: Initial release
+
+
+16. contact information
+-----------------------
+
+Feel free to contact me with suggestions, problems, comments, ... concerning
+LodePNG. If you encounter a PNG image that doesn't work properly with this
+decoder, feel free to send it and I'll use it to find and fix the problem.
+
+My email address is (puzzle the account and domain together with an @ symbol):
+Domain: gmail dot com.
+Account: lode dot vandevenne.
+
+
+Copyright (c) 2005-2008 Lode Vandevenne
+*/
diff --git a/3party/lodepng/lodepng_io.hpp b/3party/lodepng/lodepng_io.hpp
new file mode 100644
index 0000000000..23b7787e70
--- /dev/null
+++ b/3party/lodepng/lodepng_io.hpp
@@ -0,0 +1,211 @@
+/*
+ Copyright 2005-2007 Adobe Systems Incorporated
+
+ Use, modification and distribution are subject to the Boost Software License,
+ Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+ http://www.boost.org/LICENSE_1_0.txt).
+
+ See http://opensource.adobe.com/gil for most recent version including documentation.
+*/
+
+/*************************************************************************************************/
+
+#ifndef GIL_LODEPNG_IO_H
+#define GIL_LODEPNG_IO_H
+
+/// \file
+/// \brief Support for reading and writing PNG files
+/// using LodePNG
+//
+// We are currently providing the following functions:
+// point2<std::ptrdiff_t> lodepng_read_dimensions(const char*)
+// template <typename View> void lodepng_read_view(const char*,const View&)
+// template <typename View> void lodepng_read_image(const char*,image<View>&)
+// template <typename View> void lodepng_write_view(const char*,const View&)
+// template <typename View> struct lodepng_read_support;
+// template <typename View> struct lodepng_write_support;
+//
+/// \author Rachytski Siarhei
+/// \date 2010 \n Last updated June 20, 2010
+
+#include <stdio.h>
+#include <string>
+#include <boost/static_assert.hpp>
+#include <boost/gil/gil_config.hpp>
+#include <boost/gil/utilities.hpp>
+#include <boost/gil/extension/io/io_error.hpp>
+#include "lodepng_io_private.hpp"
+
+namespace boost { namespace gil {
+
+/// \ingroup LODEPNG_IO
+/// \brief Returns the width and height of the PNG file at the specified location.
+/// Throws std::ios_base::failure if the location does not correspond to a valid PNG file
+inline point2<std::ptrdiff_t> lodepng_read_dimensions(ReaderPtr<Reader> & reader) {
+ detail::lodepng_reader m(reader);
+ return m.get_dimensions();
+}
+
+/// \ingroup LODEPNG_IO
+/// \brief Returns the width and height of the PNG file at the specified location.
+/// Throws std::ios_base::failure if the location does not correspond to a valid PNG file
+//inline point2<std::ptrdiff_t> lodepng_read_dimensions(ReaderPtr<Reader> & reader) {
+// return lodepng_read_dimensions(reader);
+//}
+
+/// \ingroup LODEPNG_IO
+/// \brief Determines whether the given view type is supported for reading
+template <typename View>
+struct lodepng_read_support {
+ BOOST_STATIC_CONSTANT(bool,is_supported=
+ (detail::lodepng_read_support_private<typename channel_type<View>::type,
+ typename color_space_type<View>::type>::is_supported));
+ BOOST_STATIC_CONSTANT(int,bit_depth=
+ (detail::lodepng_read_support_private<typename channel_type<View>::type,
+ typename color_space_type<View>::type>::bit_depth));
+ BOOST_STATIC_CONSTANT(int,color_type=
+ (detail::lodepng_read_support_private<typename channel_type<View>::type,
+ typename color_space_type<View>::type>::color_type));
+ BOOST_STATIC_CONSTANT(bool, value=is_supported);
+};
+
+/// \ingroup LODEPNG_IO
+/// \brief Loads the image specified by the given png image file name into the given view.
+/// Triggers a compile assert if the view color space and channel depth are not supported by the PNG library or by the I/O extension.
+/// Throws std::ios_base::failure if the file is not a valid PNG file, or if its color space or channel depth are not
+/// compatible with the ones specified by View, or if its dimensions don't match the ones of the view.
+template <typename View>
+inline void lodepng_read_view(ReaderPtr<Reader> & reader, const View& view) {
+ BOOST_STATIC_ASSERT(lodepng_read_support<View>::is_supported);
+ detail::lodepng_reader m(reader);
+ m.apply(view);
+}
+
+/// \ingroup LODEPNG_IO
+/// \brief Loads the image specified by the given png image file name into the given view.
+template <typename View>
+inline void lodepng_read_view(const std::string& filename,const View& view) {
+ lodepng_read_view(filename.c_str(),view);
+}
+
+/// \ingroup LODEPNG_IO
+/// \brief Allocates a new image whose dimensions are determined by the given png image file, and loads the pixels into it.
+/// Triggers a compile assert if the image color space or channel depth are not supported by the PNG library or by the I/O extension.
+/// Throws std::ios_base::failure if the file is not a valid PNG file, or if its color space or channel depth are not
+/// compatible with the ones specified by Image
+template <typename Image>
+inline void lodepng_read_image(ReaderPtr<Reader> & reader, Image& im) {
+ BOOST_STATIC_ASSERT(lodepng_read_support<typename Image::view_t>::is_supported);
+ detail::lodepng_reader m(reader);
+ m.read_image(im);
+}
+
+/// \ingroup LODEPNG_IO
+/// \brief Allocates a new image whose dimensions are determined by the given png image file, and loads the pixels into it.
+template <typename Image>
+inline void lodepng_read_image(const std::string& filename,Image& im) {
+ lodepng_read_image(filename.c_str(),im);
+}
+
+/// \ingroup LODEPNG_IO
+/// \brief Loads the image specified by the given png image file name and color-converts it into the given view.
+/// Throws std::ios_base::failure if the file is not a valid PNG file, or if its dimensions don't match the ones of the view.
+template <typename View,typename CC>
+inline void lodepng_read_and_convert_view(const char* filename,const View& view,CC cc) {
+ detail::lodepng_reader_color_convert<CC> m(filename,cc);
+ m.apply(view);
+}
+
+/// \ingroup LODEPNG_IO
+/// \brief Loads the image specified by the given png image file name and color-converts it into the given view.
+/// Throws std::ios_base::failure if the file is not a valid PNG file, or if its dimensions don't match the ones of the view.
+template <typename View>
+inline void lodepng_read_and_convert_view(ReaderPtr<Reader> & reader,const View& view) {
+ detail::lodepng_reader_color_convert<default_color_converter> m(reader,default_color_converter());
+ m.apply(view);
+}
+
+/// \ingroup LODEPNG_IO
+/// \brief Loads the image specified by the given png image file name and color-converts it into the given view.
+template <typename View,typename CC>
+inline void lodepng_read_and_convert_view(ReaderPtr<Reader> & reader,const View& view,CC cc) {
+ detail::lodepng_reader_color_convert<CC> m(reader, cc);
+ m.apply(view);
+}
+
+/// \ingroup LODEPNG_IO
+/// \brief Loads the image specified by the given png image file name and color-converts it into the given view.
+//template <typename View>
+//inline void lodepng_read_and_convert_view(ReaderPtr<Reader> & reader,const View& view) {
+// lodepng_read_and_convert_view(reader,view);
+//}
+
+/// \ingroup LODEPNG_IO
+/// \brief Allocates a new image whose dimensions are determined by the given png image file, loads and color-converts the pixels into it.
+/// Throws std::ios_base::failure if the file is not a valid PNG file
+template <typename Image,typename CC>
+inline void lodepng_read_and_convert_image(ReaderPtr<Reader> & reader,Image& im,CC cc) {
+ detail::lodepng_reader_color_convert<CC> m(reader,cc);
+ m.read_image(im);
+}
+
+/// \ingroup LODEPNG_IO
+/// \brief Allocates a new image whose dimensions are determined by the given png image file, loads and color-converts the pixels into it.
+/// Throws std::ios_base::failure if the file is not a valid PNG file
+template <typename Image>
+inline void lodepng_read_and_convert_image(ReaderPtr<Reader> & reader, Image& im) {
+ detail::lodepng_reader_color_convert<default_color_converter> m(reader, default_color_converter());
+ m.read_image(im);
+}
+
+/// \ingroup LODEPNG_IO
+/// \brief Allocates a new image whose dimensions are determined by the given png image file, loads and color-converts the pixels into it.
+template <typename Image,typename CC>
+inline void lodepng_read_and_convert_image(const std::string& filename,Image& im,CC cc) {
+ lodepng_read_and_convert_image(filename.c_str(),im,cc);
+}
+
+/// \ingroup LODEPNG_IO
+/// \brief Allocates a new image whose dimensions are determined by the given png image file, loads and color-converts the pixels into it.
+template <typename Image>
+inline void lodepng_read_and_convert_image(const std::string& filename,Image& im) {
+ lodepng_read_and_convert_image(filename.c_str(),im);
+}
+
+/// \ingroup LODEPNG_IO
+/// \brief Determines whether the given view type is supported for writing
+template <typename View>
+struct lodepng_write_support {
+ BOOST_STATIC_CONSTANT(bool,is_supported=
+ (detail::lodepng_write_support_private<typename channel_type<View>::type,
+ typename color_space_type<View>::type>::is_supported));
+ BOOST_STATIC_CONSTANT(int,bit_depth=
+ (detail::lodepng_write_support_private<typename channel_type<View>::type,
+ typename color_space_type<View>::type>::bit_depth));
+ BOOST_STATIC_CONSTANT(int,color_type=
+ (detail::lodepng_write_support_private<typename channel_type<View>::type,
+ typename color_space_type<View>::type>::color_type));
+ BOOST_STATIC_CONSTANT(bool, value=is_supported);
+};
+
+/// \ingroup LODEPNG_IO
+/// \brief Saves the view to a png file specified by the given png image file name.
+/// Triggers a compile assert if the view color space and channel depth are not supported by the PNG library or by the I/O extension.
+/// Throws std::ios_base::failure if it fails to create the file.
+template <typename View>
+inline void lodepng_write_view(WriterPtr<Writer> & writer,const View& view) {
+ BOOST_STATIC_ASSERT(lodepng_write_support<View>::is_supported);
+ detail::lodepng_writer m(writer);
+ m.apply(view);
+}
+
+/// \ingroup LODEPNG_IO
+/// \brief Saves the view to a png file specified by the given png image file name.
+/*template <typename View>
+inline void lodepng_write_view(const std::string& filename,const View& view) {
+ lodepng_write_view(filename.c_str(),view);
+}*/
+
+} } // namespace boost::gil
+
+#endif
diff --git a/3party/lodepng/lodepng_io_private.hpp b/3party/lodepng/lodepng_io_private.hpp
new file mode 100644
index 0000000000..309c9656f2
--- /dev/null
+++ b/3party/lodepng/lodepng_io_private.hpp
@@ -0,0 +1,439 @@
+/*
+ Copyright 2005-2007 Adobe Systems Incorporated
+
+ Use, modification and distribution are subject to the Boost Software License,
+ Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+ http://www.boost.org/LICENSE_1_0.txt).
+
+ See http://stlab.adobe.com/gil for most recent version including documentation.
+*/
+/*************************************************************************************************/
+
+#ifndef GIL_LODEPNG_IO_PRIVATE_H
+#define GIL_LODEPNG_IO_PRIVATE_H
+
+/// \file
+/// \brief Internal support for reading and writing PNG files
+/// \author Hailin Jin and Lubomir Bourdev \n
+/// Adobe Systems Incorporated
+/// \date 2005-2007 \n Last updated August 14, 2007
+
+#include <algorithm>
+#include <vector>
+#include <boost/static_assert.hpp>
+#include <boost/gil/gil_all.hpp>
+#include <boost/gil/extension/io/io_error.hpp>
+#include "lodepng.hpp"
+
+namespace boost { namespace gil {
+
+namespace detail {
+
+static const std::size_t LODEPNG_BYTES_TO_CHECK = 4;
+
+static const int LODEPNG_COLOR_MASK_PALETTE = 1;
+static const int LODEPNG_COLOR_MASK_COLOR = 2;
+static const int LODEPNG_COLOR_MASK_ALPHA = 4;
+static const int LODEPNG_COLOR_TYPE_GRAY = 0;
+static const int LODEPNG_COLOR_TYPE_PALETTE = (LODEPNG_COLOR_MASK_COLOR | LODEPNG_COLOR_MASK_PALETTE);
+static const int LODEPNG_COLOR_TYPE_RGB = (LODEPNG_COLOR_MASK_COLOR);
+static const int LODEPNG_COLOR_TYPE_RGB_ALPHA = (LODEPNG_COLOR_MASK_COLOR | LODEPNG_COLOR_MASK_ALPHA);
+static const int LODEPNG_COLOR_TYPE_GRAY_ALPHA = (LODEPNG_COLOR_MASK_ALPHA);
+static const int LODEPNG_COLOR_TYPE_RGBA = LODEPNG_COLOR_TYPE_RGB_ALPHA;
+static const int LODEPNG_COLOR_TYPE_GA = LODEPNG_COLOR_TYPE_GRAY_ALPHA;
+
+
+// lbourdev: These can be greatly simplified, for example:
+template <typename Cs> struct lodepng_color_type {BOOST_STATIC_CONSTANT(int,color_type=0);};
+template<> struct lodepng_color_type<gray_t> { BOOST_STATIC_CONSTANT(int,color_type=LODEPNG_COLOR_TYPE_GRAY); };
+template<> struct lodepng_color_type<rgb_t> { BOOST_STATIC_CONSTANT(int,color_type=LODEPNG_COLOR_TYPE_RGB); };
+template<> struct lodepng_color_type<rgba_t> { BOOST_STATIC_CONSTANT(int,color_type=LODEPNG_COLOR_TYPE_RGBA); };
+
+template <typename Channel,typename ColorSpace> struct lodepng_is_supported {BOOST_STATIC_CONSTANT(bool,value=false);};
+template <> struct lodepng_is_supported<bits8,gray_t> {BOOST_STATIC_CONSTANT(bool,value=true);};
+template <> struct lodepng_is_supported<bits8,rgb_t> {BOOST_STATIC_CONSTANT(bool,value=true);};
+template <> struct lodepng_is_supported<bits8,rgba_t> {BOOST_STATIC_CONSTANT(bool,value=true);};
+template <> struct lodepng_is_supported<bits16,gray_t> {BOOST_STATIC_CONSTANT(bool,value=true);};
+template <> struct lodepng_is_supported<bits16,rgb_t> {BOOST_STATIC_CONSTANT(bool,value=true);};
+template <> struct lodepng_is_supported<bits16,rgba_t> {BOOST_STATIC_CONSTANT(bool,value=true);};
+
+template <typename Channel> struct lodepng_bit_depth {BOOST_STATIC_CONSTANT(int,bit_depth=sizeof(Channel)*8);};
+
+template <typename Channel,typename ColorSpace>
+struct lodepng_read_support_private {
+ BOOST_STATIC_CONSTANT(bool,is_supported=false);
+ BOOST_STATIC_CONSTANT(int,bit_depth=0);
+ BOOST_STATIC_CONSTANT(int,color_type=0);
+};
+template <>
+struct lodepng_read_support_private<bits8,gray_t> {
+ BOOST_STATIC_CONSTANT(bool,is_supported=true);
+ BOOST_STATIC_CONSTANT(int,bit_depth=8);
+ BOOST_STATIC_CONSTANT(int,color_type=LODEPNG_COLOR_TYPE_GRAY);
+};
+template <>
+struct lodepng_read_support_private<bits8,rgb_t> {
+ BOOST_STATIC_CONSTANT(bool,is_supported=true);
+ BOOST_STATIC_CONSTANT(int,bit_depth=8);
+ BOOST_STATIC_CONSTANT(int,color_type=LODEPNG_COLOR_TYPE_RGB);
+};
+template <>
+struct lodepng_read_support_private<bits8,rgba_t> {
+ BOOST_STATIC_CONSTANT(bool,is_supported=true);
+ BOOST_STATIC_CONSTANT(int,bit_depth=8);
+ BOOST_STATIC_CONSTANT(int,color_type=LODEPNG_COLOR_TYPE_RGBA);
+};
+template <>
+struct lodepng_read_support_private<bits16,gray_t> {
+ BOOST_STATIC_CONSTANT(bool,is_supported=true);
+ BOOST_STATIC_CONSTANT(int,bit_depth=16);
+ BOOST_STATIC_CONSTANT(int,color_type=LODEPNG_COLOR_TYPE_GRAY);
+};
+template <>
+struct lodepng_read_support_private<bits16,rgb_t> {
+ BOOST_STATIC_CONSTANT(bool,is_supported=true);
+ BOOST_STATIC_CONSTANT(int,bit_depth=16);
+ BOOST_STATIC_CONSTANT(int,color_type=LODEPNG_COLOR_TYPE_RGB);
+};
+template <>
+struct lodepng_read_support_private<bits16,rgba_t> {
+ BOOST_STATIC_CONSTANT(bool,is_supported=true);
+ BOOST_STATIC_CONSTANT(int,bit_depth=16);
+ BOOST_STATIC_CONSTANT(int,color_type=LODEPNG_COLOR_TYPE_RGBA);
+};
+
+template <typename Channel,typename ColorSpace>
+struct lodepng_write_support_private {
+ BOOST_STATIC_CONSTANT(bool,is_supported=false);
+ BOOST_STATIC_CONSTANT(int,bit_depth=0);
+ BOOST_STATIC_CONSTANT(int,color_type=0);
+};
+template <>
+struct lodepng_write_support_private<bits8,gray_t> {
+ BOOST_STATIC_CONSTANT(bool,is_supported=true);
+ BOOST_STATIC_CONSTANT(int,bit_depth=8);
+ BOOST_STATIC_CONSTANT(int,color_type=LODEPNG_COLOR_TYPE_GRAY);
+};
+template <>
+struct lodepng_write_support_private<bits8,rgb_t> {
+ BOOST_STATIC_CONSTANT(bool,is_supported=true);
+ BOOST_STATIC_CONSTANT(int,bit_depth=8);
+ BOOST_STATIC_CONSTANT(int,color_type=LODEPNG_COLOR_TYPE_RGB);
+};
+template <>
+struct lodepng_write_support_private<bits8,rgba_t> {
+ BOOST_STATIC_CONSTANT(bool,is_supported=true);
+ BOOST_STATIC_CONSTANT(int,bit_depth=8);
+ BOOST_STATIC_CONSTANT(int,color_type=LODEPNG_COLOR_TYPE_RGBA);
+};
+template <>
+struct lodepng_write_support_private<bits16,gray_t> {
+ BOOST_STATIC_CONSTANT(bool,is_supported=true);
+ BOOST_STATIC_CONSTANT(int,bit_depth=16);
+ BOOST_STATIC_CONSTANT(int,color_type=LODEPNG_COLOR_TYPE_GRAY);
+};
+template <>
+struct lodepng_write_support_private<bits16,rgb_t> {
+ BOOST_STATIC_CONSTANT(bool,is_supported=true);
+ BOOST_STATIC_CONSTANT(int,bit_depth=16);
+ BOOST_STATIC_CONSTANT(int,color_type=LODEPNG_COLOR_TYPE_RGB);
+};
+template <>
+struct lodepng_write_support_private<bits16,rgba_t> {
+ BOOST_STATIC_CONSTANT(bool,is_supported=true);
+ BOOST_STATIC_CONSTANT(int,bit_depth=16);
+ BOOST_STATIC_CONSTANT(int,color_type=LODEPNG_COLOR_TYPE_RGBA);
+};
+
+class lodepng_reader {
+protected:
+
+ LodePNG::Decoder m_decoder;
+ ReaderPtr<Reader> & m_reader;
+
+ int sig_cmp(unsigned char * sig, size_t start, size_t num_to_check)
+ {
+ unsigned char png_sig[8] = {137, 80, 78, 71, 13, 10, 26, 10};
+ if (num_to_check > 8)
+ num_to_check = 8;
+ else if (num_to_check < 1)
+ return (-1);
+
+ if (start > 7)
+ return (-1);
+
+ if (start + num_to_check > 8)
+ num_to_check = 8 - start;
+
+ for (size_t i = 0; i < num_to_check; ++i)
+ if (sig[i] != png_sig[i])
+ return -1;
+
+ return 0;
+ }
+
+ void init()
+ {
+ // 29 bytes are required to read: 8-bytes PNG magic, 4-bytes
+ // chunk length, 4-bytes chunk type, 4-bytes width, 4-bytes
+ // height, 1-byte bit depth, 1-byte color type, 1-byte
+ // compression type, 1-byte filter type and 1-byte interlace
+ // type.
+ //
+ // 4 more bytes are needed if CRC32 sum should be checked.
+ size_t const kMinSize = 29;
+ size_t const kMaxSize = kMinSize + 4;
+
+ unsigned char buf[kMaxSize];
+ size_t const size = m_decoder.settings.ignoreCrc ? kMinSize : kMaxSize;
+ m_reader.Read(0, buf, size);
+ // io_error_if(fread(buf, 1, 30, get()) != 30,
+ // "lodepng_check_validity: fail to read file");
+ m_decoder.inspect(buf, size);
+ }
+
+public:
+
+ lodepng_reader(ReaderPtr<Reader> & reader) : m_reader(reader) { init(); }
+
+ point2<std::ptrdiff_t> get_dimensions() {
+ return point2<std::ptrdiff_t>(m_decoder.getWidth(), m_decoder.getHeight());
+ }
+
+ template <typename View>
+ void apply(const View& view)
+ {
+ io_error_if((view.width() != m_decoder.getWidth() || view.height() != m_decoder.getHeight()),
+ "lodepng_read_view: input view size does not match PNG file size");
+
+ int bitDepth = lodepng_read_support_private<typename channel_type<View>::type,
+ typename color_space_type<View>::type>::bit_depth;
+ if (bitDepth != m_decoder.getBpp() / m_decoder.getChannels())
+ io_error("lodepng_read_view: input view type is incompatible with the image type(bitDepth mismatch)");
+
+ int colorType = lodepng_read_support_private<typename channel_type<View>::type,
+ typename color_space_type<View>::type>::color_type;
+ if (colorType != m_decoder.getInfoPng().color.colorType)
+ io_error("lodepng_read_view: input view type is incompatible with the image type(colorType mismatch)");
+
+ std::vector<unsigned char> inputData;
+ LodePNG::loadFile(inputData, m_reader);
+
+ std::vector<unsigned char> decodedData;
+ m_decoder.decode(decodedData, inputData);
+
+ if (m_decoder.hasError())
+ {
+ std::stringstream out;
+ out << "lodepng_read_view: " << m_decoder.getError();
+ io_error(out.str().c_str());
+ }
+
+ gil::rgba8_view_t srcView = gil::interleaved_view(
+ view.width(),
+ view.height(),
+ gil::rgba8_ptr_t(&decodedData[0]),
+ 4 * view.width());
+
+ gil::copy_pixels(srcView, view);
+ }
+
+ template <typename Image>
+ void read_image(Image& im) {
+ im.recreate(get_dimensions());
+ apply(view(im));
+ }
+};
+
+// This code will be simplified...
+template <typename CC>
+class lodepng_reader_color_convert : public lodepng_reader {
+private:
+ CC _cc;
+public:
+ lodepng_reader_color_convert(ReaderPtr<Reader> & reader, CC cc_in) : lodepng_reader(reader),_cc(cc_in) {}
+ lodepng_reader_color_convert(ReaderPtr<Reader> & reader) : lodepng_reader(reader) {}
+ template <typename View>
+ void apply(const View& view)
+ {
+ io_error_if((static_cast<unsigned>(view.width()) != m_decoder.getWidth()
+ || static_cast<unsigned>(view.height()) != m_decoder.getHeight()),
+ "lodepng_read_view: input view size does not match PNG file size");
+
+ std::vector<unsigned char> inputData;
+ LodePNG::loadFile(inputData, m_reader);
+
+ std::vector<unsigned char> decodedData;
+ m_decoder.decode(decodedData, inputData);
+
+ if (m_decoder.hasError())
+ {
+ std::stringstream out;
+ out << "lodepng_read_view: " << m_decoder.getError();
+ io_error(out.str().c_str());
+ }
+
+ int bitDepth = m_decoder.getBpp() / m_decoder.getChannels();
+ int colorType = m_decoder.getInfoPng().color.colorType;
+
+ switch (colorType)
+ {
+ case LODEPNG_COLOR_TYPE_GRAY:
+ switch (bitDepth)
+ {
+ case 8:
+ {
+ gil::gray8_view_t srcView = gil::interleaved_view(
+ m_decoder.getWidth(),
+ m_decoder.getHeight(),
+ gil::gray8_ptr_t(&decodedData[0]),
+ sizeof(gil::gray8_pixel_t) * view.width()
+ );
+
+ gil::copy_and_convert_pixels(srcView, view, _cc);
+ break;
+ }
+ case 16:
+ {
+ gil::gray8_view_t srcView = gil::interleaved_view(
+ m_decoder.getWidth(),
+ m_decoder.getHeight(),
+ gil::gray8_ptr_t(&decodedData[0]),
+ sizeof(gil::gray8_pixel_t) * view.width()
+ );
+
+ gil::copy_and_convert_pixels(srcView, view, _cc);
+ break;
+ }
+ default:
+ io_error("png_reader_color_convert::apply(): unknown combination of color type and bit depth");
+ }
+ break;
+ case LODEPNG_COLOR_TYPE_RGB:
+ switch (bitDepth)
+ {
+ case 8:
+ {
+ gil::rgb8_view_t srcView = gil::interleaved_view(
+ m_decoder.getWidth(),
+ m_decoder.getHeight(),
+ gil::rgb8_ptr_t(&decodedData[0]),
+ sizeof(gil::rgb8_pixel_t) * view.width()
+ );
+ gil::copy_and_convert_pixels(srcView, view, _cc);
+ break;
+ }
+ case 16:
+ {
+ gil::rgb16_view_t srcView = gil::interleaved_view(
+ m_decoder.getWidth(),
+ m_decoder.getHeight(),
+ gil::rgb16_ptr_t(&decodedData[0]),
+ sizeof(gil::rgba16_pixel_t) * view.width()
+ );
+ gil::copy_and_convert_pixels(srcView, view, _cc);
+ break;
+ }
+ default:
+ io_error("png_reader_color_convert::apply(): unknown combination of color type and bit depth");
+ }
+ break;
+ case LODEPNG_COLOR_TYPE_RGBA:
+ switch (bitDepth)
+ {
+ case 8:
+ {
+ gil::rgba8_view_t srcView = gil::interleaved_view(
+ m_decoder.getWidth(),
+ m_decoder.getHeight(),
+ gil::rgba8_ptr_t(&decodedData[0]),
+ sizeof(gil::rgba8_pixel_t) * m_decoder.getWidth()
+ );
+ gil::copy_and_convert_pixels(srcView, view, _cc);
+ break;
+ }
+ case 16:
+ {
+ gil::rgba16_view_t srcView = gil::interleaved_view(
+ m_decoder.getWidth(),
+ m_decoder.getHeight(),
+ gil::rgba16_ptr_t(&decodedData[0]),
+ sizeof(gil::rgba16_pixel_t) * m_decoder.getWidth()
+ );
+ gil::copy_and_convert_pixels(srcView, view, _cc);
+ break;
+ }
+ default:
+ io_error("png_reader_color_convert::apply(): unknown combination of color type and bit depth");
+ }
+ break;
+ default:
+ io_error("png_reader_color_convert::apply(): unknown color type");
+ }
+ }
+
+ template <typename Image>
+ void read_image(Image& im) {
+ im.recreate(get_dimensions());
+ apply(view(im));
+ }
+};
+
+
+class lodepng_writer /*: public file_mgr */{
+protected:
+
+ LodePNG::Encoder m_encoder;
+ WriterPtr<Writer> & m_writer;
+
+ void init() {}
+
+public:
+ lodepng_writer(WriterPtr<Writer> & writer) : /*file_mgr(filename, "wb"), m_fileName(filename)*/ m_writer(writer) { init(); }
+
+ template <typename View>
+ void apply(const View& view)
+ {
+ typedef lodepng_write_support_private<
+ typename channel_type<View>::type,
+ typename color_space_type<View>::type
+ > write_support_t;
+
+ /// Create temporary image with base color_space_type.
+
+ LodePNG_InfoRaw infoRaw = m_encoder.getInfoRaw();
+ LodePNG_InfoPng infoPng = m_encoder.getInfoPng();
+
+ infoRaw.color.bitDepth = write_support_t::bit_depth;
+ infoRaw.color.colorType = write_support_t::color_type;
+
+ m_encoder.setInfoRaw(infoRaw);
+
+ infoPng.compressionMethod = 0;
+ infoPng.filterMethod = 0;
+ infoPng.interlaceMethod = 0;
+ infoPng.height = view.height();
+ infoPng.width = view.width();
+ infoPng.color.bitDepth = write_support_t::bit_depth;
+ infoPng.color.colorType = write_support_t::color_type;
+
+ m_encoder.setInfoPng(infoPng);
+
+ std::vector<unsigned char> buffer;
+
+ /// in original code there was some tricks with byte indiannes.
+ m_encoder.encode(
+ buffer,
+ (unsigned char *)&view(0, 0),
+ view.width(),
+ view.height()
+ );
+
+ LodePNG::saveFile(buffer, m_writer);
+ }
+};
+
+} // namespace detail
+} } // namespace boost::gil
+
+#endif
diff --git a/3party/sdf_image/sdf_image.cpp b/3party/sdf_image/sdf_image.cpp
new file mode 100644
index 0000000000..9e259dc644
--- /dev/null
+++ b/3party/sdf_image/sdf_image.cpp
@@ -0,0 +1,511 @@
+/*
+Copyright (C) 2009 by Stefan Gustavson
+
+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:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+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.
+*/
+
+#include "drape/sdf_image.h"
+
+#include "base/math.hpp"
+#include "base/scope_guard.hpp"
+
+#include "std/limits.hpp"
+#include "std/bind.hpp"
+
+namespace dp
+{
+
+namespace
+{
+ float const SQRT2 = 1.4142136f;
+
+ float ComputeXGradient(float ul, float /*u*/, float ur, float l, float r, float dl, float /*d*/, float dr)
+ {
+ return (ur + SQRT2 * r + dr) - (ul + SQRT2 * l + dl);
+ }
+
+ float ComputeYGradient(float ul, float u, float ur, float /*l*/, float /*r*/, float dl, float d, float dr)
+ {
+ return (ur + SQRT2 * d + dr) - (ul + SQRT2 * u + dl);
+ }
+
+}
+#define BIND_GRADIENT(f) bind(&f, _1, _2, _3, _4, _5, _6, _7, _8)
+#define TRANSFORM(offset, dx, dy) \
+ if (Transform(i, offset, dx, dy, xDist, yDist, oldDist)) \
+ { \
+ dist.m_data[i] = oldDist; \
+ changed = true; \
+ }
+
+
+SdfImage::SdfImage(uint32_t h, uint32_t w)
+ : m_height(h)
+ , m_width(w)
+{
+ m_data.resize(m_width * m_height, 0);
+}
+
+SdfImage::SdfImage(uint32_t h, uint32_t w, uint8_t * imageData, uint8_t border)
+{
+ int8_t doubleBorder = 2 * border;
+ m_width = w + doubleBorder;
+ m_height = h + doubleBorder;
+
+ uint32_t floatCount = m_width * m_height;
+ m_data.resize(floatCount, 0.0f);
+ for (size_t row = border; row < h + border; ++row)
+ {
+ size_t dstBaseIndex = row * m_width;
+ size_t srcBaseIndex = (row - border) * w;
+ for (size_t column = border; column < w + border; ++column)
+ m_data[dstBaseIndex + column] = (float)imageData[srcBaseIndex + column - border] / 255.0f;
+ }
+}
+
+SdfImage::SdfImage(SdfImage const & copy)
+{
+ m_height = copy.m_height;
+ m_width = copy.m_width;
+ m_data = copy.m_data;
+}
+
+uint32_t SdfImage::GetWidth() const
+{
+ return m_width;
+}
+
+uint32_t SdfImage::GetHeight() const
+{
+ return m_height;
+}
+
+void SdfImage::GetData(vector<uint8_t> & dst)
+{
+ ASSERT(m_data.size() <= dst.size(), ());
+ transform(m_data.begin(), m_data.end(), dst.begin(), [](float const & node)
+ {
+ return static_cast<uint8_t>(node * 255.0f);
+ });
+}
+
+void SdfImage::Scale()
+{
+ float maxi = numeric_limits<float>::min();
+ float mini = numeric_limits<float>::max();
+
+ for_each(m_data.begin(), m_data.end(), [&maxi, &mini](float const & node)
+ {
+ maxi = max(maxi, node);
+ mini = min(mini, node);
+ });
+
+ maxi -= mini;
+ for_each(m_data.begin(), m_data.end(), [&maxi, &mini](float & node)
+ {
+ node = (node - mini) / maxi;
+ });
+}
+
+void SdfImage::Invert()
+{
+ for_each(m_data.begin(), m_data.end(), [](float & node)
+ {
+ node = 1.0f - node;
+ });
+}
+
+void SdfImage::Minus(SdfImage & im)
+{
+ ASSERT(m_data.size() == im.m_data.size(), ());
+ transform(m_data.begin(), m_data.end(), im.m_data.begin(), m_data.begin(), [](float const & n1, float const & n2)
+ {
+ return n1 - n2;
+ });
+}
+
+void SdfImage::Distquant()
+{
+ for_each(m_data.begin(), m_data.end(), [](float & node)
+ {
+ node = my::clamp(0.5f + node * 0.0325f, 0.0f, 1.0f);
+ });
+}
+
+void SdfImage::GenerateSDF(float sc)
+{
+ Scale();
+
+ SdfImage outside(m_height, m_width);
+ SdfImage inside(m_height, m_width);
+
+ size_t shortCount = m_width * m_height;
+ vector<short> xDist;
+ vector<short> yDist;
+ xDist.resize(shortCount, 0);
+ yDist.resize(shortCount, 0);
+
+ MexFunction(*this, xDist, yDist, outside);
+
+ fill(xDist.begin(), xDist.end(), 0);
+ fill(yDist.begin(), yDist.end(), 0);
+
+ Invert();
+ MexFunction(*this, xDist, yDist, inside);
+
+ outside.Minus(inside);
+ outside.Distquant();
+ outside.Invert();
+ *this = outside.Bilinear(sc);
+}
+
+SdfImage SdfImage::Bilinear(float scale)
+{
+ uint32_t srcWidth = GetWidth();
+ uint32_t srcHeight = GetHeight();
+ uint32_t dstWidth = srcWidth * scale;
+ uint32_t dstHeight = srcHeight * scale;
+
+ SdfImage result(dstHeight, dstWidth);
+
+ float xRatio = static_cast<float>(srcWidth - 1) / result.GetWidth();
+ float yRatio = static_cast<float>(srcHeight - 1) / result.GetHeight();
+ for (uint32_t i = 0; i < dstHeight; i++)
+ {
+ uint32_t baseIndex = i * dstWidth;
+ for (uint32_t j = 0; j < dstWidth; j++)
+ {
+ int x = static_cast<int>(xRatio * j);
+ int y = static_cast<int>(yRatio * i);
+ int index = y * srcWidth + x;
+ ASSERT_LESS(index, m_data.size(), ());
+
+ // range is 0 to 255 thus bitwise AND with 0xff
+ float A = m_data[index];
+ float B = m_data[index + 1];
+ float C = m_data[index + srcWidth];
+ float D = m_data[index + srcWidth + 1];
+
+ float xDiff = (xRatio * j) - x;
+ float yDiff = (yRatio * i) - y;
+ float xInvertDiff = 1.0f - xDiff;
+ float yInvertDiff = 1.0f - yDiff;
+
+ float gray = A * xInvertDiff * yInvertDiff + B * xDiff * yInvertDiff +
+ C * xInvertDiff * yDiff + D * xDiff * yDiff;
+
+ result.m_data[baseIndex + j] = gray;
+ }
+ }
+
+ return result;
+}
+
+float SdfImage::ComputeGradient(uint32_t x, uint32_t y, SdfImage::TComputeFn const & fn) const
+{
+ if (x < 1 || x > m_width - 1 ||
+ y < 1 || y > m_height - 1)
+ {
+ return 0.0;
+ }
+
+ size_t k = y * m_width + x;
+
+ uint32_t l = k - 1;
+ uint32_t r = k + 1;
+ uint32_t u = k - m_width;
+ uint32_t d = k + m_width;
+ uint32_t ul = u - 1;
+ uint32_t dl = d -1;
+ uint32_t ur = u + 1;
+ uint32_t dr = d + 1;
+
+ if (m_data[k] > 0.0 && m_data[k] < 1.0)
+ {
+ return fn(m_data[ul], m_data[u], m_data[ur],
+ m_data[l], m_data[r],
+ m_data[dl], m_data[d], m_data[dr]);
+ }
+ else
+ return 0.0;
+}
+
+void SdfImage::MexFunction(SdfImage const & img, vector<short> & xDist, vector<short> & yDist, SdfImage & out)
+{
+ ASSERT_EQUAL(img.GetWidth(), out.GetWidth(), ());
+ ASSERT_EQUAL(img.GetHeight(), out.GetHeight(), ());
+
+ img.EdtaA3(xDist, yDist, out);
+ // Pixels with grayscale>0.5 will have a negative distance.
+ // This is correct, but we don't want values <0 returned here.
+ for_each(out.m_data.begin(), out.m_data.end(), [](float & n)
+ {
+ n = max(0.0f, n);
+ });
+}
+
+float SdfImage::DistaA3(int c, int xc, int yc, int xi, int yi) const
+{
+ int closest = c - xc - yc * m_width; // Index to the edge pixel pointed to from c
+ //if (closest < 0 || closest > m_data.size())
+ // return 1000000.0;
+ ASSERT_GREATER_OR_EQUAL(closest, 0, ());
+ ASSERT_LESS(closest, m_data.size(), ());
+
+ float a = my::clamp(m_data[closest], 0.0f, 1.0f); // Grayscale value at the edge pixel
+
+ if(a == 0.0)
+ return 1000000.0; // Not an object pixel, return "very far" ("don't know yet")
+
+ double dx = static_cast<double>(xi);
+ double dy = static_cast<double>(yi);
+ double di = sqrt(dx * dx + dy * dy); // Length of integer vector, like a traditional EDT
+ double df = 0.0;
+ if(di == 0.0)
+ {
+ int y = closest / m_width;
+ int x = closest % m_width;
+ // Use local gradient only at edges
+ // Estimate based on local gradient only
+ df = EdgeDf(ComputeGradient(x, y, BIND_GRADIENT(ComputeXGradient)),
+ ComputeGradient(x, y, BIND_GRADIENT(ComputeYGradient)), a);
+ }
+ else
+ {
+ // Estimate gradient based on direction to edge (accurate for large di)
+ df = EdgeDf(dx, dy, a);
+ }
+ return static_cast<float>(di + df); // Same metric as edtaa2, except at edges (where di=0)
+}
+
+double SdfImage::EdgeDf(double gx, double gy, double a) const
+{
+ double df = 0.0;
+
+ if ((gx == 0) || (gy == 0))
+ {
+ // Either A) gu or gv are zero
+ // B) both
+ df = 0.5 - a; // Linear approximation is A) correct or B) a fair guess
+ }
+ else
+ {
+ double glength = sqrt(gx * gx + gy * gy);
+ if(glength > 0)
+ {
+ gx = gx / glength;
+ gy = gy / glength;
+ }
+
+ // Everything is symmetric wrt sign and transposition,
+ // so move to first octant (gx>=0, gy>=0, gx>=gy) to
+ // avoid handling all possible edge directions.
+
+ gx = fabs(gx);
+ gy = fabs(gy);
+ if (gx < gy)
+ swap(gx, gy);
+
+ double a1 = 0.5 * gy / gx;
+ if (a < a1)
+ df = 0.5 * (gx + gy) - sqrt(2.0 * gx * gy * a);
+ else if (a < (1.0 - a1))
+ df = (0.5 - a) * gx;
+ else
+ df = -0.5 * (gx + gy) + sqrt(2.0 * gx * gy * (1.0 - a));
+ }
+
+ return df;
+}
+
+void SdfImage::EdtaA3(vector<short> & xDist, vector<short> & yDist, SdfImage & dist) const
+{
+ ASSERT_EQUAL(dist.GetHeight(), GetHeight(), ());
+ ASSERT_EQUAL(dist.GetWidth(), GetWidth(), ());
+ ASSERT_EQUAL(dist.m_data.size(), m_data.size(), ());
+
+ int w = GetWidth();
+ int h = GetHeight();
+
+ /* Initialize the distance SdfImages */
+ for (size_t y = 0; y < h; ++y)
+ {
+ size_t baseIndex = y * w;
+ for (size_t x = 0; x < w; ++x)
+ {
+ size_t index = baseIndex + x;
+ if (m_data[index] <= 0.0)
+ dist.m_data[index]= 1000000.0; // Big value, means "not set yet"
+ else if (m_data[index] < 1.0)
+ {
+ dist.m_data[index] = EdgeDf(ComputeGradient(x, y, BIND_GRADIENT(ComputeXGradient)),
+ ComputeGradient(x, y, BIND_GRADIENT(ComputeYGradient)),
+ m_data[index]);
+ }
+ }
+ }
+
+ /* Initialize index offsets for the current SdfImage width */
+ int offsetU = -w;
+ int offsetD = w;
+ int offsetR = 1;
+ int offsetL = -1;
+ int offsetRu = -w + 1;
+ int offsetRd = w + 1;
+ int offsetLd = w - 1;
+ int offsetLu = -w - 1;
+
+ /* Perform the transformation */
+ bool changed;
+ do
+ {
+ changed = false;
+ for(int y = 1; y < h; ++y)
+ {
+ int i = y * w;
+
+ /* scan right, propagate distances from above & left */
+ /* Leftmost pixel is special, has no left neighbors */
+ float oldDist = dist.m_data[i];
+ if(oldDist > 0) // If non-zero distance or not set yet
+ {
+ TRANSFORM(offsetU, 0, 1);
+ TRANSFORM(offsetRu, -1, 1);
+ }
+
+ ++i;
+
+ /* Middle pixels have all neighbors */
+ for(int x = 1; x < w - 1; ++x, ++i)
+ {
+ oldDist = dist.m_data[i];
+ if(oldDist > 0.0)
+ {
+ TRANSFORM(offsetL, 1, 0);
+ TRANSFORM(offsetLu, 1, 1);
+ TRANSFORM(offsetU, 0, 1);
+ TRANSFORM(offsetRu, -1, 1);
+ }
+ }
+
+ /* Rightmost pixel of row is special, has no right neighbors */
+ oldDist = dist.m_data[i];
+ if(oldDist > 0)
+ {
+ TRANSFORM(offsetL, 1, 0);
+ TRANSFORM(offsetLu, 1, 1);
+ TRANSFORM(offsetU, 0, 1);
+ }
+
+ /* Move index to second rightmost pixel of current row. */
+ /* Rightmost pixel is skipped, it has no right neighbor. */
+ i = y * w + w - 2;
+
+ /* scan left, propagate distance from right */
+ for(int x = w - 2; x >= 0; --x, --i)
+ {
+ oldDist = dist.m_data[i];
+ if(oldDist > 0.0)
+ TRANSFORM(offsetR, -1, 0);
+ }
+ }
+
+ /* Scan rows in reverse order, except last row */
+ for(int y = h - 2; y >= 0; --y)
+ {
+ /* move index to rightmost pixel of current row */
+ int i = y * w + w - 1;
+
+ /* Scan left, propagate distances from below & right */
+
+ /* Rightmost pixel is special, has no right neighbors */
+ float oldDist = dist.m_data[i];
+ if(oldDist > 0) // If not already zero distance
+ {
+ TRANSFORM(offsetD, 0, -1);
+ TRANSFORM(offsetLd, 1, -1);
+ }
+
+ --i;
+
+ /* Middle pixels have all neighbors */
+ for(int x = w - 2; x > 0; --x, --i)
+ {
+ oldDist = dist.m_data[i];
+ if(oldDist > 0.0)
+ {
+ TRANSFORM(offsetR, -1, 0);
+ TRANSFORM(offsetRd, -1, -1);
+ TRANSFORM(offsetD, 0, -1);
+ TRANSFORM(offsetLd, 1, -1);
+ }
+ }
+
+ /* Leftmost pixel is special, has no left neighbors */
+ oldDist = dist.m_data[i];
+ if(oldDist > 0)
+ {
+ TRANSFORM(offsetR, -1, 0);
+ TRANSFORM(offsetRd, -1, -1);
+ TRANSFORM(offsetD, 0, -1);
+ }
+
+ /* Move index to second leftmost pixel of current row. */
+ /* Leftmost pixel is skipped, it has no left neighbor. */
+ i = y * w + 1;
+ for(int x = 1; x < w; ++x, ++i)
+ {
+ /* scan right, propagate distance from left */
+ oldDist = dist.m_data[i];
+ if(oldDist > 0.0)
+ TRANSFORM(offsetL, 1, 0);
+ }
+ }
+ }
+ while(changed);
+}
+
+bool SdfImage::Transform(int baseIndex, int offset, int dx, int dy, vector<short> & xDist, vector<short> & yDist, float & oldDist) const
+{
+ double const epsilon = 1e-3;
+ ASSERT_EQUAL(xDist.size(), yDist.size(), ());
+ ASSERT_GREATER_OR_EQUAL(baseIndex, 0, ());
+ ASSERT_LESS(baseIndex, xDist.size(), ());
+
+ int candidate = baseIndex + offset;
+ ASSERT_GREATER_OR_EQUAL(candidate, 0, ());
+ ASSERT_LESS(candidate, xDist.size(), ());
+
+ int cDistX = xDist[candidate];
+ int cDistY = yDist[candidate];
+ int newDistX = cDistX + dx;
+ int newDistY = cDistY + dy;
+ float newDist = DistaA3(candidate, cDistX, cDistY, newDistX, newDistY);
+ if(newDist < oldDist - epsilon)
+ {
+ xDist[baseIndex] = newDistX;
+ yDist[baseIndex] = newDistY;
+ oldDist = newDist;
+ return true;
+ }
+
+ return false;
+}
+
+} // namespace dp
diff --git a/3party/sdf_image/sdf_image.h b/3party/sdf_image/sdf_image.h
new file mode 100644
index 0000000000..db3587731e
--- /dev/null
+++ b/3party/sdf_image/sdf_image.h
@@ -0,0 +1,80 @@
+#pragma once
+
+// +----------------------------------------+
+// | |
+// | http://contourtextures.wikidot.com |
+// | |
+// +----------------------------------------+
+
+/*
+Copyright (C) 2009 by Stefan Gustavson
+
+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:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+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.
+*/
+
+#include "../base/buffer_vector.hpp"
+
+#include "../std/vector.hpp"
+#include "../std/function.hpp"
+
+namespace dp
+{
+
+class SdfImage
+{
+public:
+ SdfImage() = default;
+ SdfImage(uint32_t h, uint32_t w);
+ SdfImage(uint32_t h, uint32_t w, uint8_t * imageData, uint8_t border);
+ SdfImage(SdfImage const & copy);
+
+ uint32_t GetWidth() const;
+ uint32_t GetHeight() const;
+ void GetData(std::vector<uint8_t> & dst);
+ void GenerateSDF(float sc);
+
+private:
+ void Scale();
+ void Invert();
+ void Minus(SdfImage &im);
+ void Distquant();
+ SdfImage Bilinear(float Scale);
+
+private:
+ /// ul = up left
+ /// u = up
+ /// ...
+ /// d = down
+ /// dr = down right
+ /// ul u ur l r dl d dr
+ typedef function<float (float, float, float, float, float, float, float, float)> TComputeFn;
+ float ComputeGradient(uint32_t x, uint32_t y, TComputeFn const & fn) const;
+ void MexFunction(SdfImage const & img, vector<short> & xDist, vector<short> & yDist, SdfImage & out);
+ float DistaA3(int c, int xc, int yc, int xi, int yi) const;
+ double EdgeDf(double gx, double gy, double a) const;
+ void EdtaA3(vector<short> & xDist, vector<short> & yDist, SdfImage & dist) const;
+ bool Transform(int baseIndex, int offset, int dx, int dy, vector<short> & xDist, vector<short> & yDist, float & oldDist) const;
+
+private:
+ uint32_t m_height = 0;
+ uint32_t m_width = 0;
+ buffer_vector<float, 512> m_data;
+};
+
+} // namespace dp
diff --git a/3party/stb_image/stb_image.c b/3party/stb_image/stb_image.c
new file mode 100644
index 0000000000..13b1fcb103
--- /dev/null
+++ b/3party/stb_image/stb_image.c
@@ -0,0 +1,3537 @@
+/* stbi-1.14 - public domain JPEG/PNG reader - http://nothings.org/stb_image.c
+ when you control the images you're loading
+
+ QUICK NOTES:
+ Primarily of interest to game developers and other people who can
+ avoid problematic images and only need the trivial interface
+
+ JPEG baseline (no JPEG progressive, no oddball channel decimations)
+ PNG non-interlaced
+ BMP non-1bpp, non-RLE
+ TGA (not sure what subset, if a subset)
+ PSD (composited view only, no extra channels)
+ HDR (radiance rgbE format)
+ writes BMP,TGA (define STBI_NO_WRITE to remove code)
+ decoded from memory or through stdio FILE (define STBI_NO_STDIO to remove code)
+ supports installable dequantizing-IDCT, YCbCr-to-RGB conversion (define STBI_SIMD)
+
+ TODO:
+ stbi_info_*
+
+ history:
+ 1.14 fix threadsafe conversion bug; header-file-only version (#define STBI_HEADER_FILE_ONLY before including)
+ 1.13 threadsafe
+ 1.12 const qualifiers in the API
+ 1.11 Support installable IDCT, colorspace conversion routines
+ 1.10 Fixes for 64-bit (don't use "unsigned long")
+ optimized upsampling by Fabian "ryg" Giesen
+ 1.09 Fix format-conversion for PSD code (bad global variables!)
+ 1.08 Thatcher Ulrich's PSD code integrated by Nicolas Schulz
+ 1.07 attempt to fix C++ warning/errors again
+ 1.06 attempt to fix C++ warning/errors again
+ 1.05 fix TGA loading to return correct *comp and use good luminance calc
+ 1.04 default float alpha is 1, not 255; use 'void *' for stbi_image_free
+ 1.03 bugfixes to STBI_NO_STDIO, STBI_NO_HDR
+ 1.02 support for (subset of) HDR files, float interface for preferred access to them
+ 1.01 fix bug: possible bug in handling right-side up bmps... not sure
+ fix bug: the stbi_bmp_load() and stbi_tga_load() functions didn't work at all
+ 1.00 interface to zlib that skips zlib header
+ 0.99 correct handling of alpha in palette
+ 0.98 TGA loader by lonesock; dynamically add loaders (untested)
+ 0.97 jpeg errors on too large a file; also catch another malloc failure
+ 0.96 fix detection of invalid v value - particleman@mollyrocket forum
+ 0.95 during header scan, seek to markers in case of padding
+ 0.94 STBI_NO_STDIO to disable stdio usage; rename all #defines the same
+ 0.93 handle jpegtran output; verbose errors
+ 0.92 read 4,8,16,24,32-bit BMP files of several formats
+ 0.91 output 24-bit Windows 3.0 BMP files
+ 0.90 fix a few more warnings; bump version number to approach 1.0
+ 0.61 bugfixes due to Marc LeBlanc, Christopher Lloyd
+ 0.60 fix compiling as c++
+ 0.59 fix warnings: merge Dave Moore's -Wall fixes
+ 0.58 fix bug: zlib uncompressed mode len/nlen was wrong endian
+ 0.57 fix bug: jpg last huffman symbol before marker was >9 bits but less
+ than 16 available
+ 0.56 fix bug: zlib uncompressed mode len vs. nlen
+ 0.55 fix bug: restart_interval not initialized to 0
+ 0.54 allow NULL for 'int *comp'
+ 0.53 fix bug in png 3->4; speedup png decoding
+ 0.52 png handles req_comp=3,4 directly; minor cleanup; jpeg comments
+ 0.51 obey req_comp requests, 1-component jpegs return as 1-component,
+ on 'test' only check type, not whether we support this variant
+*/
+
+#include "stb_image.h"
+
+#ifndef STBI_HEADER_FILE_ONLY
+
+#ifndef STBI_NO_HDR
+#include <math.h> // ldexp
+#include <string.h> // strcmp
+#endif
+
+#ifndef STBI_NO_STDIO
+#include <stdio.h>
+#endif
+#include <stdlib.h>
+#include <memory.h>
+#include <assert.h>
+#include <stdarg.h>
+
+#ifndef _MSC_VER
+ #ifdef __cplusplus
+ #define __forceinline inline
+ #else
+ #define __forceinline
+ #endif
+#endif
+
+#define STB_UNUSED(x) do { (void)(x); } while (0)
+
+// implementation:
+typedef unsigned char uint8;
+typedef unsigned short uint16;
+typedef signed short int16;
+typedef unsigned int uint32;
+typedef signed int int32;
+typedef unsigned int uint;
+
+// should produce compiler error if size is wrong
+typedef unsigned char validate_uint32[sizeof(uint32)==4];
+
+#if defined(STBI_NO_STDIO) && !defined(STBI_NO_WRITE)
+#define STBI_NO_WRITE
+#endif
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// Generic API that works on all image types
+//
+
+// this is not threadsafe
+static char *failure_reason;
+
+char *stbi_failure_reason(void)
+{
+ return failure_reason;
+}
+
+static int e(char *str)
+{
+ failure_reason = str;
+ return 0;
+}
+
+#ifdef STBI_NO_FAILURE_STRINGS
+ #define e(x,y) 0
+#elif defined(STBI_FAILURE_USERMSG)
+ #define e(x,y) e(y)
+#else
+ #define e(x,y) e(x)
+#endif
+
+#define epf(x,y) ((float *) (e(x,y)?NULL:NULL))
+#define epuc(x,y) ((unsigned char *) (e(x,y)?NULL:NULL))
+
+void stbi_image_free(void *retval_from_stbi_load)
+{
+ free(retval_from_stbi_load);
+}
+
+#define MAX_LOADERS 32
+stbi_loader *loaders[MAX_LOADERS];
+static int max_loaders = 0;
+
+int stbi_register_loader(stbi_loader *loader)
+{
+ int i;
+ for (i=0; i < MAX_LOADERS; ++i) {
+ // already present?
+ if (loaders[i] == loader)
+ return 1;
+ // end of the list?
+ if (loaders[i] == NULL) {
+ loaders[i] = loader;
+ max_loaders = i+1;
+ return 1;
+ }
+ }
+ // no room for it
+ return 0;
+}
+
+#ifndef STBI_NO_HDR
+static float *ldr_to_hdr(stbi_uc *data, int x, int y, int comp);
+static stbi_uc *hdr_to_ldr(float *data, int x, int y, int comp);
+#endif
+
+#ifndef STBI_NO_STDIO
+unsigned char *stbi_load(char const *filename, int *x, int *y, int *comp, int req_comp)
+{
+ FILE *f = fopen(filename, "rb");
+ unsigned char *result;
+ if (!f) return epuc("can't fopen", "Unable to open file");
+ result = stbi_load_from_file(f,x,y,comp,req_comp);
+ fclose(f);
+ return result;
+}
+
+unsigned char *stbi_load_from_file(FILE *f, int *x, int *y, int *comp, int req_comp)
+{
+ int i;
+ if (stbi_jpeg_test_file(f))
+ return stbi_jpeg_load_from_file(f,x,y,comp,req_comp);
+ if (stbi_png_test_file(f))
+ return stbi_png_load_from_file(f,x,y,comp,req_comp);
+ if (stbi_bmp_test_file(f))
+ return stbi_bmp_load_from_file(f,x,y,comp,req_comp);
+ if (stbi_psd_test_file(f))
+ return stbi_psd_load_from_file(f,x,y,comp,req_comp);
+#ifndef STBI_NO_HDR
+ if (stbi_hdr_test_file(f)) {
+ float *hdr = stbi_hdr_load_from_file(f, x,y,comp,req_comp);
+ return hdr_to_ldr(hdr, *x, *y, req_comp ? req_comp : *comp);
+ }
+#endif
+ for (i=0; i < max_loaders; ++i)
+ if (loaders[i]->test_file(f))
+ return loaders[i]->load_from_file(f,x,y,comp,req_comp);
+ // test tga last because it's a crappy test!
+ if (stbi_tga_test_file(f))
+ return stbi_tga_load_from_file(f,x,y,comp,req_comp);
+ return epuc("unknown image type", "Image not of any known type, or corrupt");
+}
+#endif
+
+unsigned char *stbi_load_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp)
+{
+ int i;
+ if (stbi_jpeg_test_memory(buffer,len))
+ return stbi_jpeg_load_from_memory(buffer,len,x,y,comp,req_comp);
+ if (stbi_png_test_memory(buffer,len))
+ return stbi_png_load_from_memory(buffer,len,x,y,comp,req_comp);
+ if (stbi_bmp_test_memory(buffer,len))
+ return stbi_bmp_load_from_memory(buffer,len,x,y,comp,req_comp);
+ if (stbi_psd_test_memory(buffer,len))
+ return stbi_psd_load_from_memory(buffer,len,x,y,comp,req_comp);
+#ifndef STBI_NO_HDR
+ if (stbi_hdr_test_memory(buffer, len)) {
+ float *hdr = stbi_hdr_load_from_memory(buffer, len,x,y,comp,req_comp);
+ return hdr_to_ldr(hdr, *x, *y, req_comp ? req_comp : *comp);
+ }
+#endif
+ for (i=0; i < max_loaders; ++i)
+ if (loaders[i]->test_memory(buffer,len))
+ return loaders[i]->load_from_memory(buffer,len,x,y,comp,req_comp);
+ // test tga last because it's a crappy test!
+ if (stbi_tga_test_memory(buffer,len))
+ return stbi_tga_load_from_memory(buffer,len,x,y,comp,req_comp);
+ return epuc("unknown image type", "Image not of any known type, or corrupt");
+}
+
+#ifndef STBI_NO_HDR
+
+#ifndef STBI_NO_STDIO
+float *stbi_loadf(char const *filename, int *x, int *y, int *comp, int req_comp)
+{
+ FILE *f = fopen(filename, "rb");
+ float *result;
+ if (!f) return epf("can't fopen", "Unable to open file");
+ result = stbi_loadf_from_file(f,x,y,comp,req_comp);
+ fclose(f);
+ return result;
+}
+
+float *stbi_loadf_from_file(FILE *f, int *x, int *y, int *comp, int req_comp)
+{
+ unsigned char *data;
+#ifndef STBI_NO_HDR
+ if (stbi_hdr_test_file(f))
+ return stbi_hdr_load_from_file(f,x,y,comp,req_comp);
+#endif
+ data = stbi_load_from_file(f, x, y, comp, req_comp);
+ if (data)
+ return ldr_to_hdr(data, *x, *y, req_comp ? req_comp : *comp);
+ return epf("unknown image type", "Image not of any known type, or corrupt");
+}
+#endif
+
+float *stbi_loadf_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp)
+{
+ stbi_uc *data;
+#ifndef STBI_NO_HDR
+ if (stbi_hdr_test_memory(buffer, len))
+ return stbi_hdr_load_from_memory(buffer, len,x,y,comp,req_comp);
+#endif
+ data = stbi_load_from_memory(buffer, len, x, y, comp, req_comp);
+ if (data)
+ return ldr_to_hdr(data, *x, *y, req_comp ? req_comp : *comp);
+ return epf("unknown image type", "Image not of any known type, or corrupt");
+}
+#endif
+
+// these is-hdr-or-not is defined independent of whether STBI_NO_HDR is
+// defined, for API simplicity; if STBI_NO_HDR is defined, it always
+// reports false!
+
+int stbi_is_hdr_from_memory(stbi_uc const *buffer, int len)
+{
+#ifndef STBI_NO_HDR
+ return stbi_hdr_test_memory(buffer, len);
+#else
+ return 0;
+#endif
+}
+
+#ifndef STBI_NO_STDIO
+extern int stbi_is_hdr(char const *filename)
+{
+ FILE *f = fopen(filename, "rb");
+ int result=0;
+ if (f) {
+ result = stbi_is_hdr_from_file(f);
+ fclose(f);
+ }
+ return result;
+}
+
+extern int stbi_is_hdr_from_file(FILE *f)
+{
+#ifndef STBI_NO_HDR
+ return stbi_hdr_test_file(f);
+#else
+ return 0;
+#endif
+}
+
+#endif
+
+// @TODO: get image dimensions & components without fully decoding
+#ifndef STBI_NO_STDIO
+extern int stbi_info (char const *filename, int *x, int *y, int *comp);
+extern int stbi_info_from_file (FILE *f, int *x, int *y, int *comp);
+#endif
+extern int stbi_info_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp);
+
+#ifndef STBI_NO_HDR
+static float h2l_gamma_i=1.0f/2.2f, h2l_scale_i=1.0f;
+static float l2h_gamma=2.2f, l2h_scale=1.0f;
+
+void stbi_hdr_to_ldr_gamma(float gamma) { h2l_gamma_i = 1/gamma; }
+void stbi_hdr_to_ldr_scale(float scale) { h2l_scale_i = 1/scale; }
+
+void stbi_ldr_to_hdr_gamma(float gamma) { l2h_gamma = gamma; }
+void stbi_ldr_to_hdr_scale(float scale) { l2h_scale = scale; }
+#endif
+
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// Common code used by all image loaders
+//
+
+enum
+{
+ SCAN_load=0,
+ SCAN_type,
+ SCAN_header,
+};
+
+typedef struct
+{
+ uint32 img_x, img_y;
+ int img_n, img_out_n;
+
+#ifndef STBI_NO_STDIO
+ FILE *img_file;
+#endif
+ uint8 *img_buffer, *img_buffer_end;
+} stbi;
+
+#ifndef STBI_NO_STDIO
+static void start_file(stbi *s, FILE *f)
+{
+ s->img_file = f;
+}
+#endif
+
+static void start_mem(stbi *s, uint8 const *buffer, int len)
+{
+#ifndef STBI_NO_STDIO
+ s->img_file = NULL;
+#endif
+ s->img_buffer = (uint8 *) buffer;
+ s->img_buffer_end = (uint8 *) buffer+len;
+}
+
+__forceinline static int get8(stbi *s)
+{
+#ifndef STBI_NO_STDIO
+ if (s->img_file) {
+ int c = fgetc(s->img_file);
+ return c == EOF ? 0 : c;
+ }
+#endif
+ if (s->img_buffer < s->img_buffer_end)
+ return *s->img_buffer++;
+ return 0;
+}
+
+__forceinline static int at_eof(stbi *s)
+{
+#ifndef STBI_NO_STDIO
+ if (s->img_file)
+ return feof(s->img_file);
+#endif
+ return s->img_buffer >= s->img_buffer_end;
+}
+
+__forceinline static uint8 get8u(stbi *s)
+{
+ return (uint8) get8(s);
+}
+
+static void skip(stbi *s, int n)
+{
+#ifndef STBI_NO_STDIO
+ if (s->img_file)
+ fseek(s->img_file, n, SEEK_CUR);
+ else
+#endif
+ s->img_buffer += n;
+}
+
+static int get16(stbi *s)
+{
+ int z = get8(s);
+ return (z << 8) + get8(s);
+}
+
+static uint32 get32(stbi *s)
+{
+ uint32 z = get16(s);
+ return (z << 16) + get16(s);
+}
+
+static int get16le(stbi *s)
+{
+ int z = get8(s);
+ return z + (get8(s) << 8);
+}
+
+static uint32 get32le(stbi *s)
+{
+ uint32 z = get16le(s);
+ return z + (get16le(s) << 16);
+}
+
+static void getn(stbi *s, stbi_uc *buffer, int n)
+{
+#ifndef STBI_NO_STDIO
+ if (s->img_file) {
+ fread(buffer, 1, n, s->img_file);
+ return;
+ }
+#endif
+ memcpy(buffer, s->img_buffer, n);
+ s->img_buffer += n;
+}
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// generic converter from built-in img_n to req_comp
+// individual types do this automatically as much as possible (e.g. jpeg
+// does all cases internally since it needs to colorspace convert anyway,
+// and it never has alpha, so very few cases ). png can automatically
+// interleave an alpha=255 channel, but falls back to this for other cases
+//
+// assume data buffer is malloced, so malloc a new one and free that one
+// only failure mode is malloc failing
+
+static uint8 compute_y(int r, int g, int b)
+{
+ return (uint8) (((r*77) + (g*150) + (29*b)) >> 8);
+}
+
+static unsigned char *convert_format(unsigned char *data, int img_n, int req_comp, uint x, uint y)
+{
+ int i,j;
+ unsigned char *good;
+
+ if (req_comp == img_n) return data;
+ assert(req_comp >= 1 && req_comp <= 4);
+
+ good = (unsigned char *) malloc(req_comp * x * y);
+ if (good == NULL) {
+ free(data);
+ return epuc("outofmem", "Out of memory");
+ }
+
+ for (j=0; j < (int) y; ++j) {
+ unsigned char *src = data + j * x * img_n ;
+ unsigned char *dest = good + j * x * req_comp;
+
+#define COMBO(a,b) ((a)*8+(b))
+#define CASE(a,b) case COMBO(a,b): for(i=x; i >= 0; --i, src += a, dest += b)
+ // convert source image with img_n components to one with req_comp components;
+ // avoid switch per pixel, so use switch per scanline and massive macros
+ switch(COMBO(img_n, req_comp)) {
+ CASE(1,2) dest[0]=src[0], dest[1]=255; break;
+ CASE(1,3) dest[0]=dest[1]=dest[2]=src[0]; break;
+ CASE(1,4) dest[0]=dest[1]=dest[2]=src[0], dest[3]=255; break;
+ CASE(2,1) dest[0]=src[0]; break;
+ CASE(2,3) dest[0]=dest[1]=dest[2]=src[0]; break;
+ CASE(2,4) dest[0]=dest[1]=dest[2]=src[0], dest[3]=src[1]; break;
+ CASE(3,4) dest[0]=src[0],dest[1]=src[1],dest[2]=src[2],dest[3]=255; break;
+ CASE(3,1) dest[0]=compute_y(src[0],src[1],src[2]); break;
+ CASE(3,2) dest[0]=compute_y(src[0],src[1],src[2]), dest[1] = 255; break;
+ CASE(4,1) dest[0]=compute_y(src[0],src[1],src[2]); break;
+ CASE(4,2) dest[0]=compute_y(src[0],src[1],src[2]), dest[1] = src[3]; break;
+ CASE(4,3) dest[0]=src[0],dest[1]=src[1],dest[2]=src[2]; break;
+ default: assert(0);
+ }
+#undef CASE
+ }
+
+ free(data);
+ return good;
+}
+
+#ifndef STBI_NO_HDR
+static float *ldr_to_hdr(stbi_uc *data, int x, int y, int comp)
+{
+ int i,k,n;
+ float *output = (float *) malloc(x * y * comp * sizeof(float));
+ if (output == NULL) { free(data); return epf("outofmem", "Out of memory"); }
+ // compute number of non-alpha components
+ if (comp & 1) n = comp; else n = comp-1;
+ for (i=0; i < x*y; ++i) {
+ for (k=0; k < n; ++k) {
+ output[i*comp + k] = (float) pow(data[i*comp+k]/255.0f, l2h_gamma) * l2h_scale;
+ }
+ if (k < comp) output[i*comp + k] = data[i*comp+k]/255.0f;
+ }
+ free(data);
+ return output;
+}
+
+#define float2int(x) ((int) (x))
+static stbi_uc *hdr_to_ldr(float *data, int x, int y, int comp)
+{
+ int i,k,n;
+ stbi_uc *output = (stbi_uc *) malloc(x * y * comp);
+ if (output == NULL) { free(data); return epuc("outofmem", "Out of memory"); }
+ // compute number of non-alpha components
+ if (comp & 1) n = comp; else n = comp-1;
+ for (i=0; i < x*y; ++i) {
+ for (k=0; k < n; ++k) {
+ float z = (float) pow(data[i*comp+k]*h2l_scale_i, h2l_gamma_i) * 255 + 0.5f;
+ if (z < 0) z = 0;
+ if (z > 255) z = 255;
+ output[i*comp + k] = float2int(z);
+ }
+ if (k < comp) {
+ float z = data[i*comp+k] * 255 + 0.5f;
+ if (z < 0) z = 0;
+ if (z > 255) z = 255;
+ output[i*comp + k] = float2int(z);
+ }
+ }
+ free(data);
+ return output;
+}
+#endif
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// "baseline" JPEG/JFIF decoder (not actually fully baseline implementation)
+//
+// simple implementation
+// - channel subsampling of at most 2 in each dimension
+// - doesn't support delayed output of y-dimension
+// - simple interface (only one output format: 8-bit interleaved RGB)
+// - doesn't try to recover corrupt jpegs
+// - doesn't allow partial loading, loading multiple at once
+// - still fast on x86 (copying globals into locals doesn't help x86)
+// - allocates lots of intermediate memory (full size of all components)
+// - non-interleaved case requires this anyway
+// - allows good upsampling (see next)
+// high-quality
+// - upsampled channels are bilinearly interpolated, even across blocks
+// - quality integer IDCT derived from IJG's 'slow'
+// performance
+// - fast huffman; reasonable integer IDCT
+// - uses a lot of intermediate memory, could cache poorly
+// - load http://nothings.org/remote/anemones.jpg 3 times on 2.8Ghz P4
+// stb_jpeg: 1.34 seconds (MSVC6, default release build)
+// stb_jpeg: 1.06 seconds (MSVC6, processor = Pentium Pro)
+// IJL11.dll: 1.08 seconds (compiled by intel)
+// IJG 1998: 0.98 seconds (MSVC6, makefile provided by IJG)
+// IJG 1998: 0.95 seconds (MSVC6, makefile + proc=PPro)
+
+// huffman decoding acceleration
+#define FAST_BITS 9 // larger handles more cases; smaller stomps less cache
+
+typedef struct
+{
+ uint8 fast[1 << FAST_BITS];
+ // weirdly, repacking this into AoS is a 10% speed loss, instead of a win
+ uint16 code[256];
+ uint8 values[256];
+ uint8 size[257];
+ unsigned int maxcode[18];
+ int delta[17]; // old 'firstsymbol' - old 'firstcode'
+} huffman;
+
+typedef struct
+{
+#if STBI_SIMD
+ unsigned short dequant2[4][64];
+#endif
+ stbi s;
+ huffman huff_dc[4];
+ huffman huff_ac[4];
+ uint8 dequant[4][64];
+
+ // sizes for components, interleaved MCUs
+ int img_h_max, img_v_max;
+ int img_mcu_x, img_mcu_y;
+ int img_mcu_w, img_mcu_h;
+
+ // definition of jpeg image component
+ struct
+ {
+ int id;
+ int h,v;
+ int tq;
+ int hd,ha;
+ int dc_pred;
+
+ int x,y,w2,h2;
+ uint8 *data;
+ void *raw_data;
+ uint8 *linebuf;
+ } img_comp[4];
+
+ uint32 code_buffer; // jpeg entropy-coded buffer
+ int code_bits; // number of valid bits
+ unsigned char marker; // marker seen while filling entropy buffer
+ int nomore; // flag if we saw a marker so must stop
+
+ int scan_n, order[4];
+ int restart_interval, todo;
+} jpeg;
+
+static int build_huffman(huffman *h, int *count)
+{
+ int i,j,k=0,code;
+ // build size list for each symbol (from JPEG spec)
+ for (i=0; i < 16; ++i)
+ for (j=0; j < count[i]; ++j)
+ h->size[k++] = (uint8) (i+1);
+ h->size[k] = 0;
+
+ // compute actual symbols (from jpeg spec)
+ code = 0;
+ k = 0;
+ for(j=1; j <= 16; ++j) {
+ // compute delta to add to code to compute symbol id
+ h->delta[j] = k - code;
+ if (h->size[k] == j) {
+ while (h->size[k] == j)
+ h->code[k++] = (uint16) (code++);
+ if (code-1 >= (1 << j)) return e("bad code lengths","Corrupt JPEG");
+ }
+ // compute largest code + 1 for this size, preshifted as needed later
+ h->maxcode[j] = code << (16-j);
+ code <<= 1;
+ }
+ h->maxcode[j] = 0xffffffff;
+
+ // build non-spec acceleration table; 255 is flag for not-accelerated
+ memset(h->fast, 255, 1 << FAST_BITS);
+ for (i=0; i < k; ++i) {
+ int s = h->size[i];
+ if (s <= FAST_BITS) {
+ int c = h->code[i] << (FAST_BITS-s);
+ int m = 1 << (FAST_BITS-s);
+ for (j=0; j < m; ++j) {
+ h->fast[c+j] = (uint8) i;
+ }
+ }
+ }
+ return 1;
+}
+
+static void grow_buffer_unsafe(jpeg *j)
+{
+ do {
+ int b = j->nomore ? 0 : get8(&j->s);
+ if (b == 0xff) {
+ int c = get8(&j->s);
+ if (c != 0) {
+ j->marker = (unsigned char) c;
+ j->nomore = 1;
+ return;
+ }
+ }
+ j->code_buffer = (j->code_buffer << 8) | b;
+ j->code_bits += 8;
+ } while (j->code_bits <= 24);
+}
+
+// (1 << n) - 1
+static uint32 bmask[17]={0,1,3,7,15,31,63,127,255,511,1023,2047,4095,8191,16383,32767,65535};
+
+// decode a jpeg huffman value from the bitstream
+__forceinline static int decode(jpeg *j, huffman *h)
+{
+ unsigned int temp;
+ int c,k;
+
+ if (j->code_bits < 16) grow_buffer_unsafe(j);
+
+ // look at the top FAST_BITS and determine what symbol ID it is,
+ // if the code is <= FAST_BITS
+ c = (j->code_buffer >> (j->code_bits - FAST_BITS)) & ((1 << FAST_BITS)-1);
+ k = h->fast[c];
+ if (k < 255) {
+ if (h->size[k] > j->code_bits)
+ return -1;
+ j->code_bits -= h->size[k];
+ return h->values[k];
+ }
+
+ // naive test is to shift the code_buffer down so k bits are
+ // valid, then test against maxcode. To speed this up, we've
+ // preshifted maxcode left so that it has (16-k) 0s at the
+ // end; in other words, regardless of the number of bits, it
+ // wants to be compared against something shifted to have 16;
+ // that way we don't need to shift inside the loop.
+ if (j->code_bits < 16)
+ temp = (j->code_buffer << (16 - j->code_bits)) & 0xffff;
+ else
+ temp = (j->code_buffer >> (j->code_bits - 16)) & 0xffff;
+ for (k=FAST_BITS+1 ; ; ++k)
+ if (temp < h->maxcode[k])
+ break;
+ if (k == 17) {
+ // error! code not found
+ j->code_bits -= 16;
+ return -1;
+ }
+
+ if (k > j->code_bits)
+ return -1;
+
+ // convert the huffman code to the symbol id
+ c = ((j->code_buffer >> (j->code_bits - k)) & bmask[k]) + h->delta[k];
+ assert((((j->code_buffer) >> (j->code_bits - h->size[c])) & bmask[h->size[c]]) == h->code[c]);
+
+ // convert the id to a symbol
+ j->code_bits -= k;
+ return h->values[c];
+}
+
+// combined JPEG 'receive' and JPEG 'extend', since baseline
+// always extends everything it receives.
+__forceinline static int extend_receive(jpeg *j, int n)
+{
+ unsigned int m = 1 << (n-1);
+ unsigned int k;
+ if (j->code_bits < n) grow_buffer_unsafe(j);
+ k = (j->code_buffer >> (j->code_bits - n)) & bmask[n];
+ j->code_bits -= n;
+ // the following test is probably a random branch that won't
+ // predict well. I tried to table accelerate it but failed.
+ // maybe it's compiling as a conditional move?
+ if (k < m)
+ return (-1 << n) + k + 1;
+ else
+ return k;
+}
+
+// given a value that's at position X in the zigzag stream,
+// where does it appear in the 8x8 matrix coded as row-major?
+static uint8 dezigzag[64+15] =
+{
+ 0, 1, 8, 16, 9, 2, 3, 10,
+ 17, 24, 32, 25, 18, 11, 4, 5,
+ 12, 19, 26, 33, 40, 48, 41, 34,
+ 27, 20, 13, 6, 7, 14, 21, 28,
+ 35, 42, 49, 56, 57, 50, 43, 36,
+ 29, 22, 15, 23, 30, 37, 44, 51,
+ 58, 59, 52, 45, 38, 31, 39, 46,
+ 53, 60, 61, 54, 47, 55, 62, 63,
+ // let corrupt input sample past end
+ 63, 63, 63, 63, 63, 63, 63, 63,
+ 63, 63, 63, 63, 63, 63, 63
+};
+
+// decode one 64-entry block--
+static int decode_block(jpeg *j, short data[64], huffman *hdc, huffman *hac, int b)
+{
+ int diff,dc,k;
+ int t = decode(j, hdc);
+ if (t < 0) return e("bad huffman code","Corrupt JPEG");
+
+ // 0 all the ac values now so we can do it 32-bits at a time
+ memset(data,0,64*sizeof(data[0]));
+
+ diff = t ? extend_receive(j, t) : 0;
+ dc = j->img_comp[b].dc_pred + diff;
+ j->img_comp[b].dc_pred = dc;
+ data[0] = (short) dc;
+
+ // decode AC components, see JPEG spec
+ k = 1;
+ do {
+ int r,s;
+ int rs = decode(j, hac);
+ if (rs < 0) return e("bad huffman code","Corrupt JPEG");
+ s = rs & 15;
+ r = rs >> 4;
+ if (s == 0) {
+ if (rs != 0xf0) break; // end block
+ k += 16;
+ } else {
+ k += r;
+ // decode into unzigzag'd location
+ data[dezigzag[k++]] = (short) extend_receive(j,s);
+ }
+ } while (k < 64);
+ return 1;
+}
+
+// take a -128..127 value and clamp it and convert to 0..255
+__forceinline static uint8 clamp(int x)
+{
+ x += 128;
+ // trick to use a single test to catch both cases
+ if ((unsigned int) x > 255) {
+ if (x < 0) return 0;
+ if (x > 255) return 255;
+ }
+ return (uint8) x;
+}
+
+#define f2f(x) (int) (((x) * 4096 + 0.5))
+#define fsh(x) ((x) << 12)
+
+// derived from jidctint -- DCT_ISLOW
+#define IDCT_1D(s0,s1,s2,s3,s4,s5,s6,s7) \
+ int t0,t1,t2,t3,p1,p2,p3,p4,p5,x0,x1,x2,x3; \
+ p2 = s2; \
+ p3 = s6; \
+ p1 = (p2+p3) * f2f(0.5411961f); \
+ t2 = p1 + p3*f2f(-1.847759065f); \
+ t3 = p1 + p2*f2f( 0.765366865f); \
+ p2 = s0; \
+ p3 = s4; \
+ t0 = fsh(p2+p3); \
+ t1 = fsh(p2-p3); \
+ x0 = t0+t3; \
+ x3 = t0-t3; \
+ x1 = t1+t2; \
+ x2 = t1-t2; \
+ t0 = s7; \
+ t1 = s5; \
+ t2 = s3; \
+ t3 = s1; \
+ p3 = t0+t2; \
+ p4 = t1+t3; \
+ p1 = t0+t3; \
+ p2 = t1+t2; \
+ p5 = (p3+p4)*f2f( 1.175875602f); \
+ t0 = t0*f2f( 0.298631336f); \
+ t1 = t1*f2f( 2.053119869f); \
+ t2 = t2*f2f( 3.072711026f); \
+ t3 = t3*f2f( 1.501321110f); \
+ p1 = p5 + p1*f2f(-0.899976223f); \
+ p2 = p5 + p2*f2f(-2.562915447f); \
+ p3 = p3*f2f(-1.961570560f); \
+ p4 = p4*f2f(-0.390180644f); \
+ t3 += p1+p4; \
+ t2 += p2+p3; \
+ t1 += p2+p4; \
+ t0 += p1+p3;
+
+#if !STBI_SIMD
+// .344 seconds on 3*anemones.jpg
+static void idct_block(uint8 *out, int out_stride, short data[64], uint8 *dequantize)
+{
+ int i,val[64],*v=val;
+ uint8 *o,*dq = dequantize;
+ short *d = data;
+
+ // columns
+ for (i=0; i < 8; ++i,++d,++dq, ++v) {
+ // if all zeroes, shortcut -- this avoids dequantizing 0s and IDCTing
+ if (d[ 8]==0 && d[16]==0 && d[24]==0 && d[32]==0
+ && d[40]==0 && d[48]==0 && d[56]==0) {
+ // no shortcut 0 seconds
+ // (1|2|3|4|5|6|7)==0 0 seconds
+ // all separate -0.047 seconds
+ // 1 && 2|3 && 4|5 && 6|7: -0.047 seconds
+ int dcterm = d[0] * dq[0] << 2;
+ v[0] = v[8] = v[16] = v[24] = v[32] = v[40] = v[48] = v[56] = dcterm;
+ } else {
+ IDCT_1D(d[ 0]*dq[ 0],d[ 8]*dq[ 8],d[16]*dq[16],d[24]*dq[24],
+ d[32]*dq[32],d[40]*dq[40],d[48]*dq[48],d[56]*dq[56])
+ // constants scaled things up by 1<<12; let's bring them back
+ // down, but keep 2 extra bits of precision
+ x0 += 512; x1 += 512; x2 += 512; x3 += 512;
+ v[ 0] = (x0+t3) >> 10;
+ v[56] = (x0-t3) >> 10;
+ v[ 8] = (x1+t2) >> 10;
+ v[48] = (x1-t2) >> 10;
+ v[16] = (x2+t1) >> 10;
+ v[40] = (x2-t1) >> 10;
+ v[24] = (x3+t0) >> 10;
+ v[32] = (x3-t0) >> 10;
+ }
+ }
+
+ for (i=0, v=val, o=out; i < 8; ++i,v+=8,o+=out_stride) {
+ // no fast case since the first 1D IDCT spread components out
+ IDCT_1D(v[0],v[1],v[2],v[3],v[4],v[5],v[6],v[7])
+ // constants scaled things up by 1<<12, plus we had 1<<2 from first
+ // loop, plus horizontal and vertical each scale by sqrt(8) so together
+ // we've got an extra 1<<3, so 1<<17 total we need to remove.
+ x0 += 65536; x1 += 65536; x2 += 65536; x3 += 65536;
+ o[0] = clamp((x0+t3) >> 17);
+ o[7] = clamp((x0-t3) >> 17);
+ o[1] = clamp((x1+t2) >> 17);
+ o[6] = clamp((x1-t2) >> 17);
+ o[2] = clamp((x2+t1) >> 17);
+ o[5] = clamp((x2-t1) >> 17);
+ o[3] = clamp((x3+t0) >> 17);
+ o[4] = clamp((x3-t0) >> 17);
+ }
+}
+#else
+static void idct_block(uint8 *out, int out_stride, short data[64], unsigned short *dequantize)
+{
+ int i,val[64],*v=val;
+ uint8 *o;
+ unsigned short *dq = dequantize;
+ short *d = data;
+
+ // columns
+ for (i=0; i < 8; ++i,++d,++dq, ++v) {
+ // if all zeroes, shortcut -- this avoids dequantizing 0s and IDCTing
+ if (d[ 8]==0 && d[16]==0 && d[24]==0 && d[32]==0
+ && d[40]==0 && d[48]==0 && d[56]==0) {
+ // no shortcut 0 seconds
+ // (1|2|3|4|5|6|7)==0 0 seconds
+ // all separate -0.047 seconds
+ // 1 && 2|3 && 4|5 && 6|7: -0.047 seconds
+ int dcterm = d[0] * dq[0] << 2;
+ v[0] = v[8] = v[16] = v[24] = v[32] = v[40] = v[48] = v[56] = dcterm;
+ } else {
+ IDCT_1D(d[ 0]*dq[ 0],d[ 8]*dq[ 8],d[16]*dq[16],d[24]*dq[24],
+ d[32]*dq[32],d[40]*dq[40],d[48]*dq[48],d[56]*dq[56])
+ // constants scaled things up by 1<<12; let's bring them back
+ // down, but keep 2 extra bits of precision
+ x0 += 512; x1 += 512; x2 += 512; x3 += 512;
+ v[ 0] = (x0+t3) >> 10;
+ v[56] = (x0-t3) >> 10;
+ v[ 8] = (x1+t2) >> 10;
+ v[48] = (x1-t2) >> 10;
+ v[16] = (x2+t1) >> 10;
+ v[40] = (x2-t1) >> 10;
+ v[24] = (x3+t0) >> 10;
+ v[32] = (x3-t0) >> 10;
+ }
+ }
+
+ for (i=0, v=val, o=out; i < 8; ++i,v+=8,o+=out_stride) {
+ // no fast case since the first 1D IDCT spread components out
+ IDCT_1D(v[0],v[1],v[2],v[3],v[4],v[5],v[6],v[7])
+ // constants scaled things up by 1<<12, plus we had 1<<2 from first
+ // loop, plus horizontal and vertical each scale by sqrt(8) so together
+ // we've got an extra 1<<3, so 1<<17 total we need to remove.
+ x0 += 65536; x1 += 65536; x2 += 65536; x3 += 65536;
+ o[0] = clamp((x0+t3) >> 17);
+ o[7] = clamp((x0-t3) >> 17);
+ o[1] = clamp((x1+t2) >> 17);
+ o[6] = clamp((x1-t2) >> 17);
+ o[2] = clamp((x2+t1) >> 17);
+ o[5] = clamp((x2-t1) >> 17);
+ o[3] = clamp((x3+t0) >> 17);
+ o[4] = clamp((x3-t0) >> 17);
+ }
+}
+static stbi_idct_8x8 stbi_idct_installed = idct_block;
+
+extern void stbi_install_idct(stbi_idct_8x8 func)
+{
+ stbi_idct_installed = func;
+}
+#endif
+
+#define MARKER_none 0xff
+// if there's a pending marker from the entropy stream, return that
+// otherwise, fetch from the stream and get a marker. if there's no
+// marker, return 0xff, which is never a valid marker value
+static uint8 get_marker(jpeg *j)
+{
+ uint8 x;
+ if (j->marker != MARKER_none) { x = j->marker; j->marker = MARKER_none; return x; }
+ x = get8u(&j->s);
+ if (x != 0xff) return MARKER_none;
+ while (x == 0xff)
+ x = get8u(&j->s);
+ return x;
+}
+
+// in each scan, we'll have scan_n components, and the order
+// of the components is specified by order[]
+#define RESTART(x) ((x) >= 0xd0 && (x) <= 0xd7)
+
+// after a restart interval, reset the entropy decoder and
+// the dc prediction
+static void reset(jpeg *j)
+{
+ j->code_bits = 0;
+ j->code_buffer = 0;
+ j->nomore = 0;
+ j->img_comp[0].dc_pred = j->img_comp[1].dc_pred = j->img_comp[2].dc_pred = 0;
+ j->marker = MARKER_none;
+ j->todo = j->restart_interval ? j->restart_interval : 0x7fffffff;
+ // no more than 1<<31 MCUs if no restart_interal? that's plenty safe,
+ // since we don't even allow 1<<30 pixels
+}
+
+static int parse_entropy_coded_data(jpeg *z)
+{
+ reset(z);
+ if (z->scan_n == 1) {
+ int i,j;
+#if STBI_SIMD
+ __declspec(align(16))
+ #endif
+ short data[64];
+ int n = z->order[0];
+ // non-interleaved data, we just need to process one block at a time,
+ // in trivial scanline order
+ // number of blocks to do just depends on how many actual "pixels" this
+ // component has, independent of interleaved MCU blocking and such
+ int w = (z->img_comp[n].x+7) >> 3;
+ int h = (z->img_comp[n].y+7) >> 3;
+ for (j=0; j < h; ++j) {
+ for (i=0; i < w; ++i) {
+ if (!decode_block(z, data, z->huff_dc+z->img_comp[n].hd, z->huff_ac+z->img_comp[n].ha, n)) return 0;
+#if STBI_SIMD
+ stbi_idct_installed(z->img_comp[n].data+z->img_comp[n].w2*j*8+i*8, z->img_comp[n].w2, data, z->dequant2[z->img_comp[n].tq]);
+#else
+ idct_block(z->img_comp[n].data+z->img_comp[n].w2*j*8+i*8, z->img_comp[n].w2, data, z->dequant[z->img_comp[n].tq]);
+#endif
+ // every data block is an MCU, so countdown the restart interval
+ if (--z->todo <= 0) {
+ if (z->code_bits < 24) grow_buffer_unsafe(z);
+ // if it's NOT a restart, then just bail, so we get corrupt data
+ // rather than no data
+ if (!RESTART(z->marker)) return 1;
+ reset(z);
+ }
+ }
+ }
+ } else { // interleaved!
+ int i,j,k,x,y;
+ short data[64];
+ for (j=0; j < z->img_mcu_y; ++j) {
+ for (i=0; i < z->img_mcu_x; ++i) {
+ // scan an interleaved mcu... process scan_n components in order
+ for (k=0; k < z->scan_n; ++k) {
+ int n = z->order[k];
+ // scan out an mcu's worth of this component; that's just determined
+ // by the basic H and V specified for the component
+ for (y=0; y < z->img_comp[n].v; ++y) {
+ for (x=0; x < z->img_comp[n].h; ++x) {
+ int x2 = (i*z->img_comp[n].h + x)*8;
+ int y2 = (j*z->img_comp[n].v + y)*8;
+ if (!decode_block(z, data, z->huff_dc+z->img_comp[n].hd, z->huff_ac+z->img_comp[n].ha, n)) return 0;
+#if STBI_SIMD
+ stbi_idct_installed(z->img_comp[n].data+z->img_comp[n].w2*y2+x2, z->img_comp[n].w2, data, z->dequant2[z->img_comp[n].tq]);
+#else
+ idct_block(z->img_comp[n].data+z->img_comp[n].w2*y2+x2, z->img_comp[n].w2, data, z->dequant[z->img_comp[n].tq]);
+#endif
+ }
+ }
+ }
+ // after all interleaved components, that's an interleaved MCU,
+ // so now count down the restart interval
+ if (--z->todo <= 0) {
+ if (z->code_bits < 24) grow_buffer_unsafe(z);
+ // if it's NOT a restart, then just bail, so we get corrupt data
+ // rather than no data
+ if (!RESTART(z->marker)) return 1;
+ reset(z);
+ }
+ }
+ }
+ }
+ return 1;
+}
+
+static int process_marker(jpeg *z, int m)
+{
+ int L;
+ switch (m) {
+ case MARKER_none: // no marker found
+ return e("expected marker","Corrupt JPEG");
+
+ case 0xC2: // SOF - progressive
+ return e("progressive jpeg","JPEG format not supported (progressive)");
+
+ case 0xDD: // DRI - specify restart interval
+ if (get16(&z->s) != 4) return e("bad DRI len","Corrupt JPEG");
+ z->restart_interval = get16(&z->s);
+ return 1;
+
+ case 0xDB: // DQT - define quantization table
+ L = get16(&z->s)-2;
+ while (L > 0) {
+ int q = get8(&z->s);
+ int p = q >> 4;
+ int t = q & 15,i;
+ if (p != 0) return e("bad DQT type","Corrupt JPEG");
+ if (t > 3) return e("bad DQT table","Corrupt JPEG");
+ for (i=0; i < 64; ++i)
+ z->dequant[t][dezigzag[i]] = get8u(&z->s);
+#if STBI_SIMD
+ for (i=0; i < 64; ++i)
+ z->dequant2[t][i] = dequant[t][i];
+#endif
+ L -= 65;
+ }
+ return L==0;
+
+ case 0xC4: // DHT - define huffman table
+ L = get16(&z->s)-2;
+ while (L > 0) {
+ uint8 *v;
+ int sizes[16],i,m=0;
+ int q = get8(&z->s);
+ int tc = q >> 4;
+ int th = q & 15;
+ if (tc > 1 || th > 3) return e("bad DHT header","Corrupt JPEG");
+ for (i=0; i < 16; ++i) {
+ sizes[i] = get8(&z->s);
+ m += sizes[i];
+ }
+ L -= 17;
+ if (tc == 0) {
+ if (!build_huffman(z->huff_dc+th, sizes)) return 0;
+ v = z->huff_dc[th].values;
+ } else {
+ if (!build_huffman(z->huff_ac+th, sizes)) return 0;
+ v = z->huff_ac[th].values;
+ }
+ for (i=0; i < m; ++i)
+ v[i] = get8u(&z->s);
+ L -= m;
+ }
+ return L==0;
+ }
+ // check for comment block or APP blocks
+ if ((m >= 0xE0 && m <= 0xEF) || m == 0xFE) {
+ skip(&z->s, get16(&z->s)-2);
+ return 1;
+ }
+ return 0;
+}
+
+// after we see SOS
+static int process_scan_header(jpeg *z)
+{
+ int i;
+ int Ls = get16(&z->s);
+ z->scan_n = get8(&z->s);
+ if (z->scan_n < 1 || z->scan_n > 4 || z->scan_n > (int) z->s.img_n) return e("bad SOS component count","Corrupt JPEG");
+ if (Ls != 6+2*z->scan_n) return e("bad SOS len","Corrupt JPEG");
+ for (i=0; i < z->scan_n; ++i) {
+ int id = get8(&z->s), which;
+ int q = get8(&z->s);
+ for (which = 0; which < z->s.img_n; ++which)
+ if (z->img_comp[which].id == id)
+ break;
+ if (which == z->s.img_n) return 0;
+ z->img_comp[which].hd = q >> 4; if (z->img_comp[which].hd > 3) return e("bad DC huff","Corrupt JPEG");
+ z->img_comp[which].ha = q & 15; if (z->img_comp[which].ha > 3) return e("bad AC huff","Corrupt JPEG");
+ z->order[i] = which;
+ }
+ if (get8(&z->s) != 0) return e("bad SOS","Corrupt JPEG");
+ get8(&z->s); // should be 63, but might be 0
+ if (get8(&z->s) != 0) return e("bad SOS","Corrupt JPEG");
+
+ return 1;
+}
+
+static int process_frame_header(jpeg *z, int scan)
+{
+ stbi *s = &z->s;
+ int Lf,p,i,q, h_max=1,v_max=1;
+ Lf = get16(s); if (Lf < 11) return e("bad SOF len","Corrupt JPEG"); // JPEG
+ p = get8(s); if (p != 8) return e("only 8-bit","JPEG format not supported: 8-bit only"); // JPEG baseline
+ s->img_y = get16(s); if (s->img_y == 0) return e("no header height", "JPEG format not supported: delayed height"); // Legal, but we don't handle it--but neither does IJG
+ s->img_x = get16(s); if (s->img_x == 0) return e("0 width","Corrupt JPEG"); // JPEG requires
+ s->img_n = get8(s);
+ if (s->img_n != 3 && s->img_n != 1) return e("bad component count","Corrupt JPEG"); // JFIF requires
+
+ if (Lf != 8+3*s->img_n) return e("bad SOF len","Corrupt JPEG");
+
+ for (i=0; i < s->img_n; ++i) {
+ z->img_comp[i].id = get8(s);
+ if (z->img_comp[i].id != i+1) // JFIF requires
+ if (z->img_comp[i].id != i) // some version of jpegtran outputs non-JFIF-compliant files!
+ return e("bad component ID","Corrupt JPEG");
+ q = get8(s);
+ z->img_comp[i].h = (q >> 4); if (!z->img_comp[i].h || z->img_comp[i].h > 4) return e("bad H","Corrupt JPEG");
+ z->img_comp[i].v = q & 15; if (!z->img_comp[i].v || z->img_comp[i].v > 4) return e("bad V","Corrupt JPEG");
+ z->img_comp[i].tq = get8(s); if (z->img_comp[i].tq > 3) return e("bad TQ","Corrupt JPEG");
+ }
+
+ if (scan != SCAN_load) return 1;
+
+ if ((1 << 30) / s->img_x / s->img_n < s->img_y) return e("too large", "Image too large to decode");
+
+ for (i=0; i < s->img_n; ++i) {
+ if (z->img_comp[i].h > h_max) h_max = z->img_comp[i].h;
+ if (z->img_comp[i].v > v_max) v_max = z->img_comp[i].v;
+ }
+
+ // compute interleaved mcu info
+ z->img_h_max = h_max;
+ z->img_v_max = v_max;
+ z->img_mcu_w = h_max * 8;
+ z->img_mcu_h = v_max * 8;
+ z->img_mcu_x = (s->img_x + z->img_mcu_w-1) / z->img_mcu_w;
+ z->img_mcu_y = (s->img_y + z->img_mcu_h-1) / z->img_mcu_h;
+
+ for (i=0; i < s->img_n; ++i) {
+ // number of effective pixels (e.g. for non-interleaved MCU)
+ z->img_comp[i].x = (s->img_x * z->img_comp[i].h + h_max-1) / h_max;
+ z->img_comp[i].y = (s->img_y * z->img_comp[i].v + v_max-1) / v_max;
+ // to simplify generation, we'll allocate enough memory to decode
+ // the bogus oversized data from using interleaved MCUs and their
+ // big blocks (e.g. a 16x16 iMCU on an image of width 33); we won't
+ // discard the extra data until colorspace conversion
+ z->img_comp[i].w2 = z->img_mcu_x * z->img_comp[i].h * 8;
+ z->img_comp[i].h2 = z->img_mcu_y * z->img_comp[i].v * 8;
+ z->img_comp[i].raw_data = malloc(z->img_comp[i].w2 * z->img_comp[i].h2+15);
+ if (z->img_comp[i].raw_data == NULL) {
+ for(--i; i >= 0; --i) {
+ free(z->img_comp[i].raw_data);
+ z->img_comp[i].data = NULL;
+ }
+ return e("outofmem", "Out of memory");
+ }
+ // align blocks for installable-idct using mmx/sse
+ z->img_comp[i].data = (uint8*) (((size_t) z->img_comp[i].raw_data + 15) & ~15);
+ z->img_comp[i].linebuf = NULL;
+ }
+
+ return 1;
+}
+
+// use comparisons since in some cases we handle more than one case (e.g. SOF)
+#define DNL(x) ((x) == 0xdc)
+#define SOI(x) ((x) == 0xd8)
+#define EOI(x) ((x) == 0xd9)
+#define SOF(x) ((x) == 0xc0 || (x) == 0xc1)
+#define SOS(x) ((x) == 0xda)
+
+static int decode_jpeg_header(jpeg *z, int scan)
+{
+ int m;
+ z->marker = MARKER_none; // initialize cached marker to empty
+ m = get_marker(z);
+ if (!SOI(m)) return e("no SOI","Corrupt JPEG");
+ if (scan == SCAN_type) return 1;
+ m = get_marker(z);
+ while (!SOF(m)) {
+ if (!process_marker(z,m)) return 0;
+ m = get_marker(z);
+ while (m == MARKER_none) {
+ // some files have extra padding after their blocks, so ok, we'll scan
+ if (at_eof(&z->s)) return e("no SOF", "Corrupt JPEG");
+ m = get_marker(z);
+ }
+ }
+ if (!process_frame_header(z, scan)) return 0;
+ return 1;
+}
+
+static int decode_jpeg_image(jpeg *j)
+{
+ int m;
+ j->restart_interval = 0;
+ if (!decode_jpeg_header(j, SCAN_load)) return 0;
+ m = get_marker(j);
+ while (!EOI(m)) {
+ if (SOS(m)) {
+ if (!process_scan_header(j)) return 0;
+ if (!parse_entropy_coded_data(j)) return 0;
+ } else {
+ if (!process_marker(j, m)) return 0;
+ }
+ m = get_marker(j);
+ }
+ return 1;
+}
+
+// static jfif-centered resampling (across block boundaries)
+
+typedef uint8 *(*resample_row_func)(uint8 *out, uint8 *in0, uint8 *in1,
+ int w, int hs);
+
+#define div4(x) ((uint8) ((x) >> 2))
+
+static uint8 *resample_row_1(uint8 *out, uint8 *in_near, uint8 *in_far, int w, int hs)
+{
+ STB_UNUSED(out);
+ STB_UNUSED(in_far);
+ STB_UNUSED(w);
+ STB_UNUSED(hs);
+ return in_near;
+}
+
+static uint8* resample_row_v_2(uint8 *out, uint8 *in_near, uint8 *in_far, int w, int hs)
+{
+ STB_UNUSED(hs);
+ // need to generate two samples vertically for every one in input
+ int i;
+ for (i=0; i < w; ++i)
+ out[i] = div4(3*in_near[i] + in_far[i] + 2);
+ return out;
+}
+
+static uint8* resample_row_h_2(uint8 *out, uint8 *in_near, uint8 *in_far, int w, int hs)
+{
+ STB_UNUSED(in_far);
+ STB_UNUSED(hs);
+ // need to generate two samples horizontally for every one in input
+ int i;
+ uint8 *input = in_near;
+ if (w == 1) {
+ // if only one sample, can't do any interpolation
+ out[0] = out[1] = input[0];
+ return out;
+ }
+
+ out[0] = input[0];
+ out[1] = div4(input[0]*3 + input[1] + 2);
+ for (i=1; i < w-1; ++i) {
+ int n = 3*input[i]+2;
+ out[i*2+0] = div4(n+input[i-1]);
+ out[i*2+1] = div4(n+input[i+1]);
+ }
+ out[i*2+0] = div4(input[w-2]*3 + input[w-1] + 2);
+ out[i*2+1] = input[w-1];
+ return out;
+}
+
+#define div16(x) ((uint8) ((x) >> 4))
+
+static uint8 *resample_row_hv_2(uint8 *out, uint8 *in_near, uint8 *in_far, int w, int hs)
+{
+ STB_UNUSED(hs);
+ // need to generate 2x2 samples for every one in input
+ int i,t0,t1;
+ if (w == 1) {
+ out[0] = out[1] = div4(3*in_near[0] + in_far[0] + 2);
+ return out;
+ }
+
+ t1 = 3*in_near[0] + in_far[0];
+ out[0] = div4(t1+2);
+ for (i=1; i < w; ++i) {
+ t0 = t1;
+ t1 = 3*in_near[i]+in_far[i];
+ out[i*2-1] = div16(3*t0 + t1 + 8);
+ out[i*2 ] = div16(3*t1 + t0 + 8);
+ }
+ out[w*2-1] = div4(t1+2);
+ return out;
+}
+
+static uint8 *resample_row_generic(uint8 *out, uint8 *in_near, uint8 *in_far, int w, int hs)
+{
+ STB_UNUSED(in_far);
+ // resample with nearest-neighbor
+ int i,j;
+ for (i=0; i < w; ++i)
+ for (j=0; j < hs; ++j)
+ out[i*hs+j] = in_near[i];
+ return out;
+}
+
+#define float2fixed(x) ((int) ((x) * 65536 + 0.5))
+
+// 0.38 seconds on 3*anemones.jpg (0.25 with processor = Pro)
+// VC6 without processor=Pro is generating multiple LEAs per multiply!
+static void YCbCr_to_RGB_row(uint8 *out, uint8 *y, uint8 *pcb, uint8 *pcr, int count, int step)
+{
+ int i;
+ for (i=0; i < count; ++i) {
+ int y_fixed = (y[i] << 16) + 32768; // rounding
+ int r,g,b;
+ int cr = pcr[i] - 128;
+ int cb = pcb[i] - 128;
+ r = y_fixed + cr*float2fixed(1.40200f);
+ g = y_fixed - cr*float2fixed(0.71414f) - cb*float2fixed(0.34414f);
+ b = y_fixed + cb*float2fixed(1.77200f);
+ r >>= 16;
+ g >>= 16;
+ b >>= 16;
+ if ((unsigned) r > 255) { if (r < 0) r = 0; else r = 255; }
+ if ((unsigned) g > 255) { if (g < 0) g = 0; else g = 255; }
+ if ((unsigned) b > 255) { if (b < 0) b = 0; else b = 255; }
+ out[0] = (uint8)r;
+ out[1] = (uint8)g;
+ out[2] = (uint8)b;
+ out[3] = 255;
+ out += step;
+ }
+}
+
+#if STBI_SIMD
+static stbi_YCbCr_to_RGB_run stbi_YCbCr_installed = YCbCr_to_RGB_row;
+
+void stbi_install_YCbCr_to_RGB(stbi_YCbCr_to_RGB_run func)
+{
+ stbi_YCbCr_installed = func;
+}
+#endif
+
+
+// clean up the temporary component buffers
+static void cleanup_jpeg(jpeg *j)
+{
+ int i;
+ for (i=0; i < j->s.img_n; ++i) {
+ if (j->img_comp[i].data) {
+ free(j->img_comp[i].raw_data);
+ j->img_comp[i].data = NULL;
+ }
+ if (j->img_comp[i].linebuf) {
+ free(j->img_comp[i].linebuf);
+ j->img_comp[i].linebuf = NULL;
+ }
+ }
+}
+
+typedef struct
+{
+ resample_row_func resample;
+ uint8 *line0,*line1;
+ int hs,vs; // expansion factor in each axis
+ int w_lores; // horizontal pixels pre-expansion
+ int ystep; // how far through vertical expansion we are
+ int ypos; // which pre-expansion row we're on
+} stbi_resample;
+
+static uint8 *load_jpeg_image(jpeg *z, int *out_x, int *out_y, int *comp, int req_comp)
+{
+ int n, decode_n;
+ // validate req_comp
+ if (req_comp < 0 || req_comp > 4) return epuc("bad req_comp", "Internal error");
+
+ // load a jpeg image from whichever source
+ if (!decode_jpeg_image(z)) { cleanup_jpeg(z); return NULL; }
+
+ // determine actual number of components to generate
+ n = req_comp ? req_comp : z->s.img_n;
+
+ if (z->s.img_n == 3 && n < 3)
+ decode_n = 1;
+ else
+ decode_n = z->s.img_n;
+
+ // resample and color-convert
+ {
+ int k;
+ uint i,j;
+ uint8 *output;
+ uint8 *coutput[4];
+
+ stbi_resample res_comp[4];
+
+ for (k=0; k < decode_n; ++k) {
+ stbi_resample *r = &res_comp[k];
+
+ // allocate line buffer big enough for upsampling off the edges
+ // with upsample factor of 4
+ z->img_comp[k].linebuf = (uint8 *) malloc(z->s.img_x + 3);
+ if (!z->img_comp[k].linebuf) { cleanup_jpeg(z); return epuc("outofmem", "Out of memory"); }
+
+ r->hs = z->img_h_max / z->img_comp[k].h;
+ r->vs = z->img_v_max / z->img_comp[k].v;
+ r->ystep = r->vs >> 1;
+ r->w_lores = (z->s.img_x + r->hs-1) / r->hs;
+ r->ypos = 0;
+ r->line0 = r->line1 = z->img_comp[k].data;
+
+ if (r->hs == 1 && r->vs == 1) r->resample = resample_row_1;
+ else if (r->hs == 1 && r->vs == 2) r->resample = resample_row_v_2;
+ else if (r->hs == 2 && r->vs == 1) r->resample = resample_row_h_2;
+ else if (r->hs == 2 && r->vs == 2) r->resample = resample_row_hv_2;
+ else r->resample = resample_row_generic;
+ }
+
+ // can't error after this so, this is safe
+ output = (uint8 *) malloc(n * z->s.img_x * z->s.img_y + 1);
+ if (!output) { cleanup_jpeg(z); return epuc("outofmem", "Out of memory"); }
+
+ // now go ahead and resample
+ for (j=0; j < z->s.img_y; ++j) {
+ uint8 *out = output + n * z->s.img_x * j;
+ for (k=0; k < decode_n; ++k) {
+ stbi_resample *r = &res_comp[k];
+ int y_bot = r->ystep >= (r->vs >> 1);
+ coutput[k] = r->resample(z->img_comp[k].linebuf,
+ y_bot ? r->line1 : r->line0,
+ y_bot ? r->line0 : r->line1,
+ r->w_lores, r->hs);
+ if (++r->ystep >= r->vs) {
+ r->ystep = 0;
+ r->line0 = r->line1;
+ if (++r->ypos < z->img_comp[k].y)
+ r->line1 += z->img_comp[k].w2;
+ }
+ }
+ if (n >= 3) {
+ uint8 *y = coutput[0];
+ if (z->s.img_n == 3) {
+#if STBI_SIMD
+ stbi_YCbCr_installed(out, y, coutput[1], coutput[2], z->s.img_x, n);
+#else
+ YCbCr_to_RGB_row(out, y, coutput[1], coutput[2], z->s.img_x, n);
+#endif
+ } else
+ for (i=0; i < z->s.img_x; ++i) {
+ out[0] = out[1] = out[2] = y[i];
+ out[3] = 255; // not used if n==3
+ out += n;
+ }
+ } else {
+ uint8 *y = coutput[0];
+ if (n == 1)
+ for (i=0; i < z->s.img_x; ++i) out[i] = y[i];
+ else
+ for (i=0; i < z->s.img_x; ++i) *out++ = y[i], *out++ = 255;
+ }
+ }
+ cleanup_jpeg(z);
+ *out_x = z->s.img_x;
+ *out_y = z->s.img_y;
+ if (comp) *comp = z->s.img_n; // report original components, not output
+ return output;
+ }
+}
+
+#ifndef STBI_NO_STDIO
+unsigned char *stbi_jpeg_load_from_file(FILE *f, int *x, int *y, int *comp, int req_comp)
+{
+ jpeg j;
+ start_file(&j.s, f);
+ return load_jpeg_image(&j, x,y,comp,req_comp);
+}
+
+unsigned char *stbi_jpeg_load(char const *filename, int *x, int *y, int *comp, int req_comp)
+{
+ unsigned char *data;
+ FILE *f = fopen(filename, "rb");
+ if (!f) return NULL;
+ data = stbi_jpeg_load_from_file(f,x,y,comp,req_comp);
+ fclose(f);
+ return data;
+}
+#endif
+
+unsigned char *stbi_jpeg_load_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp)
+{
+ jpeg j;
+ start_mem(&j.s, buffer,len);
+ return load_jpeg_image(&j, x,y,comp,req_comp);
+}
+
+#ifndef STBI_NO_STDIO
+int stbi_jpeg_test_file(FILE *f)
+{
+ int n,r;
+ jpeg j;
+ n = ftell(f);
+ start_file(&j.s, f);
+ r = decode_jpeg_header(&j, SCAN_type);
+ fseek(f,n,SEEK_SET);
+ return r;
+}
+#endif
+
+int stbi_jpeg_test_memory(stbi_uc const *buffer, int len)
+{
+ jpeg j;
+ start_mem(&j.s, buffer,len);
+ return decode_jpeg_header(&j, SCAN_type);
+}
+
+// @TODO:
+#ifndef STBI_NO_STDIO
+extern int stbi_jpeg_info (char const *filename, int *x, int *y, int *comp);
+extern int stbi_jpeg_info_from_file (FILE *f, int *x, int *y, int *comp);
+#endif
+extern int stbi_jpeg_info_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp);
+
+// public domain zlib decode v0.2 Sean Barrett 2006-11-18
+// simple implementation
+// - all input must be provided in an upfront buffer
+// - all output is written to a single output buffer (can malloc/realloc)
+// performance
+// - fast huffman
+
+// fast-way is faster to check than jpeg huffman, but slow way is slower
+#define ZFAST_BITS 9 // accelerate all cases in default tables
+#define ZFAST_MASK ((1 << ZFAST_BITS) - 1)
+
+// zlib-style huffman encoding
+// (jpegs packs from left, zlib from right, so can't share code)
+typedef struct
+{
+ uint16 fast[1 << ZFAST_BITS];
+ uint16 firstcode[16];
+ int maxcode[17];
+ uint16 firstsymbol[16];
+ uint8 size[288];
+ uint16 value[288];
+} zhuffman;
+
+__forceinline static int bitreverse16(int n)
+{
+ n = ((n & 0xAAAA) >> 1) | ((n & 0x5555) << 1);
+ n = ((n & 0xCCCC) >> 2) | ((n & 0x3333) << 2);
+ n = ((n & 0xF0F0) >> 4) | ((n & 0x0F0F) << 4);
+ n = ((n & 0xFF00) >> 8) | ((n & 0x00FF) << 8);
+ return n;
+}
+
+__forceinline static int bit_reverse(int v, int bits)
+{
+ assert(bits <= 16);
+ // to bit reverse n bits, reverse 16 and shift
+ // e.g. 11 bits, bit reverse and shift away 5
+ return bitreverse16(v) >> (16-bits);
+}
+
+static int zbuild_huffman(zhuffman *z, uint8 *sizelist, int num)
+{
+ int i,k=0;
+ int code, next_code[16], sizes[17];
+
+ // DEFLATE spec for generating codes
+ memset(sizes, 0, sizeof(sizes));
+ memset(z->fast, 255, sizeof(z->fast));
+ for (i=0; i < num; ++i)
+ ++sizes[sizelist[i]];
+ sizes[0] = 0;
+ for (i=1; i < 16; ++i)
+ assert(sizes[i] <= (1 << i));
+ code = 0;
+ for (i=1; i < 16; ++i) {
+ next_code[i] = code;
+ z->firstcode[i] = (uint16) code;
+ z->firstsymbol[i] = (uint16) k;
+ code = (code + sizes[i]);
+ if (sizes[i])
+ if (code-1 >= (1 << i)) return e("bad codelengths","Corrupt JPEG");
+ z->maxcode[i] = code << (16-i); // preshift for inner loop
+ code <<= 1;
+ k += sizes[i];
+ }
+ z->maxcode[16] = 0x10000; // sentinel
+ for (i=0; i < num; ++i) {
+ int s = sizelist[i];
+ if (s) {
+ int c = next_code[s] - z->firstcode[s] + z->firstsymbol[s];
+ z->size[c] = (uint8)s;
+ z->value[c] = (uint16)i;
+ if (s <= ZFAST_BITS) {
+ int k = bit_reverse(next_code[s],s);
+ while (k < (1 << ZFAST_BITS)) {
+ z->fast[k] = (uint16) c;
+ k += (1 << s);
+ }
+ }
+ ++next_code[s];
+ }
+ }
+ return 1;
+}
+
+// zlib-from-memory implementation for PNG reading
+// because PNG allows splitting the zlib stream arbitrarily,
+// and it's annoying structurally to have PNG call ZLIB call PNG,
+// we require PNG read all the IDATs and combine them into a single
+// memory buffer
+
+typedef struct
+{
+ uint8 *zbuffer, *zbuffer_end;
+ int num_bits;
+ uint32 code_buffer;
+
+ char *zout;
+ char *zout_start;
+ char *zout_end;
+ int z_expandable;
+
+ zhuffman z_length, z_distance;
+} zbuf;
+
+__forceinline static int zget8(zbuf *z)
+{
+ if (z->zbuffer >= z->zbuffer_end) return 0;
+ return *z->zbuffer++;
+}
+
+static void fill_bits(zbuf *z)
+{
+ do {
+ assert(z->code_buffer < (1U << z->num_bits));
+ z->code_buffer |= zget8(z) << z->num_bits;
+ z->num_bits += 8;
+ } while (z->num_bits <= 24);
+}
+
+__forceinline static unsigned int zreceive(zbuf *z, int n)
+{
+ unsigned int k;
+ if (z->num_bits < n) fill_bits(z);
+ k = z->code_buffer & ((1 << n) - 1);
+ z->code_buffer >>= n;
+ z->num_bits -= n;
+ return k;
+}
+
+__forceinline static int zhuffman_decode(zbuf *a, zhuffman *z)
+{
+ int b,s,k;
+ if (a->num_bits < 16) fill_bits(a);
+ b = z->fast[a->code_buffer & ZFAST_MASK];
+ if (b < 0xffff) {
+ s = z->size[b];
+ a->code_buffer >>= s;
+ a->num_bits -= s;
+ return z->value[b];
+ }
+
+ // not resolved by fast table, so compute it the slow way
+ // use jpeg approach, which requires MSbits at top
+ k = bit_reverse(a->code_buffer, 16);
+ for (s=ZFAST_BITS+1; ; ++s)
+ if (k < z->maxcode[s])
+ break;
+ if (s == 16) return -1; // invalid code!
+ // code size is s, so:
+ b = (k >> (16-s)) - z->firstcode[s] + z->firstsymbol[s];
+ assert(z->size[b] == s);
+ a->code_buffer >>= s;
+ a->num_bits -= s;
+ return z->value[b];
+}
+
+static int expand(zbuf *z, int n) // need to make room for n bytes
+{
+ char *q;
+ int cur, limit;
+ if (!z->z_expandable) return e("output buffer limit","Corrupt PNG");
+ cur = (int) (z->zout - z->zout_start);
+ limit = (int) (z->zout_end - z->zout_start);
+ while (cur + n > limit)
+ limit *= 2;
+ q = (char *) realloc(z->zout_start, limit);
+ if (q == NULL) return e("outofmem", "Out of memory");
+ z->zout_start = q;
+ z->zout = q + cur;
+ z->zout_end = q + limit;
+ return 1;
+}
+
+static int length_base[31] = {
+ 3,4,5,6,7,8,9,10,11,13,
+ 15,17,19,23,27,31,35,43,51,59,
+ 67,83,99,115,131,163,195,227,258,0,0 };
+
+static int length_extra[31]=
+{ 0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0,0,0 };
+
+static int dist_base[32] = { 1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193,
+ 257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577,0,0};
+
+static int dist_extra[32] =
+{ 0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13};
+
+static int parse_huffman_block(zbuf *a)
+{
+ for(;;) {
+ int z = zhuffman_decode(a, &a->z_length);
+ if (z < 256) {
+ if (z < 0) return e("bad huffman code","Corrupt PNG"); // error in huffman codes
+ if (a->zout >= a->zout_end) if (!expand(a, 1)) return 0;
+ *a->zout++ = (char) z;
+ } else {
+ uint8 *p;
+ int len,dist;
+ if (z == 256) return 1;
+ z -= 257;
+ len = length_base[z];
+ if (length_extra[z]) len += zreceive(a, length_extra[z]);
+ z = zhuffman_decode(a, &a->z_distance);
+ if (z < 0) return e("bad huffman code","Corrupt PNG");
+ dist = dist_base[z];
+ if (dist_extra[z]) dist += zreceive(a, dist_extra[z]);
+ if (a->zout - a->zout_start < dist) return e("bad dist","Corrupt PNG");
+ if (a->zout + len > a->zout_end) if (!expand(a, len)) return 0;
+ p = (uint8 *) (a->zout - dist);
+ while (len--)
+ *a->zout++ = *p++;
+ }
+ }
+}
+
+static int compute_huffman_codes(zbuf *a)
+{
+ static uint8 length_dezigzag[19] = { 16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15 };
+ static zhuffman z_codelength; // static just to save stack space
+ uint8 lencodes[286+32+137];//padding for maximum single op
+ uint8 codelength_sizes[19];
+ int i,n;
+
+ int hlit = zreceive(a,5) + 257;
+ int hdist = zreceive(a,5) + 1;
+ int hclen = zreceive(a,4) + 4;
+
+ memset(codelength_sizes, 0, sizeof(codelength_sizes));
+ for (i=0; i < hclen; ++i) {
+ int s = zreceive(a,3);
+ codelength_sizes[length_dezigzag[i]] = (uint8) s;
+ }
+ if (!zbuild_huffman(&z_codelength, codelength_sizes, 19)) return 0;
+
+ n = 0;
+ while (n < hlit + hdist) {
+ int c = zhuffman_decode(a, &z_codelength);
+ assert(c >= 0 && c < 19);
+ if (c < 16)
+ lencodes[n++] = (uint8) c;
+ else if (c == 16) {
+ c = zreceive(a,2)+3;
+ memset(lencodes+n, lencodes[n-1], c);
+ n += c;
+ } else if (c == 17) {
+ c = zreceive(a,3)+3;
+ memset(lencodes+n, 0, c);
+ n += c;
+ } else {
+ assert(c == 18);
+ c = zreceive(a,7)+11;
+ memset(lencodes+n, 0, c);
+ n += c;
+ }
+ }
+ if (n != hlit+hdist) return e("bad codelengths","Corrupt PNG");
+ if (!zbuild_huffman(&a->z_length, lencodes, hlit)) return 0;
+ if (!zbuild_huffman(&a->z_distance, lencodes+hlit, hdist)) return 0;
+ return 1;
+}
+
+static int parse_uncompressed_block(zbuf *a)
+{
+ uint8 header[4];
+ int len,nlen,k;
+ if (a->num_bits & 7)
+ zreceive(a, a->num_bits & 7); // discard
+ // drain the bit-packed data into header
+ k = 0;
+ while (a->num_bits > 0) {
+ header[k++] = (uint8) (a->code_buffer & 255); // wtf this warns?
+ a->code_buffer >>= 8;
+ a->num_bits -= 8;
+ }
+ assert(a->num_bits == 0);
+ // now fill header the normal way
+ while (k < 4)
+ header[k++] = (uint8) zget8(a);
+ len = header[1] * 256 + header[0];
+ nlen = header[3] * 256 + header[2];
+ if (nlen != (len ^ 0xffff)) return e("zlib corrupt","Corrupt PNG");
+ if (a->zbuffer + len > a->zbuffer_end) return e("read past buffer","Corrupt PNG");
+ if (a->zout + len > a->zout_end)
+ if (!expand(a, len)) return 0;
+ memcpy(a->zout, a->zbuffer, len);
+ a->zbuffer += len;
+ a->zout += len;
+ return 1;
+}
+
+static int parse_zlib_header(zbuf *a)
+{
+ int cmf = zget8(a);
+ int cm = cmf & 15;
+ /* int cinfo = cmf >> 4; */
+ int flg = zget8(a);
+ if ((cmf*256+flg) % 31 != 0) return e("bad zlib header","Corrupt PNG"); // zlib spec
+ if (flg & 32) return e("no preset dict","Corrupt PNG"); // preset dictionary not allowed in png
+ if (cm != 8) return e("bad compression","Corrupt PNG"); // DEFLATE required for png
+ // window = 1 << (8 + cinfo)... but who cares, we fully buffer output
+ return 1;
+}
+
+// @TODO: should statically initialize these for optimal thread safety
+static uint8 default_length[288], default_distance[32];
+static void init_defaults(void)
+{
+ int i; // use <= to match clearly with spec
+ for (i=0; i <= 143; ++i) default_length[i] = 8;
+ for ( ; i <= 255; ++i) default_length[i] = 9;
+ for ( ; i <= 279; ++i) default_length[i] = 7;
+ for ( ; i <= 287; ++i) default_length[i] = 8;
+
+ for (i=0; i <= 31; ++i) default_distance[i] = 5;
+}
+
+static int parse_zlib(zbuf *a, int parse_header)
+{
+ int final, type;
+ if (parse_header)
+ if (!parse_zlib_header(a)) return 0;
+ a->num_bits = 0;
+ a->code_buffer = 0;
+ do {
+ final = zreceive(a,1);
+ type = zreceive(a,2);
+ if (type == 0) {
+ if (!parse_uncompressed_block(a)) return 0;
+ } else if (type == 3) {
+ return 0;
+ } else {
+ if (type == 1) {
+ // use fixed code lengths
+ if (!default_distance[31]) init_defaults();
+ if (!zbuild_huffman(&a->z_length , default_length , 288)) return 0;
+ if (!zbuild_huffman(&a->z_distance, default_distance, 32)) return 0;
+ } else {
+ if (!compute_huffman_codes(a)) return 0;
+ }
+ if (!parse_huffman_block(a)) return 0;
+ }
+ } while (!final);
+ return 1;
+}
+
+static int do_zlib(zbuf *a, char *obuf, int olen, int exp, int parse_header)
+{
+ a->zout_start = obuf;
+ a->zout = obuf;
+ a->zout_end = obuf + olen;
+ a->z_expandable = exp;
+
+ return parse_zlib(a, parse_header);
+}
+
+char *stbi_zlib_decode_malloc_guesssize(const char *buffer, int len, int initial_size, int *outlen)
+{
+ zbuf a;
+ char *p = (char *) malloc(initial_size);
+ if (p == NULL) return NULL;
+ a.zbuffer = (uint8 *) buffer;
+ a.zbuffer_end = (uint8 *) buffer + len;
+ if (do_zlib(&a, p, initial_size, 1, 1)) {
+ if (outlen) *outlen = (int) (a.zout - a.zout_start);
+ return a.zout_start;
+ } else {
+ free(a.zout_start);
+ return NULL;
+ }
+}
+
+char *stbi_zlib_decode_malloc(char const *buffer, int len, int *outlen)
+{
+ return stbi_zlib_decode_malloc_guesssize(buffer, len, 16384, outlen);
+}
+
+int stbi_zlib_decode_buffer(char *obuffer, int olen, char const *ibuffer, int ilen)
+{
+ zbuf a;
+ a.zbuffer = (uint8 *) ibuffer;
+ a.zbuffer_end = (uint8 *) ibuffer + ilen;
+ if (do_zlib(&a, obuffer, olen, 0, 1))
+ return (int) (a.zout - a.zout_start);
+ else
+ return -1;
+}
+
+char *stbi_zlib_decode_noheader_malloc(char const *buffer, int len, int *outlen)
+{
+ zbuf a;
+ char *p = (char *) malloc(16384);
+ if (p == NULL) return NULL;
+ a.zbuffer = (uint8 *) buffer;
+ a.zbuffer_end = (uint8 *) buffer+len;
+ if (do_zlib(&a, p, 16384, 1, 0)) {
+ if (outlen) *outlen = (int) (a.zout - a.zout_start);
+ return a.zout_start;
+ } else {
+ free(a.zout_start);
+ return NULL;
+ }
+}
+
+int stbi_zlib_decode_noheader_buffer(char *obuffer, int olen, const char *ibuffer, int ilen)
+{
+ zbuf a;
+ a.zbuffer = (uint8 *) ibuffer;
+ a.zbuffer_end = (uint8 *) ibuffer + ilen;
+ if (do_zlib(&a, obuffer, olen, 0, 0))
+ return (int) (a.zout - a.zout_start);
+ else
+ return -1;
+}
+
+// public domain "baseline" PNG decoder v0.10 Sean Barrett 2006-11-18
+// simple implementation
+// - only 8-bit samples
+// - no CRC checking
+// - allocates lots of intermediate memory
+// - avoids problem of streaming data between subsystems
+// - avoids explicit window management
+// performance
+// - uses stb_zlib, a PD zlib implementation with fast huffman decoding
+
+
+typedef struct
+{
+ uint32 length;
+ uint32 type;
+} chunk;
+
+#define PNG_TYPE(a,b,c,d) (((a) << 24) + ((b) << 16) + ((c) << 8) + (d))
+
+static chunk get_chunk_header(stbi *s)
+{
+ chunk c;
+ c.length = get32(s);
+ c.type = get32(s);
+ return c;
+}
+
+static int check_png_header(stbi *s)
+{
+ static uint8 png_sig[8] = { 137,80,78,71,13,10,26,10 };
+ int i;
+ for (i=0; i < 8; ++i)
+ if (get8(s) != png_sig[i]) return e("bad png sig","Not a PNG");
+ return 1;
+}
+
+typedef struct
+{
+ stbi s;
+ uint8 *idata, *expanded, *out;
+} png;
+
+
+enum {
+ F_none=0, F_sub=1, F_up=2, F_avg=3, F_paeth=4,
+ F_avg_first, F_paeth_first,
+};
+
+static uint8 first_row_filter[5] =
+{
+ F_none, F_sub, F_none, F_avg_first, F_paeth_first
+};
+
+static int paeth(int a, int b, int c)
+{
+ int p = a + b - c;
+ int pa = abs(p-a);
+ int pb = abs(p-b);
+ int pc = abs(p-c);
+ if (pa <= pb && pa <= pc) return a;
+ if (pb <= pc) return b;
+ return c;
+}
+
+// create the png data from post-deflated data
+static int create_png_image(png *a, uint8 *raw, uint32 raw_len, int out_n)
+{
+ stbi *s = &a->s;
+ uint32 i,j,stride = s->img_x*out_n;
+ int k;
+ int img_n = s->img_n; // copy it into a local for later
+ assert(out_n == s->img_n || out_n == s->img_n+1);
+ a->out = (uint8 *) malloc(s->img_x * s->img_y * out_n);
+ if (!a->out) return e("outofmem", "Out of memory");
+ if (raw_len != (img_n * s->img_x + 1) * s->img_y) return e("not enough pixels","Corrupt PNG");
+ for (j=0; j < s->img_y; ++j) {
+ uint8 *cur = a->out + stride*j;
+ uint8 *prior = cur - stride;
+ int filter = *raw++;
+ if (filter > 4) return e("invalid filter","Corrupt PNG");
+ // if first row, use special filter that doesn't sample previous row
+ if (j == 0) filter = first_row_filter[filter];
+ // handle first pixel explicitly
+ for (k=0; k < img_n; ++k) {
+ switch(filter) {
+ case F_none : cur[k] = raw[k]; break;
+ case F_sub : cur[k] = raw[k]; break;
+ case F_up : cur[k] = raw[k] + prior[k]; break;
+ case F_avg : cur[k] = raw[k] + (prior[k]>>1); break;
+ case F_paeth : cur[k] = (uint8) (raw[k] + paeth(0,prior[k],0)); break;
+ case F_avg_first : cur[k] = raw[k]; break;
+ case F_paeth_first: cur[k] = raw[k]; break;
+ }
+ }
+ if (img_n != out_n) cur[img_n] = 255;
+ raw += img_n;
+ cur += out_n;
+ prior += out_n;
+ // this is a little gross, so that we don't switch per-pixel or per-component
+ if (img_n == out_n) {
+#define CASE(f) \
+ case f: \
+ for (i=s->img_x-1; i >= 1; --i, raw+=img_n,cur+=img_n,prior+=img_n) \
+ for (k=0; k < img_n; ++k)
+ switch(filter) {
+ CASE(F_none) cur[k] = raw[k]; break;
+ CASE(F_sub) cur[k] = raw[k] + cur[k-img_n]; break;
+ CASE(F_up) cur[k] = raw[k] + prior[k]; break;
+ CASE(F_avg) cur[k] = raw[k] + ((prior[k] + cur[k-img_n])>>1); break;
+ CASE(F_paeth) cur[k] = (uint8) (raw[k] + paeth(cur[k-img_n],prior[k],prior[k-img_n])); break;
+ CASE(F_avg_first) cur[k] = raw[k] + (cur[k-img_n] >> 1); break;
+ CASE(F_paeth_first) cur[k] = (uint8) (raw[k] + paeth(cur[k-img_n],0,0)); break;
+ }
+#undef CASE
+ } else {
+ assert(img_n+1 == out_n);
+#define CASE(f) \
+ case f: \
+ for (i=s->img_x-1; i >= 1; --i, cur[img_n]=255,raw+=img_n,cur+=out_n,prior+=out_n) \
+ for (k=0; k < img_n; ++k)
+ switch(filter) {
+ CASE(F_none) cur[k] = raw[k]; break;
+ CASE(F_sub) cur[k] = raw[k] + cur[k-out_n]; break;
+ CASE(F_up) cur[k] = raw[k] + prior[k]; break;
+ CASE(F_avg) cur[k] = raw[k] + ((prior[k] + cur[k-out_n])>>1); break;
+ CASE(F_paeth) cur[k] = (uint8) (raw[k] + paeth(cur[k-out_n],prior[k],prior[k-out_n])); break;
+ CASE(F_avg_first) cur[k] = raw[k] + (cur[k-out_n] >> 1); break;
+ CASE(F_paeth_first) cur[k] = (uint8) (raw[k] + paeth(cur[k-out_n],0,0)); break;
+ }
+#undef CASE
+ }
+ }
+ return 1;
+}
+
+static int compute_transparency(png *z, uint8 tc[3], int out_n)
+{
+ stbi *s = &z->s;
+ uint32 i, pixel_count = s->img_x * s->img_y;
+ uint8 *p = z->out;
+
+ // compute color-based transparency, assuming we've
+ // already got 255 as the alpha value in the output
+ assert(out_n == 2 || out_n == 4);
+
+ if (out_n == 2) {
+ for (i=0; i < pixel_count; ++i) {
+ p[1] = (p[0] == tc[0] ? 0 : 255);
+ p += 2;
+ }
+ } else {
+ for (i=0; i < pixel_count; ++i) {
+ if (p[0] == tc[0] && p[1] == tc[1] && p[2] == tc[2])
+ p[3] = 0;
+ p += 4;
+ }
+ }
+ return 1;
+}
+
+static int expand_palette(png *a, uint8 *palette, int len, int pal_img_n)
+{
+ STB_UNUSED(len);
+ uint32 i, pixel_count = a->s.img_x * a->s.img_y;
+ uint8 *p, *temp_out, *orig = a->out;
+
+ p = (uint8 *) malloc(pixel_count * pal_img_n);
+ if (p == NULL) return e("outofmem", "Out of memory");
+
+ // between here and free(out) below, exitting would leak
+ temp_out = p;
+
+ if (pal_img_n == 3) {
+ for (i=0; i < pixel_count; ++i) {
+ int n = orig[i]*4;
+ p[0] = palette[n ];
+ p[1] = palette[n+1];
+ p[2] = palette[n+2];
+ p += 3;
+ }
+ } else {
+ for (i=0; i < pixel_count; ++i) {
+ int n = orig[i]*4;
+ p[0] = palette[n ];
+ p[1] = palette[n+1];
+ p[2] = palette[n+2];
+ p[3] = palette[n+3];
+ p += 4;
+ }
+ }
+ free(a->out);
+ a->out = temp_out;
+ return 1;
+}
+
+static int parse_png_file(png *z, int scan, int req_comp)
+{
+ uint8 palette[1024], pal_img_n=0;
+ uint8 has_trans=0, tc[3];
+ uint32 ioff=0, idata_limit=0, i, pal_len=0;
+ int first=1,k;
+ stbi *s = &z->s;
+
+ if (!check_png_header(s)) return 0;
+
+ if (scan == SCAN_type) return 1;
+
+ for(;;first=0) {
+ chunk c = get_chunk_header(s);
+ if (first && c.type != PNG_TYPE('I','H','D','R'))
+ return e("first not IHDR","Corrupt PNG");
+ switch (c.type) {
+ case PNG_TYPE('I','H','D','R'): {
+ int depth,color,interlace,comp,filter;
+ if (!first) return e("multiple IHDR","Corrupt PNG");
+ if (c.length != 13) return e("bad IHDR len","Corrupt PNG");
+ s->img_x = get32(s); if (s->img_x > (1 << 24)) return e("too large","Very large image (corrupt?)");
+ s->img_y = get32(s); if (s->img_y > (1 << 24)) return e("too large","Very large image (corrupt?)");
+ depth = get8(s); if (depth != 8) return e("8bit only","PNG not supported: 8-bit only");
+ color = get8(s); if (color > 6) return e("bad ctype","Corrupt PNG");
+ if (color == 3) pal_img_n = 3; else if (color & 1) return e("bad ctype","Corrupt PNG");
+ comp = get8(s); if (comp) return e("bad comp method","Corrupt PNG");
+ filter= get8(s); if (filter) return e("bad filter method","Corrupt PNG");
+ interlace = get8(s); if (interlace) return e("interlaced","PNG not supported: interlaced mode");
+ if (!s->img_x || !s->img_y) return e("0-pixel image","Corrupt PNG");
+ if (!pal_img_n) {
+ s->img_n = (color & 2 ? 3 : 1) + (color & 4 ? 1 : 0);
+ if ((1 << 30) / s->img_x / s->img_n < s->img_y) return e("too large", "Image too large to decode");
+ if (scan == SCAN_header) return 1;
+ } else {
+ // if paletted, then pal_n is our final components, and
+ // img_n is # components to decompress/filter.
+ s->img_n = 1;
+ if ((1 << 30) / s->img_x / 4 < s->img_y) return e("too large","Corrupt PNG");
+ // if SCAN_header, have to scan to see if we have a tRNS
+ }
+ break;
+ }
+
+ case PNG_TYPE('P','L','T','E'): {
+ if (c.length > 256*3) return e("invalid PLTE","Corrupt PNG");
+ pal_len = c.length / 3;
+ if (pal_len * 3 != c.length) return e("invalid PLTE","Corrupt PNG");
+ for (i=0; i < pal_len; ++i) {
+ palette[i*4+0] = get8u(s);
+ palette[i*4+1] = get8u(s);
+ palette[i*4+2] = get8u(s);
+ palette[i*4+3] = 255;
+ }
+ break;
+ }
+
+ case PNG_TYPE('t','R','N','S'): {
+ if (z->idata) return e("tRNS after IDAT","Corrupt PNG");
+ if (pal_img_n) {
+ if (scan == SCAN_header) { s->img_n = 4; return 1; }
+ if (pal_len == 0) return e("tRNS before PLTE","Corrupt PNG");
+ if (c.length > pal_len) return e("bad tRNS len","Corrupt PNG");
+ pal_img_n = 4;
+ for (i=0; i < c.length; ++i)
+ palette[i*4+3] = get8u(s);
+ } else {
+ if (!(s->img_n & 1)) return e("tRNS with alpha","Corrupt PNG");
+ if (c.length != (uint32) s->img_n*2) return e("bad tRNS len","Corrupt PNG");
+ has_trans = 1;
+ for (k=0; k < s->img_n; ++k)
+ tc[k] = (uint8) get16(s); // non 8-bit images will be larger
+ }
+ break;
+ }
+
+ case PNG_TYPE('I','D','A','T'): {
+ if (pal_img_n && !pal_len) return e("no PLTE","Corrupt PNG");
+ if (scan == SCAN_header) { s->img_n = pal_img_n; return 1; }
+ if (ioff + c.length > idata_limit) {
+ uint8 *p;
+ if (idata_limit == 0) idata_limit = c.length > 4096 ? c.length : 4096;
+ while (ioff + c.length > idata_limit)
+ idata_limit *= 2;
+ p = (uint8 *) realloc(z->idata, idata_limit); if (p == NULL) return e("outofmem", "Out of memory");
+ z->idata = p;
+ }
+#ifndef STBI_NO_STDIO
+ if (s->img_file)
+ {
+ if (fread(z->idata+ioff,1,c.length,s->img_file) != c.length) return e("outofdata","Corrupt PNG");
+ }
+ else
+#endif
+ {
+ memcpy(z->idata+ioff, s->img_buffer, c.length);
+ s->img_buffer += c.length;
+ }
+ ioff += c.length;
+ break;
+ }
+
+ case PNG_TYPE('I','E','N','D'): {
+ uint32 raw_len;
+ if (scan != SCAN_load) return 1;
+ if (z->idata == NULL) return e("no IDAT","Corrupt PNG");
+ z->expanded = (uint8 *) stbi_zlib_decode_malloc((char *) z->idata, ioff, (int *) &raw_len);
+ if (z->expanded == NULL) return 0; // zlib should set error
+ free(z->idata); z->idata = NULL;
+ if ((req_comp == s->img_n+1 && req_comp != 3 && !pal_img_n) || has_trans)
+ s->img_out_n = s->img_n+1;
+ else
+ s->img_out_n = s->img_n;
+ if (!create_png_image(z, z->expanded, raw_len, s->img_out_n)) return 0;
+ if (has_trans)
+ if (!compute_transparency(z, tc, s->img_out_n)) return 0;
+ if (pal_img_n) {
+ // pal_img_n == 3 or 4
+ s->img_n = pal_img_n; // record the actual colors we had
+ s->img_out_n = pal_img_n;
+ if (req_comp >= 3) s->img_out_n = req_comp;
+ if (!expand_palette(z, palette, pal_len, s->img_out_n))
+ return 0;
+ }
+ free(z->expanded); z->expanded = NULL;
+ return 1;
+ }
+
+ default:
+ // if critical, fail
+ if ((c.type & (1 << 29)) == 0) {
+#ifndef STBI_NO_FAILURE_STRINGS
+ // not threadsafe
+ static char invalid_chunk[] = "XXXX chunk not known";
+ invalid_chunk[0] = (uint8) (c.type >> 24);
+ invalid_chunk[1] = (uint8) (c.type >> 16);
+ invalid_chunk[2] = (uint8) (c.type >> 8);
+ invalid_chunk[3] = (uint8) (c.type >> 0);
+#endif
+ return e(invalid_chunk, "PNG not supported: unknown chunk type");
+ }
+ skip(s, c.length);
+ break;
+ }
+ // end of chunk, read and skip CRC
+ get32(s);
+ }
+}
+
+static unsigned char *do_png(png *p, int *x, int *y, int *n, int req_comp)
+{
+ unsigned char *result=NULL;
+ p->expanded = NULL;
+ p->idata = NULL;
+ p->out = NULL;
+ if (req_comp < 0 || req_comp > 4) return epuc("bad req_comp", "Internal error");
+ if (parse_png_file(p, SCAN_load, req_comp)) {
+ result = p->out;
+ p->out = NULL;
+ if (req_comp && req_comp != p->s.img_out_n) {
+ result = convert_format(result, p->s.img_out_n, req_comp, p->s.img_x, p->s.img_y);
+ p->s.img_out_n = req_comp;
+ if (result == NULL) return result;
+ }
+ *x = p->s.img_x;
+ *y = p->s.img_y;
+ if (n) *n = p->s.img_n;
+ }
+ free(p->out); p->out = NULL;
+ free(p->expanded); p->expanded = NULL;
+ free(p->idata); p->idata = NULL;
+
+ return result;
+}
+
+#ifndef STBI_NO_STDIO
+unsigned char *stbi_png_load_from_file(FILE *f, int *x, int *y, int *comp, int req_comp)
+{
+ png p;
+ start_file(&p.s, f);
+ return do_png(&p, x,y,comp,req_comp);
+}
+
+unsigned char *stbi_png_load(char const *filename, int *x, int *y, int *comp, int req_comp)
+{
+ unsigned char *data;
+ FILE *f = fopen(filename, "rb");
+ if (!f) return NULL;
+ data = stbi_png_load_from_file(f,x,y,comp,req_comp);
+ fclose(f);
+ return data;
+}
+#endif
+
+unsigned char *stbi_png_load_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp)
+{
+ png p;
+ start_mem(&p.s, buffer,len);
+ return do_png(&p, x,y,comp,req_comp);
+}
+
+#ifndef STBI_NO_STDIO
+int stbi_png_test_file(FILE *f)
+{
+ png p;
+ int n,r;
+ n = ftell(f);
+ start_file(&p.s, f);
+ r = parse_png_file(&p, SCAN_type,STBI_default);
+ fseek(f,n,SEEK_SET);
+ return r;
+}
+#endif
+
+int stbi_png_test_memory(stbi_uc const *buffer, int len)
+{
+ png p;
+ start_mem(&p.s, buffer, len);
+ return parse_png_file(&p, SCAN_type,STBI_default);
+}
+
+// TODO: load header from png
+#ifndef STBI_NO_STDIO
+extern int stbi_png_info (char const *filename, int *x, int *y, int *comp);
+extern int stbi_png_info_from_file (FILE *f, int *x, int *y, int *comp);
+#endif
+extern int stbi_png_info_from_memory (stbi_uc const *buffer, int len, int *x, int *y, int *comp);
+
+// Microsoft/Windows BMP image
+
+static int bmp_test(stbi *s)
+{
+ int sz;
+ if (get8(s) != 'B') return 0;
+ if (get8(s) != 'M') return 0;
+ get32le(s); // discard filesize
+ get16le(s); // discard reserved
+ get16le(s); // discard reserved
+ get32le(s); // discard data offset
+ sz = get32le(s);
+ if (sz == 12 || sz == 40 || sz == 56 || sz == 108) return 1;
+ return 0;
+}
+
+#ifndef STBI_NO_STDIO
+int stbi_bmp_test_file (FILE *f)
+{
+ stbi s;
+ int r,n = ftell(f);
+ start_file(&s,f);
+ r = bmp_test(&s);
+ fseek(f,n,SEEK_SET);
+ return r;
+}
+#endif
+
+int stbi_bmp_test_memory (stbi_uc const *buffer, int len)
+{
+ stbi s;
+ start_mem(&s, buffer, len);
+ return bmp_test(&s);
+}
+
+// returns 0..31 for the highest set bit
+static int high_bit(unsigned int z)
+{
+ int n=0;
+ if (z == 0) return -1;
+ if (z >= 0x10000) n += 16, z >>= 16;
+ if (z >= 0x00100) n += 8, z >>= 8;
+ if (z >= 0x00010) n += 4, z >>= 4;
+ if (z >= 0x00004) n += 2, z >>= 2;
+ if (z >= 0x00002) n += 1, z >>= 1;
+ return n;
+}
+
+static int bitcount(unsigned int a)
+{
+ a = (a & 0x55555555) + ((a >> 1) & 0x55555555); // max 2
+ a = (a & 0x33333333) + ((a >> 2) & 0x33333333); // max 4
+ a = (a + (a >> 4)) & 0x0f0f0f0f; // max 8 per 4, now 8 bits
+ a = (a + (a >> 8)); // max 16 per 8 bits
+ a = (a + (a >> 16)); // max 32 per 8 bits
+ return a & 0xff;
+}
+
+static int shiftsigned(int v, int shift, int bits)
+{
+ int result;
+ int z=0;
+
+ if (shift < 0) v <<= -shift;
+ else v >>= shift;
+ result = v;
+
+ z = bits;
+ while (z < 8) {
+ result += v >> z;
+ z += bits;
+ }
+ return result;
+}
+
+static stbi_uc *bmp_load(stbi *s, int *x, int *y, int *comp, int req_comp)
+{
+ uint8 *out;
+ unsigned int mr=0,mg=0,mb=0,ma=0;
+ stbi_uc pal[256][4];
+ int psize=0,i,j,compress=0,width;
+ int bpp, flip_vertically, pad, target, offset, hsz;
+ if (get8(s) != 'B' || get8(s) != 'M') return epuc("not BMP", "Corrupt BMP");
+ get32le(s); // discard filesize
+ get16le(s); // discard reserved
+ get16le(s); // discard reserved
+ offset = get32le(s);
+ hsz = get32le(s);
+ if (hsz != 12 && hsz != 40 && hsz != 56 && hsz != 108) return epuc("unknown BMP", "BMP type not supported: unknown");
+ failure_reason = "bad BMP";
+ if (hsz == 12) {
+ s->img_x = get16le(s);
+ s->img_y = get16le(s);
+ } else {
+ s->img_x = get32le(s);
+ s->img_y = get32le(s);
+ }
+ if (get16le(s) != 1) return 0;
+ bpp = get16le(s);
+ if (bpp == 1) return epuc("monochrome", "BMP type not supported: 1-bit");
+ flip_vertically = ((int) s->img_y) > 0;
+ s->img_y = abs((int) s->img_y);
+ if (hsz == 12) {
+ if (bpp < 24)
+ psize = (offset - 14 - 24) / 3;
+ } else {
+ compress = get32le(s);
+ if (compress == 1 || compress == 2) return epuc("BMP RLE", "BMP type not supported: RLE");
+ get32le(s); // discard sizeof
+ get32le(s); // discard hres
+ get32le(s); // discard vres
+ get32le(s); // discard colorsused
+ get32le(s); // discard max important
+ if (hsz == 40 || hsz == 56) {
+ if (hsz == 56) {
+ get32le(s);
+ get32le(s);
+ get32le(s);
+ get32le(s);
+ }
+ if (bpp == 16 || bpp == 32) {
+ mr = mg = mb = 0;
+ if (compress == 0) {
+ if (bpp == 32) {
+ mr = 0xff << 16;
+ mg = 0xff << 8;
+ mb = 0xff << 0;
+ } else {
+ mr = 31 << 10;
+ mg = 31 << 5;
+ mb = 31 << 0;
+ }
+ } else if (compress == 3) {
+ mr = get32le(s);
+ mg = get32le(s);
+ mb = get32le(s);
+ // not documented, but generated by photoshop and handled by mspaint
+ if (mr == mg && mg == mb) {
+ // ?!?!?
+ return NULL;
+ }
+ } else
+ return NULL;
+ }
+ } else {
+ assert(hsz == 108);
+ mr = get32le(s);
+ mg = get32le(s);
+ mb = get32le(s);
+ ma = get32le(s);
+ get32le(s); // discard color space
+ for (i=0; i < 12; ++i)
+ get32le(s); // discard color space parameters
+ }
+ if (bpp < 16)
+ psize = (offset - 14 - hsz) >> 2;
+ }
+ s->img_n = ma ? 4 : 3;
+ if (req_comp && req_comp >= 3) // we can directly decode 3 or 4
+ target = req_comp;
+ else
+ target = s->img_n; // if they want monochrome, we'll post-convert
+ out = (stbi_uc *) malloc(target * s->img_x * s->img_y);
+ if (!out) return epuc("outofmem", "Out of memory");
+ if (bpp < 16) {
+ int z=0;
+ if (psize == 0 || psize > 256) { free(out); return epuc("invalid", "Corrupt BMP"); }
+ for (i=0; i < psize; ++i) {
+ pal[i][2] = get8(s);
+ pal[i][1] = get8(s);
+ pal[i][0] = get8(s);
+ if (hsz != 12) get8(s);
+ pal[i][3] = 255;
+ }
+ skip(s, offset - 14 - hsz - psize * (hsz == 12 ? 3 : 4));
+ if (bpp == 4) width = (s->img_x + 1) >> 1;
+ else if (bpp == 8) width = s->img_x;
+ else { free(out); return epuc("bad bpp", "Corrupt BMP"); }
+ pad = (-width)&3;
+ for (j=0; j < (int) s->img_y; ++j) {
+ for (i=0; i < (int) s->img_x; i += 2) {
+ int v=get8(s),v2=0;
+ if (bpp == 4) {
+ v2 = v & 15;
+ v >>= 4;
+ }
+ out[z++] = pal[v][0];
+ out[z++] = pal[v][1];
+ out[z++] = pal[v][2];
+ if (target == 4) out[z++] = 255;
+ if (i+1 == (int) s->img_x) break;
+ v = (bpp == 8) ? get8(s) : v2;
+ out[z++] = pal[v][0];
+ out[z++] = pal[v][1];
+ out[z++] = pal[v][2];
+ if (target == 4) out[z++] = 255;
+ }
+ skip(s, pad);
+ }
+ } else {
+ int rshift=0,gshift=0,bshift=0,ashift=0,rcount=0,gcount=0,bcount=0,acount=0;
+ int z = 0;
+ int easy=0;
+ skip(s, offset - 14 - hsz);
+ if (bpp == 24) width = 3 * s->img_x;
+ else if (bpp == 16) width = 2*s->img_x;
+ else /* bpp = 32 and pad = 0 */ width=0;
+ pad = (-width) & 3;
+ if (bpp == 24) {
+ easy = 1;
+ } else if (bpp == 32) {
+ if (mb == 0xff && mg == 0xff00 && mr == 0xff000000 && ma == 0xff000000)
+ easy = 2;
+ }
+ if (!easy) {
+ if (!mr || !mg || !mb) return epuc("bad masks", "Corrupt BMP");
+ // right shift amt to put high bit in position #7
+ rshift = high_bit(mr)-7; rcount = bitcount(mr);
+ gshift = high_bit(mg)-7; gcount = bitcount(mr);
+ bshift = high_bit(mb)-7; bcount = bitcount(mr);
+ ashift = high_bit(ma)-7; acount = bitcount(mr);
+ }
+ for (j=0; j < (int) s->img_y; ++j) {
+ if (easy) {
+ for (i=0; i < (int) s->img_x; ++i) {
+ int a;
+ out[z+2] = get8(s);
+ out[z+1] = get8(s);
+ out[z+0] = get8(s);
+ z += 3;
+ a = (easy == 2 ? get8(s) : 255);
+ if (target == 4) out[z++] = a;
+ }
+ } else {
+ for (i=0; i < (int) s->img_x; ++i) {
+ uint32 v = (bpp == 16 ? get16le(s) : get32le(s));
+ int a;
+ out[z++] = shiftsigned(v & mr, rshift, rcount);
+ out[z++] = shiftsigned(v & mg, gshift, gcount);
+ out[z++] = shiftsigned(v & mb, bshift, bcount);
+ a = (ma ? shiftsigned(v & ma, ashift, acount) : 255);
+ if (target == 4) out[z++] = a;
+ }
+ }
+ skip(s, pad);
+ }
+ }
+ if (flip_vertically) {
+ stbi_uc t;
+ for (j=0; j < (int) s->img_y>>1; ++j) {
+ stbi_uc *p1 = out + j *s->img_x*target;
+ stbi_uc *p2 = out + (s->img_y-1-j)*s->img_x*target;
+ for (i=0; i < (int) s->img_x*target; ++i) {
+ t = p1[i], p1[i] = p2[i], p2[i] = t;
+ }
+ }
+ }
+
+ if (req_comp && req_comp != target) {
+ out = convert_format(out, target, req_comp, s->img_x, s->img_y);
+ if (out == NULL) return out; // convert_format frees input on failure
+ }
+
+ *x = s->img_x;
+ *y = s->img_y;
+ if (comp) *comp = target;
+ return out;
+}
+
+#ifndef STBI_NO_STDIO
+stbi_uc *stbi_bmp_load (char const *filename, int *x, int *y, int *comp, int req_comp)
+{
+ stbi_uc *data;
+ FILE *f = fopen(filename, "rb");
+ if (!f) return NULL;
+ data = stbi_bmp_load_from_file(f, x,y,comp,req_comp);
+ fclose(f);
+ return data;
+}
+
+stbi_uc *stbi_bmp_load_from_file (FILE *f, int *x, int *y, int *comp, int req_comp)
+{
+ stbi s;
+ start_file(&s, f);
+ return bmp_load(&s, x,y,comp,req_comp);
+}
+#endif
+
+stbi_uc *stbi_bmp_load_from_memory (stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp)
+{
+ stbi s;
+ start_mem(&s, buffer, len);
+ return bmp_load(&s, x,y,comp,req_comp);
+}
+
+// Targa Truevision - TGA
+// by Jonathan Dummer
+
+static int tga_test(stbi *s)
+{
+ int sz;
+ get8u(s); // discard Offset
+ sz = get8u(s); // color type
+ if( sz > 1 ) return 0; // only RGB or indexed allowed
+ sz = get8u(s); // image type
+ if( (sz != 1) && (sz != 2) && (sz != 3) && (sz != 9) && (sz != 10) && (sz != 11) ) return 0; // only RGB or grey allowed, +/- RLE
+ get16(s); // discard palette start
+ get16(s); // discard palette length
+ get8(s); // discard bits per palette color entry
+ get16(s); // discard x origin
+ get16(s); // discard y origin
+ if( get16(s) < 1 ) return 0; // test width
+ if( get16(s) < 1 ) return 0; // test height
+ sz = get8(s); // bits per pixel
+ if( (sz != 8) && (sz != 16) && (sz != 24) && (sz != 32) ) return 0; // only RGB or RGBA or grey allowed
+ return 1; // seems to have passed everything
+}
+
+#ifndef STBI_NO_STDIO
+int stbi_tga_test_file (FILE *f)
+{
+ stbi s;
+ int r,n = ftell(f);
+ start_file(&s, f);
+ r = tga_test(&s);
+ fseek(f,n,SEEK_SET);
+ return r;
+}
+#endif
+
+int stbi_tga_test_memory (stbi_uc const *buffer, int len)
+{
+ stbi s;
+ start_mem(&s, buffer, len);
+ return tga_test(&s);
+}
+
+static stbi_uc *tga_load(stbi *s, int *x, int *y, int *comp, int req_comp)
+{
+ // read in the TGA header stuff
+ int tga_offset = get8u(s);
+ int tga_indexed = get8u(s);
+ int tga_image_type = get8u(s);
+ int tga_is_RLE = 0;
+ int tga_palette_start = get16le(s);
+ int tga_palette_len = get16le(s);
+ int tga_palette_bits = get8u(s);
+ int tga_x_origin = get16le(s);
+ int tga_y_origin = get16le(s);
+ int tga_width = get16le(s);
+ int tga_height = get16le(s);
+ int tga_bits_per_pixel = get8u(s);
+ int tga_inverted = get8u(s);
+ // image data
+ unsigned char *tga_data;
+ unsigned char *tga_palette = NULL;
+ int i, j;
+ unsigned char raw_data[4];
+ unsigned char trans_data[4];
+ int RLE_count = 0;
+ int RLE_repeating = 0;
+ int read_next_pixel = 1;
+ // do a tiny bit of precessing
+ if( tga_image_type >= 8 )
+ {
+ tga_image_type -= 8;
+ tga_is_RLE = 1;
+ }
+ /* int tga_alpha_bits = tga_inverted & 15; */
+ tga_inverted = 1 - ((tga_inverted >> 5) & 1);
+
+ // error check
+ if( //(tga_indexed) ||
+ (tga_width < 1) || (tga_height < 1) ||
+ (tga_image_type < 1) || (tga_image_type > 3) ||
+ ((tga_bits_per_pixel != 8) && (tga_bits_per_pixel != 16) &&
+ (tga_bits_per_pixel != 24) && (tga_bits_per_pixel != 32))
+ )
+ {
+ return NULL;
+ }
+
+ // If I'm paletted, then I'll use the number of bits from the palette
+ if( tga_indexed )
+ {
+ tga_bits_per_pixel = tga_palette_bits;
+ }
+
+ // tga info
+ *x = tga_width;
+ *y = tga_height;
+ if( (req_comp < 1) || (req_comp > 4) )
+ {
+ // just use whatever the file was
+ req_comp = tga_bits_per_pixel / 8;
+ *comp = req_comp;
+ } else
+ {
+ // force a new number of components
+ *comp = tga_bits_per_pixel/8;
+ }
+ tga_data = (unsigned char*)malloc( tga_width * tga_height * req_comp );
+
+ // skip to the data's starting position (offset usually = 0)
+ skip(s, tga_offset );
+ // do I need to load a palette?
+ if( tga_indexed )
+ {
+ // any data to skip? (offset usually = 0)
+ skip(s, tga_palette_start );
+ // load the palette
+ tga_palette = (unsigned char*)malloc( tga_palette_len * tga_palette_bits / 8 );
+ getn(s, tga_palette, tga_palette_len * tga_palette_bits / 8 );
+ }
+ // load the data
+ for( i = 0; i < tga_width * tga_height; ++i )
+ {
+ // if I'm in RLE mode, do I need to get a RLE chunk?
+ if( tga_is_RLE )
+ {
+ if( RLE_count == 0 )
+ {
+ // yep, get the next byte as a RLE command
+ int RLE_cmd = get8u(s);
+ RLE_count = 1 + (RLE_cmd & 127);
+ RLE_repeating = RLE_cmd >> 7;
+ read_next_pixel = 1;
+ } else if( !RLE_repeating )
+ {
+ read_next_pixel = 1;
+ }
+ } else
+ {
+ read_next_pixel = 1;
+ }
+ // OK, if I need to read a pixel, do it now
+ if( read_next_pixel )
+ {
+ // load however much data we did have
+ if( tga_indexed )
+ {
+ // read in 1 byte, then perform the lookup
+ int pal_idx = get8u(s);
+ if( pal_idx >= tga_palette_len )
+ {
+ // invalid index
+ pal_idx = 0;
+ }
+ pal_idx *= tga_bits_per_pixel / 8;
+ for( j = 0; j*8 < tga_bits_per_pixel; ++j )
+ {
+ raw_data[j] = tga_palette[pal_idx+j];
+ }
+ } else
+ {
+ // read in the data raw
+ for( j = 0; j*8 < tga_bits_per_pixel; ++j )
+ {
+ raw_data[j] = get8u(s);
+ }
+ }
+ // convert raw to the intermediate format
+ switch( tga_bits_per_pixel )
+ {
+ case 8:
+ // Luminous => RGBA
+ trans_data[0] = raw_data[0];
+ trans_data[1] = raw_data[0];
+ trans_data[2] = raw_data[0];
+ trans_data[3] = 255;
+ break;
+ case 16:
+ // Luminous,Alpha => RGBA
+ trans_data[0] = raw_data[0];
+ trans_data[1] = raw_data[0];
+ trans_data[2] = raw_data[0];
+ trans_data[3] = raw_data[1];
+ break;
+ case 24:
+ // BGR => RGBA
+ trans_data[0] = raw_data[2];
+ trans_data[1] = raw_data[1];
+ trans_data[2] = raw_data[0];
+ trans_data[3] = 255;
+ break;
+ case 32:
+ // BGRA => RGBA
+ trans_data[0] = raw_data[2];
+ trans_data[1] = raw_data[1];
+ trans_data[2] = raw_data[0];
+ trans_data[3] = raw_data[3];
+ break;
+ }
+ // clear the reading flag for the next pixel
+ read_next_pixel = 0;
+ } // end of reading a pixel
+ // convert to final format
+ switch( req_comp )
+ {
+ case 1:
+ // RGBA => Luminance
+ tga_data[i*req_comp+0] = compute_y(trans_data[0],trans_data[1],trans_data[2]);
+ break;
+ case 2:
+ // RGBA => Luminance,Alpha
+ tga_data[i*req_comp+0] = compute_y(trans_data[0],trans_data[1],trans_data[2]);
+ tga_data[i*req_comp+1] = trans_data[3];
+ break;
+ case 3:
+ // RGBA => RGB
+ tga_data[i*req_comp+0] = trans_data[0];
+ tga_data[i*req_comp+1] = trans_data[1];
+ tga_data[i*req_comp+2] = trans_data[2];
+ break;
+ case 4:
+ // RGBA => RGBA
+ tga_data[i*req_comp+0] = trans_data[0];
+ tga_data[i*req_comp+1] = trans_data[1];
+ tga_data[i*req_comp+2] = trans_data[2];
+ tga_data[i*req_comp+3] = trans_data[3];
+ break;
+ }
+ // in case we're in RLE mode, keep counting down
+ --RLE_count;
+ }
+ // do I need to invert the image?
+ if( tga_inverted )
+ {
+ for( j = 0; j*2 < tga_height; ++j )
+ {
+ int index1 = j * tga_width * req_comp;
+ int index2 = (tga_height - 1 - j) * tga_width * req_comp;
+ for( i = tga_width * req_comp; i > 0; --i )
+ {
+ unsigned char temp = tga_data[index1];
+ tga_data[index1] = tga_data[index2];
+ tga_data[index2] = temp;
+ ++index1;
+ ++index2;
+ }
+ }
+ }
+ // clear my palette, if I had one
+ if( tga_palette != NULL )
+ {
+ free( tga_palette );
+ }
+ // the things I do to get rid of an error message, and yet keep
+ // Microsoft's C compilers happy... [8^(
+ tga_palette_start = tga_palette_len = tga_palette_bits =
+ tga_x_origin = tga_y_origin = 0;
+ // OK, done
+ return tga_data;
+}
+
+#ifndef STBI_NO_STDIO
+stbi_uc *stbi_tga_load (char const *filename, int *x, int *y, int *comp, int req_comp)
+{
+ stbi_uc *data;
+ FILE *f = fopen(filename, "rb");
+ if (!f) return NULL;
+ data = stbi_tga_load_from_file(f, x,y,comp,req_comp);
+ fclose(f);
+ return data;
+}
+
+stbi_uc *stbi_tga_load_from_file (FILE *f, int *x, int *y, int *comp, int req_comp)
+{
+ stbi s;
+ start_file(&s, f);
+ return tga_load(&s, x,y,comp,req_comp);
+}
+#endif
+
+stbi_uc *stbi_tga_load_from_memory (stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp)
+{
+ stbi s;
+ start_mem(&s, buffer, len);
+ return tga_load(&s, x,y,comp,req_comp);
+}
+
+
+// *************************************************************************************************
+// Photoshop PSD loader -- PD by Thatcher Ulrich, integration by Nicholas Schulz, tweaked by STB
+
+static int psd_test(stbi *s)
+{
+ if (get32(s) != 0x38425053) return 0; // "8BPS"
+ else return 1;
+}
+
+#ifndef STBI_NO_STDIO
+int stbi_psd_test_file(FILE *f)
+{
+ stbi s;
+ int r,n = ftell(f);
+ start_file(&s, f);
+ r = psd_test(&s);
+ fseek(f,n,SEEK_SET);
+ return r;
+}
+#endif
+
+int stbi_psd_test_memory(stbi_uc const *buffer, int len)
+{
+ stbi s;
+ start_mem(&s, buffer, len);
+ return psd_test(&s);
+}
+
+static stbi_uc *psd_load(stbi *s, int *x, int *y, int *comp, int req_comp)
+{
+ int pixelCount;
+ int channelCount, compression;
+ int channel, i, count, len;
+ int w,h;
+ uint8 *out;
+
+ // Check identifier
+ if (get32(s) != 0x38425053) // "8BPS"
+ return epuc("not PSD", "Corrupt PSD image");
+
+ // Check file type version.
+ if (get16(s) != 1)
+ return epuc("wrong version", "Unsupported version of PSD image");
+
+ // Skip 6 reserved bytes.
+ skip(s, 6 );
+
+ // Read the number of channels (R, G, B, A, etc).
+ channelCount = get16(s);
+ if (channelCount < 0 || channelCount > 16)
+ return epuc("wrong channel count", "Unsupported number of channels in PSD image");
+
+ // Read the rows and columns of the image.
+ h = get32(s);
+ w = get32(s);
+
+ // Make sure the depth is 8 bits.
+ if (get16(s) != 8)
+ return epuc("unsupported bit depth", "PSD bit depth is not 8 bit");
+
+ // Make sure the color mode is RGB.
+ // Valid options are:
+ // 0: Bitmap
+ // 1: Grayscale
+ // 2: Indexed color
+ // 3: RGB color
+ // 4: CMYK color
+ // 7: Multichannel
+ // 8: Duotone
+ // 9: Lab color
+ if (get16(s) != 3)
+ return epuc("wrong color format", "PSD is not in RGB color format");
+
+ // Skip the Mode Data. (It's the palette for indexed color; other info for other modes.)
+ skip(s,get32(s) );
+
+ // Skip the image resources. (resolution, pen tool paths, etc)
+ skip(s, get32(s) );
+
+ // Skip the reserved data.
+ skip(s, get32(s) );
+
+ // Find out if the data is compressed.
+ // Known values:
+ // 0: no compression
+ // 1: RLE compressed
+ compression = get16(s);
+ if (compression > 1)
+ return epuc("bad compression", "PSD has an unknown compression format");
+
+ // Create the destination image.
+ out = (stbi_uc *) malloc(4 * w*h);
+ if (!out) return epuc("outofmem", "Out of memory");
+ pixelCount = w*h;
+
+ // Initialize the data to zero.
+ //memset( out, 0, pixelCount * 4 );
+
+ // Finally, the image data.
+ if (compression) {
+ // RLE as used by .PSD and .TIFF
+ // Loop until you get the number of unpacked bytes you are expecting:
+ // Read the next source byte into n.
+ // If n is between 0 and 127 inclusive, copy the next n+1 bytes literally.
+ // Else if n is between -127 and -1 inclusive, copy the next byte -n+1 times.
+ // Else if n is 128, noop.
+ // Endloop
+
+ // The RLE-compressed data is preceeded by a 2-byte data count for each row in the data,
+ // which we're going to just skip.
+ skip(s, h * channelCount * 2 );
+
+ // Read the RLE data by channel.
+ for (channel = 0; channel < 4; channel++) {
+ uint8 *p;
+
+ p = out+channel;
+ if (channel >= channelCount) {
+ // Fill this channel with default data.
+ for (i = 0; i < pixelCount; i++) *p = (channel == 3 ? 255 : 0), p += 4;
+ } else {
+ // Read the RLE data.
+ count = 0;
+ while (count < pixelCount) {
+ len = get8(s);
+ if (len == 128) {
+ // No-op.
+ } else if (len < 128) {
+ // Copy next len+1 bytes literally.
+ len++;
+ count += len;
+ while (len) {
+ *p = get8(s);
+ p += 4;
+ len--;
+ }
+ } else if (len > 128) {
+ uint32 val;
+ // Next -len+1 bytes in the dest are replicated from next source byte.
+ // (Interpret len as a negative 8-bit int.)
+ len ^= 0x0FF;
+ len += 2;
+ val = get8(s);
+ count += len;
+ while (len) {
+ *p = val;
+ p += 4;
+ len--;
+ }
+ }
+ }
+ }
+ }
+
+ } else {
+ // We're at the raw image data. It's each channel in order (Red, Green, Blue, Alpha, ...)
+ // where each channel consists of an 8-bit value for each pixel in the image.
+
+ // Read the data by channel.
+ for (channel = 0; channel < 4; channel++) {
+ uint8 *p;
+
+ p = out + channel;
+ if (channel > channelCount) {
+ // Fill this channel with default data.
+ for (i = 0; i < pixelCount; i++) *p = channel == 3 ? 255 : 0, p += 4;
+ } else {
+ // Read the data.
+ count = 0;
+ for (i = 0; i < pixelCount; i++)
+ *p = get8(s), p += 4;
+ }
+ }
+ }
+
+ if (req_comp && req_comp != 4) {
+ out = convert_format(out, 4, req_comp, w, h);
+ if (out == NULL) return out; // convert_format frees input on failure
+ }
+
+ if (comp) *comp = channelCount;
+ *y = h;
+ *x = w;
+
+ return out;
+}
+
+#ifndef STBI_NO_STDIO
+stbi_uc *stbi_psd_load(char const *filename, int *x, int *y, int *comp, int req_comp)
+{
+ stbi_uc *data;
+ FILE *f = fopen(filename, "rb");
+ if (!f) return NULL;
+ data = stbi_psd_load_from_file(f, x,y,comp,req_comp);
+ fclose(f);
+ return data;
+}
+
+stbi_uc *stbi_psd_load_from_file(FILE *f, int *x, int *y, int *comp, int req_comp)
+{
+ stbi s;
+ start_file(&s, f);
+ return psd_load(&s, x,y,comp,req_comp);
+}
+#endif
+
+stbi_uc *stbi_psd_load_from_memory (stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp)
+{
+ stbi s;
+ start_mem(&s, buffer, len);
+ return psd_load(&s, x,y,comp,req_comp);
+}
+
+
+// *************************************************************************************************
+// Radiance RGBE HDR loader
+// originally by Nicolas Schulz
+#ifndef STBI_NO_HDR
+static int hdr_test(stbi *s)
+{
+ char *signature = "#?RADIANCE\n";
+ int i;
+ for (i=0; signature[i]; ++i)
+ if (get8(s) != signature[i])
+ return 0;
+ return 1;
+}
+
+int stbi_hdr_test_memory(stbi_uc const *buffer, int len)
+{
+ stbi s;
+ start_mem(&s, buffer, len);
+ return hdr_test(&s);
+}
+
+#ifndef STBI_NO_STDIO
+int stbi_hdr_test_file(FILE *f)
+{
+ stbi s;
+ int r,n = ftell(f);
+ start_file(&s, f);
+ r = hdr_test(&s);
+ fseek(f,n,SEEK_SET);
+ return r;
+}
+#endif
+
+#define HDR_BUFLEN 1024
+static char *hdr_gettoken(stbi *z, char *buffer)
+{
+ int len=0;
+ char c = '\0';
+
+ c = get8(z);
+
+ while (!at_eof(z) && c != '\n') {
+ buffer[len++] = c;
+ if (len == HDR_BUFLEN-1) {
+ // flush to end of line
+ while (!at_eof(z) && get8(z) != '\n')
+ ;
+ break;
+ }
+ c = get8(z);
+ }
+
+ buffer[len] = 0;
+ return buffer;
+}
+
+static void hdr_convert(float *output, stbi_uc *input, int req_comp)
+{
+ if( input[3] != 0 ) {
+ float f1;
+ // Exponent
+ f1 = (float) ldexp(1.0f, input[3] - (int)(128 + 8));
+ if (req_comp <= 2)
+ output[0] = (input[0] + input[1] + input[2]) * f1 / 3;
+ else {
+ output[0] = input[0] * f1;
+ output[1] = input[1] * f1;
+ output[2] = input[2] * f1;
+ }
+ if (req_comp == 2) output[1] = 1;
+ if (req_comp == 4) output[3] = 1;
+ } else {
+ switch (req_comp) {
+ case 4: output[3] = 1; /* fallthrough */
+ case 3: output[0] = output[1] = output[2] = 0;
+ break;
+ case 2: output[1] = 1; /* fallthrough */
+ case 1: output[0] = 0;
+ break;
+ }
+ }
+}
+
+
+static float *hdr_load(stbi *s, int *x, int *y, int *comp, int req_comp)
+{
+ char buffer[HDR_BUFLEN];
+ char *token;
+ int valid = 0;
+ int width, height;
+ stbi_uc *scanline;
+ float *hdr_data;
+ int len;
+ unsigned char count, value;
+ int i, j, k, c1,c2, z;
+
+
+ // Check identifier
+ if (strcmp(hdr_gettoken(s,buffer), "#?RADIANCE") != 0)
+ return epf("not HDR", "Corrupt HDR image");
+
+ // Parse header
+ while(1) {
+ token = hdr_gettoken(s,buffer);
+ if (token[0] == 0) break;
+ if (strcmp(token, "FORMAT=32-bit_rle_rgbe") == 0) valid = 1;
+ }
+
+ if (!valid) return epf("unsupported format", "Unsupported HDR format");
+
+ // Parse width and height
+ // can't use sscanf() if we're not using stdio!
+ token = hdr_gettoken(s,buffer);
+ if (strncmp(token, "-Y ", 3)) return epf("unsupported data layout", "Unsupported HDR format");
+ token += 3;
+ height = strtol(token, &token, 10);
+ while (*token == ' ') ++token;
+ if (strncmp(token, "+X ", 3)) return epf("unsupported data layout", "Unsupported HDR format");
+ token += 3;
+ width = strtol(token, NULL, 10);
+
+ *x = width;
+ *y = height;
+
+ *comp = 3;
+ if (req_comp == 0) req_comp = 3;
+
+ // Read data
+ hdr_data = (float *) malloc(height * width * req_comp * sizeof(float));
+
+ // Load image data
+ // image data is stored as some number of sca
+ if( width < 8 || width >= 32768) {
+ // Read flat data
+ for (j=0; j < height; ++j) {
+ for (i=0; i < width; ++i) {
+ stbi_uc rgbe[4];
+main_decode_loop:
+ getn(s, rgbe, 4);
+ hdr_convert(hdr_data + j * width * req_comp + i * req_comp, rgbe, req_comp);
+ }
+ }
+ } else {
+ // Read RLE-encoded data
+ scanline = NULL;
+
+ for (j = 0; j < height; ++j) {
+ c1 = get8(s);
+ c2 = get8(s);
+ len = get8(s);
+ if (c1 != 2 || c2 != 2 || (len & 0x80)) {
+ // not run-length encoded, so we have to actually use THIS data as a decoded
+ // pixel (note this can't be a valid pixel--one of RGB must be >= 128)
+ stbi_uc rgbe[4] = { c1,c2,len, get8(s) };
+ hdr_convert(hdr_data, rgbe, req_comp);
+ i = 1;
+ j = 0;
+ free(scanline);
+ goto main_decode_loop; // yes, this is fucking insane; blame the fucking insane format
+ }
+ len <<= 8;
+ len |= get8(s);
+ if (len != width) { free(hdr_data); free(scanline); return epf("invalid decoded scanline length", "corrupt HDR"); }
+ if (scanline == NULL) scanline = (stbi_uc *) malloc(width * 4);
+
+ for (k = 0; k < 4; ++k) {
+ i = 0;
+ while (i < width) {
+ count = get8(s);
+ if (count > 128) {
+ // Run
+ value = get8(s);
+ count -= 128;
+ for (z = 0; z < count; ++z)
+ scanline[i++ * 4 + k] = value;
+ } else {
+ // Dump
+ for (z = 0; z < count; ++z)
+ scanline[i++ * 4 + k] = get8(s);
+ }
+ }
+ }
+ for (i=0; i < width; ++i)
+ hdr_convert(hdr_data+(j*width + i)*req_comp, scanline + i*4, req_comp);
+ }
+ free(scanline);
+ }
+
+ return hdr_data;
+}
+
+#ifndef STBI_NO_STDIO
+float *stbi_hdr_load_from_file(FILE *f, int *x, int *y, int *comp, int req_comp)
+{
+ stbi s;
+ start_file(&s,f);
+ return hdr_load(&s,x,y,comp,req_comp);
+}
+#endif
+
+float *stbi_hdr_load_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp)
+{
+ stbi s;
+ start_mem(&s,buffer, len);
+ return hdr_load(&s,x,y,comp,req_comp);
+}
+
+#endif // STBI_NO_HDR
+
+/////////////////////// write image ///////////////////////
+
+#ifndef STBI_NO_WRITE
+
+static void write8(FILE *f, int x) { uint8 z = (uint8) x; fwrite(&z,1,1,f); }
+
+static void writefv(FILE *f, char *fmt, va_list v)
+{
+ while (*fmt) {
+ switch (*fmt++) {
+ case ' ': break;
+ case '1': { uint8 x = va_arg(v, int); write8(f,x); break; }
+ case '2': { int16 x = va_arg(v, int); write8(f,x); write8(f,x>>8); break; }
+ case '4': { int32 x = va_arg(v, int); write8(f,x); write8(f,x>>8); write8(f,x>>16); write8(f,x>>24); break; }
+ default:
+ assert(0);
+ va_end(v);
+ return;
+ }
+ }
+}
+
+static void writef(FILE *f, char *fmt, ...)
+{
+ va_list v;
+ va_start(v, fmt);
+ writefv(f,fmt,v);
+ va_end(v);
+}
+
+static void write_pixels(FILE *f, int rgb_dir, int vdir, int x, int y, int comp, void *data, int write_alpha, int scanline_pad)
+{
+ uint8 bg[3] = { 255, 0, 255}, px[3];
+ uint32 zero = 0;
+ int i,j,k, j_end;
+
+ if (vdir < 0)
+ j_end = -1, j = y-1;
+ else
+ j_end = y, j = 0;
+
+ for (; j != j_end; j += vdir) {
+ for (i=0; i < x; ++i) {
+ uint8 *d = (uint8 *) data + (j*x+i)*comp;
+ if (write_alpha < 0)
+ fwrite(&d[comp-1], 1, 1, f);
+ switch (comp) {
+ case 1:
+ case 2: writef(f, "111", d[0],d[0],d[0]);
+ break;
+ case 4:
+ if (!write_alpha) {
+ for (k=0; k < 3; ++k)
+ px[k] = bg[k] + ((d[k] - bg[k]) * d[3])/255;
+ writef(f, "111", px[1-rgb_dir],px[1],px[1+rgb_dir]);
+ break;
+ }
+ /* FALLTHROUGH */
+ case 3:
+ writef(f, "111", d[1-rgb_dir],d[1],d[1+rgb_dir]);
+ break;
+ }
+ if (write_alpha > 0)
+ fwrite(&d[comp-1], 1, 1, f);
+ }
+ fwrite(&zero,scanline_pad,1,f);
+ }
+}
+
+static int outfile(char const *filename, int rgb_dir, int vdir, int x, int y, int comp, void *data, int alpha, int pad, char *fmt, ...)
+{
+ FILE *f = fopen(filename, "wb");
+ if (f) {
+ va_list v;
+ va_start(v, fmt);
+ writefv(f, fmt, v);
+ va_end(v);
+ write_pixels(f,rgb_dir,vdir,x,y,comp,data,alpha,pad);
+ fclose(f);
+ }
+ return f != NULL;
+}
+
+int stbi_write_bmp(char const *filename, int x, int y, int comp, void *data)
+{
+ int pad = (-x*3) & 3;
+ return outfile(filename,-1,-1,x,y,comp,data,0,pad,
+ "11 4 22 4" "4 44 22 444444",
+ 'B', 'M', 14+40+(x*3+pad)*y, 0,0, 14+40, // file header
+ 40, x,y, 1,24, 0,0,0,0,0,0); // bitmap header
+}
+
+int stbi_write_tga(char const *filename, int x, int y, int comp, void *data)
+{
+ int has_alpha = !(comp & 1);
+ return outfile(filename, -1,-1, x, y, comp, data, has_alpha, 0,
+ "111 221 2222 11", 0,0,2, 0,0,0, 0,0,x,y, 24+8*has_alpha, 8*has_alpha);
+}
+
+// any other image formats that do interleaved rgb data?
+// PNG: requires adler32,crc32 -- significant amount of code
+// PSD: no, channels output separately
+// TIFF: no, stripwise-interleaved... i think
+
+#endif // STBI_NO_WRITE
+
+#endif // STBI_HEADER_FILE_ONLY
diff --git a/3party/stb_image/stb_image.h b/3party/stb_image/stb_image.h
new file mode 100644
index 0000000000..172925126c
--- /dev/null
+++ b/3party/stb_image/stb_image.h
@@ -0,0 +1,350 @@
+/* stbi-1.14 - public domain JPEG/PNG reader - http://nothings.org/stb_image.c
+ when you control the images you're loading
+
+ QUICK NOTES:
+ Primarily of interest to game developers and other people who can
+ avoid problematic images and only need the trivial interface
+
+ JPEG baseline (no JPEG progressive, no oddball channel decimations)
+ PNG non-interlaced
+ BMP non-1bpp, non-RLE
+ TGA (not sure what subset, if a subset)
+ PSD (composited view only, no extra channels)
+ HDR (radiance rgbE format)
+ writes BMP,TGA (define STBI_NO_WRITE to remove code)
+ decoded from memory or through stdio FILE (define STBI_NO_STDIO to remove code)
+ supports installable dequantizing-IDCT, YCbCr-to-RGB conversion (define STBI_SIMD)
+
+ TODO:
+ stbi_info_*
+
+ history:
+ 1.14 fix threadsafe conversion bug; header-file-only version (#define STBI_HEADER_FILE_ONLY before including)
+ 1.13 threadsafe
+ 1.12 const qualifiers in the API
+ 1.11 Support installable IDCT, colorspace conversion routines
+ 1.10 Fixes for 64-bit (don't use "unsigned long")
+ optimized upsampling by Fabian "ryg" Giesen
+ 1.09 Fix format-conversion for PSD code (bad global variables!)
+ 1.08 Thatcher Ulrich's PSD code integrated by Nicolas Schulz
+ 1.07 attempt to fix C++ warning/errors again
+ 1.06 attempt to fix C++ warning/errors again
+ 1.05 fix TGA loading to return correct *comp and use good luminance calc
+ 1.04 default float alpha is 1, not 255; use 'void *' for stbi_image_free
+ 1.03 bugfixes to STBI_NO_STDIO, STBI_NO_HDR
+ 1.02 support for (subset of) HDR files, float interface for preferred access to them
+ 1.01 fix bug: possible bug in handling right-side up bmps... not sure
+ fix bug: the stbi_bmp_load() and stbi_tga_load() functions didn't work at all
+ 1.00 interface to zlib that skips zlib header
+ 0.99 correct handling of alpha in palette
+ 0.98 TGA loader by lonesock; dynamically add loaders (untested)
+ 0.97 jpeg errors on too large a file; also catch another malloc failure
+ 0.96 fix detection of invalid v value - particleman@mollyrocket forum
+ 0.95 during header scan, seek to markers in case of padding
+ 0.94 STBI_NO_STDIO to disable stdio usage; rename all #defines the same
+ 0.93 handle jpegtran output; verbose errors
+ 0.92 read 4,8,16,24,32-bit BMP files of several formats
+ 0.91 output 24-bit Windows 3.0 BMP files
+ 0.90 fix a few more warnings; bump version number to approach 1.0
+ 0.61 bugfixes due to Marc LeBlanc, Christopher Lloyd
+ 0.60 fix compiling as c++
+ 0.59 fix warnings: merge Dave Moore's -Wall fixes
+ 0.58 fix bug: zlib uncompressed mode len/nlen was wrong endian
+ 0.57 fix bug: jpg last huffman symbol before marker was >9 bits but less
+ than 16 available
+ 0.56 fix bug: zlib uncompressed mode len vs. nlen
+ 0.55 fix bug: restart_interval not initialized to 0
+ 0.54 allow NULL for 'int *comp'
+ 0.53 fix bug in png 3->4; speedup png decoding
+ 0.52 png handles req_comp=3,4 directly; minor cleanup; jpeg comments
+ 0.51 obey req_comp requests, 1-component jpegs return as 1-component,
+ on 'test' only check type, not whether we support this variant
+*/
+
+
+#ifndef STBI_INCLUDE_STB_IMAGE_H
+#define STBI_INCLUDE_STB_IMAGE_H
+
+//// begin header file ////////////////////////////////////////////////////
+//
+// Limitations:
+// - no progressive/interlaced support (jpeg, png)
+// - 8-bit samples only (jpeg, png)
+// - not threadsafe
+// - channel subsampling of at most 2 in each dimension (jpeg)
+// - no delayed line count (jpeg) -- IJG doesn't support either
+//
+// Basic usage (see HDR discussion below):
+// int x,y,n;
+// unsigned char *data = stbi_load(filename, &x, &y, &n, 0);
+// // ... process data if not NULL ...
+// // ... x = width, y = height, n = # 8-bit components per pixel ...
+// // ... replace '0' with '1'..'4' to force that many components per pixel
+// stbi_image_free(data)
+//
+// Standard parameters:
+// int *x -- outputs image width in pixels
+// int *y -- outputs image height in pixels
+// int *comp -- outputs # of image components in image file
+// int req_comp -- if non-zero, # of image components requested in result
+//
+// The return value from an image loader is an 'unsigned char *' which points
+// to the pixel data. The pixel data consists of *y scanlines of *x pixels,
+// with each pixel consisting of N interleaved 8-bit components; the first
+// pixel pointed to is top-left-most in the image. There is no padding between
+// image scanlines or between pixels, regardless of format. The number of
+// components N is 'req_comp' if req_comp is non-zero, or *comp otherwise.
+// If req_comp is non-zero, *comp has the number of components that _would_
+// have been output otherwise. E.g. if you set req_comp to 4, you will always
+// get RGBA output, but you can check *comp to easily see if it's opaque.
+//
+// An output image with N components has the following components interleaved
+// in this order in each pixel:
+//
+// N=#comp components
+// 1 grey
+// 2 grey, alpha
+// 3 red, green, blue
+// 4 red, green, blue, alpha
+//
+// If image loading fails for any reason, the return value will be NULL,
+// and *x, *y, *comp will be unchanged. The function stbi_failure_reason()
+// can be queried for an extremely brief, end-user unfriendly explanation
+// of why the load failed. Define STBI_NO_FAILURE_STRINGS to avoid
+// compiling these strings at all, and STBI_FAILURE_USERMSG to get slightly
+// more user-friendly ones.
+//
+// Paletted PNG and BMP images are automatically depalettized.
+//
+//
+// ===========================================================================
+//
+// HDR image support (disable by defining STBI_NO_HDR)
+//
+// stb_image now supports loading HDR images in general, and currently
+// the Radiance .HDR file format, although the support is provided
+// generically. You can still load any file through the existing interface;
+// if you attempt to load an HDR file, it will be automatically remapped to
+// LDR, assuming gamma 2.2 and an arbitrary scale factor defaulting to 1;
+// both of these constants can be reconfigured through this interface:
+//
+// stbi_hdr_to_ldr_gamma(2.2f);
+// stbi_hdr_to_ldr_scale(1.0f);
+//
+// (note, do not use _inverse_ constants; stbi_image will invert them
+// appropriately).
+//
+// Additionally, there is a new, parallel interface for loading files as
+// (linear) floats to preserve the full dynamic range:
+//
+// float *data = stbi_loadf(filename, &x, &y, &n, 0);
+//
+// If you load LDR images through this interface, those images will
+// be promoted to floating point values, run through the inverse of
+// constants corresponding to the above:
+//
+// stbi_ldr_to_hdr_scale(1.0f);
+// stbi_ldr_to_hdr_gamma(2.2f);
+//
+// Finally, given a filename (or an open file or memory block--see header
+// file for details) containing image data, you can query for the "most
+// appropriate" interface to use (that is, whether the image is HDR or
+// not), using:
+//
+// stbi_is_hdr(char *filename);
+
+#ifndef STBI_NO_STDIO
+#include <stdio.h>
+#endif
+
+#define STBI_VERSION 1
+
+enum
+{
+ STBI_default = 0, // only used for req_comp
+
+ STBI_grey = 1,
+ STBI_grey_alpha = 2,
+ STBI_rgb = 3,
+ STBI_rgb_alpha = 4,
+};
+
+typedef unsigned char stbi_uc;
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+// WRITING API
+
+#if !defined(STBI_NO_WRITE) && !defined(STBI_NO_STDIO)
+// write a BMP/TGA file given tightly packed 'comp' channels (no padding, nor bmp-stride-padding)
+// (you must include the appropriate extension in the filename).
+// returns TRUE on success, FALSE if couldn't open file, error writing file
+extern int stbi_write_bmp (char const *filename, int x, int y, int comp, void *data);
+extern int stbi_write_tga (char const *filename, int x, int y, int comp, void *data);
+#endif
+
+// PRIMARY API - works on images of any type
+
+// load image by filename, open file, or memory buffer
+#ifndef STBI_NO_STDIO
+extern stbi_uc *stbi_load (char const *filename, int *x, int *y, int *comp, int req_comp);
+extern stbi_uc *stbi_load_from_file (FILE *f, int *x, int *y, int *comp, int req_comp);
+extern int stbi_info_from_file (FILE *f, int *x, int *y, int *comp);
+#endif
+extern stbi_uc *stbi_load_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp);
+// for stbi_load_from_file, file pointer is left pointing immediately after image
+
+#ifndef STBI_NO_HDR
+#ifndef STBI_NO_STDIO
+extern float *stbi_loadf (char const *filename, int *x, int *y, int *comp, int req_comp);
+extern float *stbi_loadf_from_file (FILE *f, int *x, int *y, int *comp, int req_comp);
+#endif
+extern float *stbi_loadf_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp);
+
+extern void stbi_hdr_to_ldr_gamma(float gamma);
+extern void stbi_hdr_to_ldr_scale(float scale);
+
+extern void stbi_ldr_to_hdr_gamma(float gamma);
+extern void stbi_ldr_to_hdr_scale(float scale);
+
+#endif // STBI_NO_HDR
+
+// get a VERY brief reason for failure
+// NOT THREADSAFE
+extern char *stbi_failure_reason (void);
+
+// free the loaded image -- this is just free()
+extern void stbi_image_free (void *retval_from_stbi_load);
+
+// get image dimensions & components without fully decoding
+extern int stbi_info_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp);
+extern int stbi_is_hdr_from_memory(stbi_uc const *buffer, int len);
+#ifndef STBI_NO_STDIO
+extern int stbi_info (char const *filename, int *x, int *y, int *comp);
+extern int stbi_is_hdr (char const *filename);
+extern int stbi_is_hdr_from_file(FILE *f);
+#endif
+
+// ZLIB client - used by PNG, available for other purposes
+
+extern char *stbi_zlib_decode_malloc_guesssize(const char *buffer, int len, int initial_size, int *outlen);
+extern char *stbi_zlib_decode_malloc(const char *buffer, int len, int *outlen);
+extern int stbi_zlib_decode_buffer(char *obuffer, int olen, const char *ibuffer, int ilen);
+
+extern char *stbi_zlib_decode_noheader_malloc(const char *buffer, int len, int *outlen);
+extern int stbi_zlib_decode_noheader_buffer(char *obuffer, int olen, const char *ibuffer, int ilen);
+
+// TYPE-SPECIFIC ACCESS
+
+// is it a jpeg?
+extern int stbi_jpeg_test_memory (stbi_uc const *buffer, int len);
+extern stbi_uc *stbi_jpeg_load_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp);
+extern int stbi_jpeg_info_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp);
+
+#ifndef STBI_NO_STDIO
+extern stbi_uc *stbi_jpeg_load (char const *filename, int *x, int *y, int *comp, int req_comp);
+extern int stbi_jpeg_test_file (FILE *f);
+extern stbi_uc *stbi_jpeg_load_from_file (FILE *f, int *x, int *y, int *comp, int req_comp);
+
+extern int stbi_jpeg_info (char const *filename, int *x, int *y, int *comp);
+extern int stbi_jpeg_info_from_file (FILE *f, int *x, int *y, int *comp);
+#endif
+
+// is it a png?
+extern int stbi_png_test_memory (stbi_uc const *buffer, int len);
+extern stbi_uc *stbi_png_load_from_memory (stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp);
+extern int stbi_png_info_from_memory (stbi_uc const *buffer, int len, int *x, int *y, int *comp);
+
+#ifndef STBI_NO_STDIO
+extern stbi_uc *stbi_png_load (char const *filename, int *x, int *y, int *comp, int req_comp);
+extern int stbi_png_info (char const *filename, int *x, int *y, int *comp);
+extern int stbi_png_test_file (FILE *f);
+extern stbi_uc *stbi_png_load_from_file (FILE *f, int *x, int *y, int *comp, int req_comp);
+extern int stbi_png_info_from_file (FILE *f, int *x, int *y, int *comp);
+#endif
+
+// is it a bmp?
+extern int stbi_bmp_test_memory (stbi_uc const *buffer, int len);
+
+extern stbi_uc *stbi_bmp_load (char const *filename, int *x, int *y, int *comp, int req_comp);
+extern stbi_uc *stbi_bmp_load_from_memory (stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp);
+#ifndef STBI_NO_STDIO
+extern int stbi_bmp_test_file (FILE *f);
+extern stbi_uc *stbi_bmp_load_from_file (FILE *f, int *x, int *y, int *comp, int req_comp);
+#endif
+
+// is it a tga?
+extern int stbi_tga_test_memory (stbi_uc const *buffer, int len);
+
+extern stbi_uc *stbi_tga_load (char const *filename, int *x, int *y, int *comp, int req_comp);
+extern stbi_uc *stbi_tga_load_from_memory (stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp);
+#ifndef STBI_NO_STDIO
+extern int stbi_tga_test_file (FILE *f);
+extern stbi_uc *stbi_tga_load_from_file (FILE *f, int *x, int *y, int *comp, int req_comp);
+#endif
+
+// is it a psd?
+extern int stbi_psd_test_memory (stbi_uc const *buffer, int len);
+
+extern stbi_uc *stbi_psd_load (char const *filename, int *x, int *y, int *comp, int req_comp);
+extern stbi_uc *stbi_psd_load_from_memory (stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp);
+#ifndef STBI_NO_STDIO
+extern int stbi_psd_test_file (FILE *f);
+extern stbi_uc *stbi_psd_load_from_file (FILE *f, int *x, int *y, int *comp, int req_comp);
+#endif
+
+// is it an hdr?
+extern int stbi_hdr_test_memory (stbi_uc const *buffer, int len);
+
+extern float * stbi_hdr_load (char const *filename, int *x, int *y, int *comp, int req_comp);
+extern float * stbi_hdr_load_from_memory (stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp);
+#ifndef STBI_NO_STDIO
+extern int stbi_hdr_test_file (FILE *f);
+extern float * stbi_hdr_load_from_file (FILE *f, int *x, int *y, int *comp, int req_comp);
+#endif
+
+// define new loaders
+typedef struct
+{
+ int (*test_memory)(stbi_uc const *buffer, int len);
+ stbi_uc * (*load_from_memory)(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp);
+#ifndef STBI_NO_STDIO
+ int (*test_file)(FILE *f);
+ stbi_uc * (*load_from_file)(FILE *f, int *x, int *y, int *comp, int req_comp);
+#endif
+} stbi_loader;
+
+// register a loader by filling out the above structure (you must defined ALL functions)
+// returns 1 if added or already added, 0 if not added (too many loaders)
+// NOT THREADSAFE
+extern int stbi_register_loader(stbi_loader *loader);
+
+// define faster low-level operations (typically SIMD support)
+#if STBI_SIMD
+typedef void (*stbi_idct_8x8)(uint8 *out, int out_stride, short data[64], unsigned short *dequantize);
+// compute an integer IDCT on "input"
+// input[x] = data[x] * dequantize[x]
+// write results to 'out': 64 samples, each run of 8 spaced by 'out_stride'
+// CLAMP results to 0..255
+typedef void (*stbi_YCbCr_to_RGB_run)(uint8 *output, uint8 const *y, uint8 const *cb, uint8 const *cr, int count, int step);
+// compute a conversion from YCbCr to RGB
+// 'count' pixels
+// write pixels to 'output'; each pixel is 'step' bytes (either 3 or 4; if 4, write '255' as 4th), order R,G,B
+// y: Y input channel
+// cb: Cb input channel; scale/biased to be 0..255
+// cr: Cr input channel; scale/biased to be 0..255
+
+extern void stbi_install_idct(stbi_idct_8x8 func);
+extern void stbi_install_YCbCr_to_RGB(stbi_YCbCr_to_RGB_run func);
+#endif // STBI_SIMD
+
+#ifdef __cplusplus
+}
+#endif
+
+//
+//
+//// end header file /////////////////////////////////////////////////////
+#endif // STBI_INCLUDE_STB_IMAGE_H
generated by cgit v1.2.3 (git 2.25.1) at 2024-07-05 11:53:13 +0300