Lines Matching defs:planes
351 unsigned int planes;
359 yuv = tegra_plane_format_is_yuv(window->format, &planes, NULL);
363 bpp = (planes > 1) ? 1 : 2;
392 if (yuv && planes > 1)
412 if (yuv && planes > 1) {
415 if (planes > 2)
691 * Tegra doesn't support different strides for U and V planes so we
767 * Tegra uses a shared stride for UV planes. Framebuffers are
793 * planes. So we have ourselves a nice little chicken and egg problem
1348 struct drm_plane *planes[2], *primary;
1363 planes[i] = tegra_dc_overlay_plane_create(drm, dc, 1 + i,
1365 if (IS_ERR(planes[i])) {
1366 err = PTR_ERR(planes[i]);
1369 planes[i]->funcs->destroy(planes[i]);
1408 copy->planes = state->planes;
2007 * When CRTC is disabled on DPMS, the state of attached planes
2029 * planes from another CRTC, hence we need to filter out the
2030 * planes unrelated to this CRTC.
2305 value = dc_state->planes << 8 | GENERAL_UPDATE;
2309 value = dc_state->planes | GENERAL_ACT_REQ;
2390 * The nv-display uses shared planes. The algorithm below assumes
2391 * maximum 3 planes per-CRTC, this assumption isn't applicable to
2401 * For overlapping planes pixel's data is fetched for each plane at
2404 * consumed by all planes.
2407 * bitmask of plane indices telling with what planes there is an
2429 * overlapping planes, where "simultaneously" means areas where DC
2430 * fetches from the planes simultaneously during of scan-out process.
2432 * For example, if plane A overlaps with planes B and C, but B and C
2434 * A-and-B or A-and-C planes overlap.