Home | History | Annotate | Download | only in dist

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;
143750 Fts3HashElem *elem; /* For looping over all elements of the table */
143753 elem = pH->first;
143758 while( elem ){
143759 Fts3HashElem *next_elem = elem->next;
143760 elem->pKey ){
143761 fts3HashFree(elem->pKey);
143763 fts3HashFree(elem);
143764 elem = next_elem;
143873 Fts3HashElem *elem, *next_elem; /* For looping over existing elements */
143883 for(elem=pH->first, pH->first=0; elem; elem = next_elem){
143884 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
143885 next_elem = elem->next;
143886 fts3HashInsertElement(pH, &new_ht[h], elem);
143901 Fts3HashElem *elem; /* Used to loop thru the element list */
143907 elem = pEntry->chain;
143910 while( count-- && elem ){
143911 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
143912 return elem;
143914 elem = elem->next;
143924 Fts3Hash *pH, /* The pH containing "elem" */
143925 Fts3HashElem* elem, /* The element to be removed from the pH */
143929 if( elem->prev ){
143930 elem->prev->next = elem->next;
143932 pH->first = elem->next;
143934 if( elem->next ){
143935 elem->next->prev = elem->prev;
143938 if( pEntry->chain==elem ){
143939 pEntry->chain = elem->next;
143945 if( pH->copyKey && elem->pKey ){
143946 fts3HashFree(elem->pKey);
143948 fts3HashFree( elem );
144008 Fts3HashElem *elem; /* Used to loop thru the element list */
144018 elem = fts3FindElementByHash(pH,pKey,nKey,h);
144019 if( elem ){
144020 void *old_data = elem->data;
144022 fts3RemoveElementByHash(pH,elem,h);
144024 elem->data = data;