1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292
|
/*
* Copyright © 2013 Keith Packard
*
* Permission to use, copy, modify, distribute, and sell this software and its
* documentation for any purpose is hereby granted without fee, provided that
* the above copyright notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting documentation, and
* that the name of the copyright holders not be used in advertising or
* publicity pertaining to distribution of the software without specific,
* written prior permission. The copyright holders make no representations
* about the suitability of this software for any purpose. It is provided "as
* is" without express or implied warranty.
*
* THE COPYRIGHT HOLDERS DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
* INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
* EVENT SHALL THE COPYRIGHT HOLDERS BE LIABLE FOR ANY SPECIAL, INDIRECT OR
* CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
* DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE
* OF THIS SOFTWARE.
*/
#include "present_priv.h"
#include <gcstruct.h>
uint32_t
present_query_capabilities(RRCrtcPtr crtc)
{
present_screen_priv_ptr screen_priv;
if (!crtc)
return 0;
screen_priv = present_screen_priv(crtc->pScreen);
if (!screen_priv)
return 0;
return screen_priv->query_capabilities(screen_priv);
}
RRCrtcPtr
present_get_crtc(WindowPtr window)
{
ScreenPtr screen = window->drawable.pScreen;
present_screen_priv_ptr screen_priv = present_screen_priv(screen);
RRCrtcPtr crtc = NULL;
if (!screen_priv)
return NULL;
crtc = screen_priv->get_crtc(screen_priv, window);
if (crtc && !present_screen_priv(crtc->pScreen)) {
crtc = RRFirstEnabledCrtc(screen);
}
if (crtc && !present_screen_priv(crtc->pScreen)) {
crtc = NULL;
}
return crtc;
}
/*
* Copies the update region from a pixmap to the target drawable
*/
void
present_copy_region(DrawablePtr drawable,
PixmapPtr pixmap,
RegionPtr update,
int16_t x_off,
int16_t y_off)
{
ScreenPtr screen = drawable->pScreen;
GCPtr gc;
gc = GetScratchGC(drawable->depth, screen);
if (update) {
ChangeGCVal changes[2];
changes[0].val = x_off;
changes[1].val = y_off;
ChangeGC(serverClient, gc,
GCClipXOrigin|GCClipYOrigin,
changes);
(*gc->funcs->ChangeClip)(gc, CT_REGION, update, 0);
}
ValidateGC(drawable, gc);
(*gc->ops->CopyArea)(&pixmap->drawable,
drawable,
gc,
0, 0,
pixmap->drawable.width, pixmap->drawable.height,
x_off, y_off);
if (update)
(*gc->funcs->ChangeClip)(gc, CT_NONE, NULL, 0);
FreeScratchGC(gc);
}
void
present_pixmap_idle(PixmapPtr pixmap, WindowPtr window, CARD32 serial, struct present_fence *present_fence)
{
if (present_fence)
present_fence_set_triggered(present_fence);
if (window) {
DebugPresent(("\ti %08" PRIx32 "\n", pixmap ? pixmap->drawable.id : 0));
present_send_idle_notify(window, serial, pixmap, present_fence);
}
}
struct pixmap_visit {
PixmapPtr old;
PixmapPtr new;
};
static int
present_set_tree_pixmap_visit(WindowPtr window, void *data)
{
struct pixmap_visit *visit = data;
ScreenPtr screen = window->drawable.pScreen;
if ((*screen->GetWindowPixmap)(window) != visit->old)
return WT_DONTWALKCHILDREN;
(*screen->SetWindowPixmap)(window, visit->new);
return WT_WALKCHILDREN;
}
void
present_set_tree_pixmap(WindowPtr window,
PixmapPtr expected,
PixmapPtr pixmap)
{
struct pixmap_visit visit;
ScreenPtr screen = window->drawable.pScreen;
visit.old = (*screen->GetWindowPixmap)(window);
if (expected && visit.old != expected)
return;
visit.new = pixmap;
if (visit.old == visit.new)
return;
TraverseTree(window, present_set_tree_pixmap_visit, &visit);
}
Bool
present_can_window_flip(WindowPtr window)
{
ScreenPtr screen = window->drawable.pScreen;
present_screen_priv_ptr screen_priv = present_screen_priv(screen);
return screen_priv->can_window_flip(window);
}
uint64_t
present_get_target_msc(uint64_t target_msc_arg,
uint64_t crtc_msc,
uint64_t divisor,
uint64_t remainder,
uint32_t options)
{
const Bool synced_flip = !(options & PresentAllAsyncOptions);
uint64_t target_msc;
/* If the specified target-msc lies in the future, then this
* defines the target-msc according to Present protocol.
*/
if (msc_is_after(target_msc_arg, crtc_msc))
return target_msc_arg;
/* If no divisor is specified, the modulo is undefined
* and we do present instead asap.
*/
if (divisor == 0) {
target_msc = crtc_msc;
/* When no async presentation is forced, by default we sync the
* presentation with vblank. But in this case we can't target
* the current crtc-msc, which already has begun, but must aim
* for the upcoming one.
*/
if (synced_flip)
target_msc++;
return target_msc;
}
/* Calculate target-msc by the specified modulo parameters. According
* to Present protocol this is after the next field with:
*
* field-msc % divisor == remainder.
*
* The following formula calculates a target_msc solving above equation
* and with |target_msc - crtc_msc| < divisor.
*
* Example with crtc_msc = 10, divisor = 4 and remainder = 3, 2, 1, 0:
* 11 = 10 - 2 + 3 = 10 - (10 % 4) + 3,
* 10 = 10 - 2 + 2 = 10 - (10 % 4) + 2,
* 9 = 10 - 2 + 1 = 10 - (10 % 4) + 1,
* 8 = 10 - 2 + 0 = 10 - (10 % 4) + 0.
*/
target_msc = crtc_msc - (crtc_msc % divisor) + remainder;
/* Here we already found the correct field-msc. */
if (msc_is_after(target_msc, crtc_msc))
return target_msc;
/*
* Here either:
* a) target_msc == crtc_msc, i.e. crtc_msc actually solved
* above equation with crtc_msc % divisor == remainder.
*
* => This means we want to present at target_msc + divisor for a synced
* flip or directly now for an async flip.
*
* b) target_msc < crtc_msc with target_msc + divisor > crtc_msc.
*
* => This means in any case we want to present at target_msc + divisor.
*/
if (synced_flip || msc_is_after(crtc_msc, target_msc))
target_msc += divisor;
return target_msc;
}
int
present_pixmap(WindowPtr window,
PixmapPtr pixmap,
CARD32 serial,
RegionPtr valid,
RegionPtr update,
int16_t x_off,
int16_t y_off,
RRCrtcPtr target_crtc,
SyncFence *wait_fence,
SyncFence *idle_fence,
#ifdef DRI3
struct dri3_syncobj *acquire_syncobj,
struct dri3_syncobj *release_syncobj,
uint64_t acquire_point,
uint64_t release_point,
#endif /* DRI3 */
uint32_t options,
uint64_t window_msc,
uint64_t divisor,
uint64_t remainder,
present_notify_ptr notifies,
int num_notifies)
{
ScreenPtr screen = window->drawable.pScreen;
present_screen_priv_ptr screen_priv = present_screen_priv(screen);
return screen_priv->present_pixmap(window,
pixmap,
serial,
valid,
update,
x_off,
y_off,
target_crtc,
wait_fence,
idle_fence,
#ifdef DRI3
acquire_syncobj,
release_syncobj,
acquire_point,
release_point,
#endif /* DRI3 */
options,
window_msc,
divisor,
remainder,
notifies,
num_notifies);
}
int
present_notify_msc(WindowPtr window,
CARD32 serial,
uint64_t target_msc,
uint64_t divisor,
uint64_t remainder)
{
return present_pixmap(window,
NULL,
serial,
NULL, NULL,
0, 0,
NULL,
NULL, NULL,
#ifdef DRI3
NULL, NULL, 0, 0,
#endif /* DRI3 */
divisor == 0 ? PresentOptionAsync : 0,
target_msc, divisor, remainder, NULL, 0);
}
|