gaspersic/solana
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

list -> slot_list (#23355)

Browse Source
This commit is contained in:
Jeff Washington (jwash)
2022-02-27 23:08:58 -06:00
committed by GitHub
parent 186bb19965
commit 30dafc7135
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
runtime/src/in_mem_accounts_index.rs
View File

@@ -469,7 +469,7 @@ impl<T: IndexValue> InMemAccountsIndex<T> {
/// or, 'account_info' is appended to the slot list if the slot did not exist previously.
/// returns true if caller should addref
fn update_slot_list(
list: &mut SlotList<T>,
slot_list: &mut SlotList<T>,
slot: Slot,
account_info: T,
_other_slot: Option<Slot>,
@@ -479,20 +479,20 @@ impl<T: IndexValue> InMemAccountsIndex<T> {
let mut addref = !account_info.is_cached();
// find other dirty entries from the same slot
for list_index in 0..list.len() {
let (s, previous_update_value) = &list[list_index];
for list_index in 0..slot_list.len() {
let (s, previous_update_value) = &slot_list[list_index];
if *s == slot {
let previous_was_cached = previous_update_value.is_cached();
addref = addref && previous_was_cached;
let mut new_item = (slot, account_info);
std::mem::swap(&mut new_item, &mut list[list_index]);
std::mem::swap(&mut new_item, &mut slot_list[list_index]);
if previous_slot_entry_was_cached {
assert!(previous_was_cached);
} else {
reclaims.push(new_item);
}
list[(list_index + 1)..]
slot_list[(list_index + 1)..]
.iter()
.for_each(|item| assert!(item.0 != slot));
return addref;
@@ -500,7 +500,7 @@ impl<T: IndexValue> InMemAccountsIndex<T> {
}
// if we make it here, we did not find the slot in the list
list.push((slot, account_info));
slot_list.push((slot, account_info));
addref
}