Lines Matching refs:Head
203 MachineOperand *const Head = HeadRef;
205 // Head points to the first list element.
207 // Prev pointers are circular, so Head->Prev == Last.
209 // Head is NULL for an empty list.
210 if (!Head) {
216 assert(MO->getReg() == Head->getReg() && "Different regs on the same list!");
218 // Insert MO between Last and Head in the circular Prev chain.
219 MachineOperand *Last = Head->Contents.Reg.Prev;
222 Head->Contents.Reg.Prev = MO;
229 MO->Contents.Reg.Next = Head;
242 MachineOperand *const Head = HeadRef;
243 assert(Head && "List already empty");
249 // Prev links are circular, next link is NULL instead of looping back to Head.
250 if (MO == Head)
255 (Next ? Next : Head)->Contents.Reg.Prev = Prev;
287 MachineOperand *&Head = getRegUseDefListHead(Src->getReg());
290 assert(Head && "List empty, but operand is chained");
294 // Head.
295 if (Src == Head)
296 Head = Dst;
301 // in a 1-element list. In that case Head == Dst.
302 (Next ? Next : Head)->Contents.Reg.Prev = Dst;
