Lines Matching defs:Fts3HashElem
126475 typedef struct Fts3HashElem Fts3HashElem;
126489 Fts3HashElem *first; /* The first element of the array */
126493 Fts3HashElem *chain; /* Pointer to first entry with this hash */
126503 struct Fts3HashElem {
126504 Fts3HashElem *next, *prev; /* Next and previous elements in the table */
126531 SQLITE_PRIVATE Fts3HashElem *sqlite3Fts3HashFindElem(const Fts3Hash *, const void *, int);
126547 ** Fts3HashElem *p;
134545 Fts3HashElem *elem; /* For looping over all elements of the table */
134554 Fts3HashElem *next_elem = elem->next;
134639 Fts3HashElem *pNew /* The element to be inserted */
134641 Fts3HashElem *pHead; /* First element already in pEntry */
134668 Fts3HashElem *elem, *next_elem; /* For looping over existing elements */
134690 static Fts3HashElem *fts3FindElementByHash(
134696 Fts3HashElem *elem; /* Used to loop thru the element list */
134720 Fts3HashElem* elem, /* The element to be removed from the pH */
134752 SQLITE_PRIVATE Fts3HashElem *sqlite3Fts3HashFindElem(
134774 Fts3HashElem *pElem; /* The element that matches key (if any) */
134803 Fts3HashElem *elem; /* Used to loop thru the element list */
134804 Fts3HashElem *new_elem; /* New element added to the pH */
134831 new_elem = (Fts3HashElem*)fts3HashMalloc( sizeof(Fts3HashElem) );
136851 Fts3HashElem **ppNextElem;
137457 p->nPendingData -= (pList->nData + nToken + sizeof(Fts3HashElem));
137470 p->nPendingData += (pList->nData + nToken + sizeof(Fts3HashElem));
137591 Fts3HashElem *pElem;
138018 Fts3HashElem *pElem = *(pReader->ppNextElem);
138328 char *z1 = fts3HashKey(*(Fts3HashElem **)lhs);
138329 char *z2 = fts3HashKey(*(Fts3HashElem **)rhs);
138330 int n1 = fts3HashKeysize(*(Fts3HashElem **)lhs);
138331 int n2 = fts3HashKeysize(*(Fts3HashElem **)rhs);
138369 Fts3HashElem *pE; /* Iterator variable */
138370 Fts3HashElem **aElem = 0; /* Array of term hash entries to scan */
138384 Fts3HashElem **aElem2;
138386 aElem2 = (Fts3HashElem **)sqlite3_realloc(
138387 aElem, nAlloc*sizeof(Fts3HashElem *)
138401 /* If more than one term matches the prefix, sort the Fts3HashElem
138406 qsort(aElem, nElem, sizeof(Fts3HashElem *), fts3CompareElemByTerm);
138414 ** below, the "Fts3HashElem *pE" must be declared so that it is valid
138425 int nByte = sizeof(Fts3SegReader) + (nElem+1)*sizeof(Fts3HashElem *);
138432 pReader->ppNextElem = (Fts3HashElem **)&pReader[1];
138433 memcpy(pReader->ppNextElem, aElem, nElem*sizeof(Fts3HashElem *));
