1/* 2 * Copyright (c) 2004-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; --- 52 unchanged lines hidden (view full) --- 61 62 //Set Max Entries to Total ROB Capacity 63 for (int i = 0; i < numThreads; i++) { 64 maxEntries[i]=numEntries; 65 } 66 67 } else if (policy == "partitioned") { 68 robPolicy = Partitioned; |
69// DPRINTF(Fetch, "ROB sharing policy set to Partitioned\n"); |
70 71 //@todo:make work if part_amt doesnt divide evenly. 72 int part_amt = numEntries / numThreads; 73 74 //Divide ROB up evenly 75 for (int i = 0; i < numThreads; i++) { 76 maxEntries[i]=part_amt; 77 } 78 79 } else if (policy == "threshold") { 80 robPolicy = Threshold; |
81// DPRINTF(Fetch, "ROB sharing policy set to Threshold\n"); |
82 83 int threshold = _smtROBThreshold;; 84 85 //Divide up by threshold amount 86 for (int i = 0; i < numThreads; i++) { 87 maxEntries[i]=threshold; 88 } 89 } else { --- 612 unchanged lines hidden --- |