Searched refs:fts2HashElem (Results 1 – 3 of 3) sorted by relevance
86 fts2HashElem *next_elem = elem->next; in sqlite3Fts2HashClear()171 fts2HashElem *pNew /* The element to be inserted */ in insertElement()173 fts2HashElem *pHead; /* First element already in pEntry */ in insertElement()198 fts2HashElem *elem, *next_elem; /* For looping over existing elements */ in rehash()219 static fts2HashElem *findElementGivenHash( in findElementGivenHash()225 fts2HashElem *elem; /* Used to loop thru the element list */ in findElementGivenHash()249 fts2HashElem* elem, /* The element to be removed from the pH */ in removeElementGivenHash()287 fts2HashElem *elem; /* The element that matches key */ in sqlite3Fts2HashFind()322 fts2HashElem *elem; /* Used to loop thru the element list */ in sqlite3Fts2HashInsert()323 fts2HashElem *new_elem; /* New element added to the pH */ in sqlite3Fts2HashInsert()[all …]
22 typedef struct fts2HashElem fts2HashElem; typedef36 fts2HashElem *first; /* The first element of the array */40 fts2HashElem *chain; /* Pointer to first entry with this hash */50 struct fts2HashElem { struct51 fts2HashElem *next, *prev; /* Next and previous elements in the table */ argument
3925 v->nPendingData += sizeof(struct fts2HashElem)+sizeof(*p)+nTokenBytes; in buildTerms()5777 fts2HashElem *e; in writeZeroSegment()5827 fts2HashElem *e; in clearPendingTerms()6347 fts2HashElem *e; in generateTermsResult()