Home
last modified time | relevance | path

Searched refs:oldtable (Results 1 – 3 of 3) sorted by relevance

/third_party/libxml2/
Dhash.c240 struct _xmlHashEntry *oldtable; in xmlHashGrow() local
253 oldtable = table->table; in xmlHashGrow()
254 if (oldtable == NULL) in xmlHashGrow()
259 table->table = oldtable; in xmlHashGrow()
272 if (oldtable[i].valid == 0) in xmlHashGrow()
274 key = xmlHashComputeKey(table, oldtable[i].name, oldtable[i].name2, in xmlHashGrow()
275 oldtable[i].name3); in xmlHashGrow()
276 memcpy(&(table->table[key]), &(oldtable[i]), sizeof(xmlHashEntry)); in xmlHashGrow()
281 iter = oldtable[i].next; in xmlHashGrow()
308 xmlFree(oldtable); in xmlHashGrow()
/third_party/python/Objects/
Dsetobject.c234 setentry *oldtable, *newtable, *entry; in set_table_resize() local
250 oldtable = so->table; in set_table_resize()
251 assert(oldtable != NULL); in set_table_resize()
252 is_oldtable_malloced = oldtable != so->smalltable; in set_table_resize()
257 if (newtable == oldtable) { in set_table_resize()
269 memcpy(small_copy, oldtable, sizeof(small_copy)); in set_table_resize()
270 oldtable = small_copy; in set_table_resize()
282 assert(newtable != oldtable); in set_table_resize()
291 for (entry = oldtable; entry <= oldtable + oldmask; entry++) { in set_table_resize()
298 for (entry = oldtable; entry <= oldtable + oldmask; entry++) { in set_table_resize()
[all …]
/third_party/python/Modules/
D_pickle.c838 PyMemoEntry *oldtable = NULL; in _PyMemoTable_ResizeTable() local
858 oldtable = self->mt_table; in _PyMemoTable_ResizeTable()
861 self->mt_table = oldtable; in _PyMemoTable_ResizeTable()
871 for (oldentry = oldtable; to_process > 0; oldentry++) { in _PyMemoTable_ResizeTable()
884 PyMem_Free(oldtable); in _PyMemoTable_ResizeTable()