Lines Matching refs:elem
9827 TriggerStep *pLast; /* Last element in link-list. Valid for 1st elem only */
19546 HashElem *elem; /* For looping over all elements of the table */
19549 elem = pH->first;
19554 while( elem ){
19555 HashElem *next_elem = elem->next;
19556 sqlite3_free(elem);
19557 elem = next_elem;
19615 HashElem *elem, *next_elem; /* For looping over existing elements */
19637 for(elem=pH->first, pH->first=0; elem; elem = next_elem){
19638 unsigned int h = strHash(elem->pKey, elem->nKey) % new_size;
19639 next_elem = elem->next;
19640 insertElement(pH, &new_ht[h], elem);
19655 HashElem *elem; /* Used to loop thru the element list */
19660 elem = pEntry->chain;
19663 elem = pH->first;
19666 while( count-- && ALWAYS(elem) ){
19667 if( elem->nKey==nKey && sqlite3StrNICmp(elem->pKey,pKey,nKey)==0 ){
19668 return elem;
19670 elem = elem->next;
19679 Hash *pH, /* The pH containing "elem" */
19680 HashElem* elem, /* The element to be removed from the pH */
19684 if( elem->prev ){
19685 elem->prev->next = elem->next;
19687 pH->first = elem->next;
19689 if( elem->next ){
19690 elem->next->prev = elem->prev;
19694 if( pEntry->chain==elem ){
19695 pEntry->chain = elem->next;
19700 sqlite3_free( elem );
19714 HashElem *elem; /* The element that matches key */
19725 elem = findElementGivenHash(pH, pKey, nKey, h);
19726 return elem ? elem->data : 0;
19745 HashElem *elem; /* Used to loop thru the element list */
19756 elem = findElementGivenHash(pH,pKey,nKey,h);
19757 if( elem ){
19758 void *old_data = elem->data;
19760 removeElementGivenHash(pH,elem,h);
19762 elem->data = data;
19763 elem->pKey = pKey;
19764 assert(nKey==elem->nKey);
102199 Fts3HashElem *elem; /* For looping over all elements of the table */
102202 elem = pH->first;
102207 while( elem ){
102208 Fts3HashElem *next_elem = elem->next;
102209 if( pH->copyKey && elem->pKey ){
102210 fts3HashFree(elem->pKey);
102212 fts3HashFree(elem);
102213 elem = next_elem;
102322 Fts3HashElem *elem, *next_elem; /* For looping over existing elements */
102332 for(elem=pH->first, pH->first=0; elem; elem = next_elem){
102333 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
102334 next_elem = elem->next;
102335 fts3HashInsertElement(pH, &new_ht[h], elem);
102350 Fts3HashElem *elem; /* Used to loop thru the element list */
102356 elem = pEntry->chain;
102359 while( count-- && elem ){
102360 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
102361 return elem;
102363 elem = elem->next;
102373 Fts3Hash *pH, /* The pH containing "elem" */
102374 Fts3HashElem* elem, /* The element to be removed from the pH */
102378 if( elem->prev ){
102379 elem->prev->next = elem->next;
102381 pH->first = elem->next;
102383 if( elem->next ){
102384 elem->next->prev = elem->prev;
102387 if( pEntry->chain==elem ){
102388 pEntry->chain = elem->next;
102394 if( pH->copyKey && elem->pKey ){
102395 fts3HashFree(elem->pKey);
102397 fts3HashFree( elem );
102457 Fts3HashElem *elem; /* Used to loop thru the element list */
102467 elem = fts3FindElementByHash(pH,pKey,nKey,h);
102468 if( elem ){
102469 void *old_data = elem->data;
102471 fts3RemoveElementByHash(pH,elem,h);
102473 elem->data = data;
