HomeSort by: relevance | last modified time | path
    Searched refs:scanline (Results 1 - 15 of 15) sorted by relevancy

  /xsrc/external/mit/libXmu/dist/src/
Clip.c 60 area->scanline = XmuNewScanline(y1, x1, x2);
61 area->scanline->next = XmuNewScanline(y2, 0, 0);
64 area->scanline = (XmuScanline *)NULL;
112 z = p = dst->scanline;
113 Z = src->scanline;
120 if (z == dst->scanline)
122 XmuDestroyScanlineList(dst->scanline);
123 dst->scanline = (XmuScanline *)NULL;
141 if (p == dst->scanline && !dst->scanline)
1505 XmuScanline *scanline; local
    [all...]
  /xsrc/external/mit/libXmu/dist/include/X11/Xmu/
Xmu.h 59 XmuScanline *scanline; member in struct:_XmuArea
68 XmuDestroyScanlineList((a)->scanline); \
74 XmuDestroyScanlineList((a)->scanline); \
75 a->scanline = (Scanline *)0; \
102 XmuScanline *XmuScanlineNot(XmuScanline *scanline, int, int);
  /xsrc/external/mit/xorg-server.old/dist/mi/
mipolyutil.c 78 miInsertEdgeInET(EdgeTable *ET, EdgeTableEntry *ETE, int scanline,
90 while (pSLL && (pSLL->scanline < scanline))
99 if ((!pSLL) || (pSLL->scanline > scanline))
117 pSLL->scanline = scanline;
149 * |scanline|-->------------>-------------->...
150 * -------- |scanline| |scanline|
    [all...]
mipoly.h 57 * keep a list of edges which the current scanline crosses,
61 * This list must be sorted at each scanline in case
65 * scanline has not yet reached. The ET is basically a
67 * edges which are entered at a given scanline. There is one
68 * ScanLineList per scanline at which an edge is entered.
99 int scanline; /* the scanline represented */ member in struct:_ScanLineList
137 * Evaluate the given edge at the given scanline.
140 * x value to be ready for the next scanline.
162 * Evaluate the given edge at the given scanline
    [all...]
mipolygen.c 77 int y; /* the current scanline */
109 * for each scanline
117 if (pSLL && y == pSLL->scanline)
156 * for each scanline
164 if (pSLL && y == pSLL->scanline)
  /xsrc/external/mit/libX11/dist/src/
PolyReg.c 73 int scanline,
86 while (pSLL && (pSLL->scanline < scanline))
95 if ((!pSLL) || (pSLL->scanline > scanline))
111 pSLL->scanline = scanline;
142 * |scanline|-->------------>-------------->...
143 * -------- |scanline| |scanline|
    [all...]
poly.h 51 * to be filled in scanline order, and thus the
180 * keep a list of edges which the current scanline crosses,
184 * This list must be sorted at each scanline in case
188 * scanline has not yet reached. The ET is basically a
190 * edges which are entered at a given scanline. There is one
191 * ScanLineList per scanline at which an edge is entered.
222 int scanline; /* the scanline represented */
255 * Evaluate the given edge at the given scanline.
258 * x value to be ready for the next scanline
219 int scanline; \/* the scanline represented *\/ member in struct:_ScanLineList
    [all...]
  /xsrc/external/mit/xf86-video-suncg6/dist/src/
cg6.h 84 CARD32 scanline[1024]; member in struct:__anon9420
cg6_accel.c 377 pCg6->fbc->font = pCg6->scanline[i];
482 pCg6->buffers[0] = (unsigned char *)pCg6->scanline;
  /xsrc/external/mit/xorg-server/dist/mi/
mipoly.h 56 * keep a list of edges which the current scanline crosses,
60 * This list must be sorted at each scanline in case
64 * scanline has not yet reached. The ET is basically a
66 * edges which are entered at a given scanline. There is one
67 * ScanLineList per scanline at which an edge is entered.
97 int scanline; /* the scanline represented */ member in struct:_ScanLineList
132 * Evaluate the given edge at the given scanline.
135 * x value to be ready for the next scanline.
156 * Evaluate the given edge at the given scanline
    [all...]
mipoly.c 70 miInsertEdgeInET(EdgeTable * ET, EdgeTableEntry * ETE, int scanline,
82 while (pSLL && (pSLL->scanline < scanline)) {
90 if ((!pSLL) || (pSLL->scanline > scanline)) {
106 pSLL->scanline = scanline;
147 * |scanline|-->------------>-------------->...
148 * -------- |scanline| |scanline|
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/imgui/
imstb_truetype.h 2790 static void stbtt__fill_active_edges(unsigned char *scanline, int len, stbtt__active_edge *e, int max_weight)
2809 scanline[i] = scanline[i] + (stbtt_uint8) ((x1 - x0) * max_weight >> STBTT_FIXSHIFT);
2812 scanline[i] = scanline[i] + (stbtt_uint8) (((STBTT_FIX - (x0 & STBTT_FIXMASK)) * max_weight) >> STBTT_FIXSHIFT);
2817 scanline[j] = scanline[j] + (stbtt_uint8) (((x1 & STBTT_FIXMASK) * max_weight) >> STBTT_FIXSHIFT);
2822 scanline[i] = scanline[i] + (stbtt_uint8) max_weight;
2837 int max_weight = (255 / vsubsample); // weight per vertical scanline
    [all...]
  /xsrc/external/mit/MesaLib.old/dist/src/imgui/
imstb_truetype.h 2790 static void stbtt__fill_active_edges(unsigned char *scanline, int len, stbtt__active_edge *e, int max_weight)
2809 scanline[i] = scanline[i] + (stbtt_uint8) ((x1 - x0) * max_weight >> STBTT_FIXSHIFT);
2812 scanline[i] = scanline[i] + (stbtt_uint8) (((STBTT_FIX - (x0 & STBTT_FIXMASK)) * max_weight) >> STBTT_FIXSHIFT);
2817 scanline[j] = scanline[j] + (stbtt_uint8) (((x1 & STBTT_FIXMASK) * max_weight) >> STBTT_FIXSHIFT);
2822 scanline[i] = scanline[i] + (stbtt_uint8) max_weight;
2837 int max_weight = (255 / vsubsample); // weight per vertical scanline
    [all...]
  /xsrc/external/mit/libXaw/dist/src/
AsciiSink.c 436 static XmuScanline scanline = {0, &segment, &next}; local
437 static XmuArea area = {&scanline};
598 scanline.y = y;
603 scanline.y = y + ascent + font->descent;
604 next.y = scanline.y + descent - font->descent + 1;
609 scanline.y = y + ascent - font->ascent;
614 scanline.y = y;
679 scanline.y = y;
684 scanline.y = y + ascent + font->descent;
685 next.y = scanline.y + descent - font->descent
    [all...]
Text.c 2684 static XmuScanline scanline = {0, &segment, &next}; local
2685 static XmuArea area = {&scanline};
2737 scanline.y = y;
2748 for (scan = clip->scanline; scan && scan->next; scan = scan->next)
2765 static XmuScanline scanline = {0, &segment, &next}; local
2766 static XmuArea area = {&scanline};
2818 scanline.y = y;
2831 scanline.y = y;

Completed in 33 milliseconds