| /external/chromium_org/third_party/sqlite/src/ext/fts3/ |
| H A D | fts3.c | 2492 char *aLeft, *aRight; local
2506 aLeft = pOut;
2515 aLeft = pList;
2521 mt, nDist, 0, pOut, &nOut, aLeft, nLeft, aRight, nRight, &nDoc
2523 sqlite3_free(aLeft);
2553 char *aLeft, /* Doclist for LHS (incl. positions) */
2556 char *aRight, /* As aLeft */
2571 aOut, pnOut, aLeft, nLeft, aRight, nRight, 0
2869 char *aLeft; local
2881 && 0==(rc = fts3EvalExpr(p, pExpr->pLeft, &aLeft,
2549 fts3NearMerge( int mergetype, int nNear, int nTokenLeft, char *aLeft, int nLeft, int nTokenRight, char *aRight, int nRight, char **paOut, int *pnOut ) argument
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/swrast/ |
| H A D | s_tritemp.h | 513 GLint aLeft = 0, fdaOuter = 0, fdaInner; local
657 aLeft = (GLint)(ChanToFixed(vLower->color[ACOMP])
671 aLeft = ChanToFixed(v2->color[ACOMP]);
786 span.alpha = aLeft;
854 aLeft += fdaOuter;
886 aLeft += fdaInner;
|
| /external/mesa3d/src/mesa/swrast/ |
| H A D | s_tritemp.h | 513 GLint aLeft = 0, fdaOuter = 0, fdaInner; local
657 aLeft = (GLint)(ChanToFixed(vLower->color[ACOMP])
671 aLeft = ChanToFixed(v2->color[ACOMP]);
786 span.alpha = aLeft;
854 aLeft += fdaOuter;
886 aLeft += fdaInner;
|
| /external/chromium_org/third_party/sqlite/src/ext/rtree/ |
| H A D | rtree.c | 1875 int *aLeft = aIdx; local
1878 SortByDistance(aLeft, nLeft, aDistance, aSpare);
1881 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
1882 aLeft = aSpare;
1889 aIdx[iLeft+iRight] = aLeft[iLeft];
1892 float fLeft = aDistance[aLeft[iLeft]];
1895 aIdx[iLeft+iRight] = aLeft[iLeft];
1944 int *aLeft = aIdx; local
1947 SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);
1950 memcpy(aSpare, aLeft, sizeo
[all...] |
| /external/chromium_org/third_party/sqlite/src/src/ |
| H A D | wal.c | 1333 ** aLeft[] and aRight[] are arrays of indices. The sort key is
1334 ** aContent[aLeft[]] and aContent[aRight[]]. Upon entry, the following
1337 ** aContent[aLeft[J]] < aContent[aLeft[K]]
1342 ** either aLeft[] or the old aRight[] and such that the second condition
1345 ** The aContent[aLeft[X]] values will be unique for all X. And the
1349 ** aLeft[X]!=aRight[Y] && aContent[aLeft[X]] == aContent[aRight[Y]]
1351 ** When that happens, omit the aLeft[X] and use the aRight[Y] index.
1355 ht_slot *aLeft, /* I
1353 walMerge( const u32 *aContent, ht_slot *aLeft, int nLeft, ht_slot **paRight, int *pnRight, ht_slot *aTmp ) argument
[all...] |
| /external/chromium_org/third_party/sqlite/amalgamation/ |
| H A D | sqlite3.c | 44633 walMerge( const u32 *aContent, ht_slot *aLeft, int nLeft, ht_slot **paRight, int *pnRight, ht_slot *aTmp ) argument
115553 char *aLeft, *aRight; local
115610 fts3NearMerge( int mergetype, int nNear, int nTokenLeft, char *aLeft, int nLeft, int nTokenRight, char *aRight, int nRight, char **paOut, int *pnOut ) argument
115930 char *aLeft; local
126143 int *aLeft = aIdx; local
126212 int *aLeft = aIdx; local
[all...] |
| /external/sqlite/dist/orig/ |
| H A D | sqlite3.c | 48870 walMerge( const u32 *aContent, ht_slot *aLeft, int nLeft, ht_slot **paRight, int *pnRight, ht_slot *aTmp ) argument
129327 fts3DoclistPhraseMerge( int bDescDoclist, int nDist, char *aLeft, int nLeft, char *aRight, int *pnRight ) argument
146628 int *aLeft = aIdx; local
146697 int *aLeft = aIdx; local
[all...] |
| /external/sqlite/dist/ |
| H A D | sqlite3.c | 48890 walMerge( const u32 *aContent, ht_slot *aLeft, int nLeft, ht_slot **paRight, int *pnRight, ht_slot *aTmp ) argument
129347 fts3DoclistPhraseMerge( int bDescDoclist, int nDist, char *aLeft, int nLeft, char *aRight, int *pnRight ) argument
146660 int *aLeft = aIdx; local
146729 int *aLeft = aIdx; local
[all...] |