1/*
2 * Copyright (c) 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;
9 * redistributions in binary form must reproduce the above copyright

--- 78 unchanged lines hidden (view full) ---

88 { dependGraph[idx].inst = NULL; }
89
90 /** Removes an instruction from a single linked list. */
91 void remove(PhysRegIndex idx, DynInstPtr &inst_to_remove);
92
93 /** Removes and returns the newest dependent of a specific register. */
94 DynInstPtr pop(PhysRegIndex idx);
95
96 /** Checks if there are any dependents on a specific register. */
97 bool empty(PhysRegIndex idx) { return !dependGraph[idx].next; }
98
99 /** Debugging function to dump out the dependency graph.
100 */
101 void dump();
102
103 private:
104 /** Array of linked lists. Each linked list is a list of all the
105 * instructions that depend upon a given register. The actual

--- 130 unchanged lines hidden (view full) ---

236 node->inst = NULL;
237 memAllocCounter--;
238 delete node;
239 }
240 return inst;
241}
242
243template <class DynInstPtr>
244void
245DependencyGraph<DynInstPtr>::dump()
246{
247 DepEntry *curr;
248
249 for (int i = 0; i < numEntries; ++i)
250 {
251 curr = &dependGraph[i];

--- 21 unchanged lines hidden ---