Home | History | Annotate | Download | only in b_BitFeatureEm
      1 /*
      2  * Copyright (C) 2008 The Android Open Source Project
      3  *
      4  * Licensed under the Apache License, Version 2.0 (the "License");
      5  * you may not use this file except in compliance with the License.
      6  * You may obtain a copy of the License at
      7  *
      8  *      http://www.apache.org/licenses/LICENSE-2.0
      9  *
     10  * Unless required by applicable law or agreed to in writing, software
     11  * distributed under the License is distributed on an "AS IS" BASIS,
     12  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
     13  * See the License for the specific language governing permissions and
     14  * limitations under the License.
     15  */
     16 
     17 /* ---- includes ----------------------------------------------------------- */
     18 
     19 #include "b_BasicEm/Functions.h"
     20 #include "b_BasicEm/Math.h"
     21 #include "b_BitFeatureEm/I04Tld2x4Ftr.h"
     22 
     23 /* ------------------------------------------------------------------------- */
     24 
     25 /* ========================================================================= */
     26 /*                                                                           */
     27 /* ---- \ghd{ auxiliary functions } ---------------------------------------- */
     28 /*                                                                           */
     29 /* ========================================================================= */
     30 
     31 /* ------------------------------------------------------------------------- */
     32 
     33 /* ========================================================================= */
     34 /*                                                                           */
     35 /* ---- \ghd{ constructor / destructor } ----------------------------------- */
     36 /*                                                                           */
     37 /* ========================================================================= */
     38 
     39 /* ------------------------------------------------------------------------- */
     40 
     41 void bbf_I04Tld2x4Ftr_init( struct bbs_Context* cpA,
     42 						    struct bbf_I04Tld2x4Ftr* ptrA )
     43 {
     44 	bbf_Feature_init( cpA, &ptrA->baseE );
     45 	ptrA->baseE.typeE = ( uint32 )bbf_FT_I04_TLD_2X4_FTR;
     46 	ptrA->baseE.vpActivityE = bbf_I04Tld2x4Ftr_activity;
     47 	bbs_UInt32Arr_init( cpA, &ptrA->dataArrE );
     48 	bbs_Int16Arr_init( cpA, &ptrA->tableE );
     49 	ptrA->activityFactorE = 0;
     50 }
     51 
     52 /* ------------------------------------------------------------------------- */
     53 
     54 void bbf_I04Tld2x4Ftr_exit( struct bbs_Context* cpA,
     55 						    struct bbf_I04Tld2x4Ftr* ptrA )
     56 {
     57 	bbf_Feature_exit( cpA, &ptrA->baseE );
     58 	bbs_UInt32Arr_exit( cpA, &ptrA->dataArrE );
     59 	bbs_Int16Arr_exit( cpA, &ptrA->tableE );
     60 	ptrA->activityFactorE = 0;
     61 }
     62 
     63 /* ------------------------------------------------------------------------- */
     64 
     65 /* ========================================================================= */
     66 /*                                                                           */
     67 /* ---- \ghd{ operators } -------------------------------------------------- */
     68 /*                                                                           */
     69 /* ========================================================================= */
     70 
     71 /* ------------------------------------------------------------------------- */
     72 
     73 void bbf_I04Tld2x4Ftr_copy( struct bbs_Context* cpA,
     74 						    struct bbf_I04Tld2x4Ftr* ptrA,
     75 						    const struct bbf_I04Tld2x4Ftr* srcPtrA )
     76 {
     77 	bbf_Feature_copy( cpA, &ptrA->baseE, &srcPtrA->baseE );
     78 	bbs_UInt32Arr_copy( cpA, &ptrA->dataArrE, &srcPtrA->dataArrE );
     79 	bbs_Int16Arr_copy( cpA, &ptrA->tableE, &srcPtrA->tableE );
     80 	ptrA->activityFactorE = srcPtrA->activityFactorE;
     81 }
     82 
     83 /* ------------------------------------------------------------------------- */
     84 
     85 flag bbf_I04Tld2x4Ftr_equal( struct bbs_Context* cpA,
     86 						     const struct bbf_I04Tld2x4Ftr* ptrA,
     87 						     const struct bbf_I04Tld2x4Ftr* srcPtrA )
     88 {
     89 	if( !bbf_Feature_equal( cpA, &ptrA->baseE, &srcPtrA->baseE ) ) return FALSE;
     90 	if( !bbs_UInt32Arr_equal( cpA, &ptrA->dataArrE, &srcPtrA->dataArrE ) ) return FALSE;
     91 	if( !bbs_Int16Arr_equal( cpA, &ptrA->tableE, &srcPtrA->tableE ) ) return FALSE;
     92 	if( ptrA->activityFactorE != srcPtrA->activityFactorE ) return FALSE;
     93 	return TRUE;
     94 }
     95 
     96 /* ------------------------------------------------------------------------- */
     97 
     98 /* ========================================================================= */
     99 /*                                                                           */
    100 /* ---- \ghd{ query functions } -------------------------------------------- */
    101 /*                                                                           */
    102 /* ========================================================================= */
    103 
    104 /* ------------------------------------------------------------------------- */
    105 
    106 /* ========================================================================= */
    107 /*                                                                           */
    108 /* ---- \ghd{ modify functions } ------------------------------------------- */
    109 /*                                                                           */
    110 /* ========================================================================= */
    111 
    112 /* ------------------------------------------------------------------------- */
    113 
    114 /* ========================================================================= */
    115 /*                                                                           */
    116 /* ---- \ghd{ I/O } -------------------------------------------------------- */
    117 /*                                                                           */
    118 /* ========================================================================= */
    119 
    120 /* ------------------------------------------------------------------------- */
    121 
    122 uint32 bbf_I04Tld2x4Ftr_memSize( struct bbs_Context* cpA,
    123 							     const struct bbf_I04Tld2x4Ftr* ptrA )
    124 {
    125 	uint32 memSizeL = bbs_SIZEOF16( uint32 ) +
    126 					  bbs_SIZEOF16( uint32 ); /* version */
    127 
    128 	memSizeL += bbf_Feature_memSize( cpA, &ptrA->baseE );
    129 	memSizeL += bbs_UInt32Arr_memSize( cpA, &ptrA->dataArrE );
    130 	memSizeL += bbs_Int16Arr_memSize( cpA, &ptrA->tableE );
    131 	memSizeL += bbs_SIZEOF16( ptrA->activityFactorE );
    132 
    133 	return memSizeL;
    134 }
    135 
    136 /* ------------------------------------------------------------------------- */
    137 
    138 uint32 bbf_I04Tld2x4Ftr_memWrite( struct bbs_Context* cpA,
    139 							      const struct bbf_I04Tld2x4Ftr* ptrA,
    140 								  uint16* memPtrA )
    141 {
    142 	uint32 memSizeL = bbf_I04Tld2x4Ftr_memSize( cpA, ptrA );
    143 	memPtrA += bbs_memWrite32( &memSizeL, memPtrA );
    144 	memPtrA += bbs_memWriteUInt32( bbf_I04_TLD_2X4_FTR_VERSION, memPtrA );
    145 	memPtrA += bbf_Feature_memWrite( cpA, &ptrA->baseE, memPtrA );
    146 	memPtrA += bbs_UInt32Arr_memWrite( cpA, &ptrA->dataArrE, memPtrA );
    147 	memPtrA += bbs_Int16Arr_memWrite( cpA, &ptrA->tableE, memPtrA );
    148 	memPtrA += bbs_memWrite32( &ptrA->activityFactorE, memPtrA );
    149 	return memSizeL;
    150 }
    151 
    152 /* ------------------------------------------------------------------------- */
    153 
    154 uint32 bbf_I04Tld2x4Ftr_memRead( struct bbs_Context* cpA,
    155 							     struct bbf_I04Tld2x4Ftr* ptrA,
    156 							     const uint16* memPtrA,
    157 							     struct bbs_MemTbl* mtpA )
    158 {
    159 	uint32 memSizeL, versionL;
    160 	struct bbs_MemTbl memTblL = *mtpA;
    161 	struct bbs_MemSeg* espL = bbs_MemTbl_fastestSegPtr( cpA, &memTblL, 0 );
    162 	if( bbs_Context_error( cpA ) ) return 0;
    163 	memPtrA += bbs_memRead32( &memSizeL, memPtrA );
    164 	memPtrA += bbs_memReadVersion32( cpA, &versionL, bbf_I04_TLD_2X4_FTR_VERSION, memPtrA );
    165 	memPtrA += bbf_Feature_memRead( cpA, &ptrA->baseE, memPtrA );
    166 	memPtrA += bbs_UInt32Arr_memRead( cpA, &ptrA->dataArrE, memPtrA, espL );
    167 	memPtrA += bbs_Int16Arr_memRead( cpA, &ptrA->tableE, memPtrA, espL );
    168 	memPtrA += bbs_memRead32( &ptrA->activityFactorE, memPtrA );
    169 	if( memSizeL != bbf_I04Tld2x4Ftr_memSize( cpA, ptrA ) )
    170 	{
    171 		bbs_ERR0( bbs_ERR_CORRUPT_DATA, "uint32 bbf_I04Tld2x4Ftr_memRead( struct bem_ScanGradientMove* ptrA, const uint16* memPtrA ):\n"
    172 			        "size mismatch" );
    173 		return 0;
    174 	}
    175 
    176 	return memSizeL;
    177 }
    178 
    179 /* ------------------------------------------------------------------------- */
    180 
    181 /* ========================================================================= */
    182 /*                                                                           */
    183 /* ---- \ghd{ exec functions } --------------------------------------------- */
    184 /*                                                                           */
    185 /* ========================================================================= */
    186 
    187 /* ------------------------------------------------------------------------- */
    188 
    189 int32 bbf_I04Tld2x4Ftr_activity( const struct bbf_Feature* ptrA, const uint32* patchA )
    190 {
    191 	const struct bbf_I04Tld2x4Ftr* ptrL = ( struct bbf_I04Tld2x4Ftr* )ptrA;
    192 
    193 	uint32 iL;
    194 
    195 	const uint32* dataPtrL = ptrL->dataArrE.arrPtrE;
    196 	const int16*  tableL   = ptrL->tableE.arrPtrE;
    197 	const uint32* patchL   = patchA;
    198 
    199 	int32 sumL = 0;
    200 
    201 	for( iL = ptrL->baseE.patchWidthE >> 3; iL > 0; iL-- )
    202 	{
    203 		uint32 vL;
    204 
    205 		/* compare with pattern */
    206 		uint32 s1L = patchL[ 0 ] ^ dataPtrL[ 0 ];
    207 		uint32 s2L = patchL[ 1 ] ^ dataPtrL[ 1 ];
    208 
    209 		/* bit count */
    210 		s1L = ( s1L & 0x55555555 ) + ( ( s1L >> 1 ) & 0x55555555 );
    211 		s1L = ( s1L & 0x33333333 ) + ( ( s1L >> 2 ) & 0x33333333 );
    212 		s2L = ( s2L & 0x55555555 ) + ( ( s2L >> 1 ) & 0x55555555 );
    213 		s2L = ( s2L & 0x33333333 ) + ( ( s2L >> 2 ) & 0x33333333 );
    214 
    215 		/* compare with threshold and store results in vL */
    216 		vL = ( ( s1L + s2L + dataPtrL[ 2 ] ) & 0x88888888 ) >> 3;
    217 
    218 		/* compare with pattern */
    219 		s1L = patchL[ 2 ] ^ dataPtrL[ 3 ];
    220 		s2L = patchL[ 3 ] ^ dataPtrL[ 4 ];
    221 
    222 		/* bit count */
    223 		s1L = ( s1L & 0x55555555 ) + ( ( s1L >> 1 ) & 0x55555555 );
    224 		s1L = ( s1L & 0x33333333 ) + ( ( s1L >> 2 ) & 0x33333333 );
    225 		s2L = ( s2L & 0x55555555 ) + ( ( s2L >> 1 ) & 0x55555555 );
    226 		s2L = ( s2L & 0x33333333 ) + ( ( s2L >> 2 ) & 0x33333333 );
    227 
    228 		/* compare with threshold and store results in vL */
    229 		vL |= ( ( s1L + s2L + dataPtrL[ 5 ] ) & 0x88888888 ) >> 2;
    230 
    231 		/* compare with pattern */
    232 		s1L = patchL[ 4 ] ^ dataPtrL[ 6 ];
    233 		s2L = patchL[ 5 ] ^ dataPtrL[ 7 ];
    234 
    235 		/* bit count */
    236 		s1L = ( s1L & 0x55555555 ) + ( ( s1L >> 1 ) & 0x55555555 );
    237 		s1L = ( s1L & 0x33333333 ) + ( ( s1L >> 2 ) & 0x33333333 );
    238 		s2L = ( s2L & 0x55555555 ) + ( ( s2L >> 1 ) & 0x55555555 );
    239 		s2L = ( s2L & 0x33333333 ) + ( ( s2L >> 2 ) & 0x33333333 );
    240 
    241 		/* compare with threshold and store results in vL */
    242 		vL |= ( ( s1L + s2L + dataPtrL[ 8 ] ) & 0x88888888 ) >> 1;
    243 
    244 		/* compare with pattern */
    245 		s1L = patchL[ 6 ] ^ dataPtrL[  9 ];
    246 		s2L = patchL[ 7 ] ^ dataPtrL[ 10 ];
    247 
    248 		/* bit count */
    249 		s1L = ( s1L & 0x55555555 ) + ( ( s1L >> 1 ) & 0x55555555 );
    250 		s1L = ( s1L & 0x33333333 ) + ( ( s1L >> 2 ) & 0x33333333 );
    251 		s2L = ( s2L & 0x55555555 ) + ( ( s2L >> 1 ) & 0x55555555 );
    252 		s2L = ( s2L & 0x33333333 ) + ( ( s2L >> 2 ) & 0x33333333 );
    253 
    254 		/* compare with threshold and store results in vL */
    255 		vL |= ( ( s1L + s2L + dataPtrL[ 11 ] ) & 0x88888888 );
    256 
    257 		/* invert bits */
    258 		vL = ~vL;
    259 
    260 		/* evaluate vL */
    261 		/* parallel processing of weights (4 weights at a time) */
    262 		sumL += tableL[         ( vL       ) & 0x0F   ];
    263 		sumL += tableL[  16 + ( ( vL >>  4 ) & 0x0F ) ];
    264 		sumL += tableL[  32 + ( ( vL >>  8 ) & 0x0F ) ];
    265 		sumL += tableL[  48 + ( ( vL >> 12 ) & 0x0F ) ];
    266 		sumL += tableL[  64 + ( ( vL >> 16 ) & 0x0F ) ];
    267 		sumL += tableL[  80 + ( ( vL >> 20 ) & 0x0F ) ];
    268 		sumL += tableL[  96 + ( ( vL >> 24 ) & 0x0F ) ];
    269 		sumL += tableL[ 112 + ( ( vL >> 28 ) & 0x0F ) ];
    270 
    271 		tableL  += 128;
    272 		dataPtrL += 12;
    273 		patchL  += 8;
    274 	}
    275 
    276 	return sumL * ( ptrL->activityFactorE >> 8 ) + ( ( sumL * ( int32 )( ptrL->activityFactorE & 0x0FF ) ) >> 8 );
    277 }
    278 
    279 /* ------------------------------------------------------------------------- */
    280 
    281 /* ========================================================================= */
    282 
    283