enum NumComponents {
Three = 3,
Four = 4,
Max = Four,
};
/* Assumes t - startOffset is on the stack and does a linear interpolation on t betweenstartOffsetandendOffsetfromprevColortocurColor(foreachcolor component),leavingtheresultincomponentorderonthestack. @paramrangeendOffset-startOffset @parambeginColorThepreviouscolor. @paramendColorThecurrentcolor. @paramnumComponentsThenumberofcomponents(3or4ifalphaisneeded). @paramresultTheresultpsfunction.
*/ staticvoid interpolate_color_code(SkScalar range, NumComponents numComponents,
SkColor4f prevColor, SkColor4f curColor,
SkDynamicMemoryWStream* result) {
SkASSERT(range != SkIntToScalar(0));
/* Linearly interpolate from the previous color to the current. Takethecomponents0..1anddeterminethemultipliersforinterpolation. C{r,g,b}(t,section)=t-offset_(section-1)+t*Multiplier{r,g,b}.
*/
// Figure out how to scale each color component.
SkScalar multiplier[NumComponents::Max]; for (int i = 0; i < numComponents; i++) {
multiplier[i] = (curColor[i] - prevColor[i]) / range;
}
// Calculate when we no longer need to keep a copy of the input parameter t. // If the last component to use t is i, then dupInput[0..i - 1] = true // and dupInput[i .. components] = false. bool dupInput[NumComponents::Max];
dupInput[numComponents - 1] = false; for (int i = numComponents - 2; i >= 0; i--) {
dupInput[i] = dupInput[i + 1] || multiplier[i + 1] != 0;
}
if (!dupInput[0] && multiplier[0] == 0) {
result->writeText("pop ");
}
for (int i = 0; i < numComponents; i++) { // If the next components needs t and this component will consume a // copy, make another copy. if (dupInput[i] && multiplier[i] != 0) {
result->writeText("dup ");
}
if (multiplier[i] == 0) {
SkPDFUtils::AppendColorComponentF(prevColor[i], result);
result->writeText(" ");
} else { if (multiplier[i] != 1) {
SkPDFUtils::AppendScalar(multiplier[i], result);
result->writeText(" mul ");
} if (prevColor[i] != 0) {
SkPDFUtils::AppendColorComponentF(prevColor[i], result);
result->writeText(" add ");
}
}
if (dupInput[i]) {
result->writeText("exch ");
}
}
}
// Convert { r, g, b, a } to a == 0 ? {0 0 0} : { r/a, g/a, b/a } staticvoid unpremul(const SkShaderBase::GradientInfo& info, SkDynamicMemoryWStream* function) { // Preview Version 11.0 (1069.7.1) aborts the function if the predicate is like // "dup 0 eq" or any other use of "eq" with "a".
function->writeText("dup abs 0.00001 lt" "{ pop pop pop pop 0 0 0 }" "{" " dup"// r g b a a " 3 1 roll"// r g a b a " div"// r g a b/a " 4 1 roll"// b/a r g a " dup"// b/a r g a a " 3 1 roll"// b/a r a g a " div"// b/a r a g/a " 4 1 roll"// g/a b/a r a " div"// g/a b/a r/a " 3 1 roll"// r/a g/a b/a "} ifelse\n");
}
// Each range check tests 0 < t <= end. if (top) {
SkASSERT(first); // t may have been set to 0 to signal that the answer has already been found.
result->writeText("dup dup 0 gt exch "); // In Preview 11.0 (1033.3) `0. 0 ne` is true.
SkPDFUtils::AppendScalar(rangeEnd, result);
result->writeText(" le and {\n");
} elseif (first) { // After the top level check, only t <= end needs to be tested on if (lo) side.
result->writeText("dup ");
SkPDFUtils::AppendScalar(rangeEnd, result);
result->writeText(" le {\n");
} else { // The else (hi) side.
result->writeText("{\n");
}
if (rangeEnds.size() == 1) { // Set the stack to [r g b].
size_t rangeBeginIndex = rangeEndIndex - 1;
SkScalar rangeBegin = info.fColorOffsets[rangeBeginIndex];
SkPDFUtils::AppendScalar(rangeBegin, result);
result->writeText(" sub "); // consume t, put t - startOffset on the stack.
interpolate_color_code(rangeEnd - rangeBegin, numComponents,
info.fColors[rangeBeginIndex], info.fColors[rangeEndIndex], result);
result->writeText("\n");
} else {
size_t loCount = rangeEnds.size() / 2;
SkSpan<size_t> loSpan = rangeEnds.subspan(0, loCount);
write_gradient_ranges(info, loSpan, numComponents, false, true, result);
if (top) { // Put 0 on the stack for t once here instead of after every call to interpolate_color_code.
result->writeText("0} if\n");
} elseif (first) {
result->writeText("}"); // The else (hi) side will come next.
} else {
result->writeText("} ifelse\n");
}
}
/* Generate Type 4 function code to map t to the passed gradient, clamping at the ends. Thetypesinteger,real,andbooleanareavailable. Therearenostring,array,procedure,variable,ornametypesavailable.
dup0le{pop0000}if dupdup0gtexch1leand{ dup.5le{ dup.25le{ 0sub2mul00 }{ .25sub.5exch2mul0 }ifelse }{ dup.75le{ .5sub.5exch.5exch2mul }{ .75subdup2mul.5addexchdup2mul.5addexch2mul.5add }ifelse }ifelse 0}if 0gt{111}if
*/ staticvoid gradient_function_code(const SkShaderBase::GradientInfo& info,
SkDynamicMemoryWStream* result) { // While looking for a hit the stack is [t]. // After finding a hit the stack is [r g b 0]. // The 0 is consumed just before returning.
// The initial range has no previous and contains a solid color. // Any t <= 0 will be handled by this initial range, so later t == 0 indicates a hit was found.
result->writeText("dup 0 le {pop ");
SkPDFUtils::AppendColorComponentF(info.fColors[0].fR, result);
result->writeText(" ");
SkPDFUtils::AppendColorComponentF(info.fColors[0].fG, result);
result->writeText(" ");
SkPDFUtils::AppendColorComponentF(info.fColors[0].fB, result); if (numComponents == NumComponents::Four) {
result->writeText(" ");
SkPDFUtils::AppendColorComponentF(info.fColors[0].fA, result);
}
result->writeText(" 0} if\n");
// Optimize out ranges which don't make any visual difference.
AutoSTMalloc<4, size_t> rangeEnds(info.fColorCount);
size_t rangeEndsCount = 0; for (int i = 1; i < info.fColorCount; ++i) { // Ignoring the alpha, is this range the same solid color as the next range? // This optimizes gradients where sometimes only the color or only the alpha is changing. auto eqIgnoringAlpha = [&](SkColor4f a, SkColor4f b) { if (premul) { return a == b;
} else { return a.makeOpaque() == b.makeOpaque();
}
}; bool constantColorBothSides =
eqIgnoringAlpha(info.fColors[i-1], info.fColors[i]) &&// This range is a solid color.
i != info.fColorCount-1 && // This is not the last range.
eqIgnoringAlpha(info.fColors[i], info.fColors[i+1]); // Next range is same solid color.
// Does this range have zero size? bool degenerateRange = info.fColorOffsets[i-1] == info.fColorOffsets[i];
static std::unique_ptr<SkPDFDict> gradientStitchCode(const SkShaderBase::GradientInfo& info) { auto retval = SkPDFMakeDict();
// normalize color stops int colorCount = info.fColorCount;
std::vector<SkColor4f> colors(info.fColors, info.fColors + colorCount);
std::vector<SkScalar> colorOffsets(info.fColorOffsets, info.fColorOffsets + colorCount);
int i = 1; while (i < colorCount - 1) { // ensure stops are in order if (colorOffsets[i - 1] > colorOffsets[i]) {
colorOffsets[i] = colorOffsets[i - 1];
}
// remove points that are between 2 coincident points if ((colorOffsets[i - 1] == colorOffsets[i]) && (colorOffsets[i] == colorOffsets[i + 1])) {
colorCount -= 1;
colors.erase(colors.begin() + i);
colorOffsets.erase(colorOffsets.begin() + i);
} else {
i++;
}
} // find coincident points and slightly move them over for (i = 1; i < colorCount - 1; i++) { if (colorOffsets[i - 1] == colorOffsets[i]) {
colorOffsets[i] += 0.00001f;
}
} // check if last 2 stops coincide if (colorOffsets[i - 1] == colorOffsets[i]) {
colorOffsets[i - 1] -= 0.00001f;
}
// no need for a stitch function if there are only 2 stops. if (colorCount == 2) { return createInterpolationFunction(colors[0], colors[1]);
}
auto encode = SkPDFMakeArray(); auto bounds = SkPDFMakeArray(); auto functions = SkPDFMakeArray();
/* Map a value of t on the stack into [0, 1) for Repeat or Mirror tile mode. */ staticvoid tileModeCode(SkTileMode mode, SkDynamicMemoryWStream* result) { if (mode == SkTileMode::kRepeat) {
result->writeText("dup truncate sub\n"); // Get the fractional part.
result->writeText("dup 0 le {1 add} if\n"); // Map (-1,0) => (0,1) return;
}
if (mode == SkTileMode::kMirror) { // In Preview 11.0 (1033.3) `a n mod r eq` (with a and n both integers, r integer or real) // early aborts the function when false would be put on the stack. // Work around this by re-writing `t 2 mod 1 eq` as `t 2 mod 0 gt`.
// y = y / (p2 + p0 x + p1 y) // x = x / (p2 + p0 x + p1 y)
// Input on stack: x y
code->writeText(" dup "); // x y y
SkPDFUtils::AppendScalar(p1, code); // x y y p1
code->writeText(" mul "// x y y*p1 " 2 index "); // x y y*p1 x
SkPDFUtils::AppendScalar(p0, code); // x y y p1 x p0
code->writeText(" mul "); // x y y*p1 x*p0
SkPDFUtils::AppendScalar(p2, code); // x y y p1 x*p0 p2
code->writeText(" add "// x y y*p1 x*p0+p2 "add "// x y y*p1+x*p0+p2 "3 1 roll "// y*p1+x*p0+p2 x y "2 index "// z x y y*p1+x*p0+p2 "div "// y*p1+x*p0+p2 x y/(y*p1+x*p0+p2) "3 1 roll "// y/(y*p1+x*p0+p2) y*p1+x*p0+p2 x "exch "// y/(y*p1+x*p0+p2) x y*p1+x*p0+p2 "div "// y/(y*p1+x*p0+p2) x/(y*p1+x*p0+p2) "exch\n"); // x/(y*p1+x*p0+p2) y/(y*p1+x*p0+p2)
}
function->writeText("pop\n"); // Just ditch the y value.
tileModeCode((SkTileMode)info.fTileMode, function);
gradient_function_code(info, function);
function->writeText("}");
}
// Find the distance from the origin.
function->writeText("dup "// x y y "mul "// x y^2 "exch "// y^2 x "dup "// y^2 x x "mul "// y^2 x^2 "add "// y^2+x^2 "sqrt\n"); // sqrt(y^2+x^2)
/* Conical gradient shader, based on the Canvas spec for radial gradients See:http://www.w3.org/TR/2dcontext/#dom-context-2d-createradialgradient
*/ staticvoid twoPointConicalCode(const SkShaderBase::GradientInfo& info, const SkMatrix& perspectiveRemover,
SkDynamicMemoryWStream* function) {
SkScalar dx = info.fPoint[1].fX - info.fPoint[0].fX;
SkScalar dy = info.fPoint[1].fY - info.fPoint[0].fY;
SkScalar r0 = info.fRadius[0];
SkScalar dr = info.fRadius[1] - info.fRadius[0];
SkScalar a = dx * dx + dy * dy - dr * dr;
// First compute t, if the pixel falls outside the cone, then we'll end // with 'false' on the stack, otherwise we'll push 'true' with t below it
// We start with a stack of (x y), copy it and then consume one copy in // order to calculate b and the other to calculate c.
function->writeText("{");
// if r(t) < 0, then it's outside the cone
function->writeText("0 lt {pop false} {true} ifelse\n");
} else {
// quadratic case: the Canvas spec wants the largest // root t for which radius(t) > 0
// compute the discriminant (b^2 - 4ac)
SkPDFUtils::AppendScalar(a * 4, function);
function->writeText(" mul sub dup\n");
// if d >= 0, proceed
function->writeText("0 ge {\n");
// an intermediate value we'll use to compute the roots: // q = -0.5 * (b +/- sqrt(d))
function->writeText("sqrt exch dup 0 lt {exch -1 mul} if");
function->writeText(" add -0.5 mul dup\n");
// first root = q / a
SkPDFUtils::AppendScalar(a, function);
function->writeText(" div\n");
// second root = c / q
function->writeText("3 1 roll div\n");
// put the larger root on top of the stack
function->writeText("2 copy gt {exch} if\n");
// compute radius(t) for larger root
function->writeText("dup ");
SkPDFUtils::AppendScalar(dr, function);
function->writeText(" mul ");
SkPDFUtils::AppendScalar(r0, function);
function->writeText(" add\n");
// if r(t) > 0, we have our t, pop off the smaller root and we're done
function->writeText(" 0 gt {exch pop true}\n");
// otherwise, throw out the larger one and try the smaller root
function->writeText("{pop dup\n");
SkPDFUtils::AppendScalar(dr, function);
function->writeText(" mul ");
SkPDFUtils::AppendScalar(r0, function);
function->writeText(" add\n");
// if r(t) < 0, push false, otherwise the smaller root is our t
function->writeText("0 le {pop false} {true} ifelse\n");
function->writeText("} ifelse\n");
// d < 0, clear the stack and push false
function->writeText("} {pop pop pop false} ifelse\n");
}
// if the pixel is in the cone, proceed to compute a color
function->writeText("{");
tileModeCode((SkTileMode)info.fTileMode, function);
gradient_function_code(info, function);
// otherwise, just write black // TODO: Correctly draw gradients_local_persepective, need to mask out this black // The "gradients" gm works as falls into the 8.7.4.5.4 "Type 3 (Radial) Shadings" case.
function->writeText("} {0 0 0} ifelse }");
}
// catch cases where the inner just touches the outer circle // and make the inner circle just inside the outer one to match raster staticvoid FixUpRadius(const SkPoint& p1, SkScalar& r1, const SkPoint& p2, SkScalar& r2) { // detect touching circles float distance = SkPoint::Distance(p1, p2); float subtractRadii = fabsf(r1 - r2); if (fabsf(distance - subtractRadii) < 0.002f) { if (r1 > r2) {
r1 += 0.002f;
} else {
r2 += 0.002f;
}
}
}
// Finds affine and persp such that in = affine * persp. // but it returns the inverse of perspective matrix. staticbool split_perspective(const SkMatrix in, SkMatrix* affine,
SkMatrix* perspectiveInverse) { const SkScalar p2 = in[SkMatrix::kMPersp2];
if (SkScalarNearlyZero(p2)) { returnfalse;
}
const SkScalar zero = SkIntToScalar(0); const SkScalar one = SkIntToScalar(1);
// Transform the coordinate space for the type of gradient.
transformPoints[0] = info.fPoint[0];
transformPoints[1] = info.fPoint[1]; switch (state.fType) { case SkShaderBase::GradientType::kLinear: break; case SkShaderBase::GradientType::kRadial:
transformPoints[1] = transformPoints[0];
transformPoints[1].fX += info.fRadius[0]; break; case SkShaderBase::GradientType::kConical: {
transformPoints[1] = transformPoints[0];
transformPoints[1].fX += SK_Scalar1; break;
} case SkShaderBase::GradientType::kSweep:
transformPoints[1] = transformPoints[0];
transformPoints[1].fX += SK_Scalar1; break; case SkShaderBase::GradientType::kNone: default: return SkPDFIndirectReference();
}
// Move any scaling (assuming a unit gradient) or translation // (and rotation for linear gradient), of the final gradient from // info.fPoints to the matrix (updating bbox appropriately). Now // the gradient can be drawn on on the unit segment.
SkMatrix mapperMatrix;
unit_to_points_matrix(transformPoints, &mapperMatrix);
finalMatrix.preConcat(mapperMatrix);
// Preserves as much as possible in the final matrix, and only removes // the perspective. The inverse of the perspective is stored in // perspectiveInverseOnly matrix and has 3 useful numbers // (p0, p1, p2), while everything else is either 0 or 1. // In this way the shader will handle it eficiently, with minimal code.
SkMatrix perspectiveInverseOnly = SkMatrix::I(); if (finalMatrix.hasPerspective()) { if (!split_perspective(finalMatrix,
&finalMatrix, &perspectiveInverseOnly)) { return SkPDFIndirectReference();
}
}
SkRect bbox;
bbox.set(state.fBBox); if (!SkPDFUtils::InverseTransformBBox(finalMatrix, &bbox)) { return SkPDFIndirectReference();
}
SkDynamicMemoryWStream functionCode; switch (state.fType) { case SkShaderBase::GradientType::kLinear:
linearCode(info, perspectiveInverseOnly, &functionCode); break; case SkShaderBase::GradientType::kRadial:
radialCode(info, perspectiveInverseOnly, &functionCode); break; case SkShaderBase::GradientType::kConical: { // The two point radial gradient further references state.fInfo // in translating from x, y coordinates to the t parameter. So, we have // to transform the points and radii according to the calculated matrix. auto inverseMapperMatrix = mapperMatrix.invert(); if (!inverseMapperMatrix) { return SkPDFIndirectReference();
}
SkShaderBase::GradientInfo infoCopy = info;
inverseMapperMatrix->mapPoints(infoCopy.fPoint);
infoCopy.fRadius[0] = inverseMapperMatrix->mapRadius(info.fRadius[0]);
infoCopy.fRadius[1] = inverseMapperMatrix->mapRadius(info.fRadius[1]);
twoPointConicalCode(infoCopy, perspectiveInverseOnly, &functionCode);
} break; case SkShaderBase::GradientType::kSweep:
sweepCode(info, perspectiveInverseOnly, &functionCode); break; default:
SkASSERT(false);
}
pdfShader->insertObject( "Domain", SkPDFMakeArray(bbox.left(), bbox.right(), bbox.top(), bbox.bottom()));
// Creates a content stream which fills the pattern P0 across bounds. // @param gsIndex A graphics state resource index to apply, or <0 if no // graphics state to apply. static std::unique_ptr<SkStreamAsset> create_pattern_fill_content(int gsIndex, int patternIndex,
SkRect& bounds) {
SkDynamicMemoryWStream content; if (gsIndex >= 0) {
SkPDFUtils::ApplyGraphicState(gsIndex, &content);
}
SkPDFUtils::ApplyPattern(patternIndex, &content);
SkPDFUtils::AppendRectangle(bounds, &content);
SkPDFUtils::PaintPath(SkPaint::kFill_Style, SkPathFillType::kEvenOdd, &content); return content.detachAsStream();
}
staticbool gradient_has_alpha(const SkPDFGradientShader::Key& key) {
SkASSERT(key.fType != SkShaderBase::GradientType::kNone); for (int i = 0; i < key.fInfo.fColorCount; i++) { if (!key.fInfo.fColors[i].isOpaque()) { return true;
}
} returnfalse;
}
// warning: does not set fHash on new key. (Both callers need to change fields.) static SkPDFGradientShader::Key clone_key(const SkPDFGradientShader::Key& k) {
SkPDFGradientShader::Key clone = {
k.fType,
k.fInfo, // change pointers later.
std::unique_ptr<SkColor4f[]>(new SkColor4f[k.fInfo.fColorCount]),
std::unique_ptr<SkScalar[]>(new SkScalar[k.fInfo.fColorCount]),
k.fCanvasTransform,
k.fShaderTransform,
k.fBBox, 0};
clone.fInfo.fColors = clone.fColors.get();
clone.fInfo.fColorOffsets = clone.fStops.get(); for (int i = 0; i < clone.fInfo.fColorCount; i++) {
clone.fInfo.fColorOffsets[i] = k.fInfo.fColorOffsets[i];
clone.fInfo.fColors[i] = k.fInfo.fColors[i];
} return clone;
}
¤ Diese beiden folgenden Angebotsgruppen bietet das Unternehmen0.24Angebot
(Wie Sie bei der Firma Beratungs- und Dienstleistungen beauftragen können 2026-08-26)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.