1/* 2 * Copyright (c) 2004-2005 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; --- 696 unchanged lines hidden (view full) --- 705 706 if (isStalled() && load_idx == stallingLoadIdx) { 707 stalled = false; 708 stallingStoreIsn = 0; 709 stallingLoadIdx = 0; 710 } 711 712 // Clear the smart pointer to make sure it is decremented. |
713 loadQueue[load_idx]->setSquashed(); |
714 loadQueue[load_idx] = NULL; 715 --loads; 716 717 // Inefficient! 718 loadTail = load_idx; 719 720 decrLdIdx(load_idx); 721 ++lsqSquashedLoads; --- 27 unchanged lines hidden (view full) --- 749 if (isStalled() && 750 storeQueue[store_idx].inst->seqNum == stallingStoreIsn) { 751 panic("Is stalled should have been cleared by stalling load!\n"); 752 stalled = false; 753 stallingStoreIsn = 0; 754 } 755 756 // Clear the smart pointer to make sure it is decremented. |
757 storeQueue[store_idx].inst->setSquashed(); |
758 storeQueue[store_idx].inst = NULL; 759 storeQueue[store_idx].canWB = 0; 760 761 storeQueue[store_idx].req = NULL; 762 --stores; 763 764 // Inefficient! 765 storeTail = store_idx; --- 210 unchanged lines hidden --- |