lint

consensus/src/rand/rand_gen/block_queue.rs

@@ -6,7 +6,6 @@ use crate::{
     pipeline::buffer_manager::OrderedBlocks,
 };
 use aptos_consensus_types::{common::Round, pipelined_block::PipelinedBlock};
-use aptos_logger::info;
 use aptos_reliable_broadcast::DropGuard;
 use aptos_types::randomness::{RandMetadata, Randomness};
 use std::collections::{BTreeMap, HashMap};
@@ -86,26 +85,19 @@ impl QueueItem {
 
 /// Maintain ordered blocks that have pending randomness
 pub struct BlockQueue {
-    pub queue: BTreeMap<Round, QueueItem>,
+    queue: BTreeMap<Round, QueueItem>,
 }
 impl BlockQueue {
-    pub fn log_summary(&self) {
-        let min_round = self.queue.keys().min().copied();
-        let max_round = self.queue.keys().max().copied();
-        info!(
-            "block_queue_summary, size={}, min_round={:?}, max_round={:?}",
-            self.queue.len(),
-            min_round,
-            max_round
-        );
-    }
-
     pub fn new() -> Self {
         Self {
             queue: BTreeMap::new(),
         }
     }
 
+    pub fn queue(&self) -> &BTreeMap<Round, QueueItem> {
+        &self.queue
+    }
+
     pub fn push_back(&mut self, item: QueueItem) {
         for block in item.blocks() {
             observe_block(block.timestamp_usecs(), BlockStage::RAND_ENTER);

consensus/src/rand/rand_gen/rand_manager.rs

@@ -412,14 +412,7 @@ impl<S: TShare, D: TAugmentedData> RandManager<S, D> {
     }
 
     pub fn observe_queue(&self) {
-        let queue = &self.block_queue.queue;
+        let queue = &self.block_queue.queue();
         RAND_QUEUE_SIZE.set(queue.len() as i64);
-        info!(
-            epoch = self.epoch_state.epoch,
-            queue_size = queue.len(),
-            min_round = queue.keys().min().copied(),
-            max_round = queue.keys().max().copied(),
-            "Rand queue summary.",
-        );
     }
 }