HomeSort by relevance Sort by last modified time
    Searched refs:Fts3HashElem (Results 1 - 3 of 3) sorted by null

  /external/chromium_org/third_party/sqlite/src/ext/fts3/
fts3_hash.h 22 typedef struct Fts3HashElem Fts3HashElem;
36 Fts3HashElem *first; /* The first element of the array */
40 Fts3HashElem *chain; /* Pointer to first entry with this hash */
50 struct Fts3HashElem {
51 Fts3HashElem *next, *prev; /* Next and previous elements in the table */
78 Fts3HashElem *sqlite3Fts3HashFindElem(const Fts3Hash *, const void *, int);
94 ** Fts3HashElem *p;
fts3_hash.c 75 Fts3HashElem *elem; /* For looping over all elements of the table */
84 Fts3HashElem *next_elem = elem->next;
169 Fts3HashElem *pNew /* The element to be inserted */
171 Fts3HashElem *pHead; /* First element already in pEntry */
198 Fts3HashElem *elem, *next_elem; /* For looping over existing elements */
220 static Fts3HashElem *fts3FindElementByHash(
226 Fts3HashElem *elem; /* Used to loop thru the element list */
250 Fts3HashElem* elem, /* The element to be removed from the pH */
282 Fts3HashElem *sqlite3Fts3HashFindElem(
304 Fts3HashElem *pElem; /* The element that matches key (if any) *
    [all...]
fts3_write.c 96 Fts3HashElem **ppNextElem;
569 p->nPendingData -= (pList->nData + nToken + sizeof(Fts3HashElem));
582 p->nPendingData += (pList->nData + nToken + sizeof(Fts3HashElem));
615 Fts3HashElem *pElem;
927 Fts3HashElem *pElem = *(pReader->ppNextElem);
    [all...]

Completed in 59 milliseconds