6a7
> /** Node in a linked list. */
20a22,30
> /** Array of linked list that maintains the dependencies between
> * producing instructions and consuming instructions. Each linked
> * list represents a single physical register, having the future
> * producer of the register's value, and all consumers waiting on that
> * value on the list. The head node of each linked list represents
> * the producing instruction of that register. Instructions are put
> * on the list upon reaching the IQ, and are removed from the list
> * either when the producer completes, or the instruction is squashed.
> */
26a37
> /** Default construction. Must call resize() prior to use. */
30a42
> /** Resize the dependency graph to have num_entries registers. */
32a45
> /** Clears all of the linked lists. */
34a48
> /** Inserts an instruction to be dependent on the given index. */
36a51
> /** Sets the producing instruction of a given register. */
39a55
> /** Clears the producing instruction. */
42a59
> /** Removes an instruction from a single linked list. */
44a62
> /** Removes and returns the newest dependent of a specific register. */
46a65
> /** Checks if there are any dependents on a specific register. */
61a81
> /** Number of linked lists; identical to the number of registers. */
67a88
> // Debug variable, remove when done testing.
68a90
> // Debug variable, remove when done testing.