/home/daniel/Projects/java/jdk/src/java.desktop/share/native/liblcms/cmsopt.c

Bug Summary

File:	jdk/src/java.desktop/share/native/liblcms/cmsopt.c
Warning:	line 1161, column 13 Access to field 'Table16' results in a dereference of a null pointer
Annotated Source Code

Press '?' to see keyboard shortcuts
Show analyzer invocation
clang -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name cmsopt.c -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model pic -pic-level 2 -mthread-model posix -fno-delete-null-pointer-checks -mframe-pointer=all -relaxed-aliasing -fmath-errno -fno-rounding-math -masm-verbose -mconstructor-aliases -munwind-tables -target-cpu x86-64 -dwarf-column-info -fno-split-dwarf-inlining -debugger-tuning=gdb -resource-dir /usr/lib/llvm-10/lib/clang/10.0.0 -I /home/daniel/Projects/java/jdk/build/linux-x86_64-server-fastdebug/support/modules_include/java.base -I /home/daniel/Projects/java/jdk/build/linux-x86_64-server-fastdebug/support/modules_include/java.base/linux -I /home/daniel/Projects/java/jdk/src/java.base/share/native/libjava -I /home/daniel/Projects/java/jdk/src/java.base/unix/native/libjava -I /home/daniel/Projects/java/jdk/src/hotspot/share/include -I /home/daniel/Projects/java/jdk/src/hotspot/os/posix/include -D LIBC=gnu -D _GNU_SOURCE -D _REENTRANT -D _LARGEFILE64_SOURCE -D LINUX -D DEBUG -D _LITTLE_ENDIAN -D ARCH="amd64" -D amd64 -D _LP64=1 -D CMS_DONT_USE_FAST_FLOOR -I /home/daniel/Projects/java/jdk/src/java.desktop/share/native/liblcms -I /home/daniel/Projects/java/jdk/build/linux-x86_64-server-fastdebug/support/headers/java.desktop -I /home/daniel/Projects/java/jdk/src/java.desktop/share/native/common/awt/debug -I /home/daniel/Projects/java/jdk/src/java.desktop/unix/native/libawt/java2d -I /home/daniel/Projects/java/jdk/src/java.desktop/share/native/libawt/java2d -D _FORTIFY_SOURCE=2 -internal-isystem /usr/local/include -internal-isystem /usr/lib/llvm-10/lib/clang/10.0.0/include -internal-externc-isystem /usr/include/x86_64-linux-gnu -internal-externc-isystem /include -internal-externc-isystem /usr/include -O3 -Wno-unused-parameter -Wno-unused -Wno-format-nonliteral -Wno-type-limits -Wno-misleading-indentation -Wno-undef -Wno-unused-function -Wno-stringop-truncation -std=c99 -fdebug-compilation-dir /home/daniel/Projects/java/jdk/make -ferror-limit 19 -fmessage-length 0 -fvisibility hidden -stack-protector 1 -fgnuc-version=4.2.1 -fobjc-runtime=gcc -fdiagnostics-show-option -vectorize-loops -vectorize-slp -analyzer-output=html -faddrsig -o /home/daniel/Projects/java/scan/2021-12-21-193737-8510-1 -x c /home/daniel/Projects/java/jdk/src/java.desktop/share/native/liblcms/cmsopt.c
1/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.  Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/

25// This file is available under and governed by the GNU General Public
26// License version 2 only, as published by the Free Software Foundation.
27// However, the following notice accompanied the original version of this
28// file:
29//
30//---------------------------------------------------------------------------------
31//
32//  Little Color Management System
33//  Copyright (c) 1998-2020 Marti Maria Saguer
34//
35// Permission is hereby granted, free of charge, to any person obtaining
36// a copy of this software and associated documentation files (the "Software"),
37// to deal in the Software without restriction, including without limitation
38// the rights to use, copy, modify, merge, publish, distribute, sublicense,
39// and/or sell copies of the Software, and to permit persons to whom the Software
40// is furnished to do so, subject to the following conditions:
41//
42// The above copyright notice and this permission notice shall be included in
43// all copies or substantial portions of the Software.
44//
45// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
46// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO
47// THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
48// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
49// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
50// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
51// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
52//
53//---------------------------------------------------------------------------------
54//

56#include "lcms2_internal.h"


59//----------------------------------------------------------------------------------

61// Optimization for 8 bits, Shaper-CLUT (3 inputs only)
62typedef struct {

  cmsContext ContextID;

  const cmsInterpParams* p;   // Tetrahedrical interpolation parameters. This is a not-owned pointer.

  cmsUInt16Number rx[256], ry[256], rz[256];
  cmsUInt32Number X0[256], Y0[256], Z0[256];  // Precomputed nodes and offsets for 8-bit input data


72} Prelin8Data;


75// Generic optimization for 16 bits Shaper-CLUT-Shaper (any inputs)
76typedef struct {

  cmsContext ContextID;

  // Number of channels
  cmsUInt32Number nInputs;
  cmsUInt32Number nOutputs;

  _cmsInterpFn16 EvalCurveIn16[MAX_INPUT_DIMENSIONS15];       // The maximum number of input channels is known in advance
  cmsInterpParams*  ParamsCurveIn16[MAX_INPUT_DIMENSIONS15];

  _cmsInterpFn16 EvalCLUT;            // The evaluator for 3D grid
  const cmsInterpParams* CLUTparams;  // (not-owned pointer)


  _cmsInterpFn16* EvalCurveOut16;       // Points to an array of curve evaluators in 16 bits (not-owned pointer)
  cmsInterpParams**  ParamsCurveOut16;  // Points to an array of references to interpolation params (not-owned pointer)


95} Prelin16Data;


98// Optimization for matrix-shaper in 8 bits. Numbers are operated in n.14 signed, tables are stored in 1.14 fixed

100typedef cmsInt32Number cmsS1Fixed14Number;   // Note that this may hold more than 16 bits!

102#define DOUBLE_TO_1FIXED14(x)((cmsS1Fixed14Number) floor((x) * 16384.0 + 0.5)) ((cmsS1Fixed14Number) floor((x) * 16384.0 + 0.5))

104typedef struct {

  cmsContext ContextID;

  cmsS1Fixed14Number Shaper1R[256];  // from 0..255 to 1.14  (0.0...1.0)
  cmsS1Fixed14Number Shaper1G[256];
  cmsS1Fixed14Number Shaper1B[256];

  cmsS1Fixed14Number Mat[3][3];     // n.14 to n.14 (needs a saturation after that)
  cmsS1Fixed14Number Off[3];

  cmsUInt16Number Shaper2R[16385];    // 1.14 to 0..255
  cmsUInt16Number Shaper2G[16385];
  cmsUInt16Number Shaper2B[16385];

119} MatShaper8Data;

121// Curves, optimization is shared between 8 and 16 bits
122typedef struct {

  cmsContext ContextID;

  cmsUInt32Number nCurves;      // Number of curves
  cmsUInt32Number nElements;    // Elements in curves
  cmsUInt16Number** Curves;     // Points to a dynamically  allocated array

130} Curves16Data;


133// Simple optimizations ----------------------------------------------------------------------------------------------------------


136// Remove an element in linked chain
137static
138void _RemoveElement(cmsStage** head)
139{
  cmsStage* mpe = *head;
  cmsStage* next = mpe ->Next;
  *head = next;
  cmsStageFree(mpe);
144}

146// Remove all identities in chain. Note that pt actually is a double pointer to the element that holds the pointer.
147static
148cmsBool _Remove1Op(cmsPipeline* Lut, cmsStageSignature UnaryOp)
149{
  cmsStage** pt = &Lut ->Elements;
  cmsBool AnyOpt = FALSE0;

  while (*pt != NULL((void*)0)) {

      if ((*pt) ->Implements == UnaryOp) {
          _RemoveElement(pt);
          AnyOpt = TRUE1;
      }
      else
          pt = &((*pt) -> Next);
  }

  return AnyOpt;
164}

166// Same, but only if two adjacent elements are found
167static
168cmsBool _Remove2Op(cmsPipeline* Lut, cmsStageSignature Op1, cmsStageSignature Op2)
169{
  cmsStage** pt1;
  cmsStage** pt2;
  cmsBool AnyOpt = FALSE0;

  pt1 = &Lut ->Elements;
  if (*pt1 == NULL((void*)0)) return AnyOpt;

  while (*pt1 != NULL((void*)0)) {

      pt2 = &((*pt1) -> Next);
      if (*pt2 == NULL((void*)0)) return AnyOpt;

      if ((*pt1) ->Implements == Op1 && (*pt2) ->Implements == Op2) {
          _RemoveElement(pt2);
          _RemoveElement(pt1);
          AnyOpt = TRUE1;
      }
      else
          pt1 = &((*pt1) -> Next);
  }

  return AnyOpt;
192}


195static
196cmsBool CloseEnoughFloat(cmsFloat64Number a, cmsFloat64Number b)
197{
     return fabs(b - a) < 0.00001f;
199}

201static
202cmsBool  isFloatMatrixIdentity(const cmsMAT3* a)
203{
     cmsMAT3 Identity;
     int i, j;

     _cmsMAT3identity(&Identity);

     for (i = 0; i < 3; i++)
            for (j = 0; j < 3; j++)
                   if (!CloseEnoughFloat(a->v[i].n[j], Identity.v[i].n[j])) return FALSE0;

     return TRUE1;
214}
215// if two adjacent matrices are found, multiply them.
216static
217cmsBool _MultiplyMatrix(cmsPipeline* Lut)
218{
     cmsStage** pt1;
     cmsStage** pt2;
     cmsStage*  chain;
     cmsBool AnyOpt = FALSE0;

     pt1 = &Lut->Elements;
     if (*pt1 == NULL((void*)0)) return AnyOpt;

     while (*pt1 != NULL((void*)0)) {

            pt2 = &((*pt1)->Next);
            if (*pt2 == NULL((void*)0)) return AnyOpt;

            if ((*pt1)->Implements == cmsSigMatrixElemType && (*pt2)->Implements == cmsSigMatrixElemType) {

                   // Get both matrices
                   _cmsStageMatrixData* m1 = (_cmsStageMatrixData*) cmsStageData(*pt1);
                   _cmsStageMatrixData* m2 = (_cmsStageMatrixData*) cmsStageData(*pt2);
                   cmsMAT3 res;

                   // Input offset and output offset should be zero to use this optimization
                   if (m1->Offset != NULL((void*)0) || m2 ->Offset != NULL((void*)0) ||
                          cmsStageInputChannels(*pt1) != 3 || cmsStageOutputChannels(*pt1) != 3 ||
                          cmsStageInputChannels(*pt2) != 3 || cmsStageOutputChannels(*pt2) != 3)
                          return FALSE0;

                   // Multiply both matrices to get the result
                   _cmsMAT3per(&res, (cmsMAT3*)m2->Double, (cmsMAT3*)m1->Double);

                   // Get the next in chain after the matrices
                   chain = (*pt2)->Next;

                   // Remove both matrices
                   _RemoveElement(pt2);
                   _RemoveElement(pt1);

                   // Now what if the result is a plain identity?
                   if (!isFloatMatrixIdentity(&res)) {

                          // We can not get rid of full matrix
                          cmsStage* Multmat = cmsStageAllocMatrix(Lut->ContextID, 3, 3, (const cmsFloat64Number*) &res, NULL((void*)0));
                          if (Multmat == NULL((void*)0)) return FALSE0;  // Should never happen

                          // Recover the chain
                          Multmat->Next = chain;
                          *pt1 = Multmat;
                   }

                   AnyOpt = TRUE1;
            }
            else
                   pt1 = &((*pt1)->Next);
     }

     return AnyOpt;
274}


277// Preoptimize just gets rif of no-ops coming paired. Conversion from v2 to v4 followed
278// by a v4 to v2 and vice-versa. The elements are then discarded.
279static
280cmsBool PreOptimize(cmsPipeline* Lut)
281{
  cmsBool AnyOpt = FALSE0, Opt;

  do {

      Opt = FALSE0;

      // Remove all identities
      Opt |= _Remove1Op(Lut, cmsSigIdentityElemType);

      // Remove XYZ2Lab followed by Lab2XYZ
      Opt |= _Remove2Op(Lut, cmsSigXYZ2LabElemType, cmsSigLab2XYZElemType);

      // Remove Lab2XYZ followed by XYZ2Lab
      Opt |= _Remove2Op(Lut, cmsSigLab2XYZElemType, cmsSigXYZ2LabElemType);

      // Remove V4 to V2 followed by V2 to V4
      Opt |= _Remove2Op(Lut, cmsSigLabV4toV2, cmsSigLabV2toV4);

      // Remove V2 to V4 followed by V4 to V2
      Opt |= _Remove2Op(Lut, cmsSigLabV2toV4, cmsSigLabV4toV2);

      // Remove float pcs Lab conversions
      Opt |= _Remove2Op(Lut, cmsSigLab2FloatPCS, cmsSigFloatPCS2Lab);

      // Remove float pcs Lab conversions
      Opt |= _Remove2Op(Lut, cmsSigXYZ2FloatPCS, cmsSigFloatPCS2XYZ);

      // Simplify matrix.
      Opt |= _MultiplyMatrix(Lut);

      if (Opt) AnyOpt = TRUE1;

  } while (Opt);

  return AnyOpt;
317}

319static
320void Eval16nop1D(CMSREGISTERregister const cmsUInt16Number Input[],
               CMSREGISTERregister cmsUInt16Number Output[],
               CMSREGISTERregister const struct _cms_interp_struc* p)
323{
  Output[0] = Input[0];

  cmsUNUSED_PARAMETER(p)((void)p);
327}

329static
330void PrelinEval16(CMSREGISTERregister const cmsUInt16Number Input[],
                CMSREGISTERregister cmsUInt16Number Output[],
                CMSREGISTERregister const void* D)
333{
  Prelin16Data* p16 = (Prelin16Data*) D;
  cmsUInt16Number  StageABC[MAX_INPUT_DIMENSIONS15];
  cmsUInt16Number  StageDEF[cmsMAXCHANNELS16];
  cmsUInt32Number i;

  for (i=0; i < p16 ->nInputs; i++) {

      p16 ->EvalCurveIn16[i](&Input[i], &StageABC[i], p16 ->ParamsCurveIn16[i]);
  }

  p16 ->EvalCLUT(StageABC, StageDEF, p16 ->CLUTparams);

  for (i=0; i < p16 ->nOutputs; i++) {

      p16 ->EvalCurveOut16[i](&StageDEF[i], &Output[i], p16 ->ParamsCurveOut16[i]);
  }
350}


353static
354void PrelinOpt16free(cmsContext ContextID, void* ptr)
355{
  Prelin16Data* p16 = (Prelin16Data*) ptr;

  _cmsFree(ContextID, p16 ->EvalCurveOut16);
  _cmsFree(ContextID, p16 ->ParamsCurveOut16);

  _cmsFree(ContextID, p16);
362}

364static
365void* Prelin16dup(cmsContext ContextID, const void* ptr)
366{
  Prelin16Data* p16 = (Prelin16Data*) ptr;
  Prelin16Data* Duped = (Prelin16Data*) _cmsDupMem(ContextID, p16, sizeof(Prelin16Data));

  if (Duped == NULL((void*)0)) return NULL((void*)0);

  Duped->EvalCurveOut16 = (_cmsInterpFn16*) _cmsDupMem(ContextID, p16->EvalCurveOut16, p16->nOutputs * sizeof(_cmsInterpFn16));
  Duped->ParamsCurveOut16 = (cmsInterpParams**)_cmsDupMem(ContextID, p16->ParamsCurveOut16, p16->nOutputs * sizeof(cmsInterpParams*));

  return Duped;
376}


379static
380Prelin16Data* PrelinOpt16alloc(cmsContext ContextID,
                             const cmsInterpParams* ColorMap,
                             cmsUInt32Number nInputs, cmsToneCurve** In,
                             cmsUInt32Number nOutputs, cmsToneCurve** Out )
384{
  cmsUInt32Number i;
  Prelin16Data* p16 = (Prelin16Data*)_cmsMallocZero(ContextID, sizeof(Prelin16Data));
  if (p16 == NULL((void*)0)) return NULL((void*)0);

  p16 ->nInputs = nInputs;
  p16 ->nOutputs = nOutputs;


  for (i=0; i < nInputs; i++) {

      if (In == NULL((void*)0)) {
          p16 -> ParamsCurveIn16[i] = NULL((void*)0);
          p16 -> EvalCurveIn16[i] = Eval16nop1D;

      }
      else {
          p16 -> ParamsCurveIn16[i] = In[i] ->InterpParams;
          p16 -> EvalCurveIn16[i] = p16 ->ParamsCurveIn16[i]->Interpolation.Lerp16;
      }
  }

  p16 ->CLUTparams = ColorMap;
  p16 ->EvalCLUT   = ColorMap ->Interpolation.Lerp16;


  p16 -> EvalCurveOut16 = (_cmsInterpFn16*) _cmsCalloc(ContextID, nOutputs, sizeof(_cmsInterpFn16));
  if (p16->EvalCurveOut16 == NULL((void*)0))
  {
      _cmsFree(ContextID, p16);
      return NULL((void*)0);
  }

  p16 -> ParamsCurveOut16 = (cmsInterpParams**) _cmsCalloc(ContextID, nOutputs, sizeof(cmsInterpParams* ));
  if (p16->ParamsCurveOut16 == NULL((void*)0))
  {

      _cmsFree(ContextID, p16->EvalCurveOut16);
      _cmsFree(ContextID, p16);
      return NULL((void*)0);
  }

  for (i=0; i < nOutputs; i++) {

      if (Out == NULL((void*)0)) {
          p16 ->ParamsCurveOut16[i] = NULL((void*)0);
          p16 -> EvalCurveOut16[i] = Eval16nop1D;
      }
      else {

          p16 ->ParamsCurveOut16[i] = Out[i] ->InterpParams;
          p16 -> EvalCurveOut16[i] = p16 ->ParamsCurveOut16[i]->Interpolation.Lerp16;
      }
  }

  return p16;
440}



444// Resampling ---------------------------------------------------------------------------------

446#define PRELINEARIZATION_POINTS4096 4096

448// Sampler implemented by another LUT. This is a clean way to precalculate the devicelink 3D CLUT for
449// almost any transform. We use floating point precision and then convert from floating point to 16 bits.
450static
451cmsInt32Number XFormSampler16(CMSREGISTERregister const cmsUInt16Number In[],
                            CMSREGISTERregister cmsUInt16Number Out[],
                            CMSREGISTERregister void* Cargo)
454{
  cmsPipeline* Lut = (cmsPipeline*) Cargo;
  cmsFloat32Number InFloat[cmsMAXCHANNELS16], OutFloat[cmsMAXCHANNELS16];
  cmsUInt32Number i;

  _cmsAssert(Lut -> InputChannels < cmsMAXCHANNELS)(((Lut -> InputChannels < 16)) ? (void) (0) : __assert_fail
 ("(Lut -> InputChannels < 16)", "/home/daniel/Projects/java/jdk/src/java.desktop/share/native/liblcms/cmsopt.c"
, 459, __extension__ __PRETTY_FUNCTION__));
  _cmsAssert(Lut -> OutputChannels < cmsMAXCHANNELS)(((Lut -> OutputChannels < 16)) ? (void) (0) : __assert_fail
 ("(Lut -> OutputChannels < 16)", "/home/daniel/Projects/java/jdk/src/java.desktop/share/native/liblcms/cmsopt.c"
, 460, __extension__ __PRETTY_FUNCTION__));

  // From 16 bit to floating point
  for (i=0; i < Lut ->InputChannels; i++)
      InFloat[i] = (cmsFloat32Number) (In[i] / 65535.0);

  // Evaluate in floating point
  cmsPipelineEvalFloat(InFloat, OutFloat, Lut);

  // Back to 16 bits representation
  for (i=0; i < Lut ->OutputChannels; i++)
      Out[i] = _cmsQuickSaturateWord(OutFloat[i] * 65535.0);

  // Always succeed
  return TRUE1;
475}

477// Try to see if the curves of a given MPE are linear
478static
479cmsBool AllCurvesAreLinear(cmsStage* mpe)
480{
  cmsToneCurve** Curves;
  cmsUInt32Number i, n;

  Curves = _cmsStageGetPtrToCurveSet(mpe);
  if (Curves == NULL((void*)0)) return FALSE0;

  n = cmsStageOutputChannels(mpe);

  for (i=0; i < n; i++) {
      if (!cmsIsToneCurveLinear(Curves[i])) return FALSE0;
  }

  return TRUE1;
494}

496// This function replaces a specific node placed in "At" by the "Value" numbers. Its purpose
497// is to fix scum dot on broken profiles/transforms. Works on 1, 3 and 4 channels
498static
499cmsBool  PatchLUT(cmsStage* CLUT, cmsUInt16Number At[], cmsUInt16Number Value[],
                cmsUInt32Number nChannelsOut, cmsUInt32Number nChannelsIn)
501{
  _cmsStageCLutData* Grid = (_cmsStageCLutData*) CLUT ->Data;
  cmsInterpParams* p16  = Grid ->Params;
  cmsFloat64Number px, py, pz, pw;
  int        x0, y0, z0, w0;
  int        i, index;

  if (CLUT -> Type != cmsSigCLutElemType) {
      cmsSignalError(CLUT->ContextID, cmsERROR_INTERNAL3, "(internal) Attempt to PatchLUT on non-lut stage");
      return FALSE0;
  }

  if (nChannelsIn == 4) {

      px = ((cmsFloat64Number) At[0] * (p16->Domain[0])) / 65535.0;
      py = ((cmsFloat64Number) At[1] * (p16->Domain[1])) / 65535.0;
      pz = ((cmsFloat64Number) At[2] * (p16->Domain[2])) / 65535.0;
      pw = ((cmsFloat64Number) At[3] * (p16->Domain[3])) / 65535.0;

      x0 = (int) floor(px);
      y0 = (int) floor(py);
      z0 = (int) floor(pz);
      w0 = (int) floor(pw);

      if (((px - x0) != 0) ||
          ((py - y0) != 0) ||
          ((pz - z0) != 0) ||
          ((pw - w0) != 0)) return FALSE0; // Not on exact node

      index = (int) p16 -> opta[3] * x0 +
              (int) p16 -> opta[2] * y0 +
              (int) p16 -> opta[1] * z0 +
              (int) p16 -> opta[0] * w0;
  }
  else
      if (nChannelsIn == 3) {

          px = ((cmsFloat64Number) At[0] * (p16->Domain[0])) / 65535.0;
          py = ((cmsFloat64Number) At[1] * (p16->Domain[1])) / 65535.0;
          pz = ((cmsFloat64Number) At[2] * (p16->Domain[2])) / 65535.0;

          x0 = (int) floor(px);
          y0 = (int) floor(py);
          z0 = (int) floor(pz);

          if (((px - x0) != 0) ||
              ((py - y0) != 0) ||
              ((pz - z0) != 0)) return FALSE0;  // Not on exact node

          index = (int) p16 -> opta[2] * x0 +
                  (int) p16 -> opta[1] * y0 +
                  (int) p16 -> opta[0] * z0;
      }
      else
          if (nChannelsIn == 1) {

              px = ((cmsFloat64Number) At[0] * (p16->Domain[0])) / 65535.0;

              x0 = (int) floor(px);

              if (((px - x0) != 0)) return FALSE0; // Not on exact node

              index = (int) p16 -> opta[0] * x0;
          }
          else {
              cmsSignalError(CLUT->ContextID, cmsERROR_INTERNAL3, "(internal) %d Channels are not supported on PatchLUT", nChannelsIn);
              return FALSE0;
          }

  for (i = 0; i < (int) nChannelsOut; i++)
      Grid->Tab.T[index + i] = Value[i];

  return TRUE1;
574}

576// Auxiliary, to see if two values are equal or very different
577static
578cmsBool WhitesAreEqual(cmsUInt32Number n, cmsUInt16Number White1[], cmsUInt16Number White2[] )
579{
  cmsUInt32Number i;

  for (i=0; i < n; i++) {

      if (abs(White1[i] - White2[i]) > 0xf000) return TRUE1;  // Values are so extremely different that the fixup should be avoided
      if (White1[i] != White2[i]) return FALSE0;
  }
  return TRUE1;
588}


591// Locate the node for the white point and fix it to pure white in order to avoid scum dot.
592static
593cmsBool FixWhiteMisalignment(cmsPipeline* Lut, cmsColorSpaceSignature EntryColorSpace, cmsColorSpaceSignature ExitColorSpace)
594{
  cmsUInt16Number *WhitePointIn, *WhitePointOut;
  cmsUInt16Number  WhiteIn[cmsMAXCHANNELS16], WhiteOut[cmsMAXCHANNELS16], ObtainedOut[cmsMAXCHANNELS16];
  cmsUInt32Number i, nOuts, nIns;
  cmsStage *PreLin = NULL((void*)0), *CLUT = NULL((void*)0), *PostLin = NULL((void*)0);

  if (!_cmsEndPointsBySpace(EntryColorSpace,
      &WhitePointIn, NULL((void*)0), &nIns)) return FALSE0;

  if (!_cmsEndPointsBySpace(ExitColorSpace,
      &WhitePointOut, NULL((void*)0), &nOuts)) return FALSE0;

  // It needs to be fixed?
  if (Lut ->InputChannels != nIns) return FALSE0;
  if (Lut ->OutputChannels != nOuts) return FALSE0;

  cmsPipelineEval16(WhitePointIn, ObtainedOut, Lut);

  if (WhitesAreEqual(nOuts, WhitePointOut, ObtainedOut)) return TRUE1; // whites already match

  // Check if the LUT comes as Prelin, CLUT or Postlin. We allow all combinations
  if (!cmsPipelineCheckAndRetreiveStages(Lut, 3, cmsSigCurveSetElemType, cmsSigCLutElemType, cmsSigCurveSetElemType, &PreLin, &CLUT, &PostLin))
      if (!cmsPipelineCheckAndRetreiveStages(Lut, 2, cmsSigCurveSetElemType, cmsSigCLutElemType, &PreLin, &CLUT))
          if (!cmsPipelineCheckAndRetreiveStages(Lut, 2, cmsSigCLutElemType, cmsSigCurveSetElemType, &CLUT, &PostLin))
              if (!cmsPipelineCheckAndRetreiveStages(Lut, 1, cmsSigCLutElemType, &CLUT))
                  return FALSE0;

  // We need to interpolate white points of both, pre and post curves
  if (PreLin) {

      cmsToneCurve** Curves = _cmsStageGetPtrToCurveSet(PreLin);

      for (i=0; i < nIns; i++) {
          WhiteIn[i] = cmsEvalToneCurve16(Curves[i], WhitePointIn[i]);
      }
  }
  else {
      for (i=0; i < nIns; i++)
          WhiteIn[i] = WhitePointIn[i];
  }

  // If any post-linearization, we need to find how is represented white before the curve, do
  // a reverse interpolation in this case.
  if (PostLin) {

      cmsToneCurve** Curves = _cmsStageGetPtrToCurveSet(PostLin);

      for (i=0; i < nOuts; i++) {

          cmsToneCurve* InversePostLin = cmsReverseToneCurve(Curves[i]);
          if (InversePostLin == NULL((void*)0)) {
              WhiteOut[i] = WhitePointOut[i];

          } else {

              WhiteOut[i] = cmsEvalToneCurve16(InversePostLin, WhitePointOut[i]);
              cmsFreeToneCurve(InversePostLin);
          }
      }
  }
  else {
      for (i=0; i < nOuts; i++)
          WhiteOut[i] = WhitePointOut[i];
  }

  // Ok, proceed with patching. May fail and we don't care if it fails
  PatchLUT(CLUT, WhiteIn, WhiteOut, nOuts, nIns);

  return TRUE1;
663}

665// -----------------------------------------------------------------------------------------------------------------------------------------------
666// This function creates simple LUT from complex ones. The generated LUT has an optional set of
667// prelinearization curves, a CLUT of nGridPoints and optional postlinearization tables.
668// These curves have to exist in the original LUT in order to be used in the simplified output.
669// Caller may also use the flags to allow this feature.
670// LUTS with all curves will be simplified to a single curve. Parametric curves are lost.
671// This function should be used on 16-bits LUTS only, as floating point losses precision when simplified
672// -----------------------------------------------------------------------------------------------------------------------------------------------

674static
675cmsBool OptimizeByResampling(cmsPipeline** Lut, cmsUInt32Number Intent, cmsUInt32Number* InputFormat, cmsUInt32Number* OutputFormat, cmsUInt32Number* dwFlags)
676{
  cmsPipeline* Src = NULL((void*)0);
  cmsPipeline* Dest = NULL((void*)0);
  cmsStage* mpe;
  cmsStage* CLUT;
  cmsStage *KeepPreLin = NULL((void*)0), *KeepPostLin = NULL((void*)0);
  cmsUInt32Number nGridPoints;
  cmsColorSpaceSignature ColorSpace, OutputColorSpace;
  cmsStage *NewPreLin = NULL((void*)0);
  cmsStage *NewPostLin = NULL((void*)0);
  _cmsStageCLutData* DataCLUT;
  cmsToneCurve** DataSetIn;
  cmsToneCurve** DataSetOut;
  Prelin16Data* p16;

  // This is a lossy optimization! does not apply in floating-point cases
  if (_cmsFormatterIsFloat(*InputFormat) || _cmsFormatterIsFloat(*OutputFormat)) return FALSE0;

  ColorSpace       = _cmsICCcolorSpace((int) T_COLORSPACE(*InputFormat)(((*InputFormat)>>16)&31));
  OutputColorSpace = _cmsICCcolorSpace((int) T_COLORSPACE(*OutputFormat)(((*OutputFormat)>>16)&31));

  // Color space must be specified
  if (ColorSpace == (cmsColorSpaceSignature)0 ||
      OutputColorSpace == (cmsColorSpaceSignature)0) return FALSE0;

  nGridPoints      = _cmsReasonableGridpointsByColorspace(ColorSpace, *dwFlags);

  // For empty LUTs, 2 points are enough
  if (cmsPipelineStageCount(*Lut) == 0)
      nGridPoints = 2;

  Src = *Lut;

  // Named color pipelines cannot be optimized either
  for (mpe = cmsPipelineGetPtrToFirstStage(Src);
      mpe != NULL((void*)0);
      mpe = cmsStageNext(mpe)) {
          if (cmsStageType(mpe) == cmsSigNamedColorElemType) return FALSE0;
  }

  // Allocate an empty LUT
  Dest =  cmsPipelineAlloc(Src ->ContextID, Src ->InputChannels, Src ->OutputChannels);
  if (!Dest) return FALSE0;

  // Prelinearization tables are kept unless indicated by flags
  if (*dwFlags & cmsFLAGS_CLUT_PRE_LINEARIZATION0x0010) {

      // Get a pointer to the prelinearization element
      cmsStage* PreLin = cmsPipelineGetPtrToFirstStage(Src);

      // Check if suitable
      if (PreLin && PreLin ->Type == cmsSigCurveSetElemType) {

          // Maybe this is a linear tram, so we can avoid the whole stuff
          if (!AllCurvesAreLinear(PreLin)) {

              // All seems ok, proceed.
              NewPreLin = cmsStageDup(PreLin);
              if(!cmsPipelineInsertStage(Dest, cmsAT_BEGIN, NewPreLin))
                  goto Error;

              // Remove prelinearization. Since we have duplicated the curve
              // in destination LUT, the sampling should be applied after this stage.
              cmsPipelineUnlinkStage(Src, cmsAT_BEGIN, &KeepPreLin);
          }
      }
  }

  // Allocate the CLUT
  CLUT = cmsStageAllocCLut16bit(Src ->ContextID, nGridPoints, Src ->InputChannels, Src->OutputChannels, NULL((void*)0));
  if (CLUT == NULL((void*)0)) goto Error;

  // Add the CLUT to the destination LUT
  if (!cmsPipelineInsertStage(Dest, cmsAT_END, CLUT)) {
      goto Error;
  }

  // Postlinearization tables are kept unless indicated by flags
  if (*dwFlags & cmsFLAGS_CLUT_POST_LINEARIZATION0x0001) {

      // Get a pointer to the postlinearization if present
      cmsStage* PostLin = cmsPipelineGetPtrToLastStage(Src);

      // Check if suitable
      if (PostLin && cmsStageType(PostLin) == cmsSigCurveSetElemType) {

          // Maybe this is a linear tram, so we can avoid the whole stuff
          if (!AllCurvesAreLinear(PostLin)) {

              // All seems ok, proceed.
              NewPostLin = cmsStageDup(PostLin);
              if (!cmsPipelineInsertStage(Dest, cmsAT_END, NewPostLin))
                  goto Error;

              // In destination LUT, the sampling should be applied after this stage.
              cmsPipelineUnlinkStage(Src, cmsAT_END, &KeepPostLin);
          }
      }
  }

  // Now its time to do the sampling. We have to ignore pre/post linearization
  // The source LUT without pre/post curves is passed as parameter.
  if (!cmsStageSampleCLut16bit(CLUT, XFormSampler16, (void*) Src, 0)) {
779Error:
      // Ops, something went wrong, Restore stages
      if (KeepPreLin != NULL((void*)0)) {
          if (!cmsPipelineInsertStage(Src, cmsAT_BEGIN, KeepPreLin)) {
              _cmsAssert(0)(((0)) ? (void) (0) : __assert_fail ("(0)", "/home/daniel/Projects/java/jdk/src/java.desktop/share/native/liblcms/cmsopt.c"
, 783, __extension__ __PRETTY_FUNCTION__)); // This never happens
          }
      }
      if (KeepPostLin != NULL((void*)0)) {
          if (!cmsPipelineInsertStage(Src, cmsAT_END,   KeepPostLin)) {
              _cmsAssert(0)(((0)) ? (void) (0) : __assert_fail ("(0)", "/home/daniel/Projects/java/jdk/src/java.desktop/share/native/liblcms/cmsopt.c"
, 788, __extension__ __PRETTY_FUNCTION__)); // This never happens
          }
      }
      cmsPipelineFree(Dest);
      return FALSE0;
  }

  // Done.

  if (KeepPreLin != NULL((void*)0)) cmsStageFree(KeepPreLin);
  if (KeepPostLin != NULL((void*)0)) cmsStageFree(KeepPostLin);
  cmsPipelineFree(Src);

  DataCLUT = (_cmsStageCLutData*) CLUT ->Data;

  if (NewPreLin == NULL((void*)0)) DataSetIn = NULL((void*)0);
  else DataSetIn = ((_cmsStageToneCurvesData*) NewPreLin ->Data) ->TheCurves;

  if (NewPostLin == NULL((void*)0)) DataSetOut = NULL((void*)0);
  else  DataSetOut = ((_cmsStageToneCurvesData*) NewPostLin ->Data) ->TheCurves;


  if (DataSetIn == NULL((void*)0) && DataSetOut == NULL((void*)0)) {

      _cmsPipelineSetOptimizationParameters(Dest, (_cmsPipelineEval16Fn) DataCLUT->Params->Interpolation.Lerp16, DataCLUT->Params, NULL((void*)0), NULL((void*)0));
  }
  else {

      p16 = PrelinOpt16alloc(Dest ->ContextID,
          DataCLUT ->Params,
          Dest ->InputChannels,
          DataSetIn,
          Dest ->OutputChannels,
          DataSetOut);

      _cmsPipelineSetOptimizationParameters(Dest, PrelinEval16, (void*) p16, PrelinOpt16free, Prelin16dup);
  }


  // Don't fix white on absolute colorimetric
  if (Intent == INTENT_ABSOLUTE_COLORIMETRIC3)
      *dwFlags |= cmsFLAGS_NOWHITEONWHITEFIXUP0x0004;

  if (!(*dwFlags & cmsFLAGS_NOWHITEONWHITEFIXUP0x0004)) {

      FixWhiteMisalignment(Dest, ColorSpace, OutputColorSpace);
  }

  *Lut = Dest;
  return TRUE1;

  cmsUNUSED_PARAMETER(Intent)((void)Intent);
840}


843// -----------------------------------------------------------------------------------------------------------------------------------------------
844// Fixes the gamma balancing of transform. This is described in my paper "Prelinearization Stages on
845// Color-Management Application-Specific Integrated Circuits (ASICs)" presented at NIP24. It only works
846// for RGB transforms. See the paper for more details
847// -----------------------------------------------------------------------------------------------------------------------------------------------


850// Normalize endpoints by slope limiting max and min. This assures endpoints as well.
851// Descending curves are handled as well.
852static
853void SlopeLimiting(cmsToneCurve* g)
854{
  int BeginVal, EndVal;
  int AtBegin = (int) floor((cmsFloat64Number) g ->nEntries * 0.02 + 0.5);   // Cutoff at 2%
  int AtEnd   = (int) g ->nEntries - AtBegin - 1;                                  // And 98%
  cmsFloat64Number Val, Slope, beta;
  int i;

  if (cmsIsToneCurveDescending(g)) {
      BeginVal = 0xffff; EndVal = 0;
  }
  else {
      BeginVal = 0; EndVal = 0xffff;
  }

  // Compute slope and offset for begin of curve
  Val   = g ->Table16[AtBegin];
  Slope = (Val - BeginVal) / AtBegin;
  beta  = Val - Slope * AtBegin;

  for (i=0; i < AtBegin; i++)
      g ->Table16[i] = _cmsQuickSaturateWord(i * Slope + beta);

  // Compute slope and offset for the end
  Val   = g ->Table16[AtEnd];
  Slope = (EndVal - Val) / AtBegin;   // AtBegin holds the X interval, which is same in both cases
  beta  = Val - Slope * AtEnd;

  for (i = AtEnd; i < (int) g ->nEntries; i++)
      g ->Table16[i] = _cmsQuickSaturateWord(i * Slope + beta);
883}


886// Precomputes tables for 8-bit on input devicelink.
887static
888Prelin8Data* PrelinOpt8alloc(cmsContext ContextID, const cmsInterpParams* p, cmsToneCurve* G[3])
889{
  int i;
  cmsUInt16Number Input[3];
  cmsS15Fixed16Number v1, v2, v3;
  Prelin8Data* p8;

  p8 = (Prelin8Data*)_cmsMallocZero(ContextID, sizeof(Prelin8Data));
  if (p8 == NULL((void*)0)) return NULL((void*)0);

  // Since this only works for 8 bit input, values comes always as x * 257,
  // we can safely take msb byte (x << 8 + x)

  for (i=0; i < 256; i++) {

      if (G != NULL((void*)0)) {

          // Get 16-bit representation
          Input[0] = cmsEvalToneCurve16(G[0], FROM_8_TO_16(i)(cmsUInt16Number) ((((cmsUInt16Number) (i)) << 8)|(i)));
          Input[1] = cmsEvalToneCurve16(G[1], FROM_8_TO_16(i)(cmsUInt16Number) ((((cmsUInt16Number) (i)) << 8)|(i)));
          Input[2] = cmsEvalToneCurve16(G[2], FROM_8_TO_16(i)(cmsUInt16Number) ((((cmsUInt16Number) (i)) << 8)|(i)));
      }
      else {
          Input[0] = FROM_8_TO_16(i)(cmsUInt16Number) ((((cmsUInt16Number) (i)) << 8)|(i));
          Input[1] = FROM_8_TO_16(i)(cmsUInt16Number) ((((cmsUInt16Number) (i)) << 8)|(i));
          Input[2] = FROM_8_TO_16(i)(cmsUInt16Number) ((((cmsUInt16Number) (i)) << 8)|(i));
      }


      // Move to 0..1.0 in fixed domain
      v1 = _cmsToFixedDomain((int) (Input[0] * p -> Domain[0]));
      v2 = _cmsToFixedDomain((int) (Input[1] * p -> Domain[1]));
      v3 = _cmsToFixedDomain((int) (Input[2] * p -> Domain[2]));

      // Store the precalculated table of nodes
      p8 ->X0[i] = (p->opta[2] * FIXED_TO_INT(v1)((v1)>>16));
      p8 ->Y0[i] = (p->opta[1] * FIXED_TO_INT(v2)((v2)>>16));
      p8 ->Z0[i] = (p->opta[0] * FIXED_TO_INT(v3)((v3)>>16));

      // Store the precalculated table of offsets
      p8 ->rx[i] = (cmsUInt16Number) FIXED_REST_TO_INT(v1)((v1)&0xFFFFU);
      p8 ->ry[i] = (cmsUInt16Number) FIXED_REST_TO_INT(v2)((v2)&0xFFFFU);
      p8 ->rz[i] = (cmsUInt16Number) FIXED_REST_TO_INT(v3)((v3)&0xFFFFU);
  }

  p8 ->ContextID = ContextID;
  p8 ->p = p;

  return p8;
937}

939static
940void Prelin8free(cmsContext ContextID, void* ptr)
941{
  _cmsFree(ContextID, ptr);
943}

945static
946void* Prelin8dup(cmsContext ContextID, const void* ptr)
947{
  return _cmsDupMem(ContextID, ptr, sizeof(Prelin8Data));
949}



953// A optimized interpolation for 8-bit input.
954#define DENS(i,j,k) (LutTable[(i)+(j)+(k)+OutChan])
955static CMS_NO_SANITIZE__attribute__((no_sanitize("signed-integer-overflow")))
956void PrelinEval8(CMSREGISTERregister const cmsUInt16Number Input[],
               CMSREGISTERregister cmsUInt16Number Output[],
               CMSREGISTERregister const void* D)
959{

  cmsUInt8Number         r, g, b;
  cmsS15Fixed16Number    rx, ry, rz;
  cmsS15Fixed16Number    c0, c1, c2, c3, Rest;
  int                    OutChan;
  CMSREGISTERregister cmsS15Fixed16Number X0, X1, Y0, Y1, Z0, Z1;
  Prelin8Data* p8 = (Prelin8Data*) D;
  CMSREGISTERregister const cmsInterpParams* p = p8 ->p;
  int                    TotalOut = (int) p -> nOutputs;
  const cmsUInt16Number* LutTable = (const cmsUInt16Number*) p->Table;

  r = (cmsUInt8Number) (Input[0] >> 8);
  g = (cmsUInt8Number) (Input[1] >> 8);
  b = (cmsUInt8Number) (Input[2] >> 8);

  X0 = (cmsS15Fixed16Number) p8->X0[r];
  Y0 = (cmsS15Fixed16Number) p8->Y0[g];
  Z0 = (cmsS15Fixed16Number) p8->Z0[b];

  rx = p8 ->rx[r];
  ry = p8 ->ry[g];
  rz = p8 ->rz[b];

  X1 = X0 + (cmsS15Fixed16Number)((rx == 0) ? 0 :  p ->opta[2]);
  Y1 = Y0 + (cmsS15Fixed16Number)((ry == 0) ? 0 :  p ->opta[1]);
  Z1 = Z0 + (cmsS15Fixed16Number)((rz == 0) ? 0 :  p ->opta[0]);


  // These are the 6 Tetrahedral
  for (OutChan=0; OutChan < TotalOut; OutChan++) {

      c0 = DENS(X0, Y0, Z0);

      if (rx >= ry && ry >= rz)
      {
          c1 = DENS(X1, Y0, Z0) - c0;
          c2 = DENS(X1, Y1, Z0) - DENS(X1, Y0, Z0);
          c3 = DENS(X1, Y1, Z1) - DENS(X1, Y1, Z0);
      }
      else
          if (rx >= rz && rz >= ry)
          {
              c1 = DENS(X1, Y0, Z0) - c0;
              c2 = DENS(X1, Y1, Z1) - DENS(X1, Y0, Z1);
              c3 = DENS(X1, Y0, Z1) - DENS(X1, Y0, Z0);
          }
          else
              if (rz >= rx && rx >= ry)
              {
                  c1 = DENS(X1, Y0, Z1) - DENS(X0, Y0, Z1);
                  c2 = DENS(X1, Y1, Z1) - DENS(X1, Y0, Z1);
                  c3 = DENS(X0, Y0, Z1) - c0;
              }
              else
                  if (ry >= rx && rx >= rz)
                  {
                      c1 = DENS(X1, Y1, Z0) - DENS(X0, Y1, Z0);
                      c2 = DENS(X0, Y1, Z0) - c0;
                      c3 = DENS(X1, Y1, Z1) - DENS(X1, Y1, Z0);
                  }
                  else
                      if (ry >= rz && rz >= rx)
                      {
                          c1 = DENS(X1, Y1, Z1) - DENS(X0, Y1, Z1);
                          c2 = DENS(X0, Y1, Z0) - c0;
                          c3 = DENS(X0, Y1, Z1) - DENS(X0, Y1, Z0);
                      }
                      else
                          if (rz >= ry && ry >= rx)
                          {
                              c1 = DENS(X1, Y1, Z1) - DENS(X0, Y1, Z1);
                              c2 = DENS(X0, Y1, Z1) - DENS(X0, Y0, Z1);
                              c3 = DENS(X0, Y0, Z1) - c0;
                          }
                          else  {
                              c1 = c2 = c3 = 0;
                          }

      Rest = c1 * rx + c2 * ry + c3 * rz + 0x8001;
      Output[OutChan] = (cmsUInt16Number) (c0 + ((Rest + (Rest >> 16)) >> 16));

  }
1042}

1044#undef DENS


1047// Curves that contain wide empty areas are not optimizeable
1048static
1049cmsBool IsDegenerated(const cmsToneCurve* g)
1050{
  cmsUInt32Number i, Zeros = 0, Poles = 0;
  cmsUInt32Number nEntries = g ->nEntries;

  for (i=0; i < nEntries; i++) {

      if (g ->Table16[i] == 0x0000) Zeros++;
      if (g ->Table16[i] == 0xffff) Poles++;
  }

  if (Zeros == 1 && Poles == 1) return FALSE0;  // For linear tables
  if (Zeros > (nEntries / 20)) return TRUE1;  // Degenerated, many zeros
  if (Poles > (nEntries / 20)) return TRUE1;  // Degenerated, many poles

  return FALSE0;
1065}

1067// --------------------------------------------------------------------------------------------------------------
1068// We need xput over here

1070static
1071cmsBool OptimizeByComputingLinearization(cmsPipeline** Lut, cmsUInt32Number Intent, cmsUInt32Number* InputFormat, cmsUInt32Number* OutputFormat, cmsUInt32Number* dwFlags)
1072{
  cmsPipeline* OriginalLut;
  cmsUInt32Number nGridPoints;
  cmsToneCurve *Trans[cmsMAXCHANNELS16], *TransReverse[cmsMAXCHANNELS16];
  cmsUInt32Number t, i;
  cmsFloat32Number v, In[cmsMAXCHANNELS16], Out[cmsMAXCHANNELS16];
  cmsBool lIsSuitable, lIsLinear;
  cmsPipeline* OptimizedLUT = NULL((void*)0), *LutPlusCurves = NULL((void*)0);
  cmsStage* OptimizedCLUTmpe;
  cmsColorSpaceSignature ColorSpace, OutputColorSpace;
  cmsStage* OptimizedPrelinMpe;
  cmsStage* mpe;
  cmsToneCurve** OptimizedPrelinCurves;
  _cmsStageCLutData* OptimizedPrelinCLUT;


  // This is a lossy optimization! does not apply in floating-point cases
  if (_cmsFormatterIsFloat(*InputFormat) || _cmsFormatterIsFloat(*OutputFormat)) return FALSE0;
1
Assuming the condition is false→
2
←
Assuming the condition is false→
3
←
Taking false branch→

  // Only on chunky RGB
  if (T_COLORSPACE(*InputFormat)(((*InputFormat)>>16)&31)  != PT_RGB4) return FALSE0;
4
←
Assuming the condition is false→
5
←
Taking false branch→
  if (T_PLANAR(*InputFormat)(((*InputFormat)>>12)&1)) return FALSE0;
6
←
Assuming the condition is false→
7
←
Taking false branch→

  if (T_COLORSPACE(*OutputFormat)(((*OutputFormat)>>16)&31) != PT_RGB4) return FALSE0;
8
←
Assuming the condition is false→
9
←
Taking false branch→
  if (T_PLANAR(*OutputFormat)(((*OutputFormat)>>12)&1)) return FALSE0;
10
←
Assuming the condition is false→
11
←
Taking false branch→

  // On 16 bits, user has to specify the feature
  if (!_cmsFormatterIs8bit(*InputFormat)) {
12
←
Assuming the condition is false→
13
←
Taking false branch→
      if (!(*dwFlags & cmsFLAGS_CLUT_PRE_LINEARIZATION0x0010)) return FALSE0;
  }

  OriginalLut = *Lut;

 // Named color pipelines cannot be optimized either
 for (mpe = cmsPipelineGetPtrToFirstStage(OriginalLut);
15
←
Loop condition is false. Execution continues on line 1112→
       mpe != NULL((void*)0);
14
←
Assuming 'mpe' is equal to NULL→
       mpe = cmsStageNext(mpe)) {
          if (cmsStageType(mpe) == cmsSigNamedColorElemType) return FALSE0;
  }

  ColorSpace       = _cmsICCcolorSpace((int) T_COLORSPACE(*InputFormat)(((*InputFormat)>>16)&31));
  OutputColorSpace = _cmsICCcolorSpace((int) T_COLORSPACE(*OutputFormat)(((*OutputFormat)>>16)&31));

  // Color space must be specified
  if (ColorSpace == (cmsColorSpaceSignature)0 ||
16
←
Assuming 'ColorSpace' is not equal to 0→
18
←
Taking false branch→
      OutputColorSpace == (cmsColorSpaceSignature)0) return FALSE0;
17
←
Assuming 'OutputColorSpace' is not equal to 0→

  nGridPoints      = _cmsReasonableGridpointsByColorspace(ColorSpace, *dwFlags);

  // Empty gamma containers
  memset(Trans, 0, sizeof(Trans));
19
←
Storing null pointer value→
  memset(TransReverse, 0, sizeof(TransReverse));

  // If the last stage of the original lut are curves, and those curves are
  // degenerated, it is likely the transform is squeezing and clipping
  // the output from previous CLUT. We cannot optimize this case
  {
      cmsStage* last = cmsPipelineGetPtrToLastStage(OriginalLut);

      if (last == NULL((void*)0)) goto Error;
20
←
Assuming 'last' is not equal to NULL→
21
←
Taking false branch→
      if (cmsStageType(last) == cmsSigCurveSetElemType) {
22
←
Assuming the condition is false→
23
←
Taking false branch→

          _cmsStageToneCurvesData* Data = (_cmsStageToneCurvesData*)cmsStageData(last);
          for (i = 0; i < Data->nCurves; i++) {
              if (IsDegenerated(Data->TheCurves[i]))
                  goto Error;
          }
      }
  }

  for (t = 0; t < OriginalLut ->InputChannels; t++) {
24
←
Assuming 't' is >= field 'InputChannels'→
25
←
Loop condition is false. Execution continues on line 1148→
      Trans[t] = cmsBuildTabulatedToneCurve16(OriginalLut ->ContextID, PRELINEARIZATION_POINTS4096, NULL((void*)0));
      if (Trans[t] == NULL((void*)0)) goto Error;
  }

  // Populate the curves
  for (i=0; i < PRELINEARIZATION_POINTS4096; i++) {
26
←
Loop condition is true.  Entering loop body→

      v = (cmsFloat32Number) ((cmsFloat64Number) i / (PRELINEARIZATION_POINTS4096 - 1));

      // Feed input with a gray ramp
      for (t=0; t < OriginalLut ->InputChannels; t++)
27
←
Loop condition is false. Execution continues on line 1157→
          In[t] = v;

      // Evaluate the gray value
      cmsPipelineEvalFloat(In, Out, OriginalLut);

      // Store result in curve
      for (t=0; t < OriginalLut ->InputChannels; t++)
28
←
The value 0 is assigned to 't'→
29
←
Assuming 't' is < field 'InputChannels'→
30
←
Loop condition is true.  Entering loop body→
          Trans[t] ->Table16[i] = _cmsQuickSaturateWord(Out[t] * 65535.0);
31
←
Access to field 'Table16' results in a dereference of a null pointer
  }

  // Slope-limit the obtained curves
  for (t = 0; t < OriginalLut ->InputChannels; t++)
      SlopeLimiting(Trans[t]);

  // Check for validity
  lIsSuitable = TRUE1;
  lIsLinear   = TRUE1;
  for (t=0; (lIsSuitable && (t < OriginalLut ->InputChannels)); t++) {

      // Exclude if already linear
      if (!cmsIsToneCurveLinear(Trans[t]))
          lIsLinear = FALSE0;

      // Exclude if non-monotonic
      if (!cmsIsToneCurveMonotonic(Trans[t]))
          lIsSuitable = FALSE0;

      if (IsDegenerated(Trans[t]))
          lIsSuitable = FALSE0;
  }

  // If it is not suitable, just quit
  if (!lIsSuitable) goto Error;

  // Invert curves if possible
  for (t = 0; t < OriginalLut ->InputChannels; t++) {
      TransReverse[t] = cmsReverseToneCurveEx(PRELINEARIZATION_POINTS4096, Trans[t]);
      if (TransReverse[t] == NULL((void*)0)) goto Error;
  }

  // Now inset the reversed curves at the begin of transform
  LutPlusCurves = cmsPipelineDup(OriginalLut);
  if (LutPlusCurves == NULL((void*)0)) goto Error;

  if (!cmsPipelineInsertStage(LutPlusCurves, cmsAT_BEGIN, cmsStageAllocToneCurves(OriginalLut ->ContextID, OriginalLut ->InputChannels, TransReverse)))
      goto Error;

  // Create the result LUT
  OptimizedLUT = cmsPipelineAlloc(OriginalLut ->ContextID, OriginalLut ->InputChannels, OriginalLut ->OutputChannels);
  if (OptimizedLUT == NULL((void*)0)) goto Error;

  OptimizedPrelinMpe = cmsStageAllocToneCurves(OriginalLut ->ContextID, OriginalLut ->InputChannels, Trans);

  // Create and insert the curves at the beginning
  if (!cmsPipelineInsertStage(OptimizedLUT, cmsAT_BEGIN, OptimizedPrelinMpe))
      goto Error;

  // Allocate the CLUT for result
  OptimizedCLUTmpe = cmsStageAllocCLut16bit(OriginalLut ->ContextID, nGridPoints, OriginalLut ->InputChannels, OriginalLut ->OutputChannels, NULL((void*)0));

  // Add the CLUT to the destination LUT
  if (!cmsPipelineInsertStage(OptimizedLUT, cmsAT_END, OptimizedCLUTmpe))
      goto Error;

  // Resample the LUT
  if (!cmsStageSampleCLut16bit(OptimizedCLUTmpe, XFormSampler16, (void*) LutPlusCurves, 0)) goto Error;

  // Free resources
  for (t = 0; t < OriginalLut ->InputChannels; t++) {

      if (Trans[t]) cmsFreeToneCurve(Trans[t]);
      if (TransReverse[t]) cmsFreeToneCurve(TransReverse[t]);
  }

  cmsPipelineFree(LutPlusCurves);


  OptimizedPrelinCurves = _cmsStageGetPtrToCurveSet(OptimizedPrelinMpe);
  OptimizedPrelinCLUT   = (_cmsStageCLutData*) OptimizedCLUTmpe ->Data;

  // Set the evaluator if 8-bit
  if (_cmsFormatterIs8bit(*InputFormat)) {

      Prelin8Data* p8 = PrelinOpt8alloc(OptimizedLUT ->ContextID,
                                              OptimizedPrelinCLUT ->Params,
                                              OptimizedPrelinCurves);
      if (p8 == NULL((void*)0)) return FALSE0;

      _cmsPipelineSetOptimizationParameters(OptimizedLUT, PrelinEval8, (void*) p8, Prelin8free, Prelin8dup);

  }
  else
  {
      Prelin16Data* p16 = PrelinOpt16alloc(OptimizedLUT ->ContextID,
          OptimizedPrelinCLUT ->Params,
          3, OptimizedPrelinCurves, 3, NULL((void*)0));
      if (p16 == NULL((void*)0)) return FALSE0;

      _cmsPipelineSetOptimizationParameters(OptimizedLUT, PrelinEval16, (void*) p16, PrelinOpt16free, Prelin16dup);

  }

  // Don't fix white on absolute colorimetric
  if (Intent == INTENT_ABSOLUTE_COLORIMETRIC3)
      *dwFlags |= cmsFLAGS_NOWHITEONWHITEFIXUP0x0004;

  if (!(*dwFlags & cmsFLAGS_NOWHITEONWHITEFIXUP0x0004)) {

      if (!FixWhiteMisalignment(OptimizedLUT, ColorSpace, OutputColorSpace)) {

          return FALSE0;
      }
  }

  // And return the obtained LUT

  cmsPipelineFree(OriginalLut);
  *Lut = OptimizedLUT;
  return TRUE1;

1274Error:

  for (t = 0; t < OriginalLut ->InputChannels; t++) {

      if (Trans[t]) cmsFreeToneCurve(Trans[t]);
      if (TransReverse[t]) cmsFreeToneCurve(TransReverse[t]);
  }

  if (LutPlusCurves != NULL((void*)0)) cmsPipelineFree(LutPlusCurves);
  if (OptimizedLUT != NULL((void*)0)) cmsPipelineFree(OptimizedLUT);

  return FALSE0;

  cmsUNUSED_PARAMETER(Intent)((void)Intent);
  cmsUNUSED_PARAMETER(lIsLinear)((void)lIsLinear);
1289}


1292// Curves optimizer ------------------------------------------------------------------------------------------------------------------

1294static
1295void CurvesFree(cmsContext ContextID, void* ptr)
1296{
   Curves16Data* Data = (Curves16Data*) ptr;
   cmsUInt32Number i;

   for (i=0; i < Data -> nCurves; i++) {

       _cmsFree(ContextID, Data ->Curves[i]);
   }

   _cmsFree(ContextID, Data ->Curves);
   _cmsFree(ContextID, ptr);
1307}

1309static
1310void* CurvesDup(cmsContext ContextID, const void* ptr)
1311{
  Curves16Data* Data = (Curves16Data*)_cmsDupMem(ContextID, ptr, sizeof(Curves16Data));
  cmsUInt32Number i;

  if (Data == NULL((void*)0)) return NULL((void*)0);

  Data->Curves = (cmsUInt16Number**) _cmsDupMem(ContextID, Data->Curves, Data->nCurves * sizeof(cmsUInt16Number*));

  for (i=0; i < Data -> nCurves; i++) {
      Data->Curves[i] = (cmsUInt16Number*) _cmsDupMem(ContextID, Data->Curves[i], Data->nElements * sizeof(cmsUInt16Number));
  }

  return (void*) Data;
1324}

1326// Precomputes tables for 8-bit on input devicelink.
1327static
1328Curves16Data* CurvesAlloc(cmsContext ContextID, cmsUInt32Number nCurves, cmsUInt32Number nElements, cmsToneCurve** G)
1329{
  cmsUInt32Number i, j;
  Curves16Data* c16;

  c16 = (Curves16Data*)_cmsMallocZero(ContextID, sizeof(Curves16Data));
  if (c16 == NULL((void*)0)) return NULL((void*)0);

  c16 ->nCurves = nCurves;
  c16 ->nElements = nElements;

  c16->Curves = (cmsUInt16Number**) _cmsCalloc(ContextID, nCurves, sizeof(cmsUInt16Number*));
  if (c16->Curves == NULL((void*)0)) {
      _cmsFree(ContextID, c16);
      return NULL((void*)0);
  }

  for (i=0; i < nCurves; i++) {

      c16->Curves[i] = (cmsUInt16Number*) _cmsCalloc(ContextID, nElements, sizeof(cmsUInt16Number));

      if (c16->Curves[i] == NULL((void*)0)) {

          for (j=0; j < i; j++) {
              _cmsFree(ContextID, c16->Curves[j]);
          }
          _cmsFree(ContextID, c16->Curves);
          _cmsFree(ContextID, c16);
          return NULL((void*)0);
      }

      if (nElements == 256U) {

          for (j=0; j < nElements; j++) {

              c16 ->Curves[i][j] = cmsEvalToneCurve16(G[i], FROM_8_TO_16(j)(cmsUInt16Number) ((((cmsUInt16Number) (j)) << 8)|(j)));
          }
      }
      else {

          for (j=0; j < nElements; j++) {
              c16 ->Curves[i][j] = cmsEvalToneCurve16(G[i], (cmsUInt16Number) j);
          }
      }
  }

  return c16;
1375}

1377static
1378void FastEvaluateCurves8(CMSREGISTERregister const cmsUInt16Number In[],
                       CMSREGISTERregister cmsUInt16Number Out[],
                       CMSREGISTERregister const void* D)
1381{
  Curves16Data* Data = (Curves16Data*) D;
  int x;
  cmsUInt32Number i;

  for (i=0; i < Data ->nCurves; i++) {

       x = (In[i] >> 8);
       Out[i] = Data -> Curves[i][x];
  }
1391}


1394static
1395void FastEvaluateCurves16(CMSREGISTERregister const cmsUInt16Number In[],
                        CMSREGISTERregister cmsUInt16Number Out[],
                        CMSREGISTERregister const void* D)
1398{
  Curves16Data* Data = (Curves16Data*) D;
  cmsUInt32Number i;

  for (i=0; i < Data ->nCurves; i++) {
       Out[i] = Data -> Curves[i][In[i]];
  }
1405}


1408static
1409void FastIdentity16(CMSREGISTERregister const cmsUInt16Number In[],
                  CMSREGISTERregister cmsUInt16Number Out[],
                  CMSREGISTERregister const void* D)
1412{
  cmsPipeline* Lut = (cmsPipeline*) D;
  cmsUInt32Number i;

  for (i=0; i < Lut ->InputChannels; i++) {
       Out[i] = In[i];
  }
1419}


1422// If the target LUT holds only curves, the optimization procedure is to join all those
1423// curves together. That only works on curves and does not work on matrices.
1424static
1425cmsBool OptimizeByJoiningCurves(cmsPipeline** Lut, cmsUInt32Number Intent, cmsUInt32Number* InputFormat, cmsUInt32Number* OutputFormat, cmsUInt32Number* dwFlags)
1426{
  cmsToneCurve** GammaTables = NULL((void*)0);
  cmsFloat32Number InFloat[cmsMAXCHANNELS16], OutFloat[cmsMAXCHANNELS16];
  cmsUInt32Number i, j;
  cmsPipeline* Src = *Lut;
  cmsPipeline* Dest = NULL((void*)0);
  cmsStage* mpe;
  cmsStage* ObtainedCurves = NULL((void*)0);


  // This is a lossy optimization! does not apply in floating-point cases
  if (_cmsFormatterIsFloat(*InputFormat) || _cmsFormatterIsFloat(*OutputFormat)) return FALSE0;

  //  Only curves in this LUT?
  for (mpe = cmsPipelineGetPtrToFirstStage(Src);
       mpe != NULL((void*)0);
       mpe = cmsStageNext(mpe)) {
          if (cmsStageType(mpe) != cmsSigCurveSetElemType) return FALSE0;
  }

  // Allocate an empty LUT
  Dest =  cmsPipelineAlloc(Src ->ContextID, Src ->InputChannels, Src ->OutputChannels);
  if (Dest == NULL((void*)0)) return FALSE0;

  // Create target curves
  GammaTables = (cmsToneCurve**) _cmsCalloc(Src ->ContextID, Src ->InputChannels, sizeof(cmsToneCurve*));
  if (GammaTables == NULL((void*)0)) goto Error;

  for (i=0; i < Src ->InputChannels; i++) {
      GammaTables[i] = cmsBuildTabulatedToneCurve16(Src ->ContextID, PRELINEARIZATION_POINTS4096, NULL((void*)0));
      if (GammaTables[i] == NULL((void*)0)) goto Error;
  }

  // Compute 16 bit result by using floating point
  for (i=0; i < PRELINEARIZATION_POINTS4096; i++) {

      for (j=0; j < Src ->InputChannels; j++)
          InFloat[j] = (cmsFloat32Number) ((cmsFloat64Number) i / (PRELINEARIZATION_POINTS4096 - 1));

      cmsPipelineEvalFloat(InFloat, OutFloat, Src);

      for (j=0; j < Src ->InputChannels; j++)
          GammaTables[j] -> Table16[i] = _cmsQuickSaturateWord(OutFloat[j] * 65535.0);
  }

  ObtainedCurves = cmsStageAllocToneCurves(Src ->ContextID, Src ->InputChannels, GammaTables);
  if (ObtainedCurves == NULL((void*)0)) goto Error;

  for (i=0; i < Src ->InputChannels; i++) {
      cmsFreeToneCurve(GammaTables[i]);
      GammaTables[i] = NULL((void*)0);
  }

  if (GammaTables != NULL((void*)0)) {
      _cmsFree(Src->ContextID, GammaTables);
      GammaTables = NULL((void*)0);
  }

  // Maybe the curves are linear at the end
  if (!AllCurvesAreLinear(ObtainedCurves)) {
     _cmsStageToneCurvesData* Data;

      if (!cmsPipelineInsertStage(Dest, cmsAT_BEGIN, ObtainedCurves))
          goto Error;
      Data = (_cmsStageToneCurvesData*) cmsStageData(ObtainedCurves);
      ObtainedCurves = NULL((void*)0);

      // If the curves are to be applied in 8 bits, we can save memory
      if (_cmsFormatterIs8bit(*InputFormat)) {
           Curves16Data* c16 = CurvesAlloc(Dest ->ContextID, Data ->nCurves, 256, Data ->TheCurves);

           if (c16 == NULL((void*)0)) goto Error;
           *dwFlags |= cmsFLAGS_NOCACHE0x0040;
          _cmsPipelineSetOptimizationParameters(Dest, FastEvaluateCurves8, c16, CurvesFree, CurvesDup);

      }
      else {
           Curves16Data* c16 = CurvesAlloc(Dest ->ContextID, Data ->nCurves, 65536, Data ->TheCurves);

           if (c16 == NULL((void*)0)) goto Error;
           *dwFlags |= cmsFLAGS_NOCACHE0x0040;
          _cmsPipelineSetOptimizationParameters(Dest, FastEvaluateCurves16, c16, CurvesFree, CurvesDup);
      }
  }
  else {

      // LUT optimizes to nothing. Set the identity LUT
      cmsStageFree(ObtainedCurves);
      ObtainedCurves = NULL((void*)0);

      if (!cmsPipelineInsertStage(Dest, cmsAT_BEGIN, cmsStageAllocIdentity(Dest ->ContextID, Src ->InputChannels)))
          goto Error;

      *dwFlags |= cmsFLAGS_NOCACHE0x0040;
      _cmsPipelineSetOptimizationParameters(Dest, FastIdentity16, (void*) Dest, NULL((void*)0), NULL((void*)0));
  }

  // We are done.
  cmsPipelineFree(Src);
  *Lut = Dest;
  return TRUE1;

1528Error:

  if (ObtainedCurves != NULL((void*)0)) cmsStageFree(ObtainedCurves);
  if (GammaTables != NULL((void*)0)) {
      for (i=0; i < Src ->InputChannels; i++) {
          if (GammaTables[i] != NULL((void*)0)) cmsFreeToneCurve(GammaTables[i]);
      }

      _cmsFree(Src ->ContextID, GammaTables);
  }

  if (Dest != NULL((void*)0)) cmsPipelineFree(Dest);
  return FALSE0;

  cmsUNUSED_PARAMETER(Intent)((void)Intent);
  cmsUNUSED_PARAMETER(InputFormat)((void)InputFormat);
  cmsUNUSED_PARAMETER(OutputFormat)((void)OutputFormat);
  cmsUNUSED_PARAMETER(dwFlags)((void)dwFlags);
1546}

1548// -------------------------------------------------------------------------------------------------------------------------------------
1549// LUT is Shaper - Matrix - Matrix - Shaper, which is very frequent when combining two matrix-shaper profiles


1552static
1553void  FreeMatShaper(cmsContext ContextID, void* Data)
1554{
  if (Data != NULL((void*)0)) _cmsFree(ContextID, Data);
1556}

1558static
1559void* DupMatShaper(cmsContext ContextID, const void* Data)
1560{
  return _cmsDupMem(ContextID, Data, sizeof(MatShaper8Data));
1562}


1565// A fast matrix-shaper evaluator for 8 bits. This is a bit ticky since I'm using 1.14 signed fixed point
1566// to accomplish some performance. Actually it takes 256x3 16 bits tables and 16385 x 3 tables of 8 bits,
1567// in total about 50K, and the performance boost is huge!
1568static
1569void MatShaperEval16(CMSREGISTERregister const cmsUInt16Number In[],
                   CMSREGISTERregister cmsUInt16Number Out[],
                   CMSREGISTERregister const void* D)
1572{
  MatShaper8Data* p = (MatShaper8Data*) D;
  cmsS1Fixed14Number l1, l2, l3, r, g, b;
  cmsUInt32Number ri, gi, bi;

  // In this case (and only in this case!) we can use this simplification since
  // In[] is assured to come from a 8 bit number. (a << 8 | a)
  ri = In[0] & 0xFFU;
  gi = In[1] & 0xFFU;
  bi = In[2] & 0xFFU;

  // Across first shaper, which also converts to 1.14 fixed point
  r = p->Shaper1R[ri];
  g = p->Shaper1G[gi];
  b = p->Shaper1B[bi];

  // Evaluate the matrix in 1.14 fixed point
  l1 =  (p->Mat[0][0] * r + p->Mat[0][1] * g + p->Mat[0][2] * b + p->Off[0] + 0x2000) >> 14;
  l2 =  (p->Mat[1][0] * r + p->Mat[1][1] * g + p->Mat[1][2] * b + p->Off[1] + 0x2000) >> 14;
  l3 =  (p->Mat[2][0] * r + p->Mat[2][1] * g + p->Mat[2][2] * b + p->Off[2] + 0x2000) >> 14;

  // Now we have to clip to 0..1.0 range
  ri = (l1 < 0) ? 0 : ((l1 > 16384) ? 16384U : (cmsUInt32Number) l1);
  gi = (l2 < 0) ? 0 : ((l2 > 16384) ? 16384U : (cmsUInt32Number) l2);
  bi = (l3 < 0) ? 0 : ((l3 > 16384) ? 16384U : (cmsUInt32Number) l3);

  // And across second shaper,
  Out[0] = p->Shaper2R[ri];
  Out[1] = p->Shaper2G[gi];
  Out[2] = p->Shaper2B[bi];

1603}

1605// This table converts from 8 bits to 1.14 after applying the curve
1606static
1607void FillFirstShaper(cmsS1Fixed14Number* Table, cmsToneCurve* Curve)
1608{
  int i;
  cmsFloat32Number R, y;

  for (i=0; i < 256; i++) {

      R   = (cmsFloat32Number) (i / 255.0);
      y   = cmsEvalToneCurveFloat(Curve, R);

      if (y < 131072.0)
          Table[i] = DOUBLE_TO_1FIXED14(y)((cmsS1Fixed14Number) floor((y) * 16384.0 + 0.5));
      else
          Table[i] = 0x7fffffff;
  }
1622}

1624// This table converts form 1.14 (being 0x4000 the last entry) to 8 bits after applying the curve
1625static
1626void FillSecondShaper(cmsUInt16Number* Table, cmsToneCurve* Curve, cmsBool Is8BitsOutput)
1627{
  int i;
  cmsFloat32Number R, Val;

  for (i=0; i < 16385; i++) {

      R   = (cmsFloat32Number) (i / 16384.0);
      Val = cmsEvalToneCurveFloat(Curve, R);    // Val comes 0..1.0

      if (Val < 0)
          Val = 0;

      if (Val > 1.0)
          Val = 1.0;

      if (Is8BitsOutput) {

          // If 8 bits output, we can optimize further by computing the / 257 part.
          // first we compute the resulting byte and then we store the byte times
          // 257. This quantization allows to round very quick by doing a >> 8, but
          // since the low byte is always equal to msb, we can do a & 0xff and this works!
          cmsUInt16Number w = _cmsQuickSaturateWord(Val * 65535.0);
          cmsUInt8Number  b = FROM_16_TO_8(w)(cmsUInt8Number) ((((cmsUInt32Number)(w) * 65281U + 8388608U)
 >> 24) & 0xFFU);

          Table[i] = FROM_8_TO_16(b)(cmsUInt16Number) ((((cmsUInt16Number) (b)) << 8)|(b));
      }
      else Table[i]  = _cmsQuickSaturateWord(Val * 65535.0);
  }
1655}

1657// Compute the matrix-shaper structure
1658static
1659cmsBool SetMatShaper(cmsPipeline* Dest, cmsToneCurve* Curve1[3], cmsMAT3* Mat, cmsVEC3* Off, cmsToneCurve* Curve2[3], cmsUInt32Number* OutputFormat)
1660{
  MatShaper8Data* p;
  int i, j;
  cmsBool Is8Bits = _cmsFormatterIs8bit(*OutputFormat);

  // Allocate a big chuck of memory to store precomputed tables
  p = (MatShaper8Data*) _cmsMalloc(Dest ->ContextID, sizeof(MatShaper8Data));
  if (p == NULL((void*)0)) return FALSE0;

  p -> ContextID = Dest -> ContextID;

  // Precompute tables
  FillFirstShaper(p ->Shaper1R, Curve1[0]);
  FillFirstShaper(p ->Shaper1G, Curve1[1]);
  FillFirstShaper(p ->Shaper1B, Curve1[2]);

  FillSecondShaper(p ->Shaper2R, Curve2[0], Is8Bits);
  FillSecondShaper(p ->Shaper2G, Curve2[1], Is8Bits);
  FillSecondShaper(p ->Shaper2B, Curve2[2], Is8Bits);

  // Convert matrix to nFixed14. Note that those values may take more than 16 bits
  for (i=0; i < 3; i++) {
      for (j=0; j < 3; j++) {
          p ->Mat[i][j] = DOUBLE_TO_1FIXED14(Mat->v[i].n[j])((cmsS1Fixed14Number) floor((Mat->v[i].n[j]) * 16384.0 + 0.5
));
      }
  }

  for (i=0; i < 3; i++) {

      if (Off == NULL((void*)0)) {
          p ->Off[i] = 0;
      }
      else {
          p ->Off[i] = DOUBLE_TO_1FIXED14(Off->n[i])((cmsS1Fixed14Number) floor((Off->n[i]) * 16384.0 + 0.5));
      }
  }

  // Mark as optimized for faster formatter
  if (Is8Bits)
      *OutputFormat |= OPTIMIZED_SH(1)((1) << 21);

  // Fill function pointers
  _cmsPipelineSetOptimizationParameters(Dest, MatShaperEval16, (void*) p, FreeMatShaper, DupMatShaper);
  return TRUE1;
1704}

1706//  8 bits on input allows matrix-shaper boot up to 25 Mpixels per second on RGB. That's fast!
1707static
1708cmsBool OptimizeMatrixShaper(cmsPipeline** Lut, cmsUInt32Number Intent, cmsUInt32Number* InputFormat, cmsUInt32Number* OutputFormat, cmsUInt32Number* dwFlags)
1709{
     cmsStage* Curve1, *Curve2;
     cmsStage* Matrix1, *Matrix2;
     cmsMAT3 res;
     cmsBool IdentityMat;
     cmsPipeline* Dest, *Src;
     cmsFloat64Number* Offset;

     // Only works on RGB to RGB
     if (T_CHANNELS(*InputFormat)(((*InputFormat)>>3)&15) != 3 || T_CHANNELS(*OutputFormat)(((*OutputFormat)>>3)&15) != 3) return FALSE0;

     // Only works on 8 bit input
     if (!_cmsFormatterIs8bit(*InputFormat)) return FALSE0;

     // Seems suitable, proceed
     Src = *Lut;

     // Check for:
     //
     //    shaper-matrix-matrix-shaper
     //    shaper-matrix-shaper
     //
     // Both of those constructs are possible (first because abs. colorimetric).
     // additionally, In the first case, the input matrix offset should be zero.

     IdentityMat = FALSE0;
     if (cmsPipelineCheckAndRetreiveStages(Src, 4,
            cmsSigCurveSetElemType, cmsSigMatrixElemType, cmsSigMatrixElemType, cmsSigCurveSetElemType,
            &Curve1, &Matrix1, &Matrix2, &Curve2)) {

            // Get both matrices
            _cmsStageMatrixData* Data1 = (_cmsStageMatrixData*)cmsStageData(Matrix1);
            _cmsStageMatrixData* Data2 = (_cmsStageMatrixData*)cmsStageData(Matrix2);

            // Input offset should be zero
            if (Data1->Offset != NULL((void*)0)) return FALSE0;

            // Multiply both matrices to get the result
            _cmsMAT3per(&res, (cmsMAT3*)Data2->Double, (cmsMAT3*)Data1->Double);

            // Only 2nd matrix has offset, or it is zero
            Offset = Data2->Offset;

            // Now the result is in res + Data2 -> Offset. Maybe is a plain identity?
            if (_cmsMAT3isIdentity(&res) && Offset == NULL((void*)0)) {

                   // We can get rid of full matrix
                   IdentityMat = TRUE1;
            }

     }
     else {

            if (cmsPipelineCheckAndRetreiveStages(Src, 3,
                   cmsSigCurveSetElemType, cmsSigMatrixElemType, cmsSigCurveSetElemType,
                   &Curve1, &Matrix1, &Curve2)) {

                   _cmsStageMatrixData* Data = (_cmsStageMatrixData*)cmsStageData(Matrix1);

                   // Copy the matrix to our result
                   memcpy(&res, Data->Double, sizeof(res));

                   // Preserve the Odffset (may be NULL as a zero offset)
                   Offset = Data->Offset;

                   if (_cmsMAT3isIdentity(&res) && Offset == NULL((void*)0)) {

                          // We can get rid of full matrix
                          IdentityMat = TRUE1;
                   }
            }
            else
                   return FALSE0; // Not optimizeable this time

     }

    // Allocate an empty LUT
  Dest =  cmsPipelineAlloc(Src ->ContextID, Src ->InputChannels, Src ->OutputChannels);
  if (!Dest) return FALSE0;

  // Assamble the new LUT
  if (!cmsPipelineInsertStage(Dest, cmsAT_BEGIN, cmsStageDup(Curve1)))
      goto Error;

  if (!IdentityMat) {

         if (!cmsPipelineInsertStage(Dest, cmsAT_END, cmsStageAllocMatrix(Dest->ContextID, 3, 3, (const cmsFloat64Number*)&res, Offset)))
                goto Error;
  }

  if (!cmsPipelineInsertStage(Dest, cmsAT_END, cmsStageDup(Curve2)))
      goto Error;

  // If identity on matrix, we can further optimize the curves, so call the join curves routine
  if (IdentityMat) {

      OptimizeByJoiningCurves(&Dest, Intent, InputFormat, OutputFormat, dwFlags);
  }
  else {
      _cmsStageToneCurvesData* mpeC1 = (_cmsStageToneCurvesData*) cmsStageData(Curve1);
      _cmsStageToneCurvesData* mpeC2 = (_cmsStageToneCurvesData*) cmsStageData(Curve2);

      // In this particular optimization, cache does not help as it takes more time to deal with
      // the cache that with the pixel handling
      *dwFlags |= cmsFLAGS_NOCACHE0x0040;

      // Setup the optimizarion routines
      SetMatShaper(Dest, mpeC1 ->TheCurves, &res, (cmsVEC3*) Offset, mpeC2->TheCurves, OutputFormat);
  }

  cmsPipelineFree(Src);
  *Lut = Dest;
  return TRUE1;
1822Error:
  // Leave Src unchanged
  cmsPipelineFree(Dest);
  return FALSE0;
1826}


1829// -------------------------------------------------------------------------------------------------------------------------------------
1830// Optimization plug-ins

1832// List of optimizations
1833typedef struct _cmsOptimizationCollection_st {

  _cmsOPToptimizeFn  OptimizePtr;

  struct _cmsOptimizationCollection_st *Next;

1839} _cmsOptimizationCollection;


1842// The built-in list. We currently implement 4 types of optimizations. Joining of curves, matrix-shaper, linearization and resampling
1843static _cmsOptimizationCollection DefaultOptimization[] = {

  { OptimizeByJoiningCurves,            &DefaultOptimization[1] },
  { OptimizeMatrixShaper,               &DefaultOptimization[2] },
  { OptimizeByComputingLinearization,   &DefaultOptimization[3] },
  { OptimizeByResampling,               NULL((void*)0) }
1849};

1851// The linked list head
1852_cmsOptimizationPluginChunkType _cmsOptimizationPluginChunk = { NULL((void*)0) };


1855// Duplicates the zone of memory used by the plug-in in the new context
1856static
1857void DupPluginOptimizationList(struct _cmsContext_struct* ctx,
                             const struct _cmsContext_struct* src)
1859{
 _cmsOptimizationPluginChunkType newHead = { NULL((void*)0) };
 _cmsOptimizationCollection*  entry;
 _cmsOptimizationCollection*  Anterior = NULL((void*)0);
 _cmsOptimizationPluginChunkType* head = (_cmsOptimizationPluginChunkType*) src->chunks[OptimizationPlugin];

  _cmsAssert(ctx != NULL)(((ctx != ((void*)0))) ? (void) (0) : __assert_fail ("(ctx != ((void*)0))"
, "/home/daniel/Projects/java/jdk/src/java.desktop/share/native/liblcms/cmsopt.c"
, 1865, __extension__ __PRETTY_FUNCTION__));
  _cmsAssert(head != NULL)(((head != ((void*)0))) ? (void) (0) : __assert_fail ("(head != ((void*)0))"
, "/home/daniel/Projects/java/jdk/src/java.desktop/share/native/liblcms/cmsopt.c"
, 1866, __extension__ __PRETTY_FUNCTION__));

  // Walk the list copying all nodes
 for (entry = head->OptimizationCollection;
      entry != NULL((void*)0);
      entry = entry ->Next) {

          _cmsOptimizationCollection *newEntry = ( _cmsOptimizationCollection *) _cmsSubAllocDup(ctx ->MemPool, entry, sizeof(_cmsOptimizationCollection));

          if (newEntry == NULL((void*)0))
              return;

          // We want to keep the linked list order, so this is a little bit tricky
          newEntry -> Next = NULL((void*)0);
          if (Anterior)
              Anterior -> Next = newEntry;

          Anterior = newEntry;

          if (newHead.OptimizationCollection == NULL((void*)0))
              newHead.OptimizationCollection = newEntry;
  }

ctx ->chunks[OptimizationPlugin] = _cmsSubAllocDup(ctx->MemPool, &newHead, sizeof(_cmsOptimizationPluginChunkType));
1890}

1892void  _cmsAllocOptimizationPluginChunk(struct _cmsContext_struct* ctx,
                                       const struct _cmsContext_struct* src)
1894{
if (src != NULL((void*)0)) {

      // Copy all linked list
     DupPluginOptimizationList(ctx, src);
  }
  else {
      static _cmsOptimizationPluginChunkType OptimizationPluginChunkType = { NULL((void*)0) };
      ctx ->chunks[OptimizationPlugin] = _cmsSubAllocDup(ctx ->MemPool, &OptimizationPluginChunkType, sizeof(_cmsOptimizationPluginChunkType));
  }
1904}


1907// Register new ways to optimize
1908cmsBool  _cmsRegisterOptimizationPlugin(cmsContext ContextID, cmsPluginBase* Data)
1909{
  cmsPluginOptimization* Plugin = (cmsPluginOptimization*) Data;
  _cmsOptimizationPluginChunkType* ctx = ( _cmsOptimizationPluginChunkType*) _cmsContextGetClientChunk(ContextID, OptimizationPlugin);
  _cmsOptimizationCollection* fl;

  if (Data == NULL((void*)0)) {

      ctx->OptimizationCollection = NULL((void*)0);
      return TRUE1;
  }

  // Optimizer callback is required
  if (Plugin ->OptimizePtr == NULL((void*)0)) return FALSE0;

  fl = (_cmsOptimizationCollection*) _cmsPluginMalloc(ContextID, sizeof(_cmsOptimizationCollection));
  if (fl == NULL((void*)0)) return FALSE0;

  // Copy the parameters
  fl ->OptimizePtr = Plugin ->OptimizePtr;

  // Keep linked list
  fl ->Next = ctx->OptimizationCollection;

  // Set the head
  ctx ->OptimizationCollection = fl;

  // All is ok
  return TRUE1;
1937}

1939// The entry point for LUT optimization
1940cmsBool CMSEXPORT _cmsOptimizePipeline(cmsContext ContextID,
                           cmsPipeline**    PtrLut,
                           cmsUInt32Number  Intent,
                           cmsUInt32Number* InputFormat,
                           cmsUInt32Number* OutputFormat,
                           cmsUInt32Number* dwFlags)
1946{
  _cmsOptimizationPluginChunkType* ctx = ( _cmsOptimizationPluginChunkType*) _cmsContextGetClientChunk(ContextID, OptimizationPlugin);
  _cmsOptimizationCollection* Opts;
  cmsBool AnySuccess = FALSE0;

  // A CLUT is being asked, so force this specific optimization
  if (*dwFlags & cmsFLAGS_FORCE_CLUT0x0002) {

      PreOptimize(*PtrLut);
      return OptimizeByResampling(PtrLut, Intent, InputFormat, OutputFormat, dwFlags);
  }

  // Anything to optimize?
  if ((*PtrLut) ->Elements == NULL((void*)0)) {
      _cmsPipelineSetOptimizationParameters(*PtrLut, FastIdentity16, (void*) *PtrLut, NULL((void*)0), NULL((void*)0));
      return TRUE1;
  }

  // Try to get rid of identities and trivial conversions.
  AnySuccess = PreOptimize(*PtrLut);

  // After removal do we end with an identity?
  if ((*PtrLut) ->Elements == NULL((void*)0)) {
      _cmsPipelineSetOptimizationParameters(*PtrLut, FastIdentity16, (void*) *PtrLut, NULL((void*)0), NULL((void*)0));
      return TRUE1;
  }

  // Do not optimize, keep all precision
  if (*dwFlags & cmsFLAGS_NOOPTIMIZE0x0100)
      return FALSE0;

  // Try plug-in optimizations
  for (Opts = ctx->OptimizationCollection;
       Opts != NULL((void*)0);
       Opts = Opts ->Next) {

          // If one schema succeeded, we are done
          if (Opts ->OptimizePtr(PtrLut, Intent, InputFormat, OutputFormat, dwFlags)) {

              return TRUE1;    // Optimized!
          }
  }

 // Try built-in optimizations
  for (Opts = DefaultOptimization;
       Opts != NULL((void*)0);
       Opts = Opts ->Next) {

          if (Opts ->OptimizePtr(PtrLut, Intent, InputFormat, OutputFormat, dwFlags)) {

              return TRUE1;
          }
  }

  // Only simple optimizations succeeded
  return AnySuccess;
2002}


