Lines Matching defs:curr
158 DepEntry *curr;
162 curr = dependGraph[i].next;
164 while (curr) {
167 prev = curr;
168 curr = prev->next;
209 DepEntry *curr = dependGraph[idx].next;
211 // Make sure curr isn't NULL. Because this instruction is being
215 if (curr == NULL) {
222 while (curr->inst != inst_to_remove) {
223 prev = curr;
224 curr = curr->next;
227 assert(curr != NULL);
231 prev->next = curr->next;
236 curr->inst = NULL;
238 delete curr;
273 DepEntry *curr;
277 curr = &dependGraph[i];
279 if (curr->inst) {
281 i, curr->inst->pcState(), curr->inst->seqNum);
286 while (curr->next != NULL) {
287 curr = curr->next;
290 curr->inst->pcState(), curr->inst->seqNum);