Lines Matching defs:Fts3HashElem
116342 typedef struct Fts3HashElem Fts3HashElem;
116356 Fts3HashElem *first; /* The first element of the array */
116360 Fts3HashElem *chain; /* Pointer to first entry with this hash */
116370 struct Fts3HashElem {
116371 Fts3HashElem *next, *prev; /* Next and previous elements in the table */
116398 SQLITE_PRIVATE Fts3HashElem *sqlite3Fts3HashFindElem(const Fts3Hash *, const void *, int);
116414 ** Fts3HashElem *p;
123375 Fts3HashElem *elem; /* For looping over all elements of the table */
123384 Fts3HashElem *next_elem = elem->next;
123469 Fts3HashElem *pNew /* The element to be inserted */
123471 Fts3HashElem *pHead; /* First element already in pEntry */
123498 Fts3HashElem *elem, *next_elem; /* For looping over existing elements */
123520 static Fts3HashElem *fts3FindElementByHash(
123526 Fts3HashElem *elem; /* Used to loop thru the element list */
123550 Fts3HashElem* elem, /* The element to be removed from the pH */
123582 SQLITE_PRIVATE Fts3HashElem *sqlite3Fts3HashFindElem(
123604 Fts3HashElem *pElem; /* The element that matches key (if any) */
123633 Fts3HashElem *elem; /* Used to loop thru the element list */
123634 Fts3HashElem *new_elem; /* New element added to the pH */
123661 new_elem = (Fts3HashElem*)fts3HashMalloc( sizeof(Fts3HashElem) );
125182 Fts3HashElem **ppNextElem;
125716 p->nPendingData -= (pList->nData + nToken + sizeof(Fts3HashElem));
125729 p->nPendingData += (pList->nData + nToken + sizeof(Fts3HashElem));
125850 Fts3HashElem *pElem;
126267 Fts3HashElem *pElem = *(pReader->ppNextElem);
126575 char *z1 = fts3HashKey(*(Fts3HashElem **)lhs);
126576 char *z2 = fts3HashKey(*(Fts3HashElem **)rhs);
126577 int n1 = fts3HashKeysize(*(Fts3HashElem **)lhs);
126578 int n2 = fts3HashKeysize(*(Fts3HashElem **)rhs);
126616 Fts3HashElem *pE; /* Iterator variable */
126617 Fts3HashElem **aElem = 0; /* Array of term hash entries to scan */
126631 Fts3HashElem **aElem2;
126633 aElem2 = (Fts3HashElem **)sqlite3_realloc(
126634 aElem, nAlloc*sizeof(Fts3HashElem *)
126648 /* If more than one term matches the prefix, sort the Fts3HashElem
126653 qsort(aElem, nElem, sizeof(Fts3HashElem *), fts3CompareElemByTerm);
126661 ** below, the "Fts3HashElem *pE" must be declared so that it is valid
126672 int nByte = sizeof(Fts3SegReader) + (nElem+1)*sizeof(Fts3HashElem *);
126679 pReader->ppNextElem = (Fts3HashElem **)&pReader[1];
126680 memcpy(pReader->ppNextElem, aElem, nElem*sizeof(Fts3HashElem *));
