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

1 2

  /external/neven/Embedded/common/src/b_BitFeatureEm/
Sequence.c 233 const struct bbf_Sequence* ptrL = ( struct bbf_Sequence* )ptrA;
237 int32 sizeL = ptrL->sizeE;
244 if( ptrL->wgtArrE.sizeE == 0 )
246 for( iL = 0; iL < ptrL->sizeE; iL++ )
249 int32 actL = ptrL->ftrPtrArrE[ iL ]->vpActivityE( ptrL->ftrPtrArrE[ iL ], patchA ) - ptrL->thrArrE.arrPtrE[ iL ];
256 for( iL = 0; iL < ptrL->sizeE; iL++ )
259 int32 actL = ptrL->ftrPtrArrE[ iL ]->vpActivityE( ptrL->ftrPtrArrE[ iL ], patchA ) - ptrL->thrArrE.arrPtrE[ iL ]
    [all...]
I04Dns2x2Ftr.c 191 const struct bbf_I04Dns2x2Ftr* ptrL = ( struct bbf_I04Dns2x2Ftr* )ptrA;
195 const uint32* ptnPtrL = ptrL->ptnArrE.arrPtrE;
196 const int16* tableL = ptrL->tableE.arrPtrE;
201 uint32 wL = ptrL->baseE.patchWidthE - 1;
202 uint32 hL = ptrL->baseE.patchHeightE - 1;
206 uint32 blocksL = ptrL->baseE.patchHeightE >> 2; /* number of 4 bit blocks */
254 return sumL * ( ptrL->activityFactorE >> 8 ) + ( ( sumL * ( int32 )( ptrL->activityFactorE & 0x0FF ) ) >> 8 );
I04Dns2x4Ftr.c 191 const struct bbf_I04Dns2x4Ftr* ptrL = ( struct bbf_I04Dns2x4Ftr* )ptrA;
193 uint32 wL = ptrL->baseE.patchWidthE - 1;
194 uint32 hL = ptrL->baseE.patchHeightE - 3;
196 const uint32* dataPtrL = ptrL->dataArrE.arrPtrE;
197 const int16* tableL = ptrL->tableE.arrPtrE;
199 uint32 blocksL = ptrL->baseE.patchHeightE >> 2;
283 return sumL * ( ptrL->activityFactorE >> 8 ) + ( ( sumL * ( int32 )( ptrL->activityFactorE & 0x0FF ) ) >> 8 );
L01Tld1x1Ftr.c 185 const struct bbf_L01Tld1x1Ftr* ptrL = ( struct bbf_L01Tld1x1Ftr* )ptrA;
189 const uint32* dataPtrL = ptrL->dataArrE.arrPtrE;
194 for( iL = ptrL->baseE.patchWidthE >> 2; iL > 0; iL-- )
213 return bsL * ptrL->activityFactorE;
I04Tld2x4Ftr.c 191 const struct bbf_I04Tld2x4Ftr* ptrL = ( struct bbf_I04Tld2x4Ftr* )ptrA;
195 const uint32* dataPtrL = ptrL->dataArrE.arrPtrE;
196 const int16* tableL = ptrL->tableE.arrPtrE;
201 for( iL = ptrL->baseE.patchWidthE >> 3; iL > 0; iL-- )
276 return sumL * ( ptrL->activityFactorE >> 8 ) + ( ( sumL * ( int32 )( ptrL->activityFactorE & 0x0FF ) ) >> 8 );
L04Dns2x2Ftr.c 191 const struct bbf_L04Dns2x2Ftr* ptrL = ( struct bbf_L04Dns2x2Ftr* )ptrA;
193 uint32 wL = ptrL->baseE.patchWidthE - 1;
194 uint32 hL = ptrL->baseE.patchHeightE - 1;
196 const uint32* dataPtrL = ptrL->dataArrE.arrPtrE;
234 return actL * ptrL->activityFactorE + sumL * ptrL->wShiftE;
L01Dns2x4Ftr.c 184 const struct bbf_L01Dns2x4Ftr* ptrL = ( struct bbf_L01Dns2x4Ftr* )ptrA;
186 uint32 wL = ptrL->baseE.patchWidthE - 1;
187 uint32 hL = ptrL->baseE.patchHeightE - 3;
189 const uint32* dataPtrL = ptrL->dataArrE.arrPtrE;
261 return actL * ptrL->activityFactorE;
L04Dns2x4Ftr.c 184 const struct bbf_L04Dns2x4Ftr* ptrL = ( struct bbf_L04Dns2x4Ftr* )ptrA;
186 uint32 wL = ptrL->baseE.patchWidthE - 1;
187 uint32 hL = ptrL->baseE.patchHeightE - 3;
189 const uint32* dataPtrL = ptrL->dataArrE.arrPtrE;
266 return actL * ptrL->activityFactorE;
L04Dns3x3Ftr.c 184 const struct bbf_L04Dns3x3Ftr* ptrL = ( struct bbf_L04Dns3x3Ftr* )ptrA;
186 uint32 wL = ptrL->baseE.patchWidthE - 2;
187 uint32 hL = ptrL->baseE.patchHeightE - 2;
188 const uint32* dataPtrL = ptrL->dataArrE.arrPtrE;
286 return actL * ptrL->activityFactorE;
L06Dns3x3Ftr.c 184 const struct bbf_L06Dns3x3Ftr* ptrL = ( struct bbf_L06Dns3x3Ftr* )ptrA;
186 uint32 wL = ptrL->baseE.patchWidthE - 2;
187 uint32 hL = ptrL->baseE.patchHeightE - 2;
188 const uint32* dataPtrL = ptrL->dataArrE.arrPtrE;
292 return actL * ptrL->activityFactorE;
L06DnsNx4x4Ftr.c 191 const struct bbf_L06DnsNx4x4Ftr* ptrL = ( struct bbf_L06DnsNx4x4Ftr* )ptrA;
193 uint32 wL = ptrL->baseE.patchWidthE - 3;
194 uint32 hL = ptrL->baseE.patchHeightE - 3;
195 const uint32* dataPtrL = ptrL->dataArrE.arrPtrE;
203 for( jL = 0 ; jL < ptrL->layersE; jL++ )
317 return actL * ptrL->activityFactorE;
L01Tld2x4Ftr.c 184 const struct bbf_L01Tld2x4Ftr* ptrL = ( struct bbf_L01Tld2x4Ftr* )ptrA;
186 const uint32* dataPtrL = ptrL->dataArrE.arrPtrE;
194 for( iL = ptrL->baseE.patchWidthE >> 3; iL > 0; iL-- )
268 return actL * ptrL->activityFactorE;
L04Tld2x4Ftr.c 184 const struct bbf_L04Tld2x4Ftr* ptrL = ( struct bbf_L04Tld2x4Ftr* )ptrA;
186 const uint32* dataPtrL = ptrL->dataArrE.arrPtrE;
193 for( iL = ptrL->baseE.patchWidthE >> 3; iL > 0; iL-- )
271 return actL * ptrL->activityFactorE;
L06Dns4x4Ftr.c 184 const struct bbf_L06Dns4x4Ftr* ptrL = ( struct bbf_L06Dns4x4Ftr* )ptrA;
186 uint32 wL = ptrL->baseE.patchWidthE - 3;
187 uint32 hL = ptrL->baseE.patchHeightE - 3;
188 const uint32* dataPtrL = ptrL->dataArrE.arrPtrE;
308 return actL * ptrL->activityFactorE;
  /external/neven/Embedded/common/src/b_TensorEm/
Alt.c 181 const struct bts_Alt* ptrL = ( const struct bts_Alt* )ptrA;
183 if( inVecPtrA->arrE.sizeE != ptrL->altE.matE.widthE )
189 if( outVecPtrA->arrE.allocatedSizeE < ptrL->altE.matE.heightE )
195 bts_Flt16Vec_size( cpA, outVecPtrA, ptrL->altE.matE.heightE );
197 bts_CompactAlt_map( cpA, &ptrL->altE, inVecPtrA->arrE.arrPtrE, inVecPtrA->expE, outVecPtrA->arrE.arrPtrE, &outVecPtrA->expE );
Int32Mat.c 41 int32* ptrL = ptrA;
45 int32 xL = *ptrL++;
55 ptrL = ptrA;
59 *ptrL = ( ( *ptrL >> ( shiftL - 1 ) ) + 1 ) >> 1;
60 ptrL++;
333 int32* ptrL = matL;
336 *ptrL = ( *ptrL + 1 ) >> 1;
337 ptrL++
    [all...]
SubVecMap.c 184 struct bts_SubVecMap* ptrL = ( struct bts_SubVecMap* )ptrA;
186 int32 sizeL = ( ptrL->sizeE != -1 ) ? ptrL->sizeE : ( int32 )inVecPtrA->arrE.sizeE - ptrL->offsetE;
189 if( ( ptrL->offsetE + sizeL ) > ( int32 )inVecPtrA->arrE.sizeE )
203 bbs_memcpy16( outVecPtrA->arrE.arrPtrE, inVecPtrA->arrE.arrPtrE + ptrL->offsetE, sizeL );
MapSequence.c 233 struct bts_MapSequence* ptrL = ( struct bts_MapSequence* )ptrA;
234 if( ptrL->sizeE == 0 )
238 else if( ptrL->sizeE == 1 )
240 struct bts_VectorMap* mapPtrL = ptrL->ptrArrE[ 0 ];
246 struct bts_Flt16Vec* vp1L = &ptrL->vecE;
248 struct bts_VectorMap* mapPtrL = ptrL->ptrArrE[ 0 ];
251 for( iL = 1; iL < ptrL->sizeE; iL++ )
253 mapPtrL = ptrL->ptrArrE[ iL ];
Mat.c 183 const struct bts_Mat* ptrL = ( const struct bts_Mat* )ptrA;
185 if( inVecPtrA->arrE.sizeE != ptrL->matE.widthE )
191 if( outVecPtrA->arrE.allocatedSizeE < ptrL->matE.heightE )
197 bts_Flt16Vec_size( cpA, outVecPtrA, ptrL->matE.heightE );
202 bts_CompactMat_map( cpA, &ptrL->matE, inVecPtrA->arrE.arrPtrE, outVecPtrA->arrE.arrPtrE, &expL );
  /external/neven/Embedded/common/src/b_APIEm/
BFFaceFinder.c 251 struct bpi_BFFaceFinder* ptrL = ( struct bpi_BFFaceFinder* )ptrA;
254 ptrL->detectedFacesE = 0;
255 ptrL->availableFacesE = 0;
256 ptrL->faceDataBufferE = NULL;
299 struct bpi_BFFaceFinder* ptrL = ( struct bpi_BFFaceFinder* )ptrA;
300 ptrL->detectedFacesE = bbf_ScanDetector_process( cpA, ( struct bbf_ScanDetector* )&ptrA->detectorE, imagePtrA, imageWidthA, imageHeightA, roiPtrA, &ptrL->faceDataBufferE );
301 ptrL->availableFacesE = ptrA->detectedFacesE > 0 ? ptrA->detectedFacesE : 1;
303 return ptrL->detectedFacesE;
  /external/neven/Embedded/common/src/b_ImageEm/
ComplexImage.c 114 const struct bbs_Complex* ptrL = ptrA->arrE.arrPtrE;
117 sumL += ptrL->imagE + ptrL->realE;
118 ptrL++;
256 struct bbs_Complex* ptrL = ptrA->arrE.arrPtrE;
259 *ptrL++ = valueA;
UInt32Image.c 122 const uint32* ptrL = ptrA->arrE.arrPtrE;
125 sumL += *ptrL++;
273 uint32* ptrL = ptrA->arrE.arrPtrE;
276 *ptrL++ = valueA;
UInt16ByteImage.c 113 const uint16* ptrL = ptrA->arrE.arrPtrE;
116 sumL += *ptrL++;
276 uint16* ptrL = ptrA->arrE.arrPtrE;
280 *ptrL++ = fillL;
UInt8Image.c 133 const uint8* ptrL = ptrA->arrE.arrPtrE;
136 sumL += *ptrL++;
264 uint8* ptrL = ptrA->arrE.arrPtrE;
267 *ptrL++ = valueA;
  /external/neven/Embedded/common/src/b_BasicEm/
UInt16Arr.c 120 const uint16* ptrL = ptrA->arrPtrE + startIndexA;
123 sumL += *ptrL++;

Completed in 159 milliseconds

1 2