diff --git a/src/blocktree_processor.rs b/src/blocktree_processor.rs
index bca27f84f3..24c2d128ad 100644
--- a/src/blocktree_processor.rs
+++ b/src/blocktree_processor.rs
@@ -50,7 +50,7 @@ fn par_execute_entries(bank: &Bank, entries: &[(&Entry, Vec<Result<()>>)]) -> Re
 /// 2. Process the locked group in parallel
 /// 3. Register the `Tick` if it's available
 /// 4. Update the leader scheduler, goto 1
-fn par_process_entries_with_scheduler(bank: &Bank, entries: &[Entry]) -> Result<()> {
+fn par_process_entries(bank: &Bank, entries: &[Entry]) -> Result<()> {
     // accumulator for entries that can be processed in parallel
     let mut mt_group = vec![];
     for entry in entries {
@@ -83,7 +83,7 @@ fn par_process_entries_with_scheduler(bank: &Bank, entries: &[Entry]) -> Result<
 
 /// Process an ordered list of entries.
 pub fn process_entries(bank: &Bank, entries: &[Entry]) -> Result<()> {
-    par_process_entries_with_scheduler(bank, entries)
+    par_process_entries(bank, entries)
 }
 
 /// Process an ordered list of entries, populating a circular buffer "tail"
@@ -418,10 +418,6 @@ mod tests {
         );
     }
 
-    fn par_process_entries(bank: &Bank, entries: &[Entry]) -> Result<()> {
-        par_process_entries_with_scheduler(bank, entries)
-    }
-
     #[test]
     fn test_process_empty_entry_is_registered() {
         let (genesis_block, mint_keypair) = GenesisBlock::new(2);