Lines Matching defs:elem
13431 TriggerStep *pLast; /* Last element in link-list. Valid for 1st elem only */
26013 HashElem *elem; /* For looping over all elements of the table */
26016 elem = pH->first;
26021 while( elem ){
26022 HashElem *next_elem = elem->next;
26023 sqlite3_free(elem);
26024 elem = next_elem;
26081 HashElem *elem, *next_elem; /* For looping over existing elements */
26107 for(elem=pH->first, pH->first=0; elem; elem = next_elem){
26108 unsigned int h = strHash(elem->pKey) % new_size;
26109 next_elem = elem->next;
26110 insertElement(pH, &new_ht[h], elem);
26124 HashElem *elem; /* Used to loop thru the element list */
26132 elem = pEntry->chain;
26136 elem = pH->first;
26141 assert( elem!=0 );
26142 if( sqlite3StrICmp(elem->pKey,pKey)==0 ){
26143 return elem;
26145 elem = elem->next;
26154 Hash *pH, /* The pH containing "elem" */
26155 HashElem* elem, /* The element to be removed from the pH */
26159 if( elem->prev ){
26160 elem->prev->next = elem->next;
26162 pH->first = elem->next;
26164 if( elem->next ){
26165 elem->next->prev = elem->prev;
26169 if( pEntry->chain==elem ){
26170 pEntry->chain = elem->next;
26175 sqlite3_free( elem );
26189 HashElem *elem; /* The element that matches key */
26194 elem = findElementWithHash(pH, pKey, &h);
26195 return elem ? elem->data : 0;
26214 HashElem *elem; /* Used to loop thru the element list */
26219 elem = findElementWithHash(pH,pKey,&h);
26220 if( elem ){
26221 void *old_data = elem->data;
26223 removeElementGivenHash(pH,elem,h);
26225 elem->data = data;
26226 elem->pKey = pKey;
143720 Fts3HashElem *elem; /* For looping over all elements of the table */
143723 elem = pH->first;
143728 while( elem ){
143729 Fts3HashElem *next_elem = elem->next;
143730 if( pH->copyKey && elem->pKey ){
143731 fts3HashFree(elem->pKey);
143733 fts3HashFree(elem);
143734 elem = next_elem;
143843 Fts3HashElem *elem, *next_elem; /* For looping over existing elements */
143853 for(elem=pH->first, pH->first=0; elem; elem = next_elem){
143854 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
143855 next_elem = elem->next;
143856 fts3HashInsertElement(pH, &new_ht[h], elem);
143871 Fts3HashElem *elem; /* Used to loop thru the element list */
143877 elem = pEntry->chain;
143880 while( count-- && elem ){
143881 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
143882 return elem;
143884 elem = elem->next;
143894 Fts3Hash *pH, /* The pH containing "elem" */
143895 Fts3HashElem* elem, /* The element to be removed from the pH */
143899 if( elem->prev ){
143900 elem->prev->next = elem->next;
143902 pH->first = elem->next;
143904 if( elem->next ){
143905 elem->next->prev = elem->prev;
143908 if( pEntry->chain==elem ){
143909 pEntry->chain = elem->next;
143915 if( pH->copyKey && elem->pKey ){
143916 fts3HashFree(elem->pKey);
143918 fts3HashFree( elem );
143978 Fts3HashElem *elem; /* Used to loop thru the element list */
143988 elem = fts3FindElementByHash(pH,pKey,nKey,h);
143989 if( elem ){
143990 void *old_data = elem->data;
143992 fts3RemoveElementByHash(pH,elem,h);
143994 elem->data = data;
