| /frameworks/av/media/libstagefright/codecs/on2/h264dec/source/ |
| h264bsd_deblocking.c | 89 * column in the table. Indexing goes as tc0[indexA][bS-1] */
101 * column in the table. Indexing goes as tc0[indexA][bS] */
[all...] |
| /external/neven/Embedded/common/src/b_TensorEm/ |
| Cluster3D.c | 184 uint32 indexA, int32 bbpA )
188 if( indexA >= ptrA->sizeE )
191 "indexA = %i is out of range [0,%i]",
192 indexA,
199 return ( int32 ) ptrA->vecArrE[ indexA ].xE << shiftL;
203 return ( ( ( int32 ) ptrA->vecArrE[ indexA ].xE >> ( -shiftL - 1 ) ) + 1 ) >> 1;
211 uint32 indexA,
216 if( indexA >= ptrA->sizeE )
219 "indexA = %i is out of range [0,%i]",
220 indexA,
[all...] |
| Cluster3D.h | 103 uint32 indexA,
109 uint32 indexA,
115 uint32 indexA,
|
| Cluster2D.c | 243 uint32 indexA, int32 bbpA )
246 if( indexA >= ptrA->sizeE )
249 "indexA = %i is out of range [0,%i]",
250 indexA,
258 int32 xL = ptrA->vecArrE[ indexA ].xE;
276 uint32 indexA,
280 if( indexA >= ptrA->sizeE )
283 "indexA = %i is out of range [0,%i]",
284 indexA,
291 int32 yL = ptrA->vecArrE[ indexA ].yE
[all...] |
| Cluster2D.h | 111 uint32 indexA, int32 bbpA );
116 uint32 indexA,
|
| /frameworks/av/media/libstagefright/codecs/avc/common/src/ |
| deblock.cpp | 297 int indexA, indexB;
319 /* for edge = 1~3, MbP, indexA and indexB remain the same, and thus there is no need to re-calculate them for each edge */
334 indexA = QP + video->FilterOffsetA;
336 indexA = qp_clip_tab[indexA]; // IClip(0, MAX_QP, QP+video->FilterOffsetA)
339 Alpha = ALPHA_TABLE[indexA];
341 clipTable = (int *) CLIP_TAB[indexA];
351 indexA = QPC + video->FilterOffsetA;
353 indexA = qp_clip_tab[indexA]; // IClip(0, MAX_QP, QP+video->FilterOffsetA
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| TreeScope.cpp | 446 size_t indexA = treeScopesA.size();
449 for (; indexA > 0 && indexB > 0 && treeScopesA[indexA - 1] == treeScopesB[indexB - 1]; --indexA, --indexB) { }
451 return treeScopesA[indexA] == treeScopesB[indexB] ? treeScopesA[indexA] : 0;
|
| /external/neven/Embedded/common/src/b_APIEm/ |
| BFFaceFinder.c | 310 uint32 indexA,
330 if( indexA >= ptrA->availableFacesE )
336 xL = ptrA->faceDataBufferE[ indexA * 4 + 0 ]; /* 16.16 */
337 yL = ptrA->faceDataBufferE[ indexA * 4 + 1 ]; /* 16.16 */
338 scaleL = ptrA->faceDataBufferE[ indexA * 4 + 2 ]; /* 12.20 */
339 actL = ptrA->faceDataBufferE[ indexA * 4 + 3 ]; /* 4.28 */
368 uint32 indexA,
371 int32 confL = bpi_BFFaceFinder_getFace( cpA, ptrA, indexA, &dcrPtrA->offsE, &dcrPtrA->mainClusterE );
481 uint32 indexA,
494 bpi_BFFaceFinder_getFaceDCR( cpA, ( const struct bpi_BFFaceFinder* )ptrA, indexA, dcrPtrA )
[all...] |
| BFFaceFinder.h | 192 uint32 indexA,
205 uint32 indexA,
253 uint32 indexA,
|
| FaceFinderRef.h | 119 uint32 indexA,
|
| FaceFinder.h | 81 uint32 indexA,
|
| FaceFinderRef.c | 266 uint32 indexA,
275 ptrA->faceFinderPtrE->vpGetDcrE( cpA, ptrA->faceFinderPtrE, indexA, dcrPtrA );
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| HeapSnapshot.js | [all...] |
| /external/neven/FaceRecEm/common/src/b_FDSDK/ |
| DCR.c | 260 u32 indexA,
273 if( indexA >= hdcrA->dcrE.sdkClusterE.clusterE.sizeE )
280 nodePtrA->id = hdcrA->dcrE.sdkClusterE.idArrE.arrPtrE[ indexA ];
281 nodePtrA->x = ( ( s16p16 )hdcrA->dcrE.sdkClusterE.clusterE.vecArrE[ indexA ].xE ) << ( 16 - hdcrA->dcrE.sdkClusterE.clusterE.bbpE );
282 nodePtrA->y = ( ( s16p16 )hdcrA->dcrE.sdkClusterE.clusterE.vecArrE[ indexA ].yE ) << ( 16 - hdcrA->dcrE.sdkClusterE.clusterE.bbpE );
|
| DCR.h | 130 u32 indexA,
|
| /frameworks/base/core/jni/android/graphics/ |
| Canvas.cpp | 698 AutoJavaShortArray indexA(env, jindices, indexIndex + indexCount);
737 indices = (const uint16_t*)(indexA.ptr() + indexIndex);
[all...] |
| /cts/suite/cts/deviceTests/browserbench/assets/octane/ |
| box2d.js | 73 function(){};W.Distance=function(b,e,f){++W.b2_gjkCalls;var m=f.proxyA,r=f.proxyB,s=f.transformA,v=f.transformB,t=W.s_simplex;t.ReadCache(e,m,s,r,v);var x=t.m_vertices,C=W.s_saveA,J=W.s_saveB,T=0;t.GetClosestPoint().LengthSquared();for(var P=0,X,$=0;$<20;){T=t.m_count;for(P=0;P<T;P++){C[P]=x[P].indexA;J[P]=x[P].indexB}switch(t.m_count){case 1:break;case 2:t.Solve2();break;case 3:t.Solve3();break;default:y.b2Assert(false)}if(t.m_count==3)break;X=t.GetClosestPoint();X.LengthSquared();P=t.GetSearchDirection();
74 if(P.LengthSquared()<Number.MIN_VALUE*Number.MIN_VALUE)break;X=x[t.m_count];X.indexA=m.GetSupport(w.MulTMV(s.R,P.GetNegative()));X.wA=w.MulX(s,m.GetVertex(X.indexA));X.indexB=r.GetSupport(w.MulTMV(v.R,P));X.wB=w.MulX(v,r.GetVertex(X.indexB));X.w=w.SubtractVV(X.wB,X.wA);++$;++W.b2_gjkIters;var ba=false;for(P=0;P<T;P++)if(X.indexA==C[P]&&X.indexB==J[P]){ba=true;break}if(ba)break;++t.m_count}W.b2_gjkMaxIters=w.Max(W.b2_gjkMaxIters,$);t.GetWitnessPoints(b.pointA,b.pointB);b.distance=w.SubtractVV(b.pointA,
[all...] |
| /frameworks/base/packages/Keyguard/src/com/android/keyguard/ |
| PagedView.java | [all...] |
