/src/xpdf-4.06/splash/SplashXPathScanner.cc

Source
//========================================================================
//
// SplashXPathScanner.cc
//
// Copyright 2003-2013 Glyph & Cog, LLC
//
//========================================================================

#include <aconf.h>

#include <stdlib.h>
#include <string.h>
#if HAVE_STD_SORT
#include <algorithm>
#endif
#include "gmem.h"
#include "gmempp.h"
#include "GList.h"
#include "SplashMath.h"
#include "SplashXPath.h"
#include "SplashXPathScanner.h"

//------------------------------------------------------------------------

#if ANTIALIAS_256

#define aaVert  15
#define aaHoriz 17

#else

#define aaVert  4
#define aaHoriz 4

// 4x4 oversampling tends to generate alpha (coverage) values that are
// too high, so we reduce them here. (Yes, this is a kludge.)
static Guchar map16to255[17] = {
  0,
  16 / 2,
  32 / 2,
  48 / 2,
  64 - 32,
  80 - 32,
  96 - 32,
  112 - 32,
  128 - 32,
  143 - 32,
  159 - 32,
  175 - 32,
  191 - 32,
  207 - 32,
  223 - 32,
  239 - 32,
  255
};

#endif

//------------------------------------------------------------------------

SplashXPathScanner::SplashXPathScanner(SplashXPath *xPathA, GBool eo,
               int yMinA, int yMaxA) {
  xPath = xPathA;
  eoMask = eo ? 1 : 0xffffffff;
  yMin = yMinA;
  yMax = yMaxA;
  if (xPath->isRect) {
    rectX0I = splashFloor(xPath->rectX0);
    rectY0I = splashFloor(xPath->rectY0);
    rectX1I = splashFloor(xPath->rectX1);
    rectY1I = splashFloor(xPath->rectY1);
  }

  pre = &preSeg;
  post = &postSeg;
  pre->mx = xPath->xMin - 1;
  post->mx = xPath->xMax + 1;

  resetDone = gFalse;
  resetAA = gFalse;
}

SplashXPathScanner::~SplashXPathScanner() {
}

void SplashXPathScanner::insertSegmentBefore(SplashXPathSeg *s,
               SplashXPathSeg *sNext) {
  SplashXPathSeg *sPrev;

  sPrev = sNext->prev;
  sPrev->next = s;
  s->prev = sPrev;
  s->next = sNext;
  sNext->prev = s;
}

void SplashXPathScanner::removeSegment(SplashXPathSeg *s) {
  SplashXPathSeg *sPrev, *sNext;

  sPrev = s->prev;
  sNext = s->next;
  sPrev->next = sNext;
  sNext->prev = sPrev;
  s->prev = s->next = NULL;
}

void SplashXPathScanner::moveSegmentAfter(SplashXPathSeg *s,
            SplashXPathSeg *sPrev) {
  SplashXPathSeg *sNext;

  s->prev->next = s->next;
  s->next->prev = s->prev;

  sNext = sPrev->next;
  sPrev->next = s;
  s->prev = sPrev;
  s->next = sNext;
  sNext->prev = s;
}

void SplashXPathScanner::reset(GBool aa, GBool aaChanged) {
  SplashXPathSeg *seg;
  SplashCoord y;
  int i;

  //--- initialize segment parameters
  for (i = 0; i < xPath->length; ++i) {
    seg = &xPath->segs[i];
    if (aa) {
      if (aaChanged) {
  seg->iy = splashFloor(seg->y0 * aaVert);
      }
      y = (SplashCoord)(seg->iy + 1) / (SplashCoord)aaVert;
    } else {
      if (aaChanged) {
  seg->iy = splashFloor(seg->y0);
      }
      y = (SplashCoord)(seg->iy + 1);
    }
    seg->sx0 = seg->x0;
    if (seg->y1 <= y) {
      seg->sx1 = seg->x1;
    } else {
      seg->sx1 = seg->x0 + (y - seg->y0) * seg->dxdy;
    }
    seg->mx = (seg->sx0 <= seg->sx1) ? seg->sx0 : seg->sx1;
    seg->prev = seg->next = NULL;
  }

  //--- sort the inactive segments by iy, mx
  if (aaChanged) {
#if HAVE_STD_SORT
    std::sort(xPath->segs, xPath->segs + xPath->length, &SplashXPathSeg::cmpMX);
#else
    qsort(xPath->segs, xPath->length, sizeof(SplashXPathSeg),
    &SplashXPathSeg::cmpMX);
#endif
  }

  //--- initialize the active list
  pre->prev = NULL;
  pre->next = post;
  post->prev = pre;
  post->next = NULL;

  //--- initialize the scan state
  nextSeg = 0;
  if (xPath->length) {
    yBottomI = xPath->segs[0].iy;
    if (aa) {
      yBottomI -= yBottomI % aaVert;
    }
  } else {
    yBottomI = 0;
  }
  yTopI = yBottomI - 1;
  if (aa) {
    yTop = (SplashCoord)yTopI / (SplashCoord)aaVert;
    yBottom = (SplashCoord)yBottomI / (SplashCoord)aaVert;
  } else {
    yTop = (SplashCoord)yTopI;
    yBottom = (SplashCoord)yBottomI;
  }

  resetDone = gTrue;
  resetAA = aa;
}

void SplashXPathScanner::skip(int newYBottomI, GBool aa) {
  SplashXPathSeg *s0, *s1,*s2;
  int iy;

  yTopI = newYBottomI - 1;
  yBottomI = newYBottomI;
  if (aa) {
    yTop = (SplashCoord)yTopI / (SplashCoord)aaVert;
    yBottom = (SplashCoord)yBottomI / (SplashCoord)aaVert;
  } else {
    yTop = (SplashCoord)yTopI;
    yBottom = (SplashCoord)yBottomI;
  }

  //--- remove finished segments; update sx0, sx1, mx for active segments
  s0 = pre->next;
  while (s0 != post) {
    s1 = s0->next;

    // check for a finished segment
    if (s0->y1 < yTop) {
      removeSegment(s0);

    // compute sx0, sx1, mx
    } else {
      if (s0->y0 >= yTop) {
  s0->sx0 = s0->x0;
      } else {
  s0->sx0 = s0->x0 + (yTop - s0->y0) * s0->dxdy;
      }
      if (s0->y1 <= yBottom) {
  s0->sx1 = s0->x1;
      } else {
  s0->sx1 = s0->x0 + (yBottom - s0->y0) * s0->dxdy;
      }
      s0->mx = (s0->sx0 <= s0->sx1) ? s0->sx0 : s0->sx1;
    }

    s0 = s1;
  }

  //--- check for intersections
  s0 = pre->next;
  if (s0 != post) {
    s1 = s0->next;
    while (s1 != post) {
      if (s1->mx < s0->mx) {
  for (s2 = s0->prev; s1->mx < s2->mx; s2 = s2->prev) ;
  moveSegmentAfter(s1, s2);
      } else {
  s0 = s1;
      }
      s1 = s0->next;
    }
  }

  //--- insert new segments with a merge sort
  // - this has to be done one (sub)scanline at a time, because the
  //   inactive list is bin-sorted by (sub)scanline
  while (nextSeg < xPath->length && xPath->segs[nextSeg].iy <= yTopI) {
    // the first inactive segment determines the next scanline to process
    iy = xPath->segs[nextSeg].iy;
    s0 = pre->next;
    do {
      s1 = &xPath->segs[nextSeg];
      ++nextSeg;
      if (s1->y1 < yTop) {
  continue;
      }
      if (s1->y0 >= yTop) {
  s1->sx0 = s1->x0;
      } else {
  s1->sx0 = s1->x0 + (yTop - s1->y0) * s1->dxdy;
      }
      if (s1->y1 <= yBottom) {
  s1->sx1 = s1->x1;
      } else {
  s1->sx1 = s1->x0 + (yBottom - s1->y0) * s1->dxdy;
      }
      s1->mx = (s1->sx0 <= s1->sx1) ? s1->sx0 : s1->sx1;
      insertSegmentBefore(s1, s0);
    } while (nextSeg < xPath->length && xPath->segs[nextSeg].iy <= iy);
  }
}

void SplashXPathScanner::advance(GBool aa) {
  SplashXPathSeg *s, *sNext, *s1;

  yTopI = yBottomI;
  yTop = yBottom;
  yBottomI = yTopI + 1;
  if (aa) {
    yBottom = (SplashCoord)yBottomI / (SplashCoord)aaVert;
  } else {
    yBottom = (SplashCoord)yBottomI;
  }

  s = pre->next;
  while (s != post) {
    sNext = s->next;

    // check for a finished segment
    if (s->y1 < yTop) {
      removeSegment(s);

    } else {

      // compute sx0, sx1, mx
      s->sx0 = s->sx1;
      if (s->y1 <= yBottom) {
  s->sx1 = s->x1;
      } else {
  s->sx1 = s->x0 + (yBottom - s->y0) * s->dxdy;
      }
      s->mx = (s->sx0 <= s->sx1) ? s->sx0 : s->sx1;

      // check for intersection
      if (s->mx < s->prev->mx) {
  for (s1 = s->prev->prev; s->mx < s1->mx; s1 = s1->prev) ;
  moveSegmentAfter(s, s1);
      }
    }

    s = sNext;
  }

  // insert new segments
  s = pre->next;
  while (nextSeg < xPath->length && xPath->segs[nextSeg].iy <= yTopI) {
    s1 = &xPath->segs[nextSeg];
    ++nextSeg;
    while (s1->mx > s->mx) {
      s = s->next;
    }
    insertSegmentBefore(s1, s);
  }
}

void SplashXPathScanner::generatePixels(int x0, int x1, Guchar *line,
          int *xMin, int *xMax) {
  SplashXPathSeg *s;
  int fillCount, x, xEnd, ix0, ix1, t;

  fillCount = 0;
  x = x0 * aaHoriz;
  xEnd = (x1 + 1) * aaHoriz;
  for (s = pre->next; s != post && x < xEnd; s = s->next) {
    ix0 = splashFloor(s->sx0 * aaHoriz);
    ix1 = splashFloor(s->sx1 * aaHoriz);
    if (ix0 > ix1) {
      t = ix0;  ix0 = ix1;  ix1 = t;
    }
    if (!(fillCount & eoMask)) {
      if (ix0 > x) {
  x = ix0;
      }
    }
    if (ix1 >= xEnd) {
      ix1 = xEnd - 1;
    }
    if (x / aaHoriz < *xMin) {
      *xMin = x / aaHoriz;
    }
    if (ix1 / aaHoriz > *xMax) {
      *xMax = ix1 / aaHoriz;
    }
    for (; x <= ix1; ++x) {
      ++line[x / aaHoriz];
    }
    if (s->y0 <= yTop && s->y1 > yTop) {
      fillCount += s->count;
    }
  }
}

void SplashXPathScanner::generatePixelsBinary(int x0, int x1, Guchar *line,
                int *xMin, int *xMax) {
  SplashXPathSeg *s;
  int fillCount, x, xEnd, ix0, ix1, t;

  fillCount = 0;
  x = x0;
  xEnd = x1 + 1;
  for (s = pre->next; s != post && x < xEnd; s = s->next) {
    ix0 = splashFloor(s->sx0);
    ix1 = splashFloor(s->sx1);
    if (ix0 > ix1) {
      t = ix0;  ix0 = ix1;  ix1 = t;
    }
    if (!(fillCount & eoMask)) {
      if (ix0 > x) {
  x = ix0;
      }
    }
    if (ix1 >= xEnd) {
      ix1 = xEnd - 1;
    }
    if (x < *xMin) {
      *xMin = x;
    }
    if (ix1 > *xMax) {
      *xMax = ix1;
    }
    for (; x <= ix1; ++x) {
      line[x] = 255;
    }
    if (s->y0 <= yTop && s->y1 > yTop) {
      fillCount += s->count;
    }
  }
}

void SplashXPathScanner::drawRectangleSpan(Guchar *line, int y,
             int x0, int x1,
             int *xMin, int *xMax) {
  SplashCoord edge;
  Guchar pix;
  int xe, x;

  if (rectX0I > x1 || rectX1I < x0) {
    return;
  }

  *xMin = x0 <= rectX0I ? rectX0I : x0;
  *xMax = rectX1I <= x1 ? rectX1I : x1;

  //--- upper edge
  if (y == rectY0I) {

    // handle a rectangle less than one pixel high
    if (rectY0I == rectY1I) {
      edge = xPath->rectY1 - xPath->rectY0;
    } else {
      edge = (SplashCoord)1 - (xPath->rectY0 - rectY0I);
    }

    // upper left corner
    if (x0 <= rectX0I) {
      pix = (Guchar)splashCeil(edge
             * ((SplashCoord)1 - (xPath->rectX0 - rectX0I))
             * 255);
      if (pix < 16) {
  pix = 16;
      }
      line[rectX0I] = pix;
      x = rectX0I + 1;
    } else {
      x = x0;
    }

    // upper right corner
    if (rectX1I <= x1) {
      pix = (Guchar)splashCeil(edge * (xPath->rectX1 - rectX1I) * 255);
      if (pix < 16) {
  pix = 16;
      }
      line[rectX1I] = pix;
      xe = rectX1I - 1;
    } else {
      xe = x1;
    }

    // upper edge
    pix = (Guchar)splashCeil(edge * 255);
    if (pix < 16) {
      pix = 16;
    }
    for (; x <= xe; ++x) {
      line[x] = pix;
    }

  //--- lower edge
  } else if (y == rectY1I) {
    edge = xPath->rectY1 - rectY1I;

    // lower left corner
    if (x0 <= rectX0I) {
      pix = (Guchar)splashCeil(edge
             * ((SplashCoord)1 - (xPath->rectX0 - rectX0I))
             * 255);
      if (pix < 16) {
  pix = 16;
      }
      line[rectX0I] = pix;
      x = rectX0I + 1;
    } else {
      x = x0;
    }

    // lower right corner
    if (rectX1I <= x1) {
      pix = (Guchar)splashCeil(edge * (xPath->rectX1 - rectX1I) * 255);
      if (pix < 16) {
  pix = 16;
      }
      line[rectX1I] = pix;
      xe = rectX1I - 1;
    } else {
      xe = x1;
    }

    // lower edge
    pix = (Guchar)splashCeil(edge * 255);
    if (pix < 16) {
      pix = 16;
    }
    for (; x <= xe; ++x) {
      line[x] = pix;
    }

  //--- between the upper and lower edges
  } else if (y > rectY0I && y < rectY1I) {

    // left edge
    if (x0 <= rectX0I) {
      pix = (Guchar)splashCeil(((SplashCoord)1 - (xPath->rectX0 - rectX0I))
             * 255);
      if (pix < 16) {
  pix = 16;
      }
      line[rectX0I] = pix;
      x = rectX0I + 1;
    } else {
      x = x0;
    }

    // right edge
    if (rectX1I <= x1) {
      pix = (Guchar)splashCeil((xPath->rectX1 - rectX1I) * 255);
      if (pix < 16) {
  pix = 16;
      }
      line[rectX1I] = pix;
      xe = rectX1I - 1;
    } else {
      xe = x1;
    }

    // middle
    for (; x <= xe; ++x) {
      line[x] = 255;
    }
  }
}

void SplashXPathScanner::drawRectangleSpanBinary(Guchar *line, int y,
             int x0, int x1,
             int *xMin, int *xMax) {
  int xe, x;

  if (y >= rectY0I && y <= rectY1I) {
    if (x0 <= rectX0I) {
      x = rectX0I;
    } else {
      x = x0;
    }
    *xMin = x;
    if (rectX1I <= x1) {
      xe = rectX1I;
    } else {
      xe = x1;
    }
    *xMax = xe;
    for (; x <= xe; ++x) {
      line[x] = 255;
    }
  }
}

void SplashXPathScanner::getSpan(Guchar *line, int y, int x0, int x1,
         int *xMin, int *xMax) {
  int iy, x, k;

  iy = y * aaVert;
  if (!resetDone || !resetAA) {
    reset(gTrue, gTrue);
  } else if (yBottomI > iy) {
    reset(gTrue, gFalse);
  }
  memset(line + x0, 0, x1 - x0 + 1);

  *xMin = x1 + 1;
  *xMax = x0 - 1;

  if (xPath->isRect) {
    drawRectangleSpan(line, y, x0, x1, xMin, xMax);
    return;
  }

  if (yBottomI < iy) {
    skip(iy, gTrue);
  }
  for (k = 0; k < aaVert; ++k, ++iy) {
    advance(gTrue);
    generatePixels(x0, x1, line, xMin, xMax);
  }

#if !ANTIALIAS_256
  for (x = *xMin; x <= *xMax; ++x) {
    line[x] = map16to255[line[x]];
  }
#endif
}

void SplashXPathScanner::getSpanBinary(Guchar *line, int y, int x0, int x1,
               int *xMin, int *xMax) {
  int iy;

  iy = y;
  if (!resetDone || resetAA) {
    reset(gFalse, gTrue);
  } else if (yBottomI > iy) {
    reset(gFalse, gFalse);
  }
  memset(line + x0, 0, x1 - x0 + 1);

  *xMin = x1 + 1;
  *xMax = x0 - 1;

  if (xPath->isRect) {
    drawRectangleSpanBinary(line, y, x0, x1, xMin, xMax);
    return;
  }

  if (yBottomI < iy) {
    skip(iy, gFalse);
  }
  advance(gFalse);
  generatePixelsBinary(x0, x1, line, xMin, xMax);
}

Coverage Report

Created: 2026-04-04 06:06

Line	Count	Source
1		//========================================================================
2		//
3		// SplashXPathScanner.cc
4		//
5		// Copyright 2003-2013 Glyph & Cog, LLC
6		//
7		//========================================================================
8
9		#include <aconf.h>
10
11		#include <stdlib.h>
12		#include <string.h>
13		#if HAVE_STD_SORT
14		#include <algorithm>
15		#endif
16		#include "gmem.h"
17		#include "gmempp.h"
18		#include "GList.h"
19		#include "SplashMath.h"
20		#include "SplashXPath.h"
21		#include "SplashXPathScanner.h"
22
23		//------------------------------------------------------------------------
24
25		#if ANTIALIAS_256
26
27		#define aaVert 15
28		#define aaHoriz 17
29
30		#else
31
32	69.8M	#define aaVert 4
33	8.27M	#define aaHoriz 4
34
35		// 4x4 oversampling tends to generate alpha (coverage) values that are
36		// too high, so we reduce them here. (Yes, this is a kludge.)
37		static Guchar map16to255[17] = {
38		0,
39		16 / 2,
40		32 / 2,
41		48 / 2,
42		64 - 32,
43		80 - 32,
44		96 - 32,
45		112 - 32,
46		128 - 32,
47		143 - 32,
48		159 - 32,
49		175 - 32,
50		191 - 32,
51		207 - 32,
52		223 - 32,
53		239 - 32,
54		255
55		};
56
57		#endif
58
59		//------------------------------------------------------------------------
60
61		SplashXPathScanner::SplashXPathScanner(SplashXPath *xPathA, GBool eo,
62	142k	int yMinA, int yMaxA) {
63	142k	xPath = xPathA;
64	142k	eoMask = eo ? 1 : 0xffffffff;
65	142k	yMin = yMinA;
66	142k	yMax = yMaxA;
67	142k	if (xPath->isRect) {
68	16.4k	rectX0I = splashFloor(xPath->rectX0);
69	16.4k	rectY0I = splashFloor(xPath->rectY0);
70	16.4k	rectX1I = splashFloor(xPath->rectX1);
71	16.4k	rectY1I = splashFloor(xPath->rectY1);
72	16.4k	}
73
74	142k	pre = &preSeg;
75	142k	post = &postSeg;
76	142k	pre->mx = xPath->xMin - 1;
77	142k	post->mx = xPath->xMax + 1;
78
79	142k	resetDone = gFalse;
80	142k	resetAA = gFalse;
81	142k	}
82
83	142k	SplashXPathScanner::~SplashXPathScanner() {
84	142k	}
85
86		void SplashXPathScanner::insertSegmentBefore(SplashXPathSeg *s,
87	3.68M	SplashXPathSeg *sNext) {
88	3.68M	SplashXPathSeg *sPrev;
89
90	3.68M	sPrev = sNext->prev;
91	3.68M	sPrev->next = s;
92	3.68M	s->prev = sPrev;
93	3.68M	s->next = sNext;
94	3.68M	sNext->prev = s;
95	3.68M	}
96
97	2.10M	void SplashXPathScanner::removeSegment(SplashXPathSeg *s) {
98	2.10M	SplashXPathSeg sPrev, sNext;
99
100	2.10M	sPrev = s->prev;
101	2.10M	sNext = s->next;
102	2.10M	sPrev->next = sNext;
103	2.10M	sNext->prev = sPrev;
104	2.10M	s->prev = s->next = NULL;
105	2.10M	}
106
107		void SplashXPathScanner::moveSegmentAfter(SplashXPathSeg *s,
108	196k	SplashXPathSeg *sPrev) {
109	196k	SplashXPathSeg *sNext;
110
111	196k	s->prev->next = s->next;
112	196k	s->next->prev = s->prev;
113
114	196k	sNext = sPrev->next;
115	196k	sPrev->next = s;
116	196k	s->prev = sPrev;
117	196k	s->next = sNext;
118	196k	sNext->prev = s;
119	196k	}
120
121	53.2k	void SplashXPathScanner::reset(GBool aa, GBool aaChanged) {
122	53.2k	SplashXPathSeg *seg;
123	53.2k	SplashCoord y;
124	53.2k	int i;
125
126		//--- initialize segment parameters
127	47.1M	for (i = 0; i < xPath->length; ++i) {
128	47.1M	seg = &xPath->segs[i];
129	47.1M	if (aa) {
130	36.6M	if (aaChanged) {
131	32.6M	seg->iy = splashFloor(seg->y0 * aaVert);
132	32.6M	}
133	36.6M	y = (SplashCoord)(seg->iy + 1) / (SplashCoord)aaVert;
134	36.6M	} else {
135	10.4M	if (aaChanged) {
136	8.00M	seg->iy = splashFloor(seg->y0);
137	8.00M	}
138	10.4M	y = (SplashCoord)(seg->iy + 1);
139	10.4M	}
140	47.1M	seg->sx0 = seg->x0;
141	47.1M	if (seg->y1 <= y) {
142	27.3M	seg->sx1 = seg->x1;
143	27.3M	} else {
144	19.7M	seg->sx1 = seg->x0 + (y - seg->y0) * seg->dxdy;
145	19.7M	}
146	47.1M	seg->mx = (seg->sx0 <= seg->sx1) ? seg->sx0 : seg->sx1;
147	47.1M	seg->prev = seg->next = NULL;
148	47.1M	}
149
150		//--- sort the inactive segments by iy, mx
151	53.2k	if (aaChanged) {
152	30.9k	#if HAVE_STD_SORT
153	30.9k	std::sort(xPath->segs, xPath->segs + xPath->length, &SplashXPathSeg::cmpMX);
154		#else
155		qsort(xPath->segs, xPath->length, sizeof(SplashXPathSeg),
156		&SplashXPathSeg::cmpMX);
157		#endif
158	30.9k	}
159
160		//--- initialize the active list
161	53.2k	pre->prev = NULL;
162	53.2k	pre->next = post;
163	53.2k	post->prev = pre;
164	53.2k	post->next = NULL;
165
166		//--- initialize the scan state
167	53.2k	nextSeg = 0;
168	53.2k	if (xPath->length) {
169	49.1k	yBottomI = xPath->segs[0].iy;
170	49.1k	if (aa) {
171	42.9k	yBottomI -= yBottomI % aaVert;
172	42.9k	}
173	49.1k	} else {
174	4.01k	yBottomI = 0;
175	4.01k	}
176	53.2k	yTopI = yBottomI - 1;
177	53.2k	if (aa) {
178	46.9k	yTop = (SplashCoord)yTopI / (SplashCoord)aaVert;
179	46.9k	yBottom = (SplashCoord)yBottomI / (SplashCoord)aaVert;
180	46.9k	} else {
181	6.25k	yTop = (SplashCoord)yTopI;
182	6.25k	yBottom = (SplashCoord)yBottomI;
183	6.25k	}
184
185	53.2k	resetDone = gTrue;
186	53.2k	resetAA = aa;
187	53.2k	}
188
189	33.9k	void SplashXPathScanner::skip(int newYBottomI, GBool aa) {
190	33.9k	SplashXPathSeg s0, s1,*s2;
191	33.9k	int iy;
192
193	33.9k	yTopI = newYBottomI - 1;
194	33.9k	yBottomI = newYBottomI;
195	33.9k	if (aa) {
196	28.7k	yTop = (SplashCoord)yTopI / (SplashCoord)aaVert;
197	28.7k	yBottom = (SplashCoord)yBottomI / (SplashCoord)aaVert;
198	28.7k	} else {
199	5.18k	yTop = (SplashCoord)yTopI;
200	5.18k	yBottom = (SplashCoord)yBottomI;
201	5.18k	}
202
203		//--- remove finished segments; update sx0, sx1, mx for active segments
204	33.9k	s0 = pre->next;
205	33.9k	while (s0 != post) {
206	0	s1 = s0->next;
207
208		// check for a finished segment
209	0	if (s0->y1 < yTop) {
210	0	removeSegment(s0);
211
212		// compute sx0, sx1, mx
213	0	} else {
214	0	if (s0->y0 >= yTop) {
215	0	s0->sx0 = s0->x0;
216	0	} else {
217	0	s0->sx0 = s0->x0 + (yTop - s0->y0) * s0->dxdy;
218	0	}
219	0	if (s0->y1 <= yBottom) {
220	0	s0->sx1 = s0->x1;
221	0	} else {
222	0	s0->sx1 = s0->x0 + (yBottom - s0->y0) * s0->dxdy;
223	0	}
224	0	s0->mx = (s0->sx0 <= s0->sx1) ? s0->sx0 : s0->sx1;
225	0	}
226
227	0	s0 = s1;
228	0	}
229
230		//--- check for intersections
231	33.9k	s0 = pre->next;
232	33.9k	if (s0 != post) {
233	0	s1 = s0->next;
234	0	while (s1 != post) {
235	0	if (s1->mx < s0->mx) {
236	0	for (s2 = s0->prev; s1->mx < s2->mx; s2 = s2->prev) ;
237	0	moveSegmentAfter(s1, s2);
238	0	} else {
239	0	s0 = s1;
240	0	}
241	0	s1 = s0->next;
242	0	}
243	0	}
244
245		//--- insert new segments with a merge sort
246		// - this has to be done one (sub)scanline at a time, because the
247		// inactive list is bin-sorted by (sub)scanline
248	7.96M	while (nextSeg < xPath->length && xPath->segs[nextSeg].iy <= yTopI) {
249		// the first inactive segment determines the next scanline to process
250	7.93M	iy = xPath->segs[nextSeg].iy;
251	7.93M	s0 = pre->next;
252	19.8M	do {
253	19.8M	s1 = &xPath->segs[nextSeg];
254	19.8M	++nextSeg;
255	19.8M	if (s1->y1 < yTop) {
256	18.8M	continue;
257	18.8M	}
258	1.03M	if (s1->y0 >= yTop) {
259	1.43k	s1->sx0 = s1->x0;
260	1.03M	} else {
261	1.03M	s1->sx0 = s1->x0 + (yTop - s1->y0) * s1->dxdy;
262	1.03M	}
263	1.03M	if (s1->y1 <= yBottom) {
264	11.1k	s1->sx1 = s1->x1;
265	1.02M	} else {
266	1.02M	s1->sx1 = s1->x0 + (yBottom - s1->y0) * s1->dxdy;
267	1.02M	}
268	1.03M	s1->mx = (s1->sx0 <= s1->sx1) ? s1->sx0 : s1->sx1;
269	1.03M	insertSegmentBefore(s1, s0);
270	19.8M	} while (nextSeg < xPath->length && xPath->segs[nextSeg].iy <= iy);
271	7.93M	}
272	33.9k	}
273
274	151k	void SplashXPathScanner::advance(GBool aa) {
275	151k	SplashXPathSeg s, sNext, *s1;
276
277	151k	yTopI = yBottomI;
278	151k	yTop = yBottom;
279	151k	yBottomI = yTopI + 1;
280	151k	if (aa) {
281	145k	yBottom = (SplashCoord)yBottomI / (SplashCoord)aaVert;
282	145k	} else {
283	6.25k	yBottom = (SplashCoord)yBottomI;
284	6.25k	}
285
286	151k	s = pre->next;
287	6.35M	while (s != post) {
288	6.20M	sNext = s->next;
289
290		// check for a finished segment
291	6.20M	if (s->y1 < yTop) {
292	2.10M	removeSegment(s);
293
294	4.09M	} else {
295
296		// compute sx0, sx1, mx
297	4.09M	s->sx0 = s->sx1;
298	4.09M	if (s->y1 <= yBottom) {
299	9.98k	s->sx1 = s->x1;
300	4.08M	} else {
301	4.08M	s->sx1 = s->x0 + (yBottom - s->y0) * s->dxdy;
302	4.08M	}
303	4.09M	s->mx = (s->sx0 <= s->sx1) ? s->sx0 : s->sx1;
304
305		// check for intersection
306	4.09M	if (s->mx < s->prev->mx) {
307	87.8M	for (s1 = s->prev->prev; s->mx < s1->mx; s1 = s1->prev) ;
308	196k	moveSegmentAfter(s, s1);
309	196k	}
310	4.09M	}
311
312	6.20M	s = sNext;
313	6.20M	}
314
315		// insert new segments
316	151k	s = pre->next;
317	2.79M	while (nextSeg < xPath->length && xPath->segs[nextSeg].iy <= yTopI) {
318	2.64M	s1 = &xPath->segs[nextSeg];
319	2.64M	++nextSeg;
320	2.65M	while (s1->mx > s->mx) {
321	14.1k	s = s->next;
322	14.1k	}
323	2.64M	insertSegmentBefore(s1, s);
324	2.64M	}
325	151k	}
326
327		void SplashXPathScanner::generatePixels(int x0, int x1, Guchar *line,
328	145k	int xMin, int xMax) {
329	145k	SplashXPathSeg *s;
330	145k	int fillCount, x, xEnd, ix0, ix1, t;
331
332	145k	fillCount = 0;
333	145k	x = x0 * aaHoriz;
334	145k	xEnd = (x1 + 1) * aaHoriz;
335	2.11M	for (s = pre->next; s != post && x < xEnd; s = s->next) {
336	1.96M	ix0 = splashFloor(s->sx0 * aaHoriz);
337	1.96M	ix1 = splashFloor(s->sx1 * aaHoriz);
338	1.96M	if (ix0 > ix1) {
339	643k	t = ix0; ix0 = ix1; ix1 = t;
340	643k	}
341	1.96M	if (!(fillCount & eoMask)) {
342	449k	if (ix0 > x) {
343	74.9k	x = ix0;
344	74.9k	}
345	449k	}
346	1.96M	if (ix1 >= xEnd) {
347	85.9k	ix1 = xEnd - 1;
348	85.9k	}
349	1.96M	if (x / aaHoriz < *xMin) {
350	15.0k	*xMin = x / aaHoriz;
351	15.0k	}
352	1.96M	if (ix1 / aaHoriz > *xMax) {
353	31.4k	*xMax = ix1 / aaHoriz;
354	31.4k	}
355	2.04M	for (; x <= ix1; ++x) {
356	80.3k	++line[x / aaHoriz];
357	80.3k	}
358	1.96M	if (s->y0 <= yTop && s->y1 > yTop) {
359	1.86M	fillCount += s->count;
360	1.86M	}
361	1.96M	}
362	145k	}
363
364		void SplashXPathScanner::generatePixelsBinary(int x0, int x1, Guchar *line,
365	6.25k	int xMin, int xMax) {
366	6.25k	SplashXPathSeg *s;
367	6.25k	int fillCount, x, xEnd, ix0, ix1, t;
368
369	6.25k	fillCount = 0;
370	6.25k	x = x0;
371	6.25k	xEnd = x1 + 1;
372	17.8k	for (s = pre->next; s != post && x < xEnd; s = s->next) {
373	11.5k	ix0 = splashFloor(s->sx0);
374	11.5k	ix1 = splashFloor(s->sx1);
375	11.5k	if (ix0 > ix1) {
376	2.45k	t = ix0; ix0 = ix1; ix1 = t;
377	2.45k	}
378	11.5k	if (!(fillCount & eoMask)) {
379	7.48k	if (ix0 > x) {
380	26	x = ix0;
381	26	}
382	7.48k	}
383	11.5k	if (ix1 >= xEnd) {
384	454	ix1 = xEnd - 1;
385	454	}
386	11.5k	if (x < *xMin) {
387	6.18k	*xMin = x;
388	6.18k	}
389	11.5k	if (ix1 > *xMax) {
390	6.13k	*xMax = ix1;
391	6.13k	}
392	17.7k	for (; x <= ix1; ++x) {
393	6.10k	line[x] = 255;
394	6.10k	}
395	11.5k	if (s->y0 <= yTop && s->y1 > yTop) {
396	8.08k	fillCount += s->count;
397	8.08k	}
398	11.5k	}
399	6.25k	}
400
401		void SplashXPathScanner::drawRectangleSpan(Guchar *line, int y,
402		int x0, int x1,
403	10.5k	int xMin, int xMax) {
404	10.5k	SplashCoord edge;
405	10.5k	Guchar pix;
406	10.5k	int xe, x;
407
408	10.5k	if (rectX0I > x1 \|\| rectX1I < x0) {
409	177	return;
410	177	}
411
412	10.3k	*xMin = x0 <= rectX0I ? rectX0I : x0;
413	10.3k	*xMax = rectX1I <= x1 ? rectX1I : x1;
414
415		//--- upper edge
416	10.3k	if (y == rectY0I) {
417
418		// handle a rectangle less than one pixel high
419	3.56k	if (rectY0I == rectY1I) {
420	2.99k	edge = xPath->rectY1 - xPath->rectY0;
421	2.99k	} else {
422	576	edge = (SplashCoord)1 - (xPath->rectY0 - rectY0I);
423	576	}
424
425		// upper left corner
426	3.56k	if (x0 <= rectX0I) {
427	3.45k	pix = (Guchar)splashCeil(edge
428	3.45k	* ((SplashCoord)1 - (xPath->rectX0 - rectX0I))
429	3.45k	* 255);
430	3.45k	if (pix < 16) {
431	2.90k	pix = 16;
432	2.90k	}
433	3.45k	line[rectX0I] = pix;
434	3.45k	x = rectX0I + 1;
435	3.45k	} else {
436	109	x = x0;
437	109	}
438
439		// upper right corner
440	3.56k	if (rectX1I <= x1) {
441	3.43k	pix = (Guchar)splashCeil(edge * (xPath->rectX1 - rectX1I) * 255);
442	3.43k	if (pix < 16) {
443	3.41k	pix = 16;
444	3.41k	}
445	3.43k	line[rectX1I] = pix;
446	3.43k	xe = rectX1I - 1;
447	3.43k	} else {
448	132	xe = x1;
449	132	}
450
451		// upper edge
452	3.56k	pix = (Guchar)splashCeil(edge * 255);
453	3.56k	if (pix < 16) {
454	2.99k	pix = 16;
455	2.99k	}
456	3.67k	for (; x <= xe; ++x) {
457	109	line[x] = pix;
458	109	}
459
460		//--- lower edge
461	6.80k	} else if (y == rectY1I) {
462	159	edge = xPath->rectY1 - rectY1I;
463
464		// lower left corner
465	159	if (x0 <= rectX0I) {
466	159	pix = (Guchar)splashCeil(edge
467	159	* ((SplashCoord)1 - (xPath->rectX0 - rectX0I))
468	159	* 255);
469	159	if (pix < 16) {
470	156	pix = 16;
471	156	}
472	159	line[rectX0I] = pix;
473	159	x = rectX0I + 1;
474	159	} else {
475	0	x = x0;
476	0	}
477
478		// lower right corner
479	159	if (rectX1I <= x1) {
480	159	pix = (Guchar)splashCeil(edge * (xPath->rectX1 - rectX1I) * 255);
481	159	if (pix < 16) {
482	159	pix = 16;
483	159	}
484	159	line[rectX1I] = pix;
485	159	xe = rectX1I - 1;
486	159	} else {
487	0	xe = x1;
488	0	}
489
490		// lower edge
491	159	pix = (Guchar)splashCeil(edge * 255);
492	159	if (pix < 16) {
493	156	pix = 16;
494	156	}
495	159	for (; x <= xe; ++x) {
496	0	line[x] = pix;
497	0	}
498
499		//--- between the upper and lower edges
500	6.65k	} else if (y > rectY0I && y < rectY1I) {
501
502		// left edge
503	6.46k	if (x0 <= rectX0I) {
504	5.76k	pix = (Guchar)splashCeil(((SplashCoord)1 - (xPath->rectX0 - rectX0I))
505	5.76k	* 255);
506	5.76k	if (pix < 16) {
507	0	pix = 16;
508	0	}
509	5.76k	line[rectX0I] = pix;
510	5.76k	x = rectX0I + 1;
511	5.76k	} else {
512	701	x = x0;
513	701	}
514
515		// right edge
516	6.46k	if (rectX1I <= x1) {
517	3.13k	pix = (Guchar)splashCeil((xPath->rectX1 - rectX1I) * 255);
518	3.13k	if (pix < 16) {
519	3.08k	pix = 16;
520	3.08k	}
521	3.13k	line[rectX1I] = pix;
522	3.13k	xe = rectX1I - 1;
523	3.32k	} else {
524	3.32k	xe = x1;
525	3.32k	}
526
527		// middle
528	7.16k	for (; x <= xe; ++x) {
529	700	line[x] = 255;
530	700	}
531	6.46k	}
532	10.3k	}
533
534		void SplashXPathScanner::drawRectangleSpanBinary(Guchar *line, int y,
535		int x0, int x1,
536	2	int xMin, int xMax) {
537	2	int xe, x;
538
539	2	if (y >= rectY0I && y <= rectY1I) {
540	2	if (x0 <= rectX0I) {
541	2	x = rectX0I;
542	2	} else {
543	0	x = x0;
544	0	}
545	2	*xMin = x;
546	2	if (rectX1I <= x1) {
547	2	xe = rectX1I;
548	2	} else {
549	0	xe = x1;
550	0	}
551	2	*xMax = xe;
552	4	for (; x <= xe; ++x) {
553	2	line[x] = 255;
554	2	}
555	2	}
556	2	}
557
558		void SplashXPathScanner::getSpan(Guchar *line, int y, int x0, int x1,
559	46.9k	int xMin, int xMax) {
560	46.9k	int iy, x, k;
561
562	46.9k	iy = y * aaVert;
563	46.9k	if (!resetDone \|\| !resetAA) {
564	27.1k	reset(gTrue, gTrue);
565	27.1k	} else if (yBottomI > iy) {
566	19.8k	reset(gTrue, gFalse);
567	19.8k	}
568	46.9k	memset(line + x0, 0, x1 - x0 + 1);
569
570	46.9k	*xMin = x1 + 1;
571	46.9k	*xMax = x0 - 1;
572
573	46.9k	if (xPath->isRect) {
574	10.5k	drawRectangleSpan(line, y, x0, x1, xMin, xMax);
575	10.5k	return;
576	10.5k	}
577
578	36.4k	if (yBottomI < iy) {
579	28.7k	skip(iy, gTrue);
580	28.7k	}
581	182k	for (k = 0; k < aaVert; ++k, ++iy) {
582	145k	advance(gTrue);
583	145k	generatePixels(x0, x1, line, xMin, xMax);
584	145k	}
585
586	36.4k	#if !ANTIALIAS_256
587	50.8k	for (x = xMin; x <= xMax; ++x) {
588	14.4k	line[x] = map16to255[line[x]];
589	14.4k	}
590	36.4k	#endif
591	36.4k	}
592
593		void SplashXPathScanner::getSpanBinary(Guchar *line, int y, int x0, int x1,
594	6.25k	int xMin, int xMax) {
595	6.25k	int iy;
596
597	6.25k	iy = y;
598	6.25k	if (!resetDone \|\| resetAA) {
599	3.80k	reset(gFalse, gTrue);
600	3.80k	} else if (yBottomI > iy) {
601	2.44k	reset(gFalse, gFalse);
602	2.44k	}
603	6.25k	memset(line + x0, 0, x1 - x0 + 1);
604
605	6.25k	*xMin = x1 + 1;
606	6.25k	*xMax = x0 - 1;
607
608	6.25k	if (xPath->isRect) {
609	2	drawRectangleSpanBinary(line, y, x0, x1, xMin, xMax);
610	2	return;
611	2	}
612
613	6.25k	if (yBottomI < iy) {
614	5.18k	skip(iy, gFalse);
615	5.18k	}
616	6.25k	advance(gFalse);
617	6.25k	generatePixelsBinary(x0, x1, line, xMin, xMax);
618	6.25k	}