Subversion Repositories Kolibri OS

Compare Revisions

Regard whitespace Rev 5360 → Rev 5361

/contrib/sdk/sources/vaapi/intel-driver-1.4.1/src/shaders/h264/ildb/AVC_ILDB_Filter_Y_v.asm
0,0 → 1,203
/*
* Copyright © <2010>, Intel Corporation.
*
* This program is licensed under the terms and conditions of the
* Eclipse Public License (EPL), version 1.0. The full text of the EPL is at
* http://www.opensource.org/licenses/eclipse-1.0.php.
*
*/
////////// AVC ILDB filter vertical Y ///////////////////////////////////////////////////////
//
// This filter code prepares the src data and control data for ILDB filtering on all vertical edges of Y.
//
// It sssumes the data for vertical de-blocking is already transposed.
//
// Luma:
//
// +-------+-------+-------+-------+
// | | | | |
// | | | | |
// | | | | |
// +-------+-------+-------+-------+
// | | | | |
// | | | | |
// | | | | |
// +-------+-------+-------+-------+
// | | | | |
// | | | | |
// | | | | |
// +-------+-------+-------+-------+
// | | | | |
// | | | | |
// | | | | |
// +-------+-------+-------+-------+
//
// V0 V1 V2 V3
// Edge Edge Edge Edge
//
/////////////////////////////////////////////////////////////////////////////
 
#if defined(_DEBUG)
mov (1) EntrySignatureC:w 0xBBBB:w
#endif
 
//========== Luma deblocking ==========
 
 
//---------- Deblock Y external left edge (V0) ----------
 
// Bypass deblocking if it is left edge of the picture.
and.z.f0.0 (1) null:w r[ECM_AddrReg, BitFlags]:ub FilterLeftMbEdgeFlag:w // Check for FilterLeftMbEdgeFlag
 
// and.z.f0.1 (1) null:uw r[ECM_AddrReg, wEdgeCntlMapA_ExtLeftVert0]:uw 0xFFFF:uw // MaskA = 0?
 
// Get (alpha >> 2) + 2
shr (1) alpha2:w r[ECM_AddrReg, bAlphaLeft0_Y]:ub 2:w // alpha >> 2
 
// p3 = Prev MB Y row 0 = r[P_AddrReg, 0]<16;16,1>
// p2 = Prev MB Y row 1 = r[P_AddrReg, 16]<16;16,1>
// p1 = Prev MB Y row 2 = r[P_AddrReg, 32]<16;16,1>
// p0 = Prev MB Y row 3 = r[P_AddrReg, 48]<16;16,1>
// q0 = Cur MB Y row 0 = r[Q_AddrReg, 0]<16;16,1>
// q1 = Cur MB Y row 1 = r[Q_AddrReg, 16]<16;16,1>
// q2 = Cur MB Y row 2 = r[Q_AddrReg, 32]<16;16,1>
// q3 = Cur MB Y row 3 = r[Q_AddrReg, 48]<16;16,1>
mov (1) P_AddrReg:w PREV_MB_Y_BASE:w { NoDDClr }
mov (1) Q_AddrReg:w SRC_MB_Y_BASE:w { NoDDChk }
// Get vertical border edge control data
// alpha = bAlphaLeft0_Y
// beta = bBetaLeft0_Y
mov (2) alpha<1>:w r[ECM_AddrReg, bAlphaLeft0_Y]<2;2,1>:ub { NoDDClr } // 2 channels for alpha and beta
 
mov (2) MaskA<1>:uw r[ECM_AddrReg, wEdgeCntlMapA_ExtLeftVert0]<2;2,1>:uw { NoDDClr, NoDDChk }
// tc0 has bTc0_v30_0_Y | bTc0_v20_0_Y | bTc0_v10_0_Y | bTc0_v00_0_Y
mov (4) tc0<1>:ub r[ECM_AddrReg, bTc0_v00_0_Y]<4;4,1>:ub { NoDDChk }
 
// (f0.0) jmpi BYPASS_EXT_LEFT_EDGE_Y
// (f0.0.anyv) jmpi BYPASS_EXT_LEFT_EDGE_Y
add (1) alpha2:w alpha2:w 2:w // alpha2 = (alpha >> 2) + 2
// CALL(FILTER_Y, 1)
PRED_CALL(-f0.0, FILTER_Y, 1)
 
 
//BYPASS_EXT_LEFT_EDGE_Y:
//------------------------------------------------------------------
// Same alpha, alpha2, beta and MaskB for all internal edges
 
// Get (alpha >> 2) + 2
shr (1) alpha2:w r[ECM_AddrReg, bAlphaInternal_Y]:ub 2:w // alpha >> 2
 
// alpha = bAlphaInternal_Y
// beta = bBetaInternal_Y
mov (2) alpha<1>:w r[ECM_AddrReg, bAlphaInternal_Y]<2;2,1>:ub { NoDDClr }
 
// Set MaskB = 0 for all 3 int edges, so it always uses bS < 4 algorithm.
mov (1) MaskB:uw 0:w { NoDDChk }
 
add (1) alpha2:w alpha2:w 2:w // alpha2 = (alpha >> 2) + 2
 
 
//---------- Deblock Y internal left edge (V1) ----------
 
// Bypass deblocking if FilterInternal4x4EdgesFlag = 0
and.z.f0.0 (1) null:w r[ECM_AddrReg, BitFlags]:ub FilterInternal4x4EdgesFlag:w // Check for FilterInternal4x4EdgesFlag
 
// and.z.f0.1 (1) null:uw r[ECM_AddrReg, wEdgeCntlMap_IntLeftVert]:uw 0xFFFF:uw // MaskA = 0?
 
// p3 = Cur MB Y row 0 = r[P_AddrReg, 0]<16;16,1>
// p2 = Cur MB Y row 1 = r[P_AddrReg, 16]<16;16,1>
// p1 = Cur MB Y row 2 = r[P_AddrReg, 32]<16;16,1>
// p0 = Cur MB Y row 3 = r[P_AddrReg, 48]<16;16,1>
// q0 = Cur MB Y row 4 = r[Q_AddrReg, 0]<16;16,1>
// q1 = Cur MB Y row 5 = r[Q_AddrReg, 16]<16;16,1>
// q2 = Cur MB Y row 6 = r[Q_AddrReg, 32]<16;16,1>
// q3 = Cur MB Y row 7 = r[Q_AddrReg, 48]<16;16,1>
mov (1) P_AddrReg:w SRC_MB_Y_BASE:w { NoDDClr }
mov (1) Q_AddrReg:w 4*Y_ROW_WIDTH+SRC_MB_Y_BASE:w { NoDDChk }
mov (1) MaskA:uw r[ECM_AddrReg, wEdgeCntlMap_IntLeftVert]:uw { NoDDClr }
 
// tc0 has bTc0_v31_Y + bTc0_v21_Y + bTc0_v11_Y + bTc0_v01_Y
mov (4) tc0<1>:ub r[ECM_AddrReg, bTc0_v01_Y]<4;4,1>:ub { NoDDChk }
 
// (f0.0) jmpi BYPASS_4x4_DEBLOCK_V
// (f0.0.anyv) jmpi BYPASS_4x4_DEBLOCK_V
 
// CALL(FILTER_Y, 1)
PRED_CALL(-f0.0, FILTER_Y, 1)
 
//BYPASS_4x4_DEBLOCK_V:
//------------------------------------------------------------------
 
 
//---------- Deblock Y internal mid vert edge (V2) ----------
 
// Bypass deblocking if FilterInternal8x8EdgesFlag = 0
and.z.f0.0 (1) null:w r[ECM_AddrReg, BitFlags]:ub FilterInternal8x8EdgesFlag:w // Check for FilterInternal4x4EdgesFlag
 
// and.z.f0.1 (1) null:uw r[ECM_AddrReg, wEdgeCntlMap_IntMidVert]:uw 0xFFFF:uw // MaskA = 0?
 
// p3 = Cur MB Y row 4 = r[P_AddrReg, 0]<16;16,1>
// p2 = Cur MB Y row 5 = r[P_AddrReg, 16]<16;16,1>
// p1 = Cur MB Y row 6 = r[P_AddrReg, 32]<16;16,1>
// p0 = Cur MB Y row 7 = r[P_AddrReg, 48]<16;16,1>
// q0 = Cur MB Y row 8 = r[Q_AddrReg, 0]<16;16,1>
// q1 = Cur MB Y row 9 = r[Q_AddrReg, 16]<16;16,1>
// q2 = Cur MB Y row 10 = r[Q_AddrReg, 32]<16;16,1>
// q3 = Cur MB Y row 11 = r[Q_AddrReg, 48]<16;16,1>
mov (1) P_AddrReg:w 4*Y_ROW_WIDTH+SRC_MB_Y_BASE:w { NoDDClr }
mov (1) Q_AddrReg:w 8*Y_ROW_WIDTH+SRC_MB_Y_BASE:w { NoDDChk }
 
mov (1) MaskA:uw r[ECM_AddrReg, wEdgeCntlMap_IntMidVert]:uw { NoDDClr }
// mov (1) MaskB:uw 0:w // Set MaskB = 0, so it always uses bS < 4 algorithm.
 
// tc0 has bTc0_v32_Y + bTc0_v22_Y + bTc0_v12_Y + bTc0_v02_Y
mov (4) tc0<1>:ub r[ECM_AddrReg, bTc0_v02_Y]<4;4,1>:ub { NoDDChk }
 
// (f0.0) jmpi BYPASS_8x8_DEBLOCK_V
// (f0.0.anyv) jmpi BYPASS_8x8_DEBLOCK_V
// CALL(FILTER_Y, 1)
PRED_CALL(-f0.0, FILTER_Y, 1)
 
//BYPASS_8x8_DEBLOCK_V:
//-----------------------------------------------
 
 
//---------- Deblock Y interal right edge (V3) ----------
 
// Bypass deblocking if FilterInternal4x4EdgesFlag = 0
and.z.f0.0 (1) null:w r[ECM_AddrReg, BitFlags]:ub FilterInternal4x4EdgesFlag:w // Check for FilterInternal4x4EdgesFlag
 
// and.z.f0.1 (1) null:uw r[ECM_AddrReg, wEdgeCntlMap_IntRightVert]:uw 0xFFFF:uw // MaskA = 0?
 
// p3 = Cur MB Y row 8 = r[P_AddrReg, 0]<16;16,1>
// p2 = Cur MB Y row 9 = r[P_AddrReg, 16]<16;16,1>
// p1 = Cur MB Y row 10 = r[P_AddrReg, 32]<16;16,1>
// p0 = Cur MB Y row 11 = r[P_AddrReg, 48]<16;16,1>
// q0 = Cur MB Y row 12 = r[Q_AddrReg, 0]<16;16,1>
// q1 = Cur MB Y row 13 = r[Q_AddrReg, 16]<16;16,1>
// q2 = Cur MB Y row 14 = r[Q_AddrReg, 32]<16;16,1>
// q3 = Cur MB Y row 15 = r[Q_AddrReg, 48]<16;16,1>
mov (1) P_AddrReg:w 8*Y_ROW_WIDTH+SRC_MB_Y_BASE:w { NoDDClr }
mov (1) Q_AddrReg:w 12*Y_ROW_WIDTH+SRC_MB_Y_BASE:w { NoDDChk }
 
mov (1) MaskA:uw r[ECM_AddrReg, wEdgeCntlMap_IntRightVert]:uw { NoDDClr }
// mov (1) MaskB:uw 0:w // Set MaskB = 0, so it always uses bS < 4 algorithm.
 
// tc0 has bTc0_v33_Y + bTc0_v23_Y + bTc0_v13_Y + bTc0_v03_Y
mov (4) tc0<1>:ub r[ECM_AddrReg, bTc0_v03_Y]<4;4,1>:ub { NoDDChk }
 
// (f0.0) jmpi BYPASS_4x4_DEBLOCK_V2
// (f0.0.anyv) jmpi BYPASS_4x4_DEBLOCK_V2
// CALL(FILTER_Y, 1)
PRED_CALL(-f0.0, FILTER_Y, 1)
 
//BYPASS_4x4_DEBLOCK_V2:
//-----------------------------------------------