Lines Matching defs:images
635 * 1 and 3. Hence the ideal implementation needs only 2 images, but games
637 * hence they need to allocate 3 images. So let us do it for them.
954 struct x11_image images[0];
1014 return &chain->images[image_index].base;
1039 if (chain->images[i].pixmap == idle->pixmap) {
1040 chain->images[i].busy = false;
1057 struct x11_image *image = &chain->images[i];
1110 * Acquire a ready-to-use image directly from our swapchain. If all images are
1122 if (!chain->images[i].busy) {
1124 xshmfence_await(chain->images[i].shm_fence);
1126 chain->images[i].busy = true;
1202 xshmfence_await(chain->images[image_index].shm_fence);
1216 struct x11_image *image = &chain->images[image_index];
1296 struct x11_image *image = &chain->images[image_index];
1304 chain->images[image_index].busy = false;
1372 if (!chain->images[i].busy) {
1374 chain->images[i].busy = true;
1427 update_area = chain->images[image_index].update_region;
1438 chain->images[image_index].update_area = update_area;
1440 chain->images[image_index].busy = true;
1481 * The number of images that are not owned by X11:
1496 * Runs in a separate thread, blocks and reacts to queued images on the
1500 * pull new images from the present queue and can directly present them.
1502 * In fifo mode images can only be presented one after the other. For that after
1559 /* Assume this isn't a swapchain where we force 5 images, because those
1565 * minimum number of images. */
1568 /* We always need to ensure that the app can have this number of images
1571 * If the number of currently acquired images is greater than the difference
1572 * between the number of images in swapchain and the value of
1584 while (chain->images[image_index].present_queued ||
1585 /* If we have images in the present queue the outer loop won't block and a break
1720 /* Without passing modifiers, we can't have multi-plane RGB images. */
1896 x11_image_finish(chain, pAllocator, &chain->images[i]);
1968 /* Get number of images in our swapchain. This count depends on:
1985 * chain's images extents should fit it for performance-optimizing flips.
1997 size_t size = sizeof(*chain) + num_images * sizeof(chain->images[0]);
2035 /* When images in the swapchain don't fit the window, X can still present them, but it won't
2126 &chain->images[image]);
2131 /* Initialize queues for images in our swapchain. Possible queues are:
2132 * - Present queue: for images sent to the X server but not yet presented.
2133 * - Acquire queue: for images already presented but not yet released by the
2201 x11_image_finish(chain, pAllocator, &chain->images[j]);