0N/A/*
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
2362N/A * published by the Free Software Foundation. Oracle designates this
0N/A * particular file as subject to the "Classpath" exception as provided
2362N/A * by Oracle in the LICENSE file that accompanied this code.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A */
0N/A
0N/A// This file is available under and governed by the GNU General Public
0N/A// License version 2 only, as published by the Free Software Foundation.
0N/A// However, the following notice accompanied the original version of this
0N/A// file:
0N/A//
2693N/A//---------------------------------------------------------------------------------
0N/A//
2693N/A// Little Color Management System
6271N/A// Copyright (c) 1998-2012 Marti Maria Saguer
0N/A//
0N/A// Permission is hereby granted, free of charge, to any person obtaining
0N/A// a copy of this software and associated documentation files (the "Software"),
0N/A// to deal in the Software without restriction, including without limitation
0N/A// the rights to use, copy, modify, merge, publish, distribute, sublicense,
0N/A// and/or sell copies of the Software, and to permit persons to whom the Software
0N/A// is furnished to do so, subject to the following conditions:
0N/A//
0N/A// The above copyright notice and this permission notice shall be included in
0N/A// all copies or substantial portions of the Software.
0N/A//
0N/A// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
0N/A// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO
0N/A// THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
0N/A// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
0N/A// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
0N/A// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
0N/A// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
2693N/A//
2693N/A//---------------------------------------------------------------------------------
2693N/A//
0N/A
2693N/A#include "lcms2_internal.h"
0N/A
0N/A
2693N/A#define DSWAP(x, y) {cmsFloat64Number tmp = (x); (x)=(y); (y)=tmp;}
0N/A
0N/A
2693N/A// Initiate a vector
2693N/Avoid CMSEXPORT _cmsVEC3init(cmsVEC3* r, cmsFloat64Number x, cmsFloat64Number y, cmsFloat64Number z)
0N/A{
2693N/A r -> n[VX] = x;
2693N/A r -> n[VY] = y;
2693N/A r -> n[VZ] = z;
0N/A}
0N/A
2693N/A// Vector substraction
2693N/Avoid CMSEXPORT _cmsVEC3minus(cmsVEC3* r, const cmsVEC3* a, const cmsVEC3* b)
0N/A{
0N/A r -> n[VX] = a -> n[VX] - b -> n[VX];
0N/A r -> n[VY] = a -> n[VY] - b -> n[VY];
0N/A r -> n[VZ] = a -> n[VZ] - b -> n[VZ];
0N/A}
0N/A
2693N/A// Vector cross product
2693N/Avoid CMSEXPORT _cmsVEC3cross(cmsVEC3* r, const cmsVEC3* u, const cmsVEC3* v)
0N/A{
0N/A r ->n[VX] = u->n[VY] * v->n[VZ] - v->n[VY] * u->n[VZ];
0N/A r ->n[VY] = u->n[VZ] * v->n[VX] - v->n[VZ] * u->n[VX];
0N/A r ->n[VZ] = u->n[VX] * v->n[VY] - v->n[VX] * u->n[VY];
0N/A}
0N/A
2693N/A// Vector dot product
2693N/AcmsFloat64Number CMSEXPORT _cmsVEC3dot(const cmsVEC3* u, const cmsVEC3* v)
2693N/A{
2693N/A return u->n[VX] * v->n[VX] + u->n[VY] * v->n[VY] + u->n[VZ] * v->n[VZ];
2693N/A}
0N/A
2693N/A// Euclidean length
2693N/AcmsFloat64Number CMSEXPORT _cmsVEC3length(const cmsVEC3* a)
0N/A{
0N/A return sqrt(a ->n[VX] * a ->n[VX] +
0N/A a ->n[VY] * a ->n[VY] +
0N/A a ->n[VZ] * a ->n[VZ]);
0N/A}
0N/A
2693N/A// Euclidean distance
2693N/AcmsFloat64Number CMSEXPORT _cmsVEC3distance(const cmsVEC3* a, const cmsVEC3* b)
0N/A{
2693N/A cmsFloat64Number d1 = a ->n[VX] - b ->n[VX];
2693N/A cmsFloat64Number d2 = a ->n[VY] - b ->n[VY];
2693N/A cmsFloat64Number d3 = a ->n[VZ] - b ->n[VZ];
0N/A
0N/A return sqrt(d1*d1 + d2*d2 + d3*d3);
0N/A}
0N/A
0N/A
0N/A
2693N/A// 3x3 Identity
2693N/Avoid CMSEXPORT _cmsMAT3identity(cmsMAT3* a)
0N/A{
2693N/A _cmsVEC3init(&a-> v[0], 1.0, 0.0, 0.0);
2693N/A _cmsVEC3init(&a-> v[1], 0.0, 1.0, 0.0);
2693N/A _cmsVEC3init(&a-> v[2], 0.0, 0.0, 1.0);
2693N/A}
2693N/A
2693N/Astatic
2693N/AcmsBool CloseEnough(cmsFloat64Number a, cmsFloat64Number b)
2693N/A{
2693N/A return fabs(b - a) < (1.0 / 65535.0);
0N/A}
0N/A
0N/A
2693N/AcmsBool CMSEXPORT _cmsMAT3isIdentity(const cmsMAT3* a)
2693N/A{
2693N/A cmsMAT3 Identity;
2693N/A int i, j;
2693N/A
2693N/A _cmsMAT3identity(&Identity);
2693N/A
2693N/A for (i=0; i < 3; i++)
2693N/A for (j=0; j < 3; j++)
2693N/A if (!CloseEnough(a ->v[i].n[j], Identity.v[i].n[j])) return FALSE;
2693N/A
2693N/A return TRUE;
2693N/A}
0N/A
0N/A
0N/A// Multiply two matrices
2693N/Avoid CMSEXPORT _cmsMAT3per(cmsMAT3* r, const cmsMAT3* a, const cmsMAT3* b)
0N/A{
0N/A#define ROWCOL(i, j) \
0N/A a->v[i].n[0]*b->v[0].n[j] + a->v[i].n[1]*b->v[1].n[j] + a->v[i].n[2]*b->v[2].n[j]
0N/A
2693N/A _cmsVEC3init(&r-> v[0], ROWCOL(0,0), ROWCOL(0,1), ROWCOL(0,2));
2693N/A _cmsVEC3init(&r-> v[1], ROWCOL(1,0), ROWCOL(1,1), ROWCOL(1,2));
2693N/A _cmsVEC3init(&r-> v[2], ROWCOL(2,0), ROWCOL(2,1), ROWCOL(2,2));
0N/A
0N/A#undef ROWCOL //(i, j)
0N/A}
0N/A
0N/A
0N/A
0N/A// Inverse of a matrix b = a^(-1)
2693N/AcmsBool CMSEXPORT _cmsMAT3inverse(const cmsMAT3* a, cmsMAT3* b)
0N/A{
2693N/A cmsFloat64Number det, c0, c1, c2;
0N/A
2693N/A c0 = a -> v[1].n[1]*a -> v[2].n[2] - a -> v[1].n[2]*a -> v[2].n[1];
2693N/A c1 = -a -> v[1].n[0]*a -> v[2].n[2] + a -> v[1].n[2]*a -> v[2].n[0];
2693N/A c2 = a -> v[1].n[0]*a -> v[2].n[1] - a -> v[1].n[1]*a -> v[2].n[0];
0N/A
2693N/A det = a -> v[0].n[0]*c0 + a -> v[0].n[1]*c1 + a -> v[0].n[2]*c2;
0N/A
2693N/A if (fabs(det) < MATRIX_DET_TOLERANCE) return FALSE; // singular matrix; can't invert
0N/A
2693N/A b -> v[0].n[0] = c0/det;
2693N/A b -> v[0].n[1] = (a -> v[0].n[2]*a -> v[2].n[1] - a -> v[0].n[1]*a -> v[2].n[2])/det;
2693N/A b -> v[0].n[2] = (a -> v[0].n[1]*a -> v[1].n[2] - a -> v[0].n[2]*a -> v[1].n[1])/det;
2693N/A b -> v[1].n[0] = c1/det;
2693N/A b -> v[1].n[1] = (a -> v[0].n[0]*a -> v[2].n[2] - a -> v[0].n[2]*a -> v[2].n[0])/det;
2693N/A b -> v[1].n[2] = (a -> v[0].n[2]*a -> v[1].n[0] - a -> v[0].n[0]*a -> v[1].n[2])/det;
2693N/A b -> v[2].n[0] = c2/det;
2693N/A b -> v[2].n[1] = (a -> v[0].n[1]*a -> v[2].n[0] - a -> v[0].n[0]*a -> v[2].n[1])/det;
2693N/A b -> v[2].n[2] = (a -> v[0].n[0]*a -> v[1].n[1] - a -> v[0].n[1]*a -> v[1].n[0])/det;
0N/A
2693N/A return TRUE;
0N/A}
0N/A
0N/A
0N/A// Solve a system in the form Ax = b
2693N/AcmsBool CMSEXPORT _cmsMAT3solve(cmsVEC3* x, cmsMAT3* a, cmsVEC3* b)
0N/A{
2693N/A cmsMAT3 m, a_1;
0N/A
2693N/A memmove(&m, a, sizeof(cmsMAT3));
0N/A
2693N/A if (!_cmsMAT3inverse(&m, &a_1)) return FALSE; // Singular matrix
0N/A
2693N/A _cmsMAT3eval(x, &a_1, b);
1002N/A return TRUE;
0N/A}
0N/A
2693N/A// Evaluate a vector across a matrix
2693N/Avoid CMSEXPORT _cmsMAT3eval(cmsVEC3* r, const cmsMAT3* a, const cmsVEC3* v)
0N/A{
0N/A r->n[VX] = a->v[0].n[VX]*v->n[VX] + a->v[0].n[VY]*v->n[VY] + a->v[0].n[VZ]*v->n[VZ];
0N/A r->n[VY] = a->v[1].n[VX]*v->n[VX] + a->v[1].n[VY]*v->n[VY] + a->v[1].n[VZ]*v->n[VZ];
0N/A r->n[VZ] = a->v[2].n[VX]*v->n[VX] + a->v[2].n[VY]*v->n[VY] + a->v[2].n[VZ]*v->n[VZ];
0N/A}
0N/A
6271N/A