Searched refs:oldtable (Results 1 – 3 of 3) sorted by relevance
/external/libxml2/ |
D | hash.c | 233 struct _xmlHashEntry *oldtable; in xmlHashGrow() local 246 oldtable = table->table; in xmlHashGrow() 247 if (oldtable == NULL) in xmlHashGrow() 252 table->table = oldtable; in xmlHashGrow() 265 if (oldtable[i].valid == 0) in xmlHashGrow() 267 key = xmlHashComputeKey(table, oldtable[i].name, oldtable[i].name2, in xmlHashGrow() 268 oldtable[i].name3); in xmlHashGrow() 269 memcpy(&(table->table[key]), &(oldtable[i]), sizeof(xmlHashEntry)); in xmlHashGrow() 274 iter = oldtable[i].next; in xmlHashGrow() 301 xmlFree(oldtable); in xmlHashGrow()
|
/external/python/cpython2/Objects/ |
D | setobject.c | 274 setentry *oldtable, *newtable, *entry; in set_table_resize() local 292 oldtable = so->table; in set_table_resize() 293 assert(oldtable != NULL); in set_table_resize() 294 is_oldtable_malloced = oldtable != so->smalltable; in set_table_resize() 299 if (newtable == oldtable) { in set_table_resize() 311 memcpy(small_copy, oldtable, sizeof(small_copy)); in set_table_resize() 312 oldtable = small_copy; in set_table_resize() 324 assert(newtable != oldtable); in set_table_resize() 334 for (entry = oldtable; i > 0; entry++) { in set_table_resize() 351 PyMem_DEL(oldtable); in set_table_resize()
|
D | dictobject.c | 601 PyDictEntry *oldtable, *newtable, *ep; in dictresize() local 619 oldtable = mp->ma_table; in dictresize() 620 assert(oldtable != NULL); in dictresize() 621 is_oldtable_malloced = oldtable != mp->ma_smalltable; in dictresize() 626 if (newtable == oldtable) { in dictresize() 638 memcpy(small_copy, oldtable, sizeof(small_copy)); in dictresize() 639 oldtable = small_copy; in dictresize() 651 assert(newtable != oldtable); in dictresize() 661 for (ep = oldtable; i > 0; ep++) { in dictresize() 676 PyMem_DEL(oldtable); in dictresize()
|