Skip to content
Commits on Source (6)
Hide whitespace changes
Inline Side-by-side
libweston/color-lcms/color-curve-segments.c 0 → 100644
View file @ 25ffc4ae
/*
* Copyright 2023 Collabora, Ltd.
*
* 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 (including the
* next paragraph) 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 "config.h"
#include <lcms2_plugin.h>
#include "color-curve-segments.h"
#include "color-lcms.h"
#include "shared/xalloc.h"
/**
* LCMS internally defines MINUS_INF and PLUS_INF arbitrarily to -1e22 and 1e22.
* This is not specified by the ICC spec. So we pick an arbitrary value as well
* to be able to do comparisons with such LCMS values.
*/
#define CLOSE_TO_INFINITY 1e10
static float
round_segment_break_value(float value)
{
if (value < -CLOSE_TO_INFINITY)
return -INFINITY;
if (value > CLOSE_TO_INFINITY)
return INFINITY;
return value;
}
static void
segment_print(const cmsCurveSegment *seg, struct weston_log_scope *scope)
{
float g, a, b, c, d, e, f;
float x0 = round_segment_break_value(seg->x0);
float x1 = round_segment_break_value(seg->x1);
weston_log_scope_printf(scope, "%*s(%.2f, %.2f] ", 12, "", x0, x1);
if (seg->Type == 0) {
/* Not much to print as this is a sampled curve. We have only
* the samples in such case, but that would flood the debug
* scope and wouldn't be very useful. */
weston_log_scope_printf(scope, "sampled curve with %u samples\n",
seg->nGridPoints);
return;
}
weston_log_scope_printf(scope, "parametric type %d%s", seg->Type,
(seg->Type > 0) ? "\n" : ", inverse of\n");
/* These types are the built-in ones supported by LCMS. Some of them are
* defined by the ICC spec, but LCMS also accepts creating custom
* curves. Probably that's why it does not expose these types in enums.
* If we start creating custom curves, we should keep track of them
* somehow in order to print them properly here. */
switch (seg->Type) {
case 1:
case -1:
/* Type 1: power law
*
* y = x ^ g
*/
g = seg->Params[0];
weston_log_scope_printf(scope, "%*sy = x ^ %.2f\n", 15, "", g);
break;
case 2:
case -2:
/* Type 2: CIE 122-1966
*
* y = (a * x + b) ^ g | x >= -b/a
* y = 0 | else
*/
g = seg->Params[0];
a = seg->Params[1];
b = seg->Params[2];
weston_log_scope_printf(scope, "%*sy = (%.2f * x + %.2f) ^ %.2f, for x >= %.2f\n",
15, "", a, b, g, -b/a);
weston_log_scope_printf(scope, "%*sy = 0, for x < %.2f\n",
15, "", -b/a);
break;
case 3:
case -3:
/* Type 3: IEC 61966-3
*
* y = (a * x + b) ^ g + c | x <= -b/a
* y = c | else
*/
g = seg->Params[0];
a = seg->Params[1];
b = seg->Params[2];
c = seg->Params[3];
weston_log_scope_printf(scope, "%*sy = (%.2f * x + %.2f) ^ %.2f + %.2f, for x <= %.2f\n",
15, "", a, b, g, c, -b/a);
weston_log_scope_printf(scope, "%*sy = %.2f, for x > %.2f\n",
15, "", c, -b/a);
break;
case 4:
case -4:
/* Type 4: IEC 61966-2.1 (sRGB)
*
* y = (a * x + b) ^ g | x >= d
* y = c * x | else
*/
g = seg->Params[0];
a = seg->Params[1];
b = seg->Params[2];
c = seg->Params[3];
d = seg->Params[4];
weston_log_scope_printf(scope, "%*sy = (%.2f * x + %.2f) ^ %.2f, for x >= %.2f\n",
15, "", a, b, g, d);
weston_log_scope_printf(scope, "%*sy = %.2f * x, for x < %.2f\n",
15, "", c, d);
break;
case 5:
case -5:
/* Type 5:
*
* y = (a * x + b) ^ g + e | x >= d
* y = c * x + f | else
*/
g = seg->Params[0];
a = seg->Params[1];
b = seg->Params[2];
c = seg->Params[3];
d = seg->Params[4];
e = seg->Params[5];
f = seg->Params[6];
weston_log_scope_printf(scope, "%*sy = (%.2f * x + %.2f) ^ %.2f + %.2f, for x >= %.2f\n",
15, "", a, b, g, e, d);
weston_log_scope_printf(scope, "%*sy = %.2f * x + %.2f, for x < %.2f\n",
15, "", c, f, d);
break;
case 6:
case -6:
/* Type 6: one of the segmented curves described in ICCSpecRevision_02_11_06_Float.pdf
*
* y = (a * x + b) ^ g + c
*/
g = seg->Params[0];
a = seg->Params[1];
b = seg->Params[2];
c = seg->Params[3];
if (a == 0) {
/* Special case in which we have a constant value */
weston_log_scope_printf(scope, "%*sconstant %.2f\n",
15, "", pow(b, g) + c);
break;
}
weston_log_scope_printf(scope, "%*sy = (%.2f * x + %.2f) ^ %.2f + %.2f\n",
15, "", a, b, g, c);
break;
case 7:
case -7:
/* Type 7: one of the segmented curves described in ICCSpecRevision_02_11_06_Float.pdf
*
* y = a * log (b * x ^ g + c) + d
*/
g = seg->Params[0];
a = seg->Params[1];
b = seg->Params[2];
c = seg->Params[3];
d = seg->Params[4];
weston_log_scope_printf(scope, "%*sy = %.2f * log (%.2f * x ^ %.2f + %.2f) + %.2f\n",
15, "", a, b, g, c, d);
break;
case 8:
case -8:
/* Type 8: one of the segmented curves described in ICCSpecRevision_02_11_06_Float.pdf
*
* y = a * b ^ (c * x + d) + e
*/
a = seg->Params[0];
b = seg->Params[1];
c = seg->Params[2];
d = seg->Params[3];
e = seg->Params[4];
weston_log_scope_printf(scope, "%*sy = %.2f * %.2f ^ (%.2f * x + %.2f) + %.2f\n",
15, "", a, b, c, d, e);
break;
case 108:
case -108:
/* Type 108: S-shapped
*
* y = (1 - (1 - x) ^ 1 / g) ^ 1 / g
*/
g = seg->Params[0];
weston_log_scope_printf(scope, "%*sy = (1 - (1 - x) ^ 1 / %.2f) ^ 1 / %.2f\n",
15, "", g, g);
break;
default:
weston_log_scope_printf(scope, "%*sunknown curve type\n",
15, "");
break;
}
}
static void
curve_print(const cmsToneCurve *curve, struct weston_log_scope *scope)
{
const cmsCurveSegment *seg;
unsigned int i;
weston_log_scope_printf(scope, "%*sSegments\n", 9, "");
for (i = 0; ; i++) {
seg = cmsGetToneCurveSegment(i, curve);
if (!seg)
break;
segment_print(seg, scope);
}
if (i == 0)
weston_log_scope_printf(scope, "%*sNo segments\n", 12, "");
}
static bool
are_segment_breaks_equal(float a, float b)
{
const float PRECISION = 1e-5;
if (a < -CLOSE_TO_INFINITY && b < -CLOSE_TO_INFINITY)
return true;
if (a > CLOSE_TO_INFINITY && b > CLOSE_TO_INFINITY)
return true;
if (fabs(b - a) < PRECISION)
return true;
return false;
}
static bool
are_segments_equal(const cmsCurveSegment *seg_A, const cmsCurveSegment *seg_B)
{
/* These come from the built-in supported types from LCMS. See
* segment_print() for more information. */
uint32_t types[] = {1, 2, 3, 4, 5, 6, 7, 8, 108};
uint32_t types_n_params[] = {1, 3, 4, 5, 7, 4, 5, 5, 1};
unsigned int i;
const float PRECISION = 1e-5;
int32_t n_params = -1;
if (seg_A->Type != seg_B->Type)
return false;
if (!are_segment_breaks_equal(seg_A->x0, seg_B->x0))
return false;
if (!are_segment_breaks_equal(seg_A->x1, seg_B->x1))
return false;
/* Sampled curve, so we must compare the set of samples of each segment. */
if (seg_A->Type == 0) {
if (seg_A->nGridPoints != seg_B->nGridPoints)
return false;
for (i = 0; i < seg_A->nGridPoints; i++) {
if (fabs(seg_A->SampledPoints[i] - seg_B->SampledPoints[i]) > PRECISION)
return false;
}
/* The samples are all the same, so the segments are equal. */
return true;
}
/* Parametric curve. Determine the number of params that we should
* compare. */
for (i = 0; i < ARRAY_LENGTH(types); i++) {
if (types[i] == abs(seg_A->Type)) {
n_params = types_n_params[i];
break;
}
}
/* The curve is unknown to us, so it's reasonable to assume the segments
* are not equal. */
if (n_params < 0)
return false;
/* Compare the parameters from the segments. */
for (i = 0; i < (uint32_t)n_params; i++) {
if (fabs(seg_A->Params[i] - seg_B->Params[i]) > PRECISION)
return false;
}
/* The parameters are all the same, so the segments are equal. */
return true;
}
WESTON_EXPORT_FOR_TESTS bool
are_curves_equal(cmsToneCurve *curve_A, cmsToneCurve *curve_B)
{
unsigned int i;
const cmsCurveSegment *seg_A, *seg_B;
/* Curves point to the same address, so they are the same. */
if (curve_A == curve_B)
return true;
for (i = 0; ; i++) {
seg_A = cmsGetToneCurveSegment(i, curve_A);
seg_B = cmsGetToneCurveSegment(i, curve_B);
/* The number of segments in A and B are different, so the
* curves are not equal. */
if ((seg_A == NULL) != (seg_B == NULL))
return false;
/* No more segments to compare. */
if (!seg_A && !seg_B)
break;
if (!are_segments_equal(seg_A, seg_B))
return false;
}
/* We exhausted the pair of segments from the curves and they all do
* match, so the curves are equal. */
return true;
}
static bool
are_curves_inverse(cmsToneCurve *curve_A, cmsToneCurve *curve_B)
{
const cmsCurveSegment *seg_A, *seg_B;
cmsCurveSegment seg_B_inverse;
seg_A = cmsGetToneCurveSegment(0, curve_A);
seg_B = cmsGetToneCurveSegment(0, curve_B);
if (!seg_A || !seg_B)
return false;
/* TODO: handle certain multi-segmented curves, In such cases, we need
* to pay attention to the segment breaks.
*
* Some multi-segmented curves in which one of the segments has an input
* range of negative values would not compute. E.g. power law curves
* with fractional exponent. When it takes negative as input, the result
* would be complex numbers.
*
* The multi-segmented case that we care but are not handling here is
* like that:
*
* segment 1: (-inf, 0.0] - constant 0.0
* segment 2: (0.0, 1.0] - some parametric curve
* segment 3: (1.0, inf] - constant 1.0
*
* The meaning of such curves is: the values out of the range (0.0, 1.0]
* don't matter. So if both curves have 3 segments like that and the 2nd
* segment of one is the inverse of the other, they are inverse curves. */
if (cmsGetToneCurveSegment(1, curve_A) ||
cmsGetToneCurveSegment(1, curve_B))
return false;
/* TODO: handle sampled curves. If one of them is a sampled curve, we
* assume they are not inverse segments. How to do that? */
if (seg_A->Type == 0 || seg_B->Type == 0)
return false;
/* Both are parametric segments, we check if the inverse of one equals
* the other. */
seg_B_inverse = *seg_B;
seg_B_inverse.Type = - seg_B->Type;
return are_segments_equal(seg_A, &seg_B_inverse);
}
bool
are_curvesets_inverse(cmsStage *set_A, cmsStage *set_B)
{
unsigned int i;
_cmsStageToneCurvesData *set_A_data, *set_B_data;
assert(cmsStageType(set_A) == cmsSigCurveSetElemType);
assert(cmsStageType(set_B) == cmsSigCurveSetElemType);
set_A_data = cmsStageData(set_A);
set_B_data = cmsStageData(set_B);
assert(set_A_data->nCurves == set_B_data->nCurves);
for (i = 0; i < set_A_data->nCurves; i++)
if (!are_curves_inverse(set_A_data->TheCurves[i],
set_B_data->TheCurves[i]))
return false;
return true;
}
static cmsToneCurve *
join_powerlaw_curves(cmsContext context_id,
cmsToneCurve *curve_A, cmsToneCurve *curve_B)
{
const float PRECISION = 1e-5;
cmsCurveSegment segment;
const cmsCurveSegment *seg_A, *seg_B;
seg_A = cmsGetToneCurveSegment(0, curve_A);
seg_B = cmsGetToneCurveSegment(0, curve_B);
if (!seg_A || !seg_B)
return NULL;
/* TODO: handle certain multi-segmented curves, In such cases, we need
* to pay attention to the segment breaks, and it is harder to merge the
* curves.
*
* To merge the curves, we need to compute B(A(x)). This curve has the
* same domain (input range) of curve A(x). So we already have the
* segment breaks of A(x) in the domain of B(A(x)), but we need to
* compute the breaks of B(x) in the same domain. To do that, we can use
* the info that B(x) domain equals the output range of A(x). So feeding
* the breaks of B(x) to the inverse of A(x) gives us the breaks of B(x)
* in the domain of B(A(x)) as well. With the segments of A(x) and B(x)
* and their breaks in the domain of B(A(x)), it is simple to compute
* the segments of B(A(x)).
*
* Addressing the generic case described above is too much work for a
* case that probably won't happen. But an easy multi-segmented case
* that we'd be able to merge but are not handling here is when both
* curves are like that:
*
* segment 1: (-inf, 0.0] - constant 0.0
* segment 2: (0.0, 1.0] - some parametric curve
* segment 3: (1.0, inf] - constant 1.0
*
* The meaning of such curves is: the values out of the range (0.0, 1.0]
* don't matter. So if both curves have 3 segments like that and the 2nd
* segment of both is power law, we can easily merge them. */
if (cmsGetToneCurveSegment(1, curve_A) ||
cmsGetToneCurveSegment(1, curve_B))
return NULL;
/* Ensure that the segment breaks are equal to (-inf, inf). */
if (!are_segment_breaks_equal(seg_A->x0, -INFINITY) ||
!are_segment_breaks_equal(seg_A->x1, INFINITY) ||
!are_segment_breaks_equal(seg_B->x0, -INFINITY) ||
!are_segment_breaks_equal(seg_B->x1, INFINITY))
return NULL;
/* Power law curves are type 1 and -1, and we only merge these curves
* here. See segment_print() to know more about the curves types. */
if (abs(seg_A->Type) != 1 || abs(seg_A->Type) != abs(seg_B->Type))
return NULL;
segment.x0 = seg_A->x0;
segment.x1 = seg_A->x1;
segment.Type = seg_A->Type;
/* Being seg_A the curve f and seg_B the curve g, we need to compute
* g(f(x)). Type 1 is the power law curve and type -1 is its inverse.
*
* So if seg_A has exponent j and seg_B has exponent j', g(f(x)) has
* exponent k:
*
* k = j * j', if seg_A and seg_B have the same sign.
* k = j / j', if they have opposite signs.
*
* If the resulting curve type (seg_A->Type) is positive, LCMS
* internally handles it as x^k, and if it is negative it will use
* x^(1/k). */
if (seg_A->Type == seg_B->Type) {
segment.Params[0] = seg_A->Params[0] * seg_B->Params[0];
} else {
assert(seg_A->Type == - seg_B->Type);
if (fabs(seg_B->Params[0]) < PRECISION)
return NULL;
segment.Params[0] = seg_A->Params[0] / seg_B->Params[0];
}
return cmsBuildSegmentedToneCurve(context_id, 1, &segment);
}
cmsStage *
join_powerlaw_curvesets(cmsContext context_id,
cmsToneCurve **set_A, cmsToneCurve **set_B)
{
cmsToneCurve *arr[3];
int i;
cmsStage *ret;
bool powerlaw = true;
for (i = 0; (uint32_t)i < ARRAY_LENGTH(arr); i++) {
arr[i] = join_powerlaw_curves(context_id, set_A[i], set_B[i]);
if (!arr[i]) {
powerlaw = false;
break;
}
}
if (!powerlaw) {
for (; i >= 0; i--)
cmsFreeToneCurve(arr[i]);
return NULL;
}
/* The CurveSet's are powerlaw functions that we were able to merge. */
ret = cmsStageAllocToneCurves(context_id, ARRAY_LENGTH(arr), arr);
abort_oom_if_null(ret);
cmsFreeToneCurveTriple(arr);
return ret;
}
void
curveset_print(cmsStage *stage, struct weston_log_scope *scope)
{
const _cmsStageToneCurvesData *data;
uint32_t already_printed = 0;
unsigned int i, j;
assert(cmsStageType(stage) == cmsSigCurveSetElemType);
data = cmsStageData(stage);
if (data->nCurves == 0) {
weston_log_scope_printf(scope, "%*sNo curves in the set\n", 6, "");
return;
}
/* We can have multiple curves that are the same. So we print their
* indices and print the curve content only once. */
for (i = 0; i < data->nCurves; i++) {
if (((already_printed >> i) & 1) == 1)
continue;
weston_log_scope_printf(scope, "%*sCurve(s) %u", 6, "", i);
already_printed |= (1 << i);
for (j = i + 1; j < data->nCurves; j++) {
/* We are only printing indices of the curves that are
* the same as curve i. */
if (!are_curves_equal(data->TheCurves[i], data->TheCurves[j]))
continue;
weston_log_scope_printf(scope, ", %u", j);
already_printed |= (1 << j);
}
weston_log_scope_printf(scope, "\n");
curve_print(data->TheCurves[i], scope);
}
}
libweston/color-lcms/color-curve-segments.h 0 → 100644
View file @ 25ffc4ae
/*
* Copyright 2023 Collabora, Ltd.
*
* 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 (including the
* next paragraph) 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.
*/
#ifndef COLOR_CURVE_SEGMENTS_H
#define COLOR_CURVE_SEGMENTS_H
#include <lcms2_plugin.h>
#include "color-lcms.h"
#if HAVE_CMS_GET_TONE_CURVE_SEGMENT
void
curveset_print(cmsStage *stage, struct weston_log_scope *scope);
bool
are_curvesets_inverse(cmsStage *set_A, cmsStage *set_B);
bool
are_curves_equal(cmsToneCurve *curve_A, cmsToneCurve *curve_B);
cmsStage *
join_powerlaw_curvesets(cmsContext context_id,
cmsToneCurve **set_A, cmsToneCurve **set_B);
# else /* HAVE_CMS_GET_TONE_CURVE_SEGMENT */
static inline void
curveset_print(cmsStage *stage, struct weston_log_scope *scope)
{
weston_log_scope_printf(scope, "%*scmsGetToneCurveSegment() symbol not " \
"found, so can't print curve set\n", 6, "");
}
static inline bool
are_curvesets_inverse(cmsStage *set_A, cmsStage *set_B)
{
return false;
}
static inline bool
are_curves_equal(cmsToneCurve *curve_A, cmsToneCurve *curve_B)
{
return false;
}
static inline cmsStage *
join_powerlaw_curvesets(cmsContext context_id,
cmsToneCurve **set_A, cmsToneCurve **set_B)
{
return NULL;
}
#endif /* HAVE_CMS_GET_TONE_CURVE_SEGMENT */
#endif /* COLOR_CURVE_SEGMENTS_H */
libweston/color-lcms/color-lcms.h
View file @ 25ffc4ae
......@@ -238,6 +238,9 @@ retrieve_eotf_and_output_inv_eotf(cmsContext lcms_ctx,
unsigned int
cmlcms_reasonable_1D_points(void);
void
lcms_optimize_pipeline(cmsPipeline **lut, cmsContext context_id);
cmsToneCurve *
lcmsJoinToneCurve(cmsContext context_id, const cmsToneCurve *X,
const cmsToneCurve *Y, unsigned int resulting_points);
......
libweston/color-lcms/color-transform.c
View file @ 25ffc4ae
......@@ -31,6 +31,7 @@
#include <lcms2_plugin.h>
#include "color.h"
#include "color-curve-segments.h"
#include "color-lcms.h"
#include "shared/helpers.h"
#include "shared/string-helpers.h"
......@@ -47,13 +48,6 @@
/** Precision for detecting identity matrix */
#define MATRIX_PRECISION_BITS 12
/**
* LCMS internally defines MINUS_INF and PLUS_INF arbitrarily to -1e22 and 1e22.
* This is not specified by the ICC spec. So we pick an arbitrary value as well
* to be able to do comparisons with such LCMS values.
*/
#define CLOSE_TO_INFINITY 1e10
/**
* The method is used in linearization of an arbitrary color profile
* when EOTF is retrieved we want to know a generic way to decide the number
......@@ -382,6 +376,15 @@ join_curvesets(cmsContext context_id, const cmsStage *prev,
assert(prev_->nCurves == ARRAY_LENGTH(arr));
assert(next_->nCurves == ARRAY_LENGTH(arr));
/* If the CurveSet's are parametric powerlaw curves that we know how to
* merge (preserving them as parametric powerlaw curves), we do that. We
* want to avoid transforming parametric curves into sampled curves. */
ret = join_powerlaw_curvesets(context_id,
prev_->TheCurves, next_->TheCurves);
if (ret)
return ret;
/* Transform both CurveSet's into a single sampled one. */
for (i = 0; i < ARRAY_LENGTH(arr); i++) {
arr[i] = lcmsJoinToneCurve(context_id, prev_->TheCurves[i],
next_->TheCurves[i], num_samples);
......@@ -429,6 +432,17 @@ merge_curvesets(cmsPipeline **lut, cmsContext context_id)
do {
if (prev && cmsStageType(prev) == cmsSigCurveSetElemType &&
elem && cmsStageType(elem) == cmsSigCurveSetElemType) {
/* If the curvesets are inverse, joining them results in
* the identity. So we can drop both and continue. */
if (are_curvesets_inverse(prev, elem)) {
prev = cmsStageNext(elem);
if (prev)
elem = cmsStageNext(prev);
else
elem = NULL;
modified = true;
continue;
}
/* Replace two curve set elements with a merged one. */
prev = join_curvesets(context_id, prev, elem,
cmlcms_reasonable_1D_points());
......@@ -567,9 +581,8 @@ translate_pipeline(struct cmlcms_color_transform *xform, const cmsPipeline *lut)
return false;
}
static cmsBool
optimize_float_pipeline(cmsPipeline **lut, cmsContext context_id,
struct cmlcms_color_transform *xform)
WESTON_EXPORT_FOR_TESTS void
lcms_optimize_pipeline(cmsPipeline **lut, cmsContext context_id)
{
bool cont_opt;
......@@ -583,6 +596,13 @@ optimize_float_pipeline(cmsPipeline **lut, cmsContext context_id,
cont_opt = merge_matrices(lut, context_id);
cont_opt |= merge_curvesets(lut, context_id);
} while (cont_opt);
}
static cmsBool
optimize_float_pipeline(cmsPipeline **lut, cmsContext context_id,
struct cmlcms_color_transform *xform)
{
lcms_optimize_pipeline(lut, context_id);
if (translate_pipeline(xform, *lut)) {
xform->status = CMLCMS_TRANSFORM_OPTIMIZED;
......@@ -678,358 +698,6 @@ matrix_print(cmsStage *stage, struct weston_log_scope *scope)
}
}
#if HAVE_CMS_GET_TONE_CURVE_SEGMENT
static float
round_segment_break_value(float value)
{
if (value < -CLOSE_TO_INFINITY)
return -INFINITY;
if (value > CLOSE_TO_INFINITY)
return INFINITY;
return value;
}
static void
segment_print(const cmsCurveSegment *seg, struct weston_log_scope *scope)
{
float g, a, b, c, d, e, f;
float x0 = round_segment_break_value(seg->x0);
float x1 = round_segment_break_value(seg->x1);
weston_log_scope_printf(scope, "%*s(%.2f, %.2f] ", 12, "", x0, x1);
if (seg->Type == 0) {
/* Not much to print as this is a sampled curve. We have only
* the samples in such case, but that would flood the debug
* scope and wouldn't be very useful. */
weston_log_scope_printf(scope, "sampled curve with %u samples\n",
seg->nGridPoints);
return;
}
weston_log_scope_printf(scope, "parametric type %d%s", seg->Type,
(seg->Type > 0) ? "\n" : ", inverse of\n");
/* These types are the built-in ones supported by LCMS. Some of them are
* defined by the ICC spec, but LCMS also accepts creating custom
* curves. Probably that's why it does not expose these types in enums.
* If we start creating custom curves, we should keep track of them
* somehow in order to print them properly here. */
switch (seg->Type) {
case 1:
case -1:
/* Type 1: power law
*
* y = x ^ g
*/
g = seg->Params[0];
weston_log_scope_printf(scope, "%*sy = x ^ %.2f\n", 15, "", g);
break;
case 2:
case -2:
/* Type 2: CIE 122-1966
*
* y = (a * x + b) ^ g | x >= -b/a
* y = 0 | else
*/
g = seg->Params[0];
a = seg->Params[1];
b = seg->Params[2];
weston_log_scope_printf(scope, "%*sy = (%.2f * x + %.2f) ^ %.2f, for x >= %.2f\n",
15, "", a, b, g, -b/a);
weston_log_scope_printf(scope, "%*sy = 0, for x < %.2f\n",
15, "", -b/a);
break;
case 3:
case -3:
/* Type 3: IEC 61966-3
*
* y = (a * x + b) ^ g + c | x <= -b/a
* y = c | else
*/
g = seg->Params[0];
a = seg->Params[1];
b = seg->Params[2];
c = seg->Params[3];
weston_log_scope_printf(scope, "%*sy = (%.2f * x + %.2f) ^ %.2f + %.2f, for x <= %.2f\n",
15, "", a, b, g, c, -b/a);
weston_log_scope_printf(scope, "%*sy = %.2f, for x > %.2f\n",
15, "", c, -b/a);
break;
case 4:
case -4:
/* Type 4: IEC 61966-2.1 (sRGB)
*
* y = (a * x + b) ^ g | x >= d
* y = c * x | else
*/
g = seg->Params[0];
a = seg->Params[1];
b = seg->Params[2];
c = seg->Params[3];
d = seg->Params[4];
weston_log_scope_printf(scope, "%*sy = (%.2f * x + %.2f) ^ %.2f, for x >= %.2f\n",
15, "", a, b, g, d);
weston_log_scope_printf(scope, "%*sy = %.2f * x, for x < %.2f\n",
15, "", c, d);
break;
case 5:
case -5:
/* Type 5:
*
* y = (a * x + b) ^ g + e | x >= d
* y = c * x + f | else
*/
g = seg->Params[0];
a = seg->Params[1];
b = seg->Params[2];
c = seg->Params[3];
d = seg->Params[4];
e = seg->Params[5];
f = seg->Params[6];
weston_log_scope_printf(scope, "%*sy = (%.2f * x + %.2f) ^ %.2f + %.2f, for x >= %.2f\n",
15, "", a, b, g, e, d);
weston_log_scope_printf(scope, "%*sy = %.2f * x + %.2f, for x < %.2f\n",
15, "", c, f, d);
break;
case 6:
case -6:
/* Type 6: one of the segmented curves described in ICCSpecRevision_02_11_06_Float.pdf
*
* y = (a * x + b) ^ g + c
*/
g = seg->Params[0];
a = seg->Params[1];
b = seg->Params[2];
c = seg->Params[3];
if (a == 0) {
/* Special case in which we have a constant value */
weston_log_scope_printf(scope, "%*sconstant %.2f\n",
15, "", pow(b, g) + c);
break;
}
weston_log_scope_printf(scope, "%*sy = (%.2f * x + %.2f) ^ %.2f + %.2f\n",
15, "", a, b, g, c);
break;
case 7:
case -7:
/* Type 7: one of the segmented curves described in ICCSpecRevision_02_11_06_Float.pdf
*
* y = a * log (b * x ^ g + c) + d
*/
g = seg->Params[0];
a = seg->Params[1];
b = seg->Params[2];
c = seg->Params[3];
d = seg->Params[4];
weston_log_scope_printf(scope, "%*sy = %.2f * log (%.2f * x ^ %.2f + %.2f) + %.2f\n",
15, "", a, b, g, c, d);
break;
case 8:
case -8:
/* Type 8: one of the segmented curves described in ICCSpecRevision_02_11_06_Float.pdf
*
* y = a * b ^ (c * x + d) + e
*/
a = seg->Params[0];
b = seg->Params[1];
c = seg->Params[2];
d = seg->Params[3];
e = seg->Params[4];
weston_log_scope_printf(scope, "%*sy = %.2f * %.2f ^ (%.2f * x + %.2f) + %.2f\n",
15, "", a, b, c, d, e);
break;
case 108:
case -108:
/* Type 108: S-shapped
*
* y = (1 - (1 - x) ^ 1 / g) ^ 1 / g
*/
g = seg->Params[0];
weston_log_scope_printf(scope, "%*sy = (1 - (1 - x) ^ 1 / %.2f) ^ 1 / %.2f\n",
15, "", g, g);
break;
default:
weston_log_scope_printf(scope, "%*sunknown curve type\n",
15, "");
break;
}
}
static void
curve_print(const cmsToneCurve *curve, struct weston_log_scope *scope)
{
const cmsCurveSegment *seg;
unsigned int i;
weston_log_scope_printf(scope, "%*sSegments\n", 9, "");
for (i = 0; ; i++) {
seg = cmsGetToneCurveSegment(i, curve);
if (!seg)
break;
segment_print(seg, scope);
}
if (i == 0)
weston_log_scope_printf(scope, "%*sNo segments\n", 12, "");
}
static bool
are_segment_breaks_equal(float a, float b)
{
const float PRECISION = 1e-5;
if (a < -CLOSE_TO_INFINITY && b < -CLOSE_TO_INFINITY)
return true;
if (a > CLOSE_TO_INFINITY && b > CLOSE_TO_INFINITY)
return true;
if (fabs(b - a) < PRECISION)
return true;
return false;
}
static bool
are_segments_equal(const cmsCurveSegment *seg_A, const cmsCurveSegment *seg_B)
{
/* These come from the built-in supported types from LCMS. See
* segment_print() for more information. */
uint32_t types[] = {1, 2, 3, 4, 5, 6, 7, 8, 108};
uint32_t types_n_params[] = {1, 3, 4, 5, 7, 4, 5, 5, 1};
unsigned int i;
const float PRECISION = 1e-5;
int32_t n_params = -1;
if (seg_A->Type != seg_B->Type)
return false;
if (!are_segment_breaks_equal(seg_A->x0, seg_B->x0))
return false;
if (!are_segment_breaks_equal(seg_A->x1, seg_B->x1))
return false;
/* Sampled curve, so we must compare the set of samples of each segment. */
if (seg_A->Type == 0) {
if (seg_A->nGridPoints != seg_B->nGridPoints)
return false;
for (i = 0; i < seg_A->nGridPoints; i++) {
if (fabs(seg_A->SampledPoints[i] - seg_B->SampledPoints[i]) > PRECISION)
return false;
}
/* The samples are all the same, so the segments are equal. */
return true;
}
/* Parametric curve. Determine the number of params that we should
* compare. */
for (i = 0; i < ARRAY_LENGTH(types); i++) {
if (types[i] == abs(seg_A->Type)) {
n_params = types_n_params[i];
break;
}
}
/* The curve is unknown to us, so it's reasonable to assume the segments
* are not equal. */
if (n_params < 0)
return false;
/* Compare the parameters from the segments. */
for (i = 0; i < (uint32_t)n_params; i++) {
if (fabs(seg_A->Params[i] - seg_B->Params[i]) > PRECISION)
return false;
}
/* The parameters are all the same, so the segments are equal. */
return true;
}
static bool
are_curves_equal(cmsToneCurve *curve_A, cmsToneCurve *curve_B)
{
unsigned int i;
const cmsCurveSegment *seg_A, *seg_B;
/* Curves point to the same address, so they are the same. */
if (curve_A == curve_B)
return true;
for (i = 0; ; i++) {
seg_A = cmsGetToneCurveSegment(i, curve_A);
seg_B = cmsGetToneCurveSegment(i, curve_B);
/* The number of segments in A and B are different, so the
* curves are not equal. */
if ((seg_A == NULL) != (seg_B == NULL))
return false;
/* No more segments to compare. */
if (!seg_A && !seg_B)
break;
if (!are_segments_equal(seg_A, seg_B))
return false;
}
/* We exhausted the pair of segments from the curves and they all do
* match, so the curves are equal. */
return true;
}
static void
curve_set_print(cmsStage *stage, struct weston_log_scope *scope)
{
const _cmsStageToneCurvesData *data;
uint32_t already_printed = 0;
unsigned int i, j;
assert(cmsStageType(stage) == cmsSigCurveSetElemType);
data = cmsStageData(stage);
if (data->nCurves == 0) {
weston_log_scope_printf(scope, "%*sNo curves in the set\n", 6, "");
return;
}
/* We can have multiple curves that are the same. So we print their
* indices and print the curve content only once. */
for (i = 0; i < data->nCurves; i++) {
if (((already_printed >> i) & 1) == 1)
continue;
weston_log_scope_printf(scope, "%*sCurve(s) %u", 6, "", i);
already_printed |= (1 << i);
for (j = i + 1; j < data->nCurves; j++) {
/* We are only printing indices of the curves that are
* the same as curve i. */
if (!are_curves_equal(data->TheCurves[i], data->TheCurves[j]))
continue;
weston_log_scope_printf(scope, ", %u", j);
already_printed |= (1 << j);
}
weston_log_scope_printf(scope, "\n");
curve_print(data->TheCurves[i], scope);
}
}
#else
static void
curve_set_print(cmsStage *stage, struct weston_log_scope *scope)
{
weston_log_scope_printf(scope, "%*scmsGetToneCurveSegment() symbol not " \
"found, so can't print curve set\n", 6, "");
}
#endif
static void
pipeline_print(cmsPipeline **lut, cmsContext context_id,
struct weston_log_scope *scope)
......@@ -1041,7 +709,7 @@ pipeline_print(cmsPipeline **lut, cmsContext context_id,
return;
if (!stage) {
weston_log_scope_printf(scope, "no elements\n");
weston_log_scope_printf(scope, " no elements\n");
return;
}
......@@ -1059,7 +727,7 @@ pipeline_print(cmsPipeline **lut, cmsContext context_id,
matrix_print(stage, scope);
break;
case cmsSigCurveSetElemType:
curve_set_print(stage, scope);
curveset_print(stage, scope);
break;
default:
break;
......
libweston/color-lcms/meson.build
View file @ 25ffc4ae
......@@ -6,14 +6,20 @@ if not dep_lcms2.found()
error('color-lcms plugin requires lcms2 which was not found. Or, you can use \'-Dcolor-management-lcms=false\'.')
endif
has_function_cmsGetToneCurveSegment = cc.has_function('cmsGetToneCurveSegment',
dependencies: dep_lcms2)
config_h.set10('HAVE_CMS_GET_TONE_CURVE_SEGMENT',
cc.has_function('cmsGetToneCurveSegment', dependencies : dep_lcms2))
has_function_cmsGetToneCurveSegment)
srcs_color_lcms = [
'color-lcms.c',
'color-profile.c',
'color-transform.c',
]
if (has_function_cmsGetToneCurveSegment)
srcs_color_lcms += 'color-curve-segments.c'
endif
deps_color_lcms = [
dep_libm,
......
tests/color-lcms-optimizer-test.c 0 → 100644
View file @ 25ffc4ae
/*
* Copyright 2023 Collabora, Ltd.
*
* 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 (including the
* next paragraph) 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 "config.h"
#include <lcms2_plugin.h>
#include "weston-test-client-helper.h"
#include "libweston/color-lcms/color-lcms.h"
#include "libweston/color-lcms/color-curve-segments.h"
#define N_CHANNELS 3
#define PRECISION 1e-4
struct pipeline_context {
cmsContext context_id;
cmsPipeline *pipeline;
};
struct curve {
cmsInt32Number type;
cmsFloat64Number params[10];
};
/* Parametric power-law curve with nothing special. */
const struct curve power_law_curve_A = {
.type = 1,
.params = {2.0},
};
/* Inverse power-law curve with another gamma value. */
const struct curve power_law_curve_B = {
.type = -1,
.params = {8.0},
};
/* Parametric type 4 comes from IEC 61966-2.1 (sRGB). */
const struct curve srgb_curve = {
.type = 4,
.params = {2.4, 1.0/1.055, 0.055/1.055, 1.0/12.92, 0.04045},
};
/* Identity matrix. */
const cmsFloat64Number identity_matrix[N_CHANNELS * N_CHANNELS] = {
1.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 1.0,
};
/* Matrix with no special characteristics. */
const cmsFloat64Number regular_matrix[N_CHANNELS * N_CHANNELS] = {
1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0,
};
/* Inverse matrices (matrix_A * matrix_A_inverse == identity). */
const cmsFloat64Number matrix_A[N_CHANNELS * N_CHANNELS] = {
0.218024, 0.192559, 0.071524,
0.111244, 0.358458, 0.030306,
0.006960, 0.048534, 0.356962,
};
const cmsFloat64Number matrix_A_inverse[N_CHANNELS * N_CHANNELS] = {
6.268277, -3.234369, -0.981373,
-1.957467, 3.832202, 0.066866,
0.143926, -0.457981, 2.811465,
};
static struct pipeline_context
pipeline_context_new(void)
{
struct pipeline_context ret;
ret.context_id = cmsCreateContext(NULL, NULL);
assert(ret.context_id);
ret.pipeline = cmsPipelineAlloc(ret.context_id, N_CHANNELS, N_CHANNELS);
assert(ret.pipeline);
return ret;
}
static void
pipeline_context_release(struct pipeline_context *pc)
{
cmsPipelineFree(pc->pipeline);
cmsDeleteContext(pc->context_id);
}
static void
add_curve(struct pipeline_context *pc, cmsInt32Number type,
const cmsFloat64Number params[])
{
cmsToneCurve *curveset[N_CHANNELS];
cmsToneCurve *curve;
cmsStage *stage;
unsigned int i;
curve = cmsBuildParametricToneCurve(pc->context_id, type, params);
assert(curve);
for (i = 0; i < N_CHANNELS; i++)
curveset[i] = curve;
stage = cmsStageAllocToneCurves(pc->context_id, ARRAY_LENGTH(curveset), curveset);
assert(stage);
assert(cmsPipelineInsertStage(pc->pipeline, cmsAT_END, stage));
cmsFreeToneCurve(curve);
}
static void
add_identity_curve(struct pipeline_context *pc)
{
cmsStage *stage;
stage = cmsStageAllocToneCurves(pc->context_id, N_CHANNELS, NULL);
assert(stage);
assert(cmsPipelineInsertStage(pc->pipeline, cmsAT_END, stage));
}
static void
add_matrix(struct pipeline_context *pc,
const cmsFloat64Number matrix[] /* row-major matrix */)
{
cmsStage *stage;
stage = cmsStageAllocMatrix(pc->context_id, N_CHANNELS, N_CHANNELS, matrix, NULL);
assert(stage);
assert(cmsPipelineInsertStage(pc->pipeline, cmsAT_END, stage));
}
static bool
are_matrices_equal(const cmsFloat64Number matrix_A[N_CHANNELS * N_CHANNELS],
const cmsFloat64Number matrix_B[N_CHANNELS * N_CHANNELS])
{
unsigned int i;
for (i = 0; i < N_CHANNELS * N_CHANNELS; i++)
if (fabs(matrix_A[i] - matrix_B[i]) > PRECISION)
return false;
return true;
}
/* Pipeline with a regular matrix. Nothing should change. */
TEST(keep_regular_matrix)
{
struct pipeline_context pc = pipeline_context_new();
const _cmsStageMatrixData *data;
cmsStage *elem;
add_matrix(&pc, regular_matrix);
lcms_optimize_pipeline(&pc.pipeline, pc.context_id);
elem = cmsPipelineGetPtrToFirstStage(pc.pipeline);
assert(elem);
data = cmsStageData(elem);
assert(are_matrices_equal(regular_matrix, data->Double));
assert(!cmsStageNext(elem));
pipeline_context_release(&pc);
}
/* Pipeline with a identity matrix, which should be removed. */
TEST(drop_identity_matrix)
{
struct pipeline_context pc = pipeline_context_new();
add_matrix(&pc, identity_matrix);
lcms_optimize_pipeline(&pc.pipeline, pc.context_id);
assert(cmsPipelineStageCount(pc.pipeline) == 0);
pipeline_context_release(&pc);
}
/* Pipeline with two inverse matrices. When merged they become identity, which
* should be removed. */
TEST(drop_inverse_matrices)
{
struct pipeline_context pc = pipeline_context_new();
add_matrix(&pc, matrix_A);
add_matrix(&pc, matrix_A_inverse);
lcms_optimize_pipeline(&pc.pipeline, pc.context_id);
assert(cmsPipelineStageCount(pc.pipeline) == 0);
pipeline_context_release(&pc);
}
/* Pipeline with an identity and two inverse matrices. Pipeline must be empty
* afterwards. */
TEST(drop_identity_and_inverse_matrices)
{
struct pipeline_context pc = pipeline_context_new();
add_matrix(&pc, identity_matrix);
add_matrix(&pc, matrix_A);
add_matrix(&pc, matrix_A_inverse);
lcms_optimize_pipeline(&pc.pipeline, pc.context_id);
assert(cmsPipelineStageCount(pc.pipeline) == 0);
pipeline_context_release(&pc);
}
/* Pipeline has a regular matrix followed by two inverses, which should be
* removed. Pipeline must contain only the regular matrix afterwards. */
TEST(only_drop_inverse_matrices)
{
struct pipeline_context pc = pipeline_context_new();
const _cmsStageMatrixData *data;
cmsStage *elem;
add_matrix(&pc, regular_matrix);
add_matrix(&pc, matrix_A);
add_matrix(&pc, matrix_A_inverse);
lcms_optimize_pipeline(&pc.pipeline, pc.context_id);
elem = cmsPipelineGetPtrToFirstStage(pc.pipeline);
assert(elem);
data = cmsStageData(elem);
assert(are_matrices_equal(regular_matrix, data->Double));
assert(!cmsStageNext(elem));
pipeline_context_release(&pc);
}
/* Same as above, but the regular matrix is the last element. */
TEST(only_drop_inverse_matrices_another_order)
{
struct pipeline_context pc = pipeline_context_new();
const _cmsStageMatrixData *data;
cmsStage *elem;
add_matrix(&pc, matrix_A);
add_matrix(&pc, matrix_A_inverse);
add_matrix(&pc, regular_matrix);
lcms_optimize_pipeline(&pc.pipeline, pc.context_id);
elem = cmsPipelineGetPtrToFirstStage(pc.pipeline);
assert(elem);
data = cmsStageData(elem);
assert(are_matrices_equal(regular_matrix, data->Double));
assert(!cmsStageNext(elem));
pipeline_context_release(&pc);
}
/* Pipeline has an identity curve, which should be removed. */
TEST(drop_identity_curve)
{
struct pipeline_context pc = pipeline_context_new();
add_identity_curve(&pc);
lcms_optimize_pipeline(&pc.pipeline, pc.context_id);
assert(cmsPipelineStageCount(pc.pipeline) == 0);
pipeline_context_release(&pc);
}
/* Pipeline has two parametric curves that are inverse. So they should be
* removed from the pipeline. */
TEST(drop_inverse_curves)
{
struct pipeline_context pc = pipeline_context_new();
add_curve(&pc, srgb_curve.type, srgb_curve.params);
add_curve(&pc, -srgb_curve.type, srgb_curve.params);
lcms_optimize_pipeline(&pc.pipeline, pc.context_id);
assert(cmsPipelineStageCount(pc.pipeline) == 0);
pipeline_context_release(&pc);
}
/* Pipeline has two parametric inverse curves followed by an identity. Pipeline
* should be empty afterwards. */
TEST(drop_identity_and_inverse_curves)
{
struct pipeline_context pc = pipeline_context_new();
add_identity_curve(&pc);
add_curve(&pc, srgb_curve.type, srgb_curve.params);
add_curve(&pc, -srgb_curve.type, srgb_curve.params);
lcms_optimize_pipeline(&pc.pipeline, pc.context_id);
assert(cmsPipelineStageCount(pc.pipeline) == 0);
pipeline_context_release(&pc);
}
/* Same as above, but the identity is the last element. */
TEST(drop_identity_and_inverse_curves_another_order)
{
struct pipeline_context pc = pipeline_context_new();
add_curve(&pc, srgb_curve.type, srgb_curve.params);
add_curve(&pc, -srgb_curve.type, srgb_curve.params);
add_identity_curve(&pc);
lcms_optimize_pipeline(&pc.pipeline, pc.context_id);
assert(cmsPipelineStageCount(pc.pipeline) == 0);
pipeline_context_release(&pc);
}
#if HAVE_CMS_GET_TONE_CURVE_SEGMENT
static bool
are_curveset_curves_equal_to_curve(struct pipeline_context *pc,
const _cmsStageToneCurvesData *curveset_data,
const struct curve *curve)
{
unsigned int i;
bool ret = true;
cmsToneCurve *cms_curve =
cmsBuildParametricToneCurve(pc->context_id, curve->type,
curve->params);
assert(curveset_data->nCurves == N_CHANNELS);
for (i = 0; i < N_CHANNELS; i++) {
if (!are_curves_equal(curveset_data->TheCurves[i], cms_curve)) {
ret = false;
break;
}
}
cmsFreeToneCurve(cms_curve);
return ret;
}
/* Pipeline with a regular curve. Nothing should change. */
TEST(keep_regular_curve)
{
struct pipeline_context pc = pipeline_context_new();
cmsStage *stage;
add_curve(&pc, power_law_curve_A.type, power_law_curve_A.params);
lcms_optimize_pipeline(&pc.pipeline, pc.context_id);
stage = cmsPipelineGetPtrToFirstStage(pc.pipeline);
assert(stage);
assert(are_curveset_curves_equal_to_curve(&pc, cmsStageData(stage),
&power_law_curve_A));
assert(!cmsStageNext(stage));
pipeline_context_release(&pc);
}
/* Inverse curves followed by a parametric curve. Inverse curves are dropped (as
* they would become identity if merged), and parametric curve should not be
* changed. */
TEST(do_not_merge_identity_with_parametric)
{
struct pipeline_context pc = pipeline_context_new();
cmsStage *stage;
add_curve(&pc, srgb_curve.type, srgb_curve.params);
add_curve(&pc, -srgb_curve.type, srgb_curve.params);
add_curve(&pc, srgb_curve.type, srgb_curve.params);
lcms_optimize_pipeline(&pc.pipeline, pc.context_id);
stage = cmsPipelineGetPtrToFirstStage(pc.pipeline);
assert(stage);
assert(are_curveset_curves_equal_to_curve(&pc, cmsStageData(stage),
&srgb_curve));
assert(!cmsStageNext(stage));
pipeline_context_release(&pc);
}
/* Merge power-law function with itself. */
TEST(merge_power_law_curves_with_itself)
{
struct pipeline_context pc = pipeline_context_new();
cmsStage *stage;
struct curve result_curve;
add_curve(&pc, power_law_curve_A.type, power_law_curve_A.params);
add_curve(&pc, power_law_curve_A.type, power_law_curve_A.params);
memset(&result_curve, 0, sizeof(result_curve));
result_curve.type = power_law_curve_A.type;
result_curve.params[0] = power_law_curve_A.params[0] * power_law_curve_A.params[0];
lcms_optimize_pipeline(&pc.pipeline, pc.context_id);
stage = cmsPipelineGetPtrToFirstStage(pc.pipeline);
assert(stage);
assert(are_curveset_curves_equal_to_curve(&pc, cmsStageData(stage),
&result_curve));
assert(!cmsStageNext(stage));
pipeline_context_release(&pc);
}
/* Merge power-law functions into a single parametric one of the same type. */
TEST(merge_power_law_curves_with_another)
{
struct pipeline_context pc = pipeline_context_new();
cmsStage *stage;
struct curve result_curve;
add_curve(&pc, power_law_curve_A.type, power_law_curve_A.params);
add_curve(&pc, power_law_curve_B.type, power_law_curve_B.params);
memset(&result_curve, 0, sizeof(result_curve));
result_curve.type = power_law_curve_A.type;
result_curve.params[0] = power_law_curve_A.params[0] / power_law_curve_B.params[0];
lcms_optimize_pipeline(&pc.pipeline, pc.context_id);
stage = cmsPipelineGetPtrToFirstStage(pc.pipeline);
assert(stage);
assert(are_curveset_curves_equal_to_curve(&pc, cmsStageData(stage),
&result_curve));
assert(!cmsStageNext(stage));
pipeline_context_release(&pc);
}
#endif /* HAVE_CMS_GET_TONE_CURVE_SEGMENT */
tests/meson.build
View file @ 25ffc4ae
......@@ -301,6 +301,11 @@ if get_option('color-management-lcms')
'name': 'color-icc-output',
'dep_objs': [ dep_libm, dep_lcms_util ]
},
{
'name': 'color-lcms-optimizer',
'link_with': plugin_color_lcms,
'dep_objs': [ dep_lcms_util ]
},
{ 'name': 'color-metadata-parsing' },
{
'name': 'lcms-util',
......