From 76c60c5f9309af239f7fbe65e760e65f6c84bbe5 Mon Sep 17 00:00:00 2001 From: Korey Sewell Date: Sun, 19 Jun 2011 21:43:33 -0400 Subject: inorder: use m5_hash_map for skedCache since we dont care about if the cache of instruction schedules is sorted or not, then the hash map should be faster --- src/cpu/inorder/cpu.cc | 8 +++----- 1 file changed, 3 insertions(+), 5 deletions(-) (limited to 'src/cpu/inorder/cpu.cc') diff --git a/src/cpu/inorder/cpu.cc b/src/cpu/inorder/cpu.cc index 97748deba..bb9b5c3c6 100644 --- a/src/cpu/inorder/cpu.cc +++ b/src/cpu/inorder/cpu.cc @@ -358,10 +358,8 @@ InOrderCPU::~InOrderCPU() { delete resPool; - std::map::iterator sked_it = - skedCache.begin(); - std::map::iterator sked_end = - skedCache.end(); + SkedCacheIt sked_it = skedCache.begin(); + SkedCacheIt sked_end = skedCache.end(); while (sked_it != sked_end) { delete (*sked_it).second; @@ -370,7 +368,7 @@ InOrderCPU::~InOrderCPU() skedCache.clear(); } -std::map InOrderCPU::skedCache; +m5::hash_map InOrderCPU::skedCache; RSkedPtr InOrderCPU::createFrontEndSked() -- cgit v1.2.3