Lines Matching defs:planes
352 unsigned int planes;
360 yuv = tegra_plane_format_is_yuv(window->format, &planes, NULL);
364 bpp = (planes > 1) ? 1 : 2;
393 if (yuv && planes > 1)
413 if (yuv && planes > 1) {
416 if (planes > 2)
692 * Tegra doesn't support different strides for U and V planes so we
768 * Tegra uses a shared stride for UV planes. Framebuffers are
794 * planes. So we have ourselves a nice little chicken and egg problem
1354 struct drm_plane *planes[2], *primary;
1369 planes[i] = tegra_dc_overlay_plane_create(drm, dc, 1 + i,
1371 if (IS_ERR(planes[i])) {
1372 err = PTR_ERR(planes[i]);
1375 planes[i]->funcs->destroy(planes[i]);
1417 copy->planes = state->planes;
2023 * When CRTC is disabled on DPMS, the state of attached planes
2045 * planes from another CRTC, hence we need to filter out the
2046 * planes unrelated to this CRTC.
2321 value = dc_state->planes << 8 | GENERAL_UPDATE;
2325 value = dc_state->planes | GENERAL_ACT_REQ;
2406 * The nv-display uses shared planes. The algorithm below assumes
2407 * maximum 3 planes per-CRTC, this assumption isn't applicable to
2417 * For overlapping planes pixel's data is fetched for each plane at
2420 * consumed by all planes.
2423 * bitmask of plane indices telling with what planes there is an
2445 * overlapping planes, where "simultaneously" means areas where DC
2446 * fetches from the planes simultaneously during of scan-out process.
2448 * For example, if plane A overlaps with planes B and C, but B and C
2450 * A-and-B or A-and-C planes overlap.