Lines Matching refs:pEntry
142 RTL_HASHENTRY *pEntry = (*table)->Table[key]; in rtl_hashtable_add() local
145 while (pEntry) in rtl_hashtable_add()
147 if (value->HashCode == pEntry->Entry->HashCode) in rtl_hashtable_add()
148 return pEntry->Entry; in rtl_hashtable_add()
150 if (!pEntry->Next) in rtl_hashtable_add()
153 pEntry = pEntry->Next; in rtl_hashtable_add()
159 pEntry->Next = newEntry; in rtl_hashtable_add()
177 RTL_HASHENTRY *pEntry = (*table)->Table[i]; in rtl_hashtable_grow() local
179 rtl_hashtable_add(&pNewTable, pEntry->Entry); in rtl_hashtable_grow()
181 while (pEntry->Next) in rtl_hashtable_grow()
183 rtl_hashtable_add(&pNewTable, pEntry->Next->Entry); in rtl_hashtable_grow()
184 pNext = pEntry->Next; in rtl_hashtable_grow()
185 rtl_freeMemory(pEntry); in rtl_hashtable_grow()
186 pEntry = pNext; in rtl_hashtable_grow()
189 rtl_freeMemory(pEntry); in rtl_hashtable_grow()
208 RTL_HASHENTRY *pEntry = table->Table[key]; in rtl_hashtable_find() local
210 while (pEntry && hashCode != pEntry->Entry->HashCode) in rtl_hashtable_find()
211 pEntry = pEntry->Next; in rtl_hashtable_find()
213 if (pEntry) in rtl_hashtable_find()
214 *pValue = pEntry->Entry; in rtl_hashtable_find()