Searched defs:scanline (Results 1 - 19 of 19) sorted by relevance

/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.16.0/
H A Dmipoly.h56 * 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...]
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.17.1/
H A Dmipoly.h56 * 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...]
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.3.0.0/
H A Dmipoly.h57 * 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...]
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.4.2/
H A Dmipoly.h57 * 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...]
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.5.3/
H A Dmipoly.h57 * 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...]
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.6.5/
H A Dmipoly.h57 * 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...]
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.7.7/
H A Dmipoly.h57 * 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...]
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.8.0/
H A Dmipoly.h57 * 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...]
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.9.0/
H A Dmipoly.h57 * 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...]
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.10.0/
H A Dmipoly.h57 * 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...]
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.11.0/
H A Dmipoly.h57 * 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...]
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.12.0/
H A Dmipoly.h57 * 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...]
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.13.0/
H A Dmipoly.h56 * 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...]
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.14.0/
H A Dmipoly.h56 * 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...]
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.15.0/
H A Dmipoly.h56 * 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...]
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.1.0/
H A Dmipoly.h59 * keep a list of edges which the current scanline crosses,
63 * This list must be sorted at each scanline in case
67 * scanline has not yet reached. The ET is basically a
69 * edges which are entered at a given scanline. There is one
70 * ScanLineList per scanline at which an edge is entered.
101 int scanline; /* the scanline represented */ member in struct:_ScanLineList
139 * Evaluate the given edge at the given scanline.
142 * x value to be ready for the next scanline.
164 * Evaluate the given edge at the given scanline
[all...]
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.0.1/
H A Dmipoly.h59 * keep a list of edges which the current scanline crosses,
63 * This list must be sorted at each scanline in case
67 * scanline has not yet reached. The ET is basically a
69 * edges which are entered at a given scanline. There is one
70 * ScanLineList per scanline at which an edge is entered.
101 int scanline; /* the scanline represented */ member in struct:_ScanLineList
139 * Evaluate the given edge at the given scanline.
142 * x value to be ready for the next scanline.
164 * Evaluate the given edge at the given scanline
[all...]
/vbox/src/VBox/RDP/client-1.8.3/
H A Dcache.c380 cache_put_desktop(uint32 offset, int cx, int cy, int scanline, int bytes_per_pixel, uint8 * data) argument
393 data += scanline;
H A Dxwin.c2845 int scanline; local
2847 scanline = (width + 7) / 8;
2854 width, height, 8, scanline);
2934 int scanline, offset, delta; local
2938 scanline = (width + 7) / 8;
2939 offset = scanline * height;
2949 delta = scanline;
2953 offset = scanline * height - scanline;
2954 delta = -scanline;
[all...]

Completed in 146 milliseconds