Lines Matching refs:elem
11287 TriggerStep *pLast; /* Last element in link-list. Valid for 1st elem only */
22268 HashElem *elem; /* For looping over all elements of the table */
22271 elem = pH->first;
22276 while( elem ){
22277 HashElem *next_elem = elem->next;
22278 sqlite3_free(elem);
22279 elem = next_elem;
22337 HashElem *elem, *next_elem; /* For looping over existing elements */
22359 for(elem=pH->first, pH->first=0; elem; elem = next_elem){
22360 unsigned int h = strHash(elem->pKey, elem->nKey) % new_size;
22361 next_elem = elem->next;
22362 insertElement(pH, &new_ht[h], elem);
22377 HashElem *elem; /* Used to loop thru the element list */
22382 elem = pEntry->chain;
22385 elem = pH->first;
22388 while( count-- && ALWAYS(elem) ){
22389 if( elem->nKey==nKey && sqlite3StrNICmp(elem->pKey,pKey,nKey)==0 ){
22390 return elem;
22392 elem = elem->next;
22401 Hash *pH, /* The pH containing "elem" */
22402 HashElem* elem, /* The element to be removed from the pH */
22406 if( elem->prev ){
22407 elem->prev->next = elem->next;
22409 pH->first = elem->next;
22411 if( elem->next ){
22412 elem->next->prev = elem->prev;
22416 if( pEntry->chain==elem ){
22417 pEntry->chain = elem->next;
22422 sqlite3_free( elem );
22436 HashElem *elem; /* The element that matches key */
22447 elem = findElementGivenHash(pH, pKey, nKey, h);
22448 return elem ? elem->data : 0;
22467 HashElem *elem; /* Used to loop thru the element list */
22478 elem = findElementGivenHash(pH,pKey,nKey,h);
22479 if( elem ){
22480 void *old_data = elem->data;
22482 removeElementGivenHash(pH,elem,h);
22484 elem->data = data;
22485 elem->pKey = pKey;
22486 assert(nKey==elem->nKey);
123375 Fts3HashElem *elem; /* For looping over all elements of the table */
123378 elem = pH->first;
123383 while( elem ){
123384 Fts3HashElem *next_elem = elem->next;
123385 if( pH->copyKey && elem->pKey ){
123386 fts3HashFree(elem->pKey);
123388 fts3HashFree(elem);
123389 elem = next_elem;
123498 Fts3HashElem *elem, *next_elem; /* For looping over existing elements */
123508 for(elem=pH->first, pH->first=0; elem; elem = next_elem){
123509 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
123510 next_elem = elem->next;
123511 fts3HashInsertElement(pH, &new_ht[h], elem);
123526 Fts3HashElem *elem; /* Used to loop thru the element list */
123532 elem = pEntry->chain;
123535 while( count-- && elem ){
123536 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
123537 return elem;
123539 elem = elem->next;
123549 Fts3Hash *pH, /* The pH containing "elem" */
123550 Fts3HashElem* elem, /* The element to be removed from the pH */
123554 if( elem->prev ){
123555 elem->prev->next = elem->next;
123557 pH->first = elem->next;
123559 if( elem->next ){
123560 elem->next->prev = elem->prev;
123563 if( pEntry->chain==elem ){
123564 pEntry->chain = elem->next;
123570 if( pH->copyKey && elem->pKey ){
123571 fts3HashFree(elem->pKey);
123573 fts3HashFree( elem );
123633 Fts3HashElem *elem; /* Used to loop thru the element list */
123643 elem = fts3FindElementByHash(pH,pKey,nKey,h);
123644 if( elem ){
123645 void *old_data = elem->data;
123647 fts3RemoveElementByHash(pH,elem,h);
123649 elem->data = data;
