HomeSort by relevance Sort by last modified time
    Searched refs:sizeL (Results 1 - 25 of 31) sorted by null

1 2

  /external/neven/Embedded/common/src/b_TensorEm/
Int32Mat.c 239 int32 sizeL = matWidthA;
249 for( iL = 0; iL < sizeL; iL++ )
254 bbs_memcpy32( outVecA, inVecA, sizeL * bbs_SIZEOF32( int32 ) );
258 for( kL = 0; kL < sizeL; kL++ )
267 for( iL = 0; iL < sizeL; iL++ )
271 int32* rowL = matL + ( iL * sizeL );
272 for( jL = 0; jL < sizeL; jL++ )
304 int32* row1PtrL = matL + ( iPivL * sizeL );
305 int32* row2PtrL = matL + ( jPivL * sizeL );
306 for( jL = 0; jL < sizeL; jL++
    [all...]
Flt16Vec.c 100 uint16 sizeL = ptrA->arrE.sizeE;
103 for( iL = 0; iL < sizeL; iL++ )
107 return sumL / ( int32 )sizeL;
122 uint16 sizeL = ptrA->arrE.sizeE;
125 for( iL = 0; iL < sizeL; iL++ )
239 uint32 sizeL = ptrA->arrE.sizeE;
241 for( iL = 0; iL < sizeL; iL++ ) dstL[ iL ] <<= shlL;
258 uint32 sizeL = ptrA->arrE.sizeE;
260 for( iL = 0; iL < sizeL; iL++ ) dstL[ iL ] = ( ( int32 )dstL[ iL ] * fL + 32768 ) >> 16;
271 uint16 sizeL = ptrA->arrE.sizeE
    [all...]
SubVecMap.c 186 int32 sizeL = ( ptrL->sizeE != -1 ) ? ptrL->sizeE : ( int32 )inVecPtrA->arrE.sizeE - ptrL->offsetE;
187 if( sizeL < 0 ) sizeL = 0;
189 if( ( ptrL->offsetE + sizeL ) > ( int32 )inVecPtrA->arrE.sizeE )
195 if( outVecPtrA->arrE.allocatedSizeE < ( uint32 )sizeL )
201 bts_Flt16Vec_size( cpA, outVecPtrA, sizeL );
203 bbs_memcpy16( outVecPtrA->arrE.arrPtrE, inVecPtrA->arrE.arrPtrE + ptrL->offsetE, sizeL );
RBFMap2D.c 156 const uint32 sizeL = srcPtrA->sizeE;
181 /* also checks for sizeL > allocated size */
182 bts_Cluster2D_size( cpA, &ptrA->rbfCoeffClusterE, sizeL );
185 for( iL =0; iL < sizeL; iL++ )
195 if( sizeL < 3 )
203 ptrA->matE.widthE = sizeL;
204 ptrA->tempMatE.widthE = sizeL;
217 for( iL = 0; iL < sizeL; iL++ )
220 int32* ptrL = ptrA->matE.arrE.arrPtrE + iL * sizeL;
248 for( iL = 0; iL < sizeL; iL++
    [all...]
Cluster2D.c 471 uint32 sizeL;
476 memPtrA += bbs_memRead32( &sizeL, memPtrA );
479 if( ptrA->allocatedSizeE < sizeL )
481 bts_Cluster2D_create( cpA, ptrA, sizeL, mspA );
485 bts_Cluster2D_size( cpA, ptrA, sizeL );
517 uint32 sizeL = srcPtrA->sizeE;
529 if( sizeL <= 2 )
537 if( sizeL <= 1 )
549 if( sizeL == 0 || altTypeL == bts_ALT_IDENTITY )
575 int32 iL = sizeL;
    [all...]
CompactAlt.c 188 uint32 sizeL = ptrA->matE.heightE;
201 for( iL = 0; iL < sizeL; iL++ ) outVecA[ iL ] = ( ( int32 )outVecA[ iL ] + vecL[ iL ] + 1 ) >> 1;
208 for( iL = 0; iL < sizeL; iL++ ) outVecA[ iL ] = ( ( int32 )outVecA[ iL ] + ( ( ( int32 )vecL[ iL ] + addL ) >> shrL ) + 1 ) >> 1;
215 for( iL = 0; iL < sizeL; iL++ ) outVecA[ iL ] = ( ( ( ( int32 )outVecA[ iL ] + addL ) >> shrL ) + vecL[ iL ] + 1 ) >> 1;
CompactMat.c 50 uint32 sizeL = *rowPtrL++;
69 for( iL = sizeL; iL > 0; iL-- ) sumL += ( ( int32 )*rowPtrL++ * ( int32 )*inPtrL++ );
78 for( iL = sizeL; iL >= 8; iL -= 8 )
108 for( iL = sizeL; iL >= 8; iL -= 8 )
141 for( iL = sizeL; iL >= 16; iL -= 16 )
189 for( iL = sizeL; iL >= 4; iL -= 4 )
223 for( iL = 0; iL < sizeL; iL++ )
243 for( iL = sizeL; iL > 0; iL-- ) sumL += ( ( ( int32 )*rowPtrL++ * ( int32 )*inPtrL++ ) + roundL ) >> overflowBitsL;
249 for( iL = sizeL; iL >= 2; iL -= 2 )
266 for( iL = sizeL; iL >= 4; iL -= 4
    [all...]
Cluster3D.c 431 uint32 sizeL;
436 memPtrA += bbs_memRead32( &sizeL, memPtrA );
439 if( ptrA->allocatedSizeE < sizeL )
441 bts_Cluster3D_create( cpA, ptrA, sizeL, mspA );
445 bts_Cluster3D_size( cpA, ptrA, sizeL );
  /external/neven/Embedded/common/src/b_BasicEm/
MemSeg.c 128 uint32 sizeL = *( uint32* )( ptrA->memPtrE + indexL );
129 indexL += ( sizeL & 0xFFFFFFFE );
130 if( ( sizeL & 1 ) == 0 )
132 countL += sizeL - 2;
156 uint32 sizeL = *( uint32* )( ptrA->memPtrE + indexL );
157 indexL += ( sizeL & 0xFFFFFFFE );
175 uint32 sizeL = *( uint32* )( ptrA->memPtrE + indexL );
176 indexL += ( sizeL & 0xFFFFFFFE );
177 countL += ( ( sizeL & 1 ) == 0 );
330 uint32 indexL, sizeL;
    [all...]
Int8Arr.c 145 uint32 sizeL = sizeA;
146 if( ( sizeL & 1 ) != 0 ) sizeL++;
148 ptrA->arrPtrE = bbs_MemSeg_alloc( cpA, mspA, sizeL >> 1 );
150 ptrA->allocatedSizeE = sizeL;
211 uint32 memSizeL, sizeL;
214 memPtrA += bbs_memRead32( &sizeL, memPtrA );
215 bbs_Int8Arr_create( cpA, ptrA, sizeL, mspA );
UInt8Arr.c 145 uint32 sizeL = sizeA;
146 if( ( sizeL & 1 ) != 0 ) sizeL++;
148 ptrA->arrPtrE = bbs_MemSeg_alloc( cpA, mspA, sizeL >> 1 );
150 ptrA->allocatedSizeE = sizeL;
210 uint32 memSizeL, sizeL;
213 memPtrA += bbs_memRead32( &sizeL, memPtrA );
214 bbs_UInt8Arr_create( cpA, ptrA, sizeL, mspA );
MemTbl.c 340 uint32 sizeL = bbs_MemSeg_availableSize( cpA, ptrA->espArrE[ iL ] );
341 if( sizeL > maxSizeL )
343 maxSizeL = sizeL;
413 uint32 sizeL = bbs_MemSeg_availableSize( cpA, &ptrA->ssArrE[ iL ] );
414 if( sizeL > maxSizeL )
416 maxSizeL = sizeL;
APhArr.c 204 uint32 memSizeL, sizeL;
207 memPtrA += bbs_memRead32( &sizeL, memPtrA );
208 bbs_APhArr_create( cpA, ptrA, sizeL, mspA );
ComplexArr.c 205 uint32 memSizeL, sizeL;
208 memPtrA += bbs_memRead32( &sizeL, memPtrA );
209 bbs_ComplexArr_create( cpA, ptrA, sizeL, mspA );
DynMemManager.c 89 uint32 sizeL = 0;
93 sizeL += ( ( uint32* )pL )[ 2 ];
96 return sizeL;
Int16Arr.c 249 uint32 memSizeL, sizeL;
252 memPtrA += bbs_memRead32( &sizeL, memPtrA );
253 bbs_Int16Arr_create( cpA, ptrA, sizeL, mspA );
Int32Arr.c 205 uint32 memSizeL, sizeL;
208 memPtrA += bbs_memRead32( &sizeL, memPtrA );
209 bbs_Int32Arr_create( cpA, ptrA, sizeL, mspA );
String.c 146 uint32 sizeL;
149 sizeL = bbs_vsnprintf( bufA, bufSizeA, formatA, argsL );
151 return sizeL;
UInt16Arr.c 221 uint32 memSizeL, sizeL;
224 memPtrA += bbs_memRead32( &sizeL, memPtrA );
225 bbs_UInt16Arr_create( cpA, ptrA, sizeL, mspA );
UInt32Arr.c 205 uint32 memSizeL, sizeL;
208 memPtrA += bbs_memRead32( &sizeL, memPtrA );
209 bbs_UInt32Arr_create( cpA, ptrA, sizeL, mspA );
  /external/neven/Embedded/common/src/b_ImageEm/
UInt16BytePyrImage.c 145 uint32 sizeL = 0;
149 sizeL += ( baseSizeL >> ( iL * 2 ) );
151 return bbs_UInt16Arr_heapSize( cpA, &ptrA->arrE, sizeL );
171 uint32 sizeL = 0;
205 sizeL += ( baseSizeL >> ( iL * 2 ) );
207 bbs_UInt16Arr_create( cpA, &ptrA->arrE, sizeL, mspA );
219 uint32 sizeL = 0;
245 sizeL += ( baseSizeL >> ( iL * 2 ) );
248 if( sizeL > ptrA->arrE.allocatedSizeE )
255 bbs_UInt16Arr_size( cpA, &ptrA->arrE, sizeL );
    [all...]
UInt8PyramidalImage.c 146 uint32 sizeL = 0;
150 sizeL += ( baseSizeL >> ( iL * 2 ) );
152 return bbs_UInt8Arr_heapSize( cpA, &ptrA->arrE, sizeL );
172 uint32 sizeL = 0;
177 sizeL += ( baseSizeL >> ( iL * 2 ) );
208 bbs_UInt8Arr_create( cpA, &ptrA->arrE, sizeL, mspA );
220 uint32 sizeL = 0;
246 sizeL += ( baseSizeL >> ( iL * 2 ) );
249 if( sizeL > ptrA->arrE.allocatedSizeE )
256 bbs_UInt8Arr_size( cpA, &ptrA->arrE, sizeL );
    [all...]
  /external/neven/Embedded/common/src/b_BitFeatureEm/
Sequence.c 237 int32 sizeL = ptrL->sizeE;
240 int32 actSumL = ( -sizeL ) << 20;
242 if( sizeL == 0 ) return 0x10000000; /* 1.0 in 4.28 format */
251 if( actL < 0 ) return ( actSumL / sizeL ) << 7; /* return 4.28 */
263 if( actL < 0 ) return ( actSumL / sizeL ) << 7; /* return 4.28 */
267 actSumL += sizeL << 20;
270 return ( actSumL / sizeL ) << 7; /* return 4.28 */
Scanner.c 859 uint32 sizeL = ptrA->bitImageE.widthE;
865 uint32* srcL = ( uint32* )ptrA->bitImageE.arrE.arrPtrE + rowL * sizeL;
869 for( iL = 0; iL < sizeL; iL++ ) dstL[ iL ] = ( dstL[ iL ] >> 1 ) | ( srcL[ iL ] << shlL );
873 bbs_memcpy32( dstL, srcL, sizeL );
878 for( iL = 0; iL < sizeL; iL++ ) dstL[ iL ] >>= 1;
910 uint32 sizeL;
918 sizeL = ptrA->bitImageE.widthE;
923 uint32* srcL = ptrA->bitImageE.arrE.arrPtrE + rowL * sizeL;
927 for( iL = 0; iL < sizeL; iL++ ) dstL[ iL ] = ( dstL[ iL ] >> 1 ) | ( srcL[ iL ] << shlL );
931 bbs_memcpy32( dstL, srcL, sizeL );
    [all...]
LocalScanDetector.c 487 uint32 sizeL = ptrA->scanClusterE.sizeE;
489 if( sizeL > bpi_LOCAL_SCAN_DETECTOR_MAX_CLUSTER_SIZE )
578 bts_Cluster2D_size( cpA, dstClPtrL, sizeL );
588 bbs_memset32( actArrL, 0x80000000, sizeL );
592 for( iL = 0; iL < sizeL; iL++ )
644 for( iL = 0; iL < sizeL; iL++ )
660 for( iL = 0; iL < sizeL; iL++ ) idxArrL[ iL ] = iL;
665 for( iL = 1; iL < sizeL; iL++ )
678 for( iL = ( sizeL >> 1 ); iL < sizeL && actArrL[ idxArrL[ iL ] ] >= 0; iL++ )
    [all...]

Completed in 242 milliseconds

1 2