Searched refs:oldhash (Results 1 – 10 of 10) sorted by relevance
109 #define oldhash(sp) ((sp)->oldhash) macro244 if (newhash(sp)[i] == oldhash(sp)[i + shift] in grow_hunks()264 if (newhash(sp)[i] == oldhash(sp)[i + shift] in grow_hunks()297 if (oldhash(SP_PARM)) { in NCURSES_SP_NAME()298 FreeAndNull(oldhash(SP_PARM)); in NCURSES_SP_NAME()306 if (oldhash(SP_PARM) && newhash(SP_PARM)) { in NCURSES_SP_NAME()314 if (oldhash(SP_PARM) == NULL) in NCURSES_SP_NAME()315 oldhash(SP_PARM) = typeCalloc(unsigned long, in NCURSES_SP_NAME()320 if (!oldhash(SP_PARM) || !newhash(SP_PARM)) { in NCURSES_SP_NAME()321 FreeAndNull(oldhash(SP_PARM)); in NCURSES_SP_NAME()[all …]
1272 if (SP_PARM->oldhash && SP_PARM->newhash) { in ClrBottom()1274 SP_PARM->oldhash[row] = SP_PARM->newhash[row]; in ClrBottom()1324 if (SP_PARM->oldhash && SP_PARM->newhash) in TransformLine()1325 SP_PARM->oldhash[lineno] = SP_PARM->newhash[lineno]; in TransformLine()
428 uint64_t oldhash; in grow_hashtable() local459 oldhash = oldmd->neighborhoods[oldi].entries[oldj].hash; in grow_hashtable()460 newi = oldhash & newmd->neighborhood_mask; in grow_hashtable()465 newmd->neighborhoods[newi].entries[newj].hash = oldhash; in grow_hashtable()
419 if (SP_PARM->oldhash) { in NCURSES_SP_NAME()420 FreeAndNull(SP_PARM->oldhash); in NCURSES_SP_NAME()
205 FreeIfNeeded(sp->oldhash); in delscreen()662 sp->oldhash = NULL; in NCURSES_SP_NAME()
551 int oldverbose, oldhash, oldprogress, fd; in remglob() local586 oldhash = hash; in remglob()601 hash = oldhash; in remglob()
775 int oldverbose, oldhash; in remglob() local807 oldhash = hash, hash = 0; in remglob()816 verbose = oldverbose; hash = oldhash; in remglob()
1196 struct uma_hash oldhash; in zone_timeout() local1210 oldhash = keg->uk_hash; in zone_timeout()1213 oldhash = newhash; in zone_timeout()1216 hash_free(&oldhash); in zone_timeout()1283 hash_expand(struct uma_hash *oldhash, struct uma_hash *newhash) in hash_expand() argument1292 if (oldhash->uh_hashsize >= newhash->uh_hashsize) in hash_expand()1300 for (idx = 0; idx < oldhash->uh_hashsize; idx++) in hash_expand()1301 while (!LIST_EMPTY(&oldhash->uh_slab_hash[idx])) { in hash_expand()1302 slab = LIST_FIRST(&oldhash->uh_slab_hash[idx]); in hash_expand()
1181 unsigned long *oldhash, *newhash; member
13242 + improve integration of hashmap scrolling code, by adding oldhash and