1/* 2 * Copyright (c) 2005-2006 The Regents of The University of Michigan 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; --- 570 unchanged lines hidden (view full) --- 579 580template<class Impl> 581bool 582LSQ<Impl>::hasStoresToWB() 583{ 584 std::list<unsigned>::iterator threads = activeThreads->begin(); 585 std::list<unsigned>::iterator end = activeThreads->end(); 586 |
587 while (threads != end) { 588 unsigned tid = *threads++; 589 |
590 if (hasStoresToWB(tid)) 591 return true; |
592 } 593 |
594 return false; |
595} 596 597template<class Impl> 598bool 599LSQ<Impl>::willWB() 600{ 601 std::list<unsigned>::iterator threads = activeThreads->begin(); 602 std::list<unsigned>::iterator end = activeThreads->end(); 603 604 while (threads != end) { 605 unsigned tid = *threads++; 606 |
607 if (willWB(tid)) 608 return true; |
609 } 610 |
611 return false; |
612} 613 614template<class Impl> 615void 616LSQ<Impl>::dumpInsts() 617{ 618 std::list<unsigned>::iterator threads = activeThreads->begin(); 619 std::list<unsigned>::iterator end = activeThreads->end(); 620 621 while (threads != end) { 622 unsigned tid = *threads++; 623 624 thread[tid].dumpInsts(); 625 } 626} |