1/*
2 * Copyright (c) 2002-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;
--- 169 unchanged lines hidden (view full) ---
178 while (unitBusy[fu_idx]) {
179 fu_idx = fuPerCapList[capability].getFU();
180 if (fu_idx == start_idx) {
181 // No FU available
182 return -1;
183 }
184 }
185
186 unitBusy[fu_idx] = true;
187
188 return fu_idx;
189}
190
191void
192FUPool::freeUnitNextCycle(int fu_idx)
193{
--- 102 unchanged lines hidden ---
2 * Copyright (c) 2002-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;
--- 169 unchanged lines hidden (view full) ---
178 while (unitBusy[fu_idx]) {
179 fu_idx = fuPerCapList[capability].getFU();
180 if (fu_idx == start_idx) {
181 // No FU available
182 return -1;
183 }
184 }
185
186 unitBusy[fu_idx] = true;
187
188 return fu_idx;
189}
190
191void
192FUPool::freeUnitNextCycle(int fu_idx)
193{
--- 102 unchanged lines hidden ---