/external/libavc/common/ |
ih264_deblk_tables.h | 49 * input : indexA [0-51] & indexB [0-51] 54 * alpha and beta from indexA and indexB 64 * input : indexA [0-51] and bS [1,3] 68 * Value of variable t'C0 as a function of indexA and bS
|
ih264_deblk_tables.c | 61 * input : indexA [0-51] & indexB [0-51] 66 * alpha and beta from indexA and indexB 71 /* indexA :: 0-51 inclusive */ 96 * input : indexA [0-51] and bS [1,3] 100 * Value of variable t'C0 as a function of indexA and bS 105 /* indexA :: 0-51 inclusive */
|
/external/chromium-trace/catapult/tracing/tracing/ui/base/ |
chart_base_2d_brushable_x.html | 33 computeBrushRangeFromIndices: function(indexA, indexB) { 34 indexA = tr.b.clamp(indexA, 0, this.data_.length - 1); 36 var leftIndex = Math.min(indexA, indexB); 37 var rightIndex = Math.max(indexA, indexB);
|
/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/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,
|