Lines Matching defs:Curves
92 // Curves, optimization is shared between 8 and 16 bits
97 int nCurves; // Number of curves
98 int nElements; // Elements in curves
99 cmsUInt16Number** Curves; // Points to a dynamically allocated array
433 // Try to see if the curves of a given MPE are linear
437 cmsToneCurve** Curves;
440 Curves = _cmsStageGetPtrToCurveSet(mpe);
441 if (Curves == NULL) return FALSE;
446 if (!cmsIsToneCurveLinear(Curves[i])) return FALSE;
577 // We need to interpolate white points of both, pre and post curves
580 cmsToneCurve** Curves = _cmsStageGetPtrToCurveSet(PreLin);
583 WhiteIn[i] = cmsEvalToneCurve16(Curves[i], WhitePointIn[i]);
595 cmsToneCurve** Curves = _cmsStageGetPtrToCurveSet(PostLin);
599 cmsToneCurve* InversePostLin = cmsReverseToneCurve(Curves[i]);
623 // prelinearization curves, a CLUT of nGridPoints and optional postlinearization tables.
624 // These curves have to exist in the original LUT in order to be used in the simplified output.
626 // LUTS with all curves will be simplified to a single curve. Parametric curves are lost.
728 // The source LUT whithout pre/post curves is passed as parameter.
802 // Descending curves are handled as well.
999 // Curves that contain wide empty areas are not optimizeable
1072 // If the last stage of the original lut are curves, and those curves are
1093 // Populate the curves
1110 // Slope-limit the obtained curves
1134 // Invert curves if possible
1140 // Now inset the reversed curves at the begin of transform
1153 // Create and insert the curves at the beginning
1237 // Curves optimizer ------------------------------------------------------------------------------------------------------------------
1247 _cmsFree(ContextID, Data ->Curves[i]);
1250 _cmsFree(ContextID, Data ->Curves);
1262 Data->Curves = (cmsUInt16Number**) _cmsDupMem(ContextID, Data->Curves, Data->nCurves * sizeof(cmsUInt16Number*));
1265 Data->Curves[i] = (cmsUInt16Number*) _cmsDupMem(ContextID, Data->Curves[i], Data->nElements * sizeof(cmsUInt16Number));
1284 c16->Curves = (cmsUInt16Number**) _cmsCalloc(ContextID, nCurves, sizeof(cmsUInt16Number*));
1285 if (c16 ->Curves == NULL) return NULL;
1289 c16->Curves[i] = (cmsUInt16Number*) _cmsCalloc(ContextID, nElements, sizeof(cmsUInt16Number));
1291 if (c16->Curves[i] == NULL) {
1294 _cmsFree(ContextID, c16->Curves[j]);
1296 _cmsFree(ContextID, c16->Curves);
1305 c16 ->Curves[i][j] = cmsEvalToneCurve16(G[i], FROM_8_TO_16(j));
1311 c16 ->Curves[i][j] = cmsEvalToneCurve16(G[i], (cmsUInt16Number) j);
1331 Out[i] = Data -> Curves[i][x];
1345 Out[i] = Data -> Curves[i][In[i]];
1364 // If the target LUT holds only curves, the optimization procedure is to join all those
1365 // curves together. That only works on curves and does not work on matrices.
1381 // Only curves in this LUT?
1392 // Create target curves
1426 // Maybe the curves are linear at the end
1432 // If the curves are to be applied in 8 bits, we can save memory
1750 // If identity on matrix, we can further optimize the curves, so call the join curves routine
1791 // The built-in list. We currently implement 4 types of optimizations. Joining of curves, matrix-shaper, linearization and resampling
